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

Authors:
Hongzhi Wang;Wei Wang;Xuemin Lin;Jianzhong Li
Affiliations:
University of New South Wales, Australia;University of New South Wales, Australia;University of New South Wales, Australia;Harbin Institute of Technology, Harbin, China
Venue:
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Year:
2005

Citing 18
Cited 1

Efficient management of transitive relationships in large data and knowledge bases

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Dynamic reachability in planar digraphs with one source and one sink

Theoretical Computer Science
On supporting containment queries in relational database management systems

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Efficient subtyping tests with PQ-encoding

OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Reachability and distance queries via 2-hop labels

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A comparison of labeling schemes for ancestor queries

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Accelerating XPath location steps

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Covering indexes for branching path queries

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Small Induced-Universal Graphs and Compact Implicit Graph Representations

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Index Structures for Path Expressions

ICDT '99 Proceedings of the 7th International Conference on Database Theory
Indexing and Querying XML Data for Regular Path Expressions

Proceedings of the 27th International Conference on Very Large Data Bases
On labeling schemes for the semantic web

WWW '03 Proceedings of the 12th international conference on World Wide Web
Structural Joins: A Primitive for Efficient XML Query Pattern Matching

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Twig query processing over graph-structured XML data

Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Efficient structural joins on indexed XML documents

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XMark: a benchmark for XML data management

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Holistic twig joins on indexed XML documents

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29

Cost-based query optimization for multi reachability joins

DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications

Quantified Score

Hi-index	0.00

Visualization

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 graph-structured 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.