An algorithm for computing the overlay of k-dimensional spaces

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

Volumn 525 LNCS, Issue , 1991, Pages 381-400

  Orenstein, Jack ^a  

^a Object Design Inc ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DIMENSIONAL SPACES; MINIMAL REDUNDANCY; ORDERING ALGORITHMS; OVERLAY OPERATIONS; POLYGONAL REGIONS; POOR PERFORMANCE; SPATIAL OBJECTS;

REDUNDANCY;

EID: 85029584661     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54414-3_48     Document Type: Conference Paper

References (21)

1. D. J. Abel. “A B+-tree structure for large quadtrees.” Computer Vision, Graphics, and Image Processing, 27, (1984).
2. W. A. Burkhard. “Interpolation-based index maintenance.” ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Atlanta, GA (1983).
3. I. Gargantini. “An effective way to represent quad-trees.” Comm. ACM, 25, 12, (1982).
4. A. Goldberg, D. Robson. “Smalltalk-80: The language and its implementation.” Addison-Wesley, (1983).
5. O. Gunther, H. Noltemaier. “Spatial database indices for large extended objects”, Proc 7th IEEE Intl Conf on Data Engineering, (April, 1991).
6. O. Gunther. “Evaluation of spatial access methods with oversize shelves”, Proc. ESPRIT Int’l Workshop on Database Management Systems for Geographical Applications, (May, 1991) (to be published by Springer-Verlag).
7. A. Guttman. “R-tree: A dynamic index structure for spatial searching.” Proc. ACM SIGMOD, Int’l Conference on Management of Data, Boston, MA (1984).
8. 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).
9. H. V. Jagadish. “Linear clustering of objects with multiple attributes.” Proc. ACM SIGMOD Int’l Conference on Management of Data, Atlantic City, NJ (1990).
10. F. D. Libera, F. Gosen. “Using B-trees to solve geographic range queries.” The Computer Journal, 29, (1986).
11. F. A. Manola, J. A. Orenstein. “Toward a general spatial data model for an object-oriented DBMS.” Proc VLDB, Kyoto, (1986).
12. Multi-dimensional searching and computational geometry. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, (1984).
13. G. M. Morton. “A computer-oriented geodetic data base and a new technique in file sequencing.” Technical Report, IBM, Ottawa (1966).
14. J. A. Orenstein. “Algorithms and data structures for the implementation of a relational database system.” Technical Report SOCS-82-17, McGill University, School of Computer Science, (1982).
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 (1988).
16. J. A. Orenstein. “Redundancy in spatial databases.” Proc. ACM SIGMOD, Int’l Conference on Management of Data, Portland, OR (1989).
17. J. A. Orenstein. “An object-oriented approach to spatial data processing.” Proc 4th Int'l Symp. on Spatial Data Handling, Zurich, (1990).
18. H. Samet. The design and analysis of spatial data structures. Addison-Wesley, (1989).
19. T. Sellis, N. Roussopoulos, C. Faloutsos. “The R+-tree: A dynamic index for multidimensional objects.” Proc. VLDB, Brighton, (1987).
20. B. Stroustrup. The C++ programming language. Addison-Wesley, (1986).
21. J. W. van Roessel. “Attribute propagation and line segment classification in plane-sweep overlay.” Proc 4th Int'l Symp on Spatial Data Handling, Zurich, (1990).