DocumentCode
2499931
Title
PLOP-hashing: A grid file without directory
Author
Kriegel, Hans-Peter ; Seeger, Bernhard
Author_Institution
Praktische Inf., Bremen, West Germany
fYear
1988
fDate
1-5 Feb 1988
Firstpage
369
Lastpage
376
Abstract
The authors consider the case of nonuniform weakly correlated or independent multidimensional record distributions. After demonstrating the advantages of multidimensional hashing schemes without directory, they suggest using piecewise linear expansions to distribute the load more evenly over the pages of the file. The resulting piecewise linear order preserving hashing scheme (PLOP-hashing) is then compared to the two-level grid file, which turned out to be the most popular scheme in practical applications
Keywords
file organisation; PLOP-hashing; file pages; grid file; independent multidimensional record distributions; multidimensional hashing schemes; nonuniform weakly correlated; piecewise linear expansions; piecewise linear order preserving hashing scheme; two-level grid file; Binary trees; Costs; Multidimensional systems; Organizing; Piecewise linear techniques; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Engineering, 1988. Proceedings. Fourth International Conference on
Conference_Location
Los Angeles, CA
Print_ISBN
0-8186-0827-7
Type
conf
DOI
10.1109/ICDE.1988.105439
Filename
105439
Link To Document