A State Transition Model for Distributed Query Processing

24Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

A state transition model for the optimization of query processing in a distributed database system is presented. The problem is parameterized by means of a state describing the amount of processing that has been performed at each site where the database is located. A state transition occurs each time a new join or semijoin is executed. Dynamic programming is used to compute recursively the costs of the states and the globally optimal solution, taking into account communication and local processing costs. The state transition model is general enough to account for the possibility of parallel processing among the various sites, as well as for redundancy in the database. The model also permits significant reductions of the necessary computations by taking advantage of simple additivity and site-uniformity properties of a cost model, and of clever strategies that improve on the basic dynamic programming algorithm. © 1986, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Lafortune, S., & Wong, E. (1986). A State Transition Model for Distributed Query Processing. ACM Transactions on Database Systems (TODS), 11(3), 294–322. https://doi.org/10.1145/6314.6460

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free