An Algebra for Pomsets

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 different language primitives on the expressive power. We show that the use of partially ordered types increases the expressive power significantly. 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 fixpoint 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.

[1]  Victor Vianu,et al.  Tractable query languages for complex object databases , 1991, PODS '91.

[2]  John F. Canny,et al.  New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[3]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[4]  Joel E. Richardson,et al.  Supporting Lists in a Data Model (A Timely Approach) , 1992, VLDB.

[5]  Serge Abiteboul,et al.  Generic Computation and its complexity , 1991, STOC '91.

[6]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[7]  Peter Buneman,et al.  Structural Recursion as a Query Language , 1992, DBPL.

[8]  Catriel Beeri,et al.  On the power of languages for manipulation of complex objects , 1987, VLDB 1987.

[9]  Yuri Gurevich,et al.  Algebras of feasible functions , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[10]  Tova Milo,et al.  Towards tractable algebras for bags , 1993, PODS '93.

[11]  Martin Otto,et al.  Inductive Definability with Counting on Finite Structures , 1992, CSL.

[12]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[13]  Catriel Beeri,et al.  Algebraic Optimization of Object-Oriented Query Languages , 1990, Theor. Comput. Sci..

[14]  Saharon Shelah,et al.  Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[15]  Barry E. Jacobs,et al.  On Database Logic , 1982, JACM.

[16]  Limsoon Wong,et al.  New techniques for studying set languages, bag languages and aggregate functions , 1994, PODS '94.

[17]  Catriel Beeri,et al.  Functional and predictive programming in OODB's , 1992, PODS '92.

[18]  Serge Abiteboul,et al.  Object identity as a query language primitive , 1989, SIGMOD '89.

[19]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[20]  Stanley B. Zdonik,et al.  Ordered Types in the AQUA Data Model , 1993, DBPL.

[21]  Jianwen Su,et al.  On the expressive power of database queries with intermediate types , 1988, PODS '88.

[22]  Serge Abiteboul,et al.  A rule-based language with functions and sets , 1991, TODS.

[23]  Jan Van den Bussche,et al.  The expressive power of structured values in pure OODB's , 1991, PODS 1991.

[24]  Vaughan R. Pratt,et al.  The Pomset Model of Parallel Processes: Unifying the Temporal and the Spatial , 1984, Seminar on Concurrency.

[25]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[26]  Serge Abiteboul,et al.  Querying and Updating the File , 1993, VLDB.

[27]  Peter Buneman,et al.  Workshop on Database Programming Languages , 1988 .

[28]  Jianwen Su,et al.  Untyped sets, invention, and computable queries , 1989, PODS '89.

[29]  Tova Milo,et al.  Calculi for Bags and their Complexity , 1993, DBPL.

[30]  Hamid Pirahesh,et al.  The Magic of Duplicates and Aggregates , 1990, VLDB.

[31]  Val Tannen,et al.  Logical and Computational Aspects of Programming with Sets/Bags/Lists , 1991, ICALP.

[32]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[33]  Dan Suciu.  Bounded Fixpoints for Complex Objects , 1993 .

[34]  Jeffrey F. Naughton,et al.  On the Computation of Multidimensional Aggregates , 1996, VLDB.

[35]  Joseph Albert,et al.  Algebraic Properties of Bag Data Types , 1991, VLDB.

[36]  Gabriel M. Kuper,et al.  A new approach to database logic , 1984, PODS.