Han, Jia Liang <br/><br/>
Optimizing Relational Queries in Connection Hypergraphs: Nested Queries, Views, and Binding Propagations 

<br/><br/>We optimize relational queries using connection hypergraphs (CHGs). All operations including value-passing between SQL blocks can be set-oriented. By introducing partial evaluations, reordering operations can be achieved for nested queries. For a query using views, we merge CHGs for the views and the query into one CHG and then apply query optimization. Furthermore, we may simulate magic sets methods elegantly in a CHG. Sideways information-passing strategies (SIPS) in a CHG amount to partial evaluations of SIPS paths. 
<br/><br/><label>Subjects--Topical Terms: </label><br/>RELATIONAL QUERY OPTIMIZATION<br/>CONNECTION HYPERGRAPHS<br/>PARTIAL EVALUATIONS<br/>SIPS<br/>SEARCH SPACE
<br/><br/><label>Universal Decimal Class. No.: </label>H004.65 VER