An algebra for pomsets

Extended abstract
  • Stéphane Grumbach
  • Tova Milo
Contributed Papers Query Languages II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 893)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AB87]
    S. Abiteboul and C. Beeri. On the power of languages for the manipulation of complex objects. In Proc. Int. Workshop on Theory and Applications of Nested Relations and Complex Objects (extended abstract), Darmstadt, 1987. INRIA research report n 846.Google Scholar
  2. [ACM93]
    S. Abiteboul, S. Cluet, and T. Milo. Querying and updating the file. In Proc. 19th Int'l Conf. on Very Large Data Bases, 1993.Google Scholar
  3. [AK89]
    S. Abiteboul and P. Kanellakis. Object identity as a query language primitive. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 159–173, 1989.Google Scholar
  4. [AV91]
    S. Abiteboul and V. Vianu. Generic computation and its complexity. In Proc. ACM Symp. on Theory of Computing, New Orleans, May 1991.Google Scholar
  5. [BM92]
    C. Beeri and T. Milo. Functional and predicative programming in oodb's. In Proc. 11th Symp. on Principles of Database Systems, San Diego, 1992.Google Scholar
  6. [BP91]
    J. Van Den Bussche and J. Paredaens, The expressive power of structured values in pure oodb's. In Proc. 10th Symp. on Principles of Database Systems, 1991.Google Scholar
  7. [BTBN91]
    V. Breazu-Tannen, P. Buneman, and S. Naqvi. Structural recursion as a query language. In Proc. 3rd Int. Workshop on database programming languages, pages 9–19, Nafplion, Aug. 1991. Morgan Kaufman.Google Scholar
  8. [CH80]
    A. Chandra and D. Harel. Computable Queries for Relational Data Bases. Journal of Computer and System Sciences, 21(2):156–178, Oct. 1980.CrossRefGoogle Scholar
  9. [CRSV94]
    L.S. Colby, E.L. Robertson, L.V. Saxton and D. Van Gucht. A Query Language for List Based Complex-Objects. In Proc. 13th ACM Symp. on Principles of Database Systems, pages 179–189, Minneapolis, May 1993.Google Scholar
  10. [GM93]
    S. Grumbach and T. Milo. Towards tractable algebras for bags. In Proc. 12th ACM Symp. on Principles of Database Systems, pages 49–58, Washington, May 1993.Google Scholar
  11. [GMK93]
    S. Grumbach, T. Milo, and Y. Kornatzky. Calculi for bags and their complexity. In 4th Int. Workshop on Database Programming Languages, New-York City, Septembre 1993. Morgan Kaufmann.Google Scholar
  12. [GO93]
    E. Graedel and M. Otto. Inductive definability with counting on finite structures. In Proc. of Computer Science Logic 92, pages 231–247. LNCS, n702, 1993.Google Scholar
  13. [GV90]
    S. Grumbach and V. Vianu. Playing games with objects. In Proc. Int. Conf. on Database Theory, pages 25–38, Paris, dec 1990.Google Scholar
  14. [GV91]
    S. Grumbach and V. Vianu. Tractable query languages for complex object databases. In Proc. 10th ACM Symp. on Principles of Database Systems, pages 315–327, Boulder, May 1991.Google Scholar
  15. [GW92]
    S. Ginsburg and X. Wang. Towards a unified approach to querying sequenced data. In Proc. 11th ACM Symp. on Principles of Database Systems, pages 293–300, San Diego, 1992.Google Scholar
  16. [HS88]
    R. Hull and J. Su. On the expressive power of database queries with intermediate types. In Proc. 7th ACM Symp. on Principles of Database Systems, 1988.Google Scholar
  17. [HS89]
    R. Hull and J. Su. Untyped Sets, Invention and Computable Queries. In Proc. 8th ACM Symp. on Principles of Database Systems, 1989.Google Scholar
  18. [HT74]
    J.E. Hopcroft and R.E. Tarjan. Efficient planarity testing. J. of the ACM, 21:549–568, 1974.Google Scholar
  19. [HW74]
    J.E. Hopcroft and J.K. Wong. Linear time algorithm for isomorphism of planar graphs. In Proc 6th ACM Symp. on Theory of Computing, pages 172–184, 1974.Google Scholar
  20. [Imm86]
    N. Immerman. Relational queries computable in polynomial time. Inf. and Control, 68:86–104, 1986.Google Scholar
  21. [LW94]
    L. Libkin, L. Wong. New Techniques for Studying Set Languages, Bag Languages, and Aggregate Functions. In Proc. 13th ACM Symp. on Principles of Database Systems, pages 155–166, Minneapolis, May 1993.Google Scholar
  22. [Moh89]
    R. H. Mohring. Algorithms and Order, I. Rival Ed., chapter Computationally Tractable Classes of ordered Sets, pages 105–193. Kluwer Academic Publishers, 1989.Google Scholar
  23. [Pra84]
    V. Pratt. The pomset model of parallel processes: Unifying the temporal and the spatial. In Seminar on Concurrency, pages 180–196, Pittsburgh, 1984. LNCS 197.Google Scholar
  24. [Ric92]
    J. Richardson. Supporting lists in a data model (a timely approach). In Proc. 18th Intl. Conf. on Very Large Databases, Vancouver, 1992.Google Scholar
  25. [Suc93]
    D. Suciu. Bounded fixpoints for complex objects. In 4th Int. Workshop on Database Programming Languages, New-York City, Septembre 1993. Morgan Kaufmann.Google Scholar
  26. [SZL93]
    B. Subramanian, S. B. Zdonik, and T. W. Leung. Ordered types in the aqua data model. In 4th Int. Workshop on Database Programming Languages, New-York City, Septembre 1993. Morgan Kaufmann.Google Scholar
  27. [U1188]
    J.D. Ullman. Database and Knowledge Base Systems. Computer Science Press, 1988.Google Scholar
  28. [Var82]
    M. Vardi. The Complexity of Relational Query Languages. In Proc. 14th ACM Symp. on Theory of Computing, pages 137–146, 1982.Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Stéphane Grumbach
    • 1
  • Tova Milo
    • 2
  1. 1.I.N.R.I.A. RocquencourtFrance
  2. 2.Dept. Computer ScienceTel-Aviv UniversityTel-AvivIsrael

Personalised recommendations