Storing and Querying Graph Data Using Efficient Relational Processing Techniques

Graphs have become increasingly used for modelling complicated data such as: chemical compounds, protein interactions and social networks. Retrieving related graphs containing a query graph from a large graph database is a fundamental performance issue in any graph-based application. Relational database management systems (RDBMSs) have repeatedly shown their success and efficiency in hosting types of data which have formerly not been anticipated to live inside relational databases such as: complex objects and XML data. The big advantages of relational database systems are its well-known maturity and its high scalability to handle vast amounts of data very efficiently. In this paper, we investigate the efficiency of different proposed schemes for storing and querying various kind of graphs using the relational infrastructure. Moreover, we investigate how existing relational query optimization techniques could be effectively utilized to improve the processing times of relational-based processing of graph queries. Finally, we have qualitatively evaluated our proposed approaches using an extensive set of experiments.

[1]  Philip S. Yu,et al.  Graph Indexing: Tree + Delta >= Graph , 2007, VLDB.

[2]  Jeffrey F. Naughton,et al.  Estimating the Selectivity of XML Path Expressions for Internet Scale Applications , 2001, VLDB.

[3]  Philip S. Yu,et al.  Graph indexing: a frequent structure-based approach , 2004, SIGMOD '04.

[4]  Dennis Shasha,et al.  GraphGrep: A fast and universal method for querying graphs , 2002, Object recognition supported by user interaction for service robots.

[5]  Wei Wang,et al.  Mining protein family specific residue packing patterns from protein structure graphs , 2004, RECOMB.

[6]  Jörg Sander,et al.  PIST: An Efficient and Practical Indexing Technique for Historical Spatio-Temporal Point Data , 2008, GeoInformatica.

[7]  Karl W. Schulz,et al.  Scientific formats for object-relational database systems: a study of suitability and performance , 2006, SGMD.

[8]  Goetz Graefe,et al.  Sorting And Indexing With Partitioned B-Trees , 2003, CIDR.

[9]  Torsten Grust,et al.  Why off-the-shelf RDBMSs are better at XPath than you might expect , 2007, SIGMOD '07.

[10]  Toshiyuki Amagasa,et al.  XRel: a path-based approach to storage and retrieval of XML documents using relational databases , 2001, ACM Trans. Internet Techn..

[11]  Luís Torgo,et al.  Knowledge Discovery in Databases: PKDD 2005, 9th European Conference on Principles and Practice of Knowledge Discovery in Databases, Porto, Portugal, October 3-7, 2005, Proceedings , 2005, PKDD.

[12]  Shijie Zhang,et al.  TreePi: A Novel Graph Indexing Method , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[13]  Lei Zou,et al.  A novel spectral coding in a large graph database , 2008, EDBT '08.

[14]  M. Tamer Özsu,et al.  FIX: feature-based indexing technique for XML documents , 2006, VLDB.

[15]  Jiawei Han,et al.  Community Mining from Multi-relational Networks , 2005, PKDD.

[16]  Sherif Sakr,et al.  XQuery on SQL Hosts , 2004, VLDB.

[17]  Jim Austin,et al.  Chemical similarity searching using a neural graph matcher , 2005, ESANN.