{"id":"https://openalex.org/W7155697574","doi":"https://doi.org/10.4230/lipics.swat.2026.23","title":"Indexing Range Maximum-Sum Segment Queries with Offsets","display_name":"Indexing Range Maximum-Sum Segment Queries with Offsets","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7155697574","doi":"https://doi.org/10.4230/lipics.swat.2026.23"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26059","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.23","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.23","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138183141","display_name":"Seungbum Jo","orcid":"https://orcid.org/0000-0002-8644-3691"},"institutions":[{"id":"https://openalex.org/I196345858","display_name":"Chungnam National University","ror":"https://ror.org/0227as991","country_code":"KR","type":"education","lineage":["https://openalex.org/I196345858"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jo, Seungbum","raw_affiliation_strings":["Chungnam National University, Daejeon, Republic of Korea"],"raw_orcid":"https://orcid.org/0000-0002-8644-3691","affiliations":[{"raw_affiliation_string":"Chungnam National University, Daejeon, Republic of Korea","institution_ids":["https://openalex.org/I196345858"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5138159442","display_name":"Dominik K\u00f6ppl","orcid":"https://orcid.org/0000-0002-8721-4444"},"institutions":[{"id":"https://openalex.org/I66906201","display_name":"University of Yamanashi","ror":"https://ror.org/059x21724","country_code":"JP","type":"education","lineage":["https://openalex.org/I66906201"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"K\u00f6ppl, Dominik","raw_affiliation_strings":["University of Yamanashi, Kofu, Japan"],"raw_orcid":"https://orcid.org/0000-0002-8721-4444","affiliations":[{"raw_affiliation_string":"University of Yamanashi, Kofu, Japan","institution_ids":["https://openalex.org/I66906201"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.63339644,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.4749999940395355,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.4749999940395355,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.20399999618530273,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.12070000171661377,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.8185999989509583},{"id":"https://openalex.org/keywords/offset","display_name":"Offset (computer science)","score":0.5763999819755554},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.5120000243186951},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.44600000977516174},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.42289999127388},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.4172999858856201},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.38659998774528503},{"id":"https://openalex.org/keywords/boolean-conjunctive-query","display_name":"Boolean conjunctive query","score":0.3785000145435333}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.8185999989509583},{"id":"https://openalex.org/C175291020","wikidata":"https://www.wikidata.org/wiki/Q1156822","display_name":"Offset (computer science)","level":2,"score":0.5763999819755554},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5486000180244446},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.5120000243186951},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4763000011444092},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.44600000977516174},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.42289999127388},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.4172999858856201},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.38659998774528503},{"id":"https://openalex.org/C24755975","wikidata":"https://www.wikidata.org/wiki/Q4943354","display_name":"Boolean conjunctive query","level":5,"score":0.3785000145435333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35580000281333923},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.34209999442100525},{"id":"https://openalex.org/C99016210","wikidata":"https://www.wikidata.org/wiki/Q5488129","display_name":"Query expansion","level":2,"score":0.33340001106262207},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.3287000060081482},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3197000026702881},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.31150001287460327},{"id":"https://openalex.org/C130590232","wikidata":"https://www.wikidata.org/wiki/Q1671754","display_name":"Inverted index","level":3,"score":0.30160000920295715},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2773999869823456},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C59276292","wikidata":"https://www.wikidata.org/wiki/Q580427","display_name":"Database index","level":3,"score":0.2705000042915344},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2694000005722046},{"id":"https://openalex.org/C172722865","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial query","level":5,"score":0.26339998841285706},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.25189998745918274}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26059","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.23","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.swat.2026.23","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.23","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26059","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.23","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"an":[1,106],"array":[2,61,100],"of":[3,40,77,123,161,198],"n":[4],"real":[5],"numbers,":[6],"the":[7,21,25,38,51,66,75,86,115,159],"maximum":[8],"segment":[9],"sum":[10],"(MSS)":[11],"problem":[12,27,157],"is":[13,111,193],"to":[14],"find":[15],"a":[16,55,94,121,168,195],"contiguous":[17],"subarray":[18],"that":[19,172,191],"has":[20],"largest":[22],"sum.":[23],"While":[24],"MSS":[26,52,67,87],"can":[28,142],"be":[29,143],"solved":[30],"optimally":[31],"with":[32],"Kadane\u2019s":[33],"algorithm":[34],"in":[35,137,145,158,174],"O(n)":[36],"time,":[37,140],"study":[39,74,154],"its":[41],"indexing":[42],"version":[43],"spawned":[44],"new":[45],"extensions":[46],"such":[47],"as":[48],"(a)":[49,80,119,171],"retrieving":[50,65,85],"after":[53,92],"subtracting":[54,93],"query":[56,70,90,95,109,188],"offset":[57,96],"parameter":[58,97],"for":[59,68,88,98,118,170,186],"all":[60,99],"entries":[62],"or":[63],"(b)":[64],"arbitrary":[69,89],"ranges.":[71],"We":[72],"here":[73],"combination":[76],"both":[78],"problems":[79],"and":[81,141,165,178],"(b),":[82],"which":[83],"requires":[84],"ranges":[91],"entries.":[101],"For":[102],"that,":[103],"we":[104,153,181],"present":[105],"index":[107,129],"whose":[108],"time":[110],"only":[112,194],"slower":[113],"than":[114],"best":[116],"known":[117],"by":[120],"factor":[122],"O(log":[124],"n).":[125],"In":[126],"detail,":[127],"our":[128,155,187],"uses":[130],"O(n":[131,146],"log":[132],"n)":[133,139,148],"space,":[134],"supports":[135],"queries":[136],"O(log\u00b2":[138],"constructed":[144],"log\u00b3":[147],"time.":[149,179],"As":[150],"side":[151],"results,":[152],"combined":[156],"context":[160],"run-length":[162,175],"compressed":[163,176],"input,":[164],"also":[166],"deduce":[167],"solution":[169],"works":[173],"space":[177],"Finally":[180],"give":[182],"supportive":[183],"lower":[184],"bounds":[185],"problem,":[189],"showing":[190],"there":[192],"polylogarithmic":[196],"gap":[197],"improvement":[199],"left.":[200]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-27T00:00:00"}