Earticle

초록

영어

In WWW, due to the distribution of information resources, how to manage and maintain distributed information resources in different nodes is one of the most important problems in the current research. On the basis of analyzing the scalability, efficiency and effectiveness of data exchange, the paper designed a distributed storage model, discussed the organization of the registry information, put forward a dynamically register and update mechanism, designed a distributed information search algorithm. Experimental results show that the biased flooding search algorithm based on index can not only reduce the message load but also can improve the search hit rate.

목차

Abstract
 1. Introduction
 2. Distributed Information Resource Storage Model
 3. Organization of the Registry
  3.1. Tree Model
  3.2. The Join of a Registry
  3.3. The Exit of a Registry
 4. The Dynamic Register and Update of Information Resource Mechanism
 5. Distributed Information Resource Search Algorithm
  5.1. Local Information Query
  5.2. Distributed Information Query
 6. Conclusion
 Acknowledgment
 References

키워드

저자

• Xiaoxuan Ma [ School of Electrical and Information Engineering, Beijing University of Civil Engineering and Architecture, Beijing, 100044, China ]
• Yiping Huang [ School of Electrical and Information Engineering, Beijing University of Civil Engineering and Architecture, Beijing, 100044, China ]
• Junyan Yi [ School of Electrical and Information Engineering, Beijing University of Civil Engineering and Architecture, Beijing, 100044, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Database Theory and Application

• 간기

  격월간

• pISSN

  2005-4270

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605