The SB-tree: An index-sequential structure for high-performance sequential access (Q1813013): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Expected behaviour of \(B^+\)-trees under random insertions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Organization and maintenance of large ordered indexes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3853109 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A simple bounded disorder file organization with good performance / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Distribution Design of Logical Database Schemas / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Unsafe operations in B-trees / rank | |||
Normal rank | |||
Revision as of 16:55, 14 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The SB-tree: An index-sequential structure for high-performance sequential access |
scientific article |
Statements
The SB-tree: An index-sequential structure for high-performance sequential access (English)
0 references
25 June 1992
0 references
See the preview in Zbl 0732.68032.
0 references
\(B\)-tree
0 references
disk access
0 references
long range retrievals
0 references
