Implementing Graph Pattern Queries on a Relational Database [electronic resource].
- Washington, D.C. : United States. Dept. of Energy, 2007.
Oak Ridge, Tenn. : Distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy.
- Physical Description:
- PDF-file: 27 pages; size: 1 Mbytes
- Additional Creators:
- Lawrence Berkeley National Laboratory
United States. Department of Energy
United States. Department of Energy. Office of Scientific and Technical Information
- 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.
- Published through SciTech Connect.
Kaplan, I L; Abdulla, G M; Kohn, S R; Brugger, S T.
- Funding Information:
View MARC record | catkey: 14344376