{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T22:40:06Z","timestamp":1737067206219,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000280"},{"type":"electronic","value":"9783540360872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36087-5_30","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T22:17:16Z","timestamp":1180909036000},"page":"256-263","source":"Crossref","is-referenced-by-count":8,"title":["Priority Vantage Points Structures for Similarity Queries in Metric Spaces"],"prefix":"10.1007","author":[{"given":"Cengiz","family":"Celik","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"C. Traina Jr., Agma J. M. Traina, B. Seeger, C. Faloutsos. Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes. EDBT: 51\u201365. 2000.","DOI":"10.1007\/3-540-46439-5_4"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"E. Ch\u00e1vez, J. L. Marroqu\u00edn, R. A. Baeza-Yates. Spaghettis: An Array Based Algorithm for Similarity Queries in Metric Spaces. SPIRE\/CRIWG: 38\u201346. 1999.","DOI":"10.1109\/SPIRE.1999.796576"},{"issue":"3","key":"30_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E. Ch\u00e1vez","year":"2001a","unstructured":"E. Ch\u00e1vez, G. Navarro, R. Baeza-Yates, J. L. Marroqu\u00edn. Proximity Searching in Metric Spaces. ACM Computing Surveys 33(3):273\u2013321. 2001a.","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1011343115154","volume":"14","author":"E. Ch\u00e1vez","year":"2001b","unstructured":"E. Ch\u00e1vez, J. L. Marroqu\u00edn, G. Navarro. Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching. Multimedia Tools and Applications 14(2): 113\u2013135. 2001b.","journal-title":"Multimedia Tools and Applications"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"E. Vidal","year":"1986","unstructured":"E. Vidal. An Algorithm for Finding Nearest Neighbors in (approximately) Constant Average Time. Pattern Recognition Letters 4:145. 1986.","journal-title":"Pattern Recognition Letters"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J. Uhlmann","year":"1991","unstructured":"J. Uhlmann. Satisfying General Proximity\/Similarity Queries with Metric Trees. Information Processing Letters 40:175\u2013179. 1991.","journal-title":"Information Processing Letters"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/0167-8655(96)00032-3","volume":"17","author":"L. Mico","year":"1996","unstructured":"L. Mico, J. Oncina, E. Vidal. A New Version of the Nearest-neighbor Approximating and Eliminating Search (AESA) with Linear Preprocessing Time and Memory Requirements. Pattern Recognition Letters 17:731\u2013739. 1996.","journal-title":"Pattern Recognition Letters"},{"key":"30_CR8","unstructured":"P. Ciaccia, M. Patella, and P. Zezula, M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. Proceedings of the 23rd VLDB. 1997."},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF01759061","volume":"6","author":"R.F. Sproull","year":"1991","unstructured":"R.F. Sproull. Refinements to Nearest-Neighbor Searching in k-Dimensional Trees. Algorithmica 6:579\u2013589. 1991.","journal-title":"Algorithmica"},{"key":"30_CR10","unstructured":"S. Brin. Near Neighbor Search in Large Metric Spaces. Proc. VLDB 574\u2013584. 1995."},{"issue":"9","key":"30_CR11","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1109\/34.615448","volume":"19","author":"S. Nene","year":"1997","unstructured":"S. Nene, S. Nayar. A Simple Algorithm for Nearest Neighbor Search in High Dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence 19(9):989\u20131003. 1997.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"T. Bozkaya, M. Ozsoyoglu. Distance-based Indexing for High-dimensional Metric Spaces. SIGMOD 357\u2013368. 1997.","DOI":"10.1145\/253262.253345"},{"issue":"4","key":"30_CR13","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/362003.362025","volume":"16","author":"W. Burkhard","year":"1973","unstructured":"W. Burkhard, R. Keller. Some Approaches to Best-Match File Searching. CACM 16(4): 230\u2013236. 1973.","journal-title":"CACM"}],"container-title":["Lecture Notes in Computer Science","EurAsia-ICT 2002: Information and Communication Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36087-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T22:07:40Z","timestamp":1737065260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36087-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000280","9783540360872"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-36087-5_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}