B. D. Acharya and M. L. Vergnas, Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality, Journal of Combinatorial Theory, Series B, vol.33, issue.1, pp.52-56, 1982.
DOI : 10.1016/0095-8956(82)90056-9
URL : http://doi.org/10.1016/0095-8956(82)90056-9

C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, On the Desirability of Acyclic Database Schemes, Journal of the ACM, vol.30, issue.3, pp.30-479, 1983.
DOI : 10.1145/2402.322389

Y. M. Chee, L. Ji, A. Lim, B. C. Ooi, and A. K. Tung, Arboricity: An acyclic hypergraph decomposition problem motivated by database theory, Discrete Applied Mathematics, vol.160, issue.1-2, 2009.
DOI : 10.1016/j.dam.2011.08.024
URL : http://doi.org/10.1016/j.dam.2011.08.024

C. J. Colbourn, D. G. Hoffman, and R. Rees, A new class of group divisible designs with block size three, Journal of Combinatorial Theory, Series A, vol.59, issue.1, pp.73-89, 1992.
DOI : 10.1016/0097-3165(92)90099-G

C. J. Colbourn, R. Mathon, and . Steiner-systems, The CRC Handbook of Combinatorial Designs (C, Boca Raton, vol.19964342, pp.102-110, 2007.
DOI : 10.1201/9781420049954

C. J. Colbourn and A. Rosa, Triple Systems, 1999.

R. Fagin, Degrees of acyclicity for hypergraphs and relational database schemes, Journal of the ACM, vol.30, issue.3, pp.514-550, 1983.
DOI : 10.1145/2402.322390

R. Fagin, A. O. Mendelzon, and J. D. Ullman, A simplied universal relation assumption and its properties, ACM Transactions on Database Systems, vol.7, issue.3, pp.343-360, 1982.
DOI : 10.1145/319732.319735

N. Goodman and O. Shmueli, Characterizations of tree database schemas, 1981.

M. H. Graham, On the universal relation, 1979.

M. J. Grannell, T. S. Griggs, and R. A. Mathon, Steiner systems $S(5,6,v)$ with $v=72$ and $84$, Mathematics of Computation of the American Mathematical Society, vol.67, issue.221, pp.357-359, 1998.
DOI : 10.1090/S0025-5718-98-00924-7

H. Hanani, On quadruple systems, Journal canadien de math??matiques, vol.12, issue.0, pp.145-157, 1960.
DOI : 10.4153/CJM-1960-013-3

H. Li, On acyclic and cyclic hypergraphs, Chinese Academy of Science, 1999.

H. Li and J. Wang, On acyclic and cyclic hypergraphs, J. Syst. Sci. Complex, vol.15, pp.353-362, 2002.

R. E. Tarjan and M. Yannakakis, Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, SIAM Journal on Computing, vol.13, issue.3, pp.566-579, 1984.
DOI : 10.1137/0213035

J. Wang, The information hypergraph theory, 2008.

J. Wang and H. Li, Enumeration of Maximum Acyclic Hypergraphs, Acta Mathematicae Applicatae Sinica, English Series, vol.12, issue.2, pp.215-218, 2002.
DOI : 10.1007/s102550200020

M. Yannakakis, Algorithms for acyclic database schemes, VLDB 1981 ? Proceedings of the 7th International Conference on Very Large Data Bases, pp.82-94, 1981.

C. T. Yu and M. Z. Ozsoyoglu, An algorithm for tree-query membership of a distributed query, COMPSAC '79: Proceedings of the IEEE Computer Software and Applications Conference On determining tree-query membership of a distributed query, IEEE Computer Society, vol.21, pp.306-312, 1979.