Výsledky vyhľadávania - Theta-join algorithm
-
1
An efficient theta-join query processing in distributed environment
ISSN: 0743-7315, 1096-0848Vydavateľské údaje: Elsevier Inc 01.11.2018Vydané v Journal of parallel and distributed computing (01.11.2018)“…Theta-join query is very useful in many data analysis tasks, but it is not efficiently processed in distributed environment, especially in large scale data…”
Získať plný text
Journal Article -
2
Toward fast theta‐join: A prefiltering and amalgamated partitioning approach
ISSN: 1532-0626, 1532-0634Vydavateľské údaje: Hoboken Wiley Subscription Services, Inc 01.08.2022Vydané v Concurrency and computation (01.08.2022)“… In this article, we design and implement a novel fast theta‐join algorithm, called Prefap, by developing two distinct techniques…”
Získať plný text
Journal Article -
3
An Efficient Theta-Join Query Processing Algorithm on MapReduce Framework
ISBN: 9781467307673, 146730767XVydavateľské údaje: IEEE 01.06.2012Vydané v 2012 International Symposium on Computer, Consumer and Control (01.06.2012)“… In this paper, we propose a method to cope with theta-join queries, i.e., both equi-join and nonequi-join queries…”
Získať plný text
Konferenčný príspevok.. -
4
Towards Fast Theta-join: A Prefiltering and Amalgamated Partitioning Approach
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 05.08.2022Vydané v arXiv.org (05.08.2022)“… In this article, we design and implement a novel fast theta-join algorithm, called Prefap, by developing two distinct techniques - prefiltering and amalgamated partitioning-based on the state…”
Získať plný text
Paper -
5
An Efficient Filter Strategy for Theta-Join Query in Distributed Environment
ISSN: 1530-2016Vydavateľské údaje: IEEE 01.08.2017Vydané v Proceedings - International Workshops on Parallel Processing (01.08.2017)“…Theta-join query is a very popular application in traditional databases, but due to tremendous computation cost and communication cost in distributed environment, it is not efficiently processed for big data…”
Získať plný text
Konferenčný príspevok.. -
6
A-DSP: An Adaptive Join Algorithm for Dynamic Data Stream on Cloud System
ISSN: 1041-4347, 1558-2191Vydavateľské údaje: New York IEEE 01.05.2021Vydané v IEEE transactions on knowledge and data engineering (01.05.2021)“… Our proposal includes: 1) a join model generation algorithm devised…”
Získať plný text
Journal Article -
7
Survey on the solution of data skew in big data
Vydavateľské údaje: IEEE 01.11.2016Vydané v 2016 Online International Conference on Green Engineering and Technologies (IC-GET) (01.11.2016)“… In the Past, while utilizing the MapReduce many problems occur like theta join processing, running the application in cloud based environment, execution time being slow due to complex record usage etc…”
Získať plný text
Konferenčný príspevok.. -
8
General dynamic Yannakakis: conjunctive queries with theta joins under updates
ISSN: 1066-8888, 0949-877XVydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.05.2020Vydané v The VLDB journal (01.05.2020)“…The ability to efficiently analyze changing data is a key requirement of many real-time analytics applications. In prior work, we have proposed general dynamic…”
Získať plný text
Journal Article -
9
Processing Theta-Joins on Shared-Nothing Systems
ISBN: 1303856964, 9781303856969Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2014“… We explore how to efficiently process theta-joins in distributed shared-nothing systems. While equi-joins have been studied extensively, it was unclear how to efficiently distribute computation of arbitrary join conditions on a cluster of nodes…”
Získať plný text
Dissertation -
10
맵리듀스를 이용한스트리밍 세타 조인
ISSN: 2383-6318, 2383-6326Vydavateľské údaje: 한국정보과학회 01.05.2014Vydané v 정보과학회 컴퓨팅의 실제 논문지, 20(5) (01.05.2014)“… In this paper, to process theta-join queries using a MapReduce framework, we propose an improved theta-join algorithm which reduces up to 75…”
Získať plný text
Journal Article -
11
Handling data skew in join algorithms using MapReduce
ISSN: 0957-4174, 1873-6793Vydavateľské údaje: Elsevier Ltd 01.06.2016Vydané v Expert systems with applications (01.06.2016)“…•We introduce a skew handling algorithm, called multi-dimensional range partitioning…”
Získať plný text
Journal Article -
12
Conjunctive Queries with Theta Joins Under Updates
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 23.05.2019Vydané v arXiv.org (23.05.2019)“…Modern application domains such as Composite Event Recognition (CER) and real-time Analytics require the ability to dynamically refresh query results under…”
Získať plný text
Paper -
13
GPU-based efficient join algorithms on Hadoop
ISSN: 0920-8542, 1573-0484Vydavateľské údaje: New York Springer US 01.01.2021Vydané v The Journal of supercomputing (01.01.2021)“… Based on this, this paper speeds up nested loop join, hash join and theta join, combining Hadoop with GPU, which is also the first to use GPU to accelerate theta join…”
Získať plný text
Journal Article -
14
SEJ: An Even Approach to Multiway Theta-Joins Using MapReduce
ISBN: 1467330272, 9781467330275Vydavateľské údaje: IEEE 01.11.2012Vydané v 2012 International Conference on Cloud and Green Computing (01.11.2012)“… Multiway equi-joins and two-way theta-joins using MapReduce have been solved recently. In this paper, we introduce a communication cost model to evaluate multiway theta…”
Získať plný text
Konferenčný príspevok.. -
15
On Joining Graphs
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 19.08.2016Vydané v arXiv.org (19.08.2016)“… Then we propose the "CoGrouped Graph Conjunctive \(\theta\)-Join" algorithm running over data indexed in secondary memory…”
Získať plný text
Paper -
16
MapReduce join strategies for key-value storage
Vydavateľské údaje: IEEE 01.05.2014Vydané v JCSSE 2014 : 2014 11th International Joint Conference on Computer Science and Software Engineering : Chonburi, Thailand, May 14-16, 2014 (01.05.2014)“… The most used joins will be analysed in this paper, which are theta-join algorithms including all pair partition join, repartition join, broadcasting join, semi join, per-split semi join…”
Získať plný text
Konferenčný príspevok.. -
17
A relational algebraic approach to protocol verification
ISSN: 0098-5589, 1939-3520Vydavateľské údaje: New York, NY IEEE 01.02.1988Vydané v IEEE transactions on software engineering (01.02.1988)“…Communications protocols are usually modeled by a pair of finite-state machines that generate the interaction between processes. Protocol verification is a…”
Získať plný text
Journal Article -
18
Reassessing Top-Down Join Enumeration
ISSN: 1041-4347, 1558-2191Vydavateľské údaje: New York IEEE 01.10.2012Vydané v IEEE transactions on knowledge and data engineering (01.10.2012)“… In the case of a clique-shaped query graph, the best known top-down algorithm has a complexity of \Theta (n^2…”
Získať plný text
Journal Article -
19
GPU-based Efficient Join Algorithms on Hadoop
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 25.04.2019Vydané v arXiv.org (25.04.2019)“… Based on this, this paper speeds up nested loop join, hash join and theta join, combining Hadoop with GPU, which is also the first to use GPU to accelerate theta join…”
Získať plný text
Paper -
20
Pipelining in query execution
ISBN: 0818620358, 9780818620355Vydavateľské údaje: IEEE Comput. Soc. Press 1990Vydané v PARBASE-90, International Conference on Databases, Parallel Architectures, and Their Applications : March 7-9, 1990, Miami Beach, Florida (1990)“…It is shown that the use of an adjusted algorithm can improve the performance of a nested query execution containing join operations…”
Získať plný text
Konferenčný príspevok..

