Sciweavers

511 search results - page 19 / 103
» Approximate Selection Queries over Imprecise Data
Sort
View
IDEAS
2006
IEEE
180views Database» more  IDEAS 2006»
15 years 11 months ago
SURCH: Distributed Aggregation over Wireless Sensor Networks
In this paper, we present SURCH, a novel decentralized algorithm for efficient processing of queries generated in sensor networks. Unlike existing techniques, SURCH is fully dist...
Xingbo Yu, Sharad Mehrotra, Nalini Venkatasubraman...
SSDBM
2008
IEEE
113views Database» more  SSDBM 2008»
16 years 1 hour ago
Query Selectivity Estimation for Uncertain Data
Applications requiring the handling of uncertain data have led to the development of database management systems extending the scope of relational databases to include uncertain (p...
Sarvjeet Singh, Chris Mayfield, Rahul Shah, Sunil ...
159
Voted
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
15 years 7 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
ICDE
2010
IEEE
273views Database» more  ICDE 2010»
16 years 5 months ago
WikiAnalytics: Ad-hoc Querying of Highly Heterogeneous Structured Data
Searching and extracting meaningful information out of highly heterogeneous datasets is a hot topic that received a lot of attention. However, the existing solutions are based on e...
Andrey Balmin, Emiran Curtmola
IS
2012
14 years 1 months ago
View determinacy for preserving selected information in data transformations
When transforming data one often wants certain information in the data source to be preserved, i.e., we identify parts of the source data and require these parts to be transformed...
Wenfei Fan, Floris Geerts, Lixiao Zheng