R. Baeza-yates and G. Gonnet, Fast text searching for regular expressions or automation searching on tries, Journal of ACM 1996, vol.43, issue.6, pp.915-936
DOI : 10.1145/235809.235810
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.2155

A. Blurn and M. Furst, Fast planning through planning graph analysis, Artificial Intelligence, vol.90, issue.2, pp.279-298, 1997.

M. Charikar, P. Indyk, and R. Panigrahy, New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems, LNCS, vol.2380, pp.451-462, 2002.
DOI : 10.1007/3-540-45465-9_39
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.1049

R. Doorenbos, Combining left and right unlinking for matching a large number of learned rules, AAAI-94, pp.451-458, 1994.

P. A. Flach and I. Savnik, Database dependency discovery: a machine learning approach, AI Communications, vol.12, issue.3, pp.139-160, 1999.

C. Forgy, Rete: A fast algorithm for the many pattern/many object pattern match problem, Artificial Intelligence, vol.19, issue.1, pp.17-37, 1982.
DOI : 10.1016/0004-3702(82)90020-0

S. Helmer and G. Moerkotte, A performance study of Four Index Structures for Set-Valued Attributes of Low Cardinality, The VLDB Journal -The International Journal on Very Large Data Bases, pp.244-261, 2003.

J. Hoffmann and J. Koehler, A New Method to Index and Query Sets, IJCAI, 1999.

N. Mamoulis, D. W. Cheung, and W. Lian, Similarity search in sets and categorical data using the signature tree, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405), 2003.
DOI : 10.1109/ICDE.2003.1260783

H. Mannila and H. Toivonen, Levelwise search and borders of theories in knowledge discovery, Data Mining and Knowledge Discovery, vol.1, issue.3, pp.241-258, 1997.
DOI : 10.1023/A:1009796218281

C. D. Manning, P. Raghavan, and H. Schãijtze, An Introduction to Information Retrieval, Draft, 2009.

S. Melnik and H. Garcia-molina, Adaptive algorithms for set containment joins, ACM Transactions on Database Systems, vol.28, issue.1, pp.1-38, 2003.
DOI : 10.1145/762471.762474

R. Rivest, Partial-Match Retrieval Algorithms, SIAM Journal on Computing, vol.5, issue.1, 1976.
DOI : 10.1137/0205003

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2001.

I. Savnik and P. A. Flach, Bottom-up Induction of Functional Dependencies from Relations, Proc. of KDD'93 Workshop: Knowledge Discovery from Databases, pp.174-185, 1993.

I. Savnik, Efficient subset and superset queries, Local Proceedings and Materials of Doctoral Consortium of the Tenth International Baltic Conference on Databases and Information Systems, 2012.

I. Savnik and P. A. Flach, Discovery of multivalued dependencies from relations, Intelligent Data Analysis Journal, Intelligent Data Analysis Journal, vol.4, pp.195-211, 2000.

M. Terrovitis, S. Passas, P. Vassiliadis, and T. Sellis, A combination of trie-trees and inverted files for the indexing of set-valued attributes, Proceedings of the 15th ACM international conference on Information and knowledge management , CIKM '06, 2006.
DOI : 10.1145/1183614.1183718

E. Tousidou, P. Bozanis, and Y. Manolopoulos, Signature-based structures for objects with set-valued attributes, Information Systems, vol.27, issue.2, pp.93-121, 2002.
DOI : 10.1016/S0306-4379(01)00047-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.8899

C. Zhang, J. Naughton, D. Dewitt, Q. Luo, and G. Lohman, On Supporting Containment Queries in Relational Database Management Systems, ACM SIGMOD, 2001.
DOI : 10.1145/375663.375722
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.2636