The Grid File: An Adaptable, Symmetric Multikey File Structure.

@article{DBLP:journals/tods/NievergeltHS84,
  author    = {J{\"u}rg Nievergelt and
               Hans Hinterberger and
               Kenneth C. Sevcik},
  title     = {The Grid File: An Adaptable, Symmetric Multikey File Structure},
  journal   = {ACM Trans. Database Syst.},
  volume    = {9},
  number    = {1},
  year      = {1984},
  pages     = {38-71},
  ee        = {http://doi.acm.org/10.1145/348.318586, db/journals/tods/NievergeltHS84.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1984 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-1 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

Don S. Batory: On Searching Transposed Files. ACM Trans. Database Syst. 4(4): 531-544(1979) BibTeX

[2]

Jon Louis Bentley: Multidimensional Binary Search Trees Used for Associative Searching. Commun. ACM 18(9): 509-517(1975) BibTeX

[3]

Jon Louis Bentley: Multidimensional Binary Search Trees in Database Applications. IEEE Trans. Software Eng. 5(4): 333-340(1979) BibTeX

[4]

Walter A. Burkhard: Interpolation-Based Index Maintenance. PODS 1983: 76-89 BibTeX

[5]

Richard G. Casey: Design of Tree Structures for Efficient Querying. Commun. ACM 16(9): 549-556(1973) BibTeX

[6]

Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger, H. Raymond Strong: Extendible Hashing - A Fast Access Method for Dynamic Files. ACM Trans. Database Syst. 4(3): 315-344(1979) BibTeX

[7]

Raphael A. Finkel, Jon Louis Bentley: Quad Trees: A Data Structure for Retrieval on Composite Keys. Acta Inf. 4: 1-9(1974) BibTeX

[8]

Gaston H. Gonnet, Per-Åke Larson: External Hashing with Limited Internal Storage. PODS 1982: 256-261 BibTeX

[9]

Ralf Hartmut Güting, Hans-Peter Kriegel: Multidimensional B-tree: An Efficient Dynamic File Structure for Exact Match Queries. GI Jahrestagung 1980: 375-388 BibTeX

[10]

Klaus Hinrichs, Jürg Nievergelt: The Grid File: A Data Structure to Support Proximity Queries on Spatial Objects. WG 1983: 100-113 BibTeX

[11]

...

[12]

...

[13]

Rangasami L. Kashyap, S. K. C. Subas, S. Bing Yao: Analysis of the Multiple-Attribute-Tree Data-Base Organization. IEEE Trans. Software Eng. 3(6): 451-467(1977) BibTeX

[14]

Donald E. Knuth: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX

[15]

D. T. Lee, C. K. Wong: Quintary Trees: A File Structure for Multidimensional Database Systems. ACM Trans. Database Syst. 5(3): 339-353(1980) BibTeX

[16]

Witold Litwin: Linear Hashing: A New Tool for File and Table Addressing. VLDB 1980: 212-223 BibTeX

[17]

J. H. Liou, S. Bing Yao: Multi-dimensional clustering for data base organizations. Inf. Syst. 2(4): 187-198(1977) BibTeX

[18]

Vincent Y. Lum: Multi-Attribute Retrieval with Combined Indexes. Commun. ACM 13(11): 660-665(1970) BibTeX

[19]

...

[20]

...

[21]

...

[22]

James K. Mullin: Retrieval-Update Speed Tradeoffs Using Combined Indices. Commun. ACM 14(12): 775-776(1971) BibTeX

[23]

Jürg Nievergelt: Trees as Data and File Structures. CAAP 1981: 35-45 BibTeX

[24]

Jürg Nievergelt, Hans Hinterberger, Kenneth C. Sevcik: The Grid File: An Adaptable, Symmetric Multi-Key File Structure. ECI 1981: 236-251 BibTeX

[25]

Jack A. Orenstein: Multidimensional Tries Used for Associative Searching. Inf. Process. Lett. 14(4): 150-157(1982) BibTeX

[26]

John L. Pfaltz, William J. Berman, Edgar M. Cagley: Partial-Match Retrieval Using Indexed Descriptor Files. Commun. ACM 23(9): 522-528(1980) BibTeX

[27]

Ronald L. Rivest: Partial-Match Retrieval Algorithms. SIAM J. Comput. 5(1): 19-50(1976) BibTeX

[28]

John T. Robinson: The K-D-B-Tree: A Search Structure For Large Multidimensional Dynamic Indexes. SIGMOD Conference 1981: 10-18 BibTeX

[29]

James B. Rothnie Jr., Tomas Lozano: Attribute Based File Organization in a Paged Memory Environment. Commun. ACM 17(2): 63-69(1974) BibTeX

[30]

Peter Scheuermann, Aris M. Ouksel: Multidimensional B-trees for associative searching in database systems. Inf. Syst. 7(2): 123-137(1982) BibTeX

[31]

Markku Tamminen: The Extendible Cell Method for Closest Point Problems. BIT 22(1): 27-41(1982) BibTeX

[32]

...