Sciweavers

1000 search results - page 111 / 200
» Provenance for Aggregate Queries
Sort
View
SIGCOMM
2005
ACM
14 years 3 months ago
Declarative routing: extensible routing with declarative queries
The Internet’s core routing infrastructure, while arguably robust and efficient, has proven to be difficult to evolve to accommodate the needs of new applications. Prior researc...
Boon Thau Loo, Joseph M. Hellerstein, Ion Stoica, ...
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
13 years 25 days ago
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
Bhargav Kanagal, Jian Li, Amol Deshpande
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
14 years 11 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
ICDE
1999
IEEE
114views Database» more  ICDE 1999»
14 years 11 months ago
Universal Temporal Extensions for Database Languages
Temporal reasoning and temporal query languages present di cult research problems of theoretical interest and practical importance. One problem is the chasm between point-based te...
Cindy Xinmin Chen, Carlo Zaniolo
VLDB
2008
ACM
140views Database» more  VLDB 2008»
14 years 10 months ago
Efficient temporal counting with bounded error
This paper studies aggregate search in transaction time databases. Specifically, each object in such a database can be modeled as a horizontal segment, whose y-projection is its s...
Yufei Tao, Xiaokui Xiao