Resource management in National parks (NP), Nature reserve (NR) aim to hold the status of biological resources of the area [4]. Up to now, Vietnam has established 31 NP and about 100 NR. Most of NR, NP was completed build biological database [4]. The traditional information sharing method has showed the limitations, causing many difficulties for the users, particularly when exploring the map information. WebGIS technology developed quickly with the functions included: internet access, query spatial data in the Internet, which has promoted the possibility aid, consult spatial data, link between tables and map [1, 5, 7]. Biodiversity Database of Xuan Lien NR was built based on tables and maps. The table database is designed as relational data, including the information and records. With animals is Class - Order - Family – Species and plants is Plant - Phylum - Family - Species. The code of the species included 4 parts. One part of character and 3 parts of numbers. The database are the records of 1142 plant species, 55 mammal species, 190 birds, 38 reptiles and 35 amphibians species. The map database include base map, zonation map, infrastructure maps, vegetation and distribution map of species in protected areas. Display Biodiversity data of NR by MapServer, showing base map, zonation map, infrastructure maps, vegetation and habitat map. Using the combined technologies of Remote Sensing, GIS and WebGIS to manage, display, sharing biodiversity data of NR promotion optimization capabilities in data analyses and combined tables with map. This technology may apply for management biodiversity database of all protected areas in Vietnam.

This paper proposes a density optimal method, named as DO-TPR*-tree, which improves the performance of the original TPR*-tree significantly. In this proposed method, the search algorithm will enforce firing up MBR adjustment on a node, if the condition, based on density optimal for the area of its MBR, is satisfied at a query time. So, all queries occurred after that time will be prevented from being misled as to an empty space of this node. The definition of Node Density Optimal is also introduced to be used in search algorithm. The algorithm of this method is proven to be correct in this paper. Several experiments and performed comparative evaluation are carried out. In the environment with less update rates (due to disconnected) or high query rates, the method can highly enhance query performance and runs the same as the TPR*-tree in other cases.