An algebra for pomsets [chapter]

Stéphane Grumbach, Tova Milo
1995 Lecture Notes in Computer Science  
We study languages for manipulating partially ordered structures with duplicates (e.g. trees, lists). As a general framework, we consider the pomset (partially ordered multiset) datatype. We introduce an algebra for pomsets, which generalizes traditional algebras for (nested) sets, bags and lists. This paper is motivated by the study of the impact of di erent language primitives on the expressive power. We show that the use of partially ordered types increases the expressive power signi cantly.
more » ... Surprisingly, it turns out that the algebra when restricted to both unordered (bags) and totally ordered (lists) intermediate types, yields the same expressive power as xpoint logic with counting on relational databases. It therefore constitutes a rather robust class of relational queries. On the other hand, we obtain a characterization of PTIME queries on lists by considering only totally ordered types.
doi:10.1007/3-540-58907-4_16 fatcat:dydnv63vmzh35oofg4lhu6z5pi