Navegación

Búsqueda

Búsqueda avanzada

QL: Object-oriented Queries on Relational Data (Trabajo ya publicado)

Resumen:

Paper already published at: European Conference on Object-Oriented Programming (ECOOP) 2016 This paper describes QL, a language for querying complex, potentially recursive data structures. QL compiles to Datalog and runs on a standard relational database, yet it provides familiar-looking object-oriented features such as classes and methods, reinterpreted in logical terms: classes are logical properties describing sets of values, subclassing is implication, and virtual calls are dispatched dynamically by considering the most specific classes containing the receiver. Furthermore, types in QL are prescriptive and actively influence program evaluation rather than just describing it. In combination, these features enable the development of concise queries based on reusable libraries, which are written in a purely declarative style, yet can be efficiently executed even on very large data sets. In particular, we have used QL to implement static analyses for various programming languages, which scale to millions of lines of code.

Palabras Clave:

Code-exploration - Databases - Datalog - Logic Programming - Object-oriented programming - Queries - Relational Algebra - Static Analysis

Autor(es):

Handle:

11705/PROLE/2018/001

Descargas:

Este artículo tiene una licencia de uso CreativeCommons - Reconocimiento (by)

Descarga el artículo haciendo click aquí.