Skip to main content
SpringerLink
Log in

An algorithm for computing the overlay of k-dimensional spaces

  • Index And Storage Management
  • Conference paper
  • First Online:
Advances in Spatial Databases (SSD 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 525))

Included in the following conference series:

Abstract

The overlay operation, as supported by geographic information systems, is often limited to 2-dimensional spaces and polygonal regions. The problem can be generalized to k-dimensional spaces, k ≥ 1, and to arbitrary kinds of spatial objects. A z-order-based algorithm for this general form of overlay is given. The algorithm produces an approximate answer, which is then refined. As with other z-order algorithms, a spatial object is represented by a set of intervals in 1-dimensional space. "Redundancy" — the number of these intervals — can be selected. The performance of the overlay algorithm is determined by redundancy. The performance of the overlay algorithm, and its dependence on redundancy is studied experimentally. Minimal redundancy should be avoided as it leads to poor performance.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. J. Abel. "A B+-tree structure for large quadtrees." Computer Vision, Graphics, and Image Processing, 27, (1984).

    Google Scholar 

  2. W. A. Burkhard. "Interpolation-based index maintenance." ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Atlanta, GA (1983).

    Google Scholar 

  3. I. Gargantini. "An effective way to represent quad-trees." Comm. ACM, 25, 12, (1982).

    Google Scholar 

  4. A. Goldberg, D. Robson. "Smalltalk-80: The language and its implementation." Addison-Wesley, (1983).

    Google Scholar 

  5. O. Gunther, H. Noltemaier. "Spatial database indices for large extended objects", Proc. 7th IEEE Int'l Conf. on Data Engineering, (April, 1991).

    Google Scholar 

  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).

    Google Scholar 

  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).

    Google Scholar 

  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).

    Google Scholar 

  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).

    Google Scholar 

  10. F. D. Libera, F. Gosen. "Using B-trees to solve geographic range queries." The Computer Journal, 29, (1986).

    Google Scholar 

  11. F. A. Manola, J. A. Orenstein. "Toward a general spatial data model for an object-oriented DBMS." Proc. VLDB, Kyoto, (1986).

    Google Scholar 

  12. Multi-dimensional searching and computational geometry. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, (1984).

    Google Scholar 

  13. G. M. Morton. "A computer-oriented geodetic data base and a new technique in file sequencing." Technical Report, IBM, Ottawa (1966).

    Google Scholar 

  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).

    Google Scholar 

  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).

    Google Scholar 

  16. J. A. Orenstein. "Redundancy in spatial databases." Proc. ACM SIGMOD, Int'l Conference on Management of Data, Portland, OR (1989).

    Google Scholar 

  17. J. A. Orenstein. "An object-oriented approach to spatial data processing." Proc. 4th Int'l Symp. on Spatial Data Handling, Zurich, (1990).

    Google Scholar 

  18. H. Samet. The design and analysis of spatial data structures. Addison-Wesley, (1989).

    Google Scholar 

  19. T. Sellis, N. Roussopoulos, C. Faloutsos. "The R+-tree: a dynamic index for multidimensional objects." Proc. VLDB, Brighton, (1987).

    Google Scholar 

  20. B. Stroustrup. The C++ programming language. Addison-Wesley, (1986).

    Google Scholar 

  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).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Object Design, Inc., USA

    Jack Orenstein

Authors
  1. Jack Orenstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Oliver Günther Hans-Jörg Schek

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Orenstein, J. (1991). An algorithm for computing the overlay of k-dimensional spaces. In: Günther, O., Schek, HJ. (eds) Advances in Spatial Databases. SSD 1991. Lecture Notes in Computer Science, vol 525. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54414-3_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-54414-3_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54414-2

  • Online ISBN: 978-3-540-47615-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation