OPTIMAL PROCESSING OF SIMPLE QUERIES IN CHAIN NETWORKS.

Peter I Scheuermann*, Goker Gursel

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We derive a new dynamic programming algorithm for solving simple queries in networks of a special topology, namely chain networks. Under the objective of total time minimization, we obtain that an optimal solution strategy to our problem can be expressed as a serial sequence of semi-join operations. Our algorithm derives an optimal solution when we provide as input estimates of the referenced relation sizes under different reduction states. However, our evaluation procedure does not make any assumption about the attribute value distribution within each relation.

Original languageEnglish (US)
Title of host publicationProceedings - Trends & Applications (IEEE Computer Society)
PublisherIEEE
Pages183-189
Number of pages7
ISBN (Print)0818605588
StatePublished - Dec 1 1984

Publication series

NameProceedings - Trends & Applications (IEEE Computer Society)

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'OPTIMAL PROCESSING OF SIMPLE QUERIES IN CHAIN NETWORKS.'. Together they form a unique fingerprint.

Cite this