Solving ORM by MAGIC: Mapping generation and composition

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Object-relational mapping (ORM) technologies have been proposed as a solution for the impedance mismatch problem between object-oriented applications and relational databases. Existing approaches use special-purpose mapping languages or are tightly integrated with the programming language. In this paper, we present MAGIC, an approach using bidirectional query and update views, based on a generic metamodel and a generic mapping language. The mapping language is based on second-order tuple-generating dependencies and allows arbitrary restructuring between the application model and the database schema. Due to the genericity of our approach, the core part including mapping generation and mapping composition is independent of the modeling languages being employed. We show the formal basis of MAGIC and how queries including aggregation can be defined using an easy to use query API. The scalability of our approach is shown in the evaluation using the TPC benchmark. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Kensche, D., Quix, C., Li, X., & Geisler, S. (2010). Solving ORM by MAGIC: Mapping generation and composition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6348 LNCS, pp. 118–132). https://doi.org/10.1007/978-3-642-16092-9_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free