Implementing Graph Pattern Queries on a Relational Database

Technical Report · Wed Dec 26 00:00:00 EST 2007

DOI:https://doi.org/10.2172/924192· OSTI ID:924192

Kaplan, I L; Abdulla, G M; Brugger, S T; Kohn, S R

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.

• Research Organization: Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
• Sponsoring Organization: USDOE
• DOE Contract Number: W-7405-ENG-48
• OSTI ID: 924192
• Report Number(s): LLNL-TR-400310; TRN: US200806%%311
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
PERFORMANCE
DIAGRAMS
INFORMATION RETRIEVAL
PATTERN RECOGNITION