A state transition model for distributed query processing

A state transition model for distributed query processing (1986)

by Stiphane Lafortune , Eugene Wong

Venue:	ACM Transactions on Database Systems
Citations:	6 - 0 self

Datum	Value	Source
TITLE	A state transition model for distributed query processing	INFERENCE
AUTHOR NAME	Stiphane Lafortune	SVM HeaderParse 0.2
AUTHOR AFFIL	University of California. Berkeley	SVM HeaderParse 0.2
AUTHOR NAME	Eugene Wong	SVM HeaderParse 0.2
AUTHOR AFFIL	University of California. Berkeley	SVM HeaderParse 0.2
ABSTRACT	A state transition model for the optimization of query processing in a distributed database system is presented. The problem is parametrized 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.	SVM HeaderParse 0.2
YEAR	1986	INFERENCE
VENUE	ACM Transactions on Database Systems	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	294--322	INFERENCE
VOLUME	11	INFERENCE
CITATIONS	27 found	ParsCit 1.0