Monitoring persistent items in the union of distributed streams

No abstract is available for this paper.

• Publication year

  2014

• Venue

  J. Parallel Distributed Comput.

• Publication date

  2014-09-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1016/j.jpdc.2014.07.008
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• When distributed computation is communication expensive

  2013cited by this paper
• Principal Component Analysis and Higher Correlations for Distributed Data

  2013cited by this paper
• Living in the present: on-the-fly information processing in scalable web architectures

  2012cited by this paper
• Approximate Frequency Counts over Data Streams

  2012cited by this paper
• A General Method for Estimating Correlated Aggregates Over a Data Stream

  2012cited by this paper
• Sketch-based Querying of Distributed Sliding-Window Data Streams

  2012cited by this paper
• Optimal Random Sampling from Distributed Streams Revisited

  2011cited by this paper
• Space‐efficient tracking of persistent items in a massive data stream

  2011cited by this paper
• Kafka : a Distributed Messaging System for Log Processing

  2011cited by this paper
• Tight bounds for distributed functional monitoring

  2011cited by this paper
• Counting distinct objects over sliding windows

  2010cited by this paper
• Optimal sampling from distributed streams

  2010influential reference
• Finding correlated heavy-hitters over data streams

  2009cited by this paper
• Exploiting Temporal Persistence to Detect Covert Botnet Channels

  2009influential reference
• Analysing distributed Internet worm attacks using continuous state-space approximation of process algebra models

  2008cited by this paper
• Detecting Click Fraud in Pay-Per-Click Streams of Online Advertising Networks

  2008cited by this paper
• Window Specification over Data Streams

  2006cited by this paper
• What’s Different: Distributed, Continuous Monitoring of Duplicate-Resilient Aggregates on Data Streams

  2006cited by this paper
• Sketching asynchronous streams over a sliding window

  2006cited by this paper
• Efficient Computation of Frequent and Top-k Elements in Data Streams

  2005cited by this paper
• Finding (recently) frequent items in distributed data streams

  2005cited by this paper
• Medians and beyond: new aggregation techniques for sensor networks

  2004cited by this paper
• An improved data stream summary: the count-min sketch and its applications

  2004cited by this paper
• TelegraphCQ: continuous dataflow processing

  2003cited by this paper
• Identifying frequent items in sliding windows over on-line packet streams

  2003cited by this paper
• Counting Distinct Elements in a Data Stream

  2002cited by this paper
• Abstract The

  2002cited by this paper
• Maintaining stream statistics over sliding windows: (extended abstract)

  2002cited by this paper
• Distributed Streams Algorithms for Sliding Windows

  2002influential reference
• Finding frequent items in data streams

  2002cited by this paper
• Estimating simple functions on the union of data streams

  2001influential reference
• On computing correlated aggregates over continual data streams

  2001cited by this paper
• Towards estimation error guarantees for distinct values

  2000cited by this paper
• Sampling-Based Estimation of the Number of Distinct Values of an Attribute

  1995cited by this paper
• Probabilistic Counting Algorithms for Data Base Applications

  1985cited by this paper
• Finding Repeated Elements

  1982cited by this paper

• Hypersistent Sketch: Enhanced Persistence Estimation via Fast Item Separation

  2025cites this paper
• A novel data streaming method for detecting abnormal flows in distributed monitoring systems

  2023cites this paper
• An Efficient Method for Detecting Supernodes Using Reversible Summary Data Structures in the Distributed Monitoring Systems

  2022cites this paper
• Persistent Items Tracking in Large Data Streams Based on Adaptive Sampling

  2022cites this paper
• PeriodicSketch: Finding Periodic Items in Data Streams

  2022cites this paper
• Detecting Persistent User Behavior Using Probabilistic Counting in Network-Wide View

  2021cites this paper
• Thresholded Monitoring in Distributed Data Streams

  2020cites this paper
• Finding Significant Items in Data Streams

  2019cites this paper
• Detecting Hidden User Behavior for Network Data Stream

  2018cites this paper
• Detecting Network-Wide Abnormal Behavior for Network Data Streams Based on Sketch

  2018cites this paper
• Identifying and Estimating Persistent Items in Data Streams

  2018influential citation
• An Evaluation of Streaming Algorithms for Distinct Counting Over a Sliding Window

  2015cites this paper
• Techniques for online analysis of large distributed data

  2015cites this paper