article

Free access

The Grid File: An Adaptable, Symmetric Multikey File Structure

Editor: Robert W. Taylor Authors:

Hans Hinterberger,

Kenneth C. SevcikAuthors Info & Claims

ACM Transactions on Database Systems (TODS), Volume 9, Issue 1

Pages 38 - 71

https://doi.org/10.1145/348.318586

Published: 23 March 1984 Publication History

Abstract

Traditional file structures that provide multikey access to records, for example, inverted files, are extensions of file structures originally designed for single-key access. They manifest various deficiencies in particular for multikey access to highly dynamic files. We study the dynamic aspects of file structures that treat all keys symmetrically, that is, file structures which avoid the distinction between primary and secondary keys. We start from a bitmap approach and treat the problem of file design as one of data compression of a large sparse matrix. This leads to the notions of a grid partition of the search space and of a grid directory, which are the keys to a dynamic file structure called the grid file. This file system adapts gracefully to its contents under insertions and deletions, and thus achieves an upper bound of two disk accesses for single record retrieval; it also handles range queries and partially specified queries efficiently. We discuss in detail the design decisions that led to the grid file, present simulation results of its behavior, and compare it to other multikey access file structures.

References

[1]

BATORY, D.S. On searching transposed files. ACM Trans. Database Syst. 4, 4 (Dec. 1979), 531- 544.

Digital Library

[2]

BENTLEY, J.L. Multidimensional search trees used for associative searching. Commun. ACM 18, 9 (Sept. 1975}, 509-517.

Digital Library

[3]

BENTLEY, J.L. Multidimensional binary search trees in database applications. IEEE Trans. Softw. Eng. SE-5, 4 (July 1979), 333-340.

Digital Library

[4]

BURKHARD, W.A. Interpolation-based index maintenance. In Proc, A CM Syrup. Principles of Database Systems (1983), 76-89.

Digital Library

[5]

CASEY, R.G. Design of tree structures for efficient querying. Commun. ACM 16, 9 (Sept. 1973), 549-556.

Digital Library

[6]

FAGIN, R., NIEVERGELT, J., PIPPENGER, N., AND STRONG, H.R. Extendible hashing~a fast access method for dynamic files. ACM Trans. Database Syst. 4, 3 (Sept. 1979), 315-344.

Digital Library

[7]

FINKEL, R.A., AND BENTLEY, J.L. Quad trees--a data structure for retrieval on composite keys. Acta Inf. 4 {1974), 1-9.

[8]

GONNET, G.H., AND LARSON, P.A. External hashing with limited internal storage. In Proc. ACM Syrup. Principles of Database Systems (1982), 256-261.

Digital Library

[9]

GUETING, H., AND KRIEGEL, H.P. Multidimensional B-tree: an efficient dynamic file structure for exact match queries. Forschungsbericht Nr. 105, Informatik, Univ. Dortmund, Dortmund, West Germany, 1980.

[10]

