A taxonomy of problems with fast parallel algorithms
Information and Control
The relational model with relation-valued attributes
Information Systems
Relational queries computable in polynomial time
Information and Control
Languages that capture complexity classes
SIAM Journal on Computing
Database programming in Machiavelli—a polymorphic language with static type inference
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Expressibility and parallel complexity
SIAM Journal on Computing
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Generic Computation and its complexity
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Logical and computational aspects of programming with sets/bags/lists
Proceedings of the 18th international colloquium on Automata, languages and programming
The expressiveness of a family of finite set languages
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tractable query languages for complex object databases
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Converting nested algebra expressions into flat algebra expressions
ACM Transactions on Database Systems (TODS)
Structural recursion as a query language
DBPL3 Proceedings of the third international workshop on Database programming languages : bulk types & persistent data: bulk types & persistent data
Expressiveness and complexity of restricted languages for complex objects
DBPL3 Proceedings of the third international workshop on Database programming languages : bulk types & persistent data: bulk types & persistent data
Normal forms and conservative properties for query languages over collection types
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Infinitary logic and inductive definability over finite structures
Information and Computation
Possibilities and limitations of using flat operators in nested algebra expressions
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Naturally Embedded Query Languages
ICDT '92 Proceedings of the 4th International Conference on Database Theory
FAD, a Powerful and Simple Database Language
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The Power of Methods With Parallel Semantics
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
SVP: A Model Capturing Sets, Lists, Streams, and Parallelism
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Aggregate Functions, Conservative Extensions, and Linear Orders
DBLP-4 Proceedings of the Fourth International Workshop on Database Programming Languages - Object Models and Languages
Bounded Fixpoints for Complex Objects
DBLP-4 Proceedings of the Fourth International Workshop on Database Programming Languages - Object Models and Languages
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Efficient compilation of high-level data parallel algorithms
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Tutorial: languages for collection types
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
New techniques for studying set languages, bag languages and aggregate functions
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query languages for bags: expressive power and complexity
ACM SIGACT News
ACM SIGMOD Record
On Multisets in Database Systems
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
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
| Hi-index | 0.00 |
We show that a form of divide and conquer recursion on sets together with the relational algebra expresses exactly the queries over ordered relational databases which are NC-computable. At a finer level, we relate k nested uses of recursion exactly to ACk, k≥1. We also give corresponding results for complex objects.