Syntactic Characterization of Tree Database Schemas
- 1 October 1983
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 30 (4), 767-786
- https://doi.org/10.1145/2157.322405
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- Degrees of acyclicity for hypergraphs and relational database schemesJournal of the ACM, 1983
- Maximal objects and the semantics of universal relation databasesACM Transactions on Database Systems, 1983
- Tree queriesACM Transactions on Database Systems, 1982
- A simplied universal relation assumption and its propertiesACM Transactions on Database Systems, 1982
- Power of Natural SemijoinsSIAM Journal on Computing, 1981
- Using Semi-Joins to Solve Relational QueriesJournal of the ACM, 1981
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974