Using maude rewriting system to modularize and extend SQL

Authors:
Ścibor Sobieski;Bartosz Zieliński
Affiliations:
University of Łodź, Łódź, Poland;University of Łodź, Łódź, Poland
Venue:
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Year:
2013

Citing 8
Cited 0

Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations

Theoretical Computer Science
Membership algebra as a logical framework for equational specification

WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Industrial applications of ASF+SDF

Industrial applications of ASF+SDF
The rewriting logic semantics project

Theoretical Computer Science
Maude's module algebra

Science of Computer Programming
The maude 2.0 system

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Conceptual data modeling with constraints in maude

CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Modularisation in maude of parametrized RBAC for row level access control

ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the deficiencies of SQL is that it allows little practical support for factoring, parametrization and modularization of complex SQL statements. Using dynamic SQL or macroprocessors for this purpose is error prone and inconvenient. This paper shows how the rewriting systems such as Maude can be used to build better SQL preprocessors which understand the SQL syntax and thus reduce the possibility of error. Rewriting systems also allow creating of language extensions supporting modularity and data model abstractions. We use as an example the Maude based system currently developed at our department.