I/O efficient dynamic data structures for longest prefix queries (Q1939656)
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: I/O efficient dynamic data structures for longest prefix queries |
scientific article; zbMATH DE number 6141197
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | I/O efficient dynamic data structures for longest prefix queries |
scientific article; zbMATH DE number 6141197 |
Statements
I/O efficient dynamic data structures for longest prefix queries (English)
0 references
5 March 2013
0 references
algorithms
0 references
data structures
0 references
longest prefix
0 references
I/O model
0 references
segment tree
0 references
string B-tree
0 references
0.9986463785171508
0 references
0.7673421502113342
0 references
0.7580514550209045
0 references
0.7515267133712769
0 references
0.7487085461616516
0 references
