Relative information capacity of simple relational database schemata
SIAM Journal on Computing
A comparative analysis of methodologies for database schema integration
ACM Computing Surveys (CSUR)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Artificial Intelligence
Schema equivalence in heterogeneous systems: bridging theory and practice
Information Systems - Special issue on extending database technology
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Materialized view maintenance and integrity constraint checking: trading space for time
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Conjunctive query equivalence of keyed relational schemas (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Managing semantic heterogeneity in databases: a theoretical prospective
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering recursive queries using views
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
DynaMat: a dynamic view management system for data warehouses
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
A relational model of data for large shared data banks
Communications of the ACM
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
On equivalences of database schemes
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Selection of Views to Materialize in a Data Warehouse
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Selection of Views to Materialize Under a Maintenance Cost Constraint
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Answering Queries Using Materialized Views with Disjunctions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
The Use of Information Capacity in Schema Integration and Translation
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Logic and Databases: A 20 Year Retrospective
LID '96 Proceedings of the International Workshop on Logic in Databases
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A theory of justified reformulations
A theory of justified reformulations
A semantic theory of abstractions
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Theory of answering queries using views
ACM SIGMOD Record
A Formal Perspective on the View Selection Problem
Proceedings of the 27th International Conference on Very Large Data Bases
Materializing views with minimal size to answer queries
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
| Hi-index | 0.00 |
Database reformulation is the process of rewriting the data and rules of a deductive database in a functionally equivalent manner. We focus on the problem of automatically reformulating a database in a way that reduces query processing time while satisfying strong storage space constraints. In previous work we have investigated database reformulation for the case of unary databases. In this paper we extend this work to arbitrary arity, while concentrating on databases with conjunctive rules. The main result of the paper is that the database reformulation problem is decidable for conjunctive databases.