DBScholar

Back to papers

Highly Concurrent Cache Consistency for Indices in Client-Server Database Systems

Summary: Four concurrent B+-tree indexing approaches in a data-shipping client-server OODBMS: server-only, client caching, and three caching variants. SHORE/IBM SP2 experiments compare non-2PL and 2PL, showing caching-aware approaches reduce lock contention. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2996
Venue
SIGMOD
Year
1997
Pagerank
5.093636e-05
Overall Rank
12,955 | 11.12%
DOI
10.1145/253260.253269

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{zaharioudakis_sigmod97,
        title = {{Highly Concurrent Cache Consistency for Indices in Client-Server Database Systems}},
        author = {Zaharioudakis, Markos and Carey, Michael J.},
        series = {{SIGMOD} '97},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/253260.253269},
        url = {https://dl.acm.org/doi/10.1145/253260.253269},
        year = {1997}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers