Storing and Querying Graph Data Using Efficient Relational Processing Techniques

作者: Sherif Sakr

DOI: 10.1007/978-3-642-01112-2_39

关键词:

摘要: 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 large database is fundamental performance issue in any graph-based application. Relational management systems (RDBMSs) repeatedly shown their success efficiency hosting types of which formerly not been anticipated to live inside relational databases complex objects XML data. The big advantages are its well-known maturity high scalability handle vast amounts very efficiently. In this paper, we investigate the different proposed schemes storing querying various kind using infrastructure. Moreover, how existing optimization techniques could be effectively utilized improve processing times relational-based queries. Finally, qualitatively evaluated our approaches an extensive set experiments.

参考文章(17)
Knowledge discovery in databases : pkdd 2005 Published in <b>2005</b> in New York NY) by Springer. ,(2005) , 10.1007/11564126
Jim Austin, Stefan Klinger, Chemical similarity searching using a neural graph matcher. the european symposium on artificial neural networks. pp. 479- 484 ,(2005)
Lei Zou, Lei Chen, Jeffrey Xu Yu, Yansheng Lu, A novel spectral coding in a large graph database extending database technology. pp. 181- 192 ,(2008) , 10.1145/1353343.1353369
Shirley Cohen, Patrick Hurley, Karl W. Schulz, William L. Barth, Brad Benton, Scientific formats for object-relational database systems ACM SIGMOD Record. ,vol. 35, pp. 10- 15 ,(2006) , 10.1145/1147376.1147378
Torsten Grust, Jan Rittinger, Jens Teubner, Why off-the-shelf RDBMSs are better at XPath than you might expect Proceedings of the 2007 ACM SIGMOD international conference on Management of data - SIGMOD '07. pp. 949- 958 ,(2007) , 10.1145/1247480.1247591
Xifeng Yan, Philip S. Yu, Jiawei Han, Graph indexing: a frequent structure-based approach international conference on management of data. pp. 335- 346 ,(2004) , 10.1145/1007568.1007607
Jeffrey Xu Yu, Philip S. Yu, Peixiang Zhao, Graph indexing: tree + delta <= graph very large data bases. pp. 938- 949 ,(2007)
Deng Cai, Zheng Shao, Xiaofei He, Xifeng Yan, Jiawei Han, Community Mining from Multi-relational Networks Knowledge Discovery in Databases: PKDD 2005. pp. 445- 452 ,(2005) , 10.1007/11564126_44
Goetz Graefe, Sorting And Indexing With Partitioned B-Trees conference on innovative data systems research. ,(2003)
Torsten Grust, Sherif Sakr, Jens Teubner, XQuery on SQL hosts very large data bases. pp. 252- 263 ,(2004) , 10.1016/B978-012088469-8.50025-5