{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T03:53:27Z","timestamp":1763092407711,"version":"3.37.3"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,2,27]],"date-time":"2016-02-27T00:00:00Z","timestamp":1456531200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"European Regional Development Fund and Greek National Funds","award":["11SYN 8 1213"],"award-info":[{"award-number":["11SYN 8 1213"]}]},{"name":"European Regional Development Fund and Greek National Funds","award":["11SYN 8 1213"],"award-info":[{"award-number":["11SYN 8 1213"]}]},{"name":"European Regional Development Fund and Greek National Funds","award":["11SYN 8 1213"],"award-info":[{"award-number":["11SYN 8 1213"]}]},{"name":"European Regional Development Fund and Greek National Funds","award":["11SYN 8 1213"],"award-info":[{"award-number":["11SYN 8 1213"]}]},{"name":"MINECO research project","award":["TIN2013-41576-R"],"award-info":[{"award-number":["TIN2013-41576-R"]}]},{"name":"Junta de Andalucia research project","award":["P10-TIC-6114"],"award-info":[{"award-number":["P10-TIC-6114"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s10707-016-0246-1","type":"journal-article","created":{"date-parts":[[2016,2,27]],"date-time":"2016-02-27T00:37:31Z","timestamp":1456533451000},"page":"571-628","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["New plane-sweep algorithms for distance-based join queries in spatial databases"],"prefix":"10.1007","volume":"20","author":[{"given":"George","family":"Roumelis","sequence":"first","affiliation":[]},{"given":"Antonio","family":"Corral","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2256-5523","authenticated-orcid":false,"given":"Michael","family":"Vassilakopoulos","sequence":"additional","affiliation":[]},{"given":"Yannis","family":"Manolopoulos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,27]]},"reference":[{"key":"246_CR1","doi-asserted-by":"crossref","unstructured":"Roumelis G, Vassilakopoulos M, Corral A, Manolopoulos Y (2014) A new plane-sweep algorithm for the k-closest-pairs query. In: SOFSEM conference, pp 478\u2013490","DOI":"10.1007\/978-3-319-04298-5_42"},{"issue":"4","key":"246_CR2","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF01231602","volume":"3","author":"RH G\u00fcting","year":"1994","unstructured":"G\u00fcting R H (1994) An introduction to spatial database systems. VLDB J 3 (4):357\u2013399","journal-title":"VLDB J"},{"key":"246_CR3","unstructured":"Shekhar S, Chawla S (2003) Spatial databases - a tour. Prentice Hall"},{"issue":"2","key":"246_CR4","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede V, G\u00fcnther O (1998) Multidimensional access methods. ACM Comput Surv 30(2):170\u2013231","journal-title":"ACM Comput Surv"},{"key":"246_CR5","doi-asserted-by":"crossref","unstructured":"Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M (2000) Closest pair queries in spatial databases. In: SIGMOD conference, pp 189\u2013200","DOI":"10.1145\/335191.335414"},{"issue":"1","key":"246_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.datak.2003.08.007","volume":"49","author":"A Corral","year":"2004","unstructured":"Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M (2004) Algorithms for processing k-closest-pair queries in spatial databases. Data Knowl Eng 49(1):67\u2013104","journal-title":"Data Knowl Eng"},{"key":"246_CR7","doi-asserted-by":"crossref","unstructured":"Preparata FP, Shamos MI (1985) Computational geometry - an introduction. Springer","DOI":"10.1007\/978-1-4612-1098-6"},{"issue":"5","key":"246_CR8","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0020-0190(88)90150-0","volume":"26","author":"K Hinrichs","year":"1988","unstructured":"Hinrichs K, Nievergelt J, Schorn P (1988) Plane-sweep solves the closest pair problem elegantly. Inf Process Lett 26(5):255\u2013261","journal-title":"Inf Process Lett"},{"issue":"1","key":"246_CR9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/1206049.1206056","volume":"32","author":"EH Jacox","year":"2007","unstructured":"Jacox EH, Samet H (2007) Spatial join techniques. ACM Trans Database Syst 32(1):7","journal-title":"ACM Trans Database Syst"},{"issue":"6","key":"246_CR10","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1109\/TKDE.2003.1245293","volume":"15","author":"H Shin","year":"2003","unstructured":"Shin H, Moon B, Lee S (2003) Adaptive and incremental processing for distance join queries. IEEE Trans Knowl Data Eng 15(6):1561\u20131578","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"246_CR11","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The r*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD conference, pp 322\u2013331","DOI":"10.1145\/93605.98741"},{"issue":"3","key":"246_CR12","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/937598.937600","volume":"28","author":"EH Jacox","year":"2003","unstructured":"Jacox E H, Samet H (2003) Iterative spatial join. ACM Trans Database Syst 28(3):230\u2013256","journal-title":"ACM Trans Database Syst"},{"key":"246_CR13","unstructured":"Arge L, Procopiuc O, Ramaswamy S, Suel T, Vitter J S (1998) Scalable sweeping-based spatial join. In: VLDB conference, pp 570\u2013581"},{"key":"246_CR14","doi-asserted-by":"crossref","unstructured":"Gurret C, Rigaux P (2000) The sort\/sweep algorithm: a new method for r-tree based spatial joins. In: SSDBM conference, pp 153\u2013165","DOI":"10.1109\/SSDM.2000.869785"},{"key":"246_CR15","unstructured":"Roumelis G, Corral A, Vassilakopoulos M, Manolopoulos Y (2014) New plane-sweep algorithms for distance-based join queries in spatial databases, Tech. Rep. TR-01-2014, Data Eng. Lab, AUTH, Greece, http:\/\/delab.csd.auth.gr\/~michalis\/TR-01-2014.pdf"},{"key":"246_CR16","doi-asserted-by":"crossref","unstructured":"Hjaltason G R, Samet H (1998) Incremental distance join algorithms for spatial databases. In: SIGMOD conference, pp 237\u2013248","DOI":"10.1145\/276305.276326"},{"key":"246_CR17","volume-title":"Spatial databases - with applications to GIS","author":"P Rigaux","year":"2002","unstructured":"Rigaux P, Scholl M, Voisard A (2002) Spatial databases - with applications to GIS. Elsevier, San Francisco"},{"key":"246_CR18","volume-title":"Foundations of multidimensional and metric data structures","author":"H Samet","year":"2007","unstructured":"Samet H (2007) Foundations of multidimensional and metric data structures. Morgan Kaufmann, San Francisco"},{"key":"246_CR19","doi-asserted-by":"crossref","unstructured":"Nobari S, Tauheed F, Heinis T, Karras P, Bressan S, Ailamaki A (2013) TOUCH: in-memory spatial join by hierarchical data-oriented partitioning. In: SIGMOD conference, pp 701\u2013712","DOI":"10.1145\/2463676.2463700"},{"issue":"14","key":"246_CR20","first-page":"1882","volume":"6","author":"B Sowell","year":"2013","unstructured":"Sowell B, Salles MAV, Cao T, Demers AJ, Gehrke J (2013) An experimental analysis of iterated spatial joins in main memory. PVLDB 6(14):1882\u20131893","journal-title":"PVLDB"},{"issue":"1","key":"246_CR21","first-page":"97","volume":"8","author":"D Sidlauskas","year":"2014","unstructured":"Sidlauskas D, Jensen CS (2014) Spatial joins in main memory Implementation matters! PVLDB 8(1):97\u2013100","journal-title":"PVLDB"},{"issue":"7","key":"246_CR22","doi-asserted-by":"crossref","first-page":"1920","DOI":"10.1109\/TKDE.2015.2427795","volume":"27","author":"H Zhang","year":"2015","unstructured":"Zhang H, Chen G, Ooi B C, Tan K, Zhang M (2015) Inmemory big data management and processing: a survey. IEEE Trans Knowl Data Eng 27(7):1920\u20131948","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"246_CR23","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1145\/503099.503101","volume":"26","author":"N Mamoulis","year":"2001","unstructured":"Mamoulis N, Papadias D (2001) Multiway spatial joins. ACM Trans Database Syst 26(4):424\u2013475","journal-title":"ACM Trans Database Syst"},{"key":"246_CR24","doi-asserted-by":"crossref","unstructured":"Brinkhoff T, Kriegel H-P, Seeger B (1993) Efficient processing of spatial joins using r-trees. In: SIGMOD conference, pp 237\u2013246","DOI":"10.1145\/170036.170075"},{"key":"246_CR25","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: SIGMOD conference, pp 47\u201357","DOI":"10.1145\/602259.602266"},{"key":"246_CR26","doi-asserted-by":"crossref","unstructured":"Lo M-L, Ravishankar CV (1996) Spatial hash-joins. In: SIGMOD conference, pp 247\u2013258","DOI":"10.1145\/235968.233337"},{"key":"246_CR27","doi-asserted-by":"crossref","unstructured":"Patel JM, DeWitt DJ (1996) Partition based spatial-merge join. In: SIGMOD conference, pp 259\u2013270","DOI":"10.1145\/235968.233338"},{"key":"246_CR28","doi-asserted-by":"crossref","unstructured":"Smid M (2000) Closest-point problems in computational geometry. In: Sack J-R, Urrutia J (eds) Handbook of computational geometry. Elsevier, Ch 20, pp 877\u2013935","DOI":"10.1016\/B978-044482537-7\/50021-8"},{"issue":"11","key":"246_CR29","doi-asserted-by":"crossref","first-page":"2207","DOI":"10.1016\/j.ins.2006.12.012","volume":"177","author":"A Corral","year":"2007","unstructured":"Corral A, Almendros-Jim\u00e9nez JM (2007) A Performance comparison of distance-based query algorithms using r-trees in spatial databases. Inf Sci 177 (11):2207\u20132237","journal-title":"Inf Sci"},{"issue":"7","key":"246_CR30","doi-asserted-by":"crossref","first-page":"1014","DOI":"10.1109\/TKDE.2009.141","volume":"22","author":"YJ Kim","year":"2010","unstructured":"Kim YJ, Patel JM (2010) Performance comparison of the r*-tree and the quadtree for knn and distance join queries. IEEE Trans Knowl Data Eng 22(7):1014\u20131027","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"246_CR31","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s10707-012-0169-4","volume":"17","author":"G Guti\u00e9rrez","year":"2013","unstructured":"Guti\u00e9rrez G, S\u00e1ez P (2013) The k closest pairs in spatial databases when only one set is indexed. GeoInformatica 17(4):543\u2013565","journal-title":"GeoInformatica"},{"key":"246_CR32","unstructured":"Weber R, Schek H-J, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB conference, pp 194\u2013205"},{"issue":"1","key":"246_CR33","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/69.842246","volume":"12","author":"N Koudas","year":"2000","unstructured":"Koudas N, Sevcik KC (2000) High dimensional similarity joins: algorithms and performance evaluation. IEEE Trans Knowl Data Eng 12(1):3\u201318","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"246_CR34","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1109\/TKDE.2003.1209007","volume":"15","author":"EPF Chan","year":"2003","unstructured":"Chan E P F (2003) Buffer queries . IEEE Trans Knowl Data Eng 15(4):895\u2013910","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"246_CR35","unstructured":"Yang C, Lin K-I (2002) An index structure for improving nearest closest pairs and related join queries in spatial databases. In: IDEAS conference, pp 140\u2013149"},{"issue":"3","key":"246_CR36","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.datak.2004.08.003","volume":"53","author":"F Angiulli","year":"2005","unstructured":"Angiulli F, Pizzuti C (2005) An approximate algorithm for top-k closest pairs join query in large high dimensional data. Data Knowl Eng 53(3):263\u2013281","journal-title":"Data Knowl Eng"},{"issue":"2","key":"246_CR37","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1093\/comjnl\/bxh060","volume":"48","author":"A Corral","year":"2005","unstructured":"Corral A, Vassilakopoulos M (2005) On approximate algorithms for distance-based queries using r-trees. Comput J 48(2):220\u2013238","journal-title":"Comput J"},{"key":"246_CR38","doi-asserted-by":"crossref","unstructured":"Shan J, Zhang D, Salzberg B (2003) On spatial-range closest-pair query. In: SSTD conference, pp 252\u2013269","DOI":"10.1007\/978-3-540-45072-6_15"},{"issue":"12","key":"246_CR39","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1109\/TKDE.2008.85","volume":"20","author":"LH U","year":"2008","unstructured":"ULH, Mamoulis N, Yiu ML (2008) Computation and monitoring of exclusive closest pairs. IEEE Trans Knowl Data Eng 20(12):1641\u20131654","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"246_CR40","doi-asserted-by":"crossref","unstructured":"Cheema MA, Lin X, Wang H, Wang J, Zhang W (2011) A unified approach for computing top-k pairs in multidimensional space. In: ICDE conference, pp 1031\u20131042","DOI":"10.1109\/ICDE.2011.5767903"},{"issue":"3","key":"246_CR41","doi-asserted-by":"crossref","first-page":"21:1","DOI":"10.1145\/2629477","volume":"39","author":"D Choi","year":"2014","unstructured":"Choi D, Chung C, Tao Y (2014) Maximizing range sum in external memory. ACM Trans. Database Syst. 39(3):21:1\u201321:44","journal-title":"ACM Trans. Database Syst."},{"key":"246_CR42","doi-asserted-by":"crossref","unstructured":"Shou Y, Mamoulis N, Cao H, Papadias D, Cheung D W (2003) Evaluation of iceberg distance joins. In: SSTD conference, pp 270\u2013288","DOI":"10.1007\/978-3-540-45072-6_16"},{"issue":"6","key":"246_CR43","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1007\/s10115-003-0122-9","volume":"6","author":"C B\u00f6hm","year":"2004","unstructured":"B\u00f6hm C, Krebs F (2004) The k-nearest neighbour join: turbo charging the kdd process. Knowl Inf Syst 6(6):728\u2013749","journal-title":"Knowl Inf Syst"},{"key":"246_CR44","unstructured":"Zhang J, Mamoulis N, Papadias D, Tao Y (2004) All-nearest-neighbors queries in spatial databases. In: SSDBM conference, pp 297\u2013306"},{"key":"246_CR45","doi-asserted-by":"crossref","unstructured":"Bryan B, Eberhardt F, Faloutsos C (2008) Compact similarity joins. In: ICDE conference, pp 346\u2013 355","DOI":"10.1109\/ICDE.2008.4497443"},{"issue":"2","key":"246_CR46","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/152610.152611","volume":"25","author":"G Graefe","year":"1993","unstructured":"Graefe G (1993) Query evaluation techniques for large databases. ACM Comput Surv 25(2):73\u2013 170","journal-title":"ACM Comput Surv"},{"issue":"9","key":"246_CR47","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal A, Vitter JS (1988) The input\/output complexity of sorting and related problems. Commun ACM 31(9):1116\u20131127","journal-title":"Commun ACM"},{"key":"246_CR48","doi-asserted-by":"crossref","unstructured":"Leutenegger ST, Edgington JM, Lopez MA (1997) Str: a simple and efficient algorithm for r-tree packing. In: ICDE conference, pp 497\u2013506","DOI":"10.1109\/ICDE.1997.582015"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-016-0246-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-016-0246-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-016-0246-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-016-0246-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:17:03Z","timestamp":1559240223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-016-0246-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,27]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["246"],"URL":"https:\/\/doi.org\/10.1007\/s10707-016-0246-1","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[2016,2,27]]}}}