Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,259,223 papers from all fields of science
Search
Sign In
Create Free Account
Symmetric Hash Join
Symmetric Hash Join is a special type of hash join designed for data streams.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Data stream mining
Hash join
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
PeNeLoop: Parallelizing Federated SPARQL Queries in Presence of Replicated Fragments
Thomas Minier
,
Gabriela Montoya
,
H. Skaf-Molli
,
P. Molli
RSP+QuWeDa@ESWC
2017
Corpus ID: 28914065
Replicating data fragments in Linked Data improves data availability and performances of federated query engines. Existing…
Expand
2010
2010
Achieving High Freshness and Optimal Throughput in Resource-Limited Execution of Multi-Join Continuous Queries
Abhishek Mukherji
,
Elke A. Rundensteiner
2010
Corpus ID: 4513528
Due to high data volumes and unpredictable arrival rates, continuous query systems processing expensive queries in real-time may…
Expand
2009
2009
Data Quality support to on-the-fly data integration using Adaptive Query Processing
P. Missier
,
A. Fernandes
,
Roald Lengu
,
G. Guerrini
,
M. Mesiti
Sistemi Evoluti per Basi di Dati
2009
Corpus ID: 13996091
In dynamic, on-the-fly relational data integration settings, such as data mashups, there is a need to reconcile values…
Expand
2007
2007
RRPJ: Result-Rate Based Progressive Relational Join
W. Tok
,
S. Bressan
,
M. Lee
International Conference on Database Systems for…
2007
Corpus ID: 41476622
Progressive join algorithms are join algorithms that produce results incrementally as input data is available. Because they are…
Expand
2006
2006
Approximating StreamingWindow Joins Under CPU Limitations
A. Ayad
,
J. Naughton
,
Stephen J. Wright
,
U. Srivastava
IEEE International Conference on Data Engineering
2006
Corpus ID: 840291
Data streaming systems face the possibility of having to shed load in the case of CPU or memory resource limitations. We study…
Expand
2005
2005
Supporting ranked join in peer-to-peer networks
K. Zhao
,
Shuigeng Zhou
,
K. Tan
,
Aoying Zhou
International Conference on Database and Expert…
2005
Corpus ID: 14887076
This paper addresses the problem of supporting ranked join in peer-to-peer (P2P) networks. Ranked queries produce results that…
Expand
Highly Cited
2004
Highly Cited
2004
Evaluating window joins over punctuated streams
L. Ding
,
Elke A. Rundensteiner
International Conference on Information and…
2004
Corpus ID: 13973550
We explore join optimizations in the presence of both time-based constraints (sliding windows) and value-based constraints…
Expand
2003
2003
MJoin: a metadata-aware stream join operator
L. Ding
,
Elke A. Rundensteiner
,
G. Heineman
Distributed Event-Based Systems
2003
Corpus ID: 14124386
Join algorithms must be re-designed when processing stream data instead of persistently stored data. Data streams are potentially…
Expand
Highly Cited
2002
Highly Cited
2002
A non-blocking parallel spatial join algorithm
Gang Luo
,
J. Naughton
,
Curt J. Ellmann
Proceedings / International Conference on Data…
2002
Corpus ID: 61731246
Interest in incremental and adaptive query processing has led to the investigation of equijoin evaluation algorithms that are non…
Expand
2000
2000
Clone join and shadow join: two parallel spatial join algorithms
J. Patel
,
D. DeWitt
ACM SIGSPATIAL International Workshop on Advances…
2000
Corpus ID: 6098527
Spatial applications frequently need to join two data sets based on some spatial relationship between objects in the two data…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE