{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T17:30:08Z","timestamp":1785605408300,"version":"3.56.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T00:00:00Z","timestamp":1778284800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T00:00:00Z","timestamp":1778284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100004206","name":"The University of Osaka","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004206","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s10707-026-00576-0","type":"journal-article","created":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T05:21:22Z","timestamp":1778304082000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient algorithms for top-k range search on weighted interval data"],"prefix":"10.1007","volume":"30","author":[{"given":"Jimin","family":"Lee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daichi","family":"Amagata","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"576_CR1","doi-asserted-by":"crossref","unstructured":"Amagata D (2024) Independent range sampling on interval data. In: ICDE, pp 449\u2013461","DOI":"10.1109\/ICDE60146.2024.00041"},{"key":"576_CR2","doi-asserted-by":"crossref","unstructured":"Amagata D, Yamada J, Ji Y, Hara T (2024) Efficient algorithms for top-k stabbing queries on weighted interval data. In: DEXA","DOI":"10.1007\/978-3-031-68309-1_12"},{"key":"576_CR3","doi-asserted-by":"crossref","unstructured":"Amagata D, Yamada J, Ji Y, Hara T (2024) Efficient algorithms for top-k stabbing queries on weighted interval data (full version). arXiv preprint arXiv:2405.05601","DOI":"10.1007\/978-3-031-68309-1_12"},{"key":"576_CR4","doi-asserted-by":"crossref","unstructured":"Kaplan H, Molad E, Tarjan RE (2003) Dynamic rectangular intersection with priorities. In: STOC, pp 639\u2013648","DOI":"10.1145\/780542.780635"},{"key":"576_CR5","doi-asserted-by":"crossref","unstructured":"Qiao M, Gan J, Tao Y (2016) Range thresholding on streams. In: SIGMOD, pp 571\u2013582","DOI":"10.1145\/2882903.2915965"},{"key":"576_CR6","doi-asserted-by":"crossref","unstructured":"Zhang Z, Gan J, Bao Z, Kazemi SMH, Chen G, Zhu F (2022) Approximate range thresholding. In: SIGMOD, pp 1108\u20131121","DOI":"10.1145\/3514221.3526123"},{"key":"576_CR7","doi-asserted-by":"crossref","unstructured":"Christodoulou G, Bouros P, Mamoulis N (2022) Hint: A hierarchical index for intervals in main memory. In: SIGMOD, pp 1257\u20131270","DOI":"10.1145\/3514221.3517873"},{"key":"576_CR8","doi-asserted-by":"crossref","unstructured":"Christodoulou G, Bouros P, Mamoulis N (2023) Hint: a hierarchical interval index for allen relationships. The VLDB Journal, pp 1\u201328","DOI":"10.1007\/s00778-023-00798-w"},{"key":"576_CR9","doi-asserted-by":"crossref","unstructured":"Behrend A, Dign\u00f6s A, Gamper J, Schmiegelt P, Voigt H, Rottmann M, Kahl K (2019) Period index: A learned 2d hash index for range and duration queries. In: SSTD, pp 100\u2013109","DOI":"10.1145\/3340964.3340965"},{"key":"576_CR10","doi-asserted-by":"crossref","unstructured":"Kaufmann M, Manjili AA, Vagenas P, Fischer PM, Kossmann D, F\u00e4rber F, May N (2013) Timeline index: a unified data structure for processing queries on temporal data in sap hana. In: SIGMOD, pp 1173\u20131184","DOI":"10.1145\/2463676.2465293"},{"key":"576_CR11","doi-asserted-by":"crossref","unstructured":"Hu X, Qiao M, Tao Y (2014) Independent range sampling. In: PODS, pp 246\u2013255","DOI":"10.1145\/2594538.2594545"},{"key":"576_CR12","unstructured":"Afshani P, Phillips JM (2019) Independent range sampling, revisited again. In: SoCG"},{"key":"576_CR13","unstructured":"Afshani P, Wei Z (2017) Independent range sampling, revisited. In: ESA"},{"key":"576_CR14","doi-asserted-by":"crossref","unstructured":"Xie D, Phillips JM, Matheny M, Li F (2021) Spatial independent range sampling. In: SIGMOD, pp 2023\u20132035","DOI":"10.1145\/3448016.3452806"},{"key":"576_CR15","doi-asserted-by":"crossref","unstructured":"Amagata D (2024) Independent range sampling on interval data (longer version). arXiv preprint arXiv:2405.08315","DOI":"10.1109\/ICDE60146.2024.00041"},{"key":"576_CR16","doi-asserted-by":"crossref","unstructured":"Aoyama K, Amagata D, Fujita S, Hara T (2023) Simpler is much faster: Fair and independent inner product search. In: SIGIR, pp 2379\u20132383","DOI":"10.1145\/3539618.3592061"},{"key":"576_CR17","doi-asserted-by":"crossref","unstructured":"Bouros P, Mamoulis N (2025) Relevance queries for interval data. In: Proceedings of the ACM on Management of Data 3(3):1\u201326","DOI":"10.1145\/3725343"},{"key":"576_CR18","unstructured":"Edelsbrunner H (1980) Dynamic Rectangle Intersection Searching"},{"issue":"12","key":"576_CR19","doi-asserted-by":"publisher","first-page":"2859","DOI":"10.1109\/TKDE.2014.2316807","volume":"26","author":"S Rahul","year":"2014","unstructured":"Rahul S, Janardan R (2014) A general technique for top-$$k$$ geometric intersection query problems. IEEE Trans Knowl Data Eng 26(12):2859\u20132871","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"9","key":"576_CR20","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley JL (1975) Multidimensional binary search trees used for associative searching. Commun ACM 18(9):509\u2013517","journal-title":"Commun ACM"},{"key":"576_CR21","doi-asserted-by":"crossref","unstructured":"Amagata D, Lee J (2025) Top-$$k$$ range search on weighted interval data. In: SSTD","DOI":"10.1145\/3748777.3748778"},{"key":"576_CR22","doi-asserted-by":"crossref","unstructured":"Amagata D (2025) Random sampling over spatial range joins. In: ICDE, pp 2080\u20132093","DOI":"10.1109\/ICDE65448.2025.00158"},{"key":"576_CR23","doi-asserted-by":"crossref","unstructured":"Ceccarello M, Dign\u00f6s A, Gamper J, Khnaisser C (2023) Indexing temporal relations for range-duration queries. In: SSDBM, pp 1\u201312","DOI":"10.1145\/3603719.3603732"},{"issue":"1","key":"576_CR24","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s10619-024-07452-6","volume":"43","author":"M Ceccarello","year":"2025","unstructured":"Ceccarello M, Dign\u00f6s A, Gamper J, Khnaisser C (2025) Indexing temporal relations for range-duration queries. Distributed and Parallel Databases 43(1):7","journal-title":"Distributed and Parallel Databases"},{"issue":"11","key":"576_CR25","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.14778\/3137628.3137644","volume":"10","author":"P Bouros","year":"2017","unstructured":"Bouros P, Mamoulis N (2017) A forward scan based plane sweep algorithm for parallel interval joins. Proceedings of the VLDB 10(11):1346\u20131357","journal-title":"Proceedings of the VLDB"},{"key":"576_CR26","unstructured":"Mark dB, Otfried C, Marc vK, Mark O (2008) Computational Geometry: Algorithms and Applications"},{"key":"576_CR27","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.is.2017.08.005","volume":"71","author":"J Xu","year":"2017","unstructured":"Xu J, Lu H (2017) Efficiently answer top-k queries on typed intervals. Inf Syst 71:164\u2013181","journal-title":"Inf Syst"},{"key":"576_CR28","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.tcs.2020.11.034","volume":"854","author":"N Ibtehaz","year":"2021","unstructured":"Ibtehaz N, Kaykobad M, Rahman MS (2021) Multidimensional segment trees can do range updates in poly-logarithmic time. Theoret Comput Sci 854:30\u201343","journal-title":"Theoret Comput Sci"},{"key":"576_CR29","unstructured":"Agarwal PK, Arge L, Yi K (2005) An optimal dynamic interval stabbing-max data structure? In: SODA, pp 803\u2013812"},{"issue":"4","key":"576_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3546074","volume":"18","author":"S Rahul","year":"2022","unstructured":"Rahul S, Tao Y (2022) Generic techniques for building top-k structures. ACM Trans Algorithms 18(4):1\u201323","journal-title":"ACM Trans Algorithms"},{"key":"576_CR31","doi-asserted-by":"crossref","unstructured":"Rahul S, Tao Y (2016) Efficient top-k indexing via general reductions. In: PODS, pp 277\u2013288","DOI":"10.1145\/2902251.2902290"},{"issue":"4","key":"576_CR32","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/2094114.2094126","volume":"40","author":"F F\u00e4rber","year":"2012","unstructured":"F\u00e4rber F, Cha SK, Primsch J, Bornh\u00f6vd C, Sigg S, Lehner W (2012) Sap hana database: Data management for modern business applications. SIGMOD Record 40(4):45\u201351","journal-title":"SIGMOD Record"},{"key":"576_CR33","doi-asserted-by":"crossref","unstructured":"Wang K, Moti MH, Papadias D (2025) Tide: Indexing time intervals by duration and endpoint. In: SSTD, pp 207\u2013217","DOI":"10.1145\/3748777.3748785"},{"key":"576_CR34","doi-asserted-by":"crossref","unstructured":"Amagata D, Hara T, Nishio S (2015) Distributed top-k query processing on multi-dimensional data with keywords. In: SSDBM, pp 10\u201311012","DOI":"10.1145\/2791347.2791355"},{"issue":"4","key":"576_CR35","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/s00778-022-00729-1","volume":"31","author":"D Amagata","year":"2022","unstructured":"Amagata D, Onizuka M, Hara T (2022) Fast, exact, and parallel-friendly outlier detection algorithms with proximity graph in metric spaces. VLDB J 31(4):797\u2013821","journal-title":"VLDB J"},{"key":"576_CR36","doi-asserted-by":"crossref","unstructured":"Taniguchi R, Amagata D, Hara T (2022) Efficient retrieval of top-k weighted spatial triangles. In: DASFAA, pp 224\u2013231","DOI":"10.1007\/978-3-031-00123-9_17"},{"key":"576_CR37","doi-asserted-by":"publisher","first-page":"55298","DOI":"10.1109\/ACCESS.2022.3177620","volume":"10","author":"R Taniguchi","year":"2022","unstructured":"Taniguchi R, Amagata D, Hara T (2022) Efficient retrieval of top-k weighted triangles on static and dynamic spatial data. IEEE Access 10:55298\u201355307","journal-title":"IEEE Access"},{"issue":"11","key":"576_CR38","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.14778\/2350229.2350257","volume":"5","author":"J Jestes","year":"2012","unstructured":"Jestes J, Phillips JM, Li F, Tang M (2012) Ranking large temporal data. Proceedings of the VLDB Endowment 5(11):1412\u20131423","journal-title":"Proceedings of the VLDB Endowment"},{"key":"576_CR39","doi-asserted-by":"crossref","unstructured":"Afshani P, Brodal GS, Zeh N (2011) Ordered and unordered top-k range reporting in large data sets. In: SODA, pp 390\u2013400","DOI":"10.1137\/1.9781611973082.31"},{"key":"576_CR40","doi-asserted-by":"crossref","unstructured":"Brodal GS, Fagerberg R, Greve M, L\u00f3pez-Ortiz A (2009) Online sorted range reporting. In: ISSAC, pp 173\u2013182","DOI":"10.1007\/978-3-642-10631-6_19"},{"key":"576_CR41","doi-asserted-by":"crossref","unstructured":"Tao Y (2014) A dynamic i\/o-efficient structure for one-dimensional top-k range reporting. In: PODS, pp 256\u2013265","DOI":"10.1145\/2594538.2594543"},{"key":"576_CR42","doi-asserted-by":"crossref","unstructured":"Sheng C, Tao Y (2012) Dynamic top-k range reporting in external memory. In: PODS, pp 121\u2013130","DOI":"10.1145\/2213556.2213576"},{"key":"576_CR43","doi-asserted-by":"crossref","unstructured":"Sheng C, Tao Y (2011) New results on two-dimensional orthogonal range aggregation in external memory. In: PODS, pp 129\u2013139","DOI":"10.1145\/1989284.1989297"},{"key":"576_CR44","doi-asserted-by":"crossref","unstructured":"Rahul S, Tao Y (2015) On top-k range reporting in 2d space. In: PODS, pp 265\u2013275","DOI":"10.1145\/2745754.2745777"},{"key":"576_CR45","doi-asserted-by":"crossref","unstructured":"Rahul S, Gupta P, Janardan R, Rajan KS (2011) Efficient top-k queries for orthogonal ranges. In: WALCOM, pp 110\u2013121","DOI":"10.1007\/978-3-642-19094-0_13"},{"key":"576_CR46","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: A dynamic index structure for spatial searching. In: SIGMOD, pp 47\u201357","DOI":"10.1145\/971697.602266"},{"issue":"1","key":"576_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"RA Finkel","year":"1974","unstructured":"Finkel RA, Bentley JL (1974) Quad trees a data structure for retrieval on composite keys. Acta Informatica 4(1):1\u20139","journal-title":"Acta Informatica"},{"key":"576_CR48","doi-asserted-by":"crossref","unstructured":"Eltabakh MY, Eltarras R, Aref WG (2006) Space-partitioning trees in postgresql: Realization and performance. In: ICDE, pp 100\u2013113","DOI":"10.1109\/ICDE.2006.146"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-026-00576-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10707-026-00576-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-026-00576-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T02:53:05Z","timestamp":1782096785000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10707-026-00576-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,9]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["576"],"URL":"https:\/\/doi.org\/10.1007\/s10707-026-00576-0","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,9]]},"assertion":[{"value":"22 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"18"}}