Zobrazeno 1 - 10
of 444
pro vyhledávání: '"Recursive join"'
Publikováno v:
Journal of Computer Science and Cybernetics. 37:107-122
In the era of information explosion, Big data is receiving increased attention as having important implications for growth, profitability, and survival of modern organizations. However, it also offers many challenges in the way data is processed and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d66855b05684bca2a5bac2e36189dd44
https://doi.org/10.15625/1813-9663/37/2/15889
https://doi.org/10.15625/1813-9663/37/2/15889
Publikováno v:
KỶ YẾU HỘI NGHỊ KHOA HỌC CÔNG NGHỆ QUỐC GIA LẦN THỨ XIII NGHIÊN CỨU CƠ BẢN VÀ ỨNG DỤNG CÔNG NGHỆ THÔNG TIN - Proceedings of the 13th National Conference on Fundamental & Applied Information Technology Research.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0475296af196bb8c36d545527641231b
https://doi.org/10.15625/vap.2020.00175
https://doi.org/10.15625/vap.2020.00175
Publikováno v:
Advances in Computational Collective Intelligence ISBN: 9783030631185
ICCCI (CCIS Volume)
ICCCI (CCIS Volume)
In the evolution of Big Data, efficiently processing large datasets is always a top concern for researchers. A join operation is one of such processing, a common operation appearing in many data queries. This operation generates plenty of intermediat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9d6bffa227b3bd203380f8ee54f439b
https://doi.org/10.1007/978-3-030-63119-2_46
https://doi.org/10.1007/978-3-030-63119-2_46
Autor:
Mirela T. Cazzolato, Lucas C. Scabora, Jose F. Rodrigues-Jr, Gabriel Spadon, Caetano Traina-Jr, Agma J. M. Traina, Daniel S. Kaster
Publikováno v:
SAC
Processing navigational graph-like queries in relational databases requires executing several recursive join operations, which are computationally costly. However, when the need for graph-like queries arises, applications often execute a sequence of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff55e9131de7e2c0e435f970afb4d2bc
https://doi.org/10.1145/3412841.3442078
https://doi.org/10.1145/3412841.3442078
Autor:
Mohamed Bahaj, Nassima Soussi
Publikováno v:
Journal of Applied Research and Technology. 15:504-512
Despite the emergence of semantic web due to its high performance in managing a large amount of data through semantic filters, the relational databases are still the most used. Therefore establishing a connection between both heterogeneous systems be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e55b2fca43c9c6af2081db2b3ceff36f
https://doi.org/10.1016/j.jart.2017.05.001
https://doi.org/10.1016/j.jart.2017.05.001
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 28:2663-2673
The problem of scaling out relational join performance for large data sets in the database management system (DBMS) has been studied for years. Although in-memory DBMS engines can reduce load times by storing data in the main memory, join queries sti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::298062367538c628e6e7ff0c7eab9dc0
https://doi.org/10.1109/tpds.2017.2677451
https://doi.org/10.1109/tpds.2017.2677451
Publikováno v:
The VLDB Journal. 27:669-692
Database architectures typically process queries one at a time, executing concurrent queries in independent execution contexts. Often, such a design leads to unpredictable performance and poor scalability. One approach to circumvent the problem is to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44ed9766ee534707f2bb5e88058da8df
https://doi.org/10.1007/s00778-017-0475-4
https://doi.org/10.1007/s00778-017-0475-4
Publikováno v:
The VLDB Journal. 27:617-641
It has been a recognized fact for many years that query execution can benefit from pushing grouping operators down in the operator tree and applying them before a join. This so-called eager aggregation reduces the size(s) of the join argument(s), mak
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b40f6d978459d519d8865289e7e7841e
https://doi.org/10.1007/s00778-017-0476-3
https://doi.org/10.1007/s00778-017-0476-3
Publikováno v:
ACM SIGMOD Record. 46:33-40
Joins are expensive, and online aggregation over joins was proposed to mitigate the cost, which offers users a nice and flexible tradeoff between query efficiency and accuracy in a continuous, online fashion. However, the state-of-the-art approach, i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::acd04556b4536ec38388d004892b1100
https://doi.org/10.1145/3093754.3093763
https://doi.org/10.1145/3093754.3093763
Publikováno v:
Advanced Computational Methods for Knowledge Engineering ISBN: 9783030383633
ICCSAMA
ICCSAMA
MapReduce has become the dominant programming model for analyzing and processing large-scale data. However, the model has its own limitations. It does not completely support iterative computation, caching mechanism, and operations with multiple input
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eccd97a4f32c3acae218f673a1c84587
https://doi.org/10.1007/978-3-030-38364-0_35
https://doi.org/10.1007/978-3-030-38364-0_35