Relational queries computable in polynomial time
Information and Control
Traversal recursion: a practical approach to supporting recursive applications
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Data model issues for object-oriented applications
ACM Transactions on Information Systems (TOIS)
Integrating an object server with other worlds
ACM Transactions on Information Systems (TOIS)
IFO: a formal semantic database model
ACM Transactions on Database Systems (TODS)
Combining language and database advances in an object-oriented development environment
OOPSLA '87 Conference proceedings on Object-oriented programming systems, languages and applications
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
O2, an object-oriented data model
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
On the complexity of queries in the logical data model
Lecture notes in computer science on ICDT '88
Behavior analysis of object-oriented databases: method structure, execution trees and reachability
3rd International Conference, FODO 1989 on Foundations of Data Organization and Algorithms
Untyped sets, invention, and computable queries
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A query language for the O2 object-oriented databases
Proceedings of the second international workshop on Database programming languages
On the expressive power of database queries with intermediate types
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Procedural and declarative database update languages
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The functional data model and the data languages DAPLEX
ACM Transactions on Database Systems (TODS)
Programming primitives for database languages
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The expressive power structured values in pure OODB's (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Using Ada for rapid prototyping of database applications
WADAS '91 Proceedings of the eighth annual Washington Ada symposium & summer SIGAda meeting on Ada: software: foundation for competitveness
Reflective programming in the relational algebra
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Applying an update method to a set of receivers (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Converting relational to object-oriented databases
ACM SIGMOD Record
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A graph-oriented object database model
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Applying an update method to a set of receivers
ACM Transactions on Database Systems (TODS)
The Power of Methods With Parallel Semantics
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
On the complexity of nonrecursive XQuery and functional query languages on complex values
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of nonrecursive XQuery and functional query languages on complex values
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
A formal framework for studying the expressive power and complexity of OODB queries is developed. Three approaches to modeling sets are articulated and compared. The class of regular OODB schemas supports the explicit representation of set-valued types. Using an object-based semantics for sets, the regular schemas correspond to most implemented OODB systems in the literature; a value-based semantics for sets is also introduced. Without restrictions, both of these approaches support the specification of all computable queries. Assuming that the new operator is prohibited, the query language of the regular OODB schemas under the object-based semantics is complete in PSPACE; and under the value-based semantics it has hyper-exponential complexity. The third approach to modeling sets is given by the algebraic OODB model, in which multi-valued attributes rather than set-valued types are supported. method implementations can use operators stemming from the relational algebra, and do not have side-effects. The query language of algebraic OODBs is more powerful than the relational algebra but has complexity bounded by PTIME. The expressive power and complexity of data access for other variations of OODBs are also considered. Finally, a new relational query language, called algebra + pointwise recursion, is introduced. This is equivalent to the algebraic OODB language, and can compute generalized transitive closure.