A distributed B-tree for distributed databases
The design of algorithms for distributed databases should involve the design of a distributed data structure. However, it is assumed that arising from the distribution of any entity are problems on data consistency and efficiency. Efforts on the solution to these problems in the context of distribut...
Saved in:
Main Author: | Tangente, Aleida P. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
1995
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/1784 https://animorepository.dlsu.edu.ph/cgi/viewcontent.cgi?article=8622&context=etd_masteral |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
Extended Sinha-Natarajan's algorithm for distributed deadlock detection and resolution in a distributed database system
by: Ahmed, Tanweer
Published: (1993) -
Distributed job reliability analysis using fuzzy sets
by: Tarar, Roshan Zamir
Published: (1992) -
A replica control algorithm based on multilevel atomicity for replicated databases
by: Chan, Philip
Published: (1994) -
A reliable and consistent fully distributed database
by: Claudio, Patricia Maria R.
Published: (1989) -
A fault tolerant home-based lazy released consistent distributed shared memory through process replication
by: Ng, Giuseppe C.
Published: (2004)