Franceschini, Gianni and Grossi, Roberto (2003) Optimal Space-Time Dictionaries over an Unbounded Universe with Flat Implicit Trees. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.
Postscript (GZip) - Published Version Available under License Creative Commons Attribution No Derivatives. Download (162Kb) |
Abstract
In the classical dictionary problem, a set of $n$ distinct keys over an unbounded and ordered universe is maintained under insertions and deletions of individual keys while supporting search operations. An implicit dictionary has the additional constraint of occupying the space merely required by storing the~$n$~keys, that is, exactly $n$ contiguous words of space in total. All what is known is the starting position of the memory segment hosting the keys, as the rest of the information is implicitly encoded by a suitable permutation of the keys. This paper describes the flat implicit tree, which is the first implicit dictionary requiring $O(\log n)$ time per search and update operation.
Item Type: | Book |
---|---|
Uncontrolled Keywords: | data structures, searching, dictionary problem, implicitness. |
Subjects: | Area01 - Scienze matematiche e informatiche > INF/01 - Informatica |
Divisions: | Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA |
Depositing User: | dott.ssa Sandra Faita |
Date Deposited: | 17 Dec 2014 16:32 |
Last Modified: | 17 Dec 2014 16:32 |
URI: | http://eprints.adm.unipi.it/id/eprint/2091 |
Repository staff only actions
View Item |