Graph Query Language: Difference between revisions

Revision as of 13:49, 9 May 2024

Revision as of 15:01, 9 May 2024

Line 122:

=== PGQL ===

PGQL<ref name="PGQL Grades">{{cite journal|url=https://dl.acm.org/citation.cfm?id=2960421/|title=''PGQL: a property graph query language''. In |journal=Proceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems (GRADES '16). ACM, New York, NY, USA. DOI: 10.1145/2960414.2960421|last=van Rest|first=Oskar|display-authors=etal|date=June 2016|publisher=ACM|doi=10.1145/2960414.2960421|s2cid=6806901|access-date=October 25, 2019}}</ref>

is a language designed and implemented by Oracle Inc., but made available as an open source specification,<ref name="PGQL spec">{{cite web|url=http://pgql-lang.org/|title=PGQL|publisher=pgql.org|access-date=October 6, 2019}}</ref> along with JVM parsing software.<ref name="PGQL parser">{{cite web|url=https://github.com/oracle/pgql-lang|title=''PGQL is an SQL-based query language for the Property Graph data model''. |last=van Rest|first=Oskar|display-authors=etal|date=September 2015|publisher=pgql.org|access-date=November 3, 2019}}</ref> PGQL combines familiar SQL SELECT syntax including SQL expressions and result ordering and aggregation with a pattern matching language very similar to that of Cypher. It allows the specification of the graph to be queried, and includes a facility for macros to capture "pattern views", or named sub-patterns. It does not support insertion or updating operations, having been designed primarily for an analytics environment, such as Oracle's PGX product. PGQL has also been implemented in Oracle Big Data Spatial and Graph, and in a research project, PGX.D/Async.<ref name="PGQL PGX.D">{{cite journal|url=https://dl.acm.org/citation.cfm?doid=3078447.3078454/|title=''PGX.D/Async: A Scalable Distributed Graph Pattern Matching Engine''. In |journal=Proceedings of the Fifth International Workshop on Graph Data-management Experiences & Systems (GRADES'17). ACM, New York, NY, USA, Article 7, 6 pages. DOI: 10.1145/3078447.3078454|last=Roth|first=Nicholas P.|display-authors=etal|date=2017|publisher=ACM|doi=10.1145/3078447.3078454|s2cid=26283328|access-date=October 29, 2019}}</ref>

=== G-CORE===