On the reusability of query optimization algorithms

DOI10.1016/0020-0255(89)90027-3zbMATH Open0713.68019OpenAlexW2093152872MaRDI QIDQ750138FDOQ750138

Authors: 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

Recommendations

• scientific article; zbMATH DE number 11737
• scientific article; zbMATH DE number 4201597
• scientific article; zbMATH DE number 42848
• Algebraic Optimization Of Recursive Database Queries
• scientific article; zbMATH DE number 3930378

zbMATH Keywords

query optimizationreusabilityextensible database systems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A new implementation technique for applicative languages
• Title not available (Why is that?)
• On optimizing an SQL-like nested query
• SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control
• Title not available (Why is that?)
• 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)
• Optimal Query Processing for Distributed Database Systems
• A unifying model of physical databases
• Optimizing the performance of a relational algebra database interface
• Optimization of distributed tree queries

Cited In (1)

• Query optimization using rewrite rules

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750138)