Searching in high-dimensional spaces - Index structures for improving the performance of multimedia databases

ACM Computing Surveys

Volumn 33, Issue 3, 2001, Pages 322-373

  Böhm, Christian ^a,b   Berchtold, Stefan ^a,b   Keim, Daniel A ^a,c  

^a UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF KONSTANZ   (Germany)

^c Moritzplatz 6   (Germany)

Author keywords

Index structures; Indexing high dimensional data; Multimedia databases; Similarity search

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA STORAGE EQUIPMENT; DATA STRUCTURES; FEATURE EXTRACTION; INDEXING (OF INFORMATION); MULTIMEDIA SYSTEMS; PATTERN MATCHING; QUERY LANGUAGES; RELATIONAL DATABASE SYSTEMS;

DISCRETE MATHEMATICS; MULTIMEDIA DATABASES; SIMILARITY SEARCH;

CONTENT BASED RETRIEVAL;

EID: 0038670812     PISSN: 03600300     EISSN: None     Source Type: Journal    
DOI: 10.1145/502807.502809     Document Type: Article

References (128)

1. ABEL, D. AND SMITH, J. 1983. A data structure and algorithm based on a linear key for a rectangle retrieval problem. Comput. Vis. 24,1-13.
2. AGRAWAL, R., FALOUTSOS, C., AND SWAMi, A. 1993. Efficient similarity search in sequence databases. In Proa 4th Int. Conf. on Foundations of Data Organization and Algorithms, LNCS 730, 69-84.
3. AGRAWAL, R., GEHRKE, J., GUNOPULOS, D., AND RAGHAVAN, P. 1998. Automatic subspace clustering of high-dimensional data for data mining applications. In Proc. ACMSIGMOD Int. Conf. on Management of Data (Seattle), 94-105.
4. AGRAWAL, R., LIN, K., SAWHNEY, H., AND SHIM, K. 1995. Fast similarity search in the presence of noise, scaling, and translation in time-series databases. In Proc. 21st Int. Conf. on Very Large Databases, 490-501.
5. ALTSCHUL, S., GISH, W., MILLER, W., MYERS, E., AND LIPMAN, D. 1990. A basic local alignment search tool. J. Molecular Biol. 215, 3, 403-410.
6. AOKI, P. 1998. Generalizing "search" in generalized search trees. In Proc. 14th Int. Conf. on Data Engineering (Orlando, FL), 380-389.
7. AREF, W. AND SAMET, H. 1991. Optimization strategies for spatial query processing. In Proc. 17th Int. Conf. on Very Large Databases (Barcelona), 81-90.
8. ARYA, S, 1995. Nearest neighbor searching and applications. PhD thesis, University of Maryland, College Park, MD.
9. ARYA, S., MOUNT, D., AND NARAYAN, O. 1995. Accounting for boundary effects in nearest neighbor searching. In Proc. llth Symp. on Computational Geometry (Vancouver, Canada), 336-344.
10. BAEZA-YATES, R., CUNTO, W., MANBER, U., AND Wu, S. 1994. Proximity matching using fixed-queries trees. In Proc. Combinatorial Pattern Matching, LNCS 807,198-212.
11. BAYER, R. AND McCREiGHT, E. 1977. Organization and maintenance of large ordered indices. Acta Inf. 1, 3, 173-189.
12. BECKMANN, N., KRIEGEL, H.-R, SCHNEIDER, R., AND SEEGER, B. 1990. The r*-tree: An efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Int. Conf. on Management of Data (Atlantic City, NJ), 322-331.
13. BELUSSI, A. AND FALOUTSOS, C. 1995. Estimating the selectivity of spatial queries using the correlation fractal dimension. In Proa 21st Int. Conf. on Very Large Databases (Zurich), 299-310.
14. BENTLEY, J. 1975. Multidimensional search trees used for associative searching. Commun. ACM IS, 9, 509-517.
15. BENTLEY, J. 1979. Multidimensional binary search in database applications. IEEE Trans. Softw. Eng. 4, 5, 397-409.
16. BERCHTOLD, S. AND KEIM, D. 1998. High-dimensional index structures - Database support for next decades's applications. In Tutorial ACM SIGMOD Int. Conf. on Management of Data (Seattle, NJ).
17. BERCHTOLD, S., BÖHM, C., BRAUNMÜLLER, B., KEIM, D., AND KRIEGEL, H.-P. 1997a. Fast parallel similarity search in multimedia databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data.
18. BERCHTOLD, S., BÖHM, C., JAGADISH, H., KRIEGEL, H.-R, AND SANDER, J. 2000a. Independent quantization: An index compression technique for highdimensional data spaces. InPro& 16th Int. Conf. on Data Engineering.
19. BERCHTOLD, S., BöHM, C., KEIM, D., AND KRIEGEL, H.-P. 1997b. A cost model for nearest neighbor search in high-dimensional data space. In Proc. ACM PODS Symp. on Principles of Database Systems (Tucson, AZ).
20. BERCHTOLD, S., BöHM, C., KEIM, D., AND KRIEGEL, H.-P. 2001. On optimizing processing of nearest neighbor queries in high-dimensional data space. Proc. Conf. on Database Theory, 435-449.
21. BERCHTOLD, S., BöHM, C., KEIM, D., KRIEGEL, H.-R, AND Xu, X. 2000c. Optimal multidimensional query processing using tree striping. Dawak, 244-257.
22. BERCHTOLD, S., BöHM, C., AND KRIEGEL, H.-P. 1998a. Improving the query performance of high-dimensional index structures using bulk-load operations. In Proa 6th Int. Conf. on Extending Database Technology (Valencia, Spain).
23. BERCHTOLD, S., BöHM, C., AND KRIEGEL, H.-P. 1998b. The pyramid-technique: Towards indexing beyond the curse of dimensionality. In Proc. ACM SIGMOD Int. Conf. on Management of Data (Seattle, NJ), 142-153.
24. BERCHTOLD, S., ERTL, B., KEIM, D., KRIEGEL, H.-R, AND SEIDL, T. 1998c. Fast nearest neighbor search in high-dimensional spaces. In Proc. 14th Int. Conf. on Data Engineering (Orlando, FL).
25. BERCHTOLD, S., JAGADISH, H., AND Ross, K. 1998d. Independence diagrams: A technique for visual data mining. In Proc. 4th Int. Conf. on Knowledge Discovery and Data Mining (Neiv York), 139-143.
26. BERCHTOLD, S., KEIM, D., AND KRIEGEL, H.-P. 1996. The x-tree: An index structure for high-dimensional data. In Proc. 22nd Int. Conf. on Very Large Databases (Bombay), 28-39.
27. BERCHTOLD, S., KEIM, D., KRIEGEL, H.-P., AND SEIDL, T. 2000d. Indexing the solution space: A new technique for nearest neighbor search in high-dimensional space. IEEE Trans. Knowl. Data Eng., 45-57.
28. BEYER, K., GOLDSTEIN, J., RAMAKRISHNAN, R., AND SHAFT, U. 1999. When is "nearest neighbor" meaningful? In Proc. Int. Conf. on Database Theory, 217-235.
29. BÖHM, C. 1998. Efficiently indexing high-dimensional databases. PhD thesis, University of Munich, Germany.
30. BÖHM, C. 2000. A cost model for query processing in high-dimensional data spaces. To appear in: ACM Trans. Database Syst.
31. BOZKAYA, T. AND OZSOYOGLU, M. 1997. Distance-based indexing for high-dimensional metric spaces. SIGMOD Rec. 26, 2, 357-368.
32. BRIN, S. 1995. Near neighbor search in large metric spaces. In Proc. 21st Int. Conf. on Very Large Databases (Switzerland), 574-584.
33. BURKHARD, W. AND KELLER, R. 1973. Some approaches to best-match file searching. Commun. ACM 16,4, 230-236.
34. CHEUNG, K. AND Fu, A. 1998. Enhanced nearest neighbour search on the r-tree. SIGMOD Rec. 27, 3, 16-21.
35. CHIUEH, T. 1994. Content-based image indexing. In Proc. 20th Int. Conf. on Very Large Databases (Chile), 582-593.
36. CIACCIA, P., PATELLA, M., AND ZEZULA, P. 1997. M-tree: An efficient access method for similarity search in metric spaces. In Proc. 23rd Int. Conf. on Very Large Databases (Greece), 426-435.
37. CIACCIA, P., PATELLA, M., AND ZEZULA, P. 1998. A cost model for similarity queries in metric spaces. In Proc. 17th ACM Symp. on Principles of Database Systems (Seattle), 59-67.
38. CLEARY, J. 1979. Analysis of an algorithm for finding nearest neighbors in Euclidean space. ACM Trans. Math. Softw. 5, 2,183-192.
39. COMER, D. 1979. The ubiquitous b-tree. ACM Comput. Sum 11, 2, 121-138.
40. CORRAL, A., MANOLOPOULOS, Y., THEODORIDIS, Y., AND VASSILAKOPOULOS, M. 2000. Closest pair queries in spatial databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 189-200.
41. EASTMAN, C. 1981. Optimal bucket size for nearest neighbor searching in Ad-trees. Inf. Proc. Lett. 12, 4.
42. EVANGELIDIS, G. 1994. The hBMree: A concurrent and recoverable multi-attribute index structure. PhD thesis, Northeastern University, Boston, MA.
43. π-tree: A multiattribute index supporting concurrency, recovery and node consolidation. VLDB J. 6, 1, 1-25.
44. FALOUTSOS, C. 1985. Multiattribute hashing using gray codes. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 227-238.
45. FALOUTSOS, C. 1988. Gray codes for partial match and range queries. IEEE Trans. Softw. Eng. 14, 1381-1393.
46. FALOUTSOS, C. AND GAEDE, V. 1996. Analysis of n-dimensional quadtrees using the Hausdorff fractal dimension. In Proc. 22nd Int. Conf. on Very Large Databases (Mumbai, India), 40-50.
47. FALOUTSOS, C. AND KAMEL, I. 1994. Beyond uniformity and independence: Analysis of r-trees using the concept of fractal dimension. In Proc. 13th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (Minneapolis, MN), 4-13.
48. FALOUTSOS, C. AND LIN, K.-I. 1995. Fast map: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia data. In Proc. ACM SIGMOD Int. Conf. on Management of Data (San Jose, CA), 163-174.
49. FALOUTSOS, C. AND ROSEMAN, S. 1989. Fractals for secondary key retrieval. In Proc. 8th ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 247-252.
50. FALOUTSOS, C., BARBER, R., FLICKNER, M., AND HAFNER, J. 1994a. Efficient and effective querying by image content. J. Intell. Inf. Syst. 3, 231-262.
51. FALOUTSOS, C., RANGANATHAN, M., AND MANOLOPOULOS, Y. 1994b. Fast subsequence matching in time-series databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 419-429.
52. FALOUTSOS, C., SELLIS, T., AND ROUSSOPOULOS, N. 1987. Analysis of object-oriented spatial access methods. In Proc. ACM SIGMOD Int. Conf. on Management of Data.
53. FINKEL, R. AND BENTLEY, J. 1974. Quad trees: A data structure for retrieval of composite trees. Acta Inf. 4, 1, 1-9.
54. FREESTON, M. 1987. The bang file: A new kind of grid file. In Proc. ACM SIGMOD Int. Conf. on Management of Data (San Francisco), 260-269.
55. FRIEDMAN, J., BENTLEY, J., AND FINKEL, R. 1977. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3,3, 209-226.
56. GAEDE, V. 1995. Optimal redundancy in spatial database systems. In Proc. 4th Int. Symp. on Advances in Spatial Databases (Portland, ME), 96-116.
57. GAEDE, V. AND GüNTHER, O. 1998. Multidimensional access methods. ACM Comput. Surv. 30,2, 170-231.
58. GIONIS, A., INDYK, P., AND MOTWANI, R. 1999. Similarity search in high dimensions via hashing. In Proc. 25th Int. Conf. on Very Large Databases (Edinburgh), 518-529.
59. GREENE, D. 1989. An implementation and performance analysis of spatial data access methods. In Proc. 5th IEEE Int. Conf. on Data Engineering.
60. GUTTMAN.A. 1984. R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMODInt. Conf. on Management of Data (Boston), 47-57.
61. HELLERSTEIN, J., KOUTSOUPIAS, E., AND PAPADIMITRIOU, C. 1997. On the analysis of indexing schemes. In Proc. 16th SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (Tucson, AZ), 249-256.
62. HELLERSTEIN, J., NAUGHTON, J., AND PFEFFER, A. 1995. Generalized search trees for database systems. In Proc. 21st Int. Conf. on Very Large Databases (Zurich), 562-573.
63. HENRICII, A. 1994. A distance-scan algorithm for spatial access strucures. InProc. 2nd ACM Workshop on Advances in Geographic Information Systems (Gaithersburg, MD), 136-143.
64. h-tree: An access structure for feature vectors. In Proc. 14th Int. Conf. on Data. Engineering (Orlando, FL).
65. HENRICII, A., SK, H.-W., AND WIDMAYER, P. 1989. The Isd-tree: Spatial access to multidimensional point and non-point objects. In Proc. 15th Int. Conf. on Very Large Databases (Amsterdam, The Netherlands), 45-53.
66. HINNEBUEG, A. AND KEIM, D. 1998. An efficient approach to clustering in large multimedia databases with noise. In Proc. Int. Conf. on Knowledge Discovery in Databases (New York).
67. HINRICHS, K. 1985. Implementation of the grid file: Design concepts and experience. BIT 25, 569-592.
68. HJALTASON, G. AND SAMET, H. 1995. Ranking in spatial databases. In Proc. 4th Int. Symp. on Large Spatial Databases (Portland, ME), 83-95.
69. HJALTASON, G. AND SAMET, H. 1998. Incremental distance join algorithms for spatial databases. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 237-248.
70. HUTFLESZ, A., SK, H.-W., AND WIDMAYER, P. 1988a. Globally order preserving multidimensional linear hashing. In Proc. 4th IEEE Int. Conf. on Data Engineering, 572-579.
71. HUTFLESZ, A., SK, H.-W, AND WIDMAYER, P. 1988b. Twin grid files: Space optimizing access schemes. In Proc. ACM SIGMOD Int. Conf. on Management of Data.
72. JAGADISH, H. 1990. Linear clustering of objects with multiple attributes. In Proc. ACM SIGMOD Int. Conf. on Management of Data (Atlantic City, NJ), 332-342.
73. JAGADISH, H. 1991. A retrieval technique for similar shapes. In Proa ACM SIGMOD Int. Conf. on Management of Data, 208-217.
74. JAIN, R. AND WHITE, D. 1996. Similarity indexing: Algorithms and performance. In Proa SPIE S torage and Retrieval for Image and Video Databases IV (San Jose, CA), 62-75.
75. KAMEL, I. AND FALOUTSOS, C. 1992. Parallel r-trees. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 195-204.
76. KAMEL, I. AND FALOUTSOS, C. 1993. On packing r-trees. CIKM, 490-499.
77. KAMEL, I. AND FALOUTSOS, C. 1994. Hubert r-tree: An improved r-tree using fractals. In Proc. 20th Int. Conf. on Very Large Databases, 500-509.
78. KATAYAMA, N. AND SATOH, S. 1997. The sr-tree: An index structure for high-dimensional nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 369-380.
79. KNUTH, D. 1975. The Art of Computer Programming-Volume 3: Sorting and Searching. Addison-Wesley, Reading, Mass.
80. KORN, F. AND MUTHUKRISILVAN, S. 2000. Influence sets based on reverse nearest neighbor queries. In Proa ACM SIGMOD Int. Conf. on Management of Data, 201-212.
81. KORN, F., SIDIROPOULOS, N., FALOUTSOS, C., SIEGEL, E., AND PROTOPAPAS, Z. 1996. Fast nearest neighbor search in medical image databases. In Proc. 22nd Int. Conf. on Very Large Databases (Mumbai, India), 215-226.
82. KORNACKER, M. 1999. High-performance generalized search trees. In Proc. 24th Int. Conf. on Very Large Databases (Edinburgh).
83. KRIEGEL, H.-P. AND SEEGER, B. 1986. Multidimensional order preserving linear hashing with partial extensions. In Proc. Int. Conf. on Database Theory, Lecture Notes in Computer Science, vol. 243, Springer-Verlag, New York.
84. KRIEGEL, H.-P. AND SEEGER, B. 1987. Multidimensional dynamic quantité hashing is very efficient for non-uniform record distributions. In Proc. 3rd Int. Conf. on Data Engineering, 10-17.
85. KRIEGEL, H.-P. AND SEEGER, B. 1988. Plop-hashing: A grid file without directory. In Proc. 4th Int. Conf. on Data Engineering, 369-376.
86. KRISHNAMURTHY, R. AND WHANG, K.-Y. 1985. Multilevel Grid Files. IBM Research Center Report, Yorktown Heights, NY.
87. KUHCH, K. 1992. Techniques for automatically correcting words in text. ACM Comput. Sum 24, 4, 377-440.
88. LIN, K., JAGADISH, H., AND FALOUTSOS, C. 1995. The tv-tree: An index structure for high-dimensional data. VLDB J. 3, 517-542.
89. LOMET, D. AND SALZBERG, B. 1989. The hb-tree: A robust multiattribute search structure. In Proa 5th IEEE Int. Conf. on Data Engineering, 296-304.
90. LOMET, D. AND SALZBERG, B. 1990. The hb-tree: A multiattribute indexing method with good guaranteed performance. ACM Trans. Database Syst. 15, 4, 625-658.
91. MANDELBROT, B. 1977. Fractal Geometry of Nature. W.H. Freeman, New York.
92. MEHROTRA, R. AND GARY, J. 1993. Feature-based retrieval of similar shapes. In Proc. 9th Int. Conf. on Data Engineering.
93. MEHROTRA, R. AND GARY, J. 1995. Feature-indexbased similar shape retrieval. In Proc, 3rd Working Conf. on Visual Database Systems.
94. MORTON, G. 1966. A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing. IBM Ltd., USA.
95. MUMFORD, D. 1987. The problem of robust shape descriptors. In Proc. 1st IEEE Int. Conf. on Computer Vision.
96. NlEVERGELT, J., HlNTERBERGER, H., AND SEVCIK, K. 1984. The grid file: An adaptable, symmetric multikey file structure. ACM Trans. Database Syst. 9, 1, 38-71.
97. ORENSTEIN, J. 1990. A comparison of spatial query processing techniques for native and parameter spaces. In Proc, ACM SIGMOD Int. Conf. on Management of Data, 326-336.
98. ORENSTEIN, J. AND MERKET, T. 1984. A class of data structures for associative searching. In Proc. 3rd ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 181-190.
99. OTOO, E. 1984. A mapping function for the directory of a multidimensional extendible hashing. In Proc. 10th Int. Conf. on Very Large Databases, 493-506.
100. OUKSEL, M. 1985. The interpolation based grid file. In Proc. 4th ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 20-27.
101. OUSKEL, A. AND MATES, O. 1992. The nested interpolation-based Grid File. Acta Informatika 29, 335-373.
102. PAGEL, B.-U, Six, H.-W., TOBEN, H., AND WIDMAYER, P. 1993. Towards an analysis of range query performance in spatial data structures. In Proc. 12th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (Washington, DC), 214-221.
103. PAPADOPOULOS, A. AND MANOLOPOULOS, Y. 1997a. Nearest neighbor queries in shared-nothing environments. Geoinf. 1, 1,1-26.
104. PAPADOPOULOS, A. AND MANOLOPOULOS, Y. 1997b. Performance of nearest neighbor queries in r-trees. In Proc. 6th Int. Conf. on Database Theory, Lecture Notes in Computer Science, vol. 1186, Springer-Verlag, New York, 394-408.
105. PAPADOPOULOS, A. AND MANOLOPOULOS, Y. 1998. Similarity query processing using disk arrays. In Proa ACM SIGMOD Int. Conf. on Management ofData.
106. RIEDEL, E., GlBSON, G., AND FALOUTSOS, C. 1998. Actice storage for large-scale data mining and multimedia. In Proc. 24th Int. Conf. on Very Large Databases, 62-73.
107. ROBINSON, J. 1981. The fc-d-6-tree: A search structure for large multidimensional dynamic indexes. In Proc. ACMSIGMOD Int. Conf. on Management of Data, 10-18.
108. ROUSSOPOULOS, N., KELLEY, S., AND VINCENT, F. 1995. Nearest neighbor queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data, 71-79.
109. SAGAN, H. 1994. Space Filling Curves. Springer-Verlag, New York.
110. SCHRÖDER, M. 1991. Fractals, Chaos, Power Laws: Minutes from an Infinite Paradise. W.H. Freeman, New York.
111. SEEGER, B. AND KRIEGEL, H.-P. 1990. The buddy tree: An efficient and robust access method for spatial data base systems. In Proc. 16th Int. Conf. on Very Large Databases (Brisbane), 590-601.
112. SEIDL, T. 1997. Adaptable similarity search in 3-d spatial database systems. PhD thesis, University of Munich, Germany.
113. SEIDL, T. AND KRIEGEL, H.-P. 1997. Efficient user-adaptable similarity search in large multimedia databases. In Proc. 23rd Int. Conf. on Very Large Databases (Athens).
114. +-tree: A dynamic index for multidimensional objects. In Proa 13th Int. Conf. on Very Large Databases (Brighton, GB), 507-518.
115. SHAWNEY, H. AND HAFNER, J. 1994. Efficient color histogram indexing. In Proc. Int. Conf. on Image Processing, 66-70.
116. SHOICHET, B., BODIAN, D., AND KUNTZ, I. 1992. Molecular docking using shape descriptors. J. Comput. Chem. 13,3, 380-397.
117. SPROULL, R. 1991. Refinements to nearest neighbor searching in k -dimensional trees. Algorithmica, 579-589.
118. STANOI, I., AGRAWAL, D., AND ABBADI, A. 2000. Reverse nearest neighbor queries for dynamic databases. In Proc. ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 44-53.
119. STONEBRAKER, M., SELLIS, T., AND HANSON, E. 1986. An analysis of rule indexing implementations in data base systems. In Proc. Int. Conf. on Expert Database Systems.
120. THEODORIDIS, Y. AND SELLIS, T. 1996. A model for the prediction of r-tree performance. In Proc. 15th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (Montreal), 161-171.
121. UHLMANN, J. 1991. Satisfying general proximity/similarity queries with metric trees. Inf. Proc. Lett. 145-157.
122. VAN DEN BERCKEN, J., SEEGER, B., AND WIDMAYER, P. 1997. A general approach to bulk loading multidimensional index structures. In Proc. 23rd Int. Conf. on Very Large Databases (Athens).
123. WALLACE, T. AND WLNTZ, P. 1980. An efficient threedimensional aircraft recognition algorithm using normalized Fourier descriptors. Comput. Graph. Image Proc. 13, 99-126.
124. WEBER, R., SCHEK, H.-J., AND BLOTT, S. 1998. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. Int. Conf. on Very Large Databases (New York).
125. WHITE, D. AND JAIN, R. 1996. Similarity indexing with the ss-tree. In Proa 12th Int. Conf. on Data Engineering (New Orleans).
126. YAO, A. AND YAO, F. 1985. A general approach to d-dimensional geometric queries. In Proc. ACM Symp. on Theory of Computing.
127. YIANILOS, P. 1993. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, 311-321.
128. YIANILOS, P. 1999. Excluded middle vantage point forests for nearest neighbor search. In Proc. DIMACS Implementation Challenge (Baltimore, MD).