Publish/subscribe functionality in IR environments using structured overlay networks

Tryfonopoulos, Christos; Idreos, Stratos; Koubarakis, Manolis

doi:10.1145/1076034.1076090

Cited by 39 publications

(43 citation statements)

References 16 publications

(29 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Due to the specifics of k-NN/w queries, which are interested in data objects that are closest to a query point, the CAN overlay network is much better suited for this type of queries than the competing overlay networks such as Chord [28] and P-Grid [1]. The most similar distributed systems to the one that we present in this paper are [29,30,34] since they present structured peer-to-peer publish/subscribe systems which are also built on top of the CAN overlay network. However, when compared to the stateful top-k/w queries in which we are interested in this paper, these approaches only support much simpler stateless continuous queries defined as static subspaces of the given attribute space.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Distributed processing of continuous sliding-window k-NN queries for data stream filtering

2011

View full text Add to dashboard Cite

A sliding-window k-NN query (k-NN/w query) continuously monitors incoming data stream objects within a sliding window to identify k closest objects to a query. It enables effective filtering of data objects streaming in at high rates from potentially distributed sources, and offers means to control the rate of object insertions into result streams. Therefore k-NN/w processing systems may be regarded as one of the prospective solutions for the information overload problem in applications that require processing of structured data in real-time, such as the Sensor Web. Existing k-NN/w processing systems are mainly centralized and cannot cope with multiple data streams, where data sources are scattered over the Internet. In this paper, we propose a solution for distributed continuous k-NN/w processing of structured data from distributed streams. We define a k-NN/w processing model for such setting, and design a distributed k-NN/w processing system on top of the Content-Addressable Network (CAN) overlay. An extensive evaluation using both real and synthetic data sets demonstrates the feasibility of the proposed solution because it balances the load among the peers, while the messaging overhead within the P2P network remains reasonable. Moreover, our results clearly show the solution is scalable for an increasing number of queries and peers.

show abstract

Section: Related Workmentioning

confidence: 99%

“…continuous queries, in distributed environments to find matching publications, i.e. data objects, published by heterogeneous and distributed data sources [30]. The major challenges arising in continuous real-time processing of data streams are related to transmission, real-time computation, and storage of data objects.…”

Section: Introductionmentioning

confidence: 99%

Distributed processing of continuous sliding-window k-NN queries for data stream filtering

2011

View full text Add to dashboard Cite

show abstract

“…In [20] we present a detailed evaluation of DHTrie, a set of protocols that are essentially the LibraRing protocols in the case that all nodes in the system are equal DHT nodes (i.e., there are no super-peers). [20] deals only with the pub/sub case and evaluates the DHTrie protocols only under queries of type T1.…”

Section: Experimental Evaluationmentioning

confidence: 99%

“…[20] deals only with the pub/sub case and evaluates the DHTrie protocols only under queries of type T1. In this section we continue this evaluation for the complete LibraRing protocols using the same data and query set.…”

Section: Experimental Evaluationmentioning

confidence: 99%