DBScholar

Back to papers

A Performance Evaluation of OID Mapping Techniques

Summary: Empirical evaluation of three logical OID techniques—hashing, B-trees, direct mapping. Direct mapping is the most robust, incurring at most one page fault per OID and scaling to large databases; clustering (linear vs matrix) further boosts performance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8444
Venue
VLDB
Year
1995
Pagerank
6.607869e-05
Overall Rank
4,611 | 68.37%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{eickler_vldb95,
        title = {{A Performance Evaluation of OID Mapping Techniques}},
        author = {Eickler, André and Gerlhof, Carsten A. and Kossmann, Donald},
        journal = {PVLDB},
        series = {{VLDB} '95},
        pages = {18--29},
        year = {1995}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
299 Shoring Up Persistent Applications 1994 SIGMOD 0.00022084669
355 Object Identity As A Query Language Primitive 1989 SIGMOD 0.00020351749
958 ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging 1992 SIGMOD 0.00012956148
2,590 Extensible Buffer Management of Indexes 1992 VLDB 8.3696843e-05
Previous Page 1 / 1 Next

Semantically Similar Papers