Database Paper Browser

Back to papers

Memory-Adaptive External Sorting

Summary: Memory-adaptive external sorting reduces buffer usage when memory is constrained and exploits extra buffers when available. Extends to memory-aware sort-merge joins; experiments show gains for sorting and joining large relations under memory fluctuations. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8161
Venue
VLDB
Year
1993
Pagerank
5.9537256e-05
Overall Rank
4,736 | 67.09%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank Citing Paper Year Venue Pagerank
1,524 Sorting And Indexing With Partitioned B-Trees 2003 CIDR 0.00011509464
4,027 Dynamic Resource Brokering for Multi-User Query Execution 1995 SIGMOD 6.51574e-05
4,826 Dynamic Memory Adjustment for External Mergesort 1997 VLDB 5.8892345e-05
5,987 External Memory Algorithms 1998 PODS 5.2399221e-05
7,065 Managing Memory For Real-Time Queries 1994 SIGMOD 4.8391602e-05
8,795 Resource-Adaptive Query Execution with Paged Memory Management 2025 CIDR 4.4446768e-05
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
76 Disk Shadowing 1988 VLDB 0.00057207258
1,861 An Adaptive Hash Join Algorithm for Multiuser Environments 1990 VLDB 0.00010297093
1,981 Managing Memory to Meet Multiclass Workload Response Time Goals 1993 VLDB 9.8739039e-05
2,670 FastSort: A Distributed Single-Input Single-Output External Sort 1990 SIGMOD 8.3389917e-05
3,185 Partially Preemptible Hash Joins 1993 SIGMOD 7.4241724e-05
Previous Page 1 / 1 Next

Semantically Similar Papers