Sciweavers

ISMIS
2011
Springer
12 years 7 months ago
Data Access Paths in Processing of Sets of Frequent Itemset Queries
Abstract. Frequent itemset mining can be regarded as advanced database querying where a user specifies the dataset to be mined and constraints to be satisfied by the discovered i...
Piotr Jedrzejczak, Marek Wojciechowski
CSR
2007
Springer
13 years 10 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka