{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:00:28Z","timestamp":1758265228387,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":57,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540757665"},{"type":"electronic","value":"9783540757672"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-75767-2_12","type":"book-chapter","created":{"date-parts":[[2008,1,12]],"date-time":"2008-01-12T00:43:12Z","timestamp":1200098592000},"page":"235-263","source":"Crossref","is-referenced-by-count":2,"title":["Efficiency and Scalability Issues in Metric Access Methods"],"prefix":"10.1007","author":[{"given":"Vlastislav","family":"Dohnal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Zezula","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1_1","doi-asserted-by":"crossref","unstructured":"A. Alpkocak, T. Danisman, and T. Ulker. A parallel similarity search in high dimensional metric space using M-Tree. In D. Grigoras, A. Nicolau, B. Toursel, and B. Folliot, editors, Proceedings of the NATO Advanced Research Workshop on Advanced Environments, Tools, and Applications for Cluster Computing-Revised Papers (IWCC 2001), Mangalia, Romania, September 1-6, 2001, volume 2326 of Lecture Notes in Computer Science, pages 166\u2013171. Springer, 2002.","DOI":"10.1007\/3-540-47840-X_16"},{"key":"12_CR2_1","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1007\/BF02462328","volume":"48","author":"SF Altschul","year":"1986","unstructured":"S. F. Altschul and B. W. Erickson. Locally optimal subalignments using nonlinear similarity functions. Bulletin of Mathematical Biology, 48:633\u2013660, 1986.","journal-title":"Bulletin of Mathematical Biology"},{"issue":"2","key":"12_CR3_1","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1145\/763693.763696","volume":"21","author":"G Amato","year":"2003","unstructured":"G. Amato, F. Rabitti, P. Savino, and P. Zezula. Region proximity in metric spaces and its use for approximate similarity search. ACM Transactions on Information Systems (TOIS 2003), 21(2):192\u2013227, April 2003.","journal-title":"ACM Transactions on Information Systems (TOIS 2003)"},{"key":"12_CR4_1","first-page":"8","volume-title":"Proceedings of ACM International Workshop on Information Retrieval in Peer-to-Peer Networks (P2PIR 2006)","author":"M Batko","year":"2006","unstructured":"M. Batko, V. Dohnal, and P. Zezula. M-Grid: Similarity searching in Grids. In Proceedings of ACM International Workshop on Information Retrieval in Peer-to-Peer Networks (P2PIR 2006), Arlington, VA, USA, November 11, 2006, page 8. ACM, 2006."},{"key":"12_CR5_1","doi-asserted-by":"crossref","unstructured":"M. Batko, C. Gennaro, and P. Zezula. A scalable nearest neighbor search in P2P systems. In Proceedings of the 2nd International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P 2004), Toronto, Canada, volume 3367 of Lecture Notes in Computer Science, pages 79\u201392. Springer, February 2005.","DOI":"10.1007\/978-3-540-31838-5_6"},{"key":"12_CR6_1","first-page":"1","volume-title":"Proceedings of First International Conference on Scalable Information Systems (INFOSCALE 2006)","author":"M Batko","year":"2006","unstructured":"M. Batko, D. Novak, F. Falchi, and P. Zezula. On scalability of the similarity search in the world of peers. In Proceedings of First International Conference on Scalable Information Systems (INFOSCALE 2006), Hong Kong, May 30 - June 1, pages 1\u201312. ACM Press, 2006."},{"key":"12_CR7_1","doi-asserted-by":"crossref","unstructured":"A. Baxevanis and B. Ouellette. Bioinformatics. A Practical Guide to the Analysis of Genes and Proteins (Second Edition). Wiley-Interscience, 2001.","DOI":"10.1002\/0471223921"},{"key":"12_CR8_1","doi-asserted-by":"publisher","first-page":"D23","DOI":"10.1093\/nar\/gkh045","volume":"32","author":"DA Benson","year":"2004","unstructured":"D. A. Benson, I. Karsch-Mizrachi, D. J. Lipman, J. Ostell, and D. L. Wheeler. Genbank: update. Nucleic Acids Research, 32:Database Issue D23\u2013D26, 2004.","journal-title":"Nucleic Acids Research"},{"key":"12_CR9_1","first-page":"574","volume-title":"Proceedings of the 21th International Conference on Very Large Data Bases (VLDB 1995)","author":"S Brin","year":"1995","unstructured":"S. Brin. Near neighbor search in large metric spaces. In U. Dayal, P. M. D. Gray, and S. Nishio, editors, Proceedings of the 21th International Conference on Very Large Data Bases (VLDB 1995), Zurich, Switzerland, September 11-15, 1995, pages 574\u2013584. Morgan Kaufmann, 1995."},{"issue":"3","key":"12_CR10_1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"E. Ch\u00e1vez, G. Navarro, R. A. Baeza-Yates, and J. L. Marroqu\u00edn. Searching in metric spaces. ACM Computing Surveys (CSUR 2001), 33(3):273\u2013321, September 2001.","journal-title":"ACM Computing Surveys (CSUR 2001)"},{"key":"12_CR11_1","doi-asserted-by":"publisher","first-page":"362+","DOI":"10.1186\/1471-2105-7-362","volume":"7","author":"P-H Chi","year":"2006","unstructured":"P.-H. Chi, C.-R. Shyu, and D. Xu. A fast scop fold classification system using content-based e-predict algorithm. BMC Bioinformatics, 7:362+, July 2006.","journal-title":"BMC Bioinformatics"},{"key":"#cr-split#-12_CR12_1.1","unstructured":"P. Ciaccia and M. Patella. Bulk loading the M-tree. In Proceedings of the 9th Australasian Database Conference (ADC 1998), Perth, Australia, February 2-3, 1998, volume 20"},{"key":"#cr-split#-12_CR12_1.2","unstructured":"(2) of Australian Computer Science Communications, pages 15-26. Springer, 1998."},{"key":"12_CR13_1","first-page":"426","volume-title":"Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB 1997)","author":"P Ciaccia","year":"1997","unstructured":"P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In M. Jarke, M. J. Carey, K. R. Dittrich, F. H. Lochovsky, P. Loucopoulos, and M. A. Jeusfeld, editors, Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB 1997), Athens, Greece, August 25-29, 1997, pages 426\u2013435. Morgan Kaufmann, 1997."},{"key":"12_CR14_1","unstructured":"V. Dohnal. Indexing Structures for Searching in Metric Spaces. PhD thesis, Faculty of Informatics, Masaryk University in Brno, Czech Republic, May 2004. http:\/\/www.fi.muni.cz\/~{}xdohnal\/phd-thesis.pdf ."},{"key":"12_CR15_1","first-page":"45","volume-title":"Proceedings of the 9th Italian Symposium on Advanced Database Systems (SEBD 2001)","author":"V Dohnal","year":"2001","unstructured":"V. Dohnal, C. Gennaro, P. Savino, and P. Zezula. Separable splits in metric data sets. In A. Celentano, L. Tanca, and P. Tiberio, editors, Proceedings of the 9th Italian Symposium on Advanced Database Systems (SEBD 2001), Venezia, Italy, June 27-29, 2001, pages 45\u201362. LCM Selecta Group - Milano, 2001."},{"issue":"1","key":"12_CR16_1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/A:1025026030880","volume":"21","author":"V Dohnal","year":"2003","unstructured":"V. Dohnal, C. Gennaro, P. Savino, and P. Zezula. D-Index: Distance searching index for metric data sets. Multimedia Tools and Applications, 21(1):9\u201333, 2003.","journal-title":"Multimedia Tools and Applications"},{"key":"12_CR17_1","unstructured":"F. Falchi, C. Gennaro, and P. Zezula. A content-addressable network for similarity search in metric spaces. In Proceedings of the the 2nd International Workshop on Databases, Information Systems and Peer-to-Peer Computing (DBISP2P 2005), Trondheim, Norway, August 28-29, 2005, pages 126\u2013137, 2005."},{"key":"12_CR18_1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/500933.500935","volume-title":"Proceedings of the 3rd ACM Multimedia 2001 Workshop on Multimedia Information Retrieval (MIR 2001)","author":"C Gennaro","year":"2001","unstructured":"C. Gennaro, P. Savino, and P. Zezula. Similarity search in metric databases through hashing. In Proceedings of the 3rd ACM Multimedia 2001 Workshop on Multimedia Information Retrieval (MIR 2001), Ottawa, Ontario, Canada, October 5, 2001, pages 1\u20135. ACM Press, 2001."},{"issue":"4","key":"12_CR19_1","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"GR Hjaltason","year":"2003","unstructured":"G. R. Hjaltason and H. Samet. Index-driven similarity search in metric spaces. ACM Transactions on Database Systems (TODS 2003), 28(4):517\u2013580, 2003.","journal-title":"ACM Transactions on Database Systems (TODS 2003)"},{"issue":"2","key":"12_CR20_1","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/1071610.1071612","volume":"30","author":"HV Jagadish","year":"2005","unstructured":"H. V. Jagadish, B. C. Ooi, K.-L. Tan, C. Yu, and R. Zhang. iDistance: An adaptive B+-tree based indexing method for nearest neighbor search. ACM Transactions on Database Systems (TODS 2005), 30(2):364\u2013397, 2005.","journal-title":"ACM Transactions on Database Systems (TODS 2005)"},{"key":"12_CR21_1","unstructured":"M. B. Jones, M. Theimer, H. Wang, and A. Wolman. Unexpected complexity: Experiences tuning and extending can. Technical Report MSR-TR-2002-118, Microsoft Research, December 2002."},{"key":"12_CR22_1","doi-asserted-by":"crossref","unstructured":"R. Mao, W. Xu, S. Ramakrishnan, G. Nuckolls, and D. P. Miranker. On optimizing distance-based similarity search for biological databases. In Proceedings of the 4th International IEEE Computer Society Computational Systems Bioinformatics Conference (CSB 2005), Stanford, USA, pages 351\u2013361, 2005.","DOI":"10.1109\/CSB.2005.42"},{"issue":"5","key":"12_CR23_1","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1142\/S0218213005002430","volume":"14","author":"R Mao","year":"2005","unstructured":"R. Mao, W. Xu, N. Singh, and D. P. Miranker. An assessment of a metric space database index to support sequence homology. International Journal on Artificial Intelligence Tools, 14(5):867\u2013885, 2005.","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"12_CR24_1","unstructured":"R. Mao, W. Xu, W. S. Willard, S. R. Ramakrishnan, and D. P. Miranker. MoBIoS index: Support distance-based queries in bioinformatics. In Proceedings of the 2006 Workshop on Intelligent Computing & Bioinformatics of the Chinese Academy of Sciences (WICB 2006), Hefei, Anhui, China, November 12-14, 2006, 2006."},{"issue":"3","key":"12_CR25_1","first-page":"3","volume":"27","author":"DP Miranker","year":"2004","unstructured":"D. P. Miranker, W. J. Briggs, R. Mao, S. Ni, and W. Xu. Biosequence use cases in MoBIoS SQL. IEEE Data Engineering Bulletin, 27(3):3\u201311, 2004.","journal-title":"IEEE Data Engineering Bulletin"},{"key":"12_CR26_1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1109\/SSDM.2003.1214987","volume-title":"Proceedings of the 15th International Conference on Scientific and Statistical Database Management (SSDBM 2003)","author":"DP Miranker","year":"2003","unstructured":"D. P. Miranker, W. Xu, and R. Mao. Mobios: A metric-space dbms to support biological discovery. In Proceedings of the 15th International Conference on Scientific and Statistical Database Management (SSDBM 2003), Cambridge, MA, USA, July 9-11, 2003, pages 241\u2013244. IEEE Computer Society, 2003."},{"key":"12_CR27_1","unstructured":"D. W. Mount. Bioinformatics \u2013 Sequence and Genome Analysis, Second Edition. Cold Spring Harbor Laboratory Press, 2004."},{"issue":"4\/5","key":"12_CR28_1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01185432","volume":"12","author":"E Myers","year":"1994","unstructured":"E. Myers. A sublinear algorithm for approximate keyword searching. Algorithmica, 12(4\/5):345\u2013374, 1994.","journal-title":"Algorithmica"},{"key":"12_CR29_1","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"SB Needleman","year":"1970","unstructured":"S. B. Needleman and C. D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48:443\u2013453, 1970.","journal-title":"Journal of Molecular Biology"},{"key":"12_CR30_1","first-page":"1","volume-title":"Proceedings of First International Conference on Scalable Information Systems (INFOSCALE 2006)","author":"D Novak","year":"2006","unstructured":"D. Novak and P. Zezula. M-Chord: A scalable distributed similarity search structure. In Proceedings of First International Conference on Scalable Information Systems (INFOSCALE 2006), Hong Kong, May 30 - June 1, pages 1\u201310. IEEE Computer Society, 2006."},{"issue":"4","key":"12_CR31_1","doi-asserted-by":"crossref","first-page":"367","DOI":"10.3233\/FUN-2006-70405","volume":"70","author":"V Pestov","year":"2006","unstructured":"V. Pestov and A. Stojmirovic. Indexing schemes for similarity search: an illustrated paradigm. Fundamenta Informaticae, 70(4):367\u2013385, 2006.","journal-title":"Fundamenta Informaticae"},{"key":"12_CR32_1","doi-asserted-by":"crossref","unstructured":"S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A scalable content-addressable network. In Proceedings of the 2001 ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2001), pages 161\u2013172. ACM Press, 2001.","DOI":"10.1145\/964723.383072"},{"key":"12_CR33_1","volume-title":"Proceedings of the 3rd International COST264 Workshop on Networked Group Communication","author":"S Ratnasamy","year":"2001","unstructured":"S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Application-level multicast using content-addressable networks. In Proceedings of the 3rd International COST264 Workshop on Networked Group Communication, London, UK, November 7-9, 2001, volume 2233 of Lecture Notes in Computer Science. Springer, 2001."},{"issue":"4","key":"12_CR34_1","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1137\/0126070","volume":"26","author":"PH Sellers","year":"1974","unstructured":"P. H. Sellers. On the theory and computation of evolutionary distances. SIAM Journal on Applied Mathematics, 26(4):787\u2013793, 1974.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"4","key":"12_CR35_1","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"PH Sellers","year":"1980","unstructured":"P. H. Sellers. The theory and computation of evolutionary distances: Pattern recognition. Journal of Algorithms, 1(4):359\u2013373, 1980.","journal-title":"Journal of Algorithms"},{"key":"12_CR36_1","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/BF02459499","volume":"46","author":"PH Sellers","year":"1984","unstructured":"P. H. Sellers. Pattern recognition in genetic sequences by mismatch density. Bulletin of Mathematical Biology, 46:501\u2013514, 1984.","journal-title":"Bulletin of Mathematical Biology"},{"key":"12_CR37_1","unstructured":"T. Skopal. Pivoting M-tree: A metric access method for efficient similarity search. In V. Sn\u00e1\u0161el, J. Pokorn\u00fd, and K. Richta, editors, Proceedings of the Annual International Workshop on DAtabases, TExts, Specifications and Objects (DATESO 2004), Desna, Czech Republic, April 14-16, 2004, volume 98 of CEUR Workshop Proceedings. Technical University of Aachen (RWTH), 2004."},{"key":"12_CR38_1","unstructured":"T. Skopal, J. Pokorn\u00fd, M. Kr\u00e1tk\u00fd, and V. Sn\u00e1\u0161el. Revisiting M-Tree building principles. In L. A. Kalinichenko, R. Manthey, B. Thalheim, and U. Wloka, editors, Proceedings of the 7th East European Conference on Advances in Databases and Information Systems (ADBIS 2003), Dresden, Germany, September 3-6, 2003, volume 2798 of Lecture Notes in Computer Science. Springer, 2003."},{"key":"12_CR39_1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/BF01733210","volume":"18","author":"TF Smith","year":"1981","unstructured":"T. F. Smith, M. S. Waterman, and W. M. Fitch. Comparative biosequence metrics. Journal of Molecular Evolution, 18:38\u201346, 1981.","journal-title":"Journal of Molecular Evolution"},{"key":"12_CR40_1","first-page":"149","volume-title":"Proceedings of ACM Special Interest Group on Data Communications (SIGCOMM 2001)","author":"I Stoica","year":"2001","unstructured":"I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proceedings of ACM Special Interest Group on Data Communications (SIGCOMM 2001), San Diego, USA, pages 149\u2013160. ACM Press, 2001."},{"key":"12_CR41_1","unstructured":"A. Stojmirovic and V. Pestov. Indexing schemes for similarity search in datasets of short protein fragments. ArXiv Computer Science e-prints, September 2003."},{"key":"12_CR42_1","first-page":"219","volume-title":"Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management (CIKM 2002)","author":"C Traina Jr.","year":"2002","unstructured":"C. Traina, Jr., A. J. M. Traina, R. F. S. Filho, and C. Faloutsos. How to improve the pruning ability of dynamic metric access methods. In Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management (CIKM 2002), McLean, VA, USA, November 4-9, 2002, pages 219\u2013226. ACM, 2002."},{"key":"12_CR43_1","doi-asserted-by":"crossref","unstructured":"C. Traina, Jr., A. J. M. Traina, B. Seeger, and C. Faloutsos. Slim-Trees: High performance metric trees minimizing overlap between nodes. In C. Zaniolo, P. C. Lockemann, M. H. Scholl, and T. Grust, editors, Proceedings of the 7th International Conference on Extending Database Technology (EDBT 2000), Konstanz, Germany, March 27-31, 2000, volume 1777 of Lecture Notes in Computer Science, pages 51\u201365. Springer, 2000.","DOI":"10.1007\/3-540-46439-5_4"},{"issue":"4","key":"12_CR44_1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"JK Uhlmann","year":"1991","unstructured":"J. K. Uhlmann. Satisfying general proximity\/similarity queries with metric trees. Information Processing Letters, 40(4):175\u2013179, 1991.","journal-title":"Information Processing Letters"},{"key":"12_CR45_1","first-page":"163","volume-title":"Proceedings of the 19th Brazilian Symposium on Databases (SBBD 2004)","author":"MR Vieira","year":"2004","unstructured":"M. R. Vieira, C. Traina, Jr., F. J. T. Chino, and A. J. M. Traina. DBM-Tree: a dynamic metric access method sensitive to local density data. In Proceedings of the 19th Brazilian Symposium on Databases (SBBD 2004), Bras\u00edlia, Distrito Federal, Brasil, October 18-20, 2004, pages 163\u2013177. University of Bras\u00edlia, 2004."},{"issue":"5","key":"12_CR46_1","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1109\/TSMCB.2005.848489","volume":"35","author":"JT-L Wang","year":"2005","unstructured":"J. T.-L. Wang, X. Wang, D. Shasha, and K. Zhang. MetricMap: an embedding technique for processing distance-based queries in metric spaces. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 35(5):973\u2013987, 2005.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics"},{"key":"12_CR47_1","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/0022-2836(87)90478-5","volume":"197","author":"MS Waterman","year":"1987","unstructured":"M. S. Waterman and M. Eggert. A new algorithm for best subsequence alignments with application to tRNA - rRNA comparisons. Journal of Molecular Biology, 197:723\u2013728, 1987.","journal-title":"Journal of Molecular Biology"},{"key":"12_CR48_1","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0001-8708(76)90202-4","volume":"20","author":"MS Waterman","year":"1976","unstructured":"M. S. Waterman, T. F. Smith, and W. A. Beyer. Some biological sequence metrics. Advances in Mathematics, 20:367\u2013387, 1976.","journal-title":"Advances in Mathematics"},{"key":"12_CR49_1","doi-asserted-by":"crossref","unstructured":"W. Xu, W. J. Briggs, J. Padolina, R. E. Timme, W. Liu, C. R. Linder, and D. P. Miranker. Using MoBIoS\u2019 scalable genome join to find conserved primer pair candidates between two genomes. In Proceedings of the 12th International Conference on Intelligent Systems for Molecular Biology\/Third European Conference on Computational Biology (ISMB\/ECCB 2004), Glasgow, UK, pages 355\u2013362, 2004.","DOI":"10.1093\/bioinformatics\/bth929"},{"key":"12_CR50_1","unstructured":"W. Xu, D. P. Miranker, R. Mao, and S. Wang. Metric-space search of protein sequence databases. Technical Report TR-04-06, The University of Texas at Austin, Department of Computer Sciences, October 2003."},{"key":"12_CR51_1","first-page":"311","volume-title":"Proceedings of the 4th Annual ACM Symposium on Discrete Algorithms (SODA 1993)","author":"PN Yianilos","year":"1993","unstructured":"P. N. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proceedings of the 4th Annual ACM Symposium on Discrete Algorithms (SODA 1993), Austin, Texas, USA, January 25-27, 1993, pages 311\u2013321. ACM Press, 1993."},{"key":"12_CR52_1","volume-title":"Excluded middle vantage point forests for nearest neighbor search","author":"PN Yianilos","year":"1998","unstructured":"P. N. Yianilos. Excluded middle vantage point forests for nearest neighbor search. Technical report, NEC Research Institute, Princeton, NJ, July 1998."},{"key":"12_CR53_1","first-page":"421","volume-title":"Proceedings of 27th International Conference on Very Large Data Bases (VLDB 2001)","author":"C Yu","year":"2001","unstructured":"C. Yu, B. C. Ooi, K.-L. Tan, and H. V. Jagadish. Indexing the distance: An efficient method to knn processing. In P. M. G. Apers, P. Atzeni, S. Ceri, S. Paraboschi, K. Ramamohanarao, and R. T. Snodgrass, editors, Proceedings of 27th International Conference on Very Large Data Bases (VLDB 2001), Roma, Italy, September 11-14, 2001, pages 421\u2013430. Morgan Kaufmann, 2001."},{"key":"12_CR54_1","doi-asserted-by":"crossref","unstructured":"P. Zezula, G. Amato, V. Dohnal, and M. Batko. Similarity Search: The Metric Space Approach, volume 32 of Advances in Database Systems. Springer, 2005.","DOI":"10.1007\/0-387-29151-2"},{"issue":"4","key":"12_CR55_1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s007780050069","volume":"7","author":"P Zezula","year":"1998","unstructured":"P. Zezula, P. Savino, G. Amato, and F. Rabitti. Approximate similarity retrieval with M-Trees. The VLDB Journal, 7(4):275\u2013293, 1998.","journal-title":"The VLDB Journal"},{"key":"12_CR56_1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/RIDE.1998.658289","volume-title":"Proceedings of Eight International Workshop on Research Issues in Data Engineering: Continuous-Media Databases and Applications (RIDE 1998)","author":"P Zezula","year":"1998","unstructured":"P. Zezula, P. Savino, F. Rabitti, G. Amato, and P. Ciaccia. Processing M-trees with parallel resources. In Proceedings of Eight International Workshop on Research Issues in Data Engineering: Continuous-Media Databases and Applications (RIDE 1998), Orlando, Florida, USA, February 23-24, 1998, pages 147\u2013154. IEEE Computer Society, 1998."}],"container-title":["Studies in Computational Intelligence","Computational Intelligence in Medical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75767-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,25]],"date-time":"2025-01-25T16:00:38Z","timestamp":1737820838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75767-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540757665","9783540757672"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75767-2_12","relation":{},"ISSN":["1860-949X"],"issn-type":[{"type":"print","value":"1860-949X"}],"subject":[],"published":{"date-parts":[[2008]]}}}