Redundancy in Spatial Databases

ACM SIGMOD Record

Volumn 18, Issue 2, 1989, Pages 295-305

  Orenstein, Jack A ^a  

^a One New England Executive Park ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976738680     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/66926.66954     Document Type: Article

References (19)

1. J.L. Bentley. Multidimensional binary search trees used for associative searching. Comm. ACM 18, 9 (1975), 509-517.
2. U. Dayal, M. DeWitt, D. Goldhirsch, J. Orenstein. PROBE final report Technical report CCA-87-02, Xerox Advanced Information Technology Division (formerly Computer Corporation of America).
3. C. Faloutsos, W. Rego. A grid file for spatial objects. Technical report CS-TR-1829, Department of Computer Science, University of Maryland, College Park, (1987).
4. A. Guttman. R-trees: a dynamic index structure for spatial searching. Proc. ACM SIGMOD, (1984).
5. K.H. Hinrichs. The grid file system: implementation and case studies of applications. Doctoral dissertation, ETH Nr. 7734, Swiss Federal Institute of Technology, Zurich, Switzerland, (1985).
6. D. Horn, H.-J. Schek, W. Waterfeld, A. Wolf. Spatial access paths and physical clustering in a low-level geo-database system. Technical report, Technical University of Darmstadt, West Germany (1987).
7. D.B. Lomet, B. Salzberg. The hB-tree: a robust multi-attribute indexing method. Technical report TR-87-05, Wang Institute of Graduate Studies, (1987). (The Wang Institute is defunct. Contact Lomet at DEC, Spitbrook or Salzberg at Northeastern University.)
8. T.H. Merrett. Multidimensional paging for efficient database querying. Proc. Int'l Conference on Management of Data, Milan (1978), 277-290.
9. T.H. Merrett, E.J. Otoo. Dynamic multipaging: a storage structure for large shared databases. Proc. 2nd Int'l Conference on Databases: Improving usability and responsiveness, Jerusalem (1982).
10. J. Nievergelt, H. Hinterberger, K. C. Sevcik. The grid file: an adaptable, symmetric multi-key file structure. ACM TODS 9, 1 (1984), 38-71.
11. J.A. Orenstein. Algorithms and data structures for the implementation of a relational database system. Ph. D. thesis, McGill University, School of Computer Science (1983).
12. J.A. Orenstein, T.H. Merrett. A class of data structures for associative searching. Proc. 3rd ACM SIGACT-SIGMOD Symposium oh Principles of Database Systems (1984), 181-190.
13. J.A. Orenstein. Spatial query processing in an object-oriented database system. Proc. ACM SIGMOD, (1986).
14. J.A. Orenstein, F.A. Manola. Spatial data modeling and query processing in PROBE. Technical report CCA-86-05, Xerox Advanced Information Technology Division (formerly Computer Corporation of America).
15. J.A. Orenstein, F.A. Manola. PROBE spatial data modeling and query processing in an image database application. IEEE Trans, on Software Eng. 14, 5 (May, 1988) 611-629.
16. J.T. Robinson. The K-D-B tree: a search structure for large multidimensional dynamic indexes. Proc. ACM SIGMOD (1981).
17. H. Samet The quadtree and related hierarchical data structures. ACM Comp. Surv. 16, 2 (1984).
18. T. Sellis, N. Roussopoulos, C. Faloutsos. The R+-tree: a dynamic index for multidimensional objects. Proc. VLDB, (1987).
19. M. Tamminen, R. Sulonen. The EXCELL method for efficient geometric access to data. Proc. 19th ACM Design Automation Conf. (1982), 345-351.