H{NRICHS, K., AND NIEVERGELT, J. The grid file: a data structure designed to support proximity queries on spatial objects. In Proc. Workshop on Graph Theoretic Concepts in Computer Science (Osnabruck, 1983).

[11]

H{NTERBERGER, H., AND NIEVERGELT, J. Concurrency control in two-level file structures. Working paper, Informatik, ETH Zurich, 1983.

[12]

J0SHI, S.M., SANYAL, S., BANERJEE, S., AND SRIKUMAR, S. Using grid files for a relational database management system. Speech and Digital Systems Group, Tata Institute of Fundamental Research, Homi Bhabha Road, Bombay 400 005, India.

[13]

KASHYAP, R.L., SUBAS, S.K.C., AND YAO, S.B. Analysis of the multiattribute tree database organization. IEEE Trans. Softw. Eng. 2, 6 (Nov. 1977).

[14]

KNUTH, D.E. The Art of Computer Programming. Vo{. 3, Sorting and Searching. Addison- Wesley, Reading, Mass., 1973.

Digital Library

[15]

LEE, D.T., AND TONG, C.K. Quintary trees: a file structure for multidimensional database systems. ACM Trans. Database Syst. 5, 3 (Sept. 1980), 339-353.

Digital Library

[16]

L}TWXN, W. Linear hashing: a new tool for file and table addressing. In Proc. 6th international Conference on Very Large Data Bases, 1980, pp. 212-223.

[17]

LIOU, J.H., AND YAO, S.S. Multidimensional clustering for database organizations. Inf. Syst. 2 (1977), 187-198.

[18]

LUM, V.Y. Multiattribute retrieval with combined indices. Commun. ACM 13, 11 (Nov. 1970), 660-665.

Digital Library

[19]

BARNES, M.C., COLLENS, D.S. Storing hierarchic database structures in transposed form. Datafair, 1973.

[20]

MERRETT, T.H. Multidimensional paging for efficient database querying. In Proc. ICMOD (Milano, Italy, June 1978), pp. 277-289.

[21]

MERRETT, T.H., AND OTOO, E.J. Dynamic multipaging: a storage structure for large shared data banks. Rep. SOCS-81-26, McGill Univ., 1981.

[22]

MULLIN, J.K. Retrieval-update speed trade-offs using combined indices. Commun A CM 14, 12 {Dec. 1971), 775-778.

Digital Library

[23]

NIEVERGELT, J. Trees as data and file structures. In CAAP '81, Proc. 6th Colloquium on Trees in Algebra and Programming, E. Astesiano and C. Bohm, Eds., Lecture Notes in Computer Science 112, Springer Verlag, 1981, pp. 35-45.

Digital Library

[24]

NIEVERGELT, J., HINTERBERGER, H., AND SEVCIK, K.C. The grid file: an adaptable, symmetric multikey file structure. In Trends in Information Processing Systems, Proc. 3rd ECI Conference, A. Duijvestijn and P. Lockemann, Eds., Lecture Notes in Computer Science 123, Springer Verlag, 1981, pp. 236-251.

Digital Library

[25]

ORENSTEIN J.A. Multidimensional TRIEs used for associative searching. Inf. Process. Left. 14, 4 (June 1982), 150-157.

[26]

PFALTZ, J.L., BERMAN, W.J., AND CAGLEY, E.M. Partial-match retrieval using indexed descriptor files. Commun. ACM 23, 9 (Sept. 1980), 522-528.

Digital Library

[27]

RIVEST, R.L. Partial-match retrieval algorithms. SIAM J. Comput. 5, 1 (1976), 19-50.

[28]

ROBINSON, J.T. The k-d-B-tree: a search structure for large multidimensional dynamic indexes. In Proc. SIGMOD Conference 1981, ACM, New York, pp. 10-18.

Digital Library

[29]

ROTHNIE, J.B., AND LOZANO, T. Attribute-based file organisation in a paged environment. Commun. ACM 17, 2 (Feb. 1974), 63-69.

Digital Library

[30]

SCHEUERMANN, P., AND OUKSEL, M. Multidimensional B-trees for associative searching in database systems, Inf. Syst. 7, 2 (1982), 123-137.

[31]

TAMMINEN, M. The extendible cell method for closest point problems. BIT 22 (1982), 27-41.

[32]

VALLARINO, O. On the use of bit maps for multiple key retrieval. ACM SIGPLAN Notices 11, (Mar. 1976), 108-114.

Digital Library

Cited By

Patil MV Ravishankar C(2024)Model Reuse in Learned Spatial IndexesProceedings of the 36th International Conference on Scientific and Statistical Database Management10.1145/3676288.3676293(1-12)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.1145/3676288.3676293
Li MWang HDai HLi MChai CGu RChen FChen ZLi SLiu QChen G(2024)A Survey of Multi-Dimensional Indexes: Past and Future TrendsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.336418336:8(3635-3655)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1109/TKDE.2024.3364183
Najeeb GAli N(2023)Improving Performance of Spatial Database Based on Hybrid Machine Learning and Hilbert Curve Data Structureباشترکردنی ئەدای بنکەدراوەی فەزایی لەسەر بنەمای تێکەڵى فێربوونی ئامێری و پێکهاتەی داتاى هيلى هیلبێرتHalabja University Journal10.32410/huj-105058:4(250-272)Online publication date: 30-Dec-2023
https://doi.org/10.32410/huj-10505
Show More Cited By

Index Terms

The Grid File: An Adaptable, Symmetric Multikey File Structure
1. General and reference
  1. Document types

Recommendations

Gfarm Grid File System
Abstract
Gfarm Grid file system is a global distributed file system to share data and to support distributed data-intensive computing. It federates local file systems on compute nodes to maximize distributed file I/O bandwidth, and allows to store multiple ...
A multiple-file write scheme for improving write performance of small files in Fast File System

Fast File System (FFS) stores files to disk in separate disk writes, each of which incurs a disk positioning (seek + rotation) limiting the write performance for small files. We propose a new scheme called co-writing to accelerate small file writes in ...
The zebra striped network file system

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems

ACM Transactions on Database Systems Volume 9, Issue 1

March 1984

161 pages

ISSN:0362-5915

EISSN:1557-4644

DOI:10.1145/348

Editor:
Robert W. Taylor
IBM Research Laboratory, San Jose, CA

Issue’s Table of Contents

Copyright © 1984 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 March 1984

Published in TODS Volume 9, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

997
Total Citations
View Citations
3,713
Total Downloads

Downloads (Last 12 months)284
Downloads (Last 6 weeks)38

Reflects downloads up to 01 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Patil MV Ravishankar C(2024)Model Reuse in Learned Spatial IndexesProceedings of the 36th International Conference on Scientific and Statistical Database Management10.1145/3676288.3676293(1-12)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.1145/3676288.3676293
Li MWang HDai HLi MChai CGu RChen FChen ZLi SLiu QChen G(2024)A Survey of Multi-Dimensional Indexes: Past and Future TrendsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.336418336:8(3635-3655)Online publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1109/TKDE.2024.3364183
Najeeb GAli N(2023)Improving Performance of Spatial Database Based on Hybrid Machine Learning and Hilbert Curve Data Structureباشترکردنی ئەدای بنکەدراوەی فەزایی لەسەر بنەمای تێکەڵى فێربوونی ئامێری و پێکهاتەی داتاى هيلى هیلبێرتHalabja University Journal10.32410/huj-105058:4(250-272)Online publication date: 30-Dec-2023
https://doi.org/10.32410/huj-10505
Arslan SYazici A(2023)MM-FOOD: a high-dimensional index structure for efficiently querying content and concept of multimedia dataJournal of Intelligent & Fuzzy Systems10.3233/JIFS-22067344:1(251-282)Online publication date: 5-Jan-2023
https://doi.org/10.3233/JIFS-220673
Gao JCao XYao XZhang GWang W(2023)LMSFC: A Novel Multidimensional Index Based on Learned Monotonic Space Filling CurvesProceedings of the VLDB Endowment10.14778/3603581.360359816:10(2605-2617)Online publication date: 8-Aug-2023
https://dl.acm.org/doi/10.14778/3603581.3603598
Calderon-Romero ATsotras VMagdy A(2023)Scalable Overlay Operations over DCEL Polygon LayersProceedings of the 18th International Symposium on Spatial and Temporal Data10.1145/3609956.3609964(85-95)Online publication date: 23-Aug-2023
https://dl.acm.org/doi/10.1145/3609956.3609964
Wu SChen LHuang PChang YHo CShih W(2023)WARM-tree: Making Quadtrees Write-efficient and Space-economic on Persistent MemoriesACM Transactions on Embedded Computing Systems10.1145/360803322:5s(1-26)Online publication date: 31-Oct-2023
https://dl.acm.org/doi/10.1145/3608033
Ceccarello MDignös AGamper JKhnaisser C(2023)Indexing Temporal Relations for Range-Duration QueriesProceedings of the 35th International Conference on Scientific and Statistical Database Management10.1145/3603719.3603732(1-12)Online publication date: 10-Jul-2023
https://dl.acm.org/doi/10.1145/3603719.3603732
Su XQi JTanin E(2023)A Fast Hybrid Spatial Index with External Memory Support2023 IEEE 39th International Conference on Data Engineering Workshops (ICDEW)10.1109/ICDEW58674.2023.00016(67-73)Online publication date: Apr-2023
https://doi.org/10.1109/ICDEW58674.2023.00016
Liu GQi JJensen CBailey JKulik L(2023)Efficiently Learning Spatial Indices2023 IEEE 39th International Conference on Data Engineering (ICDE)10.1109/ICDE55515.2023.00124(1572-1584)Online publication date: Apr-2023
https://doi.org/10.1109/ICDE55515.2023.00124
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents