Coding-based Join Algorithms for Structural Queries on Graph-Structured XML Document

  • Authors:

  • Hongzhi Wang;Jianzhong Li;Wei Wang;Xuemin Lin

  • Affiliations:

  • Department of Computer Science and Technology, Harbin Institute of Technology, Harbin, China 150001;Department of Computer Science and Technology, Harbin Institute of Technology, Harbin, China 150001;School of Computer Science and Engineering, University of New South Wales, Kensington, Australia;School of Computer Science and Engineering, University of New South Wales, Kensington, Australia

  • Venue:
  • World Wide Web
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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, the subgraph join algorithm can process subgraph queries with various structures efficiently. Experimental results show that our algorithms have good performance and scalability.