On optimizing an SQL-like nested query

DOI10.1145/319732.319745MaRDI QIDQ3949995zbMATH OpenOpenAlexFDO

Authors

Publication date 1982

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/319732.319745

zbMATH Keywords

algorithmsquery processingrelational databaseaggregate functionhigh-level nonprocedural data languagenested query

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05)

Cited in

(13)

• Algebraic optimization of object-oriented query languages
• A formalization of SQL with nulls
• Extensible query optimizers in practice
• Implicit representation of relations
• On the reusability of query optimization algorithms
• Strategies for distributed query optimization
• Performance analysis of ``groupby-after-join query processing in parallel database systems
• A knowledge-based system for performance optimization of a relational database system
• Join during merge: an improved sort based algorithm
• A rule-based procedure for graph query solving
• Sharing queries with nonequivalent user-defined aggregate functions
• SQL translation using an attribute grammar
• Flexible queries in relational databases -- The example of the division operator

This page was built for publication: On optimizing an SQL-like nested query

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