Sciweavers

1959 search results - page 219 / 392
» Document Management as a Database Problem
Sort
View
116
Voted
PPOPP
2005
ACM
15 years 9 months ago
A sampling-based framework for parallel data mining
The goal of data mining algorithm is to discover useful information embedded in large databases. Frequent itemset mining and sequential pattern mining are two important data minin...
Shengnan Cong, Jiawei Han, Jay Hoeflinger, David A...
131
Voted
PODS
2010
ACM
205views Database» more  PODS 2010»
15 years 8 months ago
Positive higher-order queries
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
Michael Benedikt, Gabriele Puppis, Huy Vu
111
Voted
DAWAK
1999
Springer
15 years 8 months ago
Heuristic Algorithms for Designing a Data Warehouse with SPJ Views
A Data Warehouse DW can be abstractly seen as a set of materialized views de ned over relations that are stored in distributed heterogeneous databases. The selection of views for...
Spyros Ligoudistianos, Timos K. Sellis, Dimitri Th...
258
Voted
ICDE
2009
IEEE
140views Database» more  ICDE 2009»
16 years 5 months ago
Predicting Multiple Metrics for Queries: Better Decisions Enabled by Machine Learning
One of the most challenging aspects of managing a very large data warehouse is identifying how queries will behave before they start executing. Yet knowing their performance charac...
Archana Ganapathi, Harumi A. Kuno, Umeshwar Dayal,...
127
Voted
DOLAP
2009
ACM
15 years 10 months ago
View usability and safety for the answering of top-k queries via materialized views
In this paper, we investigate the problem of answering top-k queries via materialized views. We provide theoretical guarantees for the adequacy of a view to answer a top-k query, ...
Eftychia Baikousi, Panos Vassiliadis