Relational queries computable in polynomial time
Information and Control
An introduction to the completeness of languages for complex objects and nested relations
Nested relations and complex objects in databases
ACM SIGACT News
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
Datalog extensions for database queries and updates
Journal of Computer and System Sciences
Journal of Computer and System Sciences
On the expressive power of database queries with intermediate types
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
A simple proof of a theorem of Statman
Theoretical Computer Science
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
On the complexity of queries in the logical data model
ICDT Selected papers of the 4th international conference on Database theory
Lambda calculus characterizations of poly-time
Fundamenta Informaticae - Special issue: lambda calculus and type theory
An implementation technique for database query languages
ACM Transactions on Database Systems (TODS)
The Expressiveness of Simple and Second-Order Type Structures
Journal of the ACM (JACM)
Naturally Embedded Query Languages
ICDT '92 Proceedings of the 4th International Conference on Database Theory
ML Typability is DEXTIME-Complete
CAAP '90 Proceedings of the 15th Colloquium on Trees in Algebra and Programming
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Tutorial: languages for collection types
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
In memoriam Paris C. Kanellakis
ACM Computing Surveys (CSUR)
On genericity and parametricity (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
In Memoriam: Paris C. Kanellakis
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity of higher-order queries
Proceedings of the 14th International Conference on Database Theory
Hi-index | 0.00 |
We present a functional framework for database query languages, which is analogous to the conventional logical framework of first-order and fixpoint formulas over finite structures. We use atomic constants of order 0, equality among these constants, variables, application, lambda abstraction, and let abstraction; all typed using fixed order (≤ 5) functionalities. In this framework, proposed in [21] for arbitrary order functionalities, queries and databases are both typed lambda terms, evaluation is by reduction, and the main programming technique is list iteration. We define two families of languages: TLI=i or simply-typed list iteration of order i+3 with equality, and MLI=i or ML-typed list iteration of order i+3 with equality; we use i+3 since our list representation of databases requires at least order 3. We show that: FO-queries ⊆TLI=0 ⊆MLI=0 ⊆LOGSPACE-queries ⊆TLI=1 =MLI=1 = PTIME-queries ⊆ TLI2, where equality is no longer a primitive in TLI2. We also show that ML type inference, restricted to fixed order, is polynomial in the size of the program typed. Since programming by using low order functionalities and type inference is common in functional languages, our results indicate that such programs suffice for expressing efficient computations and that their ML-types can be efficiently inferred.