Implicit \(B\)-trees: A new data structure for the dictionary problem (Q598254): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2003.11.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044832252 / rank | |||
Normal rank | |||
Revision as of 22:57, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implicit \(B\)-trees: A new data structure for the dictionary problem |
scientific article |
Statements
Implicit \(B\)-trees: A new data structure for the dictionary problem (English)
0 references
6 August 2004
0 references
Searching
0 references
\(B\)-trees
0 references
Implicit data structures
0 references
External memory
0 references
