Systematic generation of non-equivalent expressions for relational algebra

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

Abstract

Relational algebra forms the semantic foundation in multiple domains, e.g., Alloy models, OCL constraints, UML metamodels, and SQL queries. Synthesis and repair techniques in such domains require an efficient procedure to generate (non-equivalent) expressions subject to relational constraints, e.g., the types of sets and relations, their cardinality, size of expressions, maximum arity of the intermediate expressions, etc. This paper introduces the first generator for relational expressions that are non-equivalent with respect to the semantics of relational algebra. We present the algorithms that define our generator, its embodiment based on the Alloy tool-set, and an experimental evaluation to show the effectiveness of its non-equivalent generation for a variety of problems with relational constraints.

Cite

CITATION STYLE

APA

Wang, K., Sullivan, A., Koukoutos, M., Marinov, D., & Khurshid, S. (2018). Systematic generation of non-equivalent expressions for relational algebra. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10817 LNCS, pp. 105–120). Springer Verlag. https://doi.org/10.1007/978-3-319-91271-4_8

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