An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time (Q579942)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4016202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time |
scientific article; zbMATH DE number 4016202 |
Statements
An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time (English)
0 references
1986
0 references
We introduce a data structure that requires only one pointer for every k data values and supports searches in O(log n) time and insertions and deletions in \(O(k+\log n)\) time. By choosing k to be O(log n), pointers can be encoded into the relative order of data values and this technique can be used to support insert, delete and search in \(O(\log^ 2 n)\) time while using only the storage needed for the data.
0 references
data structure
0 references
insertions
0 references
deletions
0 references
pointers
0 references
0.8126837611198425
0 references
0.8125677108764648
0 references
0.7963842749595642
0 references
