Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/19332
DC FieldValueLanguage
dc.contributor黃胤傅zh_TW
dc.contributor楊東麟zh_TW
dc.contributor洪國寶zh_TW
dc.contributor廖珗洲zh_TW
dc.contributor.advisor賈坤芳zh_TW
dc.contributor.author陳永埕zh_TW
dc.contributor.authorCHEN, YUNG-CHENGen_US
dc.contributor.other中興大學zh_TW
dc.date2007zh_TW
dc.date.accessioned2014-06-06T07:06:33Z-
dc.date.available2014-06-06T07:06:33Z-
dc.identifierU0005-1007200619224800zh_TW
dc.identifier.citation[1] J. Bremer and M. Gertz, An Efficient XML Node Identification and Indexing Scheme, Technical Report CSE-2003-04, Department of Computer Science, University of California at Davis, U.S.A., 2003, pp. 1-14. [2] J. Clark and S. DeRose, “XML Path Language (XPath) Version 1.0,” World Wide Web Consortium (W3C) Recommendation, Nov. 1999, available at http://www.w3.org/TR/XPath. [3] Y. Chen, S. Davidson and Y. Zheng, “BLAS:An Efficient XPath Processing System,” In Proceedings of 23rd ACM SIGMOD International Conference on Management of Data, 2004, pp. 47-58. [4] J. Cheng, G. Yu, G. Wang, and J-X. Yu, “PathGuide: An Efficient Clustering Based Indexing Method for XML Path Expressions,” In Proceedings of the 8th International Conference on Database Systems for Advanced Applications (DASFAA’03), 2003, pp. 257-264. [5] T. Fiebig, S. Helmer, C.-C. Kanne, G. Moerkotte, J. Neumann, R. Schiele, and T. Westmann, “Anatomy of a Native XML Base Management System,” The VLDB Journal — The International Journal on Very Large Data Bases, 2002, pp. 292 - 314. [6] T. Grust, M. Keulen, and J. Teubner, “Accelerating XPath Evaluation in Any RDBMS,” ACM Transactions on Database Systems (TODS), Vol. 29, No. 1, 2004, pp. 91-131. [7] A. Halverson, J. Burger, L. Galanis, A. Kini, R. Krishnamurthy, A. N. Rao, F. Tian, S. D. Viglas, Y. Wang, J. F. Naughton, and D. J. DeWitt “Mixed Mode XML Query Processing,” In Proceedings of 29th International Conference on Very Large Data Bases, 2003, pp. 225-236. [8] H. Jagadish, S. Al-Khalifa, A. Chapman, V. Lakshmanan, A. Nierman, S. Paparizos, J. Patel, D. Srivastava, N.Wiwatwattana, Y. Wu, and C. Yu, “TIMBER: A Native XML Database,” Very Large Data Bases, Vol. 11, No. 4, 2002, pp. 274-291. [9] J. Mchugh, J. Widom, S. Abiteboul, Q. Luo, and A. Ragaraman, Indexing Semistructured Data, Technical Report, Computer Science Department, Stanford University, U.S.A., 1998, pp. 1-21. [10] P. O’Neil, E. O’Neil1, S. Pal, I. Cseri, G. Schaller, and N. Westbury, “ORDPATHs: Insert-Friendly XML Node Labels,” In Proceedings of SIGMOD Conference, 2004, pp. 903-908. [11] D. Scheffner and J.-C. Freytag, “Access Support Tree and TextArray: A Data Structure for XML Document Storage and Retrieval,” In proceedings of the 14th International Conference on Scientific and Statistical Database Management (SSDBM''02), 2002, pp.155-164. [12] I. Tatarinov, S. Viglas, K. Beyer, J. Shanmugasundaram, E. Shekita, and C. Zhang, “Storing and Querying Ordered XML Using a Relational Database System,” In Proceedings of International Conference on Management of Data, 2002, pp.204-215. [13] P. Wadler, Two Semantics for XPath, Technical Report, Software Technology Research Department, Avaya Labs Research, 2000. http://www.research.avayalabs.com/user/wadler/papers/XPath-semantics [14] M. Yoshikawa, T. Amagasa, T. Shimura, and S. Uemura, “XRel: A Path-based Approach to Storage and Retrieval of XML Documents Using Relational Databases,” ACM Transactions on Internet Technology, Vol. 1, No. 1, 2001, pp. 110-141. [15] A. Silberschatz, H. Korth, and S. Sudarshan, Database System Concepts, McGraw-Hill, 2002. [16] 陳錦輝, XML與ASP網站實作大全,金禾資訊股份有限公司, 2001 [17] “Extensible Markup Language,” http://www.w3c.org/XML [18] “Frequently Asked Questions about the Extensible Markup Language,” http://www.ucc.ie/XML. [19] “XML Base and XML Linking,” http://www.w3c.org/XML/Linking [20] “XQuery: A Query Language for XML,” http://www.w3.org/TR/xquery [21] “Introduction to the Dewey Decimal Classification,” http://www.oclc.org/oclc/fp/about/about_the_ddc.htm [22] “DB2 XML Extender,” http://www-306.ibm.com/software/data/db2/extenders/xmlext/ [23] “Berkeley DB Database, XML Database, Native Java Database,” http://www.sleepycat.com/ [24] “XML Data Repository,” http://www.cs.washington.edu/research/xmldatasets/www/repository.htmlzh_TW
dc.identifier.urihttp://hdl.handle.net/11455/19332-
dc.description.abstractXML文件目前已經廣泛運用於網際網路上,逐漸成為網路文件交換的主流,如何從網際網路衆多的XML文件中快速找到所要的資訊,顯得越來越重要。由於XML文件具有半結構化(Semi-structured)的特性,要從這樣具彈性的結構,查詢所需之資料,需要對整個XML文件全面搜索,造成花費太多時間成本。而在常見XML系統中,往往忽略了XML文件的結構特性,但文件之查詢方式主要為結構的查詢,因此本研究將XML的結構與內容分離,並討論文件結構的配置方法,加速一般XPath上結構之查詢,避免搜尋整份文件,降低使用者等待的時間。 本論文的主要貢獻在於提供一種新的儲存策略,並討論其內容配置方法,加速一般的XPath結構查詢。本研究分析了三種配置策略演算法,透過XPath查詢的分析及實驗數據來比較其優劣。zh_TW
dc.description.tableofcontents第1章 簡介 1 第2章 相關研究 4 2.1 XML文件簡介 4 2.1.1 XML文件 4 2.1.2 XPath查詢 6 2.2 XML資料庫之儲存格式 9 2.2.1 表格 9 2.2.2 原生(native)資料格式 9 2.2.3 結構與內容分離的AST/TA 10 2.3 編碼技術 12 2.3.1 Containment Code 12 2.3.2 Dewey code 13 2.4 動態儲存結構 15 2.4.1 結束符號 15 2.4.2 Slotted Page 15 第3章 問題描述與儲存方法 17 3.1 問題描述與假設 17 3.2 基本構想 18 第4章 方法 20 4.1 文件分解儲存 20 4.2 Slotted Page與編碼 20 4.2.1 Slotted Page 20 4.2.2 編碼 22 4.3 Slotted Page節點配置策略 23 4.3.1 深度優先法(DFS) 24 4.3.2 孩子優先法(CFS) 25 4.3.3 元素群組法(element cluster) 26 4.4 分析 28 4.4.1 文件節點 28 4.4.2 空間分析 28 4.4.3 查詢分析 29 4.4.4 還原文件 33 4.5 實作方法 34 4.5.1 編碼方法 34 4.5.2 Slotted Page儲存方法 35 4.5.3 查詢演算法 39 第5章 實作與實驗數據 40 5.1 實驗平台與模擬器架構 40 5.2 XML文件實驗資料 42 5.3 實驗設計 42 5.4 實驗結果及數據分析 43 5.4.1 實驗1結果(空間比較) 43 5.4.2 實驗2結果(XPath查詢) 45 第6章 結論與未來方向 51zh_TW
dc.language.isoen_USzh_TW
dc.publisher資訊科學系所zh_TW
dc.relation.urihttp://www.airitilibrary.com/Publication/alDetailedMesh1?DocID=U0005-1007200619224800en_US
dc.subjectXML documenten_US
dc.subjectXML文件zh_TW
dc.subjectstorage structureen_US
dc.subjectXPath Languageen_US
dc.subject儲存結構zh_TW
dc.subjectXPath查詢語言zh_TW
dc.titleXML實體儲存結構之配置策略zh_TW
dc.titleAllocation Policies for Physical Storage Structure of XML Dataen_US
dc.typeThesis and Dissertationzh_TW
Appears in Collections:資訊科學與工程學系所
文件中的檔案:

取得全文請前往華藝線上圖書館



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.