Sciweavers

1171 search results - page 71 / 235
» Streaming Queries over Streaming Data
Sort
View
132
Voted
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 25 days 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
INFOCOM
2005
IEEE
15 years 6 months ago
CoolStreaming/DONet: a data-driven overlay network for peer-to-peer live media streaming
— This paper presents DONet, a Data-driven Overlay Network for live media streaming. The core operations in DONet are very simple: every node periodically exchanges data availabi...
Xinyan Zhang, Jiangchuan Liu, Bo Li, Tak-Shing Pet...
USENIX
2008
15 years 3 months ago
Wide-Scale Data Stream Management
This paper describes Mortar, a distributed stream processing platform for building very large queries across federated systems (enterprises, grids, datacenters, testbeds). Nodes i...
Dionysios Logothetis, Ken Yocum
101
Voted
PVLDB
2008
136views more  PVLDB 2008»
15 years 5 days ago
Keyword query cleaning
Unlike traditional database queries, keyword queries do not adhere to predefined syntax and are often dirty with irrelevant words from natural languages. This makes accurate and e...
Ken Q. Pu, Xiaohui Yu
167
Voted
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 6 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...