Relative Information Capacity of Simple Relational Database Schemata
From MaRDI portal
Publication:3753524
DOI10.1137/0215061zbMATH Open0612.68085OpenAlexW2025151754MaRDI QIDQ3753524FDOQ3753524
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
Recommendations
Cited In (24)
- Conservativity of nested relational calculi with internal generic functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A practical measure of the information in a logical theory
- Data model descriptions and translation signatures in a multi-model framework
- Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
- Finitely representable databases
- Queries with arithmetical constraints
- Title not available (Why is that?)
- Equivalence of views by query capacity
- Datalog extensions for database queries and updates
- On the expressive power of database queries with intermediate types
- Domain independence and the relational calculus
- Restructuring hierarchical database objects
- Reasoning on Data Models in Schema Translation
- A comprehensive database schema integration method based on the theory of formal concepts
- Equivalence of keyed relational schemas by conjunctive queries
- Title not available (Why is that?)
- Foundations of Information and Knowledge Systems
- Semantics of types for database objects
- Static and dynamic aspects of goal-oriented concurrency control
- Title not available (Why is that?)
- Losslessness and semantic correctness of database schema transformation: Another look of schema equivalence
This page was built for publication: Relative Information Capacity of Simple Relational Database Schemata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753524)
