Sort order problems in relational databases

DOI10.1142/S0129054198000313MaRDI QIDQ5248985zbMATH OpenFDO

Authors Kim S. Larsen

Publication date 29 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

databasesrelational algebraquery optimizationsort orders

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Database theory (68P15)

Recommendations

• Order dependency in the relational model
• scientific article; zbMATH DE number 3843178
• The complexity of evaluating relational queries
• scientific article; zbMATH DE number 4201597
• scientific article; zbMATH DE number 975710

Cites work

• A lattice-theoretical fixpoint theorem and its applications
• A relational model of data for large shared data banks
• Optimizing the performance of a relational algebra database interface
• Organization and maintenance of large ordered indexes

Cited in

(3)

• scientific article; zbMATH DE number 1091107 (Why is no real title available?)
• Relational Databases with Ordered Relations
• Exploiting early sorting and early partitioning for decision support query processing

This page was built for publication: Sort order problems in relational databases

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