Journal Article10.1109/TKDE.2003.1198392
On the graph traversal and linear binary-chain programs
TL;DR: A new algorithm which requires less time and achieves a linear time complexity for both acyclic and 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.
read more
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 binary-chain 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. In this paper, 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Proceedings Article
Review - Magic Sets and Other Strange Ways to Implement Logic Programs.
Raghu Ramakrishnan
- 01 Jan 1999
178
An Efficient Algorithm for Answering Graph Reachability Queries
Yangjun Chen,Yibin Chen +1 more
- 07 Apr 2008
TL;DR: An 0(n2 + bnradic(b) time algorithm to decompose a directed acyclic graph (DAG) into a minimized set of disjoint chains to facilitate reachability checking and is able to label a graph in 0(be) time and store all the labels in O(bn) space with O(logb) reachability check time.
154
Decomposing DAGs into spanning trees: A new way to compress transitive closures
Yangjun Chen,Yibin Chen +1 more
- 11 Apr 2011
TL;DR: This paper proposes a new approach to decompose a graph into a series of spanning trees which may share common edges, to transform a reachability query over aGraph into a set of queries over trees, and demonstrates the efficiency and effectiveness of this method.
Efficient Processing of XML Tree Pattern Queries
Yangjun Chen,Dunren Che +1 more
TL;DR: A polynomial-time algorithm for TPQ (tree pattern queries) minimization without XML constraints involved that needs only O(n2) time, where n is the number of nodes in a TPQ.
7
Minimization of XML Tree Pattern Queries in the Presence of Integrity Constraints
Yangjun Chen,Dunren Che +1 more
TL;DR: It is shown that the algorithm obtained by first augmenting the input tree pattern using the constraints, and then applying minimization, always finds the unique minimal equivalent to the original query.
4
References
Depth-First Search and Linear Graph Algorithms
TL;DR: The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples of an improved version of an algorithm for finding the strongly connected components of a directed graph.
6.9K
•Book
Foundations of logic programming
John W. Lloyd
- 01 Jan 1984
TL;DR: This is the second edition of an account of the mathematical foundations of logic programming, which collects, in a unified and comprehensive manner, the basic theoretical results of the field, which have previously only been available in widely scattered research papers.
4.5K
•Book
Principles of database and knowledge-base systems
Jeffrey D. Ullman
- 01 Jan 1979
TL;DR: This book goes into the details of database conception and use, it tells you everything on relational databases from theory to the actual used algorithms.
2.9K