Abstract
As P2P systems evolve into a platform for full-fledged distributed database management systems, the need arises for sophisticated query support and guarantees on query correctness. While there has been recent work addressing range queries in P2P systems, the work on query correctness is just beginning. Linga et al.[1] provided the first formal definition of correctness for range queries in P2P systems and described a lock-based range query technique that is provably correct. A natural question that arises is whether it is possible to develop a lock-free protocol that can meet the same guarantee of correctness. In this paper, we demonstrate the feasibility of lock-free correct protocols by first developing a simple, proof-of-concept query protocol and verifying that this protocol meets the correctness conditions. We then describe a more robust extended protocol and prove that for stable systems with only item insertions, item deletions, and item redistributions, this extension insures that every range query can be satisfied correctly.
This research was funded in part by NSF grants IIS 02-23022, CNF 04-23336, and INT 00-95527.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Patterson, S., Agrawal, D., El Abbadi, A. (2007). Guaranteeing Correctness of Lock-Free Range Queries over P2P Data. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, JH., Ouksel, A.M. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P DBISP2P 2006 2005. Lecture Notes in Computer Science, vol 4125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71661-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-71661-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71660-0
Online ISBN: 978-3-540-71661-7
eBook Packages: Computer ScienceComputer Science (R0)