Abstract
Graphs are widely used for modelling complicated data such as: chemical compounds, protein interactions, XML documents and multimedia. Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications such as drug discovery and structural pattern recognition. Relational database management systems (RDBMSs) have repeatedly been shown to be able to efficiently host different types of data which were not formerly anticipated to reside within relational databases such as complex objects and XML data.The key advantages of relational database systems are its well-known maturity and its ability to scale to handle vast amounts of data very efficiently. RDMBSs derive much of their performance from sophisticated optimizer components which makes use of physical properties that are specific to the relational model such as: sortedness, proper join ordering and powerful indexing mechanisms. In this paper, we study the problem of indexing and querying graph databases using the relational infrastructure. We propose a novel, decomposition-based and selectivity-aware SQL translation mechanism of sub-graph search queries. Moreover, we carefully exploit existing database functionality such as partitioned B-trees indexes and influencing the relational query optimizers by selectivity annotations to reduce the access costs of the secondary storage to a minimum. Finally, our experiments utilise an IBM DB2 RDBMS as a concrete example to confirm that relational database systems can be used as an efficient and very scalable processor for sub-graph queries.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
DBLP XML Records, http://dblp.uni-trier.de/xml/
Aboulnaga, A., Alameldeen, A., Naughton, J.: Estimating the Selectivity of XML Path Expressions for Internet Scale Applications. In: VLDB (2001)
Cai, D., Shao, Z., He, X., Yan, X., Han, J.: Community Mining from Multi-relational Networks. In: PPKDD (2005)
Clark, J., DeRose, S.: XPath 1.0: XML Path Language (XPath) (November 1999), http://www.w3.org/TR/xpath
Cooper, B., Sample, N., Franklin, M., Hjaltason, G., Shadmon, M.: A Fast Index for Semistructured Data. In: VLDB (2001)
Yoshikawa, M., et al.: XRel: a path-based approach to storage and retrieval of XML documents using relational databases. TOIT 1(1) (2001)
Cohen, S., et al.: Scientific formats for object-relational database systems: a study of suitability and performance. SIGMOD Record 35(2) (2006)
Botea, V., et al.: PIST: An Efficient and Practical Indexing Technique for Historical Spatio-Temporal Point Data. GeoInformatica 12(2) (2008)
Giugno, R., Shasha, D.: GraphGrep: A Fast and Universal Method for Querying Graphs. In: International Conference in Pattern recognition (2002)
Graefe, G.: Sorting And Indexing With Partitioned B-Trees. In: CIDR (2003)
Grust, T.: Accelerating XPath location steps. In: SIGMOD, pp. 109–120 (2002)
Grust, T., Mayr, M., Rittinger, J., Sakr, S., Teubner, J.: A SQL: 1999 code generator for the pathfinder xquery compiler. In: SIGMOD (2007)
Grust, T., Rittinger, J., Teubner, J.: Why Off-The-Shelf RDBMSs are Better at XPath Than You Might Expect. In: SIGMOD (2007)
Grust, T., Sakr, S., Teubner, J.: XQuery on SQL Hosts. In: VLDB (2004)
He, H., Singh, A.: Closure-Tree: An Index Structure for Graph Queries. In: ICDE (2006)
Klinger, S., Austin, J.: Chemical similarity searching using a neural graph matcher. In: European Symposium on Artificial Neural Networks (2005)
Kuramochi, M., Karypis, G.: Frequent Subgraph Discovery. In: ICDM (2001)
Lee, J., Oh, J., Hwang, S.e.: STRG-Index: Spatio-Temporal Region Graph Indexing for Large Video Databases. In: SIGMOD (2005)
Sakr, S.: Algebraic-Based XQuery Cardinality Estimation. IJWIS 4(1) (2008)
Teubner, J., Grust, T., Maneth, S., Sakr, S.: Dependable Cardinality Forecasts in an Algebraic XQuery Compiler. In: VLDB (2008)
Türker, C., Gertz, M.: Semantic integrity support in SQL: 1999 and commercial (object-)relational database management systems. VLDB J. 10(4) (2001)
Yan, X., Yu, P., Han, J.: Graph indexing: a frequent structure-based approach. In: SIGMOD (2004)
Yuen, L., Poon, C.: Relational Index Support for XPath Axes. In: International XML Database Symposium (2005)
Zhang, N., Özsu, T., Ilyas, I., Aboulnaga, A.: FIX: Feature-based Indexing Technique for XML Documents. In: VLDB (2006)
Zhang, S., Hu, M., Yang, J.: TreePi: A Novel Graph Indexing Method. In: ICDE (2007)
Zhao, P., Xu Yu, J., Yu, P.: Graph indexing: tree + delta = graph. In: VLDB (2007)
Zou, L., Chen, L., Xu Yu, J., Lu, Y.: GString: A novel spectral coding in a large graph database. In: EDBT (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakr, S. (2009). GraphREL: A Decomposition-Based and Selectivity-Aware Relational Framework for Processing Sub-graph Queries. In: Zhou, X., Yokota, H., Deng, K., Liu, Q. (eds) Database Systems for Advanced Applications. DASFAA 2009. Lecture Notes in Computer Science, vol 5463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00887-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-00887-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00886-3
Online ISBN: 978-3-642-00887-0
eBook Packages: Computer ScienceComputer Science (R0)