Sciweavers

151 search results - page 17 / 31
» Answering approximate queries over autonomous web databases
Sort
View
ISCI
2006
145views more  ISCI 2006»
13 years 7 months ago
Processing count queries over event streams at multiple time granularities
Management and analysis of streaming data has become crucial with its applications in web, sensor data, network traffic data, and stock market. Data streams consist of mostly nume...
Aykut Ünal, Yücel Saygin, Özgü...
CIKM
2009
Springer
14 years 2 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
FQAS
2009
Springer
196views Database» more  FQAS 2009»
14 years 7 days ago
Flexible SPARQL Querying of Web Data Tables Driven by an Ontology
This paper concerns the design of a workflow which permits to feed and query a data warehouse opened on the Web, driven by a domain ontology. This data warehouse has been built to...
Patrice Buche, Juliette Dibie-Barthélemy, H...
VLDB
2005
ACM
121views Database» more  VLDB 2005»
14 years 1 months ago
Online Estimation For Subset-Based SQL Queries
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
Chris Jermaine, Alin Dobra, Abhijit Pol, Shantanu ...
SIGMOD
2010
ACM
236views Database» more  SIGMOD 2010»
14 years 13 days ago
Differentially private aggregation of distributed time-series with transformation and encryption
We propose PASTE, the first differentially private aggregation algorithms for distributed time-series data that offer good practical utility without any trusted server. PASTE add...
Vibhor Rastogi, Suman Nath