55 search results - page 1 / 11 » Compact dictionaries for variable-length keys and data with ... |
MSV
2004
13 years 6 months ago
2004
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
TALG
2008
13 years 5 months ago
2008
ACSC
2009
IEEE
14 years 10 days ago
2009
IEEE
A hash table is a fundamental data structure in computer science that can offer rapid storage and retrieval of data. A leading implementation for string keys is the cacheconscious...
IPL
2010
13 years 4 months ago
2010
We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, suppor...
ALGORITHMICA
2005
13 years 5 months ago
2005
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...