Towards tractable algebras for bags

Journal of Computer and System Sciences

Volumn 52, Issue 3, 1996, Pages 570-588

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

^a INRIA   (France)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA STRUCTURES; QUERY LANGUAGES; RECURSIVE FUNCTIONS;

BAG ALGEBRA; NESTED RELATION ALGEBRA;

RELATIONAL DATABASE SYSTEMS;

EID: 0030169748     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0042     Document Type: Article

References (52)

1. S. Abiteboul and C. Beeri, On the power of languages for the manipulation of complex objects, in "Proceedings Int. Workshop on Theory and Applications of Nested Relations and Complex Objects (extended abstract), Darmstadt, 1987," INRIA Research Report 846.
2. S. Abiteboul, P. C. Fischer, and H.-J. Schek, "Nested Relations and Complex Objects," Lect. Notes in Comput. Sci., Vol. 361, Springer-Verlag, New York/Berlin, 1989.
3. S. Abiteboul, R. Hull, and V. Vianu, "Foundations of Databases," Addison-Wesley, Reading, MA, 1994.
4. J. Albert, Algebraic properties of bag data types, in "Proceedings, 17th Int'l Conf. on Very Large Data Bases, 1991," pp. 211-219.
5. S. Abiteboul and V. Vianu, Generic computation and its complexity, in "Proceedings, ACM Symp. on Theory of Computing, New Orleans, May 1991."
6. V. Breazu-Tannen, P. Buneman, and S. Naqvi, Structural recursion as a query language, in "Proceedings 3rd Int. Workshop on Database Programming Languages, Nafplion, Aug. 1991," pp. 9-19, Morgan Kaufman, San Mateo, CA, 1991.
7. C. Beeri and Y. Kornatzky, Algebraic optimization of object oriented query languages, in "Proceedings 3rd Intl. Conf. on Database Theory, ICDT 90, Paris, France, 1990."
8. C. Beeri and T. Milo, Functional and predicative programming in oodb's, in "Proceedings, 114th Symp. on Principles of Database Systems, San Diego, 1992."
9. C. Beeri and T. Milo, On the power of algebras with recursion, in "Proceedings, ACM SIGMOD Conference on Management of Data, 1993."
10. J. Van Den Bussche and J. Paredaens, The expressive power of structured values in pure OODB's, in "Proceedings, 10th Symp. on Principles of Database Systems, 1991."
11. V. Breazu-Tannen and R. Subrahmanyam, Logical and computational aspects of programming with sets/bags/lists, in "Proceedings, 18th Int. Col. on Automata, Languages and Programming, 1991."
12. V. Breazu-Tannen, P. Buneman, and L. Wong, Naturally embedded query languages, in "Proceedings, Intl. Conf. on Database Theory," pp. 140-154, Lect. Notes in Comput. Sci., Springer-Verlag, New York/Berlin, 1992.
13. M. Carey, D. DeWitt, and S. Vandenberg, A data model an query language for exodus, in "Proceedings, ACM SIGMOD Conference on Management of Data, 1988."
14. A. Chandra and D. Harel, Computable queries for relational data bases, J. Comput. System Sci. 21, No. 2 (1980), 156-178.
15. S. Chaudhuri and M. Vardi, Optimization of real conjunctive queries, in "Proceedings, 12th ACM Symp. on Principles of Database Systems, Washington, May 1993."
16. U. Dayal, N. Goodman, and R. H. Katz, An extended relational algebra with control over duplicate elimination, in "Proceedings, ACM Symp. on Principles of Database Systems, Los Angeles, CA, 1982."
17. A. Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fund. Math. 49 (1961).
18. R. Fagin, Monadic generalized spectra, Z. Math. Logik Grundlag. Math. 21 (1975), 89-96.
19. G. Fayolle, S. Grumbach, and C. Tollu, Asymptotic probabilities of languages with generalized quantifiers, in "Proceedings IEEE Symp. of Logic in Computer Science, Montreal, June 1993," pp. 199-207.
20. D. H. Fishman et al. An object oriented database management system, ACM Trans. Office Inform. Systems 5, No. 5 (1987).
21. R. Fraïssé, Sur les classifications des systèmes de relations, Publ. Sci. Univ. Alger. 1, No. 1 (1954).
22. M. Furst, J. B. Saxe, and M. Sipser, Parity, circuits, and the polynomial-time hierarchy, Math. Systems Theory 17 (1984), 13-27.
23. M. Gyssens and D. Van Gucht, The powerset algebra as a result of adding programming constructs to the nested relational algebra, J. Comput. System Sci. 45 (1992), 76.
24. S. Grumbach and T. Milo., Towards tractable algebras for bags, in "Proceedings, ACM Symp. on Principles of Database Systems, Washington, May 1993," pp. 49-58.
25. S. Grumbach and T. Milo, An algebra for pomsets, in "Proceedings, Int. Conf. on Database Theory, Prague, 1995" (G. Gottlob and M. Vardi, Eds.), pp. 191-207, Lect. Notes in Comput. Sci., Vol. 893, Springer-Verlag, New York/Berlin, 1995.
26. S. Grumbach, T. Milo, and Y. Kornatzky, Calculi for bags and their complexity, in "4th Int. Workshop on Database Programming Languages, New York, September 1993," Morgan Kaufmann, San Mateo, CA, 1993.
27. E. Grädel and M. Otto, Inductive definability with counting on finite structures, in "Proceedings, Computer Science Logic 92," pp. 231-247, Lect. Notes in Comput. Sci., Vol. 702, Springer-Verlag, New York/Berlin, 1993.
28. Y. Gurevich and S. Shelah, Fixed-point extensions of first-order logic, Ann. Pure Appl. Logic 32 (1986), 265-280.
29. S. Grumbach and C. Tollu, On the expressive power of counting, Ther. Comput. Sci. B 147 (1995); Inria Research Reportage 2330, Sept. 1994.
30. S. Grumbach and V. Vianu, Playing games with objects, in "Proceedings, Int. Conf. on Database Theory, Paris, Dec. 1990," pp. 25-38.
31. S. Grumbach and V. Vianu, Tractable query languages for complex object databases, J. Comput. System Sci. (1995); extended abstract in "Proceedings 10th ACM Symp. on Principles of Database Systems, 1991."
32. S. Grumbach and V. Vianu, Tractable query languages for complex object databases, J. Comput. System Sci. (1995); extended abstract in "Proceedings 10th ACM Symp. on Principles of Database Systems, 1991."
33. M. Hammer and D. McLeod, Database description with SDM: A semantic database model, ACM Trans. Database Systems 6, No. 3 (1981).
34. R. Hull and J. Su, Untyped sets, invention and computable queries, in "Proceedings, 8th ACM Symp. on Principles of Database Systems, 1989."
35. R. Hull and J. Su, On the expressive power of database queries with intermediate types, J. Comput. System Sci. 43, No. 1 (1991), 219-267.
36. J. E. Hopcroft and J. D. Ullman, "Introduction to Automata Theory, Languages, and Computation," Addison-Wesley, Reading, MA, 1979.
37. N. Immerman and E. Lander, "Complexity Theory Retrospective" (A. Selman, Ed.), pp. 59-81, Springer-Verlag, New York/Berlin, 1990.
38. A. Klausner and N. Goodman, Multirelations, semantics, and languages, in "Proceedings, 11th Intl. Conf. on Very Large Databases, Stockholm, Sweden 1985."
39. G. M. Kuper and M. Y. Vardi, A new approach to database logic, in "Proceedings, 3rd ACM Symp. on Principles of Database Systems, 1984."
40. G. M. Kuper and M. Y. Vardi, On the complexity of queries in the logical data model, in "Proceedings, Int. Conf. on Database Theory, Bruges, 1988," pp. 267-280.
41. P. Kolaitis and M. Y. Vardi, Fixpoint Logic vs infinitary logic in finite model theory, in "Proceedings 7th Symp. of Logic in Computer Science, 1992," pp. 46-57.
42. L. Libkin and L. Wong, Aggregate functions, conservative extensions, and linear orders, in "Proceedings 4th Int. Workshop on database programming languages, 1992."
43. L. Libkin and L. Wong, Some properties of query languages for bags, in "Proceedings, 4th Int. Workshop on database programming languages, 1993."
44. L. Libkin and L. Wong, New techniques for studying set languages, bag languages and aggregate functions, in "Proceedings, 13th ACM Symp. on Principles of Database Systems, 1994."
45. F. Manola and U. Dayal, Pdm: An object-oriented data model, in "Proceedings, Intl. Workshop on Object Oriented Database Systems, Asilomor, CA, 1986."
46. I.S. Mumick et al., The magic of duplicates and aggregates, in "Proceedings, 16th Intl. Conf. on Very Large Databases, Brisbane, Australia, 1990."
47. J. Paredaens and D. Van Gucht, Possibilities and limitations of using flat operators in nested algebra expressions, in "Proceedings, 7th ACM Symp. on Principles of Database Systems, 1988," pp. 29-38.
48. J. Paredaens and D. Van Gucht, Possibilities and limitations of using flat operators in nested algebra expressions, ACM Database Systems (1992).
49. D. Suciu, Bounded fixpoints for complex objects, in "4th Int. Workshop on Database Programming Languages, New York, September 1993," Morgan Kaufmann, San Mateo, CA, 1993.
50. S. J. Thomas and P. C. Fischer, Nested relational structures, in "Advances in Computing Research," Vol. 3, (P. C. Kanellakis and F. Preparata, Ed.), pp. 269-307, JAI Press, London, 1986.
51. J. D. Ullman, "Database and Knowledge Base Systems," Computer Sci. Press, New York, 1988.
52. L. Wong, Normal form and conservative properties for query languages, in "Proceedings, 12th ACM Symp. on Principles of Database Systems, 1993."