Sciweavers

146 search results - page 22 / 30
» Continuously Maintaining Order Statistics over Data Streams
Sort
View
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
14 years 9 days ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath
ADBIS
2009
Springer
127views Database» more  ADBIS 2009»
14 years 2 months ago
Window Update Patterns in Stream Operators
Continuous queries applied over nonterminating data streams usually specify windows in order to obtain an evolving –yet restricted– set of tuples and thus provide timely result...
Kostas Patroumpas, Timos K. Sellis
PPDP
2010
Springer
13 years 5 months ago
Deriving predicate statistics in datalog
Database query optimizers rely on data statistics in selecting query execution plans. Similar query optimization techniques are desirable for deductive databases and, to make this...
Senlin Liang, Michael Kifer
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
14 years 7 months ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...
SAC
2004
ACM
14 years 27 days ago
Forest trees for on-line data
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
João Gama, Pedro Medas, Ricardo Rocha