Sciweavers

725 search results - page 90 / 145
» Approximate Join Processing Over Data Streams
Sort
View
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
14 years 1 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
SIGARCH
2008
107views more  SIGARCH 2008»
13 years 8 months ago
A lightweight streaming layer for multicore execution
As multicore architectures gain widespread use, it becomes increasingly important to be able to harness their additional processing power to achieve higher performance. However, e...
David Zhang, Qiuyuan J. Li, Rodric Rabbah, Saman A...
ESANN
2008
13 years 10 months ago
Parallelizing single patch pass clustering
Clustering algorithms such as k-means, the self-organizing map (SOM), or Neural Gas (NG) constitute popular tools for automated information analysis. Since data sets are becoming l...
Nikolai Alex, Barbara Hammer
NAACL
2010
13 years 6 months ago
Streaming First Story Detection with application to Twitter
With the recent rise in popularity and size of social media, there is a growing need for systems that can extract useful information from this amount of data. We address the probl...
Sasa Petrovic, Miles Osborne, Victor Lavrenko
ICDE
2007
IEEE
174views Database» more  ICDE 2007»
14 years 3 months ago
Adapting Partitioned Continuous Query Processing in Distributed Systems
Partitioned query processing is an effective method to process continuous queries with large stateful operators in a distributed systems. This method typically partitions input da...
Yali Zhu, Elke A. Rundensteiner