Sort order problems in relational databases

DOI10.1142/S0129054198000313zbMATH Open1319.68073MaRDI QIDQ5248985FDOQ5248985

Authors: Kim S. Larsen 

Publication date: 29 April 2015

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

Recommendations

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

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)

Cites Work

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

Cited In (3)

• Exploiting early sorting and early partitioning for decision support query processing
• Relational Databases with Ordered Relations
• Title not available (Why is that?)

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)