One algorithm for optimizing relational database schemas

MaRDI QIDQ1901125zbMATH OpenFDO

Authors N. N. Buslik

Publication date 5 November 1995

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

relational databasessearch algorithmLing-Tompa-Kameda algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 4201597
• scientific article; zbMATH DE number 11737
• An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
• Algebraic Optimization Of Recursive Database Queries
• Performance Tuning an Algorithm for Compressing Relational Tables
• An efficient algorithm for processing multi-relation queries in relational databases
• scientific article; zbMATH DE number 4043325
• Database Theory - ICDT 2005
• scientific article; zbMATH DE number 3874668
• An algorithm for handling many relational calculus queries efficiently.

Cited in

(1)

• An improved algorithm based on subset closures for synthesizing a relational database scheme

This page was built for publication: One algorithm for optimizing relational database schemas

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