Abstract
We study the problem of evaluating RDF queries over structured overlay networks. We consider the publish/subscribe scenario where nodes subscribe with long-standing queries and receive notifications whenever triples matching their queries are inserted in the network. In this paper we focus on conjunctive multi-predicate queries. We demonstrate that these queries are useful in various modern applications e.g., distributed digital libraries or Grid resource discovery. Conjunctive multi-predicate queries are hard to answer since multiple triples are necessary for their evaluation, and these triples will usually be inserted in the network asynchronously. We present and evaluate query processing algorithms that are scalable and distribute the query processing load evenly.
This work was supported in part by the European Commission project Ontogrid (http://www.ontogrid.net/).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Liarou, E., Idreos, S., Koubarakis, M. (2007). Publish/Subscribe with RDF Data over Large Structured Overlay Networks. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, JH., Ouksel, A.M. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P DBISP2P 2006 2005. Lecture Notes in Computer Science, vol 4125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71661-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-71661-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71660-0
Online ISBN: 978-3-540-71661-7
eBook Packages: Computer ScienceComputer Science (R0)