Coding-based Join Algorithms for Structural Queries on Graph-Structured XML Document (2008)
| Venue: | WORLD WIDE WEB |
| Citations: | 1 - 0 self |
BibTeX
@MISC{Wang08coding-basedjoin,
author = {Hongzhi Wang and Jianzhong Li and Wei Wang and Xuemin Lin},
title = { Coding-based Join Algorithms for Structural Queries on Graph-Structured XML Document},
year = {2008}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In many applications, XML documents need to be modelled as graphs. The query processing of graph-structured XML documents brings new challenges. In this paper, we design a method based on labelling scheme for structural queries processing on graph-structured XML documents. We give each node some labels, the reachability labelling scheme. By extending an interval-based reachability labelling scheme for DAG by Rakesh et al., we design labelling schemes to support the judgements of reachability relationships for general graphs. Based on the labelling schemes, we design graph structural join algorithms to answer the structural queries with only ancestor-descendant relationship efficiently. For the processing of subgraph query, we design a subgraph join algorithm. With efficient data structure,
