I/O efficient dynamic data structures for longest prefix queries (Q1939656): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-011-9594-2 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969605837 / rank | |||
Revision as of 17:37, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | I/O efficient dynamic data structures for longest prefix queries |
scientific article |
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
