Sciweavers

Share
DEXA
2007
Springer

Indexing Set-Valued Attributes with a Multi-level Extendible Hashing Scheme

9 years 7 months ago
Indexing Set-Valued Attributes with a Multi-level Extendible Hashing Scheme
We present an access method for set-valued attributes that is based on a multi-level extendible hashing scheme. This scheme avoids exponential directory growth for skewed data and thus generates a much smaller number of subqueries for query sets (up to now fastgrowing directories have prohibited the use of hash-based index structures for set-valued retrieval). We demonstrate the advantages of our scheme over regular extendible hashing both analytically and experimentally. Additionally, we compare the performance of a prototype implementation with that of several other access methods; the results underline the benefits of our approach.
Sven Helmer, Robin Aly, Thomas Neumann, Guido Moer
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where DEXA
Authors Sven Helmer, Robin Aly, Thomas Neumann, Guido Moerkotte
Comments (0)
books