Sciweavers

7607 search results - page 1178 / 1522
» Querying data provenance
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 7 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
EDBT
2008
ACM
141views Database» more  EDBT 2008»
16 years 7 months ago
Generating Highly Customizable SQL Parsers
Database technology and the Structured Query Language (SQL) have grown enormously in recent years. Applications from different domains have different requirements for using databa...
Gunter Saake, Marko Rosenmüller, Martin Kuhle...
PAKDD
2009
ACM
133views Data Mining» more  PAKDD 2009»
16 years 1 months ago
On Link Privacy in Randomizing Social Networks
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu
IPPS
2009
IEEE
16 years 1 months ago
Ten weeks in the life of an eDonkey server
Abstract—This paper presents a capture of the queries managed by an eDonkey server during almost 10 weeks, leading to the observation of almost 9 billion messages involving almos...
Frederic Aidouni, Matthieu Latapy, Clémence...
IPPS
2009
IEEE
16 years 1 months ago
Resource allocation strategies for constructive in-network stream processing
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...
Anne Benoit, Henri Casanova, Veronika Rehn-Sonigo,...
« Prev « First page 1178 / 1522 Last » Next »