Full Text:
<3100>
CLC number: TP391
On-line Access: 2024-08-27
Received: 2023-10-17
Revision Accepted: 2024-05-08
Crosschecked: 0000-00-00
Cited: 0
Clicked: 5648
Study on semantic-oriented hybrid indexing strategy of resource metadata in peer-to-peer network
| |||||||||||||
LIU Zhen, ZHOU Mao-wei, HUANG Hong-bin, LUO Xue-shan. Study on semantic-oriented hybrid indexing strategy of resource metadata in peer-to-peer network[J]. Journal of Zhejiang University Science A, 2007, 8(1): 88-94.
@article{title="Study on semantic-oriented hybrid indexing strategy of resource metadata in peer-to-peer network",
author="LIU Zhen, ZHOU Mao-wei, HUANG Hong-bin, LUO Xue-shan",
journal="Journal of Zhejiang University Science A",
volume="8",
number="1",
pages="88-94",
year="2007",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2007.A0088"
}
%0 Journal Article
%T Study on semantic-oriented hybrid indexing strategy of resource metadata in peer-to-peer network
%A LIU Zhen
%A ZHOU Mao-wei
%A HUANG Hong-bin
%A LUO Xue-shan
%J Journal of Zhejiang University SCIENCE A
%V 8
%N 1
%P 88-94
%@ 1673-565X
%D 2007
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2007.A0088
TY - JOUR
T1 - Study on semantic-oriented hybrid indexing strategy of resource metadata in peer-to-peer network
A1 - LIU Zhen
A1 - ZHOU Mao-wei
A1 - HUANG Hong-bin
A1 - LUO Xue-shan
J0 - Journal of Zhejiang University Science A
VL - 8
IS - 1
SP - 88
EP - 94
%@ 1673-565X
Y1 - 2007
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2007.A0088
Abstract: Applying ontology to describe resource metadata richly in the peer-to-peer environment has become current research trend. In this semantic peer-to-peer environment, indexing semantic element of resource description to support efficient resource location is a difficult and challenging problem. This paper provided a hybrid indexing architecture, which combines local indexing and global indexing. It uses community strategy and semantic routing strategy to organize key layer metadata element and uses DHT (distributed hash table) to index extensional layer metadata element. Compared with related system, this approach is more efficient in resource location and more scalable.
[1] Dabek, F., Kaashoek, M., Karger, D., Morris, R., Stoica, I., 2001. Wide-area Cooperative Storage with CFS. SOSP’01. ACM Press, New York, p.202-215.
[2] Ehrig, M., Haase, P., Siebes, R., Staab, S., Stuckenschmidt, H., Studer, R., Tempich, C., 2003. The SWAP Data and Metadata Model for Semantics-Based Peer-to-Peer Systems. Proc. MATES 2003. Springer, Erfurt, Germany, 2831:144-155.
[3] Liu, Z., Deng, S., Luo, X.S., Huang, H.B., 2006. Research on dynamic resource matching approach based on multi-ontology semantic similarity in peer-to-peer network. Computer Science, 31(3):42-45.
[4] Matei, R., Iamnitchi, A., Foster, P., 2002. Mapping the Gnutella network: properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing, 6(1):50-57.
[5] National Institute of Standards and Technology, 1995. Publication 180-1: Secure Hash Standard.
[6] Nejdl, W., Wolf, B., Qu, C., Decker, S., Sintek, M., Naeve, A., Nilsson, M., Palmér, M., Risch, T., 2002. EDUTELLA: A P2P Networking Infrastructure Based on RDF. Http://cid.nada.kth.se/pdf/CID-205.pdf
[7] Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S., 2001. A Scalable Content-addressable Network. Proc. ACM SIGCOMM. ACM Press, p.162-172.
[8] Rowstron, A., Druschel, P., 2001a. Storage Management and Caching in PAST, a Large-Scale, Persistent Peer-to-Peer Storage Utility. SP’01. ACM Press, Banff, p.188-201.
[9] Rowstron, A., Druschel, P., 2001b. Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems. IFIP/ACM International Conference on Distributed Systems Platforms (Middleware). Heidelberg, Germany, p.329-350.
[10] Stoica, I., Morris, R., Karger, D., 2001. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. Proc. ACM SIGCOMM, p.149-160.
Open peer comments: Debate/Discuss/Question/Opinion
<1>