Relative Information Capacity of Simple Relational Database Schemata

DOI10.1137/0215061zbMath0612.68085OpenAlexW2025151754MaRDI QIDQ3753524

Richard Hull

Publication date: 1986

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0215061

zbMATH Keywords

database structuresdominance between pairs of relational database schemata

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items

Domain independence and the relational calculus, Static and dynamic aspects of goal-oriented concurrency control, Restructuring hierarchical database objects, Finitely representable databases, Queries with arithmetical constraints, Data model descriptions and translation signatures in a multi-model framework, Semantics of types for database objects, Datalog extensions for database queries and updates, On the expressive power of database queries with intermediate types, A comprehensive database schema integration method based on the theory of formal concepts, Equivalence of views by query capacity, A practical measure of the information in a logical theory, Reasoning on Data Models in Schema Translation, Arity bounds in first-order incremental evaluation and definition of polynomial time database queries, Equivalence of keyed relational schemas by conjunctive queries, Conservativity of nested relational calculi with internal generic functions