Bounded fixpoints for complex objects
- 1 April 1997
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 176 (1-2) , 283-328
- https://doi.org/10.1016/s0304-3975(96)00293-9
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A Query Language for NCJournal of Computer and System Sciences, 1997
- Principles of programming with complex objects and collection typesTheoretical Computer Science, 1995
- The powerset algebra as a natural tool to handle nested database relationsJournal of Computer and System Sciences, 1992
- Converting nested algebra expressions into flat algebra expressionsACM Transactions on Database Systems, 1992
- A comparison between algebraic query languages for flat and nested databasesTheoretical Computer Science, 1991
- On the expressive power of database queries with intermediate typesJournal of Computer and System Sciences, 1991
- Multilevel nested relational structuresJournal of Computer and System Sciences, 1988
- Fixed-point extensions of first-order logicAnnals of Pure and Applied Logic, 1986
- The relational model with relation-valued attributesInformation Systems, 1986
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982