article

Free access

Degrees of acyclicity for hypergraphs and relational database schemes

Author:

Ronald FaginAuthors Info & Claims

Journal of the ACM (JACM), Volume 30, Issue 3

Pages 514 - 550

https://doi.org/10.1145/2402.322390

Published: 01 July 1983 Publication History

PDF eReader

References

[1]

AHO, A.V., BEERI, C., AND ULLMAN, I.D. The thvory of joins in relational databases. A CM Trans, Database Syst. 4, 3 (Sept. 1979), 297-314]]

Crossref

Google Scholar

[2]

Ano, A.V., AnD KERNIGttAN, B~W.Private commtmication, Nov. 1981.]]

Google Scholar

[3]

ATZENI, P., AND PARKER, D S., JR.Assumpuons in relational database theory. In Prec. 1st ACM SIGACT-SIGMOD Syrup on Pnnciples of Database Systems (Los Angeles, Calif., Mar. 29-31, 1982), ACM, New York, 1982, pp. 1-9.]]

Crossref

Google Scholar

[4]

AUSmLLO, G, D'ATRI, A, AND MOSCARIt,U, M. minimal coverings of acydie database schemata. Prec. ONERA-CERT Toulouse Workshop on Logical Bases for Data Bases, Toulouse, France, 1982.]]

Google Scholar

[5]

B^c~N, C.W. Data structure diagrams. Data Base 1, 2 (1969), 4-10.]]

Crossref

Google Scholar

[6]

BATINI, C., D'Arm, A., AND MOSCAmNI, M Formal tools for top-down and bottom-up generation of acyclic relattonal schemata. Proc 7th Int. Conf. on Graph-Theoretic Concepts in Computer Science, LiaR, Austria, 1981.]]

Google Scholar

[7]

BEERI, C., FAGIN, R., MAW~, D., MENOFa2ZON, A.O, ULLMAN, J D., ANI) YAt~NAKAmS, M. Properties of acyclie database schemes. In Prec. 13th Ann. A CM Syrup. on Theory of Computing (Milwaukee, Wise., May 11-13, 1981), ACM, New York, 1981, pp. 355-362.]]

Crossref

Google Scholar

[8]

BEERI, C., FAGIN, R., MAIER, D, ANt) YANNAKAKIS, M. On the desirability of acyclic database schemes. ~ ACM 30, 3 (July 1983), 479-513]]

Crossref

Google Scholar

[9]

BEERI, C, MI/NDELZON, A.O., SAGlV, Y., AND ULLMAN, J.D.Equivalence of relational database schemes SIAM j Comput. 10, 2 (June 1981), 352-370]]

Google Scholar

[10]

BERG, C. Graphs and Hypergraphs. North-Holland, New York, 1976.]]

Google Scholar

[11]

BERNSTEIN, P.A., AND GOODMAN, N.The power of natural semijoins. SIAM d. Comput. 10, 4 (Nov. 1981), 751-771.]]

Google Scholar

[12]

CASANOVA, M.A., FA(3IN, R., ANt) PAPAO~OU, C.Inclusion dependencies and then" interactmn with functmnal dependencies. In Prec. A CM Syrup on Principles of Database Systems (Los Angeles, Calif., Mar. 29-31, 1982), ACM, New York, 1982, pp. 171-176]]

Crossref

Google Scholar

[13]

C~ERLIN, D D., ASTRAHAN, M.M., EswxaAr~, K.P., GRIFFITHS, P.P., LORIE, R.A., MERL, L W., REISr,~R, P., Ar, a~ W^D~, B.W. SEQUEL 2: A untried approach to data definition, manipulation, and control. IBM J Res. Dev. 20, 6 (Nov. 1976), 560--575]]

Google Scholar

[14]

CHASE, K.Join graphs and acychc data base schemes. In Prec. 7th Int. Conf. on Very Large Databases (Cannes, France, Sept 9-11, 1981), ACM, New York, 1981, pp. 95-100.]]

Google Scholar

[15]

CODD, E.F.Further normalizatmn of the database relauonal model. In Data Base Systems, Courant Computer Science Symposm 6, R Rustm, Ed, Prentice-Hall, 1971, pp. 65-98.]]

Google Scholar

[16]

CODD, E.F.Recent investigations rote relational database systems. In Prec. IFII' Congress 74, North-Holland, New York, 1974, pp. 1017-1021.]]

Google Scholar

[17]

CODD, E.F. Extending the database relational model to capture more meaning. A CM Trans. Database Syst. 4, 4 (Dec. 1979), 397-434.]]

Crossref

Google Scholar

[18]

DATRI, A., AND MOSCARINI, M.Acyclic hypergraphs" Their recognition and top-down versus bottom-up generation. Tech. Pep. R.29, Conslglio Nazmnale Delle Richerche, IstRuto di Anahsl dei Sistem~ ed Informatlca, 1982.]]

