Dynamic Query Plan for Efficient Query Processing in Peer-to-Peer Environments
Main Article Content
Abstract
In the past few years, Peer-to-Peer (P2P) applications have emerged as a popular way of autonomously sharing data and services in distributed environments. In such environments, peers dynamically join/leave a network and do not usually have any global knowledge about the data sources. This phenomenon demands an efficient query execution strategy in terms of data transmission and response time. In this paper, we propose a distributed query processing technique in P2P environments where each peer possesses partial knowledge of the domain information and collaborates with the participating peers to share data. The cornerstone of our approach is to dynamically determine the best query execution plan in order to execute the different parts of the user query, and propagate the results with minimized data transmission and response time.
Article Details
How to Cite
Masud, M., & Hossain, M. A. (2008). Dynamic Query Plan for Efficient Query Processing in Peer-to-Peer Environments. INFOCOMP Journal of Computer Science, 7(3), 1–6. Retrieved from https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/223
Section
Articles
Upon receipt of accepted manuscripts, authors will be invited to complete a copyright license to publish the paper. At least the corresponding author must send the copyright form signed for publication. It is a condition of publication that authors grant an exclusive licence to the the INFOCOMP Journal of Computer Science. This ensures that requests from third parties to reproduce articles are handled efficiently and consistently and will also allow the article to be as widely disseminated as possible. In assigning the copyright license, authors may use their own material in other publications and ensure that the INFOCOMP Journal of Computer Science is acknowledged as the original publication place.