Sciweavers

25041 search results - page 4802 / 5009
» Algorithms for Clustering Data
Sort
View
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
16 years 4 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
233
Voted
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
16 years 4 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
16 years 4 months ago
Optimizing mpf queries: decision support and probabilistic inference
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
Héctor Corrada Bravo, Raghu Ramakrishnan
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
16 years 4 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...
PODS
2008
ACM
178views Database» more  PODS 2008»
16 years 4 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel
« Prev « First page 4802 / 5009 Last » Next »