An indexing scheme for update notification in large mobile information systems

Authors:
Hagen Höpfner;Stephan Schosser;Kai-Uwe Sattler
Affiliations:
Department of Computer Science, Otto-von-Guericke University of Magdeburg, Magdeburg, Germany;Department of Computer Science, Otto-von-Guericke University of Magdeburg, Magdeburg, Germany;Department of Computer Science and Automation, Technical University of Ilmenau, Ilmenau, Germany
Venue:
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Year:
2004

Citing 7
Cited 1

Processing Implication on Queries

IEEE Transactions on Software Engineering
Personalized information delivery: an analysis of information filtering methods

Communications of the ACM - Special issue on information filtering
Solving satisfiability and implication problems in database systems

ACM Transactions on Database Systems (TODS)
The dangers of replication and a solution

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Data Management for Mobile Computing

Data Management for Mobile Computing
Multiversion Reconciliation for Mobile Databases

ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Self-Adaptive User Profiles for Large-Scale Data Delivery

ICDE '00 Proceedings of the 16th International Conference on Data Engineering

An approach to detecting relevant updates to cached data using XML and active databases

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Due to the increasing usage of small and low footprinted devices like mobile phones as clients of mobile information systems a new problem arises: “How to determine the relevance of updates for a large number of mobile clients?” In this paper we present an indexing scheme that represents conjunctive queries posed by the mobile clients in a trie So, IDs of the clients are referenced by their queries and checking the relevance of an update can be efficiently done by a trie lookup.