Optimal redundancy in spatial database systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 951, Issue , 1995, Pages 96-116

  Gaede, Volker ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; QUERY LANGUAGES; REDUNDANCY;

APPROXIMATION TECHNIQUES; DERIVED FORMULAE; EXTENDED OBJECTS; OBJECT GEOMETRIES; OPTIMAL REDUNDANCY; SPATIAL DATA; SPATIAL DATABASE SYSTEMS; SPATIAL INDEXES;

DATABASE SYSTEMS;

EID: 84883228782     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60159-7_7     Document Type: Conference Paper

References (16)

1. Beckmann, N., H.-P. Kriegel, R. Schneider, and B. Seeger (1990). The R*-tree: An efficient and robust access method for points and rectangles. In Proc. ACM SIGMOD Conference on Management of Data, pp. 322-331.
2. Comer, D. (1979). The ubiquitous B-tree. ACM Computing Surveys, 121-138.
3. EEC (1990). Statistical bureau of the european union. Regions.
4. Gaede, V. and W.-F. Riekert (1994). Spatial access methods and query processing in the object-oriented GIS GODOT. In Proc. of the AGDM’94 Workshop, Delft, The Netherlands, pp. 40-52. Netherlands Geodetic Commission.
5. Gorny, A. and R. Carter (1987). World Data Bank II: General Users Guide. Technical report, U.S. Central Intelligence Agency, Washington.
6. Günther, O. (1988). Efficient structures for geometric data management. Number 337 in LNCS. Berlin: Springer-Verlag.
7. Guttman, A. (1984). R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD Conference on Management of Data, pp. 47-54.
8. Mandelbrot, B. (1983). Fractal geometry of nature. San Francisco: W. H. Freeman.
9. Nievergelt, J., H. Hinterberger, and K. C. Sevcik (1984, March). The grid file: An adaptable, symmetric multikey file structure. ACM Trans, on Database Systems 9(1), 38-71.
10. Orenstein, J. (1989a). Redundancy in spatial databases. In Proc. ACM SIGMOD Conference on Management of Data, pp. 294-305.
11. Orenstein, J. (1989b). Strategies for optimizing the use of redundancy in spatial databases. In B. et al (Ed.), Design and Implementation of Large Spatial Database Systems, pp. 115-134. Springer-Verlag. LNCS No. 409.
12. Orenstein, J. and T. H. Merrett (1984). A class of data structures for associative searching. In Proc. 3rd ACMSIGACT-SIGMOD Symposium on Principles of Database Systems, pp. 181-190.
13. Schiwietz, M. (1993). Speicherung und Anfragebearbeitung komplexer Geo-Objekte. Ph. D. thesis, Ludwig-Maximilians Universität München. (in german).
14. Schiwietz, M. and H.-P. Kriegel (1993). Query proceesing of spatial objects: Complexity versus redundancy. In D. Abel and B. C. Ooi (Eds.), Advances in Spatial Databases, pp. 377-396. Springer Verlag. LNCS No. 692.
15. +-tree: A dynamic index for multi-dimensional objects. In Proc. 13th Int. Conference on Very Large Data Bases, pp. 507-518.
16. Yao, S. (1977). Approximating block accesses in database organizations. Communications of the ACM 20(4), 260-261.