Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Updates of Relational Views

Updates of Relational Views Updates of Relational Views STAVROS S. COSMADAKIS Massachusetts Institute of Technology, CambrMge, Massachusetts AND CHRISTOS H. P A P A D I M I T R I O U Massachusetts Institute of Technology, Cambridge Massachusetts and National Techntcal University of Athens, Athens, Greece Abstract. The problem of translating updates of database views is studied. View updates are disambiguated by requiring that a specified viewcomplement (i.e., a second view that contains all the information omitted from the given view) remain constant during the translation. Some of the computational problems related to the apphcafion of this general methodology in the context of relational databases are studied. Projective views of databases that consist of a single relation and satisfy funcuonal dependencies are emphasized. After characterizing complementary views, the authors show that finding a minimum complement of a given view is NP-complete. The problem of translating the insertion of a tuple into a view is then studied in detail, and the results are extended to the cases of deletion and replacement of a tuple. Finally, the explicit functional dependencies, a new kind of dependency that intuitively states that some part of the database information can be computed from the rest, are defined http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of the ACM (JACM) Association for Computing Machinery

Loading next page...
 
/lp/association-for-computing-machinery/updates-of-relational-views-XwggYmmooq

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1984 by ACM Inc.
ISSN
0004-5411
DOI
10.1145/1634.1887
Publisher site
See Article on Publisher Site

Abstract

Updates of Relational Views STAVROS S. COSMADAKIS Massachusetts Institute of Technology, CambrMge, Massachusetts AND CHRISTOS H. P A P A D I M I T R I O U Massachusetts Institute of Technology, Cambridge Massachusetts and National Techntcal University of Athens, Athens, Greece Abstract. The problem of translating updates of database views is studied. View updates are disambiguated by requiring that a specified viewcomplement (i.e., a second view that contains all the information omitted from the given view) remain constant during the translation. Some of the computational problems related to the apphcafion of this general methodology in the context of relational databases are studied. Projective views of databases that consist of a single relation and satisfy funcuonal dependencies are emphasized. After characterizing complementary views, the authors show that finding a minimum complement of a given view is NP-complete. The problem of translating the insertion of a tuple into a view is then studied in detail, and the results are extended to the cases of deletion and replacement of a tuple. Finally, the explicit functional dependencies, a new kind of dependency that intuitively states that some part of the database information can be computed from the rest, are defined

Journal

Journal of the ACM (JACM)Association for Computing Machinery

Published: Sep 20, 1984

There are no references for this article.