# Index Data Structure for Fast Subset and Superset Queries

Abstract : A new data structure set-trie for storing and retrieving sets is proposed. Efficient manipulation of sets is vital in a number of systems including datamining tools, object-relational database systems, and rule-based expert systems. Data structure set-trie provides efficient algorithms for set containment operations. It allows fast access to subsets and supersets of a given parameter set. The performance of operations is analyzed empirically in a series of experiments on real-world and artificial datasets. The analysis shows that sets can be accessed in $\mathcal{O}(c*|set|)$ time where |set| represents the size of parameter set and c is a constant.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [20 references]

https://hal.inria.fr/hal-01506780
Contributor : Hal Ifip <>
Submitted on : Wednesday, April 12, 2017 - 11:19:10 AM
Last modification on : Thursday, April 13, 2017 - 1:06:47 AM
Document(s) archivé(s) le : Thursday, July 13, 2017 - 12:33:13 PM

### File

978-3-642-40511-2_10_Chapter.p...
Files produced by the author(s)

### Identifiers

• HAL Id : hal-01506780, version 1

### Citation

Iztok Savnik. Index Data Structure for Fast Subset and Superset Queries. 1st Cross-Domain Conference and Workshop on Availability, Reliability, and Security in Information Systems (CD-ARES), Sep 2013, Regensburg, Germany. pp.134-148. ⟨hal-01506780⟩

Record views