Distributed databases principles and systems
Distributed databases principles and systems
Interconnection networks for large-scale parallel processing: theory and case studies
Interconnection networks for large-scale parallel processing: theory and case studies
Fault-Tolerant Routing in DeBruijn Comrnunication Networks
IEEE Transactions on Computers
The Architecture of SM3: A Dynamically Partitionable Multicomputer System
IEEE Transactions on Computers
Computer networks
Query optimization in star computer networks
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
Principles of Database Systems
Principles of Database Systems
Tree Structured Multiple Processor Join Methods
Proceedings of the Third International Conference on Data Engineering
Implementing Relational Database Operations in a Cube-Connected Multicomputer System
Proceedings of the Third International Conference on Data Engineering
GAMMA - A High Performance Dataflow Database Machine
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Graphs and Hypergraphs
Join processing in relational databases
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Fault tolerant distributed databases use replicated data(e.g., record or relation) to handle failures of one or more nodes in a computer network. Efficient and economic access strategies for such data bases have not been investigated. In this paper, the binary hypercube, a popular model for fault tolerant interconnection networks, has been studied. It has been shown that, for a local area network based on a binary hypercube, having 2r nodes where every data is replicated r times, in the absence of faults, any query involving an arbitrary sequence of joins R1 @@@@ R2 @@@@ … @@@@ Rn, n ≤ r, may be performed by repeatedly executing joins in a distributed fashion using n node disjoint paths from n/2 distinct sites of database operations to n arbitrary sites containing a target relation each. This protocol also solves the problem of materialization of relations. In the presence of up to r-2 faults, the protocol still guarantees N node disjoint paths to arbitrary sites. The value of N is determined by the number of faulty nodes.