DBScholar

Back to papers

Cache Conscious Algorithms for Relational Query Processing

Summary: Cache-conscious redesign of relational query processing leverages CPU cache hierarchies to narrow the DRAM–CPU gap. Demonstrates 8–200% speedups over traditional algorithms by reordering and structuring operators to maximize cache reuse. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h61beedc242b01a32
Venue
VLDB
Year
1994
Pagerank
0.00036898845
Overall Rank
76 | 99.50%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{shatdal_vldb94,
        title = {{Cache Conscious Algorithms for Relational Query Processing}},
        author = {Shatdal, Ambuj and Kant, Chander and Naughton, Jeffrey F.},
        journal = {PVLDB},
        series = {{VLDB} '94},
        pages = {510--521},
        year = {1994}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 53 citing papers.

Rank Citing Paper Year Venue Pagerank
9,793 Declarative Memory Services 2026 CIDR 5.1257999e-05
10,074 Databases in the Era of Memory-Centric Computing 2025 CIDR 5.0855548e-05
10,304 Data Chunk Compaction in Vectorized Execution 2025 SIGMOD 5.0400722e-05
Previous Page 2 / 2 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
7 Implementation Techniques For Main Memory Database Systems 1984 SIGMOD 0.00081992507
223 AlphaSort: A RISC Machine Sort 1994 SIGMOD 0.0002412513
Previous Page 1 / 1 Next

Semantically Similar Papers