Relational queries computable in polynomial time
Information and Control
The powerset algebra as a result of adding programming constructs to the nested relational algebra
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Untyped sets, invention, and computable queries
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Generic Computation and its complexity
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
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
On the expressive power of database queries with intermediate types
Journal of Computer and System Sciences
Procedural languages for database queries and updates
Journal of Computer and System Sciences
A new recursion-theoretic characterization of the polytime functions (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
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
Comprehensions, a query notation for DBPLs
DBPL3 Proceedings of the third international workshop on Database programming languages : bulk types & persistent data: bulk types & persistent data
Pattern matching by Rs-operations: towards a unified approach to querying sequenced data
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Towards tractable algebras for bags
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of queries in the logical data model
ICDT Selected papers of the 4th international conference on Database theory
Algebraic and calculus query languages for recursively typed complex objects
PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Lambda calculus characterizations of poly-time
Fundamenta Informaticae - Special issue: lambda calculus and type theory
Concepts for modeling and querying list-structured data
Information Processing and Management: an International Journal
Programming primitives for database languages
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Naturally Embedded Query Languages
ICDT '92 Proceedings of the 4th International Conference on Database Theory
SVP: A Model Capturing Sets, Lists, Streams, and Parallelism
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Some Properties of Query Languages for Bags
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
The Expressiveness of a Family of Finite Set Languages
The Expressiveness of a Family of Finite Set Languages
Sequences, Datalog and transducers
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query Languages for Sequence Databases: Termination and Complexity
IEEE Transactions on Knowledge and Data Engineering
Structural recursion on ordered trees and list-based complex objects
ICDT'07 Proceedings of the 11th international conference on Database Theory
| Hi-index | 0.00 |
We present a language for querying list-based complex objects. The language is shown to express precisely the polynomial-time generic list-object functions. The iteration mechanism of the language is based on a new approach wherein, in addition to the list over which the iteration is performed, a second list is used to control the number of iteration steps. During the iteration, the intermediate results can be moved to the output list as well as reinserted into the list being iterated over. A simple syntactic constraint allows the growth rate of the intermediate results to be tightly controlled which, in turn, restricts the expressiveness of the language to PTIME.