XRel: a path-based approach to storage and retrieval of XML documents using relational databases
ACM Transactions on Internet Technology (TOIT)
Accelerating XPath location steps
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Estimating the Selectivity of XML Path Expressions for Internet Scale Applications
Proceedings of the 27th International Conference on Very Large Data Bases
A Fast Index for Semistructured Data
Proceedings of the 27th International Conference on Very Large Data Bases
The VLDB Journal — The International Journal on Very Large Data Bases
Graph indexing: a frequent structure-based approach
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
STRG-Index: spatio-temporal region graph indexing for large video databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Closure-Tree: An Index Structure for Graph Queries
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
FIX: feature-based indexing technique for XML documents
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
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
A SQL: 1999 code generator for the pathfinder xquery compiler
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A novel spectral coding in a large graph database
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Dependable cardinality forecasts for XQuery
Proceedings of the VLDB Endowment
Community mining from multi-relational networks
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Relational index support for XPath axes
XSym'05 Proceedings of the Third international conference on Database and XML Technologies
An efficient features-based processing technique for supergraph queries
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
G-SPARQL: a hybrid engine for querying large attributed graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
On efficient processing of BPMN-Q queries
Computers in Industry
Efficient Multiview Maintenance under Insertion in Huge Social Networks
ACM Transactions on the Web (TWEB)
Hybrid query execution engine for large attributed graphs
Information Systems
| Hi-index | 0.00 |
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.