Optimization of Single Expressions in a Relational Data Base System

@inproceedings{Hall2002OptimizationOS,
  title={Optimization of Single Expressions in a Relational Data Base System},
  author={A. V. Hall},
  year={2002}
}
This paper examines optimization within a relational data base system. It considers the optimization of a single query defined by an expression of the relational algebra. The expression is transformed into an equivalent expression or sequence of expressions that cost less to evaluate. Alternative transformations, and combinations of several transformations, are analyzed. Measurements on an experimental data base showed improvements, especially in cases where the original expression would be… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 10 CITATIONS

New algorithms for lexical query optimization

  • Proceedings of the ITI 2009 31st International Conference on Information Technology Interfaces
  • 2009
VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Efficient processing of enumerative set-based queries

VIEW 2 EXCERPTS
CITES BACKGROUND & METHODS

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

A summary was presented at the ACM conference

England
  • 1975

An Overview of Nonprocedural Languages.

B. M. Leavenworth, J. E. Sammet
  • S I C P L A N Notices (ACM)
  • 1974

Sethi , “ Testing for the Church - Rosser Property String Path Search Procedures for Data Base Systems

B. M. Leavenworth, J. E. Sammet
  • Factorisations of Algebraic Expressions , ” Report UKSC 0055 , IBM UKSC
  • 1974

Adaptability to change in large data base information retrieval systems

B. K. Aldred, T. W. Rogers
  • 1972

Data base reorganization concepts,

L. Aspinall, C. J . Bell, T. W. Rogers
  • Report U K S C
  • 1972