Result: Extracting queries by static analysis of transparent persistence

Title:
Extracting queries by static analysis of transparent persistence
Authors:
WIEDERMANN, Ben, COOK, William R
Source:
POPL® 2007: The 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages®: Papers presented at the Symposium, January 17-19, 2007, Nice, FranceACM SIGPLAN notices. 42(1):199-210
Publisher Information:
Broadway, NY: ACM, 2007.
Publication Year:
2007
Physical Description:
print, 41 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Langages de programmation, Programming languages, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Systèmes d'information. Bases de données, Information systems. Data bases, Analyse programme, Program analysis, Análisis programa, Analyse son, Sound analysis, Análisis sonido, Analyse statique, Static analysis, Análisis estática, Base donnée relationnelle, Relational database, Base relacional dato, Chemin données, Data path, Camino datos, Génie logiciel, Software engineering, Ingeniería informática, Interprétation abstraite, Abstract interpretation, Interpretación Abstracta, Interrogation base donnée, Database query, Interrogación base datos, Langage base donnée, Database languages, Langage impératif, Imperative language, Lenguaje imperativo, Langage programmation, Programming language, Lenguaje programación, Optimisation, Optimization, Optimización, Persistance, Persistence, Persistencia, Recherche information, Information retrieval, Búsqueda información, Redondance, Redundancy, Redundancia, Système information ingénierie, Engineering information systems, Vérification programme, Program verification, Verificación programa, Databases, Languages, Performance, Programming Languages, Static Analysis
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Sciences, The University of Texas at Austin, United States
ISSN:
1523-2867
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18600654
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18600654
Database:
PASCAL Archive

Further Information

Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent data. When the data is stored in a relational database, however, transparent persistence does not naturally leverage the performance benefits of relational query optimization. We present a program analysis that combines the benefits of both approaches by extracting database queries from programs with transparent access to persistent data. The analysis uses a sound abstract interpretation of the original program to approximate the data traversal paths in the program and the conditions under which the paths are used. The resulting paths are then converted into a query, and the program is simplified by removing redundant tests. We study an imperative kernel language with read-only access to persistent data and identify the conditions under which the transformations can be applied. This analysis approach promises to combine the software engineering benefits of transparent data persistence with the performance benefits of database query optimization.