Google Scholar

[19]

FAGtN, R.The decomposition versus the syntheUc approach to relational database design. In Proc. 3rd Int. Conf. on Very Large Databases (Tokyo, Japan, Oct. 6-8, 1977), ACM, New York, 1977, pp. 441--446 Also in Tutorial: Data Base Management m the 1980s, J A. Larson and H.A. Freeman, Eds., IEEE, NY, 1981, pp. 269-274.]]

Google Scholar

[20]

FAGIN, R A normal form for relatmrtal databases that 15 based on domains and keys. A CM Trans. Database Syst. 6, 3 (Sept 1981), 387--415.]]

Crossref

Google Scholar

[21]

FAGIN, R. Horn clauses and database dependencies, d. A CM 29, 4 (Oct. 1982), 952-985. Extended abstract appeared in Proc 12th Ann. ACM Symp. on Theory of Computing (Los Angeles, Calif., Apr. 28-30, 1980), ACM, New York, 1980, pp. 123-134.]]

Crossref

Google Scholar

[22]

FAGrN, R, MENDELZON, A.O., AND ULLMAN, J.D.A simplified umversal relation assumption and its properties. ACM Trans. Database Syst 7, 3 (Sept. I982), 343-360.]]

Crossref

Google Scholar

[23]

GOODMAN, N., AND SHMLVELI, O Charactenzauons of tree database schemas. Tech, Pep., Harvard Univ., Cambridge, Mass., 1981.]]

Google Scholar

[24]

GOODMAN, N., AND SHMUELI, O.Private commumcat~on, Jan 1982.]]

Google Scholar

[25]

GOODMAN, N., AND SHMUELI, O. Tree queues: A smaple class of relational queries. ACM Trans. Database Syst. 7, 4 (Dec. 1982), 653-677.]]

Crossref

Google Scholar

[26]

GRAHAM, M.H. On the umversal relation. Tech Pep, Univ. of Toronto, Toronto, Ont., Can., Sept. 1979]]

Google Scholar

[27]

GI~AHAM, M H.Facts about CAG-C database schemas Unpublished manuscript, Sept. 1981.]]

Google Scholar

[28]

Ho~,rEYl~O,lq, P Testing sattsfactiort of functional dependencies. J ACM 29, 3 (July 1982), 668-677.]]

Crossref

Google Scholar

[29]

HULL, R Acyehc join dependency and database projections. Teeh. Pep., Univ of Southern Califorma, Los Angeles, Calif, June 198 I.]]

Google Scholar

[30]

Kxm~, J., KLEITMAN, D., AND LINIAL, W Private commumcation, Aug. 1982.]]

Google Scholar

[31]

LmN, Y.E On the equivalence of database models. ~ ACM 29, 2 (Apr. 1982), 333-363.]]

Crossref

Google Scholar

[32]

MAmg, D., AND ULLMAN, J D.Connectmns m acyclic hypergraphs. In Prec. A CM Syrup. on Principles of Database Systems (Los Angeles, Calif., Mar. 29-31, 1982), ACM, New York, 1982, pp. 34-39.]]

Crossref

Google Scholar

[33]

MAIER, D., Ut~MA~, J.D, xND VARDI, M Y. The revenge of the JD. In Proc. 2nd A CM Symp. on Principles of Database Systems (Atlanta, Ga., Mar 21-23, 1983), ACM, New York, 1983, pp. 279-287.]]

Crossref

Google Scholar

[34]

RaSSANEr~, J.Theory of relations for databases--A tutorial survey. In Proc. 7th Syrup. on Mathematicai Foundations of Computer Science, Lecture Notes in Computer Science 64, J. Winkowski, Ed., Springer-Vedag, New York, pp. 537-551.]]

Google Scholar

[35]

S^otv, Y Can we use the universal instance assumptton without using nulls? In Proc. Int. Conf. on Management of Data (Ann Arbor, Mich., Apr. 29-May 1, 1981), ACM, New York, 1981, pp 108-120.]]

Crossref

Google Scholar

[36]

TARJANr~o Y~~s, M.Simple linear-time algorithms to test chordality of graphs, test acychcity of hypergraphs, and selectively re,lute acyclic hypergraphs. Tech. Rep., Bell Labs, Murray Hill, NJ., Mar. 1982.]]

Google Scholar

[37]

ULLMAN, J.D.The U.R. strikes back. In Proc. A CM Syrup. on Principles of Database Systems (Los Angeles, Cahf., Mar. 29--31, 1982), ACM, New York, 1982, pp. 10--22]]

Crossref

Google Scholar

[38]

YXr,~AKAgIS, M. Algorithms for acycli~ database schemes. In Proc 7th Int. Conf on Very Large Databases (Cannes, France, Mar. 29-31, 1982), ACM, New York, 1982, pp. 82-94.]]

Google Scholar

