ACM Home Page
Please provide us with feedback. Feedback
Internet scale string attribute publish/subscribe data networks
Full text PdfPdf (515 KB)
Source Conference on Information and Knowledge Management archive
Proceedings of the 14th ACM international conference on Information and knowledge management table of contents
Bremen, Germany
SESSION: Paper session DB-1 (databases): networks and peer-to-peer table of contents
Pages: 44 - 51  
Year of Publication: 2005
ISBN:1-59593-140-6
Authors
Ioannis Aekaterinidis  University of Patras, Rion-Patras, Greece
Peter Triantafillou  University of Patras, Rion-Patras, Greece
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 64,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1099554.1099565
What is a DOI?

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
 
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
 
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
 
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
 
20
D. Tam, R. Azimi, and H. Jacobsen. Building content-base publish/subscribe systems with distributed hash tables. In Proc. DBISP2P'03, 2003.
21
 
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


Collaborative Colleagues:
Ioannis Aekaterinidis: colleagues
Peter Triantafillou: colleagues