{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T06:47:21Z","timestamp":1792133241035,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":15,"publisher":"Springer New York","isbn-type":[{"value":"9781461482666","type":"print"},{"value":"9781461482659","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-1-4614-8265-9_67","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T06:54:32Z","timestamp":1544079272000},"page":"469-475","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Closest-Pair Query"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Corral","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Vassilakopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"67_CR3224","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel HP, Schneider R, Seeger B. The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1990. p. 322\u201331.","DOI":"10.1145\/93597.98741"},{"issue":"6","key":"67_CR3225","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/s10115-003-0122-9","volume":"6","author":"C B\u00f6hm","year":"2004","unstructured":"B\u00f6hm C, Krebs F. The k-nearest neighbour join: turbo charging the KDD process. Knowl Inform Syst. 2004;6(6):728\u201349.","journal-title":"Knowl Inform Syst"},{"issue":"4","key":"67_CR3226","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1109\/TKDE.2003.1209007","volume":"15","author":"EPF Chan","year":"2003","unstructured":"Chan EPF. Buffer queries. IEEE Trans Knowl Data Eng. 2003;15(4):895\u2013910.","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"67_CR3227","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/335191.335414","volume":"29","author":"Antonio Corral","year":"2000","unstructured":"Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M. Closest pair queries in spatial databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2000. p. 189\u2013200.","journal-title":"ACM SIGMOD Record"},{"issue":"1","key":"67_CR3228","doi-asserted-by":"publisher","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. Algorithms for processing K-closest-pair queries in spatial databases. Data Knowl Eng. 2004;49(1):67\u2013104.","journal-title":"Data Knowl Eng"},{"issue":"4","key":"67_CR3229","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1023\/B:GEIN.0000040832.25622.8d","volume":"8","author":"A Corral","year":"2004","unstructured":"Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M. Multi-way distance join queries in spatial databases. GeoInformatica. 2004;8(4):373\u2013402.","journal-title":"GeoInformatica"},{"issue":"1","key":"67_CR3230","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.datak.2005.03.004","volume":"57","author":"A Corral","year":"2006","unstructured":"Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M. Cost models for distance joins queries using R-trees. Data Knowl Eng. 2006;57(1):1\u201336.","journal-title":"Data Knowl Eng"},{"issue":"2","key":"67_CR3231","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/276305.276326","volume":"27","author":"G\u00edsli R. Hjaltason","year":"1998","unstructured":"Hjaltason GR, Samet H. Incremental distance join algorithms for spatial databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1998. p. 237\u201348.","journal-title":"ACM SIGMOD Record"},{"key":"67_CR3232","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1016\/B978-012088469-8.50073-5","volume-title":"Proceedings 2004 VLDB Conference","author":"Glenn S. Iwerks","year":"2004","unstructured":"Iwerks GS, Samet H, Smith K. Maintenance of spatial semijoin queries on moving points. In: Proceedings of the 30th International Conference on Very Large Data Bases; 2004. p. 828\u201339."},{"key":"67_CR3233","unstructured":"Nanopoulos A, Theodoridis Y, Manolopoulos Y. C2P: clustering based on closest pairs. In: Proceedings of the 27th International Conference on Very Large Data Bases; 2001. p. 331\u201340."},{"issue":"3","key":"67_CR3234","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1093\/comjnl\/bxl002","volume":"49","author":"AN Papadopoulos","year":"2006","unstructured":"Papadopoulos AN, Nanopoulos A, Manolopoulos Y. Processing distance join queries with constraints. Comput J. 2006;49(3):281\u201396.","journal-title":"Comput J"},{"issue":"2","key":"67_CR3235","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1145\/335191.335428","volume":"29","author":"Hyoseop Shin","year":"2000","unstructured":"Shin H, Moon B, Lee S. Adaptive multi-stage distance join processing. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2000. p. 343\u201354.","journal-title":"ACM SIGMOD Record"},{"key":"67_CR3236","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-540-45072-6_16","volume-title":"Advances in Spatial and Temporal Databases","author":"Yutao Shou","year":"2003","unstructured":"Shou Y, Mamoulis N, Cao H, Papadias D, Cheung D.W. Evaluation of iceberg distance joins. In: Proceedings of the 8th International Symposium Advances in Spatial and Temporal Databases; 2003. p.~270\u201388."},{"key":"67_CR3237","unstructured":"Yang C, Lin K. An index structure for improving closest pairs and related join queries in spatial databases. In: Proceedings of the International Conference on Database Engineering and Applications; 2002. p. 140\u201349."},{"key":"67_CR3238","unstructured":"Zhu M, Lee DL, Zhang J. k-closest pair query monitoring over moving objects. In: Proceedings of the 3rd International Conference on Mobile Data Management; 2002. p. 14\u201314."}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-8265-9_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T06:16:04Z","timestamp":1792131364000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4614-8265-9_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9781461482666","9781461482659"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-8265-9_67","relation":{},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}