在天體觀測中，星體的資料是龐大且是隨時增加的，所以在保存資料上需要非常大量的儲存設備來支援。假如在資料的儲存上缺少一套有效率的管理方法，那麼當研究人員需要使用資料時，就必須親自確認所需的資料位於那些機器上，再逐一的到這些機器上把資料撈取出來，這種行為費時又不切實際。有鑑於此，本論文開發一套多層化的分散式天文資料管理系統。此系統首先使用多層次三角網格來建構出天空模型，來給予星球一個編號來當作資料索引。由於這些編號都是有順序性而且連續的，本論文將伺服器連結成環狀的架構，讓每一個伺服器都負責一段連續但不重複的資料索引值範圍，並使用這些範圍來確認所要保管的資料，另外每二個相鄰的伺服器其所管理的資料索引值範圍都是連續的。而採用環狀架構的原因為其擴充性、容錯性高以及高可用性。此種架構為系統帶來了良好的基礎。
為了加速資料搜尋的效率，此系統必須運行多種不同的服務，因此會大幅的增加機器的負擔，為了要降低機器的負荷，我們將以下三個功能獨立到三層不同的環狀架構。它們分別負責1.將使用者輸入的搜尋條件轉換成系統搜尋命令2.建立資料索引來找出使用者所需的資料以及該資料的存放位置3.儲存星球的實體資料。將這些功能分開運行之後，除了可以降低單台機器的負擔，往後任一個層次運行的功能需要進行調整時，即可直接替換而不需要重新建構整個系統。

The data of star observation is huge and increase continuously. Therefore it needs strong hardware to store these data. If these data lacks of a efficiently manage methodology, users will need to find and get data themselves, it’s not a good and efficient way. In order to solve this problem, this paper proposes a hierarchical design distributed file system to manage these astronomical observation data. First, this system uses Hierarchical Triangular Mesh to compute a key for every star, the values of these keys are sequential, so this paper links the servers in the system to form a ring structure, and let every server manages an unrepeated range of keys, range that every two adjacent servers manage are also continuous. Besides, The reason why adopting ring structure is due to its scalability, fault tolerance and availability, these advantages build the good foundation of the system.
For increase the efficiency of query, the system needs execute multiple services. To reduce the load of servers, this paper builds three level of the ring structure and allocates these services to different layer. These layers are 1. Query Transaction, 2. Data index, 3. Storage. This design not only reduces the load, but also makes these services independent.

[1] Napster, http://www.napster.com
[2] Patrick Kirk (2003). Gnutella File Sharing And Distribution Network, Retrieved June 28, 2007, The Gnutella Homepage: http://rfc-Gnutella.sourceforge.net/
[3] Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S., “ A scalable content-addressable network”, In Proc. ACM SIGCOMM (San Diego, CA, August 2001), pp. 161–172.
[4] I. Stoica, R. Morris et al., “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” IEEE/ACM Trans. Net., vol. 11, no. 1, 2003, pp. 17–32.
[5] Zhao Cao.,Kan Li.,Yushu Liu., “A Multi-Level Super Peer Based P2P Architecture”, Information Networking,2008. ICON 2008.
[6] K. Aberer, P. Cudr´e-Mauroux, A. Datta, Z. Despotovic, M. Hauswirth, M. Punceva, and R. Schmidt. P-grid: A self-organizing structured p2p system. ACM SIGMOD Record, 32(3), 2003.
[7] Fabrizio Marozzo., Domenico Talia., Paolo Trunfio., “P2P-MapReduce：Parallel data processing in dynamic Cloud environments”, Journal of Computer and System Science 78(2012) 1382-1402.
[8] L. Gong, JXTA: A network programming environment, IEEE Internet Comput. 5 (3) (2001) 88–95.
[9] Kunszt, P. Z., Szalay, A. S., Csabai, I., Thakar, A. R., “The Indexing of the SDSS Science Archive,” Proceeding of ADASS IX, 2000, 216, 141–144.
[10] Kunszt, P. Z., Szalay, A. S., and Thakar, A. R., “The Hierarchical Triangular Mesh, in Mining the Sky, ” ed. A. J. Banday, S. Zaroubi, and M. Bartelmann (Berlin: Springer-Verlag), 2001, 631–637.
[11] W. O’Mullane, A.J. Banday, K.M. Gorski, P. Kuntz, A.S. Szalay, “Splitting the Sky – HTM and HEALPix,” Mining the Sky, Banday et al ed, Springer, 2000, p 639–648
[12] SkyServer – HTM, http://www.skyserver.org/HTM/
[13] 鄭凱豪., “Distributed Large-Scale Astronomical Data Management System Based on HTM Index”., ”National Central University”
[14] Alexander S. Szalay, Jim Gary, George Fekete. Peter Z. Kunszt, Peter Kukol, Ani Thakar, “Indexing the Sphere with the Hierarchical Triangular Mesh”, Technical Report MSR-TR-2005-123
[15] Peter Z. Kunszt, Alexander S. Szalay, Aniruddha R. Thakar., “Hierarchical Triangular Meah”., Baltimore MD,21218, USA
[16] Mark R. Calabretta., Boudewijn F. Roukema., “Mapping on HealPix grid”., MNRAS 2007 July 25