Sciweavers

2514 search results - page 38 / 503
» On the Computation of Approximations of Database Queries
Sort
View
EDBT
2004
ACM
122views Database» more  EDBT 2004»
16 years 6 months ago
Sketch-Based Multi-query Processing over Data Streams
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
CIKM
2008
Springer
15 years 8 months ago
PROQID: partial restarts of queries in distributed databases
In a number of application areas, distributed database systems can be used to provide persistent storage of data while providing efficient access for both local and remote data. W...
Jon Olav Hauglid, Kjetil Nørvåg
SIGMOD
2010
ACM
154views Database» more  SIGMOD 2010»
15 years 6 months ago
Unbiased estimation of size and other aggregates over hidden web databases
Many websites provide restrictive form-like interfaces which allow users to execute search queries on the underlying hidden databases. In this paper, we consider the problem of es...
Arjun Dasgupta, Xin Jin, Bradley Jewell, Nan Zhang...
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
15 years 11 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
ICDE
2008
IEEE
160views Database» more  ICDE 2008»
16 years 7 months ago
Exploiting Lineage for Confidence Computation in Uncertain and Probabilistic Databases
We study the problem of computing query results with confidence values in ULDBs: relational databases with uncertainty and lineage. ULDBs, which subsume probabilistic databases, o...
Anish Das Sarma, Martin Theobald, Jennifer Widom