
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Yangjun Chen, "On the Graph Traversal and Linear BinaryChain Programs," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 3, pp. 573596, May/June, 2003.  
BibTex  x  
@article{ 10.1109/TKDE.2003.1198392, author = {Yangjun Chen}, title = {On the Graph Traversal and Linear BinaryChain Programs}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {15}, number = {3}, issn = {10414347}, year = {2003}, pages = {573596}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2003.1198392}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  On the Graph Traversal and Linear BinaryChain Programs IS  3 SN  10414347 SP573 EP596 EPD  573596 A1  Yangjun Chen, PY  2003 KW  Deductive database KW  binarychain programs KW  automaton KW  graph searching KW  feedback node. VL  15 JA  IEEE Transactions on Knowledge and Data Engineering ER   
Abstract—Grahne et al. have presented a graph algorithm for evaluating a subset of recursive queries. This method consists of two phases. In the first phase, the method transforms a linear binarychain program into a set of equations over expressions containing predicate symbols. In the second phase, a graph is constructed from the equations and the answers are produced by traversing the relevant paths. Here, we describe a new algorithm which requires less time than Grahne's. The key idea of the improvement is to reduce the search space that will be traversed when a query is invoked. Furthermore, we speed up the evaluation of cyclic data by generating most answers directly in terms of the answers already found and the associated “path information” instead of traversing the corresponding paths as usual. In this way, our algorithm achieves a linear time complexity for both acyclic and cyclic data.
[1] H. Aly and Z.M. Ozsoyoglu, “Synchronized Counting Method,” Proc. Fifth Int'l Conf. Data Eng., pp. 316373, 1989.
[2] F. Bancilhon, "Naive Evaluation of Recursively Defined Relations," M. Brodie and J. Mylopoulos, eds., On knowledgeBase Management Systems—Integrating Database and AI Systems, pp. 165178.New York: SpringerVerlag, 1986.
[3] F. Bancilhon, D. Maier, Y. Sagiv, and J.D. Ullman, "Magic Sets and Other Strange Ways to Implement Logic Programs," Proc. Fifth ACM PODS Symp. Principles of Database Systems, pp. 115, 1986.
[4] F. Bancilhon and R. Ramakrishnan,“An amateur’s introduction to recursive query processing strategies,” Proc. 1986 ACMSIGMOD Int’l Conf. Management Data, pp. 1652,Washington, DC, May 1986.
[5] C. Beeri and R. Ramakrisnhan, “On the Power of Magic,” J. Logic Programming, vol. 11, nos. 3 and 4, pp. 255299, 1991.
[6] C. Chang, “On the Evaluation of Queries Containing Derived Relations in Relational Database,” Advances in Data Base Theory, vol. 1, pp. 235260, 1981.
[7] Y. Chen and T. Härder, “Improving RQA/FQI Recursive Query Algorithm,” Proc. ISMM—First Int'l Conf. Information and Knowledge Management, pp. 413422, 1992.
[8] Y. Chen, “A BottomUp Query Evaluation Method for Stratified Databases,” Proc. Ninth Int'l Conf. Data Eng., pp. 568575, 1993.
[9] Y. Chen and T. Härder, “On the Optimal TopDown Evaluation of Recursive Queries,” Proc. Fifth Int'l Conf. Database and Expert Systems Applications, pp. 4756, 1994.
[10] Y. Chen, “Processing of Recursive Rules in KnowledgeBased Systems—Algorithms for Handling Recursive Rules and Negative Information and Performance Measurements,” PhD thesis, Computer Science Dept., Univ. of Kaiserslautern, Germany, Feb. 1995.
[11] Y. Chen, “On the BottomUp Evaluation of Recursive Queries,” Int'l J. Intelligence Systems, vol. 11, no. 10, pp. 807832, 1996.
[12] Y. Chen, “Magic Sets and Stratified Databases,” Int'l J. Intelligent Systems, vol. 12, no. 3, pp. 203231, 1997.
[13] M.R. Garey and R.E. Tarjan, “A LinearTime Algorithm for Finding All Feedback Vertices,” Information Processing Letters, vol. 7, no. 6, pp. 274276, Oct. 1978.
[14] G. Grahne, S. Sippo, and E. SoisalonSoininen, “Efficient Evaluation for a Subset of Recursive Queries,” Proc. Sixth ACM SIGACTSIGMODSIGACT Symp. Principles of Database Systems, pp. 284 293, 1987.
[15] G. Grahne, S. Sippo, and E. SoisalonSoininen, “Efficient Evaluation for a Subset of Recursive Queries,” J. Logic Programming, vol. 10, no. 4, pp. 301332, 1991.
[16] J. Han, K. Zeng, and T. Lu, “Normalization of Linear Recursion in Deductive Databases,” Proc. Ninth Int'l Conf. Data Eng., pp. 559567, 1993.
[17] J. Han and S. Chen, “Graphic Representation of Linear Recursive Rules,” Int'l J. Intelligent Systems, vol. 7, no. 3, pp. 317337, 1992.
[18] J. Han and L.J. Henschen, “The LevelCycle Merging Method,” Proc. First Int'l Conf. Deductive and ObjectOriented Databases, pp. 113129, 1989.
[19] J. Han, “ChainSplit Evaluation in Deductive Databases,” IEEE Trans. Knowledge and Data Eng., vol. 7, no. 4, pp. 261273, Aug. 1995.
[20] L.J. Henschen and S. Naqvi, “On Compiling Queries in Recursive FirstOrder Database,” J. ACM, vol. 31, no. 1, pp. 4785, 1984.
[21] T. Kanamori and T. Kawamura, “Abstract Interpretation Based on OLDT Resolution,” J. Logic Programming, vol. 15, no. 1, pp. 130, 1993.
[22] J.W. Lloyd, Foundations of Logic Programming, Springer Series in Symbolic Computation, second ed. New York: SpringerVerlag, 1987.
[23] D.B. Johnson, “Finding All Elementary Circuits of a Directed Graph,” SIAM J. Computing, vol. 4, no. 1, Mar. 1975.
[24] A. MarchettiSpaccamela, A. Pelaggi, and D. Sacca, “Worst Case Complexity Analysis of Methods for Logic Query Implementation,” Proc. Sixth ACM SIGACTSIGMODSIGACT Symp. Principles of Database Systems, pp. 294301, 1987.
[25] W. Nejdl, “Recursive Strategies for Answering Recursive Queries—The RQA/FQI Strategy,” Proc. 13th VLDB Conf., pp. 4350, 1987.
[26] D. Sacca and C. Zaniolo, “On the Implementation of a Simple Class of Logic Queries for Databases,” Proc. Fifth ACM SIGMODSIGACT Symp. Principles of Database Systems, pp. 1623, 1986.
[27] S. Shapiro and D. Mckay, “Inference with Recursive Rules,” Proc. Fifth Ann. Nat'l Conf. Artificial Intelligence, pp. 151153, 1980.
[28] G. Schmidt and T. Ströhein, Relations and Graphs. Berlin: SpringerVerlag, 1991.
[29] R. Tarjan, “DepthFirst Search and Linear Graph Algorithm,” SIAM J. Computing, vol. 1, no. 2, pp. 146160, June 1972.
[30] J. Ullman, Principles of Database and KnowledgeBase Systems, vol. 1. Computer Science Press, 1988.
[31] L. Vieill, “Recursive Query Processing: The Power of Logic,” Int'l J. Theoretical Computer Science, vol. 69, no. 1, pp. 153, 1989.
[32] C. Wu and L.J. Henschen, “Answering Linear Recursive Queries in Cyclic Databases,” Proc. 1988 Int'l Conf. Fifth Generation Computer Systems, pp. 727734, 1988.
[33] J. Ullman and A. Van Gelder, “Parallel Complexity of Logical Query Programs,” Proc. 27th Ann. IEEE Symp. Foundations of Computer Science, pp. 438454, 1986.
[34] R. Dechter, “Decomposing a Relation into Tree of Binary Relations,” J. Computer and System Science, vol. 41, no. 1, pp. 224, 1990.
[35] A. MarchettiSpaccamela, A. Pelaggi, and D. Sacca, “Comparison of Methods for LogicQuery Implementation,” J. Logic Programming, vol. 10, no. 4, pp. 333360, 1991.