DocumentCode :
612176
Title :
SuReQL: A subgraph match based relational model for large graphs
Author :
Shijie Zhang ; Jiong Yang ; Sun, B.
Author_Institution :
EECS Dept., Case Western Reserve Univ., Cleveland, OH, USA
fYear :
2013
fDate :
8-12 April 2013
Firstpage :
212
Lastpage :
215
Abstract :
Due to the emergence of social networks and biological networks, large graph management and analysis becomes a research area with growing interests. In this paper, we study the problem of modelling large graphs. A subgraph match based relational model is designed to represent a large graph. In this model, subgraphs are considered as virtual relations; subgraph matches could be viewed as tuples; and vertices are treated as attributes. A set of relational algebra operators are defined on this model so that the model is relationally complete. An SQL-like query language, namely SuReQL, is invented to provide an easy interface to query the large graphs.
Keywords :
SQL; graph theory; relational algebra; relational databases; SQL-like query language; SuReQL; biological network; graph vertex; large graph analysis; large graph management; large graph querying; large graph representation; relational algebra operator; social network; subgraph match based relational model; tuples; virtual relations; Algebra; Biological system modeling; Database languages; Databases; Pattern matching; Proteins; Syntactics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Engineering Workshops (ICDEW), 2013 IEEE 29th International Conference on
Conference_Location :
Brisbane, QLD
Print_ISBN :
978-1-4673-5303-8
Electronic_ISBN :
978-1-4673-5302-1
Type :
conf
DOI :
10.1109/ICDEW.2013.6547452
Filename :
6547452
Link To Document :
بازگشت