Compiling nested relational algebras with multiple intermediate representations
US9292267B2 · kind B2 · utility
1Cited by
4References
16Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jun 27, 2014 |
| Grant date | Mar 22, 2016 |
| Priority date | — |
| Expiry date | Jun 27, 2034 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F8/44
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Aspects of the present invention provide a solution for compiling data. In an embodiment, an input query is received in a first language. The input query is translated to a nested relational algebra (NRA) in the form of a first intermediate representation (IR), wherein the first IR comprises a high-level functional language including algebraic operators. A set of algorithms of the algebraic operators is implemented to compile at least some of the first IR into a second IR, wherein the second IR comprises a data-flow language. At least one of the first IR and the second IR is compiled into a low-level code.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.