Method and system for verifying resulting behavior of graph query language
US11741000B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 16, 2021 |
| Grant date | Aug 29, 2023 |
| Priority date | — |
| Expiry date | Aug 16, 2041 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY02D10/00
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Disclosed are a method and system for verifying a resulting behavior of a graph query language. A lexical parser and a preset lexical rule are added to a BDD test framework, to construct an improved BDD test framework; a first Gherkin text in a graph query language standard is migrated to be a second Gherkin text in a graph query language; a first parsing result of the second Gherkin text is acquired from the improved BDD test framework; a first return result from a graph database is acquired, a comparison result between the first parsing result and the first return result is acquired, wherein the graph query language meets the graph query language standard if the first parsing result and the first return result are the same. The present disclosure solves the problem that the BDD test framework cannot recognize complex Gherkin texts, thereby facilitating development of graph databases.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.