Algebraic optimization of recursive queries

Over the past few years, much attention has been paid to deductive databases. They offer a logic-based interface, and allow formulation of complex recursive queries. However, they do not offer appropriate update facilities, and do not support existing applications. To overcome these problems an SQL-like interface is required besides a logic-based interface.\ud \ud In the PRISMA project we have developed a tightly-coupled distributed database, on a multiprocessor machine, with two user interfaces: SQL and PRISMAlog. Query optimization is localized in one component: the relational query optimizer. Therefore, we have defined an eXtended Relational Algebra that allows recursive query formulation and can also be used for expressing executable schedules, and we have developed algebraic optimization strategies for recursive queries. In this paper we describe an optimization strategy that rewrites regular (in the context of formal grammars) mutually recursive queries into standard Relational Algebra and transitive closure operations. We also describe how to push selections into the resulting transitive closure operations.\ud \ud The reason we focus on algebraic optimization is that, in our opinion, the new generation of advanced database systems will be built starting from existing state-of-the-art relational technology, instead of building a completely new class of systems

A survey of parallel execution strategies for transitive closure and logic programs

An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods

Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories

Cyclic data structures, such as cyclic lists, in functional programming are tricky to handle because of their cyclicity. This paper presents an investigation of categorical, algebraic, and computational foundations of cyclic datatypes. Our framework of cyclic datatypes is based on second-order algebraic theories of Fiore et al., which give a uniform setting for syntax, types, and computation rules for describing and reasoning about cyclic datatypes. We extract the "fold" computation rules from the categorical semantics based on iteration categories of Bloom and Esik. Thereby, the rules are correct by construction. We prove strong normalisation using the General Schema criterion for second-order computation rules. Rather than the fixed point law, we particularly choose Bekic law for computation, which is a key to obtaining strong normalisation. We also prove the property of "Church-Rosser modulo bisimulation" for the computation rules. Combining these results, we have a remarkable decidability result of the equational theory of cyclic data and fold.Comment: 38 page

On the algebraic structure of rational discrete dynamical systems

We show how singularities shape the evolution of rational discrete dynamical systems. The stabilisation of the form of the iterates suggests a description providing among other things generalised Hirota form, exact evaluation of the algebraic entropy as well as remarkable polynomial factorisation properties. We illustrate the phenomenon explicitly with examples covering a wide range of models

Functional declarative language design and predicate calculus: A practical approach

A

Hopf algebras in dynamical systems theory

The theory of exact and of approximate solutions for non-autonomous linear differential equations forms a wide field with strong ties to physics and applied problems. This paper is meant as a stepping stone for an exploration of this long-established theme, through the tinted glasses of a (Hopf and Rota-Baxter) algebraic point of view. By reviewing, reformulating and strengthening known results, we give evidence for the claim that the use of Hopf algebra allows for a refined analysis of differential equations. We revisit the renowned Campbell-Baker-Hausdorff-Dynkin formula by the modern approach involving Lie idempotents. Approximate solutions to differential equations involve, on the one hand, series of iterated integrals solving the corresponding integral equations; on the other hand, exponential solutions. Equating those solutions yields identities among products of iterated Riemann integrals. Now, the Riemann integral satisfies the integration-by-parts rule with the Leibniz rule for derivations as its partner; and skewderivations generalize derivations. Thus we seek an algebraic theory of integration, with the Rota-Baxter relation replacing the classical rule. The methods to deal with noncommutativity are especially highlighted. We find new identities, allowing for an extensive embedding of Dyson-Chen series of time- or path-ordered products (of generalized integration operators); of the corresponding Magnus expansion; and of their relations, into the unified algebraic setting of Rota-Baxter maps and their inverse skewderivations. This picture clarifies the approximate solutions to generalized integral equations corresponding to non-autonomous linear (skew)differential equations.Comment: International Journal of Geometric Methods in Modern Physics, in pres

Fast Arithmetics in Artin-Schreier Towers over Finite Fields

An Artin-Schreier tower over the finite field F_p is a tower of field extensions generated by polynomials of the form X^p - X - a. Following Cantor and Couveignes, we give algorithms with quasi-linear time complexity for arithmetic operations in such towers. As an application, we present an implementation of Couveignes' algorithm for computing isogenies between elliptic curves using the p-torsion.Comment: 28 pages, 4 figures, 3 tables, uses mathdots.sty, yjsco.sty Submitted to J. Symb. Compu