الفهرس Only 14 pages are availabe for public view
 |  | from | 83 |  |  |
| | | from | 83 | | |
Abstract
Processing database queries over peer-to-peer (P2P) overlay networks is one of the hot topics in both Database area and Peer to Peer Systems area. Researchers of Database systems are interested in supporting complex database queries over Peer-to-Peer systems. One of the major challenges needed to achieve this goal is the handling of the range queries. Many systems were proposed for finding approximate answers for the range queries by finding data ranges that are similar to the requested query, an approach that is not guaranteed to cover the entire requested range leading to inaccurate results. In this thesis, we propose a new approach for structured peer-to-peer systems that is able to find exact answers for the range queries. The system has the following characteristics. First, it guarantees to locate exact tuples of the requested range. Secondly, the average route length to locate the intended peer (which has the required range) is O(log N) peers in a peer-to-peer network with N peers. Performance evaluation experiments were done using PlanetSim simulator which simulates the structured peer-to-peer systems. The simulation results show that the system is capable of obtaining the entire requested ranges without violating the scalability of the P2P systems ..