On Query Processing and Optimality Using Spectral Locality-Preserving Mappings

  • Mohamed F. Mokbel
  • Walid G. Aref
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2750)


A locality-preserving mapping (LPM) from the multi-dimensional space into the one-dimensional space is beneficial for many applications (e.g., range queries, nearest-neighbor queries, clustering, and declustering) when multi-dimensional data is placed into one-dimensional storage (e.g., the disk). The idea behind a locality-preserving mapping is to map points that are nearby in the multi-dimensional space into points that are nearby in the one-dimensional space. For the past two decades, fractals (e.g., the Hilbert and Peano space-filling curves) have been considered the natural method for providing a locality-preserving mapping to support efficient answer for range queries and similarity search queries. In this paper, we go beyond the idea of fractals. Instead, we investigate a locality-preserving mapping algorithm (The Spectral LPM) that uses the spectrum of the multi-dimensional space. This paper provably demonstrates how Spectral LPM provides a globally optimal mapping from the multi-dimensional space to the one-dimensional space, and hence outperforms fractals. As an application, in the context of range queries and nearest-neighbor queries, empirical results of the performance of Spectral LPM validate our analysis in comparison with Peano, Hilbert, and Gray fractal mappings.


Query Processing Linear Span Range Query Laplacian Matrix Manhattan Distance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anderson, W.N., Morley, T.D.: Eigenvalues of the laplacian of a graph. Technical Report TR-71-45, University of Maryland, (October 1971); Reprinted in Linear and Multilinear Algebra 18, 141–145 (1985)Google Scholar
  2. 2.
    Aref, W.G., El-Bassyouni, K., Kamel, I., Mokbel, M.F.: Scalable qos-aware disk-scheduling. In: Intl. Database Engineering and Applications Symp., IDEAS, Alberta, Canada (July 2002)Google Scholar
  3. 3.
    Bartholdi, J.J., Platzman, L.K.: An o(n log n) traveling salesman heuristic based on space filling curves. Operation Research Letters 1(4), 121–125 (1982)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Bially, T.: Space-filling curves: Their generation and their application to bandwidth reduction. IEEE Transactions on Information Theory 15(6), 658–664 (1969)CrossRefGoogle Scholar
  5. 5.
    Bohm, C., Klump, G., Kriegel, H.-P.: xz-ordering: A space-filling curve for objects with spatial extension. In: Intl. Symp. on Advances in Spatial Databases, SSD, Hong Kong, July 1999 pp. 75–90 (1999)Google Scholar
  6. 6.
    Chan, T.F., Ciarlet, P., Szeto, W.K.: On the optimality of the median cut spectral bisection graph partitioning method. SIAM Journal on Scientific Computing 18(3), 943–948 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Comer, D.: The ubiquitous b-tree. ACM Comp. Surveys 11(2), 121–137 (1979)zbMATHCrossRefGoogle Scholar
  8. 8.
    Davidson, E.: The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices. Journal of Computational Physics 17, 87–94 (1975)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Donath, W., Hoffman, A.: Algorithms for partitioning of graphs and computer logic based on eigenvectors of connection matrices. IBM Technical Disclosure Bulletin 17, 938–944 (1972)Google Scholar
  10. 10.
    Faloutsos, C.: Multiattribute hashing using gray codes. In: Intl. Conf. on Management of Data, SIGMOD, Washington D. C, May 1886, pp. 227–238 (1986)Google Scholar
  11. 11.
    Faloutsos, C.: Gray codes for partial match and range queries. IEEE Transactions on Software Engineering, TSE 14(10), 1381–1393 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Faloutsos, C., Bhagwat, P.: Declustering using fractals. In: Intl. Conf. on Parallel and Distributed Information Sys., San Jose, CA, pp. 18–25 (1993)Google Scholar
  13. 13.
    Faloutsos, C., Rong, Y.: Dot: A spatial access method using fractals. In: Intl. Conf. on Data Engineering, ICDE, Japan, April 1991, pp. 152–159 (1991)Google Scholar
  14. 14.
    Faloutsos, C., Roseman, S.: Fractals for secondary key retrieval. In: Symp. on Principles of Database Systems, PODS, March 1989, pp. 247–252 (1989)Google Scholar
  15. 15.
    Fiedler, M.: Algebraic connectivity of graphs. Czechoslovak Math. Journal 23(98), 298–305 (1973)MathSciNetGoogle Scholar
  16. 16.
    Fiedler, M.: A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Math. Journal 25(100), 619–633 (1975)MathSciNetGoogle Scholar
  17. 17.
    Frobenius, F.G.: Uber matrizen aus nicht negativen elementen. Sitzungsberichte der Koniglich Preusischen Akademie der Wissenschaften zu Berlin 4, 456–477 (1912)Google Scholar
  18. 18.
    Golub, G.H., van der Vorst, H.A.: Eigenvalue computation in the 20th century. Jour. of Comp. and App. Math. 123(1-2), 35–65 (2000)zbMATHCrossRefGoogle Scholar
  19. 19.
    Guattery, S., Miller, G.L.: On the quality of spectral separators. SIAM Journal on Matrix Analalysis and Applications 19(3), 701–719 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Guttman, A.: R-trees: A dynamic index structure for spatial indexing. In: Intl. Conf. on Management of Data, SIGMOD, Boston, MA,June 1984, pp. 47–57 (1984)Google Scholar
  21. 21.
    Hendrickson, B., Leland, R.: Multidimensional spectral load balancing. In: SIAM Conf. on Parallel Processing, pp. 953–961 (1993)Google Scholar
  22. 22.
    Hilbert, D.: Ueber stetige abbildung einer linie auf ein flashenstuck. Mathematishe Annalen, 459–460 (1891)Google Scholar
  23. 23.
    Hilbert, D.: Grundzuge einer allgemeinen Theorie der linearen Integralgleinhungen.Teubner, Leipzig (1912)Google Scholar
  24. 24.
    Holzrichter, M., Oliveira, S.: A graph based method for generating the fiedler vector of irregular problems. In: Rolim, J.D.P. (ed.) IPPS-WS 1999 and SPDP-WS 1999. LNCS, vol. 1586, pp. 978–985. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  25. 25.
  26. 26.
    Jagadish, H.V.: Linear clustering of objects with multiple attributes. In: Intl. Conf. on Management of Data, SIGMOD, Atlantic City, NJ, June 1990, pp. 332–342 (1990)Google Scholar
  27. 27.
    Juvan, M., Mohar, B.: Optimal linear labelings and eigenvalues of graphs. Discrete Applied Mathematics 153, 153–168 (1992)CrossRefMathSciNetGoogle Scholar
  28. 28.
    Kamel, I., Faloutsos, C.: Hilbert r-tree: An improved r-tree using fractals. In: Intl. Conf. on Very Large Databases, VLDB, Chile, September 1994, pp. 500–509 (1994)Google Scholar
  29. 29.
    Kannan, R., Vempala, S., Vetta, A.: On clusterings - good, bad and spectral. In: Symp. on Foundations of Computer Science, FOCS, Redondo Beach, CA, Novomber 2000, pp. 367–377 (2000)Google Scholar
  30. 30.
    Kruyt, N.P.: A conjugate gradient method for the spectral partitioning of graphs. Parallel Computing 22(11), 1493–1502 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  31. 31.
    Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. Journal of Research of the National Bureau of Standards 45(4), 255–282 (1950)MathSciNetGoogle Scholar
  32. 32.
    Lawder, J.K., King, P.J.H.: Querying multi-dimensional data indexed using the hilbert space filling curve. SIGMOD Record 30(1) (March 2001)Google Scholar
  33. 33.
    Liao, S., Lopez, M.A., Leutenegger, S.: High dimensional similarity search with space-filling curves. In: Intl. Conf. on Data Engineering, ICDE, Heidelberg, Germany, April 2001, pp. 615–622 (2001)Google Scholar
  34. 34.
    Mandelbrot, B.B.: Fractal Geometry of Nature. W.H. Freeman, New York (1977)Google Scholar
  35. 35.
    Mokbel, M.F., Aref, W.G.: Irregularity in multi-dimensional space-filling curves with applications in multimedia databases. In: Intl. Conf. on Information and Knowledge Managemen, CIKM, Atlanta, GA ( Novomber 2001)Google Scholar
  36. 36.
    Mokbel, M.F., Aref, W.G., Grama, A.: Spectral lpm: An optimal locality preserving mapping using the spectral (not fractal) order. In: Intl. Conf. on Data Engineering, ICDE, Bangalore, India, March 2003, pp. 699–701 (2003)Google Scholar
  37. 37.
    Moon, B., Jagadish, H., Faloutsos, C., Salz, J.: Analysis of the clustering properties of hilbert space-filling curve. IEEE Transactions on Knowledge and Data Engineering, TKDE 13(1), 124–141 (2001)CrossRefGoogle Scholar
  38. 38.
    Orenstein, J.A.: Spatial query processing in an object-oriented database system. In: Intl. Conf. on Management of Data, SIGMOD, May 1986, pp. 326–336 (1986)Google Scholar
  39. 39.
    Peano, G.: Sur une courbe qui remplit toute une air plaine. Mathematishe Annalen 36, 157–160 (1890)CrossRefMathSciNetGoogle Scholar
  40. 40.
    Pothen, A.: Graph partitioning algorithms with applications to scientific computing. Parallel Numerical Algorithms 4(8), 888–905 (1997)MathSciNetGoogle Scholar
  41. 41.
    Powers, D.: Graph partitioning by eigenvectors. Lin. Alg. Appl. 101, 121–133 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  42. 42.
    Sagan, H.: Space Filling Curves. Springer, Berlin (1994)zbMATHGoogle Scholar
  43. 43.
    Sevcik, K.C., Koudas, N.: Filter trees for managing spatial data over a range of size granularities. In: Intl. Conf. on Very Large Databases, VLDB, Bombay, India, September 1996, pp. 16–27 (1996)Google Scholar
  44. 44.
    Shepherd, J., Zhu, X., Megiddo, N.: A fast indexing method for multidimensional nearest neighbor search. In: SPIE, Storage and Retrieval for Image and Video Databases, vol. 3656, pp. 350–355 (1998)Google Scholar
  45. 45.
    Simon, H.D., Teng, S.-H.: How good is recursive bisection. SIAM Journal on Scientific Computing 18(5), 1436–1445 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  46. 46.
    Steen, L.A.: Highlights in the history of spectral theory. American Math. Monthly 80(4), 359–381 (1973)zbMATHCrossRefMathSciNetGoogle Scholar
  47. 47.
    Witten, I., Neal, M.: Using peano curves for bilevel display of continuous tone images. IEEE Computer Graphics and Applications, 47–52 (1982)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Mohamed F. Mokbel
    • 1
  • Walid G. Aref
    • 1
  1. 1.Department of Computer SciencesPurdue University 

Personalised recommendations