{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:07:45Z","timestamp":1748318865856,"version":"3.41.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Multimedia Tools and Applications"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1023\/a:1011343115154","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T09:44:13Z","timestamp":1040636653000},"page":"113-135","source":"Crossref","is-referenced-by-count":45,"title":["Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching"],"prefix":"10.1007","volume":"14","author":[{"given":"Edgar","family":"Ch\u00e1vez","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 L.","family":"Marroqu\u00edn","sequence":"additional","affiliation":[]},{"given":"Gonzalo","family":"Navarro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"334056_CR1","unstructured":"S. Arya, D. Mount, N. Netanyahu, R. Silverman, and A. Wu, \u201cAn optimal algorithm for approximate nearest neighbor searching in fixed dimension,\u201d in Proc. 5th ACM-SIAM Symposium on Discrete Algorithms (SODA'94), Washington DC, 1994, pp. 573\u2013583."},{"issue":"3","key":"334056_CR2","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"F. Aurenhammer, \u201cVoronoi diagrams\u2014a survey of a fundamental geometric data structure,\u201d ACM Computing Surveys, Vol. 23, No 3, pp. 345\u2013405, 1991.","journal-title":"ACM Computing Surveys"},{"key":"334056_CR3","first-page":"331","volume-title":"Encyclopedia of Computer Science and Technology","author":"R. Baeza-Yates","year":"1997","unstructured":"R. Baeza-Yates, \u201c Searching: an algorithmic tour,\u201d in Encyclopedia of Computer Science and Technology, A. Kent and J. Williams (Eds.), Vol. 37, Marcel Dekker, Inc., NY 1997, pp. 331\u2013359."},{"key":"334056_CR4","doi-asserted-by":"crossref","unstructured":"R. Baeza-Yates, W. Cunto, U. Manber, and S. Wu, \u201cProximity matching using fixed-queries trees,\u201d in Proc. 5th Combinatorial Pattern Matching (CPM'94), Asilomar, CA, 1994, pp. 198\u2013212.","DOI":"10.1007\/3-540-58094-8_18"},{"key":"334056_CR5","first-page":"14","volume-title":"Proc. 5th Symposium on String Processing and Information Retrieval (SPIRE'98)","author":"R. Baeza-Yates","year":"1998","unstructured":"R. Baeza-Yates and G. Navarro, \u201cFast approximate string matching in a dictionary,\u201d in Proc. 5th Symposium on String Processing and Information Retrieval (SPIRE'98), Santa Cruz de la Sierra, Bolivia, IEEE CS Press, 1998, pp. 14\u201322."},{"key":"334056_CR6","volume-title":"Modern Information Retrieval","author":"R. Baeza-Yates","year":"1999","unstructured":"R. Baeza-Yates and B. Ribeiro-Neto, Modern Information Retrieval, Addison-Wesley, Harlow, England 1999."},{"issue":"9","key":"334056_CR7","first-page":"509","volume":"18","author":"J. Bentley","year":"1975","unstructured":"J. Bentley, \u201cMultidimensional binary search trees used for associative searching,\u201d Comm. of theACM,Vol. 18, No. 9, pp. 509\u2013517, 1975.","journal-title":"Comm. of theACM"},{"key":"334056_CR8","first-page":"357","volume-title":"Proc. ACM SIGMOD International Conference on Management of Data, Sigmod Record","author":"T. Bozkaya","year":"1997","unstructured":"T. Bozkaya and M. Ozsoyoglu, \u201cDistance-based indexing for high-dimensional metric spaces,\u201d in Proc. ACM SIGMOD International Conference on Management of Data, Sigmod Record, ACM Press, NY., 1997, Vol. 26, No. 2, pp. 357\u2013368."},{"key":"334056_CR9","unstructured":"S. Brin, \u201cNear neighbor search in large metric spaces,\u201d in Proc. 21st Conference on Very Large Databases (VLDB'95), Zurich, Switzerland, 1995, pp. 574\u2013584."},{"key":"334056_CR10","first-page":"38","volume-title":"Proc. 6th Symposium on String Processing and Information Retrieval (SPIRE'99)","author":"E. Ch\u00e1vez","year":"1999","unstructured":"E. Ch\u00e1vez, J. Marroq\u00edn, and R. Baeza-Yates, \u201cSpaghettis: an array based algorithm for similarity queries in metric spaces,\u201d in Proc. 6th Symposium on String Processing and Information Retrieval (SPIRE'99), Cancun, Mexico, IEEE CS Press, 1999, pp. 38\u201346."},{"key":"334056_CR11","unstructured":"E. Ch\u00e1vez, J. Marroq\u00edn, and G. Navarro,\u201c Overcoming the curse of dimensionality, \u201din EuropeanWorkshop on Content-Based Multimedia Indexing (CBMI'99), Tolouse, France, 1999, pp. 57\u201364."},{"key":"334056_CR12","volume-title":"To appear in ACM Computing Surveys","author":"E. Ch\u00e1vez","year":"2001","unstructured":"E. Ch\u00e1vez, G. Navarro, R. Baeza-Yates, and J. Marroq\u00edn, \u201cSearching in metric spaces,\u201d To appear in ACM Computing Surveys, 2001, ACM Press, NY. ftp:\/\/ftp.dcc.uchile.cl\/pub\/users\/gnavarro\/-survmetric.ps.gz."},{"key":"334056_CR13","unstructured":"P. Ciaccia, M. Patella, and P. Zezula, \u201cM-tree: an efficient access method for similarity search in metric spaces,\u201d in Proc. of the 23rd Conference on Very Large Databases (VLDB'97), Athens, Greece, 1997, pp. 426\u2013435."},{"issue":"1","key":"334056_CR14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/PL00009449","volume":"22","author":"K. Clarkson","year":"1999","unstructured":"K. Clarkson, \u201cNearest neighbor queries in metric spaces,\u201d Discrete Computational Geometry, Vol. 22, No. 1, pp. 63\u201393, 1999.","journal-title":"Discrete Computational Geometry"},{"key":"334056_CR15","volume-title":"Multidimensional Scaling","author":"T. Cox","year":"1994","unstructured":"T. Cox and M. Cox, Multidimensional Scaling. Chapman and Hall, NY 1994."},{"issue":"2","key":"334056_CR16","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0306-4379(87)90041-X","volume":"12","author":"F. Dehne","year":"1987","unstructured":"F. Dehne and H. Nolteimer, \u201cVoronoi trees and clustering problems,\u201d Information Systems, Vol. 12, No. 2, pp. 171\u2013175, 1987.","journal-title":"Information Systems"},{"key":"334056_CR17","doi-asserted-by":"crossref","unstructured":"C. Faloutsos and I. Kamel, \u201cBeyond uniformity and independence: analysis of R-trees using the concept of fractal dimension,\u201d in Proc. 13th ACM Symposium on Principles of Database Principles (PODS'94), Minneapolis, MN, 1994, pp. 4\u201313.","DOI":"10.1145\/182591.182593"},{"issue":"2","key":"334056_CR18","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/568271.223812","volume":"24","author":"C. Faloutsos","year":"1995","unstructured":"C. Faloutsos and K. Lin, \u201cFastmap: a fast algorithm for indexing, data mining and visualization of traditional and multimedia datasets,\u201d ACM SIGMOD Record, Vol. 24, No. 2, pp. 163\u2013174, 1995.","journal-title":"ACM SIGMOD Record"},{"key":"334056_CR19","doi-asserted-by":"crossref","unstructured":"A. Guttman, \u201cR-trees: a dynamic index structure for spatial searching,\u201d in Proc. ACMSIGMOD International Conference on Management of Data, Boston, MA 1984, pp. 47\u201357.","DOI":"10.1145\/971697.602266"},{"key":"334056_CR20","volume-title":"Multivariate Data Analysis with Readings","author":"J. Hair","year":"1995","unstructured":"J. Hair, R. Anderson, R. Tatham, and W. Black, Multivariate Data Analysis with Readings, 4th edition, Prentice-Hall, NJ, 1995.","edition":"4th edition"},{"key":"334056_CR21","doi-asserted-by":"crossref","unstructured":"I. Kalantari and G. McDonald, \u201cA data structure and an algorithm for the nearest point problem,\u201d IEEE Transactions on Software Engineering, Vol. 9, No. 5, 1983.","DOI":"10.1109\/TSE.1983.235263"},{"key":"334056_CR22","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"L. Mic\u00f3","year":"1994","unstructured":"L. Mic\u00f3, J. Oncina, and E. Vidal, \u201cAnewversion of the nearest-neighbor approximating and eliminating search (AESA) with linear preprocessing-time and memory requirements,\u201d Pattern Recognition Letters, Vol. 15, pp. 9\u201317, 1994.","journal-title":"Pattern Recognition Letters"},{"key":"334056_CR23","first-page":"141","volume-title":"Proc. 6th Symposium on String Processing and Information Retrieval (SPIRE'99)","author":"G. Navarro","year":"1999","unstructured":"G. Navarro, \u201cSearching in metric spaces by spatial approximation,\u201d in Proc. 6th Symposium on String Processing and Information Retrieval (SPIRE'99), Cancun, Mexico, IEEE CS Press, 1999, pp. 141\u2013148."},{"issue":"9","key":"334056_CR24","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1109\/34.615448","volume":"19","author":"S. Nene","year":"1997","unstructured":"S. Nene and S. Nayar, \u201cA simple algorithm for nearest neighbor search in high dimensions,\u201d IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol. 19, No. 9, pp. 989\u20131003, 1997.","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"5","key":"334056_CR25","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/359581.359599","volume":"20","author":"M. Shapiro","year":"1977","unstructured":"M. Shapiro, \u201cThe choice of reference points in best-match file searching,\u201d Comm. of the ACM, Vol. 20, No. 5, pp. 339\u2013343, 1977.","journal-title":"Comm. of the ACM"},{"key":"334056_CR26","unstructured":"J. Uhlmann, \u201cImplementing metric trees to satisfy general proximity\/similarity queries,\u201d Manuscript."},{"key":"334056_CR27","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J. Uhlmann","year":"1991","unstructured":"J. Uhlmann, \u201cSatisfying general proximity\/similarity queries with metric trees,\u201d Information Processing Letters, Vol. 40, pp. 175\u2013179, 1991.","journal-title":"Information Processing Letters"},{"key":"334056_CR28","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"E. Vidal","year":"1986","unstructured":"E. Vidal, \u201cAn algorithm for finding nearest neighbors in (approximately) constant average time,\u201d Pattern Recognition Letters, Vol. 4, pp. 145\u2013157, 1986.","journal-title":"Pattern Recognition Letters"},{"key":"334056_CR29","unstructured":"P. Yianilos, \u201cData structures and algorithms for nearest neighbor search in general metric spaces,\u201d in Proc. 4th ACM-SIAM Symposium on Discrete Algorithms (SODA'93), Austin, TX, 1993, pp. 311\u2013321."},{"key":"334056_CR30","volume-title":"DIMACS Implementation Challenge, ALENEX'99, Baltimore, MD, LNCS","author":"P. Yianilos","year":"1999","unstructured":"P. Yianilos, \u201cExcluded middle vantage point forests for nearest neighbor search,\u201d in DIMACS Implementation Challenge, ALENEX'99, Baltimore, MD, LNCS v. 1619, Springer, Berlin, Germany, 1999."},{"key":"334056_CR31","unstructured":"P. Yianilos, \u201cLocally lifting the curse of dimensionality for nearest neighbor search,\u201d in Proc. 11thACM-SIAM Symposium on Discrete Algorithms (SODA'00), San Francisco, CA, 2000, pp. 361\u2013370."}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011343115154.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011343115154\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011343115154.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T06:35:12Z","timestamp":1748241312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011343115154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["334056"],"URL":"https:\/\/doi.org\/10.1023\/a:1011343115154","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}