Implementing Graph Pattern Queries on a Relational Database

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

Lawrence Livermore National Laboratory

关键词: Pattern Recognition;    Diagrams;    Information Retrieval;    Performance;    99 General And Miscellaneous//Mathematics, Computing, And Information Science;   

DOI  :  10.2172/924192
RP-ID  :  LLNL-TR-400310
RP-ID  :  W-7405-ENG-48
RP-ID  :  924192

美国|英语

来源: UNT Digital Library

【 摘 要 】

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.