{"id":"https://openalex.org/W7160712822","doi":"https://doi.org/10.1007/s10707-026-00576-0","title":"Efficient algorithms for top-k range search on weighted interval data","display_name":"Efficient algorithms for top-k range search on weighted interval data","publication_year":2026,"publication_date":"2026-05-09","ids":{"openalex":"https://openalex.org/W7160712822","doi":"https://doi.org/10.1007/s10707-026-00576-0"},"language":"en","primary_location":{"id":"doi:10.1007/s10707-026-00576-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10707-026-00576-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10707-026-00576-0.pdf","source":{"id":"https://openalex.org/S4210168194","display_name":"GeoInformatica","issn_l":"1384-6175","issn":["1384-6175","1573-7624"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GeoInformatica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10707-026-00576-0.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066566244","display_name":"J H Lee","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Jimin Lee","raw_affiliation_strings":["Graduate School of Information Science and Technology, The University of Osaka, 1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, The University of Osaka, 1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009228302","display_name":"Daichi Amagata","orcid":"https://orcid.org/0000-0001-8571-4931"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Daichi Amagata","raw_affiliation_strings":["Graduate School of Information Science and Technology, The University of Osaka, 1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science and Technology, The University of Osaka, 1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5009228302"],"corresponding_institution_ids":["https://openalex.org/I98285908"],"apc_list":{"value":3190,"currency":"USD","value_usd":3190},"apc_paid":{"value":3190,"currency":"USD","value_usd":3190},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.54789526,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"1","first_page":"18","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.6060000061988831,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.6060000061988831,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.12269999831914902,"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"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.03819999843835831,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.723800003528595},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.6743999719619751},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5676000118255615},{"id":"https://openalex.org/keywords/baseline","display_name":"Baseline (sea)","score":0.5202999711036682},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4551999866962433},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4302000105381012},{"id":"https://openalex.org/keywords/data-set","display_name":"Data set","score":0.40799999237060547},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.37380000948905945}],"concepts":[{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.723800003528595},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.6743999719619751},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5676000118255615},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5375000238418579},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5311999917030334},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.5202999711036682},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4564000070095062},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4551999866962433},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4302000105381012},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.40799999237060547},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.37380000948905945},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36059999465942383},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.3540000021457672},{"id":"https://openalex.org/C2778869765","wikidata":"https://www.wikidata.org/wiki/Q6028363","display_name":"Inefficiency","level":2,"score":0.3370000123977661},{"id":"https://openalex.org/C2983220686","wikidata":"https://www.wikidata.org/wiki/Q951437","display_name":"Interval data","level":3,"score":0.30640000104904175},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3028999865055084},{"id":"https://openalex.org/C204259536","wikidata":"https://www.wikidata.org/wiki/Q787903","display_name":"Linear search","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C191252586","wikidata":"https://www.wikidata.org/wiki/Q1671453","display_name":"Interval arithmetic","level":3,"score":0.251800000667572}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10707-026-00576-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10707-026-00576-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10707-026-00576-0.pdf","source":{"id":"https://openalex.org/S4210168194","display_name":"GeoInformatica","issn_l":"1384-6175","issn":["1384-6175","1573-7624"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GeoInformatica","raw_type":"journal-article"},{"id":"pmh:oai:irdb.nii.ac.jp:01056:0007426365","is_oa":true,"landing_page_url":"https://hdl.handle.net/11094/105116","pdf_url":null,"source":{"id":"https://openalex.org/S7407056385","display_name":"Institutional Repositories DataBase (IRDB)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I184597095","host_organization_name":"National Institute of Informatics","host_organization_lineage":["https://openalex.org/I184597095"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"GeoInformatica","raw_type":"journal article"}],"best_oa_location":{"id":"doi:10.1007/s10707-026-00576-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10707-026-00576-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10707-026-00576-0.pdf","source":{"id":"https://openalex.org/S4210168194","display_name":"GeoInformatica","issn_l":"1384-6175","issn":["1384-6175","1573-7624"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GeoInformatica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G383876021","display_name":"Developing AI-assisted distributed systems for spatio-temporal data","funder_award_id":"24K14961","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320322451","display_name":"Osaka University","ror":"https://ror.org/035t8zc32"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7160712822.pdf","grobid_xml":"https://content.openalex.org/works/W7160712822.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W1571941879","https://openalex.org/W1858509911","https://openalex.org/W1969877208","https://openalex.org/W1979155652","https://openalex.org/W2008196645","https://openalex.org/W2031289540","https://openalex.org/W2045422966","https://openalex.org/W2049761335","https://openalex.org/W2092954093","https://openalex.org/W2097280721","https://openalex.org/W2130651051","https://openalex.org/W2133926502","https://openalex.org/W2135993142","https://openalex.org/W2136267788","https://openalex.org/W2158194525","https://openalex.org/W2165558283","https://openalex.org/W2425200475","https://openalex.org/W2428543019","https://openalex.org/W2746166321","https://openalex.org/W2751785830","https://openalex.org/W2968745999","https://openalex.org/W3106889243","https://openalex.org/W3155308728","https://openalex.org/W3175228669","https://openalex.org/W4210466590","https://openalex.org/W4226432765","https://openalex.org/W4239601290","https://openalex.org/W4242599275","https://openalex.org/W4281779420","https://openalex.org/W4285267120","https://openalex.org/W4300915185","https://openalex.org/W4379056279","https://openalex.org/W4384661158","https://openalex.org/W4386204732","https://openalex.org/W4400909517","https://openalex.org/W4401666219","https://openalex.org/W4406162498","https://openalex.org/W4411403349","https://openalex.org/W4413360815","https://openalex.org/W4415147895","https://openalex.org/W4415149552"],"related_works":[],"abstract_inverted_index":{"Weighted":[0],"intervals":[1,47,56,92],"are":[2,7,17,29,80],"ubiquitous,":[3],"because":[4,85],"many":[5],"objects":[6],"associated":[8,119],"with":[9,48,117],"temporal":[10],"and":[11,22,70,110,170,191],"numeric":[12],"dimensions.":[13],"As":[14],"interval":[15,27,42,78],"datasets":[16],"usually":[18],"large,":[19],"efficient":[20],"management":[21],"processing":[23],"of":[24,36,55,138,155,178],"large":[25],"weighted":[26,41],"data":[28,79,114],"required.":[30],"This":[31],"article":[32],"addresses":[33],"the":[34,49,136,141,156,192],"problem":[35],"top-k":[37,157],"range":[38,75,158],"search":[39,76,89,159],"on":[40,77,188],"data,":[43],"which":[44],"retrieves":[45],"k":[46],"largest":[50],"weight":[51],"among":[52],"a":[53,58,95,107,152,175],"set":[54],"overlapping":[57],"given":[59,96],"query":[60,97],"interval.":[61,98],"It":[62],"finds":[63],"important":[64],"analytical":[65],"applications":[66],"for":[67,74,82,90],"vehicles,":[68],"events,":[69],"cryptocurrencies.":[71],"Existing":[72],"algorithms":[73,169,197],"inefficient":[81],"this":[83,101,163],"problem,":[84],"they":[86],"need":[87],"to":[88,173],"all":[91],"that":[93,195],"overlap":[94],"To":[99,161],"overcome":[100],"inefficiency":[102],"issue,":[103],"we":[104,150,166],"first":[105,122],"provide":[106],"baseline":[108,199],"algorithm":[109,124],"then":[111],"propose":[112],"three":[113],"structures,":[115],"along":[116],"their":[118],"algorithms.":[120],"Our":[121],"proposed":[123],"is":[125,135],"practically":[126],"fast":[127],"but":[128],"requires":[129],"$$\\varvec{O(n\\log":[130,146,181],"k)}$$":[131,147,182],"time,":[132],"where":[133],"n":[134],"number":[137],"intervals,":[139],"whereas":[140],"others":[142],"require":[143],"less":[144,179],"than":[145,180],"time.":[148],"Furthermore,":[149],"address":[151],"duration-constrained":[153],"variant":[154,164],"problem.":[160],"solve":[162],"efficiently,":[165],"extend":[167],"our":[168,196],"present":[171],"how":[172],"maintain":[174],"time":[176],"complexity":[177],".":[183],"We":[184],"conduct":[185],"extensive":[186],"experiments":[187],"real-world":[189],"datasets,":[190],"results":[193],"show":[194],"outperform":[198],"techniques":[200],"in":[201],"most":[202],"cases.":[203]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2026-05-10T00:00:00"}