The twin grid file: A nearly space optimal index structure (original) (raw)

• 207 Accesses
• 5 Citations

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.

This work was partially supported by grants Si 374/1 and Wi 810/2 from the Deutsche Forschungsgemeinschaft

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

• 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
• 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
• K.H. Hinrichs: The grid file system: implementation and case studies of applications, Doctoral Thesis No. 7734, ETH Zürich, 1985.
  Google Scholar
• A. Hutflesz, H.-W. Six, P. Widmayer: Globally Order Preserving Multidimensional Linear Hashing, IEEE Fourth International Conference on Data Engineering, 1988.
  Google Scholar
• H.-P. Kriegel, B. Seeger: Multidimensional Order Perserving Linear Hashing with Partial Expansions, Proc. International Conference on Database Theory, 1986, 203–220.
  Google Scholar
• R. Krishnamurthy, K.-Y. Whang: Multilevel Grid Files, IBM Research Report, Yorktown Heights, 1985.
  Google Scholar
• D.B. Lomet: Digital B-Trees, Proc. International Conference on Very Large Data Bases, IEEE, 1981, 333–344.
  Google Scholar
• D.B. Lomet: Partial Expansions for File Organizations with an Index, ACM Transactions on Database Systems, Vol. 12, 1, 1987, 65–84.
  Google Scholar
• 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.
  Article Google Scholar
• E.J. Otoo: Balanced Multidimensional Extendible Hash Tree, Proc. 5th ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, 1986, 100–113.
  Google Scholar
• K. Ramamohanarao, R. Sacks-Davis: Recursive Linear Hashing, ACM Transactions on Database Systems, Vol. 9, 3, 1984, 369–391.
  Google Scholar
• 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
• H.-W. Six, P. Widmayer: Spatial Searching in Geometric Databases, IEEE Fourth International Conference on Data Engineering, 1988.
  Google Scholar
• M. Tamminen: Extendible Hashing with Overflow, Information Processing Letters, Vol. 15, 5, 1982, 227–232.
  Google Scholar

Download references

Author information

Authors and Affiliations

1. Universität Karlsruhe, Postfach 6980, D - 7500, Karlsruhe
   Andreas Hutflesz
2. Fern Universität Hagen, Postfach 940, D - 5800, Hagen
   Hans-Werner Six
3. Universität Karlsruhe, Postfach 6980, D - 7500, Karlsruhe
   Peter Widmayer

Authors

1. Andreas Hutflesz
2. Hans-Werner Six
3. Peter Widmayer

Editor information

J. W. Schmidt S. Ceri M. Missikoff

Rights and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hutflesz, A., Six, HW., Widmayer, P. (1988). The twin grid file: A nearly space optimal index structure. In: Schmidt, J.W., Ceri, S., Missikoff, M. (eds) Advances in Database Technology—EDBT '88. EDBT 1988. Lecture Notes in Computer Science, vol 303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19074-0\_62

Download citation

• .RIS
• .ENW
• .BIB
• DOI: https://doi.org/10.1007/3-540-19074-0\_62
• Published: 24 May 2005
• Publisher Name: Springer, Berlin, Heidelberg
• Print ISBN: 978-3-540-19074-5
• Online ISBN: 978-3-540-39095-4
• eBook Packages: Springer Book Archive

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us