Bounded fixpoints for complex objects

Theoretical Computer Science

Volumn 176, Issue 1-2, 1997, Pages 283-328

  Suciu, Dan ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FORMAL LOGIC; MATHEMATICAL OPERATORS; OBJECT ORIENTED PROGRAMMING; RELATIONAL DATABASE SYSTEMS; THEOREM PROVING;

BOUNDED FIXPOINTS; NESTED RELATIONAL ALGEBRA;

QUERY LANGUAGES;

EID: 0031120551     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00293-9     Document Type: Article

References (29)

1. S. Abiteboul and C. Beeri, On the power of languages for the manipulation of complex objects, in: Proc. Internat. Workshop on Theory and Applications of Nested Relations and Complex Objects, Darmstadt, 1988. Also available as INRIA Tech. Report 846.
2. S. Abiteboul and N. Bidoit, Non-first normal form relations: an algebra allowing data restructuring, J. Comput. System Sci. 33 (1986) 361-371.
3. S. Abiteboul, S. Grumbach, A. Voisard and E. Waller, An extensible rule-based language with complex objects and data-functions, in: Proc. 2nd Workshop on Database Programming Languages, Gleneden Beach, Oregon, June 1989.
4. S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases (Addison-Wesley Reading, MI, 1995).
5. S. Abiteboul and P. Kanellakis, Object identity as a query language primitive, in: Proc. ACM SIGMOD Conf. on Management of Data, Portland, Oregon (1989) 159-173.
6. S. Abiteboul and V. Vianu, Expressive power of query languages, in: J. Ullman, ed., Theoretical Studies in Computer Science (Academic Press, New York, 1991).
7. S. Abiteboul and V. Vianu, Generic computation and its complexity, in: Proc. 23rd ACM Symp. on the Theory of Computing, 1991.
8. V. Breazu-Tannen, P. Buneman and S. Naqvi, Structural recursion as a query language, in: Proc. 3rd Internat. Workshop on Database Programming Languages, Naphlion, Greece (Morgan Kaufmann, Los Altos, CA, 1991) pp. 9-19. Also available as UPenn Tech. Report MS-CIS-92-17.
9. P. Buneman, S. Naqvi, V. Tannen and L. Wong, Principles of programming with collection types, Theoret. Comput. Sci. 149 (1995) 3-48.
10. A. Chandra and D. Harel, Structure and complexity of relational queries, J. Comput. System Sci. 25 (1982) 99-128.
11. J. Van den Bussche, Complex object manipulation through identifiers: an algebraic perspective, Technical Report 92-41, University of Antwerp, Department of Mathematics and Computer Science, Universiteitsplein 1, B-2610 Antwerp, Belgium, September 1992.
12. S. Grumbach and V. Vianu, Tractable query languages for complex object databases, in: Proc. of 10th ACM Symp. on Principles of Database Systems, 1991.
13. D. Van Gucht and P.C. Fischer, Multilevel nested relational structures, J. Comput. System Sci. 36 (1988) 77-105.
14. Y. Gurevich and S. Shelah, Fixed-point extensions of first-order logic, Ann. Pure Appl. Logic 32 (1986) 265-180.
15. M. Gyssens, D. Suciu and D. Van Gucht, On polynomially bounded fixpoint constructs for nested relations, in: Proc. DBPL'95, Gubbio, Italy, September 1995.
16. M. Gyssens and D. Van Gucht, A comparison between algebraic query languages for flat and nested databases, Theoret. Comput. Sci. 87 (1991) 263-286.
17. M. Gyssens and D. Van Gucht, The powerset algebra as a natural tool to handle nested database relations, J. Comput. System Sci. 45 (1992) 76-103.
18. R. Hull and J. Su, Untyped sets, inventions, and computable queries, in: Proc. 8th ACM Symp. on Principles of Database Systems (1989) 347-360.
19. R. Hull and J. Su, On the expressive power of database queries with intermediate types, J. Comput. System Sci. 43 (1991) 219-267.
20. N. Immerman, Relational queries computable in polynomial time, Inform. and Control 68 (1986) 86-104.
21. J. Paredaens and D. Van Gucht, Possibilities and limitations of using flat operators in nested algebra expressions, in: Proc. 7th ACM Symp. on Principles of Database Systems, Austin, Texas (1988) 29-38.
22. J. Paredaens and D. Van Gucht, Converting nested relational algebra expressions into flat algebra expressions, ACM Trans. Database Systems 17 (1992) 65-93.
23. H.-J. Schek and M.H. Scholl, The relational model with relation-valued attributes, Inform. Systems 11 (1986) 137-147.
24. D. Suciu and V. Tannen, A query language for NC, J. Comput. Systems Sci., to appear. Preliminary version appeared in the Proc. 13th ACM Symp. on Principles of Database Systems, 1994.
25. D. Suciu, Domain-independent queries on databases with external functions, J. Theoret. Comput. Sci., to appear. Preliminary version appeared in the Proc. 5th Internat. Conf. on Database Theory, 1995.
26. S.J. Thomas and P.C. Fischer, Nested relational structures, in: P.C. Kanellakis and F.P. Preparata, eds., Advances in Computing Research: The Theory of Databases (JAI Press, London, 1986) 269-307.
27. J.D. Ullman, Principles of Database and Knowledgebase Systems II: The New Technologies (Computer Science Press, Rockville, MD, 1989).
28. M.Y. Vardi, The complexity of relational query languages, in: Proc. 14th ACM SIGACT Symp. on the Theory of Computing, San Francisco, CA (1982) 137-146.
29. L. Wong, Normal forms and conservative properties for query languages over collection types, in: Proc. 12th ACM Symp. on Principles of Database Systems, Washington, DC, May (1993) 26-36. See also UPenn Tech. Report MS-CIS-92-59.