DBScholar

Back to papers

Cache-Efficient Aggregation: Hashing Is Sorting

Summary: Hashing and sorting share the same cache efficiency in the external memory model, within a unified aggregation framework. Hardware-aware switching between hashing and sorting yields a cache-friendly, parallel aggregation; near memory bandwidth, beating state-of-the-art by up to 3.7x. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5101
Venue
SIGMOD
Year
2015
Pagerank
8.8694486e-05
Overall Rank
2,250 | 84.57%
DOI
10.1145/2723372.2747644

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{muller_sigmod15,
        title = {{Cache-Efficient Aggregation: Hashing Is Sorting}},
        author = {Müller, Ingo and Sanders, Peter and Lacurie, Arnaud and Lehner, Wolfgang and Färber, Franz},
        series = {{SIGMOD} '15},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2723372.2747644},
        url = {https://dl.acm.org/doi/10.1145/2723372.2747644},
        year = {2015}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 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