Using semi-joins to solve relational queries

Using semi-joins to solve relational queries (1981)

by Philip A. Bernstein , Dah-ming W. Chiu

Venue:	Journal of the ACM
Citations:	87 - 1 self

Datum	Value	Source
TITLE	Using semi-joins to solve relational queries	INFERENCE
AUTHOR NAME	Philip A. Bernstein	SVM HeaderParse 0.2
AUTHOR AFFIL	Harvard Universitr, Cambridge	SVM HeaderParse 0.2
AUTHOR ADDR	Massachusetts	SVM HeaderParse 0.2
AUTHOR NAME	Dah-ming W. Chiu	SVM HeaderParse 0.2
AUTHOR AFFIL	Harvard Universitr, Cambridge	SVM HeaderParse 0.2
AUTHOR ADDR	Massachusetts	SVM HeaderParse 0.2
ABSTRACT	ABSTRACT. The semi-join is a relational algebraic operation that selects a set of tuples in one relation that match one or more tuples of another relation on the joining domains. Semi-joins have been used as a basic ingredient in query processing strategies for a number of hardware and software database systems. However, not all queries can be solved entirely using semi-joins. In this paper the exact class of relational queries that can be solved using semi-joins is shown. It is also shown that queries outside of this class may not even be partially solvable using "short " semi-join programs. In addition, a linear-time membership test for this class is presented.	SVM HeaderParse 0.2
YEAR	1981	INFERENCE
VENUE	Journal of the ACM	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	25--40	INFERENCE
VOLUME	28	INFERENCE
CITATIONS	14 found	ParsCit 1.0