The Expressiveness of a Family of Finite Set Languages

The Expressiveness of a Family of Finite Set Languages (1991)

by Neil Immerman , Sushant Patnaik , David Stemple

Venue:	IN PROCEEDINGS OF 10TH ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS
Citations:	26 - 3 self

User correction supplied by mph

Datum	Value	Source
TITLE	The Expressiveness of a Family of Finite Set Languages	SVM HeaderParse 0.1
AUTHOR NAME	Neil Immerman	user correction
AUTHOR AFFIL	Computer and Information Science Department; University of Massachusetts	user correction
AUTHOR ADDR	Amherst, MA 01003	user correction
AUTHOR NAME	Sushant Patnaik	user correction
AUTHOR AFFIL	Computer and Information Science Department; University of Massachusetts	user correction
AUTHOR ADDR	Amherst, MA 01003	user correction
AUTHOR NAME	David Stemple	user correction
AUTHOR AFFIL	Computer and Information Science Department; University of Massachusetts	user correction
AUTHOR ADDR	Amherst, MA 01003	user correction
ABSTRACT	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.	user correction
YEAR	1991	INFERENCE
VENUE	IN PROCEEDINGS OF 10TH ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS	user correction
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	37--52	INFERENCE
CITATIONS	37 found	ParsCit 1.0