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

Terrovitis, M; Passas, S; Vassiliadis, P; Sellis, T

dc.contributor.author	Terrovitis, M	en
dc.contributor.author	Passas, S	en
dc.contributor.author	Vassiliadis, P	en
dc.contributor.author	Sellis, T	en
dc.date.accessioned	2014-03-01T02:43:48Z
dc.date.available	2014-03-01T02:43:48Z
dc.date.issued	2006	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31510
dc.subject	Containment queries	en
dc.subject	HTI	en
dc.subject	Inverted files	en
dc.subject	Tries	en
dc.subject.other	Containment queries	en
dc.subject.other	Inverted files	en
dc.subject.other	Data mining	en
dc.subject.other	Data structures	en
dc.subject.other	Indexing (of information)	en
dc.subject.other	Query processing	en
dc.subject.other	Trees (mathematics)	en
dc.title	A combination of trie-trees and inverted files for the indexing of set-valued attributes	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/1183614.1183718	en
heal.identifier.secondary	http://dx.doi.org/10.1145/1183614.1183718	en
heal.publicationDate	2006	en
heal.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. Copyright 2006 ACM.	en
heal.journalName	International Conference on Information and Knowledge Management, Proceedings	en
dc.identifier.doi	10.1145/1183614.1183718	en
dc.identifier.spage	728	en
dc.identifier.epage	737	en