Local verification of global integrity constraints in distributed databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
New sampling-based summary statistics for improving approximate query answers
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Data-valued partitioning and virtual messages (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Wireless integrated network sensors
Communications of the ACM
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Rank aggregation methods for the Web
Proceedings of the 10th international conference on World Wide Web
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Estimating simple functions on the union of data streams
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Continuously adaptive continuous queries over streams
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Distributed streams algorithms for sliding windows
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
EDBT '92 Proceedings of the 3rd International Conference on Extending Database Technology: Advances in Database Technology
Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries
Proceedings of the 27th 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
Low-Power Wireless Sensor Networks
VLSID '01 Proceedings of the The 14th International Conference on VLSI Design (VLSID '01)
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Adaptive filters for continuous queries over distributed data streams
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Evaluating Top-k Queries over Web-Accessible Databases
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Monitoring streams: a new class of data management applications
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
Incremental maintenance for non-distributive aggregate functions
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
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
Efficient top-K query calculation in distributed networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Adaptive, unsupervised stream mining
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
Distributed Data Streams Indexing using Content-Based Routing Paradigm
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Duplicate detection in click streams
WWW '05 Proceedings of the 14th international conference on World Wide Web
What's hot and what's not: tracking most frequent items dynamically
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Holistic aggregates in a networked world: distributed tracking of approximate quantiles
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
The threshold join algorithm for top-k queries in distributed sensor networks
DMSN '05 Proceedings of the 2nd international workshop on Data management for sensor networks
Sketching streams through the net: distributed approximate query tracking
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Adaptive stream filters for entity-based queries with non-value tolerance
VLDB '05 Proceedings of the 31st international conference on Very large data bases
KLEE: a framework for distributed top-k query algorithms
VLDB '05 Proceedings of the 31st international conference on Very large data bases
A Threshold-Based Algorithm for Continuous Monitoring of k Nearest Neighbors
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the 8th ACM international workshop on Data warehousing and OLAP
Asking the right questions: model-driven optimization using probes
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Finding global icebergs over distributed data sets
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient gossip-based aggregate computation
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Communication-efficient distributed monitoring of thresholded counts
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
A geometric approach to monitoring threshold functions over distributed data streams
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Continuous monitoring of top-k queries over sliding windows
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
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
Distributed Data Mining in Peer-to-Peer Networks
IEEE Internet Computing
Toward sophisticated detection with distributed triggers
Proceedings of the 2006 SIGCOMM workshop on Mining network data
An integrated efficient solution for computing frequent and top-k elements in data streams
ACM Transactions on Database Systems (TODS)
Distributed spatio-temporal similarity search
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
Finding hierarchical heavy hitters in network measurement system
Proceedings of the 2007 ACM symposium on Applied computing
Streaming in a connected world: querying and tracking distributed data streams
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Progressive ranking of range aggregates
Data & Knowledge Engineering
Top-k Monitoring in Wireless Sensor Networks
IEEE Transactions on Knowledge and Data Engineering
Cloud control with distributed rate limiting
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
A geometric approach to monitoring threshold functions over distributed data streams
ACM Transactions on Database Systems (TODS)
Efficient Process of Top-k Range-Sum Queries over Multiple Streams with Minimized Global Error
IEEE Transactions on Knowledge and Data Engineering
Distributed set-expression cardinality estimation
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Network-aware query processing for stream-based applications
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Best position algorithms for top-k queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
STAR: self-tuning aggregation for scalable monitoring
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Probabilistic lossy counting: an efficient algorithm for finding heavy hitters
ACM SIGCOMM Computer Communication Review
Algorithms for distributed functional monitoring
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On-line discovery of hot motion paths
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
ZELESSA: an enabler for real-time sensing, analysing and acting on continuous event streams
International Journal of Business Intelligence and Data Mining
Approximate continuous querying over distributed streams
ACM Transactions on Database Systems (TODS)
Processing top k queries from samples
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Shape sensitive geometric monitoring
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Better tree - better fruits: using dominating set trees for MAX queries
Proceedings of the 5th workshop on Data management for sensor networks
POT: an efficient top-k monitoring method for spatially correlated sensor readings
Proceedings of the 5th workshop on Data management for sensor networks
The d-hop k-data coverage query problem in wireless sensor networks
Proceedings of the 5th workshop on Data management for sensor networks
Processing top-k queries from samples
Computer Networks: The International Journal of Computer and Telecommunications Networking
FIDS: Monitoring Frequent Items over Distributed Data Streams
MLDM '07 Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition
Efficiently Monitoring Nearest Neighbors to a Moving Object
ADMA '07 Proceedings of the 3rd international conference on Advanced Data Mining and Applications
Data Streaming with Affinity Propagation
ECML PKDD '08 Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II
A strategy to develop adaptive and interactive query brokers
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Sliding-window top-k queries on uncertain streams
Proceedings of the VLDB Endowment
Proceedings of the VLDB Endowment
Mining top-k Hot Melody Structures over online music query streams
Pattern Recognition Letters
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
Making filters smart in distributed data stream environments
Information Sciences: an International Journal
Flooding-Assisted Threshold Assignment for Aggregate Monitoring in Sensor Networks
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Finding the K highest-ranked answers in a distributed network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal tracking of distributed heavy hitters and quantiles
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Ranking distributed probabilistic data
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Minimizing the communication cost for continuous skyline maintenance
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Distributed top-k aggregation queries at large
Distributed and Parallel Databases
Continuously monitoring top-k uncertain data streams: a probabilistic threshold method
Distributed and Parallel Databases
Functional Monitoring without Monotonicity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
History Guided Low-Cost Change Detection in Streams
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Evaluating top-k queries over incomplete data streams
Proceedings of the 18th ACM conference on Information and knowledge management
Thread cooperation in multicore architectures for frequency counting over multiple data streams
Proceedings of the VLDB Endowment
Continuous Processing of Preference Queries in Data Streams
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Distributed threshold selection for aggregate threshold monitoring in sensor networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Continuous monitoring of global events in sensor networks
International Journal of Sensor Networks
Aggregate computation over data streams
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Supporting top-k aggregate queries over unequal synopsis on internet traffic streams
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Optimal sampling from distributed streams
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Load-balanced query dissemination in privacy-aware online communities
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Sliding-window top-k queries on uncertain streams
The VLDB Journal — The International Journal on Very Large Data Bases
Fully decentralized computation of aggregates over data streams
Proceedings of the First International Workshop on Novel Data Stream Pattern Mining Techniques
How to probe for an extreme value
ACM Transactions on Algorithms (TALG)
Energy-efficient top-k query processing in wireless sensor networks
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
TOPSIL-Miner: an efficient algorithm for mining top-K significant itemsets over data streams
Knowledge and Information Systems
Continuous skyline monitoring over distributed data streams
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
Top-k query evaluation in sensor networks under query response time constraint
Information Sciences: an International Journal
An access cost-aware approach for object retrieval over multiple sources
Proceedings of the VLDB Endowment
Algorithms for distributed functional monitoring
ACM Transactions on Algorithms (TALG)
Power efficiency through tuple ranking in wireless sensor network monitoring
Distributed and Parallel Databases
Distributed adaptive top-k monitoring in wireless sensor networks
Journal of Systems and Software
Uncovering Global Icebergs in Distributed Streams: Results and Implications
Journal of Network and Systems Management
An optimal strategy for monitoring top-k queries in streaming windows
Proceedings of the 14th International Conference on Extending Database Technology
Fully decentralized computation of aggregates over data streams
ACM SIGKDD Explorations Newsletter
Mining frequent itemsets over distributed data streams by continuously maintaining a global synopsis
Data Mining and Knowledge Discovery
Continuous distributed monitoring: a short survey
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing
Getting critical categories of a data set
WAIM'11 Proceedings of the 12th international conference on Web-age information management
Privacy-preserving distributed network troubleshooting—bridging the gap between theory and practice
ACM Transactions on Information and System Security (TISSEC)
MTopS: scalable processing of continuous top-k multi-query workloads
Proceedings of the 20th ACM international conference on Information and knowledge management
Optimal random sampling from distributed streams revisited
DISC'11 Proceedings of the 25th international conference on Distributed computing
Processing frequent items over distributed data streams
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Model-Aided data collecting for wireless sensor networks
HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Lower bounds for number-in-hand multiparty communication complexity, made easy
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Efficient non-blocking top-k query processing in distributed networks
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Distributed pattern discovery in multiple streams
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Approximate top-k queries in sensor networks
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Efficient processing of distributed top-k queries
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Progressive ranking of range aggregates
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Supporting efficient distributed top-k monitoring
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
Continuous sampling from distributed streams
Journal of the ACM (JACM)
Randomized algorithms for tracking distributed count, frequencies, and ranks
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Prediction-based geometric monitoring over distributed data streams
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Tight bounds for distributed functional monitoring
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Survey: Streaming techniques and data aggregation in networks of tiny artefacts
Computer Science Review
Distributed top-k full-text content dissemination
Distributed and Parallel Databases
Processing top-k queries in distributed hash tables
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Energy-efficient skyline query optimization in wireless sensor networks
Wireless Networks
Continuous adaptive outlier detection on distributed data streams
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
The continuous distributed monitoring model
ACM SIGMOD Record
Sketch-based geometric monitoring of distributed stream queries
Proceedings of the VLDB Endowment
Ratio threshold queries over distributed data sources
Proceedings of the VLDB Endowment
FaRNet: Fast recognition of high-dimensional patterns from big network traffic data
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
The querying and analysis of data streams has been a topic of much recent interest, motivated by applications from the fields of networking, web usage analysis, sensor instrumentation, telecommunications, and others. Many of these applications involve monitoring answers to continuous queries over data streams produced at physically distributed locations, and most previous approaches require streams to be transmitted to a single location for centralized processing. Unfortunately, the continual transmission of a large number of rapid data streams to a central location can be impractical or expensive. We study a useful class of queries that continuously report the k largest values obtained from distributed data streams ("top-k monitoring queries"), which are of particular interest because they can be used to reduce the overhead incurred while running other types of monitoring queries. We show that transmitting entire data streams is unnecessary to support these queries and present an alternative approach that reduces communication significantly. In our approach, arithmetic constraints are maintained at remote stream sources to ensure that the most recently provided top-k answer remains valid to within a user-specified error tolerance. Distributed communication is only necessary on occasion, when constraints are violated, and we show empirically through extensive simulation on real-world data that our approach reduces overall communication cost by an order of magnitude compared with alternatives that o er the same error guarantees.