Query-optimal partially persistent B-trees with constant worst-case update time (Q4977892)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Query-optimal partially persistent B-trees with constant worst-case update time |
scientific article; zbMATH DE number 6761719
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Query-optimal partially persistent B-trees with constant worst-case update time |
scientific article; zbMATH DE number 6761719 |
Statements
Query-Optimal Partially Persistent B-Trees with Constant Worst-Case Update Time (English)
0 references
17 August 2017
0 references
partial persistence
0 references
worst-case update time
0 references
B-trees
0 references
node-copying
0 references
0.9202017188072203
0 references
0.8086551427841187
0 references
0.8062642812728882
0 references
0.793601393699646
0 references
