Sciweavers

85 search results - page 11 / 17
» An Efficient Algorithm for Maintaining Frequent Closed Items...
Sort
View
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
14 years 7 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
INFFUS
2008
175views more  INFFUS 2008»
13 years 7 months ago
Adaptive optimization of join trees for multi-join queries over sensor streams
Data processing applications for sensor streams have to deal with multiple continuous data streams with inputs arriving at highly variable and unpredictable rates from various sour...
Joseph S. Gomes, Hyeong-Ah Choi
ICDE
2007
IEEE
103views Database» more  ICDE 2007»
14 years 9 months ago
TCAM-conscious Algorithms for Data Streams
Recently, there has been significant interest in developing space and time efficient solutions for answering continuous summarization queries over data streams. While these techni...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
EGH
2009
Springer
13 years 5 months ago
Efficient stream compaction on wide SIMD many-core architectures
Stream compaction is a common parallel primitive used to remove unwanted elements in sparse data. This allows highly parallel algorithms to maintain performance over several proce...
Markus Billeter, Ola Olsson, Ulf Assarsson
ICDE
2007
IEEE
148views Database» more  ICDE 2007»
14 years 9 months ago
Conquering the Divide: Continuous Clustering of Distributed Data Streams
Data is often collected over a distributed network, but in many cases, is so voluminous that it is impractical and undesirable to collect it in a central location. Instead, we mus...
Graham Cormode, S. Muthukrishnan, Wei Zhuang