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

S. Helmer; Robin Aly; T. Neumann; G. Moerkotte

doi:10.1007/978-3-540-74469-6_11

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

S. Helmer, Robin Aly, T. Neumann, G. Moerkotte

Databases (Former)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

6 Citations (Scopus)

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.

Original language	Undefined
Title of host publication	Proceedings of the 18th International Conference of Database and Expert Systems Applications (DEXA 2007)
Place of Publication	Berlin
Publisher	Springer
Pages	98-108
Number of pages	10
ISBN (Print)	978-3-540-74467-2
DOIs	https://doi.org/10.1007/978-3-540-74469-6_11
Publication status	Published - Sep 2007
Event	18th International Conference of Database and Expert Systems Applications, DEXA 2007 - Regensburg, Germany Duration: 2 Sep 2007 → 7 Sep 2007

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Verlag
Number	SINTEF A13
Volume	4653

Conference

Conference	18th International Conference of Database and Expert Systems Applications, DEXA 2007
Period	2/09/07 → 7/09/07
Other	2-7 September 2007

Keywords

Subset superseq queries hashing
METIS-241714
IR-61763
EWI-10328

Access to Document

10.1007/978-3-540-74469-6_11

http://eprints.eemcs.utwente.nl/secure2/10328/01/fulltext.pdf

Cite this

Helmer, S., Aly, R., Neumann, T., & Moerkotte, G. (2007). Indexing Set-Valued Attributes with a Multi-Level Extendible Hashing Scheme. In Proceedings of the 18th International Conference of Database and Expert Systems Applications (DEXA 2007) (pp. 98-108). [10.1007/978-3-540-74469-6_11] (Lecture Notes in Computer Science; Vol. 4653, No. SINTEF A13). Springer. https://doi.org/10.1007/978-3-540-74469-6_11

@inproceedings{738c4d790325473e856f30b8d28d0919,

title = "Indexing Set-Valued Attributes with a Multi-Level Extendible Hashing Scheme",

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.",

keywords = "Subset superseq queries hashing, METIS-241714, IR-61763, EWI-10328",

author = "S. Helmer and Robin Aly and T. Neumann and G. Moerkotte",

note = "10.1007/978-3-540-74469-6_11 ; null ; Conference date: 02-09-2007 Through 07-09-2007",

year = "2007",

month = sep,

doi = "10.1007/978-3-540-74469-6_11",

language = "Undefined",

isbn = "978-3-540-74467-2",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

number = "SINTEF A13",

pages = "98--108",

booktitle = "Proceedings of the 18th International Conference of Database and Expert Systems Applications (DEXA 2007)",

}

Helmer, S, Aly, R, Neumann, T & Moerkotte, G 2007, Indexing Set-Valued Attributes with a Multi-Level Extendible Hashing Scheme. in Proceedings of the 18th International Conference of Database and Expert Systems Applications (DEXA 2007)., 10.1007/978-3-540-74469-6_11, Lecture Notes in Computer Science, no. SINTEF A13, vol. 4653, Springer, Berlin, pp. 98-108, 18th International Conference of Database and Expert Systems Applications, DEXA 2007, 2/09/07. https://doi.org/10.1007/978-3-540-74469-6_11

Indexing Set-Valued Attributes with a Multi-Level Extendible Hashing Scheme. / Helmer, S.; Aly, Robin; Neumann, T.; Moerkotte, G.

Proceedings of the 18th International Conference of Database and Expert Systems Applications (DEXA 2007). Berlin : Springer, 2007. p. 98-108 10.1007/978-3-540-74469-6_11 (Lecture Notes in Computer Science; Vol. 4653, No. SINTEF A13).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

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

AU - Helmer, S.

AU - Aly, Robin

AU - Neumann, T.

AU - Moerkotte, G.

N1 - 10.1007/978-3-540-74469-6_11

PY - 2007/9

Y1 - 2007/9

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

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

KW - Subset superseq queries hashing

KW - METIS-241714

KW - IR-61763

KW - EWI-10328

U2 - 10.1007/978-3-540-74469-6_11

DO - 10.1007/978-3-540-74469-6_11

M3 - Conference contribution

SN - 978-3-540-74467-2

T3 - Lecture Notes in Computer Science

SP - 98

EP - 108

BT - Proceedings of the 18th International Conference of Database and Expert Systems Applications (DEXA 2007)

PB - Springer

CY - Berlin

Y2 - 2 September 2007 through 7 September 2007

ER -

Helmer S, Aly R, Neumann T, Moerkotte G. Indexing Set-Valued Attributes with a Multi-Level Extendible Hashing Scheme. In Proceedings of the 18th International Conference of Database and Expert Systems Applications (DEXA 2007). Berlin: Springer. 2007. p. 98-108. 10.1007/978-3-540-74469-6_11. (Lecture Notes in Computer Science; SINTEF A13). https://doi.org/10.1007/978-3-540-74469-6_11