Service restrictions from February 12-22, 2026—more information on the University Library website

Result: Guaranteed single diskaccess for very large database files

Title:
Guaranteed single diskaccess for very large database files
Authors:
Simić, Dejan, Starčević, Dušan, Jovanov, Emil S.
Source:
Yugoslav Journal of Operations Research
Publisher Information:
Univerzitet u Beogradu - Fakultet organizacionih nauka, Beograd, i dr.
Publication Year:
1997
Subject Terms:
physical design, perfect hashing, file structures, B+-trees, algorithms
Document Type:
Academic journal article in journal/newspaper
Language:
unknown
Relation:
https://rfos.fon.bg.ac.rs/handle/123456789/160; conv_234
Availability:
https://rfos.fon.bg.ac.rs/handle/123456789/160
Rights:
openAccess ; https://creativecommons.org/licenses/by-nc-sa/4.0/ ; BY-NC-SA
Accession Number:
edsbas.34F9531D
Database:
BASE

Further Information

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.