1091 search results - page 21 / 219 » Approximation in Databases |
PODS
2005
ACM
14 years 8 months ago
2005
ACM
The traditional statistical assumption for interpreting histograms and justifying approximate query processing methods based on them is that all elements in a bucket have the same...
CSB
2005
IEEE
14 years 2 months ago
2005
IEEE
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
EDBT
2009
ACM
14 years 3 months ago
2009
ACM
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
With the amount of data in current data warehouse databases growing steadily, random sampling is continuously gaining in importance. In particular, interactive analyses of large d...
SIGMOD
1999
ACM
14 years 23 days ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....