Abstract
This paper describes a Peer-to-Peer Range (PePeR) addressing space to process the “select” relational algebra operator. PePeR consists of several novel design decisions to support both exact-match and range selection predicates. First, it constructs Z ranges per node in order to efficiently route predicates in a decentralized manner. Second, it employs interleaved range declustering to minimize mean time to data loss in the presence of node removal(s). Third, it uses innovative techniques to adjust its addressing space in the presence of node insertion. The insertion of nodes is done in a distributed manner and we present a technique that approximates a uniform distribution of records across the nodes. In addition, we present performance numbers from PePeR and compare it with a distributed hash table (DHT). The obtained results show the following. If the workload of a relation is dominated by range predicates then PePeR is a superior alternative. On the other hand, if the workload of a relation is primarily exact-match retrievals (selection predicates using the equality comparison operator), then a DHT provides better performance. Both PePeR and DHT may co-exist in a peer-to-peer system simultaneously, enabling a database specialist to employ DHT with one relation and PePeR with another.
This research was supported in part by an unrestricted cash gift from Microsoft Research.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aspnes, J., Shah, G.: Skip Graphs. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (January 2003)
Andrzejak, A., Xu, Z.: Scalable, Efficient Range Queries for Grid Information Services. In: Proceedings of the Second IEEE International Conference on Peer-to-Peer Computing (P2P 2002), Linköping University, Sweden (September 2002)
Cai, M., Frank, M., Chen, J., Szekely, P.: MAAN: A Multi-Attribute Addressable Network for Grid Information Services. In: Proceedings of the Fourth International Workshop on Grid Computing (Grid 2003), Phoenix, Arizona (November 2003)
Cohen, E., Shenker, S.: Replication Strategies in Unstructured Peer-to- Peer Networks. Proceedings of the ACM SIGCOMM (August 2002)
Gupta, A., Agrawal, D., El Abbadi, A.: Approximate Range Selection Queries In Peer-to-Peer Systems. In: Proceedings of the First Biennial Conference on Innovative Data Systems Research, Asilomar, California, United States (January 2003)
Ghandeharizadeh, S., DeWitt, D., Qureshi, W.: A Performance Analysis of Alternative Multi-Attribute Declustering Strategies. In: Proceedings of the 1992 ACM-SIGMOD Conference (May 1992)
Ghandeharizadeh, S., Gao, S., Gahagan, C., Krauss, R.: High Performance Parallel Database Management Systems. In: Blazewicz, J., Kubiak, W., Morzy, T., Rusinkiewicz, M. (eds.) Handbook on Data Management and Information Systems, Springer, Heidelberg (2003)
Harren, M., Hellerstein, J.M., Huebsch, R., Loo, B.T., Shenker, S., Stoica, I.: Complex Queries in DHT-based Peer-to-Peer Networks. In: Proceedings of First International Workshop on Peer-to-Peer Systems (March 2002)
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: OceanStore: An Architecture for Global-scale Persistent Storage. In: Proceedings of ACM ASPLOS, November 2000, ACM, New York (2000)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proceedings of the 16th Annual ACM International Conference on Supercomputing (2002)
Litwin, W., Neimat, M.-A., Schneider, D.A.: LH* - A Scalable, Distributed Data Structure. TODS 21(4), 480–525 (1996)
Moon, B., Saltz, J.: Scalability Analysis of Declustering Methods for Multidimensional Range Queries. IEEE Transactions on Knowledge and Data Engineering 10(2), 310–327 (1998)
Plaxton, C., Rajaram, R., Richa, A.W.: Accessing Nearby Copies of Replicated Objects in a Distributed Environment. In: Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA) (June 1997)
Pugh, W.: Skip Lists: A Probabilistic Alternative to Balanced Trees. Communications of the ACM 33(6), 668–676 (1990)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content Addressable Network. ACM SIGCOMM (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. ACM SIGCOMM (2001)
Theimer, M., Jones, M.: Overlook: Scalable Name Service on an Overlay Network. In: The 22nd International Conference on Distributed Computing Systems (July 2002)
Triantafillou, P., Xiruhaki, C., Koubarakis, M., Ntarmos, N.: Towards High Performance Peer-to-Peer Content and Resource Sharing Systems. In: Proceedings of the First Biennial Conference on Innovative Data Systems Research, Asilomar, California, United States (January 2003)
Vingralek, R., Breitbart, Y., Weikum, G.: Snowball: Scalable Storage on Networks of Workstations with Balanced Load. Distributed and Parallel Databases 6(2), 117–156 (1998)
Yang, B., Garcia-Molina, H.: Comparing Hybrid Peer-to-Peer Systems. The VLDB Journal, 561–570 (September 2001)
Zimmermann, R., Ghandeharizadeh, S.: HERA: Heterogeneous Extension of RAID. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2000) (June 2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daskos, A., Ghandeharizadeh, S., An, X. (2004). PePeR: A Distributed Range Addressing Space for Peer-to-Peer Systems. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P 2003. Lecture Notes in Computer Science, vol 2944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24629-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-24629-9_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20968-3
Online ISBN: 978-3-540-24629-9
eBook Packages: Springer Book Archive