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...

Full description

Saved in:
Bibliographic Details
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
Be the first to leave a comment!
You must be logged in first