论文信息 - Spatial Data Indexing and Point Location

Spatial Data Indexing and Point Location

This chapter is concerned with spatial databases. Anyone designing algorithms for geometry processing will invariably need to store data in spatial databases. The chapter begins with an introduction to spatial databases and moves on to discuss particular data structures.

[1] Jon Louis Bentley,et al. Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[2] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[3] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[4] Henry Fuchs,et al. On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[5] Helmut Thoma,et al. Buchbesprechung: Elmasri, Ramez; Navathe, Shamkant B.: Fundamentals of Database Systems, Benjamin/Cummings, 1989 , 1991, Datenbank Rundbr..

[6] Chun Zhang,et al. Storing and querying ordered XML using a relational database system , 2002, SIGMOD '02.

[7] Ramez Elmasri,et al. Fundamentals of Database Systems , 1989 .

[8] Mark de Berg,et al. The Priority R-tree: a practically efficient and worst-case optimal R-tree , 2004, SIGMOD '04.

[9] Shashi Shekhar,et al. Spatial Databases - Accomplishments and Research Needs , 1999, IEEE Trans. Knowl. Data Eng..

[10] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.

[11] Shashi Shekhar,et al. Spatial Databases: A Tour , 2003 .

[12] Christos Faloutsos,et al. The R+-Tree: A Dynamic Index for Multi-Dimensional Objects , 1987, VLDB.