Sciweavers

2514 search results - page 150 / 503
» On the Computation of Approximations of Database Queries
Sort
View
IS
2007
15 years 6 months ago
Evaluation of probabilistic queries over imprecise data in constantly-evolving environments
Sensors are often employed to monitor continuously changing entities like locations of moving objects and temperature. The sensor readings are reported to a database system, and a...
Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabha...
ICDE
2011
IEEE
272views Database» more  ICDE 2011»
14 years 10 months ago
A continuous query system for dynamic route planning
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
Nirmesh Malviya, Samuel Madden, Arnab Bhattacharya
VLDB
2002
ACM
106views Database» more  VLDB 2002»
15 years 6 months ago
Approximate Frequency Counts over Data Streams
We present algorithms for computing frequency counts exceeding a user-specified threshold over data streams. Our algorithms are simple and have provably small memory footprints. A...
Gurmeet Singh Manku, Rajeev Motwani
SIGMOD
1998
ACM
96views Database» more  SIGMOD 1998»
15 years 10 months ago
Approximate Medians and other Quantiles in One Pass and with Limited Memory
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...
Gurmeet Singh Manku, Sridhar Rajagopalan, Bruce G....
KDD
2004
ACM
168views Data Mining» more  KDD 2004»
16 years 7 months ago
Mining, indexing, and querying historical spatiotemporal data
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
Nikos Mamoulis, Huiping Cao, George Kollios, Mario...