Rule Languages and Internal Algebras for Rule-Based Optimizers

Rule Languages and Internal Algebras for Rule-Based Optimizers (1996)

Cached

Download Links

[ftp.cs.brown.edu]
[www.cs.brown.edu]

Other Repositories/Bibliography

DBLP

by Mitch Cherniack , Stanley B. Zdonik

Venue:	In Proc. ACM SIGMOD Int'l Conference on Management of Data
Citations:	31 - 6 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Rule languages and internal algebras for rule-based optimizers	INFERENCE
AUTHOR NAME	Mitch Cherniack	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science, Brown University	SVM HeaderParse 0.2
AUTHOR NAME	Stanley B. Zdonik	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science, Brown University	SVM HeaderParse 0.2
ABSTRACT	Rule-based optimizers and optimizer generators use rules to specify query transformations. Rules act directly on query representations, which typically are based on query algebras. But most algebras complicate rule formulation, and rules over these algebras must often resort to calling to externally defined bodies of code. Code makes rules difficult to formulate, prove correct and reason about, and therefore compromises the effectiveness of rule-based systems. In this paper we present KOLA; a combinator-based algebra designed to simplify rule formulation. KOLA is not a user language, and KOLA's variable-free queries are difficult for humans to read. But KOLA is an effective internal algebra because its combinatorstyle makes queries manipulable and structurally revealing. As a result, rules over KOLA queries are easily expressed without the need for supplemental code. We illustrate this point, first by showing some transformations that despite their simplicity, require head and body rou...	user correction - Legacy Corrections
YEAR	1996	INFERENCE
VENUE	In Proc. ACM SIGMOD Int'l Conference on Management of Data	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	401--412	INFERENCE
VOLUME	25	INFERENCE
CITATIONS	38 found	ParsCit 1.0