{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T17:02:01Z","timestamp":1759683721367},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642138171"},{"type":"electronic","value":"9783642138188"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13818-8_35","type":"book-chapter","created":{"date-parts":[[2010,6,24]],"date-time":"2010-06-24T16:58:03Z","timestamp":1277398683000},"page":"501-518","source":"Crossref","is-referenced-by-count":16,"title":["Optimizing All-Nearest-Neighbor Queries with Trigonometric Pruning"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Emrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franz","family":"Graf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-Peter","family":"Kriegel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Schubert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marisa","family":"Thoma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"35_CR1","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/s10115-003-0122-9","volume":"6","author":"C. B\u00f6hm","year":"2004","unstructured":"B\u00f6hm, C., Krebs, F.: The k-nearest neighbor join: Turbo charging the KDD process. KAIS\u00a06(6), 728\u2013749 (2004)","journal-title":"KAIS"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Lowe, D.: Object recognition from local scale-invariant features. In: International Conference on Computer Vision, Corfu, Greece, pp. 1150\u20131157 (1999)","DOI":"10.1109\/ICCV.1999.790410"},{"issue":"2","key":"35_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.cag.2006.11.011","volume":"31","author":"J. Sankaranarayanan","year":"2007","unstructured":"Sankaranarayanan, J., Samet, H., Varshney, A.: A fast all nearest neighbor algorithm for applications involving large point-clouds. Comput. Graph.\u00a031(2), 157\u2013174 (2007)","journal-title":"Comput. Graph."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Breunig, M.M., Kriegel, H.P., Ng, R., Sander, J.: LOF: Identifying density-based local outliers. In: Proc. SIGMOD (2000)","DOI":"10.1145\/342009.335388"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"White, D.A., Jain, R.: Similarity indexing with the SS-tree. In: Proc. ICDE, pp. 516\u2013523 (1996)","DOI":"10.1109\/ICDE.1996.492202"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Y., Patel, J.: Efficient evaluation of all-nearest-neigbor queries. In: Proc. ICDE (2007)","DOI":"10.1109\/ICDE.2007.368964"},{"key":"35_CR7","series-title":"The Morgan Kaufmann Series in Computer Graphics","volume-title":"Foundations of Multidimensional and Metric Data Structures","author":"H. Samet","year":"2006","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. The Morgan Kaufmann Series in Computer Graphics. Morgan Kaufmann, San Francisco (2006)"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Xia, C., Lu, H., Ooi, B.C., Hu, J.: GORDER: An efficient method for KNN join processing. In: Proc. VLDB (2004)","DOI":"10.1016\/B978-012088469-8\/50067-X"},{"key":"35_CR9","unstructured":"Zhang, J., Mamoulis, N., Papadias, D., Tao, Y.: All-nearest-neighbors queries in spatial databases. In: Proc. SSDBM (2004)"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-Trees: A dynamic index structure for spatial searching. In: Proc. SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Yu, C., Cui, B., Wang, S., Su, J.: Efficient index-based KNN join processing for high-dimensional data. Information and Software Technology\u00a049(4) (2007)","DOI":"10.1016\/j.infsof.2006.05.006"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Jagadish, H.V., Ooi, B., Tan, K.L., Yu, C., Zhang, R.: iDistance: An adaptive B+-tree based indexing method for nearest neighbor search. ACM TODS\u00a030(2) (2005)","DOI":"10.1145\/1071610.1071612"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: M-Tree: an efficient access method for similarity search in metric spaces. In: Proc. VLDB (1997)","DOI":"10.1145\/275487.275495"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: An efficient data clustering method for very large databases. In: Proc. SIGMOD, pp. 103\u2013114 (1996)","DOI":"10.1145\/233269.233324"},{"key":"35_CR15","unstructured":"B\u00e2doiu, M., Clarkson, K.L.: Smaller core-sets for balls. In: SODA 2003: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 801\u2013802. Society for Industrial and Applied Mathematics, Philadelphia (2003)"},{"key":"35_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Spatial Databases","author":"G.R. Hjaltason","year":"1995","unstructured":"Hjaltason, G.R., Samet, H.: Ranking in spatial databases. In: Egenhofer, M.J., Herring, J.R. (eds.) SSD 1995. LNCS, vol.\u00a0951, Springer, Heidelberg (1995)"},{"key":"35_CR17","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.P.: The X-Tree: An index structure for high-dimensional data. In: Proc. VLDB (1996)"},{"issue":"5","key":"35_CR18","doi-asserted-by":"publisher","first-page":"2503","DOI":"10.1086\/301098","volume":"118","author":"N. Zacharias","year":"1999","unstructured":"Zacharias, N., Zacharias, M.I.: The twin astrographic catalog on the hipparcos system. The Astronomical Journal\u00a0118(5), 2503\u20132510 (1999)","journal-title":"The Astronomical Journal"},{"key":"35_CR19","unstructured":"Hettich, S., Bay, S.D.: The UCI KDD archive (1999), http:\/\/kdd.ics.uci.edu"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13818-8_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T02:56:21Z","timestamp":1635562581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13818-8_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642138171","9783642138188"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13818-8_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}