Semi Join is a relational algebra operation that returns the tuples from one relation for which there exists at least one matching tuple in a second relation based on common attribute values, retaining only the attributes of the first relation.
26
Publications
1.6K
Citations
62
Authors
33
Institutions
Publications per year
2017–2026
2
Parents
Publications
26
Using Semi-Joins to Solve Relational Queries
Philip A. Bernstein, Dah-Ming W. Chiu · Journal of the ACM · 1981 · 466 citations · Full text
Incremental distance join algorithms for spatial databases
Gı́sli R. Hjaltason, Hanan Samet · 1998 · 242 citations
1–5 of 26
Authors
62
- PS
4
h-index
- MC
3
h-index
- SY
2
h-index
- CY
2
h-index
- GRGı́sli R. Hjaltason
University of Maryland, College Park, United States
2 publications · 307 citations
2
h-index
1–5 of 62
Institutions
33
University of Maryland, College Park
College Park, United States
3 h-index
5 publications
654 citations
University of Illinois Chicago
Chicago, United States
3 h-index
5 publications
169 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
3 h-index
6 publications
182 citations
Kyoto University
Kyoto, Japan
2 h-index
6 publications
213 citations
IBM (United States)
Armonk, United States
2 h-index
4 publications
110 citations
Harvard University Press
Cambridge, United States
2 h-index
3 publications
572 citations
Auckland University of Technology
Auckland, New Zealand
1 h-index
2 publications
22 citations
University of Arizona
Tucson, United States
1 h-index
4 publications
60 citations
1–8 of 33
Venues
- IEEE Transactions on Knowledge and Data Engineering
TKDE · 5 publications · 181 citations
5
h-index
- ACM SIGMOD Record
2 publications · 77 citations
2
h-index
- IEEE Transactions on Software Engineering
TSE · 2 publications · 208 citations
2
h-index
- Journal of Logic Language and Information
1 publications · 25 citations
1
h-index
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 1 publications · 45 citations
1
h-index
1–5