Index Data Structure for Fast Subset and Superset Queries - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Index Data Structure for Fast Subset and Superset Queries

(1)
1
Iztok Savnik
  • Function : Author
  • PersonId : 1006208

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.
Fichier principal
Vignette du fichier
978-3-642-40511-2_10_Chapter.pdf (150.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01506780 , version 1 (12-04-2017)

Licence

Attribution - CC BY 4.0

Identifiers

  • HAL Id : hal-01506780 , version 1

Cite

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⟩
93 View
2566 Download

Share

Gmail Facebook Twitter LinkedIn More