Query Processing in Distributed Data Bases,

Abstract

This paper describes two new distributed query processing algorithms. The MST Algorithm minimizes the total communication costs associated with a query while the MDT Algorithm minimizes the response time. These two algorithms are easy to analyze and to implement, since they are based on the minimum spanning tree and the shortest path problems, for which numerous algorithms exist. In addition, these two algorithms can be implemented using distributed computation, i.e., each node using only information available from adjacent nodes. We also develop the 'artificial file node' technique to extend existing query processing algorithms which are designed for non-redundant databases to that for general, redundant databases. The two algorithms are illustrated by simple examples. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1981
Accession Number
ADA103826

Entities

People

  • Victor O. K. Li

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Communication Channels
  • Communication Networks
  • Computational Complexity
  • Computations
  • Computer Programming
  • Computers
  • Data Processing
  • Database Management Systems
  • Databases
  • Electrical Engineering
  • Engineering
  • Networks
  • Parallel Computing
  • Parallel Processing
  • Processing Equipment
  • Software Development

Fields of Study

  • Computer science
  • Engineering

Readers

  • Computer Networking
  • Database Systems and Applications
  • Operations Research