000 01223nam a2200289Ia 4500
003 MX-MdCICY
005 20250625140655.0
040 _cCICY
090 _aB-11681
245 1 0 _aInferring a tree from lowest common ancestors with an application to the optimization of relational expressions
490 0 _vSIAM Journal on Compiting, 10(3), p.405-421, 1981
520 3 _aWe present an algorithm for constructing a tree to satisfy a set of lineage constraints on common ancestors. We then apply this algorithm to synthesize a relational algebra expression from a simple tableau, a problem arising in the theory of relational databases.
650 1 4 _aTREE ALGORITHMS
650 1 4 _aLOWEST COMMON ANCESTORS
650 1 4 _aRELATIONAL DATABASES
650 1 4 _aRELATIONAL ALGEBRA
650 1 4 _aTABLEAUX
650 1 4 _aQUERY OPTIMIZATION
650 1 4 _aJOIN MINIMIZATION
700 1 2 _aAho, A.V.
700 1 2 _aSagiv, Y.
700 1 2 _aSzymanski, T.G.
700 1 2 _aUllman, J.D.
856 4 0 _uhttps://drive.google.com/file/d/1qufy9nwQYEXVo0wEMmjJPIk5_jze6zuH/view?usp=drivesdk
_zPara ver el documento ingresa a Google con tu cuenta: @cicy.edu.mx
942 _2Loc
_cREF1
008 250602s9999 xx |||||s2 |||| ||und|d
999 _c45897
_d45897