
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Stefan Berchtold, Daniel A. Keim, HansPeter Kriegel, Thomas Seidl, "Indexing the Solution Space: A New Technique for Nearest Neighbor Search in HighDimensional Space," IEEE Transactions on Knowledge and Data Engineering, vol. 12, no. 1, pp. 4557, January/February, 2000.  
BibTex  x  
@article{ 10.1109/69.842249, author = {Stefan Berchtold and Daniel A. Keim and HansPeter Kriegel and Thomas Seidl}, title = {Indexing the Solution Space: A New Technique for Nearest Neighbor Search in HighDimensional Space}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {12}, number = {1}, issn = {10414347}, year = {2000}, pages = {4557}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.842249}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Indexing the Solution Space: A New Technique for Nearest Neighbor Search in HighDimensional Space IS  1 SN  10414347 SP45 EP57 EPD  4557 A1  Stefan Berchtold, A1  Daniel A. Keim, A1  HansPeter Kriegel, A1  Thomas Seidl, PY  2000 KW  Nearest neighbor search KW  highdimensional indexing KW  efficient query processing KW  spatial databases KW  Voronoi diagrams. VL  12 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Abstract—Similarity search in multimedia databases requires an efficient support of nearestneighbor search on a large set of highdimensional points as a basic operation for query processing. As recent theoretical results show, state of the art approaches to nearestneighbor search are not efficient in higher dimensions. In our new approach, we therefore precompute the result of any nearestneighbor search which corresponds to a computation of the Voronoi cell of each data point. In a second step, we store conservative approximations of the Voronoi cells in an index structure efficient for highdimensional data spaces. As a result, nearest neighbor search corresponds to a simple point query on the index structure. Although our technique is based on a precomputation of the solution space, it is dynamic, i.e., it supports insertions of new data points. An extensive experimental evaluation of our technique demonstrates the high efficiency for uniformly distributed as well as real data. We obtained a significant reduction of the search time compared to nearest neighbor search in other index structures such as the Xtree.
[1] S.F. Altschul, W. Gish, W. Miller, E.W. Myers, and D.J. Lipman, “A Basic Local Alignment Search Tool,” J. Molecular Biology, vol. 215, no. 3, pp. 403410, 1990.
[2] S. Arya, “Nearest Neighbor Searching and Applications,” PhD thesis, Univ. of Maryland, College Park, 1995.
[3] S. Berchtold, C. Böhm, and H.P. Kriegel, “Improving the Query Performance of HighDimensional Index Structures Using BulkLoad Operations,” Proc. Sixth Int'l Conf. Extending Database Technology (EDBT), 1998.
[4] S. Berchtold, C. Böhm, and H.P. Kriegel, “The PyramidTechnique: Towards Breaking the Curse of Dimensionality,” Proc. ACM SIGMOD Int'l Conf. Managment of Data, 1998.
[5] S. Berchtold, C. Böhm, and H.P. Kriegel, “A Cost Model for Nearest Neighbor Search in HighDimensional Data Spaces,” Proc. 16th ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems (PODS), pp. 7886, 1997.
[6] B. Becker, P.G. Franciosa, S. Gschwind, T. Ohler, G. Thiemt, and P. Widmayer, “Enclosing Many Boxes by an Optimal Pair of Boxes,” Proc. Ninth Ann. Symp. Thoretical Aspects of Computer Science (STACS '92), pp. 475486, 1992.
[7] B. Becker, P.G. Franciosa, S. Gschwind, S. Leonardi, T. Ohler, and P. Widmayer, “Enclosing a Set of Objects by Two Minimum Area Rectangles,” J. Algorithms, vol. 21, no. 3, pp. 520541, 1996.
[8] S. Berchtold, C. Böhm, B. Braunmüller, D. Keim, and H.P. Kriegel, “Fast Parallel Similarity Search in Multimedia Databases,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 112, 1997.
[9] S. Berchtold, D. Keim, and H.P. Kriegel, “The XTree: An Index Structure for HighDimensional Data,” Proc. 22nd Conf. Very Large Data Bases, pp. 2839, 1996.
[10] T. Brinkhoff, H.P. Kriegel, and R. Schneider, “Comparison of Approximations of Complex Objects Used for ApproximationBased Query Processing in Spatial Database Systems,” Proc. Ninth Int'l Conf. Data Eng., pp. 4049, 1993.
[11] N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, “The R*Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Conf. Management of Data, 1990.
[12] M.J. Best and K. Ritter, Linear Programming. Active Set Analysis and Computer Programs. Englewood Cliffs, N.J.: Prentice Hall, 1985.
[13] G.B. Dantzig, Linear Programming and Extensions (in German). Berlin: Springer, 1966.
[14] H. Edelsbrunner, Algorithms in Combinatorical Geometry. EATCS Monographs in Computer Science, Berlin: Springer, 1987.
[15] C. Faloutsos, R. Barber, M. Flicker, J. Hafner, W. Niblack, and W. Equitz, "Efficient and effective querying by image content," J. Intell. Information Systems," vol. 3, pp. 231262, 1994.
[16] G.R. Hjaltason and H. Samet, “Ranking in Spatial Databases,” Proc. Fourth Int'l Symp. Large Spatial Databases, pp. 8395, 1995.
[17] H.V. Jagadish, “A Retrieval Technique for Similar Shapes,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 208217, 1991.
[18] R. Jain and D.A. White, “Similarity Indexing: Algorithms and Performance,” Proc. SPIE Storage and Retrieval for Image and Video Databases IV, vol. 2670, pp. 6275, 1996.
[19] H.P. Kriegel, H. Horn, and M. Schiwietz, “The Performance of Object Decomposition Techniques for Spatial Query Processing,” Proc. Second Symp. Large Spatial Databases, pp. 257276, 1991.
[20] N. Katayama and S. Satoh, “The SRTree: An Index Structure for HighDimensional Nearest Neighbor Queries,” Proc. SIGMOD, Int'l Conf. Management of Data, pp. 369380, 1997.
[21] K. Lin, H.V. Jagadish, and C. Faloutsos, “The TVTree: An Index Structure for HighDimensional Data,” VLDB J., vol. 3, pp. 517542, 1995.
[22] R. Mehrotra and J.E. Gary, “FeatureBased Retrieval of Similar Shapes,” Proc. Ninth Int'l Conf. Data Eng., pp. 108115, 1993.
[23] A. Papadopoulos and Y. Manolopoulos, “Performance of Nearest Neighbor Queries in RTrees,” Proc. Sixth Int'l Conf. Database Theory, pp. 394408, 1997.
[24] F.P. Preparata and M.I. Shamos, Computational Geometry. SpringerVerlag, 1985.
[25] N. Roussopoulos, S. Kelley, and F. Vincent, “Nearest Neighbor Queries,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 7179, 1995.
[26] J.T. Robinson, “The KDBTree: A Search Structure for Large Multidimensional Dynamic Indexes,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 1018, 1981.
[27] T. Roos, “Dynamic Voronoi Diagrams,” PhD thesis, Univ. of Würzburg, Germany, 1991.
[28] B.K. Shoichet, D.L. Bodian, and I.D. Kuntz, “Molecular Docking Using Shape Descriptors,” J. Computational Chemistry, vol. 13, no. 3, pp. 380397, 1992.
[29] R. Seidel, “Linear Programming and Convex Hulls Made Easy,” Proc. Sixth Ann. Symp. Computational Geometry, pp. 211215, 1990.
[30] H. Sawhney and J. Hafner, “Efficient Color Histogram Indexing,” Proc. Int'l Conf. Image Processing, pp. 6670, 1994.
[31] M. Schiwietz and H.P. Kriegel, “Query Processing of Spatial Objects: Complexity versus Redundancy,” Proc. Third Int'l Symp. Large Spatial Databases, pp. 377396, 1993.
[32] T. Seidl and H.P. Kriegel, “Optimal MultiStep kNearest Neighbor Search,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 154165, 1998.
[33] D. White and R. Jain, “Similarity Indexing with the SSTree,” Proc. 12th Int'l Conf. Data Eng., 1996.