{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:32:17Z","timestamp":1760707937986},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_48","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"554-567","source":"Crossref","is-referenced-by-count":4,"title":["Search Space Reductions for Nearest-Neighbor Queries"],"prefix":"10.1007","author":[{"given":"Micah","family":"Adler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brent","family":"Heeringa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","volume-title":"Advanced Information and Knowledge Processing","author":"Y. Manolopoulos","year":"2006","unstructured":"Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A.N., Theodoridis, Y.: R-Trees: Theory and Applications. In: Advanced Information and Knowledge Processing, 1st edn., Springer, Heidelberg (2006)","edition":"1"},{"doi-asserted-by":"crossref","unstructured":"Papadopoulos, A., Manolopoulos, Y.: Performance of nearest neighbor queries in r-trees. In: Proceedings of the 6th International Conference on Database Theory, pp. 394\u2013408 (1997)","key":"48_CR2","DOI":"10.1007\/3-540-62222-5_59"},{"key":"48_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/3-540-44503-X_28","volume-title":"Database Theory - ICDT 2001","author":"S. Berchtold","year":"2000","unstructured":"Berchtold, S., B\u00f6hm, C., Keim, D.A., Krebs, F., Kriegel, H.P.: On optimizing nearest neighbor queries in high-dimensional data spaces. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol.\u00a01973, pp. 435\u2013449. Springer, Heidelberg (2000)"},{"doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 47\u201357 (1984)","key":"48_CR4","DOI":"10.1145\/971697.602266"},{"unstructured":"Sellis, T., Roussopoulos, N., Faloutsos, C.: R+-tree: A dynamic index for multidimensional objects. In: Proceedings of the 13th International Conference on Very Large Databases, pp. 507\u2013518 (1988)","key":"48_CR5"},{"doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: R*-tree: An efficient and robust access method for points and rectangles. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 322\u2013331 (1990)","key":"48_CR6","DOI":"10.1145\/93605.98741"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/320248.320255","volume":"24","author":"G.R. Hjaltason","year":"1999","unstructured":"Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Transactions on Database Systems\u00a024, 265\u2013318 (1999)","journal-title":"ACM Transactions on Database Systems"},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/263661.263671","volume-title":"Proceedings of the Sixteenth ACM Symposium on Principles of Database Systems","author":"S. Berchtold","year":"1997","unstructured":"Berchtold, S., B\u00f6hm, C., Keim, D.A., Kriegel, H.P.: A cost model for nearest neighbor search in high-dimensional data space. In: Proceedings of the Sixteenth ACM Symposium on Principles of Database Systems, pp. 78\u201386. ACM Press, New York (1997)"},{"doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proceedings ACM SIGMOD Internaiontal Conference on the Management of Data, pp. 71\u201379 (1995)","key":"48_CR9","DOI":"10.1145\/223784.223794"},{"key":"48_CR10","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C. B\u00f6hm","year":"2001","unstructured":"B\u00f6hm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys (CSUR)\u00a033, 322\u2013373 (2001)","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"48_CR11","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/290593.290596","volume":"27","author":"K.L. Cheung","year":"1998","unstructured":"Cheung, K.L., Fu, A.W.C.: Enhanced nearest neighbour search on the r-tree. SIGMOD Record\u00a027, 16\u201321 (1998)","journal-title":"SIGMOD Record"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:26Z","timestamp":1619522066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_48","relation":{},"subject":[]}}