Scaling replica maintenance in intermittently synchronized mobile databases

Authors:
Wai Gen Yee;Michael J. Donahoo;Edward Omiecinski;Shamkant B. Navathe
Affiliations:
Georgia Institute of Technology, Atlanta, GA;Baylor University, Waco, TX;Georgia Institute of Technology, Atlanta, GA;Georgia Institute of Technology, Atlanta, GA
Venue:
Proceedings of the tenth international conference on Information and knowledge management
Year:
2001

Citing 9
Cited 2

Vertical partitioning algorithms for database design

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
Implementing data cubes efficiently

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Replication and consistency: being lazy helps sometimes

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of distributed database systems (2nd ed.)

Principles of distributed database systems (2nd ed.)
Data partitioning for disconnected client server databases

Proceedings of the 1st ACM international workshop on Data engineering for wireless and mobile access
Replicating and allocating data in a distributed database system for workstations

Proceedings of the 1985 ACM SIGSMALL symposium on Small systems
A framework for designing update objects to improve server scalability in intermittently synchronized databases

Proceedings of the ninth international conference on Information and knowledge management
Grouping Techniques for Update Propagation in Intermittently Connected Databases

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering

Efficient synchronization for mobile XML data

Proceedings of the eleventh international conference on Information and knowledge management
Design Considerations for Mobile Client-Server Database Applications

IMWS '01 Revised Papers from the NSF Workshop on Developing an Infrastructure for Mobile and Wireless Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

To avoid the high cost of continuous connectivity, a class of mobile applications employs replicas of shared data that are periodically updated. Updates to these replicas are typically performed on a client-by-client basis--that is, the server individually computes and transmits updates to each client--limiting scalability. By basing updates on replica groups (instead of clients), however, update generation complexity is no longer bound by client population size. Clients then download updates of pertinent groups. Proper group design reduces redundancies in server processing, disk usage and bandwidth usage, and dimininishes the tie between the complexity of updating replicas and the size of the client population. In this paper, we expand on previous work done on group design, include a detailed I/O cost model for update generation, and propose a heuristic-based greedy algorithm for group computation. Experimental results with an adapted commercial replication system demonstrate a significant increase in overall scalability over the client-centric approach.