{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T03:05:26Z","timestamp":1794366326026,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"value":"9780387355443","type":"print"},{"value":"9780387399409","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-39940-9_67","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T04:49:49Z","timestamp":1253076589000},"page":"368-373","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","reference":[{"key":"67_CR1_67","doi-asserted-by":"crossref","unstructured":"Beckmann N., Kriegel H.P., Schneider R., and Seeger B. The R*-tree: an efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1990, pp. 322\u2013331.","DOI":"10.1145\/93597.98741"},{"issue":"6","key":"67_CR2_67","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. and Krebs F. The k-nearest neighbour join: Turbo charging the KDD process. Knowl. Inform. Syst., 6(6):728\u2013749, 2004.","journal-title":"Knowl. Inform. Syst."},{"issue":"4","key":"67_CR3_67","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1109\/TKDE.2003.1209007","volume":"15","author":"E.P.F. Chan","year":"2003","unstructured":"Chan E.P.F. Buffer queries. IEEE Trans. Knowl. Data Eng., 15(4):895\u2013910, 2003.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"67_CR4_67","doi-asserted-by":"crossref","unstructured":"Corral A., Manolopoulos Y., Theodoridis Y., and Vassilakopoulos M. Closest pair queries in spatial databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2000, pp. 189\u2013200.","DOI":"10.1145\/342009.335414"},{"issue":"1","key":"67_CR5_67","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., and Vassilakopoulos M. Algorithms for processing K-closest-pair queries in spatial databases. Data Knowl. Eng., 49(1):67\u2013104, 2004.","journal-title":"Data Knowl. Eng."},{"issue":"4","key":"67_CR6_67","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., and Vassilakopoulos M. Multi-way distance join queries in spatial databases. GeoInformatica, 8(4):373\u2013402, 2004.","journal-title":"GeoInformatica"},{"issue":"1","key":"67_CR7_67","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., and Vassilakopoulos M. Cost models for distance joins queries using R-trees. Data Knowl. Eng., 57(1):1\u201336, 2006.","journal-title":"Data Knowl. Eng."},{"key":"67_CR8_67","doi-asserted-by":"crossref","unstructured":"Hjaltason G.R. and Samet H. Incremental distance join algorithms for spatial databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 1998, pp. 237\u2013248.","DOI":"10.1145\/276304.276326"},{"key":"67_CR9_67","doi-asserted-by":"crossref","unstructured":"Iwerks G.S., Samet H., and Smith K. Maintenance of spatial semijoin queries on moving points. In Proc. 30th Int. Conf. on Very Large Data Bases, 2004, pp. 828\u2013839.","DOI":"10.1016\/B978-012088469-8.50073-5"},{"key":"67_CR10_67","unstructured":"Nanopoulos A., Theodoridis Y., and Manolopoulos Y. C2P: clustering based on closest pairs. In Proc. 27th Int. Conf. on Very Large Data Bases, 2001, pp. 331\u2013340."},{"issue":"3","key":"67_CR11_67","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1093\/comjnl\/bxl002","volume":"49","author":"A.N. Papadopoulos","year":"2006","unstructured":"Papadopoulos A.N., Nanopoulos A., and Manolopoulos Y. Processing distance join queries with constraints. Comput. J., 49(3):281\u2013296, 2006.","journal-title":"Comput. J."},{"key":"67_CR12_67","doi-asserted-by":"crossref","unstructured":"Shin H., Moon B., and Lee S. Adaptive multi-stage distance join processing. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 2000, pp. 343\u2013354.","DOI":"10.1145\/342009.335428"},{"key":"67_CR13_67","doi-asserted-by":"crossref","unstructured":"Shou Y., Mamoulis N., Cao H., Papadias D., and Cheung D.W. Evaluation of iceberg distance joins. In Proc. 8th Int. Symp. Advances in Spatial and Temporal Databases, 2003, pp. 270\u2013288.","DOI":"10.1007\/978-3-540-45072-6_16"},{"key":"67_CR14_67","unstructured":"Yang C. and Lin K. An index structure for improving closest pairs and related join queries in spatial databases. In Proc. Int. Conf. on Database Eng. and Applications, 2002, pp. 140\u2013149."},{"key":"67_CR15_67","unstructured":"Zhu M., Lee D.L., and Zhang J. k-closest pair query monitoring over moving objects. In Proc. 3rd Int. Conf. on Mobile Data Management, 2002, pp. 14\u201314."}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-39940-9_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T18:14:49Z","timestamp":1792001689000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-39940-9_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387355443","9780387399409"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9_67","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2009]]}}}