On the reusability of query optimization algorithms

DOI10.1016/0020-0255(89)90027-3zbMath0713.68019OpenAlexW2093152872MaRDI QIDQ750138

D. S. Batory

Publication date: 1989

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(89)90027-3

zbMATH Keywords

query optimizationreusabilityextensible database systems

Mathematics Subject Classification ID

Database theory (68P15) Theory of data (68P99) Theory of software (68N99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization of distributed tree queries
• A state transition model for distributed query processing
• Using Semi-Joins to Solve Relational Queries
• Query processing in a system for distributed databases (SDD-1)
• On optimizing an SQL-like nested query
• Optimal Query Processing for Distributed Database Systems
• A unifying model of physical databases
• Optimizing the performance of a relational algebra database interface
• SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control
• A new implementation technique for applicative languages

This page was built for publication: On the reusability of query optimization algorithms