Sciweavers

58 search results - page 2 / 12
» Materialized View Selection for a Data Warehouse Using Frequ...
Sort
View
SAC
2006
ACM
14 years 7 days ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht
IDEAS
2003
IEEE
106views Database» more  IDEAS 2003»
13 years 11 months ago
Frequent Itemsets Mining for Database Auto-Administration
With the wide development of databases in general and data warehouses in particular, it is important to reduce the tasks that a database administrator must perform manually. The a...
Kamel Aouiche, Jérôme Darmont, Le Gru...
ISMIS
2011
Springer
12 years 9 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
DAWAK
2005
Springer
13 years 8 months ago
Incremental Data Mining Using Concurrent Online Refresh of Materialized Data Mining Views
Abstract. Data mining is an iterative process. Users issue series of similar data mining queries, in each consecutive run slightly modifying either the definition of the mined dat...
Mikolaj Morzy, Tadeusz Morzy, Marek Wojciechowski,...
DAWAK
2005
Springer
13 years 11 months ago
Automatic Selection of Bitmap Join Indexes in Data Warehouses
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when querie...
Kamel Aouiche, Jérôme Darmont, Omar B...