On search by address computation (Q802312)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On search by address computation
scientific article

    Statements

    On search by address computation (English)
    0 references
    0 references
    0 references
    1985
    0 references
    We study the effect of data distribution on address computation data structures for searching, as typified by the priority queue problem. We compare several techniques showing that, in contrast to sorting, neither one nor multilevel bucket methods are uniformly efficient for this task. However, a enhancement of order preserving extendible hashing is shown to behave asymptotically independently of the amount of data and its distribution. Also conclusions regarding multiattribute file structures are presented.
    0 references
    address computation data structures
    0 references
    searching
    0 references
    priority queue problem
    0 references
    order preserving extendible hashing
    0 references
    multiattribute file structures
    0 references

    Identifiers