Continuous Join Query Processing over Structured Overlay Networks

Yang Liu; Ke Jun Zhao; Yi Hong Qiu; Qi Liu

doi:10.4028/www.scientific.net/KEM.467-469.859

Paper Titles

Dynamic OD Estimation under Automated Vehicle Identification Environment
p.835

Measurement of the Incident Sound Power in Ducts and Effect Factors Analysis
p.841

Pricing Scheme Based Nash Q-Learning Flow Control for Multi-User Network
p.847

Modeling and Simulation of Lean Supply Chain with the Consideration of Delivery Consolidation
p.853

Continuous Join Query Processing over Structured Overlay Networks
p.859

Base on Honeywell Business FLEX® PKS™ Planning and Scheduling Optimization Engineering Study
p.862

Research of WBS-Based Project Quantitative Portfolio Decision-Making Model
p.866

Absorption Simulation of Micro-Structual Material on BK7
p.873

A Kind of NLP Algorithm with NCP Function
p.877

HomeKey Engineering MaterialsKey Engineering Materials Vols. 467-469Continuous Join Query Processing over Structured...

Continuous Join Query Processing over Structured Overlay Networks

Abstract:

P2P network is more suitable for distributed data flow processing. This paper concentrates on how to answer continuous join query in structured p2p overlay networks. In the algorithm proposed, the data that cannot contribute the queries’ results will not be distributed in the network based on global query indices. Experiment shows that the algorithm ensures the availability of join query and network traffic is reduced.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Key Engineering Materials (Volumes 467-469)

Pages:

859-861

DOI:

https://doi.org/10.4028/www.scientific.net/KEM.467-469.859

Citation:

Cite this paper

Online since:

February 2011

Authors:

Yang Liu, Ke Jun Zhao, Yi Hong Qiu, Qi Liu

Keywords:

Continuous Query, Distribute Hash Table (DHT), Equal-Join, Peer-to-Peer (P2P)

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] STOICA, I, MORRIS. R, KARGER.D. Chord: a scalable peer-to-peer lookup service for internet applications. Annual Conf. of the Special Interest Group on Data Communication (SIGCOMM 2001). New York: Association for Computing Machinery, 2001. 124-137.

DOI: 10.1145/964723.383071

Google Scholar

[2] RATNASAMY, S, FRANCIS, P, HANDLEY,M. A scalable content-addressable network. SIGCOMM '01. New York: Association for Computing Machinery, 2001. 168-175.

DOI: 10.1145/964723.383072

Google Scholar

[3] ROWSTRON, A, RUSCHEL,P. Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. Int'l Conf. on Distributed Systems Platforms (Middleware 2001). New York: Association for Computing Machinery, 2001. 135-141.

DOI: 10.1007/3-540-45518-3_18

Google Scholar

[4] KARGER. D, LEHMAN. E, LEIGHTON.F. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. Proc of the 29th Annual ACM Symp. on Theory of Computing. New York: Association for Computing Machinery, 1997. 654-663.

DOI: 10.1145/258533.258660

Google Scholar

[5] HUEBSCH, R., HELLERSTEIN, J.M., LANHAM, N., LOO, B.T., SHENKER, S. Querying the Internet with PIER. In: Int. Conf. on Very Large Databases (2002).

DOI: 10.1016/b978-012722442-8/50036-7

Google Scholar

[6] BALKE. W, NEJDL. W, SIBERSKI. W, THADEN.U. Progressive distributed top-k retrieval in peer-to-peer networks. ICDE'05. Washington : IEEE Computer Society , 2005. 174-185.

DOI: 10.1109/icde.2005.115

Google Scholar

[7] MOURATIDIS. K, BAKIRAS. S, PAPADIAS.D. Continuous monitoring of top-k queries over sliding windows. SIGMOD '06. New York: Association for Computing Machinery, 2006. 635-646.

DOI: 10.1145/1142473.1142544

Google Scholar

[8] IDREOS. S, TRYFONOPOULOS. C, KOUBARAKIS.M. Distributed evaluation of continuous equi-join queries over large structured overlay networks. ICDE'06. Washington : IEEE Computer Society , 2005. 43-54.

DOI: 10.1109/icde.2006.50

Google Scholar

[9] IDREOS. S, LIAROU. E, KOUBARAKIS.M. Continuous multi-way joins over distributed hash tables. EDBT'08. New York: Association for Computing Machinery, 2008. 594-605.

DOI: 10.1145/1353343.1353415

Google Scholar