Extremal theorems for databases

DOI10.1023/A:1026162114022zbMath1085.68037MaRDI QIDQ1424929

Krisztián Tichler

Publication date: 15 March 2004

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

zbMATH Keywords

keysextremal problemscliquesmaximal independent setsrelational database modelantikeyslabelled directed tree

Mathematics Subject Classification ID

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

Related Items (1)

Ideal non-deterministic operators as a formal framework to reduce the key finding problem

This page was built for publication: Extremal theorems for databases