Sciweavers

725 search results - page 73 / 145
» Approximate Join Processing Over Data Streams
Sort
View
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
14 years 9 months ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...
XSYM
2004
Springer
115views Database» more  XSYM 2004»
14 years 2 months ago
XQuery Processing with Relevance Ranking
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
Leonidas Fegaras
SAC
2005
ACM
14 years 2 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...
STOC
2010
ACM
199views Algorithms» more  STOC 2010»
14 years 1 months ago
Zero-One Frequency Laws
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMSâ...
Vladimir Braverman and Rafail Ostrovsky
ICDE
2007
IEEE
143views Database» more  ICDE 2007»
14 years 10 months ago
Hiding in the Crowd: Privacy Preservation on Evolving Streams through Correlation Tracking
We address the problem of preserving privacy in streams, which has received surprisingly limited attention. For static data, a well-studied and widely used approach is based on ra...
Feifei Li, Jimeng Sun, Spiros Papadimitriou, Georg...