Database Paper Browser

Back to papers

Write-limited sorts and joins for persistent memory

Summary: Persistent memory's byte-addressability with costly writes drives write-limited sort and join algorithms. A tunable API and four integration techniques enable dynamic workflow optimization; evaluation shows I/O-minimal performance and tradeoffs for persistent-memory query processing. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10919
Venue
VLDB
Year
2014
Pagerank
8.7856313e-05
Overall Rank
2,451 | 82.96%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 15 of 15 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

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

Rank Cited Paper Year Venue Pagerank
576 Rethinking Database Algorithms for Phase Change Memory 2011 CIDR 0.00019865648
1,060 Flashing Up the Storage Layer 2008 VLDB 0.00014370687
1,653 Query Processing Techniques for Solid State Drives 2009 SIGMOD 0.00011003558
2,387 LazyFTL: A Page-level Flash Translation Layer Optimized for NAND Flash Memory 2011 SIGMOD 8.9175191e-05
5,126 Data Management Over Flash Memory 2011 SIGMOD 5.6793656e-05
Previous Page 1 / 1 Next

Semantically Similar Papers