Extremal theorems for databases

DOI10.1007/3-540-45758-5_13MaRDI QIDQ4472218zbMATH OpenFDO

Authors Krisztián Tichler

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2284/22840197.htm

zbMATH Keywords

antikeyscliquesextremal problemskeyslabelled directed treemaximal independent setsrelational database model

Mathematics Subject Classification ID

Database theory (68P15) Combinatorics in computer science (68R05)

Recommendations

• Extremal theorems for databases
• Extremal problems in relational data bases
• scientific article; zbMATH DE number 4057058
• An extremal problem on trees and database theory
• Extrema predicates in deductive databases
• scientific article; zbMATH DE number 125213
• scientific article; zbMATH DE number 1059245
• Special issue on database theory
• An Algebraic Theory of Relational Databases
• Recent combinatorial results in the theory of relational databases

Cited in

(9)

• Finitely representable databases
• Extremal theorems for databases
• scientific article; zbMATH DE number 3843181 (Why is no real title available?)
• An extremal problem on trees and database theory
• Extremal problems in relational data bases
• scientific article; zbMATH DE number 4057064 (Why is no real title available?)
• scientific article; zbMATH DE number 1302667 (Why is no real title available?)
• scientific article; zbMATH DE number 736292 (Why is no real title available?)
• Extremal combinatorics of SQL keys

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 Q4472218)