Maintaining transitive closure of graphs in SQL Export

@article{citeulike:1869433, abstract = {It is common knowledge that relational calculus and even SQL are not expressive enough to express recursive queries such as the transitive closure. In a real database system, one can overcome this problem by storing a graph together with its transitive closure and maintaining the latter whenever updates to the former occur. This leads to the concept of an incremental evaluation system, or IES. Much is already known about the theory of IES but very little has been translated into practice. The...}, author = {Dong, Guozhu and Libkin, Leonid and Su, Jianwen and Wong, Limsoon}, citeulike-article-id = {1869433}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.53}, journal = {Int. Journal of Information Technology}, keywords = {databases}, posted-at = {2007-11-05 18:21:38}, priority = {0}, title = {Maintaining transitive closure of graphs in SQL}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.53} }

TY - JOUR ID - citeulike:1869433 L3 - citeulike-article-id:1869433 N2 - It is common knowledge that relational calculus and even SQL are not expressive enough to express recursive queries such as the transitive closure. In a real database system, one can overcome this problem by storing a graph together with its transitive closure and maintaining the latter whenever updates to the former occur. This leads to the concept of an incremental evaluation system, or IES. Much is already known about the theory of IES but very little has been translated into practice. The... JF - Int. Journal of Information Technology TI - Maintaining transitive closure of graphs in SQL KW - databases AU - Dong, Guozhu AU - Libkin, Leonid AU - Su, Jianwen AU - Wong, Limsoon UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.53 ER -