Distributed top-k full-text content dissemination

被引:1
|
作者
Rao, Weixiong [1 ]
Chen, Lei [1 ]
机构
[1] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Kowloon, Hong Kong, Peoples R China
关键词
Distributed document dissemination; Keywords-based document filtering; top-k query;
D O I
10.1007/s10619-012-7096-0
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The World Wide Web (WWW) is experiencing an explosive growth of live content. To timely disseminate end users with fresh content that is relevant to users' interests is a very useful but challenging task. In this paper we design a distributed top-k document dissemination scheme: by inputting query terms and a number k as subscription conditions, end users subscribe to the top-k most relevant documents. When the documents and subscription conditions are distributed, the difficulties are how to forward the personalized top-k documents to the needed users with low forwarding cost. To this end, we propose document forwarding and filtering algorithms on a set of dedicate servers. Experiments based on real query logs and document datasets show the efficiency of our proposed algorithms.
引用
收藏
页码:273 / 301
页数:29
相关论文
共 50 条
  • [1] Distributed top-k full-text content dissemination
    Weixiong Rao
    Lei Chen
    [J]. Distributed and Parallel Databases, 2012, 30 : 273 - 301
  • [2] A distributed full-text top-k document dissemination system in distributed hash tables
    Weixiong Rao
    Lei Chen
    [J]. World Wide Web, 2011, 14 : 545 - 572
  • [3] A distributed full-text top-k document dissemination system in distributed hash tables
    Rao, Weixiong
    Chen, Lei
    [J]. WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2011, 14 (5-6): : 545 - 572
  • [4] Building a distributed full-text index for the Web
    Melnik, S
    Raghavan, S
    Yang, B
    Garcia-Molina, H
    [J]. ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2001, 19 (03) : 217 - 241
  • [5] FULL-TEXT TO THE DESK-TOP - THE TULIP PROJECT
    HUNTER, K
    ZIJLSTRA, J
    [J]. ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 1995, 209 : 36 - CINF
  • [6] Approximate distributed top-k queries
    Boaz Patt-Shamir
    Allon Shafrir
    [J]. Distributed Computing, 2008, 21 : 1 - 22
  • [7] Distributed Top-k subgraph matching
    Lan C.
    Zhang Y.
    Xing C.
    [J]. Xing, Chunxiao (xingcx@tsinghua.edu.cn), 1600, Tsinghua University (56): : 871 - 877
  • [8] Optimizing Distributed Top-k Queries
    Neumann, Thomas
    Bender, Matthias
    Michel, Sebastian
    Schenkel, Ralf
    Triantafillou, Peter
    Weikum, Gerhard
    [J]. WEB INFORMATION SYSTEMS ENGINEERING - WISE 2008, PROCEEDINGS, 2008, 5175 : 337 - +
  • [9] Distributed Top-k Pattern Mining
    Wang, Xin
    Xiang, Mingyue
    Zhan, Huayi
    Lan, Zhuo
    He, Yuang
    He, Yanxiao
    Sha, Yuji
    [J]. WEB AND BIG DATA, APWEB-WAIM 2021, PT II, 2021, 12859 : 203 - 220
  • [10] Secure Distributed Top-k Aggregation
    Jonsson, Kristjan V.
    Palmskog, Karl
    Vigfusson, Ymir
    [J]. 2012 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2012,