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
Some computer science issues in ubiquitous computing
Communications of the ACM - Special issue on computer augmented environments: back to the real world
Selection predicate indexing for active databases using interval skip lists
Information Systems
Multi-sensor fusion: fundamentals and applications with software
Multi-sensor fusion: fundamentals and applications with software
The SIFT information dissemination system
ACM Transactions on Database Systems (TODS)
Indexing the positions of continuously moving objects
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
Understanding and Using Context
Personal and Ubiquitous Computing
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Frequent Update and Efficient Retrieval: an Oxymoron on Moving Object Indexes?
WISEW '02 Proceedings of the Third International Conference on Web Information Systems Engineering (Workshops) - (WISEw'02)
Indoor Navigation Using a Diverse Set of Cheap, Wearable Sensors
ISWC '99 Proceedings of the 3rd IEEE International Symposium on Wearable Computers
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
Path sharing and predicate evaluation for high-performance XML filtering
ACM Transactions on Database Systems (TODS)
Batched Processing for Information Filters
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Supporting frequent updates in R-trees: a bottom-up approach
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
HiFi: a unified architecture for high fan-in systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Scalable continuous query processing by tracking hotspots
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
iDM: a unified and versatile data model for personal dataspace management
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
MAPS: approximate publish/subscribe functionality in peer-to-peer networks
Proceedings of the 1st international workshop on Advanced data processing in ubiquitous computing (ADPUC 2006)
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
Fast contextual preference scoring of database tuples
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Towards efficient main-memory use for optimum tree index update
Proceedings of the VLDB Endowment
Efficient probabilistic subsumption checking for content-based publish/subscribe systems
Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware
Input-sensitive scalable continuous join query processing
ACM Transactions on Database Systems (TODS)
Indexing Moving Objects Using Short-Lived Throwaway Indexes
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Workload-aware indexing of continuously moving objects
Proceedings of the VLDB Endowment
Integration of reliable sensor data stream management into digital libraries
DELOS'07 Proceedings of the 1st international conference on Digital libraries: research and development
Saving space and time using index merging
Data & Knowledge Engineering
A fuzzy-rule-based approach to contextual preference queries
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
MOVIES: indexing moving objects by shooting index images
Geoinformatica
Efficient probabilistic subsumption checking for content-based publish/subscribe systems
Middleware'06 Proceedings of the 7th ACM/IFIP/USENIX international conference on Middleware
Adaptive range filters for cold data: avoiding trips to Siberia
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Information filtering has become a key technology for modern information systems. The goal of an information filter is to route messages to the right recipients (possibly none) according to declarative rules called profiles. In order to deal with high volumes of messages, several index structures have been proposed in the past. The challenge addressed in this paper is to carry out stateful information filtering in which profiles refer to values in a database or to previous messages. The difficulty is that database update streams need to be processed in addition to messages. This paper presents AGILE, a way to extend existing index structures so that the indexes adapt to the message/update workload and show good performance in all situations. Performance experiments show that AGILE is overall the clear winner as compared to the best existing approaches. In extreme situations in which it is not the winner, the overheads are small.