STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Quickly generating billion-record synthetic databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Symmetry breaking for suffix tree construction
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Sparse Approximate Solutions to Linear Systems
SIAM Journal on Computing
Randomized algorithms
Comparing information without leaking it
Communications of the ACM
The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Incremental clustering and dynamic information retrieval
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Communication complexity
Random sampling for histogram construction: how much is enough?
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
The power of a pebble: exploring and mapping directed graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Min-wise independent permutations (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Tracking join and self-join sizes in limited storage
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Self-tuning histograms: building histograms without looking at data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Modern computer algebra
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Approximate nearest neighbors and sequence comparison with block operations
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Communication complexity of document exchange
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Hancock: a language for extracting signatures from data streams
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
A linear space algorithm for computing maximal common subsequences
Communications of the ACM
Sublinear time approximate clustering
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A small approximately min-wise independent family of hash functions
Journal of Algorithms
On computing correlated aggregates over continual data streams
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Space-efficient online computation of quantile summaries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Estimating simple functions on the union of data streams
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Fast computation of low rank matrix approximations
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Near-optimal sparse fourier representations via sampling
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Clifford algebras and approximating the permanent
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Space lower bounds for distance approximation in the data stream model
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximate counting of inversions in a data stream
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Fast, small-space algorithms for approximate histogram maintenance
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reductions in streaming algorithms, with an application to counting triangles in graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Maintaining stream statistics over sliding windows: (extended abstract)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The string edit distance matching problem with moves
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Mining database structure; or, how to build a data quality browser
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Dynamic multidimensional histograms
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Gigascope: high performance network monitoring with an SQL interface
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Chromium: a stream-processing framework for interactive rendering on clusters
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Signature-Based Methods for Data Streams
Data Mining and Knowledge Discovery
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Observed structure of addresses in IP traffic
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Application of the two-sided depth test to CSG rendering
I3D '03 Proceedings of the 2003 symposium on Interactive 3D graphics
Pass efficient algorithms for approximating large matrices
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation of functions over redundant dictionaries using coherence
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Space-efficient finger search on degree-balanced search trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Better algorithms for high-dimensional proximity problems via asymmetric embeddings
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An Information Statistics Approach to Data Stream and Communication Complexity
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries
Proceedings of the 27th International Conference on Very Large Data Bases
Query Processing in Tertiary Memory Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Finding Frequent Items in Data Streams
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Histogramming Data Streams with Fast Per-Item Processing
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Graph Structure of the Web: A Survey
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Counting Distinct Elements in a Data Stream
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Estimating Rarity and Similarity over Data Stream Windows
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
IDA '01 Proceedings of the 4th International Conference on Advances in Intelligent Data Analysis
A simple algorithm for finding frequent elements in streams and bags
ACM Transactions on Database Systems (TODS)
What's hot and what's not: tracking most frequent items dynamically
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Bursty and hierarchical structure in streams
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Better streaming algorithms for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
An Approximate L1-Difference Algorithm for Massive Data Streams
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Stable distributions, pseudorandom generators, embeddings and data stream computation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice
ACM Transactions on Computer Systems (TOCS)
Exploratory Data Mining and Data Cleaning
Exploratory Data Mining and Data Cleaning
Automatically inferring patterns of resource consumption in network traffic
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Set Reconciliation with Nearly Optimal Communication Complexity
Set Reconciliation with Nearly Optimal Communication Complexity
STREAM: the stanford stream data manager (demonstration description)
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient approximate and dynamic matching of patterns using a labeling paradigm
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On the Dynamic Finger Conjecture for Splay Trees Part II: The Proof
On the Dynamic Finger Conjecture for Splay Trees Part II: The Proof
Tight Lower Bounds for the Distinct Elements Problem
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Always Good Turing: Asymptotically Optimal Probability Estimation
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Identifying frequent items in sliding windows over on-line packet streams
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Sketch-based change detection: methods, evaluation, and applications
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Aurora: a new model and architecture for data stream management
The VLDB Journal — The International Journal on Very Large Data Bases
Algorithms column: sublinear time algorithms
ACM SIGACT News
An improved data stream algorithm for frequency moments
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal space lower bounds for all frequency moments
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic sampling and range counting in geometric data streams
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Range counting over multidimensional data streams
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Flow sampling under hard resource constraints
Proceedings of the joint international conference on Measurement and modeling of computer systems
Mining Deviants in Time Series Data Streams
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Algorithms for dynamic geometric problems over data streams
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Holistic UDAFs at streaming speeds
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Diamond in the rough: finding Hierarchical Heavy Hitters in multi-dimensional data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Spatially-decaying aggregation over a network: model and algorithms
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Load management and high availability in the Medusa distributed stream processing system
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
On the difficulty of scalably detecting network attacks
Proceedings of the 11th ACM conference on Computer and communications security
Medians and beyond: new aggregation techniques for sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Tracking set-expression cardinalities over continuous update streams
The VLDB Journal — The International Journal on Very Large Data Bases
Finding (Recently) Frequent Items in Distributed Data Streams
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Deterministic wavelet thresholding for maximum-error metrics
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Adaptive sampling for geometric problems over data streams
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximate counts and quantiles over sliding windows
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimal approximations of the frequency moments of data streams
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Coresets in dynamic geometric data streams
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fast estimation of fractal dimension and correlation integral on stream data
Information Processing Letters
Sampling in dynamic data streams and applications
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Multi-pass geometric algorithms
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Space efficient mining of multigraph streams
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Estimating arbitrary subset sums with few probes
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Space complexity of hierarchical heavy hitters in multi-dimensional data streams
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Sampling algorithms in a stream operator
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Holistic aggregates in a networked world: distributed tracking of approximate quantiles
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Graph distances in the streaming model: the value of space
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Improved range-summable random variable construction algorithms
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An improved data stream summary: the count-min sketch and its applications
Journal of Algorithms
Detecting malicious network traffic using inverse distributions of packet contents
Proceedings of the 2005 ACM SIGCOMM workshop on Mining network data
Wavelet synopsis for data streams: minimizing non-euclidean error
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Privacy-preserving distributed k-means clustering over arbitrarily partitioned data
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Sketching streams through the net: distributed approximate query tracking
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Summarizing and mining inverse distributions on data streams via dynamic inverse sampling
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Space efficiency in synopsis construction algorithms
VLDB '05 Proceedings of the 31st international conference on Very large data bases
What's new: finding significant differences in network data streams
IEEE/ACM Transactions on Networking (TON)
On graph problems in a semi-streaming model
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
SIAM Journal on Computing
Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
SIAM Journal on Computing
Comparing data streams using Hamming norms (how to zero in)
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Approximate frequency counts over data streams
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
How to summarize the universe: dynamic maintenance of quantiles
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Reverse nearest neighbor aggregates over data streams
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Finding hierarchical heavy hitters in data streams
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Checks and balances: monitoring data quality problems in network traffic databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Locating hidden groups in communication networks using hidden Markov models
ISI'03 Proceedings of the 1st NSF/NIJ conference on Intelligence and security informatics
Workload-optimal histograms on streams
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Optimal workload-based weighted wavelet synopses
ICDT'05 Proceedings of the 10th international conference on Database Theory
Efficient computation of frequent and top-k elements in data streams
ICDT'05 Proceedings of the 10th international conference on Database Theory
Streams, security and scalability
DBSec'05 Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security
Greed is good: algorithmic results for sparse approximation
IEEE Transactions on Information Theory
To randomize or not to randomize: space optimal summaries for hyperlink analysis
Proceedings of the 15th international conference on World Wide Web
Weighted random sampling with a reservoir
Information Processing Letters
Confidence intervals for priority sampling
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Beyond streams and graphs: dynamic tensor analysis
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Revising Type-2 Computation and Degrees of Discontinuity
Electronic Notes in Theoretical Computer Science (ENTCS)
Lower bounds for randomized read/write stream algorithms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Machine models and lower bounds for query processing
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Estimating entropy over data streams
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Time-decaying sketches for sensor data aggregation
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Estimating the sortedness of a data stream
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient aggregation algorithms for probabilistic data
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Priority sampling for estimation of arbitrary subset sums
Journal of the ACM (JACM)
A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On distributing symmetric streaming computations
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Why simple hash functions work: exploiting the entropy in a data stream
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for distributed functional monitoring
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for subset selection in linear regression
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Query-aware partitioning for monitoring massive network data streams
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Prefilter: predicate pushdown at streaming speeds
SSPS '08 Proceedings of the 2nd international workshop on Scalable stream processing system
ACM SIGACT News
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Sleeping on the job: energy-efficient and robust broadcast for radio networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Summarizing spatial data streams using ClusterHulls
Journal of Experimental Algorithmics (JEA)
Efficiently Discovering Recent Frequent Items in Data Streams
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Simplified Planar Coresets for Data Streams
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Data Streaming with Affinity Propagation
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
Information Processing Letters
New results for finding common neighborhoods in massive graphs in the data stream model
Theoretical Computer Science
Sliding-window top-k queries on uncertain streams
Proceedings of the VLDB Endowment
Information Processing Letters
A comparative study of simple online learning strategies for streaming data
WSEAS Transactions on Circuits and Systems
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Stream sampling for variance-optimal estimation of subset sums
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The average-case complexity of counting distinct elements
Proceedings of the 12th International Conference on Database Theory
Lower bounds for processing data with few random accesses to external memory
Journal of the ACM (JACM)
Online learning strategies for classification of static data streams
DIWEB'08 Proceedings of the 8th WSEAS international conference on Distance learning and web engineering
Numerical linear algebra in the streaming model
Proceedings of the forty-first annual ACM symposium on Theory of computing
Quantifying inefficiency in cost-sharing mechanisms
Journal of the ACM (JACM)
New bounds on classical and quantum one-way communication complexity
Theoretical Computer Science
Optimal sampling from sliding windows
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Space-optimal heavy hitters with strong error bounds
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Distributed and Incremental Clustering Based on Weighted Affinity Propagation
Proceedings of the 2008 conference on STAIRS 2008: Proceedings of the Fourth Starting AI Researchers' Symposium
On the Value of Multiple Read/Write Streams for Data Compression
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Dynamically Maintaining Duplicate-Insensitive and Time-Decayed Sum Using Time-Decaying Bloom Filter
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
The Frequent Items Problem, under Polynomial Decay, in the Streaming Model
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Streaming for large scale NLP: language modeling
NAACL '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Scalable proximity estimation and link prediction in online social networks
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Evaluating top-k queries over incomplete data streams
Proceedings of the 18th ACM conference on Information and knowledge management
Streamed learning: one-pass SVMs
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Weighted random sampling with a reservoir
Information Processing Letters
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
A deterministic algorithm for summarizing asynchronous streams over a sliding window
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Finding a duplicate and a missing item in a stream
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Proceedings of the 19th international conference on World wide web
A wavelet-based sampling algorithm for wireless sensor networks applications
Proceedings of the 2010 ACM Symposium on Applied Computing
Data stream anomaly detection through principal subspace tracking
Proceedings of the 2010 ACM Symposium on Applied Computing
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
A framework to enforce access control over data streams
ACM Transactions on Information and System Security (TISSEC)
Proceedings of the forty-second ACM symposium on Theory of computing
Information complexity: a tutorial
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Transfer estimation of evolving class priors in data stream classification
Pattern Recognition
Machine models for query processing
ACM SIGMOD Record
On distributing symmetric streaming computations
ACM Transactions on Algorithms (TALG)
Sliding-window top-k queries on uncertain streams
The VLDB Journal — The International Journal on Very Large Data Bases
The frequent items problem, under polynomial decay, in the streaming model
Theoretical Computer Science
Fast computation of a longest increasing subsequence and application
Information and Computation
Space-optimal heavy hitters with strong error bounds
ACM Transactions on Database Systems (TODS)
Sketching techniques for large scale NLP
WAC-6 '10 Proceedings of the NAACL HLT 2010 Sixth Web as Corpus Workshop
We're not in Kansas anymore: detecting domain changes in streams
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
The gist of everything new: personalized top-k processing over web 2.0 streams
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Cardinality estimation and dynamic length adaptation for Bloom filters
Distributed and Parallel Databases
On the exact space complexity of sketching and streaming small norms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Compression, indexing, and retrieval for massive string data
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Database theory: query languages
Algorithms and theory of computation handbook
Continuous summarization of co-evolving data in large water distribution network
WAIM'10 Proceedings of the 11th international conference on Web-age information management
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Intractability of min- and max-cut in streaming graphs
Information Processing Letters
Incremental algorithms for effective and efficient query recommendation
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Self-adaptive change detection in streaming data with non-stationary distribution
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
A black box for online approximate pattern matching
Information and Computation
Time-decaying Sketches for Robust Aggregation of Sensor Data
SIAM Journal on Computing
Effective Computations on Sliding Windows
SIAM Journal on Computing
Property testing
Property testing
Computing strongly connected components in the streaming model
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Theory of data stream computing: where to go
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Finding heavy distinct hitters in data streams
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Mining hot calling contexts in small space
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance
Proceedings of the forty-third annual ACM symposium on Theory of computing
Near-optimal private approximation protocols via a black box transformation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Fast moment estimation in data streams in optimal space
Proceedings of the forty-third annual ACM symposium on Theory of computing
Subspace embeddings for the L1-norm with applications
Proceedings of the forty-third annual ACM symposium on Theory of computing
Compressive sensing with local geometric features
Proceedings of the twenty-seventh annual symposium on Computational geometry
Memoryless facility location in one pass
ACM Transactions on Algorithms (TALG)
Matching in bipartite graph streams in a small number of passes
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
What's the difference?: efficient set reconciliation without prior context
Proceedings of the ACM SIGCOMM 2011 conference
Smoothing techniques for adaptive online language models: topic tracking in tweet streams
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
On the power of lower bound methods for one-way quantum communication complexity
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Linear programming in the semi-streaming model with application to the maximum matching problem
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Continuous inverse ranking queries in uncertain streams
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Approximately uniform online checkpointing
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Sparse recovery with partial support knowledge
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Periodicity and cyclic shifts via linear sketches
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Streaming algorithms with one-sided estimation
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Streaming algorithms for recognizing nearly well-parenthesized expressions
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Approximate counting of cycles in streams
ESA'11 Proceedings of the 19th European conference on Algorithms
Verifying computations with streaming interactive proofs
Proceedings of the VLDB Endowment
UpStream: storage-centric load management for streaming applications with update semantics
The VLDB Journal — The International Journal on Very Large Data Bases
Optimal random sampling from distributed streams revisited
DISC'11 Proceedings of the 25th international conference on Distributed computing
Optimal sampling from sliding windows
Journal of Computer and System Sciences
The Value of Multiple Read/Write Streams for Approximating Frequency Moments
ACM Transactions on Computation Theory (TOCT)
gSketch: on query estimation in graph streams
Proceedings of the VLDB Endowment
SIAM Journal on Computing
Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums
SIAM Journal on Computing
Stream computing based synchrophasor application for power grids
Proceedings of the first international workshop on High performance computing, networking and analytics for the power grid
Efficient monitoring of personalized hot news over Web 2.0 streams
Computer Science - Research and Development
Monitoring continuous band-join queries over dynamic data
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with sub-constant error
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The streaming complexity of cycle counting, sorting by reversals, and other problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Streams, security and scalability
DBSec'05 Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security
Densest subgraph in streaming and MapReduce
Proceedings of the VLDB Endowment
Approximate scalable bounded space sketch for large data NLP
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Grammar-based compression in a streaming model
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
On estimating path aggregates over streaming graphs
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Drawing trees in a streaming model
GD'09 Proceedings of the 17th international conference on Graph Drawing
Drawing trees in a streaming model
Information Processing Letters
Randomized Algorithms for Matrices and Data
Foundations and Trends® in Machine Learning
Rectangle-efficient aggregation in spatial data streams
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Continuous distributed counting for non-monotonic streams
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Computing a longest increasing subsequence of length k in time O(n log log k)
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
A sliding window-based false-negative approach for ubiquitous data stream analysis
International Journal of Communication Systems
Space-Efficient approximation scheme for circular earth mover distance
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Sketching and streaming algorithms for processing massive data
XRDS: Crossroads, The ACM Magazine for Students - Big Data
Statistical estimation with bounded memory
Statistics and Computing
SIAM Journal on Computing
Sketching in Adversarial Environments
SIAM Journal on Computing
Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches
Foundations and Trends in Databases
Space-efficient sampling from social activity streams
Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications
Space-constrained interval selection
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Counting arbitrary subgraphs in data streams
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Data-intensive architecture for scientific knowledge discovery
Distributed and Parallel Databases
Approximate answers to OLAP queries on streaming data warehouses
Proceedings of the fifteenth international workshop on Data warehousing and OLAP
Streaming analysis of discourse participants
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Streaming algorithms measured in terms of the computed quantity
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Proceedings of the 21st ACM international conference on Information and knowledge management
Sketch-based indexing of n-words
Proceedings of the 21st ACM international conference on Information and knowledge management
CR-PRECIS: a deterministic summary structure for update data streams
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Streaming algorithms for data in motion
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Streaming hierarchical video segmentation
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VI
Efficient protocols for distributed classification and optimization
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Linear programming in the semi-streaming model with application to the maximum matching problem
Information and Computation
An energy complexity model for algorithms
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Streaming computations with a loquacious prover
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Graph drawing in the cloud: privately visualizing relational data using small working storage
GD'12 Proceedings of the 20th international conference on Graph Drawing
Compressive sensing using locality-preserving matrices
Proceedings of the twenty-ninth annual symposium on Computational geometry
Fast greedy algorithms in mapreduce and streaming
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Exact sparse recovery with L0 projections
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
How robust are linear sketches to adaptive inputs?
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Fast approximation of matrix coherence and statistical leverage
The Journal of Machine Learning Research
Indexing for summary queries: Theory and practice
ACM Transactions on Database Systems (TODS)
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Efficient sampling of non-strict turnstile data streams
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Identifying streaming frequent items in ad hoc time windows
Data & Knowledge Engineering
On the value of multiple read/write streams for data compression
Information Theory, Combinatorics, and Search Theory
Indexing Word Sequences for Ranked Retrieval
ACM Transactions on Information Systems (TOIS)
Reprint of: Memory-constrained algorithms for simple polygons
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has emerged for reasoning about algorithms that work within these constraints on space, time, and number of passes. Some of the methods rely on metric embeddings, pseudo-random computations, sparse approximation theory and communication complexity. The applications for this scenario include IP network traffic analysis, mining text message streams and processing massive data sets in general. Researchers in Theoretical Computer Science, Databases, IP Networking and Computer Systems are working on the data stream challenges. This article is an overview and survey of data stream algorithmics and is an updated version of [1].