Skip to main content
Article thumbnail
Location of Repository

A Greedy Approach For Improving Update Processing in Intermittently Synchronized Databases

By Wai Gen Yee, Ed Omiecinski, Sham Navathe, Mostafa Ammar, Jeff Donahoo and Sanjoy Malik

Abstract

Replication of data on portable computers is a new DBMS technology aimed at catering to a growing population of mobile database users. Clients can download data items such as email, or sales data from a server onto these machines, peruse it during commutes, and return any modifications to the server at the end of the day. In this paper, we describe how the servers in these systems generally process update information for clients and reveal a scalability problem--server processing increases quadratically with respect to increasing numbers of clients. We develop a cost model, and propose a solution based on heuristics. By aggregating client interests into datagroups, based on notions such as interest overlap, we can reduce server cost. These techniques are attractive because they are simple and computationally cheap. Simulations show that even simple techniques may yield significant performance improvements. 1 Introduction The benefits of replication in distributed databases a..

Year: 1999
OAI identifier: oai:CiteSeerX.psu:10.1.1.29.9283
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cc.gatech.edu/fac/M... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.