On optimizing an SQL-like nested query

DOI10.1145/319732.319745zbMath0488.68064OpenAlexW2008116177MaRDI QIDQ3949995

No author found.

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

algorithmsrelational databasequery processingaggregate functionhigh-level nonprocedural data languagenested query

Mathematics Subject Classification ID

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

Related Items (10)

Implicit representation of relations ⋮ A knowledge-based system for performance optimization of a relational database system ⋮ Flexible queries in relational databases -- The example of the division operator ⋮ Algebraic optimization of object-oriented query languages ⋮ Performance analysis of ``groupby-after-join query processing in parallel database systems ⋮ SQL translation using an attribute grammar ⋮ On the reusability of query optimization algorithms ⋮ Strategies for distributed query optimization ⋮ A formalization of SQL with nulls ⋮ Join during merge: an improved sort based algorithm

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