Abstract
In many distributed applications, pairs of queries and values are evaluated by participating nodes. This includes keyword search for documents, selection queries on tuples, and publish-subscribe. These applications require that all values accepted by the query be evaluated. To carry out this evaluation we will present the peer-to-peer based Bit Zipper Rendezvous which partitions query-value pairs as opposed to values only. Even for problems that allow an efficient value-based partition, the Bit Zipper complements existing solutions with its generality. Where flooding to N nodes used to be the only fall-back, the Bit Zipper is a replacement needing only \(O(\sqrt{N})\). For problems requiring that all pairs be evaluated, we will show that the Bit Zipper Rendezvous is optimal.
This work was partially funded by the German National Science Foundation (DFG) as part of the Graduate Colleges “Enabling Technologies for E-Commerce” and “System Integration for Ubiquitous Computing”. A long version of this paper is provided as technical report in [19].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
The 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), San Diego, California, USA (2001)
The 1st International Workshop on Peer-to-Peer Systems (IPTPS 2002). MIT Faculty Club, Cambridge, MA, USA (March 2002)
Aberer, K.: P-Grid: A Self-Organizing access structure for P2P information systems. In: Proc. of the 6th Intl. Conference on Cooperative Information Systems (CoopIS 2001), Trento, Italy (2001)
Eugster, P.T., Felber, P.A., Guerraoui, R., Kermarrec, A.-M.: The many faces of publish/subscribe. ACM Computing Surveys 35(2) (2003)
Gnawali, O.D.: A keyword set search system for Peer-to-Peer networks. Master’s thesis, Massachusetts Institute of Technology (June 2002)
Harren, M., Hellerstein, J.M., Huebsch, R., Loo, B.T., Shenker, S., Stoica, I.: Complex queries in DHT-based Peer-to-Peer networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 242. Springer, Heidelberg (2002) [2]
Li, J., Loo, B.T., Hellerstein, J., Kaashoek, F., Karger, D.R., Morris, R.: On the feasibility of Peer-to-Peer web indexing and search. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)
Lv, Q., Ratnasamy, S., Shenker, S.: Can heterogeneity make gnutella scalable? In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 94. Springer, Heidelberg (2002) [2]
Maymounkov, P., Mazieres, D.: Kademlia: A peer-to-peer information system based on the XOR metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 53. Springer, Heidelberg (2002) [2]
M‘̀uhl, G.: Large-Scale Content-Based Publish/Subscribe Systems. PhD thesis, Darmstadt University of Technology (September 2002)
Pietzuch, P., Bacon, J.: Hermes: A distributed event-based middleware architecture. In: Proc. of the 1st Intl. Workshop on Distributed Event-Based Systems (DEBS 2002), Vienna, Austria (July 2002)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proc. of the 2001 ACM SIGCOMM Conference (2001) [1]
Reynolds, P., Vahdat, A.: Efficient peer-to-peer keyword searching. Technical report, Duke University (September 2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale Peer-to-Peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Rowstron, A., Kermarrec, A.-M., Castro, M., Druschel, P.: SCRIBE: The design of a large-scale event notification infrastructure. In: Crowcroft, J., Hofmann, M. (eds.) NGC 2001. LNCS, vol. 2233, p. 30. Springer, Heidelberg (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A scalable Peer-To-Peer lookup service for internet applications. In: Proc. of the 2001 ACM SIGCOMM Conference (2001) [1]
Sun Microsystems Inc. Java message service specification 1.1 (2002)
Tam, D., Azimi, R., Jacobsen, H.-A.: Building Content-Based Publish/Subscribe systems with distributed hash tables. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol. 2944, pp. 138–152. Springer, Heidelberg (2004)
Terpstra, W.W., Behnel, S., Fiege, L., Kangasharju, J., Buchmann, A.: Bit zipper rendezvous - optimal data placement for general p2p queries. Technical report, TU Darmstadt (2004), http://www.dvs1.informatik.tu-darmstadt.de/publications/pdf/zipper.pdf
Terpstra, W.W., Behnel, S., Fiege, L., Zeidler, A., Buchmann, A.: A Peer-to-Peer Approach to Content-Based Publish/Subscribe. In: Proc. of the 2nd Intl. Workshop on Distributed Event-Based Systems (DEBS 2003), San Diego, CA, USA (June 2003)
Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical report, Computer Science Division, U. C. Berkeley (April 2001)
Zhuang, S., Zhao, B., Joseph, A., Katz, R., Kubiatowicz, J.: Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In: Intl. Workshop on Network and OS Support for Digital A/V (NOSSDAV 2001) (June 2001)
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
Terpstra, W.W., Behnel, S., Fiege, L., Kangasharju, J., Buchmann, A. (2004). Bit Zipper Rendezvous Optimal Data Placement for General P2P Queries. In: Lindner, W., Mesiti, M., Türker, C., Tzitzikas, Y., Vakali, A.I. (eds) Current Trends in Database Technology - EDBT 2004 Workshops. EDBT 2004. Lecture Notes in Computer Science, vol 3268. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30192-9_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-30192-9_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23305-3
Online ISBN: 978-3-540-30192-9
eBook Packages: Computer ScienceComputer Science (R0)