Abstract
Processing queries in distributed databases require the conversion and transmission of data from local and global sites. A query can be used to create a different executive plan of the query, which these plans are equal in size, meaning that they achieve the same result, but differ in the order in which the operators are executed and how they are executed, and therefore in their performance. The problem of query optimization in the distributed database is NP-hard in nature and difficult to solve. Exploring all the query plans in large search space is not feasible. The purpose and motivation of this paper are to examine the query challenges in the distributed databases and algorithms for the executive plan of the query.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
