An Algebra for Pomsets

Information and Computation

Volumn 150, Issue 2, 1999, Pages 268-306

  Grumbach, Stéphane ^a   Milo, Tova ^b  

^a INRIA   (France)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347565242     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2777     Document Type: Article

References (44)

1. Abiteboul, S., and Beeri, C. (1995), On the power of languages for the manipulation of complex objects, Very Large Data Bases J. 4(4), 727-794.
2. Abiteboul, S., Cluet, S., and Milo, T. (1993), Querying and updating the file, in "Proc. 19th Intl Conf. on Very Large Data Bases," pp. 73-84.
3. Abiteboul, S., and Grumbach, S. (1991), A rule based language with functions and sets, ACM Trans. Database Systems 16(1), 1-30.
4. Abiteboul, S. Hull, R., and Vianu, V. (1994), "Foundations of Databases," Addison-Wesley, Reading, MA.
5. Abiteboul, S., and Kanellakis, P. (1989), Object identity as a query language primitive, in "Proc. ACM SIGMOD Int. Conf. on Management of Data," pp. 159-173.
6. Albert, J. (1991), Algebraic properties of bag data types, in "Proc. 17th Int'l Conf. on Very Large Data Bases," pp. 211-219.
7. Abiteboul, S., and Vianu, V. (1991), Generic computation and its complexity, in "Proc. ACM Symp. on Theory of Computing," pp. 209-219, New Orleans.
8. Breazu-Tannen, V., Buneman, P., and Naqvi, S. (1991), Structural recursion as a query language, in "Proc. 3rd Int. Workshop on Database Programming Languages," pp. 9-19, Nafplion, Morgan Kaufman, San Mateo, CA.
9. Beeri, C., and Kornatzky, Y. (1990), Algebraic optimization of object oriented query languages, in "Proc. 3rd Intl. Conf. on Database Theory, ICDT 90, Paris, France," pp. 72-88.
10. Beeri, C., and Milo, T. (1992), Functional and predicative programming in oodb's, in "Proc. 11th Symp. on Principles of Database Systems, San Diego," pp. 176-190.
11. Van Den Bussche, J., and Paredaens, J. (1991), The expressive power of structured values in pure OODB's, in "Proc. 10th. Symp. on Principles of Database Systems," pp. 291-299.
12. Breazu-Tannen, V., and Subrahmanyam, R. (1991), Logical and computational aspects of programming with sets/bags/lists, in "Proc. 18th Int. Col. on Automata, Languages and Programming."
13. Chandra, A., and Harel, D. (1980), Computable queries for relational data bases, J. Comp. System Sci. 21(2), 156-178.
14. Canny, J., and Reif, J. (1987), New lower bound techniques for robot motion planing problems, in "IEEE Conf. on Foundations of Computer Science," pp. 49-60.
15. Colby, L., Robertson, E., Saxton, L., and Van Gucht, D. (1994), Query language for list-based complex objects, in "Proc. 13th ACM Symp. on Principles of Database Systems," pp. 179-189.
16. Agarwa, S. et al. (1996), On the computation of multidimensional aggregates, in "Proc. of Intl. Conf. on Very Large Data Bases," pp. 506-521.
17. Garey, M., and Johnson, D. (1979), "Computers and Intractability A Guide to the theory of NP-Completeness," Freeman, San Francisco.
18. Grumbach, S., and Milo, T. (1993), Towards tractable algebras for bags, in "Proc. 12th ACM Symp. on Principles of Database Systems," pp. 49-58.
19. Grumbach, S., Milo, T., and Kornatzky, Y. (1993), Calculi for bags and their complexity, in "4th Int. Workshop on Database Programming Languages," pp. 65-97, Morgan Kaufman, New York/San Mateo, CA.
20. Grädel, E., and Otto, M. (1993), Inductive definability with counting on finite structures, in "Proc. of Computer Science Logic 92," Vol. 702, pp. 231-247, Springer-Verlag, New York/Berlin.
21. Gurevich, Y., and Shelah, S. (1986), Fixed-point extensions of first-order logic, Annals of Pure and Applied Logic 32, 265-280.
22. Gurevich, Y. (1983), Algebras of feasible functions, in "Proc. IEEE Foundations of Computer Science," pp. 210-214.
23. Grumbach, S., and Vianu, V. (1990), Playing games with objects, in "Proc. Int. Conf. on Database Theory," pp. 25-38, Springer-Verlag, Paris, LNCS 470.
24. Grumbach, S., and Vianu, V. (1991), Tractable query languages for complex object databases, in "Proc. 10th ACM Symp. on Principles of Database Systems," pp. 315-327, Boulder.
25. Ginsburg, S., and Wang, X. (1992), Towards a unified approach to querying sequenced data, in "Proc. 11th ACM Symp. on Principles of Database Systems," pp. 293-300, San Diego.
26. Hull, R., and Su, J. (1988), On the expressive power of database queries with intermediate types, in "Proc. 7th ACM Symp. on Principles of Database Systems," pp. 39-51.
27. Hull, R., and Su, J. (1989), Untyped Sets, Invention and Computable Queries, in "Proc. 8th ACM Symp. on Principles of Database Systems," pp. 347-359.
28. Hopcroft, J. E., and Tarjan, R. E. (1974), Efficient planarity testing, J. Assoc. Comput. Mach. 21, 549-568.
29. Hopcroft, J. E., and Wong, J. K. (1974), Linear time algorithm for isomorphism of planar graphs, in "Proc 6th ACM Symp. on Theory of Computing," pp. 172-184.
30. Immerman, N. (1986), Relational queries computable in polynomial time, Inform. and Control 68, 86-104.
31. Jacobs, B. (1982), On database logic, J. Assoc. Comput. Mach. 29(2), 310-332.
32. Johnson, D. S. (1990), A catalog of complexity, in "Handbook of Theoretical Computer Science" (J. Van Leeuwen, Ed.), Vol. A, pp. 67-162, North Holland, Amsterdam.
33. Korth, H. F., Roth, M. A., and Silberschatz, A. (1985), "Extended Algebra and Calculus for Not 1NF Relational Databases," technical report, Department of Computer Science, University of Texas, Austin.
34. Kuper, G. M., and Vardi, M. Y. (1984), A new approach to database logic, in "Proc. 3rd ACM Symp. on Principles of Database Systems," pp. 86-97.
35. Laurini, R., and Thompson, (1992), "Fundamentals of Spatial Information Systems," A.P.I.C. Series, Vol. 37, Academic Press, San Diego.
36. Libkin, L., and Wong, L. (1994), New techniques for studying set languages, bag languages and aggregate functions, in "Proc. 13th ACM Symp. on Principles of Database Systems," pp. 155-166.
37. Mohring, R. H. (1989), Algorithms and Order, I. Rival Ed., in "Chapter Computationally Tractable Classes of Ordered Sets," pp. 105-193, Kluwer Academic, Dordrecht.
38. Mumick, I. S. et al. (1990), The magic of duplicates and aggregates, in "Proc. 16th Intl. Conf. on Very Large Databases," pp. 264-277, Brisbane, Australia.
39. Pratt, V. (1984), The pomset model of parallel processes: Unifying the temporal and the spatial, in "Seminar on Concurrency," pp. 180-196, Pittsburgh, LNCS 197.
40. Richardson, J. (1992), Supporting lists in a data model (a timely approach), in "Proc. 18th Intl. Conf. on Very Large Databases," pp. 127-138, Vancouver.
41. Suciu, D. (1993), Bounded fixpoints for complex objects, in "4th Int. Workshop on Database Programming Languages," pp. 263-281, Morgan Kaufman, New York.
42. Subramanian, B., Zdonik, S. B., and Leung, T. W. (1993), Ordered types in the aqua data model, in "4th Int. Workshop on Database Programming Languages," pp. 115-135, Morgan Kaufman, New York.
43. Ullman, J. D. (1988), "Database and Knowledge Base Systems," Comput. Sci. Press, New York.
44. Vardi, M. (1982), The complexity of relational query languages, in "Proc. 14th ACM Symp. on Theory of Computing," pp. 137-146.