Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. Aho, A. V., Sagiv, Y., Szymanski, T. G., & Ullman, J. D. SIAM J Comput, 10(3):405–421, 1981.
doi  abstract   bibtex   
We 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.
@Article{aho81inferring,
  author   = {Alfred V. Aho and Yehoshua Sagiv and Thomas G. Szymanski and Jeffrey D. Ullman},
  title    = {Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions},
  journal  = {SIAM J Comput},
  year     = {1981},
  volume   = {10},
  number   = {3},
  pages    = {405--421},
  abstract = {We 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.},
  doi      = {10.1137/0210030},
  keywords = {phylogenetics},
}

Downloads: 0