Publish/subscribe with RDF data over large structured overlay networks

被引：0
作者：
Liarou, Erietta [1 ]
Idreos, Stratos [1 ]
Koubarakis, Manolis [1 ]
机构：
[1] Tech Univ Crete, Dept Elect & Comp Engn, GR-73100 Khania, Greece
来源：
DATABASES, INFORMATION SYSTEMS, AND PEER-TO-PEER COMPUTING | 2007年 / 4125卷
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：135 / +
页数：2
相关论文
共 13 条
  • [1] ABERER K, ISWC 04
  • [2] Looking up data in P2P systems
    Balakrishnan, I
    Kaashoek, MF
    Karger, D
    Morris, R
    Stoica, I
    [J]. COMMUNICATIONS OF THE ACM, 2003, 46 (02) : 43 - 48
  • [3] BAWA M, SIGMOD 04
  • [4] CAI M, 2004, J WEB SEM, V2
  • [5] CHIRITA PA, IN PRESS SEMANTIC WE
  • [6] CHIRITA PA, ESWC 04
  • [7] IDREOS S, ICDE 06
  • [8] KOKKINIDIS G, P2P DB 04
  • [9] MILLER L, ISWC 02
  • [10] NEJDL W, 2004, J WEB SEMANT, V1, P177, DOI DOI 10.1016/J.WEBSEM.2003.11.004
12