{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:56:22Z","timestamp":1767239782766},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405351"},{"type":"electronic","value":"9783540450726"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45072-6_15","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T13:23:33Z","timestamp":1294493013000},"page":"252-269","source":"Crossref","is-referenced-by-count":25,"title":["On Spatial-Range Closest-Pair Query"],"prefix":"10.1007","author":[{"given":"Jing","family":"Shan","sequence":"first","affiliation":[]},{"given":"Donghui","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Betty","family":"Salzberg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Oracle8 spatial cartridge, http:\/\/technet.oracle.com\/products\/oracle8\/info\/sdods\/xsdo7ds.htm"},{"key":"15_CR2","unstructured":"IBM informix spatial datablade module, http:\/\/www-3.ibm.com\/software\/data\/informix\/pubs\/specsheets\/SWSEC27152000D.pdf"},{"key":"15_CR3","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: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data (1990)","DOI":"10.1145\/93597.98741"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Ertl, B., Keim, D.A., Kriegel, H.-P., Seidl, T.: Fast nearest neighbor search in high-dimensional space. In: Proceedings of the 14th International Conference on Data Engineering, ICDE (1998)","DOI":"10.1109\/ICDE.1998.655779"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos. M.: Closest pair queries in spatial databases. Technical Report, Aristotle Univ. of Thessaloniki, Greece (1999), http:\/\/delab.csd.auth.gr\/~michaliz\/cpq.html","DOI":"10.1145\/335191.335414"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Closest pair queries in spatial databases. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data (2000)","DOI":"10.1145\/342009.335414"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Dietzfelbinger, M., Hagerup, T., Katajainen, J., Penttonen, M.: A reliable randomized algorithm for the closest-pair problem. Journal of Algorithms\u00a025(1) (1997)","DOI":"10.1006\/jagm.1997.0873"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Gaede, V., G\u00fcnther, O.: Multidimensional access methods. ACM Computing Surveys\u00a030(2) (1998)","DOI":"10.1145\/280277.280279"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data (1984)","DOI":"10.1145\/602259.602266"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Hjaltason, G.R., Samet, H.: Incremental distance join algorithms for spatial databases. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data, Seattle, WA, USA (1998)","DOI":"10.1145\/276304.276326"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Transactions on Database Systems, TODS (June 1999)","DOI":"10.1145\/320248.320255"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Katayama, N., Satoh, S.: The SR-tree: An index structure for high-dimensional nearest neighbor queries. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data (1997)","DOI":"10.1145\/253260.253347"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Kollios, G., Gunopulos, D., Tsotras, V.J.: Nearest neighbor queries in a mobile environment. In: Proceedings of the International Workshop on Spatio-Temporal Database Management, pp. 119\u2013134 (1999)","DOI":"10.1007\/3-540-48344-6_7"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data (2000)","DOI":"10.1145\/342009.335415"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelly, S., Vincent, F.: Nearest neighbor queries. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data (1995)","DOI":"10.1145\/223784.223794"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Seidl, T., Kriegel, H.-P.: Optimal multi-step k-nearest neighbor search. In: Proceedings of ACM\/SIGMOD Annual Conference on Management of Data (1998)","DOI":"10.1145\/276304.276319"},{"key":"15_CR17","volume-title":"Handbook on Computational Geometry","author":"M. Smid","year":"1997","unstructured":"Smid, M.: Closest point problems in computational geometry. In: Sack, J.-R., Urrutia, J. (eds.) Handbook on Computational Geometry. Elsevier Science Publishing, Amsterdam (1997)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Song, Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: Proceedings of the 7th International Symposium on Spatial and Temporal Databases, pp. 79\u201396 (2001)","DOI":"10.1007\/3-540-47724-1_5"},{"key":"15_CR19","unstructured":"Stanoi, I., Agrawal, D., Abbadi, A.E.: Reverse nearest neighbor queries for dynamic databases. In: Proceedings of the ACM SIGMOD Workshop on Research Issu in Data Mining and Knowledge Discovery (2000)"},{"key":"15_CR20","unstructured":"van den Bercken, J., Dittrich, J.-P., Blohsfeld, B., Kr\u00e4mer, J., Sch\u00e4fer, T., Schneider, M., Seeger, B.: XXL- a library arrproach to supporting efficient implementations of advanced database queries. In: Proceedings of the 27th VLDB Conference (2001)"},{"key":"15_CR21","unstructured":"Yang, C., Lin, K.: An index structure for improving closest pairs and related join queries in spatial databses. In: Proceedings of the International Database Engineering and Applications Symposium, IDEAS 2002 (2002)"},{"key":"15_CR22","unstructured":"Yang, C., Lin, K.-I.: An index structure for efficient reverse nearest neighbor queries. In: Proceedings of the 14th International Conference on Data Engineering, ICDE (2001)"},{"key":"15_CR23","unstructured":"Zhang, D., Tsotras, V. J., Seeger. B.: A comparison of indexed temporal joins. Tech Report, UCR-CS-00-03, CS Dept., UC Riverside (2000), http:\/\/www.cs.ucr.edu\/~donghui\/publications\/tempjoin.ps"},{"key":"15_CR24","unstructured":"Zhang, D., Tsotras, V.J., Seeger, B.: Efficient temporal join processing using indices. In: Proceedings of the 14th International Conference on Data Engineering, ICDE (2002)"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45072-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T11:50:21Z","timestamp":1592221821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45072-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405351","9783540450726"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45072-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}