{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T15:58:54Z","timestamp":1769270334258,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540296737","type":"print"},{"value":"9783540320913","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11573036_1","type":"book-chapter","created":{"date-parts":[[2005,10,24]],"date-time":"2005-10-24T10:06:19Z","timestamp":1130148379000},"page":"1-13","source":"Crossref","is-referenced-by-count":1,"title":["Closest Pair Queries with Spatial Constraints"],"prefix":"10.1007","author":[{"given":"Apostolos N.","family":"Papadopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandros","family":"Nanopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Manolopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an Efficient and Robust Access Method for Points and Rectangles. In: Proc. ACM SIGMOD, Atlantic City, NJ, May 1990, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Bohm, C., Krebs, F.: Supporting KDD Applications by the K-Nearest Neighbor Join. In: Proceedings of the 14th International Conference on Database and Expert System Applications (DEXA 2003), Prague, Czech Republic, pp. 504\u2013516 (2003)","DOI":"10.1007\/978-3-540-45227-0_50"},{"key":"1_CR3","unstructured":"Bohm, C., Krebs, F.: The k-Nearest Neighbor Join: Turbo Charging the KDD Process. Knowledge and Information Systems, KAIS (2004)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Breunig, M.M., Kriegel, H.-P., Ng, R.T., Sander, J.: LOF: Identifying Density-Based Local Outliers. In: Proceedings of the ACM International Conference on the Management of Data (SIGMOD 2000), Dallas, TX, pp. 93\u2013104 (2000)","DOI":"10.1145\/342009.335388"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Brinkhoff, T., Kriegel, H.P., Seeger, B.: Efficient Processing of Spatial Joins Using R-trees. In: Proceedings of the ACM International Conference on Management of Data (SIGMOD 1993), Washington, D.C, May 1993, pp. 237\u2013246 (1993)","DOI":"10.1145\/170035.170075"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Closest Pair Queries in Spatial Databases. In: Proceedings of the ACM International Conference on the Management of Data (SIGMOD 2000), Dallas, TX (2000)","DOI":"10.1145\/342009.335414"},{"issue":"1","key":"1_CR7","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 and Knowledge Engineering (DKE)\u00a049(1), 67\u2013104 (2004)","journal-title":"Data and Knowledge Engineering (DKE)"},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/351827.351829","volume":"5","author":"D. Eppstein","year":"2000","unstructured":"Eppstein, D.: Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. Journal of Experimental Algorithmics\u00a05(1), 1\u201323 (2000)","journal-title":"Journal of Experimental Algorithmics"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Hjaltason, G.R., Samet, H.: Incremental Distance Join Algorithms for Spatial Databases. In: Proceedings of ACM SIGMOD Conference, pp. 237\u2013248 (1998)","DOI":"10.1145\/276304.276326"},{"issue":"8","key":"1_CR10","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Han, E.-H., Kumar, V.: Chameleon: Hierarchical Clustering Using Dynamic Modeling. Computer\u00a032(8), 68\u201375 (1999)","journal-title":"Computer"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Mishra, P., Eich, M.H.: Join Processing in Relational Databases. ACM Computing Surveys\u00a024(1) (1992)","DOI":"10.1145\/128762.128764"},{"key":"1_CR12","unstructured":"Nanopoulos, A., Theodoridis, Y., Manolopoulos, Y.: C2P: Clustering Based on Closest Pairs. In: Proceedings of the 27th International Conference on Very Large Databases (VLDB 2001), Roma, Italy (2001)"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Shan, J., Zhang, D., Salzberg, B.: On Spatial-Range Closest-Pair Query. In: Proceedings of the 8th International Symposium on Spatial and Temporal Databases (SSTD 2003), Santorini, Greece, pp. 252\u2013269 (2003)","DOI":"10.1007\/978-3-540-45072-6_15"},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1109\/69.979979","volume":"14","author":"K. Shim","year":"2002","unstructured":"Shim, K., Srikant, R., Agrawal, R.: High-Dimensional Similarity Joins. IEEE Transactions on Knowledge and Data Engineering (TKDE)\u00a014(1), 156\u2013171 (2002)","journal-title":"IEEE Transactions on Knowledge and Data Engineering (TKDE)"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Shin, H., Moon, B., Lee, S.: Adaptive Multi-Stage Distance Join Processing. In: Proceedings of the ACM SIGMOD Conference, pp. 343\u2013354 (2000)","DOI":"10.1145\/342009.335428"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Shou, Y., Mamoulis, N., Cao, H., Papadias, D., Cheung, D.W.: Evaluation of Iceberg Distance Joins. In: Proceedings of the 8th International Symposium on Spatial and Temporal Databases (SSTD 2003), Santorini, Greece, pp. 270\u2013278 (2003)","DOI":"10.1007\/978-3-540-45072-6_16"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D.: Time-Parameterized Queries in Spatio-Temporal Databases. In: Proceedings of the ACM International Conference on the Management of Data (SIGMOD 2002), pp. 334\u2013345 (2002)","DOI":"10.1145\/564691.564730"},{"key":"1_CR18","unstructured":"TIGER\/Line Files, 1994 Technical Documentation \/ prepared by the Bureau of the Census, Washington, DC (1994)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Xia, C., Lu, H., Ooi, B.C., Hu, J.: GORDER: An Efficient Method for KNN Processing. In: Proceedings of the 30th International Conference on Very Large Data Bases (VLDB 2004), Toronto, Canada, pp. 756\u2013767 (2004)","DOI":"10.1016\/B978-012088469-8\/50067-X"},{"key":"1_CR20","unstructured":"Zhang, J., Mamoulis, N., Papadias, D., Tao, Y.: All-Nearest-Neighbors Queries in Spatial Databases. In: Proceedings of the 16th International Conference on Scientific and Statistical Databases (SSDBM 2004), Santorini, Greece, pp. 297\u2013306 (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11573036_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:55:56Z","timestamp":1605642956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11573036_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540296737","9783540320913"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11573036_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}