A combination of trie-trees and inverted files for the indexing of set-valued attributes

Abstract

Set-valued attributes frequently occur in contexts like market-basked analysis and stock market trends. Late research literature has mainly focused on set containment joins and data mining without considering simple queries on set valued attributes. In this paper we address superset, subset and equality queries and we propose a novel indexing scheme for answering them on set-valued attributes. The proposed index superimposes a trie-tree on top of an inverted file that indexes a relation with set-valued data. We show that we can efficiently answer the aforementioned queries by indexing only a subset of the most frequent of the items that occur in the indexed relation. Finally, we show through extensive experiments that our approach outperforms the state of the art mechanisms and scales gracefully as database size grows.

DOI: 10.1145/1183614.1183718

Extracted Key Phrases

5 Figures and Tables

Cite this paper

@inproceedings{Terrovitis2006ACO, title={A combination of trie-trees and inverted files for the indexing of set-valued attributes}, author={Manolis Terrovitis and Spyros Passas and Panos Vassiliadis and Timos K. Sellis}, booktitle={CIKM}, year={2006} }