Extremal theorems for databases

DOI10.1023/A:1026162114022MaRDI QIDQ1424929zbMATH OpenFDO

Authors Krisztián Tichler

Publication date 15 March 2004

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

keysextremal problemsmaximal independent setscliquesrelational database modelantikeyslabelled directed tree

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 2080031
• Extremal problems in relational data bases
• Extremal combinatorics of SQL keys
• scientific article; zbMATH DE number 3843181
• scientific article; zbMATH DE number 4083038

Cited in

(14)

• scientific article; zbMATH DE number 3843181 (Why is no real title available?)
• scientific article; zbMATH DE number 1302667 (Why is no real title available?)
• scientific article; zbMATH DE number 2080031 (Why is no real title available?)
• Ideal non-deterministic operators as a formal framework to reduce the key finding problem
• Finitely representable databases
• Extremal problems in relational data bases
• Minimum matrix representation of some key system
• scientific article; zbMATH DE number 4094877 (Why is no real title available?)
• Extremal combinatorics of SQL keys
• scientific article; zbMATH DE number 736292 (Why is no real title available?)
• Foundations of Information and Knowledge Systems
• An extremal problem on trees and database theory
• scientific article; zbMATH DE number 4083038 (Why is no real title available?)
• scientific article; zbMATH DE number 4057064 (Why is no real title available?)

This page was built for publication: Extremal theorems for databases

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