Distributed suffix tree overlay for peer-to-peer search

被引:20
作者
Zhuge, Hai [1 ]
Feng, Liang [1 ]
机构
[1] Chinese Acad Sci, Inst Comp Technol, Key Lab IIP, Beijing 100080, Peoples R China
基金
中国国家自然科学基金;
关键词
DHT; knowledge grid; peer-to-peer; semantic overlay; suffix tree; load balance;
D O I
10.1109/TKDE.2007.190688
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Establishing an appropriate semantic overlay on peer-to-peer (P2P) networks to obtain both semantic ability and scalability is a challenge. Current DHT-based P2P networks are limited in their ability to support a semantic search. This paper proposes the Distributed Suffix Tree (DST) overlay as the intermediate layer between the DHT overlay and the semantic overlay to support the search of a keyword sequence. Its time cost is sublinear with the length of the keyword sequence. Analysis and experiments show that the DST-based search is fast, load-balanced, and useful in realizing an accurate content search on P2P networks.
引用
收藏
页码:276 / 285
页数:10
相关论文
共 15 条
  • [1] CUENCAACUNA FM, 2002, P INT WORKSH PEER TO, P220
  • [2] Data indexing in peer-to-peer DHT networks
    Garcés-Erice, L
    Felber, PA
    Biersack, EW
    Urvoy-Keller, G
    Ross, KW
    [J]. 24TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2004, : 200 - 208
  • [3] Hai ZG, 2007, IEEE T KNOWL DATA EN, V19, P759, DOI [10.1109/TKDE.2007.1035., 10.1109/TKDE.2007.1035]
  • [4] Harren M, 2002, LECT NOTES COMPUT SC, V2429, P242
  • [5] Li JY, 2003, LECT NOTES COMPUT SC, V2735, P207
  • [6] SPACE-ECONOMICAL SUFFIX TREE CONSTRUCTION ALGORITHM
    MCCREIGHT, EM
    [J]. JOURNAL OF THE ACM, 1976, 23 (02) : 262 - 272
  • [7] RATNASAMY P, 2001, P 2001 ACM SIGCOMM I, P161
  • [8] REYNOLDS P, 2003, P INT MIDDL C JUN, P21
  • [9] Rowstron A., 2001, Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), V2218, P329, DOI 10.1007/3-540-45518-3_18
  • [10] STOICA I, 2001, P 2001 ACM SIGCOMM C, P149, DOI DOI 10.1145/383059.383071