{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:51:19Z","timestamp":1773481879606,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":48,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540405351","type":"print"},{"value":"9783540450726","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45072-6_7","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T13:23:33Z","timestamp":1294493013000},"page":"102-121","source":"Crossref","is-referenced-by-count":3,"title":["On Query Processing and Optimality Using Spectral Locality-Preserving Mappings"],"prefix":"10.1007","author":[{"given":"Mohamed F.","family":"Mokbel","sequence":"first","affiliation":[]},{"given":"Walid G.","family":"Aref","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"#cr-split#-7_CR1.1","unstructured":"Anderson, W.N., Morley, T.D.: Eigenvalues of the laplacian of a graph. Technical Report TR-71-45, University of Maryland, (October 1971);"},{"key":"#cr-split#-7_CR1.2","doi-asserted-by":"crossref","unstructured":"Reprinted in Linear and Multilinear Algebra 18, 141???145 (1985)","DOI":"10.1080\/03081088508817681"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/IDEAS.2002.1029678"},{"issue":"4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0167-6377(82)90012-8","volume":"1","author":"J.J. Bartholdi","year":"1982","unstructured":"Bartholdi, J.J., Platzman, L.K.: An o(n log n) traveling salesman heuristic based on space filling curves. Operation Research Letters\u00a01(4), 121\u2013125 (1982)","journal-title":"Operation Research Letters"},{"issue":"6","key":"7_CR4","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1109\/TIT.1969.1054385","volume":"15","author":"T. Bially","year":"1969","unstructured":"Bially, T.: Space-filling curves: Their generation and their application to bandwidth reduction. IEEE Transactions on Information Theory\u00a015(6), 658\u2013664 (1969)","journal-title":"IEEE Transactions on Information Theory"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"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\u201390 (1999)","DOI":"10.1007\/3-540-48482-5_7"},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1137\/S1064827594262649","volume":"18","author":"T.F. Chan","year":"1997","unstructured":"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\u00a018(3), 943\u2013948 (1997)","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer, D.: The ubiquitous b-tree. ACM Comp. Surveys\u00a011(2), 121\u2013137 (1979)","journal-title":"ACM Comp. Surveys"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0021-9991(75)90065-0","volume":"17","author":"E. Davidson","year":"1975","unstructured":"Davidson, E.: The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices. Journal of Computational Physics\u00a017, 87\u201394 (1975)","journal-title":"Journal of Computational Physics"},{"key":"7_CR9","first-page":"938","volume":"17","author":"W. Donath","year":"1972","unstructured":"Donath, W., Hoffman, A.: Algorithms for partitioning of graphs and computer logic based on eigenvectors of connection matrices. IBM Technical Disclosure Bulletin\u00a017, 938\u2013944 (1972)","journal-title":"IBM Technical Disclosure Bulletin"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Faloutsos, C.: Multiattribute hashing using gray codes. In: Intl. Conf. on Management of Data, SIGMOD, Washington D. C, May 1886, pp. 227\u2013238 (1986)","DOI":"10.1145\/16894.16877"},{"issue":"10","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1109\/32.6184","volume":"14","author":"C. Faloutsos","year":"1988","unstructured":"Faloutsos, C.: Gray codes for partial match and range queries. IEEE Transactions on Software Engineering, TSE\u00a014(10), 1381\u20131393 (1988)","journal-title":"IEEE Transactions on Software Engineering, TSE"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., Bhagwat, P.: Declustering using fractals. In: Intl. Conf. on Parallel and Distributed Information Sys., San Jose, CA, pp. 18\u201325 (1993)","DOI":"10.1109\/PDIS.1993.253077"},{"key":"7_CR13","unstructured":"Faloutsos, C., Rong, Y.: Dot: A spatial access method using fractals. In: Intl. Conf. on Data Engineering, ICDE, Japan, April 1991, pp. 152\u2013159 (1991)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., Roseman, S.: Fractals for secondary key retrieval. In: Symp. on Principles of Database Systems, PODS, March 1989, pp. 247\u2013252 (1989)","DOI":"10.1145\/73721.73746"},{"issue":"98","key":"7_CR15","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M. Fiedler","year":"1973","unstructured":"Fiedler, M.: Algebraic connectivity of graphs. Czechoslovak Math. Journal\u00a023(98), 298\u2013305 (1973)","journal-title":"Czechoslovak Math. Journal"},{"issue":"100","key":"7_CR16","doi-asserted-by":"crossref","first-page":"619","DOI":"10.21136\/CMJ.1975.101357","volume":"25","author":"M. Fiedler","year":"1975","unstructured":"Fiedler, M.: A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Math. Journal\u00a025(100), 619\u2013633 (1975)","journal-title":"Czechoslovak Math. Journal"},{"key":"7_CR17","first-page":"456","volume":"4","author":"F.G. Frobenius","year":"1912","unstructured":"Frobenius, F.G.: Uber matrizen aus nicht negativen elementen. Sitzungsberichte der Koniglich Preusischen Akademie der Wissenschaften zu Berlin\u00a04, 456\u2013477 (1912)","journal-title":"Sitzungsberichte der Koniglich Preusischen Akademie der Wissenschaften zu Berlin"},{"issue":"1-2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0377-0427(00)00413-1","volume":"123","author":"G.H. Golub","year":"2000","unstructured":"Golub, G.H., van der Vorst, H.A.: Eigenvalue computation in the 20th century. Jour. of Comp. and App. Math.\u00a0123(1-2), 35\u201365 (2000)","journal-title":"Jour. of Comp. and App. Math."},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1137\/S0895479896312262","volume":"19","author":"S. Guattery","year":"1998","unstructured":"Guattery, S., Miller, G.L.: On the quality of spectral separators. SIAM Journal on Matrix Analalysis and Applications\u00a019(3), 701\u2013719 (1998)","journal-title":"SIAM Journal on Matrix Analalysis and Applications"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"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\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: Multidimensional spectral load balancing. In: SIAM Conf. on Parallel Processing, pp. 953\u2013961 (1993)","DOI":"10.2172\/6691328"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Hilbert, D.: Ueber stetige abbildung einer linie auf ein flashenstuck. Mathematishe Annalen, 459\u2013460 (1891)","DOI":"10.1007\/BF01199431"},{"key":"7_CR23","unstructured":"Hilbert, D.: Grundzuge einer allgemeinen Theorie der linearen Integralgleinhungen.Teubner, Leipzig (1912)"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"978","DOI":"10.1007\/BFb0097982","volume-title":"Parallel and Distributed Processing","author":"M. Holzrichter","year":"1999","unstructured":"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.\u00a01586, pp. 978\u2013985. Springer, Heidelberg (1999)"},{"key":"7_CR25","unstructured":"http:\/\/dias.cti.gr\/ytheod\/research\/datasets\/spatial.html"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"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\u2013342 (1990)","DOI":"10.1145\/93597.98742"},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0166-218X(92)90229-4","volume":"153","author":"M. Juvan","year":"1992","unstructured":"Juvan, M., Mohar, B.: Optimal linear labelings and eigenvalues of graphs. Discrete Applied Mathematics\u00a0153, 153\u2013168 (1992)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR28","unstructured":"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\u2013509 (1994)"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"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\u2013377 (2000)","DOI":"10.1109\/SFCS.2000.892125"},{"issue":"11","key":"7_CR30","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1016\/S0167-8191(96)00059-2","volume":"22","author":"N.P. Kruyt","year":"1997","unstructured":"Kruyt, N.P.: A conjugate gradient method for the spectral partitioning of graphs. Parallel Computing\u00a022(11), 1493\u20131502 (1997)","journal-title":"Parallel Computing"},{"issue":"4","key":"7_CR31","doi-asserted-by":"crossref","first-page":"255","DOI":"10.6028\/jres.045.026","volume":"45","author":"C. Lanczos","year":"1950","unstructured":"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\u00a045(4), 255\u2013282 (1950)","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Lawder, J.K., King, P.J.H.: Querying multi-dimensional data indexed using the hilbert space filling curve. SIGMOD Record\u00a030(1) (March 2001)","DOI":"10.1145\/373626.373678"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"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\u2013622 (2001)","DOI":"10.1109\/ICDE.2001.914876"},{"key":"7_CR34","volume-title":"Fractal Geometry of Nature","author":"B.B. Mandelbrot","year":"1977","unstructured":"Mandelbrot, B.B.: Fractal Geometry of Nature. W.H. Freeman, New York (1977)"},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/502585.502671"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"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\u2013701 (2003)","DOI":"10.1109\/ICDE.2003.1260840"},{"issue":"1","key":"7_CR37","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/69.908985","volume":"13","author":"B. Moon","year":"2001","unstructured":"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\u00a013(1), 124\u2013141 (2001)","journal-title":"IEEE Transactions on Knowledge and Data Engineering, TKDE"},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"Orenstein, J.A.: Spatial query processing in an object-oriented database system. In: Intl. Conf. on Management of Data, SIGMOD, May 1986, pp. 326\u2013336 (1986)","DOI":"10.1145\/16894.16886"},{"key":"7_CR39","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF01199438","volume":"36","author":"G. Peano","year":"1890","unstructured":"Peano, G.: Sur une courbe qui remplit toute une air plaine. Mathematishe Annalen\u00a036, 157\u2013160 (1890)","journal-title":"Mathematishe Annalen"},{"issue":"8","key":"7_CR40","first-page":"888","volume":"4","author":"A. Pothen","year":"1997","unstructured":"Pothen, A.: Graph partitioning algorithms with applications to scientific computing. Parallel Numerical Algorithms\u00a04(8), 888\u2013905 (1997)","journal-title":"Parallel Numerical Algorithms"},{"key":"7_CR41","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0024-3795(88)90147-4","volume":"101","author":"D. Powers","year":"1988","unstructured":"Powers, D.: Graph partitioning by eigenvectors. Lin. Alg. Appl.\u00a0101, 121\u2013133 (1988)","journal-title":"Lin. Alg. Appl."},{"key":"7_CR42","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0871-6","volume-title":"Space Filling Curves","author":"H. Sagan","year":"1994","unstructured":"Sagan, H.: Space Filling Curves. Springer, Berlin (1994)"},{"key":"7_CR43","unstructured":"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\u201327 (1996)"},{"key":"7_CR44","doi-asserted-by":"crossref","unstructured":"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.\u00a03656, pp. 350\u2013355 (1998)","DOI":"10.1117\/12.333854"},{"issue":"5","key":"7_CR45","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1137\/S1064827593255135","volume":"18","author":"H.D. Simon","year":"1997","unstructured":"Simon, H.D., Teng, S.-H.: How good is recursive bisection. SIAM Journal on Scientific Computing\u00a018(5), 1436\u20131445 (1997)","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"4","key":"7_CR46","doi-asserted-by":"publisher","first-page":"359","DOI":"10.2307\/2319079","volume":"80","author":"L.A. Steen","year":"1973","unstructured":"Steen, L.A.: Highlights in the history of spectral theory. American Math. Monthly\u00a080(4), 359\u2013381 (1973)","journal-title":"American Math. Monthly"},{"key":"7_CR47","doi-asserted-by":"crossref","unstructured":"Witten, I., Neal, M.: Using peano curves for bilevel display of continuous tone images. IEEE Computer Graphics and Applications, 47\u201352 (1982)","DOI":"10.1109\/MCG.1982.1674228"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45072-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T15:07:25Z","timestamp":1740841645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45072-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405351","9783540450726"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45072-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}