28 search results - page 2 / 6 » Discovery and Application of Functional Dependencies in Conj... |
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
In this paper we study the problem of mining all frequent queries in a given database table, a problem known to be intractable even for conjunctive queries. We restrict our attent...
KDD
1998
ACM
13 years 9 months ago
1998
ACM
This paper presents an algorithm for discovering conjunction rules with high reliability from data sets. The discovery of conjunction rules, each of which is a restricted form of ...
VLDB
2004
ACM
13 years 10 months ago
2004
ACM
When query optimizers erroneously assume that database columns are statistically independent, they can underestimate the selectivities of conjunctive predicates by orders of magni...
PODS
2010
ACM
13 years 10 months ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
ICDE
2010
IEEE
14 years 6 days ago
2010
IEEE
— To cope with bursty arrivals of high-volume data, a DSMS has to shed load while minimizing the degradation of Quality of Service (QoS). In this paper, we show that this problem...