{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:12:52Z","timestamp":1746072772208,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642374869"},{"type":"electronic","value":"9783642374876"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37487-6_11","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T07:55:02Z","timestamp":1366185302000},"page":"116-130","source":"Crossref","is-referenced-by-count":1,"title":["AVR-Tree: Speeding Up the NN and ANN Queries on Location Data"],"prefix":"10.1007","author":[{"given":"Qianlu","family":"Lin","sequence":"first","affiliation":[]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"11_CR1","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM\u00a045(6), 891\u2013923 (1998)","journal-title":"J. ACM"},{"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: SIGMOD Conference, pp. 322\u2013331 (1990)","key":"11_CR2","DOI":"10.1145\/93605.98741"},{"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: ICDE, pp. 209\u2013218 (1998)","key":"11_CR3","DOI":"10.1145\/263661.263671"},{"doi-asserted-by":"crossref","unstructured":"Braunm\u00fcller, B., Ester, M., Kriegel, H.-P., Sander, J.: Efficiently supporting multiple similarity queries for mining in metric databases. In: ICDE, pp. 256\u2013267 (2000)","key":"11_CR4","DOI":"10.1109\/ICDE.2000.839418"},{"doi-asserted-by":"crossref","unstructured":"Brinkhoff, T., Kriegel, H.-P., Seeger, B.: Efficient processing of spatial joins using r-trees. In: SIGMOD Conference, pp. 237\u2013246 (1993)","key":"11_CR5","DOI":"10.1145\/170036.170075"},{"doi-asserted-by":"crossref","unstructured":"Chen, Y., Patel, J.M.: Efficient evaluation of all-nearest-neighbor queries. In: ICDE, pp. 1056\u20131065 (2007)","key":"11_CR6","DOI":"10.1109\/ICDE.2007.368964"},{"issue":"1","key":"11_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 Knowl. Eng.\u00a049(1), 67\u2013104 (2004)","journal-title":"Data Knowl. Eng."},{"doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD Conference (1984)","key":"11_CR8","DOI":"10.1145\/602259.602266"},{"doi-asserted-by":"crossref","unstructured":"Hjaltason, G.R., Samet, H.: Incremental distance join algorithms for spatial databases. In: SIGMOD Conference, pp. 237\u2013248 (1998)","key":"11_CR9","DOI":"10.1145\/276305.276326"},{"unstructured":"Huang, Y.-W., Jing, N., Rundensteiner, E.A.: Spatial joins using R-trees: Breadth-first traversal with global optimizations. In: VLDB 1997 (1997)","key":"11_CR10"},{"doi-asserted-by":"crossref","unstructured":"Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: SIGMOD Conference, pp. 201\u2013212 (2000)","key":"11_CR11","DOI":"10.1145\/335191.335415"},{"doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD Conference, pp. 71\u201379 (1995)","key":"11_CR12","DOI":"10.1145\/568271.223794"},{"issue":"1","key":"11_CR13","first-page":"1231","volume":"3","author":"M. Sharifzadeh","year":"2010","unstructured":"Sharifzadeh, M., Shahabi, C.: Vor-tree: R-trees with voronoi diagrams for efficient processing of spatial nearest neighbor queries. PVLDB\u00a03(1), 1231\u20131242 (2010)","journal-title":"PVLDB"},{"unstructured":"Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB, pp. 194\u2013205 (1998)","key":"11_CR14"},{"unstructured":"Zhang, J., Mamoulis, N., Papadias, D., Tao, Y.: All-nearest-neighbors queries in spatial databases. In: SSDBM, pp. 297\u2013306 (2004)","key":"11_CR15"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37487-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T05:21:46Z","timestamp":1745990506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37487-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642374869","9783642374876"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37487-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}