DocumentCode
2858602
Title
Using tries for subset and superset queries
Author
Bevc, Stas ; Savnik, Iztok
Author_Institution
Primorska Inst. for Natural Sci. & Technol., Univ. of Primorska, Slovenia
fYear
2009
fDate
22-25 June 2009
Firstpage
147
Lastpage
152
Abstract
This paper presents a data structure for storing and querying sets. The data structure is based on tries, but because the order of elements in a set is not important (unlike letters in a string) we are able to implement additional subset and superset query operations besides the trie´s insert and search operation. The operations and their algorithms are described. We empirically analyze the operations in a series of experiments and present the results.
Keywords
query processing; search problems; set theory; storage management; tree data structures; data structure; search operation; subset query; superset query; tries insert; Data structures; Subset query; data structure; suffix tree; superset query; trie;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Technology Interfaces, 2009. ITI '09. Proceedings of the ITI 2009 31st International Conference on
Conference_Location
Dubrovnik
ISSN
1330-1012
Print_ISBN
978-953-7138-15-8
Type
conf
DOI
10.1109/ITI.2009.5196071
Filename
5196071
Link To Document