ISB-tree: A new indexing scheme with efficient expected behaviour (Q616991)
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: ISB-tree: A new indexing scheme with efficient expected behaviour |
scientific article; zbMATH DE number 5839382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ISB-tree: A new indexing scheme with efficient expected behaviour |
scientific article; zbMATH DE number 5839382 |
Statements
ISB-tree: A new indexing scheme with efficient expected behaviour (English)
0 references
20 January 2011
0 references
B-tree
0 references
external memory data structure
0 references
interpolation search
0 references
data indexing
0 references
0.992231786251068
0 references
0.7646342515945435
0 references
0.758796215057373
0 references
0.755028247833252
0 references
