Sciweavers

3134 search results - page 529 / 627
» Computing full disjunctions
Sort
View
SIGMOD
2008
ACM
162views Database» more  SIGMOD 2008»
14 years 10 months ago
Event queries on correlated probabilistic streams
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
Christopher Ré, Dan Suciu, Julie Letchner, ...
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 10 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
14 years 10 months ago
Genome-scale disk-based suffix tree indexing
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
Benjarath Phoophakdee, Mohammed J. Zaki
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 10 months ago
Statistical analysis of sketch estimators
Sketching techniques can provide approximate answers to aggregate queries either for data-streaming or distributed computation. Small space summaries that have linearity propertie...
Florin Rusu, Alin Dobra
PODS
2006
ACM
134views Database» more  PODS 2006»
14 years 10 months ago
Finding global icebergs over distributed data sets
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
Qi Zhao, Mitsunori Ogihara, Haixun Wang, Jun Xu