Distributed Database Systems in High-Speed Wide-Area Networks

The issues involved in developing a distributed database system (DDBS) in a high-speed environment are discussed. The inadequacy of existing database protocols in utilizing the gigabit network is described. A concurrency control protocol that performs better than traditional DDBSs in high-speed networks is developed. Both analytical and simulation results are presented. The focus is on the concurrency control aspect of DDBS since this protocol is at the heart of the overall functioning of the distributed system. >

[1]  Hector Garcia-Molina,et al.  System M: A Transaction Processing Testbed for Memory Resident Data , 1990, IEEE Trans. Knowl. Data Eng..

[2]  Clement T. Yu,et al.  Partition Strategy for Distributed Query Processing in Fast Local Networks , 1989, IEEE Trans. Software Eng..

[3]  Ravi Krishnamurthy,et al.  Design of a Memory Resident DBMS , 1985, IEEE Computer Society International Conference.

[4]  Irving L. Traiger,et al.  Granularity of Locks and Degrees of Consistency in a Shared Data Base , 1998, IFIP Working Conference on Modelling in Data Base Management Systems.

[5]  Haran Boral,et al.  Proceedings of the Sixth International Workshop on Database Machines , 1989 .

[6]  Margaret H. Dunham,et al.  MARS: The Design of a Main Memory Database Machine , 1987, IWDM.

[7]  Margaret H. Eich,et al.  Main memory database research directions , 1989 .

[8]  Patrick Valduriez,et al.  Principles of Distributed Database Systems , 1990 .

[9]  Dieter Gawlick,et al.  One Thousand Transactions per Second , 1985, COMPCON.

[10]  Victor O. K. Li,et al.  Performance Analysis of Static Locking in Distributed Database Systems , 1990, IEEE Trans. Computers.

[11]  Shiow-Chen Shyu,et al.  Design and performance analysis of locking algorithms for distributed databases , 1989 .

[12]  Jim Gray,et al.  The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for CPU time , 1987, SIGMOD '87.

[13]  Michael J. Carey,et al.  A recovery algorithm for a high-performance memory-resident database system , 1987, SIGMOD '87.

[14]  Clement T. Yu,et al.  Algorithms to Process Distributed Queries in Fast Local Networks , 1987, IEEE Transactions on Computers.

[15]  Richard J. Lipton,et al.  A Massive Memory Machine , 1984, IEEE Transactions on Computers.

[16]  R. MacGregor,et al.  Mermaid—A front-end to distributed heterogeneous databases , 1987, Proceedings of the IEEE.

[17]  W. Mansfield,et al.  A scale database architecture for network services , 1991, IEEE Communications Magazine.

[18]  Clement T. Yu,et al.  Distributed query processing a multiple database system , 1989, IEEE J. Sel. Areas Commun..

[19]  Gita Gopal,et al.  The datacycle architecture for very high throughput database systems , 1987, SIGMOD '87.

[20]  J. D. Uiiman,et al.  Principles of Database Systems , 2004, PODS 2004.

[21]  Michael Stonebraker,et al.  Implementation techniques for main memory database systems , 1984, SIGMOD '84.

[22]  Robert B. Hagmann A Crash Recovery Scheme for a Memory-Resident Database System , 1986, IEEE Transactions on Computers.

[23]  Philip S. Yu,et al.  On Coupling Partitioned Database Systems , 1986, ICDCS.

[24]  Philip A. Bernstein,et al.  Concurrency Control in Distributed Database Systems , 1986, CSUR.

[25]  Clement T. Yu,et al.  Partitioning Relation for Parallel Processing in Fast Local Networks , 1986, ICPP.

[26]  L. Schrage,et al.  Queueing systems, Vol. I: Theory , 1977, Proceedings of the IEEE.

[27]  W. S. Luk,et al.  On the communication cost of distributed database processing , 1988, [1988] Proceedings. The 8th International Conference on Distributed.