Guarantied Single Disk Access for Very Large Database Files
Yugoslav journal of operations research, Tome 7 (1997) no. 1, p. 65
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
Interactive applications such as expert systems, CAD/CAM and multimedia
impose an increasing demand on a data management system that efficiently supports
basic operations on very large files and provides data retrieval with a guaranteed single
disk access. The synergism of a conventional B+ tree and a hash function represents a
possible solution to the problem. We have developed a class of algorithms that allow a
single disk access. The purpose of the paper is to compare and contrast several fast and
simple hash functions suggested in the literature that can be used in such a class of
algorithms.
Classification :
68P20 90B40 68P05
Keywords: Algorithms, file structures, B+-trees, perfect hashing, physical design.
Keywords: Algorithms, file structures, B+-trees, perfect hashing, physical design.
@article{YJOR_1997_7_1_a5,
author = {Dejan Simi\'c and Du\v{s}an Star\v{c}evi\'c and Emil Jovanov},
title = {Guarantied {Single} {Disk} {Access} for {Very} {Large} {Database} {Files}},
journal = {Yugoslav journal of operations research},
pages = {65 },
year = {1997},
volume = {7},
number = {1},
zbl = {0942.68040},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_1997_7_1_a5/}
}
Dejan Simić; Dušan Starčević; Emil Jovanov. Guarantied Single Disk Access for Very Large Database Files. Yugoslav journal of operations research, Tome 7 (1997) no. 1, p. 65 . http://geodesic.mathdoc.fr/item/YJOR_1997_7_1_a5/