Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

PODS
1991
ACM

favoriteEmaildiscussreport

93views Database» more PODS 1991»

The Expressiveness of a Family of Finite Set Languages

13 years 8 months ago

The Expressiveness of a Family of Finite Set Languages

Download www.cs.umass.edu

In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a uniﬁed framework for queries and updates. By imposing simple syntactic restrictions on it, we are able to express exactly the classes, P and LOGSPACE. We also discuss the role of ordering in database query languages and show that the hom operator of Machiavelli language in [OBB89] does not capture all the order-independent properties.

Neil Immerman, Sushant Patnaik, David W. Stemple

Real-time Traffic

Database | Language Called Srl | PODS 1991 | Set Based Database | Simple Syntactic Restrictions |

claim paper

Related Content

» Querying data sources that export infinite sets of views

» Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees

» Using the TPTP Language for Writing Derivations and Finite Interpretations

» A Note on Expressive Coalgebraic Logics for Finitary Set Functors

» Structure of Extreme Correlated Equilibria

» Embedding Finite Automata within regular Expressions

» Short Regular Expressions from Finite Automata Empirical Results

» Coalgebraic Logic and Synthesis of Mealy Machines

» Compiling Intensional Sets in CLP

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	PODS
Authors	Neil Immerman, Sushant Patnaik, David W. Stemple

Comments (0)