Sciweavers

19 search results - page 3 / 4
» Faster Query Answering in Probabilistic Databases using Read...
Sort
View
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
14 years 8 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 6 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
VLDB
2005
ACM
121views Database» more  VLDB 2005»
13 years 11 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 ...
DEXA
2003
Springer
149views Database» more  DEXA 2003»
13 years 11 months ago
Capturing Uncertainty in Spatial Queries over Imprecise Data
Emerging applications using miniature electronic devices (e.g., tracking mobile objects using sensors) generate very large amounts of highly dynamic data that poses very high overh...
Xingbo Yu, Sharad Mehrotra
EDBT
2009
ACM
104views Database» more  EDBT 2009»
14 years 1 months ago
A query processor for prediction-based monitoring of data streams
Networks of sensors are used in many different fields, from industrial applications to surveillance applications. A common feature of these applications is the necessity of a mo...
Sergio Ilarri, Ouri Wolfson, Eduardo Mena, Arantza...