A robust protocol for distributed query processing on a local area network

S. Bandyopadhyay, A. Sengupta, Arunabha Sen

Research output: Contribution to journalArticle

Abstract

Fault tolerant distributed databases use replicated data (e.g. record or relation) to handle failures of one or more nodes in a computer network. In this paper, the binary hypercube, a popular model for fault tolerant interconnection networks, has been studied as a model for interconnection in a local area network. It has been shown that in a local area network with 2′ nodes, based on a binary hypercube, where every relation is replicated r times, in the absence of faults, any arbitrary sequence of database operations R1 ⊙ R2 ⊙ ... ⊙ Rn (where ⊙ is any binary database operation) may be performed by repeatedly executing r database operations in a distributed fashion using r edge disjoint paths from r selected sites of database operations to r arbitrary sites containing a target relation each. This protocol also solves the problem of materialisation of relations. In the presence of up to r-2 faults, the protocol still guarantees N edge disjoint paths to arbitrary sites. The value of N is determined by the number of faulty nodes. The protocol is also applicable in a generalized architecture called "supercube" where there is no restriction on the number of nodes in the network.

Original languageEnglish (US)
Pages (from-to)523-535
Number of pages13
JournalInformation Systems
Volume15
Issue number5
DOIs
StatePublished - 1990

Fingerprint

Query processing
Local area networks
Network protocols
Computer networks
Data base
Node
Fault
Interconnection

Keywords

  • access strategy
  • binary hypercubes
  • distributed databases
  • fault tolerant systems
  • node disjoint path
  • parallel join

ASJC Scopus subject areas

  • Management Information Systems
  • Management of Technology and Innovation
  • Hardware and Architecture
  • Information Systems
  • Software

Cite this

A robust protocol for distributed query processing on a local area network. / Bandyopadhyay, S.; Sengupta, A.; Sen, Arunabha.

In: Information Systems, Vol. 15, No. 5, 1990, p. 523-535.

Research output: Contribution to journalArticle

Bandyopadhyay, S. ; Sengupta, A. ; Sen, Arunabha. / A robust protocol for distributed query processing on a local area network. In: Information Systems. 1990 ; Vol. 15, No. 5. pp. 523-535.
@article{19cea30f4c844d0a8aa4aa4605e35d07,
title = "A robust protocol for distributed query processing on a local area network",
abstract = "Fault tolerant distributed databases use replicated data (e.g. record or relation) to handle failures of one or more nodes in a computer network. In this paper, the binary hypercube, a popular model for fault tolerant interconnection networks, has been studied as a model for interconnection in a local area network. It has been shown that in a local area network with 2′ nodes, based on a binary hypercube, where every relation is replicated r times, in the absence of faults, any arbitrary sequence of database operations R1 ⊙ R2 ⊙ ... ⊙ Rn (where ⊙ is any binary database operation) may be performed by repeatedly executing r database operations in a distributed fashion using r edge disjoint paths from r selected sites of database operations to r arbitrary sites containing a target relation each. This protocol also solves the problem of materialisation of relations. In the presence of up to r-2 faults, the protocol still guarantees N edge disjoint paths to arbitrary sites. The value of N is determined by the number of faulty nodes. The protocol is also applicable in a generalized architecture called {"}supercube{"} where there is no restriction on the number of nodes in the network.",
keywords = "access strategy, binary hypercubes, distributed databases, fault tolerant systems, node disjoint path, parallel join",
author = "S. Bandyopadhyay and A. Sengupta and Arunabha Sen",
year = "1990",
doi = "10.1016/0306-4379(90)90025-K",
language = "English (US)",
volume = "15",
pages = "523--535",
journal = "Information Systems",
issn = "0306-4379",
publisher = "Elsevier Limited",
number = "5",

}

TY - JOUR

T1 - A robust protocol for distributed query processing on a local area network

AU - Bandyopadhyay, S.

AU - Sengupta, A.

AU - Sen, Arunabha

PY - 1990

Y1 - 1990

N2 - Fault tolerant distributed databases use replicated data (e.g. record or relation) to handle failures of one or more nodes in a computer network. In this paper, the binary hypercube, a popular model for fault tolerant interconnection networks, has been studied as a model for interconnection in a local area network. It has been shown that in a local area network with 2′ nodes, based on a binary hypercube, where every relation is replicated r times, in the absence of faults, any arbitrary sequence of database operations R1 ⊙ R2 ⊙ ... ⊙ Rn (where ⊙ is any binary database operation) may be performed by repeatedly executing r database operations in a distributed fashion using r edge disjoint paths from r selected sites of database operations to r arbitrary sites containing a target relation each. This protocol also solves the problem of materialisation of relations. In the presence of up to r-2 faults, the protocol still guarantees N edge disjoint paths to arbitrary sites. The value of N is determined by the number of faulty nodes. The protocol is also applicable in a generalized architecture called "supercube" where there is no restriction on the number of nodes in the network.

AB - Fault tolerant distributed databases use replicated data (e.g. record or relation) to handle failures of one or more nodes in a computer network. In this paper, the binary hypercube, a popular model for fault tolerant interconnection networks, has been studied as a model for interconnection in a local area network. It has been shown that in a local area network with 2′ nodes, based on a binary hypercube, where every relation is replicated r times, in the absence of faults, any arbitrary sequence of database operations R1 ⊙ R2 ⊙ ... ⊙ Rn (where ⊙ is any binary database operation) may be performed by repeatedly executing r database operations in a distributed fashion using r edge disjoint paths from r selected sites of database operations to r arbitrary sites containing a target relation each. This protocol also solves the problem of materialisation of relations. In the presence of up to r-2 faults, the protocol still guarantees N edge disjoint paths to arbitrary sites. The value of N is determined by the number of faulty nodes. The protocol is also applicable in a generalized architecture called "supercube" where there is no restriction on the number of nodes in the network.

KW - access strategy

KW - binary hypercubes

KW - distributed databases

KW - fault tolerant systems

KW - node disjoint path

KW - parallel join

UR - http://www.scopus.com/inward/record.url?scp=0025662826&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025662826&partnerID=8YFLogxK

U2 - 10.1016/0306-4379(90)90025-K

DO - 10.1016/0306-4379(90)90025-K

M3 - Article

AN - SCOPUS:0025662826

VL - 15

SP - 523

EP - 535

JO - Information Systems

JF - Information Systems

SN - 0306-4379

IS - 5

ER -