{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T21:56:22Z","timestamp":1716674182068},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,9,14]],"date-time":"2012-09-14T00:00:00Z","timestamp":1347580800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10707-012-0169-4","type":"journal-article","created":{"date-parts":[[2012,9,13]],"date-time":"2012-09-13T00:43:27Z","timestamp":1347497007000},"page":"543-565","source":"Crossref","is-referenced-by-count":10,"title":["The k closest pairs in spatial databases"],"prefix":"10.1007","volume":"17","author":[{"given":"Gilberto","family":"Guti\u00e9rrez","sequence":"first","affiliation":[]},{"given":"Pablo","family":"S\u00e1ez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,14]]},"reference":[{"key":"169_CR1","unstructured":"Blott S, Weber R (1997) A simple vector-approximation file for similarity search in high-dimensional vector spaces. Technical report, Institute of Information Systems, ETH Zentrum, Zurich, Switzerland"},{"key":"169_CR2","first-page":"237","volume-title":"ACM SIGMOD conference on management of data","author":"T Brinkhoff","year":"1993","unstructured":"Brinkhoff T, Kriegel H-P, Seeger B (1993) Efficient processing of spatial joins using R-trees. In: ACM SIGMOD conference on management of data. ACM, Washington, DC, pp\u00a0237\u2013246"},{"key":"169_CR3","unstructured":"Corral A (2002) Algoritmos para el procesamiento de consultas espaciales utilizando R-trees. La consulta de los pares m\u00e1s cercanos y su aplicaci\u00f3n en bases de datos espaciales. PhD thesis, Universidad de Almer\u00eda, Escuela Polit\u00e9cnica Superior, Espa\u00f1a"},{"key":"169_CR4","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:2207\u20132237","journal-title":"Inf Sci"},{"issue":"1","key":"169_CR5","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":"169_CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1145\/342009.335414","volume-title":"SIGMOD \u201900: proceedings of the 2000 ACM SIGMOD international conference on management of data","author":"A Corral","year":"2000","unstructured":"Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M (2000) Closest pair queries in spatial databases. In: SIGMOD \u201900: proceedings of the 2000 ACM SIGMOD international conference on management of data. ACM Press, New York, pp\u00a0189\u2013200"},{"key":"169_CR7","doi-asserted-by":"crossref","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 (2006) Cost models for distance joins queries using r-trees. Data Knowl Eng 57:1\u201336","journal-title":"Data Knowl Eng"},{"issue":"2","key":"169_CR8","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":"169_CR9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/ICDE.1993.344078","volume-title":"Proceedings of the 9th international conference on data engineering","author":"O G\u00fcnther","year":"1993","unstructured":"G\u00fcnther O (1993) Efficient computation of spatial joins. In: Proceedings of the 9th international conference on data engineering. IEEE Computer Society., Washington, DC, pp\u00a050\u201359"},{"key":"169_CR10","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: ACM SIGMOD conference on management of data. ACM, pp\u00a047\u201357","DOI":"10.1145\/971697.602266"},{"key":"169_CR11","unstructured":"Hjaltason GR, Samet H (1998) Incremental distance join algorithms for spatial databases. In: ACM SIGMOD conference on management of data. Seattle, WA, pp\u00a0237\u2013248"},{"key":"169_CR12","unstructured":"Huang Y-W, Jing N, Rundensteiner EA (1997) A cost model for estimating the performance of spatial joins using R-trees. In: SSDBM, pp\u00a030\u201338"},{"key":"169_CR13","unstructured":"Jacox EH, Samet H (2007) Spatial join techniques. ACM Trans Database Syst 32"},{"issue":"1","key":"169_CR14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TKDE.2003.1161591","volume":"15","author":"N Mamoulis","year":"2003","unstructured":"Mamoulis N, Papadias D (2003) Slot index spatial join. IEEE Trans Knowl Data Eng 15(1):211\u2013231","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"169_CR15","first-page":"209","volume-title":"ACM SIGMOD conference on management of data","author":"L Ming-Ling","year":"1994","unstructured":"Ming-Ling L, Chinya R (1994) Spatial joins using seeded trees. In: ACM SIGMOD conference on management of data. Minneapolis, Minnesota, pp\u00a0209\u2013220"},{"key":"169_CR16","first-page":"247","volume-title":"ACM SIGMOD conference on management of data","author":"L Ming-Ling","year":"1996","unstructured":"Ming-Ling L, Chinya R (1996) Spatial hash-joins. In: ACM SIGMOD conference on management of data. Montreal, Canada, pp\u00a0247\u2013258"},{"key":"169_CR17","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1145\/233269.233338","volume-title":"SIGMOD \u201996: Proceedings of the 1996 ACM SIGMOD international conference on Management of data","author":"JM Patel","year":"1996","unstructured":"Patel JM, DeWitt DJ (1996) Partition based spatial-merge join. In: SIGMOD \u201996: Proceedings of the 1996 ACM SIGMOD international conference on Management of data. ACM Press, New York, pp\u00a0259\u2013270"},{"key":"169_CR18","first-page":"178","volume-title":"Proceedings of the XXIX international conference of the Chilean computer science society","author":"M Pincheira","year":"2010","unstructured":"Pincheira M, Gutierrez G, Gajardo L (2010) Closest pair query on spatial data sets without index. In: Ochoa SF, Meza F, Mery D, Cubillos C (eds) Proceedings of the XXIX international conference of the Chilean computer science society. IEEE Computer Society, Antofagasta, pp\u00a0178\u2013182, 15\u201319 November 2010"},{"key":"169_CR19","first-page":"99","volume-title":"Proceedings of the 2008 the 9th international conference on web-age information management, WAIM \u201908","author":"S Qiao","year":"2008","unstructured":"Qiao S, Tang C, Peng J, Li H, Ni S (2008) Efficient k-closest-pair range-queries in spatial databases. In: Proceedings of the 2008 the 9th international conference on web-age information management, WAIM \u201908. IEEE Computer Society, Washington, DC, pp\u00a099\u2013104"},{"key":"169_CR20","unstructured":"Sang-Wook K, Wan-Sup C, Min-Jae L, Kyu-Young W (1995) A new algorithm for processing joins using the multilevel grid file. In: Proceedings of the 4th international conference on database systems for advanced applications (DASFAA). World Scientific Press, pp\u00a0115\u2013123"},{"key":"169_CR21","doi-asserted-by":"crossref","unstructured":"Shan J, Zhang D, Salzberg B (2003) On spatial-range closest-pair query. In: Hadzilacos T, Manolopoulos Y, Roddick J, Theodoridis Y (eds) Advances in spatial and temporal databases, vol\u00a02750. Lecture notes in computer science. Springer, pp\u00a0252\u2013269","DOI":"10.1007\/978-3-540-45072-6_15"},{"key":"169_CR22","unstructured":"Shekhar S, Chawla S (2003) Spatial databases\u2014a tour. Prentice Hall"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-012-0169-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-012-0169-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-012-0169-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T16:42:52Z","timestamp":1562172172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-012-0169-4"}},"subtitle":["When only one set is indexed"],"short-title":[],"issued":{"date-parts":[[2012,9,14]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["169"],"URL":"https:\/\/doi.org\/10.1007\/s10707-012-0169-4","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,14]]}}}