Completeness Estimation of Range Queries in Structured Overlays

Range queries are a very powerful tool in a wide range of data management systems and are vital to a multitude of applications. The hierarchy of structured overlay systems can be utilized in order to provide efficient techniques for processing them, resulting in the support of applications and techniques based on range queries in large-scale distributed information systems. But, due to the limited knowledge and the usually best-effort characteristics, deciding about the completeness of query results, e.g., getting an idea when a query is finished or what amount of results is still missing, is very challenging. There is not only an urgent need to provide this information to the user issuing queries, but also for implementing sophisticated and efficient processing techniques based on them. In this work, we propose a method for solving this task. We discuss the applicability and quality of our estimations, present an implementation and evaluation for the P-Grid system and show how to ...

• Type: Conference
• Year: 2007
• Where: P2P
• Authors: Marcel Karnstedt, Kai-Uwe Sattler, Roman Schmidt
• Keywords: Data Management Systems, P2P 2007, Peer-to-Peer Computing, Range Queries, Structured Overlay Systems