The twin grid file: A nearly space optimal index structure

  • Andreas Hutflesz
  • Hans-Werner Six
  • Peter Widmayer
Efficient Data Access
Part of the Lecture Notes in Computer Science book series (LNCS, volume 303)

Abstract

Index structures for points, supporting spatial searching, usually suffer from an undesirably low storage space utilization. We show how a dynamically changing set of points can be distributed among two grid files in such a way that storage space utilization is close to optimal. Insertions and deletions trigger the redistribution of points among the two grid files. The number of bucket accesses for redistributing points and the storage space utilization vary with the selected amount of redistribution efforts. Typical range queries — the most important spatial search operations — can be answered at least as fast as in the standard grid file.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Fagin, J. Nievergelt, N. Pippenger, H.R. Strong: Extendible Hashing: A Fast Access Method for Dynamic Files, ACM Transactions on Database Systems, Vol. 4, 3, 1979, 315–344.Google Scholar
  2. M. Freeston: The BANG file: a new kind of grid file, Proc. ACM SIGMOD-87 International Conference on Management of Data, 1987, 260–269.Google Scholar
  3. K.H. Hinrichs: The grid file system: implementation and case studies of applications, Doctoral Thesis No. 7734, ETH Zürich, 1985.Google Scholar
  4. A. Hutflesz, H.-W. Six, P. Widmayer: Globally Order Preserving Multidimensional Linear Hashing, IEEE Fourth International Conference on Data Engineering, 1988.Google Scholar
  5. H.-P. Kriegel, B. Seeger: Multidimensional Order Perserving Linear Hashing with Partial Expansions, Proc. International Conference on Database Theory, 1986, 203–220.Google Scholar
  6. R. Krishnamurthy, K.-Y. Whang: Multilevel Grid Files, IBM Research Report, Yorktown Heights, 1985.Google Scholar
  7. D.B. Lomet: Digital B-Trees, Proc. International Conference on Very Large Data Bases, IEEE, 1981, 333–344.Google Scholar
  8. D.B. Lomet: Partial Expansions for File Organizations with an Index, ACM Transactions on Database Systems, Vol. 12, 1, 1987, 65–84.Google Scholar
  9. J. Nievergelt, H. Hinterberger, K.C. Sevcik: The Grid File: An Adaptable, Symmetric Multikey File Structure, ACM Transactions on Database Systems, Vol. 9, 1, 1984, 38–71.CrossRefGoogle Scholar
  10. E.J. Otoo: Balanced Multidimensional Extendible Hash Tree, Proc. 5th ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, 1986, 100–113.Google Scholar
  11. K. Ramamohanarao, R. Sacks-Davis: Recursive Linear Hashing, ACM Transactions on Database Systems, Vol. 9, 3, 1984, 369–391.Google Scholar
  12. J.T. Robinson: The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes, Proc. ACM SIGMOD International Conference on Management of Data, 1981, 10–18.Google Scholar
  13. H.-W. Six, P. Widmayer: Spatial Searching in Geometric Databases, IEEE Fourth International Conference on Data Engineering, 1988.Google Scholar
  14. M. Tamminen: Extendible Hashing with Overflow, Information Processing Letters, Vol. 15, 5, 1982, 227–232.Google Scholar

Copyright information

© Springer-Verlag 1988

Authors and Affiliations

  • Andreas Hutflesz
    • 1
  • Hans-Werner Six
    • 2
  • Peter Widmayer
    • 3
  1. 1.Universität KarlsruheKarlsruhe
  2. 2.Fern Universität HagenHagen
  3. 3.Universität KarlsruheKarlsruhe

Personalised recommendations