The Expressiveness of a Family of Finite Set Languages

In this paper we characterise exactly the complexity of a set based database language called SRL, which presents a unified 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.

• Type: Conference
• Year: 1991
• Where: PODS
• Authors: Neil Immerman, Sushant Patnaik, David W. Stemple
• Keywords: Database, Language Called Srl, PODS 1991, Set Based Database, Simple Syntactic Restrictions