On the graph traversal and linear binary-chain programs

IEEE Transactions on Knowledge and Data Engineering

Volumn 15, Issue 3, 2003, Pages 573-596

  Chen, Yangjun ^a  

^a NONE

Author keywords

Automaton; Binary chain programs; Deductive database; Feedback node; Graph searching

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; INPUT OUTPUT PROGRAMS;

LINEAR BINARY-CHAIN PROGRAMS;

GRAPH THEORY;

EID: 0038633374     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2003.1198392     Document Type: Article

References (35)

1. H. Aly and Z.M. Ozsoyoglu, "Synchronized Counting Method," Proc. Fifth Int'l Conf. Data Eng., pp. 316-373, 1989.
2. F. Bancilhon, "Naive Evaluation of Recursively Defined Relations," On Knowledge Base Management Systems-Integrating Database and AI Systems, Springer-Verlag, pp. 165-178, 1985.
3. F. Bancilhon, D. Maier, Y. Sagiv, and J.D. Ullman, "Magic Sets and Other Strange Ways to Implement Logic Programs," Proc. Fifth ACM Symp. Principles of Database Systems, pp. 1-15, 1986.
4. F. Bancilhon and R. Ramakrishnan, "An Amateur's Introduction to Recursive Query Processing Strategies," Proc. 1986 ACM-SIGMOD Conf. Management of Data, pp. 16-52, 1986.
5. C. Beeri and R. Ramakrishnan, "On the Power of Magic," J. Logic Programming, vol. 10, no. 4, pp. 255-299, 1991.
6. C. Chang, "On the Evaluation of Queries Containing Derived Relations in Relational Database," Advances in Data Base Theory, vol. 1, pp. 235-260, 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. 413-422, 1992.
8. Y. Chen, "A Bottom-Up Query Evaluation Method for Stratified Databases," Proc. Ninth Int'l Conf. Data Eng., pp. 568-575, 1993.
9. Y. Chen and T. Harder, "On the Optimal Top-Down Evaluation of Recursive Queries," Proc. Fifth Int'l Conf. Database and Expert Systems Applications, pp. 47-56, 1994.
10. Y. Chen, "Processing of Recursive Rules in Knowledge-Based 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 Bottom-Up Evaluation of Recursive Queries," Int'l J. Intelligence Systems, vol. 11, no. 10, pp. 807-832, 1996.
12. Y. Chen, "Magic Sets and Stratified Databases," Int'l J. Intelligent Systems, vol. 12, no. 3, pp. 203-231, 1997.
13. M.R. Garey and R.E. Tarjan, "A Linear-Time Algorithm for Finding All Feedback Vertices," Information Processing Letters, vol. 7, no. 6, pp. 274-276, Oct. 1978.
14. G. Grahne, S. Sippo, and E. Soisalon-Soininen, "Efficient Evaluation for a Subset of Recursive Queries," Proc. Sixth ACM SIGACT-SIGMOD-SIGACT Symp. Principles of Database Systems, pp. 284-293, 1987.
15. G. Grahne, S. Sippo, and E. Soisalon-Soininen, "Efficient Evaluation for a Subset of Recursive Queries," J. Logic Programming, vol. 10, no. 4, pp. 301-332, 1991.
16. J. Han, K. Zeng, and T. Lu, "Normalization of Linear Recursion in Deductive Databases," Proc. Ninth Int'l Conf. Data Eng., pp. 559-567, 1993.
17. J. Han and S. Chen, "Graphic Representation of Linear Recursive Rules," Int'l J. Intelligent Systems, vol. 7, no. 3, pp. 317-337, 1992.
18. J. Han and L.J. Henschen, "The Level-Cycle Merging Method," Proc. First Int'l Conf. Deductive and Object-Oriented Databases, pp. 113-129, 1989.
19. J. Han, "Chain-Split Evaluation in Deductive Databases," IEEE Trans. Knowledge and Data Eng., vol. 7, no. 4, pp. 261-273, Aug. 1995.
20. L.J. Henschen and S. Naqvi, "On Compiling Queries in Recursive First-Order Database," J. ACM, vol. 31, no. 1, pp. 47-85, 1984.
21. T. Kanamori and T. Kawamura, "Abstract Interpretation Based on OLDT Resolution," J. Logic Programming, vol. 15, no, 1, pp. 1-30, 1993.
22. J.W. Lloyd, foundations of Logic Programming. Berlin; Springer-Verlag, 1987.
23. D.B. Johnson, "Finding All Elementary Circuits of a Directed Graph," SIAM J. Computing, vol. 4, no. 1, Mar. 1975.
24. A. Marchetti-Spaccamela, A. Pelaggi, and D. Sacca, "Worst Case Complexity Analysis of Methods for Logic Query Implementation," Proc. Sixth ACM SIGACT-SIGMOD-SIGACT Symp. Principles of Database Systems, pp. 294-301, 1987.
25. W. Nejdl, "Recursive Strategies for Answering Recursive Queries - The RQA/FQI Strategy," Proc. 13th VLDB Conf., pp. 43-50, 1987.
26. D. Sacca and C. Zaniolo, "On the Implementation of a Simple Class of Logic Queries for Databases," Proc. Fifth ACM SIGMOD-SIGACT Symp. Principles of Database Systems, pp. 16-23, 1986.
27. S. Shapiro and D. Mckay, "Inference with Recursive Rules," Proc. Fifth Ann. Nat'l Conf. Artificial Intelligence, pp. 151-153, 1980.
28. G. Schmidt and T. Ströhein, Relations and Graphs. Berlin: Springer-Verlag, 1991.
29. R. Tarjan, "Depth-First Search and Linear Graph Algorithm," SIAM J. Computing, vol. 1, no. 2, pp. 146-160, June 1972.
30. J.D. Ullman, Principles of Databases and Knowledge-Base Systems. Computer Science Press, 1989.
31. L. Vieill, "Recursive Query Processing: The Power of Logic," Int'l J. Theoretical Computer Science, vol. 69, no. 1, pp. 1-53, 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. 727-734, 1988.
33. J. Ullman and A. Van Gelder, "Parallel Complexity of Logical Query Programs," Proc. 27th Ann. IEEE Symp. Foundations of Computer Science, pp. 438-454, 1986.
34. R. Dechter, "Decomposing a Relation into Tree of Binary Relations," J. Computer and System Science, vol. 41, no. 1, pp. 2-24, 1990.
35. A. Marchetti-Spaccamela, A. Pelaggi, and D. Sacca, "Comparison of Methods for Logic-Query Implementation," J. Logic Programming, vol. 10, no. 4, pp. 333-360, 1991.