Show simple item record

dc.contributor.authorHelmer, S
dc.contributor.authorMoerkotte, G
dc.date.accessioned2015-06-29T10:08:24Z
dc.date.available2015-06-29T10:08:24Z
dc.date.issued2003
dc.identifier.issn1066-8888
dc.identifier.urihttp://dx.doi.org/10.1007/s00778-003-0106-0
dc.identifier.urihttp://link.springer.com/article/10.1007%2Fs00778-003-0106-0
dc.identifier.urihttp://hdl.handle.net/10863/943
dc.description.abstractThe efficient retrieval of data items on set-valued attributes is an important research topic that has attracted little attention so far. We studied and modified four index structures (sequential signature files, signature trees, extendible signature hashing, and inverted files) for a fast retrieval of sets with low cardinality. We compared the index structures by implementing them and subjecting them to extensive experiments, investigating the influence of query set size, database size, domain size, and data distribution (synthetic and real). The results of the experiments clearly indicate that inverted files exhibit the best overall behavior of all tested index structuresen_US
dc.publisherSpringer Verlag (Germany)en_US
dc.titleA performance study of four index structures for set-valued attributes of low cardinalityen_US
dc.typeArticleen_US
dc.date.updated2015-06-25T06:48:23Z
dc.journal.titleVLDB Journal
dc.description.fulltextnoneen_US


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record