Sciweavers

792 search results - page 71 / 159
» Computing Iceberg Queries Efficiently
Sort
View
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
15 years 11 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
2009
ACM
202views Database» more  SIGMOD 2009»
15 years 10 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
PODS
2005
ACM
131views Database» more  PODS 2005»
15 years 10 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
SEMWEB
2004
Springer
15 years 3 months ago
An Initial Investigation into Querying an Untrustworthy and Inconsistent Web
The Semantic Web is bound to be untrustworthy and inconsistent. In this paper, we present an initial approach for obtaining useful information in such an environment. In particular...
Yuanbo Guo, Jeff Heflin
AAAI
1990
14 years 11 months ago
Symbolic Probabilistic Inference in Belief Networks
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...
Ross D. Shachter, Bruce D'Ambrosio, Brendan Del Fa...