.png){kind=icon}
.png){kind=icon}
Return
Implementing sorting in database systems
.png){kind=icon}
PRE
AI
DOI：10.1145/1132960.1132964.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Most commercial database systems do ( or should) exploit many sorting techniques that are publicly known, but not readily available in the research literature. These techniques improve both sort performance on modern computer systems and the ability to adapt gracefully to resource fluctuations in multiuser operations. This survey collects many of these techniques for easy reference by students, researchers, and product developers. It covers in-memory sorting, disk-based external sorting, and considerations that apply specifically to sorting in database systems.
Keywords:
algorithms
performance
key normalization
key conditioning
compression
dynamic memory resource allocation
graceful degradation
nested iteration
asynchronous read-ahead
forecasting
index operations
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
28
Papers:
2.4K
Citations:
3.5W
Organization
No organization information available