%0 Conference Proceedings
%T Index Data Structure for Fast Subset and Superset Queries
%+ Artificial Intelligence Laboratory (AI Lab)
%A Savnik, Iztok
%Z Part 1: Cross-Domain Conference and Workshop on Multidisciplinary Research and Practice for Information Systems (CD-ARES 2013)
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 1st Cross-Domain Conference and Workshop on Availability, Reliability, and Security in Information Systems (CD-ARES)
%C Regensburg, Germany
%Y Alfredo Cuzzocrea
%Y Christian Kittl
%Y Dimitris E. Simos
%Y Edgar Weippl
%Y Lida Xu
%I Springer
%3 Availability, Reliability, and Security in Information Systems and HCI
%V LNCS-8127
%P 134-148
%8 2013-09-02
%D 2013
%K subset queries
%K set containment queries
%K partial matching
%K access methods
%K database index
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X 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.
%G English
%2 https://inria.hal.science/hal-01506780/document
%2 https://inria.hal.science/hal-01506780/file/978-3-642-40511-2_10_Chapter.pdf
%L hal-01506780
%U https://inria.hal.science/hal-01506780
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC5
%~ IFIP-WG
%~ IFIP-TC8
%~ IFIP-CD-ARES
%~ IFIP-WG8-4
%~ IFIP-WG8-9
%~ IFIP-LNCS-8127