Download now Free registration required
In many applications, XML documents need to be modeled as graphs. The query processing of graph-structured XML documents brings new challenges. In this paper, the authors design a method based on labelling scheme for structural queries processing on graph-structured XML documents. They give each node some labels, the reachability labelling scheme. By extending an interval-based reachability labelling scheme for DAG by Rakesh et al., they design labelling schemes to support the judgments of reachability relationships for general graphs. Based on the labelling schemes, they design graph structural join algorithms to answer the structural queries with only ancestor-descendant relationship efficiently.
- Format: PDF
- Size: 612.9 KB