Skip to main content
SpringerLink
Log in

Optimal redundancy in spatial database systems

  • Spatial Query Processing
  • Conference paper
  • First Online:
Advances in Spatial Databases (SSD 1995)

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

Included in the following conference series:

Abstract

In spatial database systems rectangles are commonly used to approximate real spatial data. A technique that approximates extended objects with a collection of rectangles is the z-ordering method. Since each of these rectangles eventually corresponds to an entry in a spatial index, the object may be referenced several times. This redundancy effect is controllable. In this paper, we present an empirically derived formula to assess the expected redundancy for the z-ordering approximation technique given some simple parameters. After showing the applicability of this formula to a large class of different object geometries, we make use of this result to determine the optimal redundancy for real spatial data by means of theoretical considerations. In order to verify our theoretical results, we conducted several experiments using real spatial data and found a good correspondence.

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

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

    Google Scholar 

  • Comer, D. (1979). The ubiquitous B-tree. ACM Computing Surveys 11(2), 121–138.

    Google Scholar 

  • EEC (1990). Statistical bureau of the european union. Regions.

    Google Scholar 

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

    Google Scholar 

  • Gorny, A. and R. Carter (1987). World Data Bank II: General Users Guide. Technical report, U.S. Central Intelligence Agency, Washington.

    Google Scholar 

  • Günther, O. (1988). Efficient structures for geometric data management. Number 337 in LNCS. Berlin: Springer-Verlag.

    Google Scholar 

  • Guttman, A. (1984). R-trees: A dynamic index structure for spatial searching. In Proc. ACM SIGMOD Conference on Management of Data, pp. 47–54.

    Google Scholar 

  • Mandelbrot, B. (1983). Fractal geometry of nature. San Francisco: W. H. Freeman.

    Google Scholar 

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

    Google Scholar 

  • Orenstein, J. (1989a). Redundancy in spatial databases. In Proc. ACM SIGMOD Conference on Management of Data, pp. 294–305.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  • Schiwietz, M. (1993). Speicherung und Anfragebearbeitung komplexer Geo-Objekte. Ph. D. thesis, Ludwig-Maximilians Universität München. (in german).

    Google Scholar 

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

    Google Scholar 

  • Sellis, T., N. Roussopoulos, and C. Faloutsos (1987). The R+-tree: A dynamic index for multi-dimensional objects. In Proc. 13th Int. Conference on Very Large Data Bases, pp. 507–518.

    Google Scholar 

  • Yao, S. (1977). Approximating block accesses in database organizations. Communications of the ACM 20 (4), 260–261.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Wirtschaftsinformatik, Humboldt-Universität zu Berlin, Spandauer Str. 1, 10178, Berlin, Germany

    Volker Gaede

Authors
  1. Volker Gaede
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Max J. Egenhofer John R. Herring

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gaede, V. (1995). Optimal redundancy in spatial database systems. In: Egenhofer, M.J., Herring, J.R. (eds) Advances in Spatial Databases. SSD 1995. Lecture Notes in Computer Science, vol 951. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60159-7_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-60159-7_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60159-3

  • Online ISBN: 978-3-540-49536-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation