Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Can Heterogeneity Make Gnutella Scalable?
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Complex Queries in DHT-based Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
P-Grid: A Self-Organizing Access Structure for P2P Information Systems
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Hermes: A Distributed Event-Based Middleware Architecture
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
SCRIBE: The Design of a Large-Scale Event Notification Infrastructure
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
A peer-to-peer approach to content-based publish/subscribe
Proceedings of the 2nd international workshop on Distributed event-based systems
Data management research at Technische Universität Darmstadt
ACM SIGMOD Record
Distributed SQL queries with BubbleStorm
From active data management to event-based systems and more
| Hi-index | 0.00 |
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.