On bulk data type constructors and manipulation primitives: a framework for analyzing expressive power and complexity

Authors:
Richard Hull;Jianwen Su
Affiliations:
-;-
Venue:
Proceedings of the second international workshop on Database programming languages
Year:
1989

Citing 0
Cited 2

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
Tutorial: languages for collection types

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a framework for analyzing the complexity and expressive power of many existing languages for manipulating information in bulk data types. The framework is based on four dimensions: the “cardinality measure” of the underlying data model; procedural vs. declarative; the presence of iteration; and the presence of “invention”. Several languages from the literature which correspond to various combinations of these dimensions are categorized into five families of queries, ranging from QLOGSPACE to a family which is more expressive than the computable queries.