Abstract
The information in many applications can be naturally represented as graph-structured XML document. Structural query on graph structured XML document matches the subgraph of graph structured XML document on some given schema. The query processing of graphstructured XML document brings new challenges. In this paper, for the processing of subgraph query, we design a subgraph join algorithm based on reachability coding. Using efficient data structure, subgraph join algorithm can process subgraph query with various structures efficiently. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Wang, H., Wang, W., Lin, X., & Li, J. (2005). Subgraph join: Efficient processing subgraph queries on graph-structured XML document. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3739 LNCS, pp. 68–80). Springer Verlag. https://doi.org/10.1007/11563952_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
