Correcting execution of distributed queries

Author

Bodorik, P. ; Pyra, J. ; Riordon, J.S.

Author_Institution

Sch. of Comput. Sci., Tech. Nova Scotia Univ., Halifax, NS, Canada

fYear

1990

fDate

2-4 Jul 1990

Firstpage

192

Lastpage

201

Abstract

A low overhead delay method for deciding when to correct a strategy is presented. Sampling is used to estimate the size relations and alternative heuristic strategies prepared in a background mode are used to decide when to correct. Correction is made only if lower overall delay is achieved, including correction time. Evaluation using a model of a distributed database indicates that the heuristic strategies are near optimal. Moreover, it suggests that it is usually correct to abort creation of an intermediate relation which is much larger than predicted

Keywords

distributed databases; heuristic programming; information retrieval; alternative heuristic strategies; background mode; correction time; distributed database; distributed queries; heuristic strategies; intermediate relation; low overhead delay method; lower overall delay; size relations; Computer science; Cost function; Councils; Delay effects; Distributed computing; Heuristic algorithms; Query processing; Sampling methods; Systems engineering and theory; Turning;

fLanguage

English

Publisher

ieee

Conference_Titel

Databases in Parallel and Distributed Systems, 1990, Proceedings. Second International Symposium on

Conference_Location

Dublin

Print_ISBN

0-8186-2052-8

Type

conf

DOI

10.1109/DPDS.1990.113710

Filename

113710