Index Data Structure for Fast Subset and Superset QueriesReportar como inadecuado

Index Data Structure for Fast Subset and Superset Queries - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 AI Lab - Artificial Intelligence Laboratory

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 : subset queries set containment queries partial matching access methods database index

Autor: Iztok Savnik -



Documentos relacionados