Index structures for selective dissemination of information under the Boolean model
ACM Transactions on Database Systems (TODS)
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Continuously adaptive continuous queries over streams
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Trigger Grouping: A Scalable Approach to Large Scale Information Monitoring
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
Supporting QoS-Aware Transactions in a System on Mobile Devices (SyD)
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Adaptive filters for continuous queries over distributed data streams
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Fundamentals of Database Systems, Fourth Edition
Fundamentals of Database Systems, Fourth Edition
Predictive filtering: a learning-based approach to data stream filtering
DMSN '04 Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
Hi-index | 0.00 |
Filtering is a popular approach to reduce information traffic in subscription-based systems, especially if most subscribers are located on mobile devices. The filters are placed between the subscribers and the subscription server. With increasing number of filters from subscribers, filtering may become a bottleneck and challenge the scalability of such systems. In this paper, we propose to use filter indexing to solve this problem. We propose and study four filter-indexing schemes: Ad-Hoc Indexing Scheme (AIS), Group Indexing Scheme (GIS), Group-Sort Indexing Scheme (GSIS) and B' Tree Indexing Scheme (BTIS). We evaluate the performance of these four indexing schemes with respect to scalability and other factors. Among the proposed schemes, we find that GSIS is the most efficient indexing scheme for searching and BTIS has the best performance for updating and inserting filters.