Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/6012.15412acmconferencesArticle/Chapter ViewAbstractPublication PagespodsConference Proceedingsconference-collections
Article
Free access

One flavor assumption and gamma-acyclicity for universal relation views

Published: 01 June 1985 Publication History
First page of PDF

References

[1]
Atzeni, P., Parker, D.S., Assumptions in relational database theory, Proc. Ist ACM SIGACT-SIGMOD Symp. on Principles of Database Systenis, 1982, pp. 1 - 9
[2]
Aho, A.V., Sethi, R., Ullman, J.D., Code Optimization and finite Church-Rosser Systems, in' R. Rustin (ed.), Design and Optimization of Compilers, Prentice Hall, Englewood Cliffs, 1972, pp. 89-105
[3]
Biskup, J., Brflggemann, H.H., Universal relation views ~ A pragmatic approach, Proc. 9th Intern. Conf. on Very Large Data Bases, 1983, pp. 172-185
[4]
Bernstein, P.A., Synthesizing third normal form relations from functional dependencies, ACM Trans. on Database Systems,Vol. 1, No. 4, December 1976, pp. 277 - 298
[5]
Brflggemann, H.H., Semantics of universal relation views and their data base schemes (in German), Doctoral dissertation, University of Dortmund (West Germany), 1985
[6]
Fagin, R., Degrees of acyclicity for hypergraphs and relational database schemes, Journal of the ACM, Vol. 30, No. 3, July 1983, pp. 514-550
[7]
Fagin, R., Mendelzon, A.O., Ullman, J.D., A simplified universal relation assumption and its properties, TR RJ ' 2900, IBM San Jose, 1980
[8]
Graham, M.H., On the universal relation, Computer Systems Reserarch Group Report, University of Toronto, 1979
[9]
Hull, R., Acyclic join dependencies and database projections, Journal of Computer in System Sciences, Vol. 27,1983, pp. 331 - 349
[10]
Kramer, M., ~-acyclicity and universal relation views (in German), diploma thesis, University of Dortmund (West Germany), February 1985
[11]
Maier, D., The Theory of Relational Databases, Computer Science Press, Rockville, Maryland, 1983
[12]
Maier, D., Ullman, J.D., Connections in acyclic hypergraphs, Theoretical Computer Science, Vol. 32, 1984, pp. 185-199
[13]
Maier, D., Ullman, J.D., Vardi, M.Y., On the foundations of the universal relation model, ACM Trans. on Database Systems, Vol. 9, No. 2, June 1984, pp. 283 - 308
[14]
SchnetgGke, L., Database schemes for universal relation views (in German), diploma thesis, University of Dortmund (West Germany), April 1985
[15]
Tarjan, R.E., Yannakakis, M., Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectivity reduce acyclic hypergraphs, SIAM Journal on Computing, Vol. 13, Aug. 1983, pp. 566 - 579
[16]
Ullman, J.DI, Universal relation interfaces for database systems, Proc. 9th IFIP World Computer Conference, 1983, pp. 243 - 252
[17]
Ullman, J.D., Principles of Database Systems, Computer Science Press, Rockville, Maryland, 1982
[18]
Yannakakis, M., Algorithms for acyclic database schemes, Proc. 7th Intern. Conf. on Very Large Data Bases, 1981, pp. 82- 94
[19]
Yu, C.T., Ozsoyoglu, M.Z., An algorithm for tree-query membership of a distributed query, Proc. 3rd IEEE COMPSAC, Chicago, 1979, pp. 306 - 312

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODS '86: Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
June 1985
293 pages
ISBN:0897911792
DOI:10.1145/6012
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1985

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

PODS86
PODS86: ACM SIGACT-SIGMOD Symposium on Principles of Database Systems
March 24 - 26, 1986
Massachusetts, Cambridge, USA

Acceptance Rates

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)19
  • Downloads (Last 6 weeks)4
Reflects downloads up to 15 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2005)Achievements of relational database schema design theory revisitedSemantics in Databases10.1007/BFb0035004(29-54)Online publication date: 23-Jun-2005
  • (2005)Database schema design theory: Achievements and challengesInformation Systems and Data Management10.1007/3-540-60584-3_22(14-44)Online publication date: 2-Jun-2005
  • (2005)Concluding remarks and ongoing researchThe Nested Universal Relation Database Model10.1007/3-540-55493-9_7(159-161)Online publication date: 30-May-2005
  • (2005)Blocks and projections' synthesis in relational databasesMFDBS 8910.1007/3-540-51251-9_24(367-381)Online publication date: 1-Jun-2005
  • (2005)γ-Acyclic database schemes and nested relationsNested Relations and Complex Objects in Databases10.1007/3-540-51171-7_34(313-323)Online publication date: 2-Jun-2005
  • (2005)Data manipulation languages for the universal relation view DURSTMFDBS 8710.1007/3-540-19121-6_3(20-41)Online publication date: 31-May-2005
  • (2005)A universal relation model for nested relationsAdvances in Database Technology—EDBT '8810.1007/3-540-19074-0_59(294-308)Online publication date: 24-May-2005

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media