Schema-free static query template
US12117996B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Nov 9, 2022 |
| Grant date | Oct 15, 2024 |
| Priority date | — |
| Expiry date | Nov 10, 2042 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2455
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A schema-free static query template improves schema-free graph query performance and runtime stability. A user can customize a generated graph query while detecting a query tampering state. Schema-free query templates, which have been compile-time type/syntax/semantic checked by a dummy schema, are installed. The templates are called as if they are functions with their selected graph schema vertex types and edge types. The invocation generates a static query which uses input metadata to instantiate a static query, and goes through type/syntax/semantic checks to capture any input errors at compile time. If there is no error found during compile time, a query binary is generated only containing the metadata related to the parameters and sent to a query engine for execution. If a user later invokes the same query with the same metadata, the compiler matches the generated previous query, bypasses compilation, and goes directly to the existing binary code.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.