Neighbor-finding based on space-filling curves

Information Systems

Volumn 30, Issue 3, 2005, Pages 205-226

  Chen, Hue Ling ^a   Chang, Ye In ^a  

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

Author keywords

Hilbert curve; Neighbor finding; Peano curve; RBG curve; Space filling curves; Spatial proximity

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE; COMPUTER SIMULATION; CONFORMAL MAPPING; DATABASE SYSTEMS; GEOGRAPHIC INFORMATION SYSTEMS; MATHEMATICAL TRANSFORMATIONS; QUERY LANGUAGES; RANDOM PROCESSES; TWO DIMENSIONAL;

HILBERT CURVE; NEIGHBOR-FINDING; PEANO CURVE; RBG CURVE; SPACE-FILLING CURVES; SPATIAL PROXIMITY;

DATA STRUCTURES;

EID: 9944249541     PISSN: 03064379     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.is.2003.12.002     Document Type: Article

References (16)

1. C. Faloutsos, Multiattribute hashing using gray codes, Proceedings of ACM SIGMOD International Conference on Management of Data, August 1986, pp. 227-238.
2. C. Faloutsos, Gray codes for partial match and range queries, IEEE Trans. Software Eng. 14 (10) (1988) 1381-1393.
3. C. Faloutsos, S. Roseman, Fractals for secondary key retrieval, Proceedings of ACM SIGACT-SIGMOD-SIGART Symposium on PODS, 1989, pp. 247-252.
4. J.K. Lawder, P.J.H. King, Querying multi-dimensional data indexed using the Hilbert space-filling curve, ACM SIGMOD Record 30 (1) (2001) 19-24.
5. B. Moon, H.V. Jagadish, C. Faloutsos, J.H. Saltz, Analysis of the clustering properties of the Hubert space-filling curve, IEEE Trans. Knowledge Data Eng. 13 (1) (2001) 124-141.
6. J.A. Orenstein, T.H. Merrett, A class of data structures for associative searching, Proceedings of Symposium on PODS, 1984, pp. 181-190.
7. J.A. Orenstein, Spatial query processing in an object-oriented database system, Proceedings of ACM SIGMOD International Conference on Management of Data, 1986, pp. 326-336.
8. H.V. Jagadish, Linear clustering of objects with multiple attributes, Proceedings of ACM SIGMOD International Conference on Management of Data, 1990, pp. 332-342.
9. H.V. Jagadish, Analysis of the Hubert curve for representing two-dimensional space, Inform. Process. Lett. 62 (1) (1997) 17-22.
10. A. Corral, Y. Manolopoulos, Y. Theodoridis, M. Vassilakopoulos, Closest pair queries in spatial databases, Proceedings of ACM SIGMOD International Conference on Management of Data, 2000, pp. 189-200.
11. R.H. Guting, An introduction to spatial database systems, Special Issue on Spatial Database Systems of VLDB J. 3 (4) (1994) 1-32.
12. E.M. Remgold, J. Nievergelt, N. Deo, Combinatorial algorithms: Theory and Practice, Prentice-Hall Inc., Englewood Cliffs, NJ, 1977.
13. B. Seeger, P.A. Larson, R. McFadyen, Reading a set of disk pages, Proceedings of the 19th Conference on VLDB, 1993, pp. 592-603.
14. S. Liao, M.A. Lopez, S.T. Leutenegger, High dimensional similarity search with space filling curves, Proceedings of the International Conference on Data Engineering, 2001, pp. 615-622.
15. M.F. Mokbel, W.G. Aref, I. Kamel, Performance of multi-dimensional space-filling curves, Proceedings of the 10th ACM International Symposium on Advances in GIS, 2002, pp. 149-154.
16. B. Seeger, H.P. Kriegel, The buddy-tree: an efficient and robust access method for spatial data base systems, Proceedings of the 16th Conference on VLDB, 1990, pp. 590-601.