Graph traversal and top-down evaluation of logic queries

@article{Chen1998GraphTA,
  title={Graph traversal and top-down evaluation of logic queries},
  author={Yangjun Chen},
  journal={Journal of Computer Science and Technology},
  year={1998},
  volume={13},
  pages={300-316}
}
In this paper, an optimal method to handle cyclic and acyclic data relations in the linear recursive queries is proposed. High efficiency is achieved by integrating graph traversal mechanisms into a top-down evaluation. In such a way, the subsumption checks and the identification of cyclic data can be done very efficiently. First, based on the subsumption… CONTINUE READING