ACM SIGMOD Record
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Selection predicate indexing for active databases using interval skip lists
Information Systems
Matching events in a content-based subscription system
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Efficient Bulk Deletes in Relational Databases
Proceedings of the 17th International Conference on Data Engineering
An Evaluation of Generic Bulk Loading Techniques
Proceedings of the 27th International Conference on Very Large Data Bases
GBI: A Generalized R-Tree Bulk-Insertion Strategy
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Path sharing and predicate evaluation for high-performance XML filtering
ACM Transactions on Database Systems (TODS)
Streaming queries over streaming data
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Buffering accesses to memory-resident index structures
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
AGILE: adaptive indexing for context-aware information filters
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Efficient xml data dissemination with piggybacking
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Quality of service in stateful information filters
DMSN '06 Proceedings of the 3rd workshop on Data management for sensor networks: in conjunction with VLDB 2006
Input-sensitive scalable continuous join query processing
ACM Transactions on Database Systems (TODS)
Integration of reliable sensor data stream management into digital libraries
DELOS'07 Proceedings of the 1st international conference on Digital libraries: research and development
GPX-matcher: a generic boolean predicate-based XPath expression matcher
Proceedings of the 14th International Conference on Extending Database Technology
Information Systems
SharedDB: killing one thousand queries with one stone
Proceedings of the VLDB Endowment
Analysis and optimization for boolean expression indexing
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
This paper describes batching, a novel technique in order to improve the throughput of an information filter (e.g. message broker or publish & subscribe system). Rather than processing each message individually, incoming messages are reordered, grouped and a whole group of similar messages is processed. This paper presents alternative strategies to do batching. Extensive performance experiments are conducted on those strategies in order to compare their tradeoffs.