Analysis of grid file algorithms

DOI10.1007/BF01934379zbMath0568.68076MaRDI QIDQ1060565

Mireille Régnier

Publication date: 1985

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

hashingdynamic data structuresdata basesdynamically growing filemulti-key access

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items

Mellin transforms and asymptotics: Harmonic sums, Page usage in a quadtree index, Multidimensional quantile hashing is very efficient for nonuniform distributions, Analytic variations on quadtrees, Implementation of the grid file: Design concepts and experience

Cites Work

• Interpolation-based index maintenance
• A note on the analysis of extendible hashing
• On the average height of trees in digital search and dynamic hashing
• The extendible cell method for closest point problems
• Partial-match retrieval for dynamic files
• A storage scheme for extendible arrays
• Analysis of Extendible Hashing
• Dynamic hashing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item