Sciweavers

725 search results - page 49 / 145
» Approximate Join Processing Over Data Streams
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 8 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
MDM
2007
Springer
126views Communications» more  MDM 2007»
14 years 2 months ago
Semantics of Spatially-Aware Windows Over Streaming Moving Objects
Several window constructs are usually specified in continuous queries over data streams as a means of limiting the amount of data processed each time and thus providing real-time...
Kostas Patroumpas, Timos K. Sellis
BTW
2011
Springer
218views Database» more  BTW 2011»
13 years 9 days ago
Tracking Hot-k Items over Web 2.0 Streams
Abstract: The rise of the Web 2.0 has made content publishing easier than ever. Yesterday’s passive consumers are now active users who generate and contribute new data to the web...
Parisa Haghani, Sebastian Michel, Karl Aberer
GIS
2008
ACM
14 years 9 months ago
Monitoring continuous queries over streaming locations
We report on our experience from design and implementation of a powerful map application for managing, querying and visualizing evolving locations of moving objects. Instead of bu...
Kostas Patroumpas, Evi Kefallinou, Timos K. Sellis
IPPS
2007
IEEE
14 years 3 months ago
Storage Optimization for Large-Scale Distributed Stream Processing Systems
We consider storage in an extremely large-scale distributed computer system designed for stream processing applications. In such systems, incoming data and intermediate results ma...
Kirsten Hildrum, Fred Douglis, Joel L. Wolf, Phili...