|
ABSTRACT
With this work we aim to make a three-fold contribution. We first address the issue of supporting efficiently queries over string-attributes involving prefix, suffix, containment, and equality operators in large-scale data networks. Our first design decision is to employ distributed hash tables (DHTs) for the data network's topology, harnessing their desirable properties. Our next design decision is to derive DHT-independent solutions, treating DHT as a black box. Second, we exploit this infrastructure to develop efficient content based publish/subscribe systems. The main contribution here are algorithms for the efficient processing of queries (subscriptions) and events (publications). Specifically, we show that our subscription processing algorithms require O(logN) messages for a N-node network, and our event processing algorithms require O(l x logN) messages (with l being the average string length).Third, we develop algorithms for optimizing the processing of multi-dimensional events, involving several string attributes. Further to our analysis, we provide simulation-based experiments showing promising performance results in terms of number of messages, required bandwidth, load balancing, and response times.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
|
 |
3
|
Antonio Carzaniga , Alexander L. Wolf, Forwarding in a content-based network, Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, August 25-29, 2003, Karlsruhe, Germany
[doi> 10.1145/863955.863975]
|
| |
4
|
M. Castro, P. Druschel, A. Kermarrec, and A. Rowstron. Scribe: A large-scale and decentralized application-level multicast infrastructure. Journal on Selected Areas in Communication, 2002.
|
| |
5
|
|
| |
6
|
|
 |
7
|
|
| |
8
|
|
| |
9
|
Matthew Harren , Joseph M. Hellerstein , Ryan Huebsch , Boon Thau Loo , Scott Shenker , Ion Stoica, Complex Queries in DHT-based Peer-to-Peer Networks, Revised Papers from the First International Workshop on Peer-to-Peer Systems, p.242-259, March 07-08, 2002
|
| |
10
|
N. J. A. Harvey, M. B. Jones, S. Saroiu, M. Theimer, and A. Wolman. Skipnet: A scalable overlay network with practical locality properties. In USITS03, 2003.
|
| |
11
|
R. Huebsch, J. M. Hellerstein, N. Lanham, B. T. Loo, S. Shenker, and I. Stoica. Querying the internet with pier. In VLDB'03, 2003.
|
| |
12
|
G. Koloniari and E. Pitoura. Content-based routing of path queries in peer-to-peer systems. In EDBT'04.
|
| |
13
|
S. W. Ng, B. C. Ooi, K. L. Tan, and A. Zhou. Peerdb: A p2p-based system for distributed data sharing. In ICDE'03, 2003.
|
| |
14
|
V. Papadimos, D. Maier, and K. Tufte. Distributed query processing and catalogs for peer-to-peer systems. In Proc. CIDR'03, 2003.
|
 |
15
|
Sylvia Ratnasamy , Paul Francis , Mark Handley , Richard Karp , Scott Schenker, A scalable content-addressable network, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, p.161-172, August 2001, San Diego, California, United States
|
| |
16
|
|
| |
17
|
|
| |
18
|
S. Shi, G. Yang, D. Wang, J. Yu, S. Qu, and M. Chen. Making peer-to-peer keyword searching feasible using multi-level partitioning. In IPTPS04, 2004.
|
 |
19
|
Ion Stoica , Robert Morris , David Karger , M. Frans Kaashoek , Hari Balakrishnan, 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, p.149-160, August 2001, San Diego, California, United States
|
| |
20
|
D. Tam, R. Azimi, and H. Jacobsen. Building content-base publish/subscribe systems with distributed hash tables. In Proc. DBISP2P'03, 2003.
|
 |
21
|
Wesley W. Terpstra , Stefan Behnel , Ludger Fiege , Andreas Zeidler , Alejandro P. Buchmann, A peer-to-peer approach to content-based publish/subscribe, Proceedings of the 2nd international workshop on Distributed event-based systems, June 08-08, 2003, San Diego, California
[doi> 10.1145/966618.966627]
|
| |
22
|
P. Triantafillou and I. Aekaterinidis. Publish-subscribe over structured p2p networks. In DEBS 04, 2004.
|
| |
23
|
|
| |
24
|
P. Triantafillou and A. Economidis. Subscription summaries for scalability and efficiency in publish/subscribe systems. In DEBS'02, 2002.P. Triantafillou and A. Economidis. Subscription summaries for scalability and efficiency in publish/subscribe systems. In DEBS'02, 2002.
|
| |
25
|
P. Triantafillou, C. Xiruhaki, M. Koubarakis, and N. Ntarmos. Towards high performance peer-to-peer content and resource sharing systems. In CIDR'03.
|
 |
26
|
|
| |
27
|
|
| |
28
|
G. I. Zachary, N. Khandelwal, A. Kapur, and M. Cakir. Orchestra: Rapid, collaborative sharing of dynamic data. In CIDR'05, 2005.
|
| |
29
|
|
 |
30
|
Shelley Q. Zhuang , Ben Y. Zhao , Anthony D. Joseph , Randy H. Katz , John D. Kubiatowicz, Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination, Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video, p.11-20, January 2001, Port Jefferson, New York, United States
[doi> 10.1145/378344.378347]
|
CITED BY 5
|
|
Klaus Berberich , Manolis Koubarakis , Christos Tryfonopoulos , Gerhard Weikum , Christian Zimmer, MAPS: approximate publish/subscribe functionality in peer-to-peer networks, Proceedings of the 1st international workshop on Advanced data processing in ubiquitous computing (ADPUC 2006), November 27-December 01, 2006, Melbourne, Australia
|
|
|
|
|
|
|
|
|
|
|
|
|
|