Bit Zipper Rendezvous: Optimal Data Placement for General P2P Queries

Abstract

In many distributed applications, pairs of predicates and data have to be evaluated locally. This includes publish-subscribe, keyword search for documents, and selection queries on tuples. We will present the Bit Zipper Rendezvous as a peer-to-peer based solution to these problems. Though not as efficient as value-based partitioning approaches, the Bit Zipper's generality complements them. Where ooding to N nodes used to be the fall-back, the Bit Zipper is a replacement needing only O(pN). Finally, for the all-pairs variant of these problems, we will show the optimality of our approach