1091 search results - page 56 / 219 » Approximation in Databases |
WADS
2007
Springer
15 years 6 months ago
2007
Springer
Let (L, ∗) be a semilattice, and let c : L → [0, ∞) be monotone and increasing on L. We state the Minimum Join problem as: given size n sub-collection X of L and integer k w...
SIGMOD
1994
ACM
15 years 3 months ago
1994
ACM
In this paper, we propose a novel approach for estimating the record selectivities of database queries. The real attribute value distribution is adaptively approximated by a curve...
123
click to vote
VLDB
2004
ACM
15 years 5 months ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
DASFAA
2004
IEEE
15 years 3 months ago
2004
IEEE
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
88
Voted
CIKM
2003
Springer
15 years 5 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...