
TL;DR
This paper proposes a method for multi-query optimization in GLADE by generating shared join plans to maximize data sharing and reduce retrieval time in distributed data analytics systems.
Contribution
It introduces a technique for creating optimal join plans that enable multiple queries to be executed simultaneously, enhancing efficiency in GLADE.
Findings
Shared join plans increase query processing efficiency.
Maximized data sharing reduces overall data retrieval.
Improved parallelization in distributed systems.
Abstract
SQL-on-Hadoop systems, query optimization, data distribution over multiple nodes and parallelization techniques are few of the areas under extreme research these days. Big names like Amazon, Google, Microsoft and many more are working on implementing systems for faster access of data from multiple nodes reducing data mobility and increasing the parallelization. Queries are retrieved and reviewed by the database systems in an efficient way in the least amount of time by the introduction of various parallelization techniques by running the same query in parallel over different nodes carrying the data. Apart from multi-threading parallelization, there is another way of parallelization that can be performed in order to further reduce retrieval time hence improving the efficiency of the system; parallelization on user queries on top of a DBMS/RDBMS. In this paper, we will study one such…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Advanced Database Systems and Queries · Cloud Computing and Resource Management
