Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

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


Neumann,  Thomas
Databases and Information Systems, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Helmer, S., Aly, R., Neumann, T., & Moerkotte, G. (2007). Indexing Set-Valued Attributes with a Multi-level Extendible Hashing Scheme. In R. Wagner, N. Revell, & G. Pernul (Eds.), Database and Expert Systems Applications, 18th International Conference, DEXA 2007 (pp. 98-108). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-1F91-2
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 (so far fast-growing directories have prohibited hash-based index structures for set-valued retrieval). We demonstrate the advantages of our scheme over regular extendible hashing both analytically and experimentally. We also implemented a prototype and briefly summarize the results of our experimental evaluation.