Linear vs. order constraint queries over rational databases (extended abstract)
Alexei P. Stolboushkin, Michael A. Taitslin · 1996
We consider relational databases organized over an ordered domain with some additional relations---a typical example is the ordered domain of rational numbers together with the ternary relation + of addition. In the focus of our study are the first order queries that are invariant under order-preserving "permutations"---such queries are called (order-)generic. We show that for an arbitrary ordered divisible Abelian group order-generic queries fail to express more than pure order queries, and that, moreover, the generic queries can be effectively translated into pure order queries. For example, every order-generic query over rational numbers with + can be effectively rewritten without +. An important difference of this paper from a recent series of related pape...