SORT ORDER PROBLEMS IN RELATIONAL DATABASES

DOI10.1142/S0129054198000313zbMath1319.68073MaRDI QIDQ5248985

Kim S. Larsen

Publication date: 29 April 2015

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

zbMATH Keywords

relational algebradatabasesquery optimizationsort orders

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: SORT ORDER PROBLEMS IN RELATIONAL DATABASES