
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Flip Korn, BerndUwe Pagel, Christos Faloutsos, "On the 'Dimensionality Curse' and the 'SelfSimilarity Blessing'," IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 1, pp. 96111, January/February, 2001.  
BibTex  x  
@article{ 10.1109/69.908983, author = {Flip Korn and BerndUwe Pagel and Christos Faloutsos}, title = {On the 'Dimensionality Curse' and the 'SelfSimilarity Blessing'}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {13}, number = {1}, issn = {10414347}, year = {2001}, pages = {96111}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.908983}, 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  On the 'Dimensionality Curse' and the 'SelfSimilarity Blessing' IS  1 SN  10414347 SP96 EP111 EPD  96111 A1  Flip Korn, A1  BerndUwe Pagel, A1  Christos Faloutsos, PY  2001 KW  Nearestneighbor search KW  multimedia indexing KW  fractals. VL  13 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Abstract—Spatial queries in highdimensional spaces have been studied extensively recently. Among them, nearestneighbor queries are important in many settings, including spatial databases (
[1] R. Agrawal, C. Faloutsos, and A. Swami, “Efficient Similarity Search in Sequence Databases,” Proc. Fourth Int'l Conf. Foundations of Data Organization and Algorithms, pp. 6984, Oct. 1993.
[2] L. Arge, V. Samoladas, and J.S. Vitter, “On TwoDimensional Indexability and Optimal Range Search Indexing,” Proc. Principles of Database Systems (PODS '99), pp. 346–357, May 1999.
[3] 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.
[4] A. Belussi and C. Faloutsos, “Estimating the Selectivity of Spatial Queries Using the‘Correlation’Fractal Dimension,” Proc. Very Large Data Bases Conf., pp. 299–310, Sept. 1995.
[5] 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.
[6] 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.
[7] S. Berchtold, C. Bohm, H.V. Jagadish, H.P. Kriegel, and J. Sander, “Independent Quantization: An Index Compression Technique for HighDimensional Data Spaces,” Proc. Int'l Conf. Data Eng. 2000, pp. 577–588, Mar. 2000.
[8] 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.
[9] S. Berchtold, B. Ertl, D.A. Keim, H.P. Kriegel, and T. Seidl, “Fast Nearest Neighbor Search in HighDimensional Spaces.,” Proc. Int'l Conf. Data Eng. (ICDE '98), pp. 209–218, Feb. 1998.
[10] 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.
[11] K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, “When Is‘Nearest Neighbor’Meaningful?,” Proc. Int'l Conf. Database Theory (ICDT '99), pp. 217–235, Jan. 1999.
[12] A. Borodin, R. Ostrovsky, and Y. Rabani, “Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems,” Proc. ACM Symp. Theory of Computing (STOC '99), pp. 312–321, May 1999.
[13] S. Christodoulakis,“Implications of certain assumptions in database performance evaluation,” ACM Trans. on Database Systems, vol. 9, no. 2, pp. 163186, June 1984.
[14] P. Ciaccia, M. Patella, and P. Zezula, “A Cost Model for Similarity Queries in Metric Spaces,” Proc. Principles of Database Systems (PODS '98), pp. 59–68, June 1998.
[15] C. Faloutsos and I. Kamel, “Beyond Uniformity and Independence: Analysis of RTrees Using the Concept of Fractal Dimension,” Proc. 13th ACM Symp. Principles of Database Systems (PODS), 1994.
[16] C. Faloutsos, B. Seeger, A. Traina, and C. Traina Jr, “Spatial Join Selectivity Using Power Laws,” Proc. Special Interest Group on Management of Data (SIGMOD '00), May 2000.
[17] V. Gaede and O. Guenther, “Multidimensional Access Methods,” ACM Computing Surveys, vol. 30, no. 2, pp. 123169, 1998.
[18] A. Gionis, P. Indyk, and R. Motwani, “Similarity Search in High Dimensions via Hashing,” Proc. Very Large Data Base Conf. (VLDB '99), pp. 518–529, Sept. 1999.
[19] J. Goldstein and R. Ramakrishnan, “Contrast Plots and PSphere Trees: Space vs. Time in NN Searches,” Proc. Very Large Data Bases Conf. (VLDB '00), Sept. 2000.
[20] A. Guttman, “RTrees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Conf. Management of Data, 1984.
[21] J. Hellerstein, E. Koutsoupias, and C. Papadimitriou, “On the Analysis of Indexing Schemes,” Proc. Principles of Database Systems (PODS '97), pp. 249–256, May 1997.
[22] J.M. Hellerstein, J.F. Naughton, and A. Pfeffer, “Generalized Search Trees for Database Systems,” Proc. Very Large Data Base (VLDB) Conf., pp. 562–573, Sept. 1995.
[23] A. Hinneburg, C.C. Aggarwal, and D. Keim, “What Is the Nearest Neighbor in High Dimensional Spaces?” Proc. Very Large Data Base Conf. (VLDB '00), Sept. 2000.
[24] G.R. Hjaltason and H. Samet, “Ranking in Spatial Databases,” Proc. Fourth Int'l Symp. Large Spatial Databases, pp. 8395, 1995.
[25] I. Kamel and C. Faloutsos, "Hilbert RTree: An Improved RTree using Fractals," Proc. Int'l Conf. Very Large Data Bases, 1994.
[26] 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.
[27] V. Kobla, D. Doermann, K.I. Lin, and C. Faloutsos, “Compressed Domain Video Indexing Techniques Using DCT and Motion Vector Information in MPEG Video,” Proc. Int'l Soc. Optical Eng., vol. 2,916, Nov. 1996.
[28] F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas, “Fast NearestNeighbor Search in Medical Image Databases,” Proc. Conf. Very Large Data Bases (VLDB '96), Sept. 1996.
[29] S.T. Leutenegger, M.A. Lopez, and J.M. Edgington, “Str: A Simple and Efficient Algorithm for RTree Packing,” Proc. Int'l Conf. Data Eng. (ICDE '97), pp. 497–506, Apr. 1997.
[30] K. Lin, H.V. Jagadish, and C. Faloutsos, “The TVTree: An Index Structure for HighDimensional Data,” VLDB J., vol. 3, pp. 517542, 1995.
[31] F. Le Lionnais, Le Nombres Remarquables. Paris: Hermann, 1983.
[32] B.U. Pagel, H.W. Six, H. Toben, and P. Widmayer, “Towards an Analysis of Range Query Performance,” Proc. 12th ACM Symp. Principles of Database Systems (PODS), 1993.
[33] B.U. Pagel and H.W. Six, “Are Window Queries Representative for Arbitrary Range Queries?” Proc. 15th ACM Symp. Principles of Database Systems (PODS), 1996.
[34] A. Papadopoulos and Y. Manolopoulos, “Performance of Nearest Neighbor Queries in RTrees,” Proc. Sixth Int'l Conf. Database Theory, pp. 394408, 1997.
[35] Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima, “The ATree: An Index Structure for HighDimensional Spaces Using Relative Approximation,” Proc. Very Large Data Base Conf. (VLDB '00), Sept. 2000.
[36] V. Samoladas and D.P. Miranker, “A Lower Bound Theorem for Indexing Schemes and Its Application to Multidimensional Range Queries,” Proc. Principles of Database Systems Conf. (PODS '98), pp. 44–51, June 1998.
[37] T. Sellis, N. Roussopoulos, and C. Faloutsos, “The R+Tree: A Dynamic Index for Multidimensional Objects,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB), 1987.
[38] D. Shasha, T.L. Wang, “New Techniques for BestMatch Retrieval,” ACM Trans. Information Systems, vol. 8, no. 2, pp. 140158, Apr. 1990.
[39] Y. Theodoridis and T. Sellis, “A Model for the Prediction of Rtree Performance,” Proc. 15th ACM Symp. Principles of Database Systems (PODS), 1996.
[40] M. Turk and A. Pentland, “Eigenfaces for Recognition,” J. Cognitive Neuroscience, vol. 3, no. 1, pp. 71–86, 1991.
[41] H. Wactlar, T. Kanade, M.A. Smith, and S.M. Stevens, “Intelligent Access to Digital Video: The Informedia Project,” Computer, vol. 29, no. 5, pp. 4652, 1996.
[42] R. Weber, H.J. Schek, and S. Blott, “A Quantitative Analysis and Performance Study for SimilaritySearch Methods in HighDimensional Spaces,” Proc. Very Large Data Base Conf. (VLDB '98), pp. 194–205, Aug. 1998.