Maintenance of views

ACM SIGMOD Record

Volumn 14, Issue 2, 1984, Pages 240-255

  Shmueli, Oded ^a   Itai, Alon ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

RELATIONAL DATABASES; TREE SCHEMAS; VIEW DEFINITION; VIEW MATERIALIZATION;

DATABASE SYSTEMS;

EID: 0021587238     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/971697.602293     Document Type: Article

References (21)

1. Aho, A.V., J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Comp u te r Algorithms, Addison-Wesley Publishing Company, 1976.
2. Bernstein, P.A., and D.W. Chiu, “Using Semi-Joins to Solve Relational Queries”, J. ACM 28 (1): 25-40, January 1981.
3. Beeri, C. R. Fagin, D. Maier, A. Mendelzon, J.D. Ullman, and M. Yannakakis, “Properties of Acyclic Database Schemas”, in Thirteenth Annual ACM Symp. on Theory of Computing, 355-362. Association for Computing Machinery, New York, N.Y., May 1981.
4. Beeri, C., R. Fagin, D. Maier and M. Yannakakis, “On the Desirability of Acyclic Database Schemes”, J. ACM, to appear.
5. Bernstein, P.A., and N. Goodman, “The Power of Natural Semijoins”, SIAM J. of Comput., 10 (4), November 1981.
6. Fagin, R., “Types of Acyclicity for Hypergraphs and Relational Database Systems”, Research Report RJ3330, IBM Research Laboratory, San Jose, CA, November 1981.
7. Fagin, R., A.O. Mendelzon, and J.D. Ullman, “A Simplified Universal Relation Assumption and Its Properties”, Technical Report RJ2900, IBM, San Jose, CA, 1980.
8. Graham, M.H., On the Universal Relation, Technical Report, University of Toronto, September 1979.
9. Goodman, N., and O. Shmueli, “Tree Queries: A Simple Class of Queries”, ACM Transactions on Database Systems, December 1982.
10. Goodman, N., and O. Shmueli, “The Structure of Database Schemas”. To appear in J. ACM.
11. Goodman, N., and O. Shmueli, ‘The Tree Property is Fundamental for Query Processing”, in Proc. ACM SIGACT- SIGMOD Conference on Principles of Database Systems, 40-48, Los Angeles, CA, March 1982.
12. Goodman, N., and O. Shmueli, “Transforming Cyclic Schemas into Trees”, in Proc. ACM SIGACT-SIGM0D Conference on Principles of Database Systems, 49-54, Los Angeles, CA, March 1982.
13. Goodman, N., and O. Shmueli, “NP-Complete Problems Simplified on Tree Schemas”, To appear in Acta Informatica.
14. Goodman, N., O. Shmueli and Y.C. Tay, “GY0 Reductions, Canonical Connections, Tree and Cyclic Schemas and Tree Projections”, in Proc. ACM SIGACT-SIGM0D Conference on Principles on Database Systems, 267-278, Atlanta, Ga., March 1983.
15. Hull, R., “Acyclic Join Dependencies and Database Projections”, in Proc. XP2, State College, PA, June 1981.
16. Maier, D., and J.D. Ullman, “Connections in Acyclic Hypergraphs”, in Proc. ACM SIGACT-SIGMOD Conference on Principles of Database Systems, 34-39, Los Angeles, CA, March 1982.
17. Maier, D., and J.D. Ullman, “Maximal Objects and the Semantics of Universal Relation Databases”, Technical Report #80-016, Dept, of Comp. Science, SUNY at Stonybrook, November 1980.
18. Papadimitriou C.H., and M. Yannakakis, “The Complexity of Facets (and some facets of complexity)”, in Fourteenth Annual ACM Symp. on Theory of Computing. Association for Computing Machinery, New York, N.Y., May 1982.
19. Tarjan, R.E., and M. Yannakakis, “Simple Linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs”, unpublished manuscript, March 1982.
20. Yannakakis, M., “Algorithms for Acyclic Database Schemes”, in Proc. VLDB, 82-94, Cannes, France, September 1981.
21. Yu, C.T., and M.Z. Ozsoyoglu, “An Algorithm for Tree-Query Membership of a Distributed Query,” in Proc. COMPSAC79, IEEE Comp. Society, November 1979.