Substring matching in P2P content-based publish/subscribe data management networks

Aekaterinidis, I. and Triantafillou, P. (2007) Substring matching in P2P content-based publish/subscribe data management networks. In: 23rd International Conference on Data Engineering (ICDE 2007), Istanbul, Turkey, 15-20 Apr 2007, pp. 1390-1394. (doi:10.1109/ICDE.2007.369019)

Full text not currently available from Enlighten.


The content-based publish/subscribe (pub/sub) paradigm for system design is becoming increasingly popular, offering unique benefits for a large number of data-intensive applications. Coupled with the peer-to-peer technology, it can serve as a central building block for such applications deployed over a large-scale network infrastructure. A key problem toward the creation of large-scale content-based pub/sub infrastructures relates to dealing efficiently with continuous queries (subscriptions) with rich predicates on string attributes; in this work we study the problem of efficiently and accurately matching substring queries to incoming events.

Item Type:Conference Proceedings
Additional Information:Conference Proceedings ISBN: 1424408032
Glasgow Author(s) Enlighten ID:Triantafillou, Professor Peter
Authors: Aekaterinidis, I., and Triantafillou, P.
College/School:College of Science and Engineering > School of Computing Science

University Staff: Request a correction | Enlighten Editors: Update this record