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 fast-growing 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.
|Name||Lecture Notes in Computer Science|
|Conference||18th International Conference of Database and Expert Systems Applications, DEXA 2007|
|Period||2/09/07 → 7/09/07|
|Other||2-7 September 2007|
- Subset superseq queries hashing