Sciweavers

511 search results - page 24 / 103
» Approximate Selection Queries over Imprecise Data
Sort
View
SIGMOD
1998
ACM
121views Database» more  SIGMOD 1998»
15 years 10 months ago
New Sampling-Based Summary Statistics for Improving Approximate Query Answers
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...
Phillip B. Gibbons, Yossi Matias
ACIVS
2008
Springer
16 years 10 days ago
Sub-optimal Camera Selection in Practical Vision Networks through Shape Approximation
Within a camera network, the contribution of a camera to the observations of a scene depends on its viewpoint and on the scene configuration. This is a dynamic property, as the sc...
Huang Lee, Linda Tessens, Marleen Morbée, H...
VLDB
2002
ACM
157views Database» more  VLDB 2002»
16 years 6 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
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
16 years 7 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...
ICDT
2001
ACM
153views Database» more  ICDT 2001»
15 years 10 months ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...