TY - GEN

T1 - OPTIMAL PROCESSING OF SIMPLE QUERIES IN CHAIN NETWORKS.

AU - Scheuermann, Peter I

AU - Gursel, Goker

PY - 1984/12/1

Y1 - 1984/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0021566436&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0021566436&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0021566436

SN - 0818605588

T3 - Proceedings - Trends & Applications (IEEE Computer Society)

SP - 183

EP - 189

BT - Proceedings - Trends & Applications (IEEE Computer Society)

PB - IEEE

ER -