Sciweavers

489 search results - page 14 / 98
» Query Selectivity Estimation via Data Mining
Sort
View
DEXA
2005
Springer
110views Database» more  DEXA 2005»
15 years 3 months ago
Intensional Encapsulations of Database Subsets via Genetic Programming
Finding intensional encapsulations of database subsets is the inverse of query evaluation. Whereas query evaluation transforms an intensional expression (the query) to its extensi...
Aybar C. Acar, Amihai Motro
EDBT
2008
ACM
206views Database» more  EDBT 2008»
15 years 9 months ago
Designing an inductive data stream management system: the stream mill experience
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
Hetal Thakkar, Barzan Mozafari, Carlo Zaniolo
CVPR
2010
IEEE
14 years 7 months ago
Multi-structure model selection via kernel optimisation
Our goal is to fit the multiple instances (or structures) of a generic model existing in data. Here we propose a novel model selection scheme to estimate the number of genuine str...
Tat-Jun Chin, David Suter, Hanzi Wang
SDM
2007
SIAM
147views Data Mining» more  SDM 2007»
14 years 11 months ago
Constraint-Based Pattern Set Mining
Local pattern mining algorithms generate sets of patterns, which are typically not directly useful and have to be further processed before actual application or interpretation. Ra...
Luc De Raedt, Albrecht Zimmermann
VLDB
2002
ACM
157views Database» more  VLDB 2002»
15 years 9 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu