DOE OSTI · 924192
Implementing Graph Pattern Queries on a Relational Database
Abstract
When a graph database is implemented on top of a relational database, queries in the graph query language are translated into relational SQL queries. Graph pattern queries are an important feature of a graph query language. Translating graph pattern queries into single SQL statements results in very poor query performance. By taking into account the pattern query structure and generating multiple SQL statements, pattern query performance can be dramatically improved. The performance problems encountered with the single SQL statements generated for pattern queries reflects a problem in the SQL query planner and optimizer. Addressing this problem would allow relational databases to better support semantic graph databases. Relational database systems that provide good support for graph databases may also be more flexible platforms for data warehouses.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Kaplan, I L, Abdulla, G M, Brugger, S T, Kohn, S R. 2007-12-26. Implementing Graph Pattern Queries on a Relational Database. https://doi.org/10.2172/924192. https://engineeringpapers.com/record/osti%3A924192/implementing-graph-pattern-queries-on-a-relational-database
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.