원문정보
보안공학연구지원센터(IJDTA)
International Journal of Database Theory and Application
Vol.8 No.5
2015.10
pp.305-314
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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
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
저자정보
참고문헌
자료제공 : 네이버학술정보