DocumentCode :
1805703
Title :
Querying Graph-Structured Data
Author :
Cheng, Jiefeng ; Yu, Jeffrey Xu
Author_Institution :
Chinese Univ. of Hong Kong, Hong Kong
fYear :
2007
fDate :
18-21 Sept. 2007
Firstpage :
23
Lastpage :
27
Abstract :
Graphs have great expressive power to describe the complex relationships among data objects, and there are large graph datasets available such as Web data, semi-structured data and XML data. In this paper, we describe our work on querying graph-structured data, including graph labeling methods, reachability joins, and graph pattern matching. We show that we can base on the graph labeling of complex XML and semi-structured data to process path queries and we devise join primitives for matching graph patterns. Novel aspects about using such join primitives for graph pattern matching are addressed.
Keywords :
XML; data structures; graph theory; pattern matching; query processing; XML data; data object relationship; graph labeling method; graph pattern matching; graph reachability join; graph-structured data querying; Clustering algorithms; Costs; Data analysis; Indexing; Labeling; Parallel processing; Pattern matching; Query processing; Tree graphs; XML;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Network and Parallel Computing Workshops, 2007. NPC Workshops. IFIP International Conference on
Conference_Location :
Liaoning
Print_ISBN :
978-0-7695-2943-1
Type :
conf
DOI :
10.1109/NPC.2007.166
Filename :
4351455
Link To Document :
بازگشت