Skip to main content
SpringerLink
Log in
Book cover

Symposium on Large Spatial Databases

SSD 1989: Design and Implementation of Large Spatial Databases pp 115–134Cite as

Strategies for optimizing the use of redundancy in spatial databases

  • System And Performance Issues
  • Conference paper
  • First Online:

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

Abstract

Several spatial access methods can handle non-point data by placing each data object in a container, e.g. a box, and storing the collection of containers. As complexity of the spatial objects increases, the effectiveness of this strategy decreases, due to the inaccuracy of the approximation. Some access methods store objects redundantly to compensate. Each copy represents some portion of the object. The method by which redundancy is obtained is crucial in determining the degree of success that can be achieved. Two strategies for obtaining redundancy are compared, one based on recursive partitioning of the space containing the data objects, and the other based on type-specific object partitionings. Experimental results using a data set containing line segments suggest that the former approach is more effective in improving performance.

The work reported here was performed on equipment owned by the author, and does not relate to anticipated Object Design products.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. L. Bentley. Multidimensional binary search trees used for associative searching. Comm. ACM 18, 9 (1975), 509–517.

    Article  Google Scholar 

  2. C. Faloutsos, W. Rego. A grif file for spatial objects. Technical report CS-TR-1829, Department of Computer Science, University of Maryland, College Park, (1987).

    Google Scholar 

  3. A. Guttman. R-trees: a dynamic index structure for spatial searching. Proc. ACM SIGMOD, (1984).

    Google Scholar 

  4. O. Gunther. The design of the cell tree: an object-oriented index structure for geometric databases. Proc. Data Engineering Conference, (1989), 598–605.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  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, Nashua NH, or Salzberg at Northeastern University.)

    Google Scholar 

  8. D. B. Lomet, B. Salzberg. A robust multi-attribute search structure. Proc. Data Engineering, (1989), 296–304.

    Google Scholar 

  9. M. Mantyla, M. Tamminen. Localized set operations for solid modeling. ACM Computer Graphics, 17, 3 (1983) 279–288.

    Google Scholar 

  10. T. H. Merrett. Multidimensional paging for efficient database querying. Proc. Int'l Conference on Management of Data, Milan (1978), 277–290.

    Google Scholar 

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

    Google Scholar 

  12. J. Nievergelt, H. Hinterberger, K. C. Sevcik. The grid file: an adaptable, symmetric multi-key file structure. ACM TODS 9, 1 (1984), 38–71.

    Article  Google Scholar 

  13. J. A. Orenstein. Algorithms and data structures for the implementation of a relational database system. Ph.D. Thesis, McGill University, (1982). Also available as Technical Report SOCS 82-17.

    Google Scholar 

  14. J. A. Orenstein, T. H. Merrett. A class of data structures for associative searching. Proc. 3rd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (1984), 181–190.

    Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

  17. J. A. Orenstein. Redundancy in Spatial Databases. Proc. ACM SIGMOD (1989).

    Google Scholar 

  18. J. T. Robinson. The K-D-B tree: a search structure for large multidimensional dynamic indexes. Proc. ACM SIGMOD (1981).

    Google Scholar 

  19. H. Samet. The quadtree and related hierarchical data structures. ACM Comp. Surv. 16, 2 (1984).

    Google Scholar 

  20. T. Sellis, N. Roussopoulos, C. Faloutsos. The R+-tree: a dynamic index for multi-dimensional objects. Proc. VLDB, (1987).

    Google Scholar 

  21. M. Tamminen, R. Sulonen. The EXCELL method for efficient geometric access to data. Proc. 19th ACM Design Automation Conf. (1982), 345–351.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Object Design, Inc. One New England Executive Park, 01803, Burlington, MA

    Jack A. Orenstein

Authors
  1. Jack A. Orenstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alejandro P. Buchmann Oliver Günther Terence R. Smith Yuan-Fang Wang

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Orenstein, J.A. (1990). Strategies for optimizing the use of redundancy in spatial databases. In: Buchmann, A.P., Günther, O., Smith, T.R., Wang, YF. (eds) Design and Implementation of Large Spatial Databases. SSD 1989. Lecture Notes in Computer Science, vol 409. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52208-5_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-52208-5_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52208-9

  • Online ISBN: 978-3-540-46924-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation