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


Share/Save/Bookmark

Helmer, S. and Aly, R.B.N. and Neumann, T. and Moerkotte, G. (2007) Indexing Set-Valued Attributes with a Multi-Level Extendible Hashing Scheme. In: 18th International Conference of Database and Expert Systems Applications, DEXA 2007, 2-7 September 2007, Regensburg, Germany.

[img]PDF
Restricted to UT campus only
: Request a copy
415Kb
Abstract: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.
Item Type:Conference or Workshop Item
Copyright:© 2007 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/61763
Official URL:http://dx.doi.org/10.1007/978-3-540-74469-6_11
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 241714