- Author:
- Yannis Vassiliou
Traditionally, database management systems have been presented and evaluated with the assumption of perfect information. In this thesis, the problem of dealing with imperfection in a database is discussed and a formal framework for a general treatment of imperfection is proposed. Incompleteness and inconsistencies in the stored values are two manifestations of imperfection we consider.In order to have a clear, well-defined framework and to illustrate our concepts with specific examples, we concentrate on one database model--the relational model. The organization of databases, the semantics of operations on them (queries and modifications) and certain semantic rules (functional dependencies) are examined in detail when imperfect information is present. Finally, it is shown that our work has an important application to traditional relational database theory, where a basic and controversial assumption is weakened with the use and careful treatment of imperfection.
Cited By
- De Giacomo G and Levesque H Two approaches to efficient open-world reasoning Logic-based artificial intelligence, (59-78)
Wang K and Graham M (1992). Constant-time maintainability, ACM Transactions on Database Systems (TODS), 17:2, (201-246), Online publication date: 1-Jun-1992.- Wang K (1990). Polynomial time designs toward both BCNF and efficient data manipulation, ACM SIGMOD Record, 19:2, (74-83), Online publication date: 1-May-1990.
- Wang K Polynomial time designs toward both BCNF and efficient data manipulation Proceedings of the 1990 ACM SIGMOD international conference on Management of data, (74-83)
- Morrissey J and Van Rijsbergen C A formal treatment of missing & imprecise information Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval, (149-156)
- Mendelzon A (1984). Database states and their tableaux, ACM Transactions on Database Systems (TODS), 9:2, (264-282), Online publication date: 3-Jun-1984.
- Yannakakis M Querying weak instances Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems, (275-280)
- Verroust A Characterization of Well-Behaved Database Schemata and Their Update Semantics Proceedings of the 9th International Conference on Very Large Data Bases, (312-321)
- Sagiv Y (1983). A characterization of globally consistent databases and their correct access paths, ACM Transactions on Database Systems, 8:2, (266-286), Online publication date: 1-Jun-1983.
- Laver K, Mendelzon A and Graham M Functional dependencies on cyclic database schemes Proceedings of the 1983 ACM SIGMOD international conference on Management of data, (79-91)
- Laver K, Mendelzon A and Graham M (1983). Functional dependencies on cyclic database schemes, ACM SIGMOD Record, 13:4, (79-91), Online publication date: 1-May-1983.
- Imielinski T and Lipski W Inverting relational expressions Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems, (305-311)
- Graham M (1983). Functions in databases, ACM Transactions on Database Systems (TODS), 8:1, (81-109), Online publication date: 1-Mar-1983.
- Graham M and Yannakakis M Independent database schemas Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems, (199-204)
- Graham M and Mendelzon A Notions of dependency satisfaction Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems, (177-188)
Recommendations
Relational Database Management Systems: The Business Explosion
This special issue (part 2 of a series began with the special issue in October-December 2012) tells the history of how IBM and several new, independent software companies built companies that supplanted the database management system companies and their ...