Subgraph join: Efficient processing subgraph queries on graph-structured XML document

Hongzhi Wang*, Wei Wang, Xuemin Lin, Jianzhong Li

*Corresponding author for this work

Research output: Chapter in Book/Conference Proceeding/ReportConference Paper published in a bookpeer-review

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.

Original languageEnglish
Title of host publicationAdvances in Web-Age Information Management - 6th International Conference, WAIM 2005, Proceedings
PublisherSpringer Verlag
Pages68-80
Number of pages13
ISBN (Print)3540292276, 9783540292272
DOIs
Publication statusPublished - 2005
Externally publishedYes
Event6th International Conference on Advances in Web-Age Information Management, WAIM 2005 - Hangzhou, China
Duration: 11 Oct 200513 Oct 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3739 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Conference on Advances in Web-Age Information Management, WAIM 2005
Country/TerritoryChina
CityHangzhou
Period11/10/0513/10/05

Fingerprint

Dive into the research topics of 'Subgraph join: Efficient processing subgraph queries on graph-structured XML document'. Together they form a unique fingerprint.

Cite this