Indexing set-valued attributes with a multi-level extendible hashing scheme

Sven Helmer, Robin Aly, Thomas Neumann, Guido Moerkotte

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations

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 (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.

Original languageEnglish
Title of host publicationDatabase and Expert Systems Applications - 18th International Conference, DEXA 2007, Proceedings
PublisherSpringer Verlag
Pages98-108
Number of pages11
ISBN (Print)9783540744672
DOIs
StatePublished - 2007
Externally publishedYes
Event18th International Conference on Database and Expert Systems Applications, DEXA 2007 - Regensburg, Germany
Duration: 3 Sep 20077 Sep 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4653 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th International Conference on Database and Expert Systems Applications, DEXA 2007
Country/TerritoryGermany
CityRegensburg
Period3/09/077/09/07

Fingerprint

Dive into the research topics of 'Indexing set-valued attributes with a multi-level extendible hashing scheme'. Together they form a unique fingerprint.

Cite this