Synopsis data structures for massive data sets

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

On computing correlated aggregates over continual data streams

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data

Mining data streams under block evolution

ACM SIGKDD Explorations Newsletter

Similarity estimation techniques from rounding algorithms

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

Mining database structure; or, how to build a data quality browser

Proceedings of the 2002 ACM SIGMOD international conference on Management of data

Automatic tuning of data synopses

Information Systems - Special issue: Best papers from EDBT 2002

Rangesum histograms

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

A Framework for the Physical Design Problem for Data Synopses

EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology

Finding Frequent Items in Data Streams

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming

An Approximate Lp-Difference Algorithm for Massive Data Streams

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science

Efficient URL caching for world wide web crawling

WWW '03 Proceedings of the 12th international conference on World Wide Web

Clustering Data Streams: Theory and Practice

IEEE Transactions on Knowledge and Data Engineering

Comparing Data Streams Using Hamming Norms (How to Zero In)

IEEE Transactions on Knowledge and Data Engineering

Efficient Approximation of Correlated Sums on Data Streams

IEEE Transactions on Knowledge and Data Engineering

An Approximate L1-Difference Algorithm for Massive Data Streams

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Finding frequent items in data streams

Theoretical Computer Science - Special issue on automata, languages and programming

Space efficiency in synopsis construction algorithms

VLDB '05 Proceedings of the 31st international conference on Very large data bases

Approximation and streaming algorithms for histogram construction problems

ACM Transactions on Database Systems (TODS)

DSM-PLW: single-pass mining of path traversal patterns over streaming web click-sequences

Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics

Efficient pebbling for list traversal synopses with application to program rollback

Theoretical Computer Science

Improving sketch reconstruction accuracy using linear least squares method

IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement

Exploiting duality in summarization with deterministic guarantees

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining

Combining Description Logics with synopses for inferring complex knowledge patterns from XML sources

Information Systems

Sketching in adversarial environments

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing

Hierarchical synopses with optimal error guarantees

ACM Transactions on Database Systems (TODS)

On the space---time of optimal, approximate and streaming algorithms for synopsis construction problems

The VLDB Journal — The International Journal on Very Large Data Bases

On Finding Frequent Elements in a Data Stream

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques

Mining frequent itemsets over data streams using efficient window sliding techniques

Expert Systems with Applications: An International Journal

ODMCA: An adaptive data mining control algorithm in multicarrier networks

Computer Communications

The average-case complexity of counting distinct elements

Proceedings of the 12th International Conference on Database Theory

Spatio-Temporal Sensor Graphs (STSG): A data model for the discovery of spatio-temporal patterns

Intelligent Data Analysis - Knowledge Discovery from Data Streams

Preface: an overview on learning from data streams

New Generation Computing

Answering linear optimization queries with an approximate stream index

Knowledge and Information Systems

Optimality and scalability in lattice histogram construction

Proceedings of the VLDB Endowment

Learning When Concepts Abound

The Journal of Machine Learning Research

TOPSIL-Miner: an efficient algorithm for mining top-K significant itemsets over data streams

Knowledge and Information Systems

Data streams and data synopses for massive data sets

PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases

A single-pass online data mining algorithm combined with control theory with limited memory in dynamic data streams

GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing

The design and architecture of the τ-synopses system

EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology

On approximation algorithms for data mining applications

Efficient Approximation and Online Algorithms

Sketching in Adversarial Environments

SIAM Journal on Computing

Streaming algorithms for data in motion

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Testing Closeness of Discrete Distributions

Journal of the ACM (JACM)