Relative Information Capacity of Simple Relational Database Schemata
From MaRDI portal
Recommendations
Cited in
(25)- Losslessness and semantic correctness of database schema transformation: Another look of schema equivalence
- Restructuring hierarchical database objects
- Datalog extensions for database queries and updates
- On the expressive power of database queries with intermediate types
- 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
- Domain independence and the relational calculus
- Static and dynamic aspects of goal-oriented concurrency control
- Finitely representable databases
- Queries with arithmetical constraints
- A comprehensive database schema integration method based on the theory of formal concepts
- scientific article; zbMATH DE number 4041339 (Why is no real title available?)
- scientific article; zbMATH DE number 4060790 (Why is no real title available?)
- scientific article; zbMATH DE number 4070290 (Why is no real title available?)
- scientific article; zbMATH DE number 1304047 (Why is no real title available?)
- scientific article; zbMATH DE number 572212 (Why is no real title available?)
- Data model descriptions and translation signatures in a multi-model framework
- A practical measure of the information in a logical theory
- scientific article; zbMATH DE number 4114109 (Why is no real title available?)
- scientific article; zbMATH DE number 2090735 (Why is no real title available?)
- Reasoning on Data Models in Schema Translation
- Equivalence of views by query capacity
- Foundations of Information and Knowledge Systems
- Semantics of types for database objects
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)