[39]

YANNAKASI, M. Private communication, Sept. 1981.]]

Google Scholar

[40]

Yu, C.T., AND OzsoYo~ttr, M.Z. Aa algorithm for tree-query memberslnp of a distributed query. In Proc 1979 IEEE COMPSAC, IEEE, New York, 1979, pp. 306-312.]]

Google Scholar

[41]

Z^tJJOLO, C Analysts and design of relational schemata for database systems. Ph D. Dissertation, Umv. of California, Los Angeles, Calff, July 1976, available as Tech. Rep UCLA ENG-7669.]]

Google Scholar

Cited By

View all

Remy Wang YWillsey MSuciu D(2024)From Binary Join to Free JoinACM SIGMOD Record10.1145/3665252.366525953:1(25-31)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3665252.3665259
Wang QLuo QWang Y(2024)Relational Algorithms for Top-k Query EvaluationProceedings of the ACM on Management of Data10.1145/36549712:3(1-27)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654971
Hu X(2024)Fast Matrix Multiplication for Query ProcessingProceedings of the ACM on Management of Data10.1145/36515992:2(1-25)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651599
Show More Cited By

Index Terms

Degrees of acyclicity for hypergraphs and relational database schemes
1. Information systems
  1. Data management systems
    1. Database design and models
      1. Relational database model
    2. Query languages
      1. Relational database query languages
2. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Hypergraphs

Recommendations

A Method for Rough Relational Database Transformed into Relational Database
SSME '09: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering

It is decomposed the data of rough relational database and transformed into relational database according to the characteristic of rough relational database and relational database and in virtue of multiplication principle and Descartes of basic ...
Relational Database Design and Implementation
Model Transformation From Object Relational Database to NoSQL Document Database
NISS '19: Proceedings of the 2nd International Conference on Networking, Information Systems & Security

With the high increase of data growing, NoSQL databases play a key role in storing large amount of data, to gain flexibility and scalability many industries are now replacing their relational and object relational databases by adopting NoSQL database ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 30, Issue 3

July 1983

297 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/2402

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1983

Published in JACM Volume 30, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

368
Total Citations
View Citations
1,398
Total Downloads

Downloads (Last 12 months)239
Downloads (Last 6 weeks)19

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Remy Wang YWillsey MSuciu D(2024)From Binary Join to Free JoinACM SIGMOD Record10.1145/3665252.366525953:1(25-31)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3665252.3665259
Wang QLuo QWang Y(2024)Relational Algorithms for Top-k Query EvaluationProceedings of the ACM on Management of Data10.1145/36549712:3(1-27)Online publication date: 30-May-2024
https://dl.acm.org/doi/10.1145/3654971
Hu X(2024)Fast Matrix Multiplication for Query ProcessingProceedings of the ACM on Management of Data10.1145/36515992:2(1-25)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651599
Milićev DŠuštran Ž(2024)Rewriting Queries for Hyper-RelationsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.337407636:9(4862-4873)Online publication date: Sep-2024
https://doi.org/10.1109/TKDE.2024.3374076
He MMunro JWu K(2024)Succinct Data Structures for Path Graphs and Chordal Graphs Revisited2024 Data Compression Conference (DCC)10.1109/DCC58796.2024.00057(492-501)Online publication date: 19-Mar-2024
https://doi.org/10.1109/DCC58796.2024.00057
ten Cate BFunk MJung JLutz C(2024)On the non-efficient PAC learnability of conjunctive queriesInformation Processing Letters10.1016/j.ipl.2023.106431183:COnline publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1016/j.ipl.2023.106431
Changat MShanavas AStadler P(2024)Transit functions and pyramid-like binary clustering systemsDiscrete Applied Mathematics10.1016/j.dam.2024.06.032357(365-384)Online publication date: Nov-2024
https://doi.org/10.1016/j.dam.2024.06.032
Guttmann-Beck NStern M(2024)Decomposing the feasibility of Clustered Spanning Tree by PathsDiscrete Applied Mathematics10.1016/j.dam.2022.11.009354:C(160-180)Online publication date: 15-Sep-2024
https://dl.acm.org/doi/10.1016/j.dam.2022.11.009
Clausen JCrama YLusby RRodríguez-Heck ERopke S(2024)Solving unconstrained binary polynomial programs with limited reachComputers and Operations Research10.1016/j.cor.2024.106586165:COnline publication date: 2-Jul-2024
https://dl.acm.org/doi/10.1016/j.cor.2024.106586
Del Pia AKhajavirad A(2024)The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimizationMathematical Programming10.1007/s10107-024-02122-yOnline publication date: 22-Jul-2024
https://doi.org/10.1007/s10107-024-02122-y
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

A Method for Rough Relational Database Transformed into Relational Database

Relational Database Design and Implementation

Model Transformation From Object Relational Database to NoSQL Document Database

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations