Abstract
We describe the core of a rule-based CQL, devoted to the manipulation of S-dimensional tabular databases. The rules provide a simple and declarative way to restructure and query tables, and the constraints allow to define cell contents by formulas over concrete domains. We define a model-theoretic semantics and develop an equivalent fixpoint theory that leads to a naive evaluation procedure.
Cite
CITATION STYLE
Hacid, M. S., Marcel, P., & Rigotti, C. (1996). A rule-based CQL for 2-dimensional tables. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1191, pp. 92–104). Springer Verlag. https://doi.org/10.1007/3-540-62501-1_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
