Merging sorted runs using large main memory (Q1116703): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4057549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distribution Design of Logical Database Schemas / rank | |||
Normal rank |
Latest revision as of 14:27, 19 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Merging sorted runs using large main memory |
scientific article |
Statements
Merging sorted runs using large main memory (English)
0 references
1989
0 references
With large amounts of main memory, we show that the best method for merging sorted runs in almost all circumstances is to use two input buffers for each run. The use of these buffers makes it likely that reading in the sorted runs and writing the merged file overlap. We demonstrate that this method, with one or two passes, is superior to any merge pattern where reading and writing do ot overlap in almost all cases we are likely to encounter. We also show a pathological example, constructed from constraints on the method, where in spite of having two buffers for each run, some significant non-overlapping occurs.
0 references
main memory
0 references
merging
0 references
sorted runs
0 references