參考文獻 |
參考文獻
[1] 林昌正,「多XML文件整合萃取工具之研究」,國立中央大學, 碩士論文,民國97年。
[2] A. Chebotko, D. Liu, M. Atay, S. Lu, F. Fotouhi, Reconstructing XML subtrees from relational storage of XML documents, Proceedings of the Second IEEE International Workshop on XML Schema and Data Management (XSDM05), in conjunction with ICDE05, Tokyo, Japan, April, 2005.
[3] A. Deutsch, Y. Papakonstantinou, and Y. Xu, “The NEXT Logical Framework for XQuery,” Proc. 30th Int’l Conf. Very Large Data Bases (VLDB ’04), 2004.
[4] B. Choi, M. Mahoui, and D. Wood, “On the Optimality of Holistic Algorithms for Twig Queries,” Proc. 14th Int’l Workshop Database and Expert Systems Applications (DEXA ’03), 2003.
[5] de Lara, E., Chopra, Y., Kumar, R., Vaghela, N., Wallach, D., &Zwaenepoel, W. (2005). Iterative adaptation for mobile clients usingexisting APIs. IEEE Transactions on Parallel and Distributed Systems,16(10), 966–981.
[6] Gou G, Chirkova R, “Efficiently querying large XML data repositories: A survey”, IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, Vol 19, Issue 10, pp. 1381-1403, October 2007.
[7] H. Su, E.A. Rundensteiner, and M. Mani, “Semantic Query Optimization for XQuery over XML Streams,” Proc. 31st Int’l Conf. Very Large Data Bases (VLDB ’05), 2005.
[8] Ho-pong Leung, Fu-lai Chung, Stephen Chi-fai Chan, On the use of hierarchical information in sequential mining-based XML document similarity computation, Knowledge and Information Systems (2005) 7: 476–498.
[9] International Organization for Standardization, ISO 8879: Information processing---Text and office systems---Standard Generalized Markup Language (SGML), ([Geneva]: ISO, 1986).
[10]J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD’00), pages 1–12, Dallas, TX, May 2000.
[11]J. McHugh, S. Abiteboul, R. Goldman, D. Quass, J. Widom, Lore: a database management system for semi-structured data, SIGMOD Rec. 26 (3) (1997) 54–66.
[12]Jung-Won, L., L. Kiho, et al. (2001). Preparations for semantics-based XML mining. Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on.
[13]Koru, A.G., Tian, J., 2005. Comparing high change modules and modules with the highest measurement values in two large-scale open-source products. IEEE Transactions on Software Engineering 31 (8), 625–642.
[14]L.Chen, S.S.Bhowmick, L.T.Chia, ”FRACTURE-Mining: Mining Frequently and Concurrently Mutating Structures from Historical XML Documents”, Elsevier Science Journal: Data & Knowledge Engineering Volume: 59 Issue: 2, 2006, pp. 320-347
[15]L.Chen, S.S.Bhowmick, L.T.Chia, "Mining Maximal Frequently Changing Subtree Patterns from XML Documents", In Proceedings of the 6th International Conference on Data Warehousing and Knowledge Discovery(DaWaK), Zaragoza, Spain, 2004, pp.68-76.
[16]L.H.Rusu, W.Rahayu, D.Taniar, "Mining Changes from Versions of Dynamic XML Documents", KDXD 2006, LNCS3915, pp.3-12
[17]LICKLIDER, J. C. R., and CLARK, W., “Online Man-Computer Communication”, Proceedings of the Spring Joint Computer Conference, San Francisco, California, May 1-3, 1962, vol. 21, pp. 113-128.
[18]M.P. Papazoglou and P.M.A. Ribbers. e-Business: Organizational and Technical Foundations. John Wiley & Sons, Forthcoming 2005.
[19]Q. Li, B. Moon, Indexing and querying XML data for regular path expressions, in: Proceedings of the 27th International Conference on Very Large Data Bases, VLDB 2001, September 11–14, 2001, Rome, Italy, Morgan Kaufmann, Los Altos, CA, pp. 361–370.
[20]R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. Very Large Data Bases (VLDB’94), pages 487–499, Santiago, Chile, Sept. 1994.
[21]R. Krishnamurthy, V.T. Chakaravarthy, R. Kaushik, J.F. Naughton, Recursive XML schemas, recursive XML queries, and relational storage: XML-to-SQL query translation, in: Proc. of the ICDE Conference, 2004, pp. 42–53.
[22]S. Amer-Yahia, L.V.S. Lakshmanan, and S. Pandit, “FleXPath: Flexible Structure and Full-Text Querying for XML,” Proc. 23rd ACM SIGMOD Int’l Conf. Management of Data (SIGMOD ’04), 2004.
[23]S. Paparizos, Y. Wu, L.V.S. Lakshmanan, and H.V. Jagadish, “Tree Logical Classes for Efficient Evaluation of XQuery,” Proc. 23rd ACM SIGMOD Int’l Conf. Management of Data (SIGMOD ’04), 2004.
[24]S.Y. Chien, V.J. Tsotras, and C. Zaniolo, “Efficient schemes for managing multiversion XML documents,” VLDB J., vol.11, no.4, pp.332–353, Dec. 2002.
[25]Sanjay Madriaa, Yan Chena, Kalpdrum Passib, Sourav Bhowmickc, Efficient processing of XPath queries using indexes, Information Systems 32 (2007) 131–159.
[26]T. Milo, D. Suciu, Index structures for path expressions, in: Proceedings of the Seventh International Conference on Database Theory (ICDT ’99), Jerusalem, Israel, January 10–12, 1999, Lecture Notes in Computer Science, vol. 1540, Springer, Berlin, pp. 277–295.
[27]T. Schwentick. XPath query containment. SIGMOD Record, 33(1):101–109, 2004.
[28]Wang FJ, Li J, Homayounfar H, “A space efficient XML DOM parser ” , DATA & KNOWLEDGE ENGINEERING, Vol60, pp. 185-207, January 2007.
[29]X. Li and G. Agrawal, “Efficient Evaluation of XQuery over Streaming Data,” Proc. 31st Int’l Conf. Very Large Data Bases (VLDB’05), 2005.
[30]Y. Li, C. Yu, and H.V. Jagadish, “Schema-Free XQuerys,” Proc. 30th Int’l Conf. Very Large Data Bases (VLDB ’04), 2004.
[31]Z. Chen, H.V. Jagadish, L.V.S. Lakshmanan, and S. Paparizos, “From Tree Patterns to Generalized Tree Patterns: On Efficient Evaluation of XQuery,” Proc. 29th Int’l Conf. Very Large Data Bases (VLDB ’03), 2003.
網站資料 (All retrieve on June 23, 2008)
[32]A Brief History of Internet.
Available from http://arxiv.org/html/cs/9901011v1
[33]Cascading Style Sheets Home Page.
Available from http://www.w3.org/Style/CSS/
[34]CeBIT. Available from http://www.cebit.de/
[35]Extensible Markup Language (XML) http://www.w3.org/xml/
[36]FLWOR Expressions. Available from http://www.w3.org/TR/xquery/#id-flwor-expressions
[37]International Organization for Standardization.
Available from http://www.iso.org/iso/home.htm
[38]Introducing the Office (2007) Open XML File Formats.
Available from http://msdn2.microsoft.com/en-us/library/aa338205.aspx
[39]Introduction to XSLT.
Available from http://www.w3schools.com/xsl/xsl_intro.asp
[40]Megginson Technologies: Simple API for XML.
Available from http://www.megginson.com/downloads/SAX/
[41]OpenOffice.org. The Free and Open Productivity Suite.
Available from http://www.openoffice.org/
[42]OpenOffice.org 2.0 in Enterprises. English version. Available from http://www.ba.ncu.edu.tw/dmerplab/CeBIT_OOo_En.odp
[43]OpenOffice.org 2.0 in Unternehmen. German version. Available from http://de.openoffice.org/files/documents/66/3274/CeBIT_OOo20.odp
[44]Preserving The Past To Protect The Future, “The Strategic Plan of The National Archives and Records Administration 2006-2016”. Available from http://www.archives.gov/about/plans-reports/strategic-plan/2007/nara-strategic-plan-2006-2016.pdf
[45]Unicode in XML and other Markup Languages, “Unicode Technical Report#20”. Available from http://unicode.org/reports/tr20/tr20-6.html
[46]World Wide Web Consortium. Available from http://www.w3.org/
[47]W3C’s Document Object Model (DOM).
Available from http://www.w3.org/DOM
[48]W3C’s Extensible Markup Language (XML) 1.0 (Fourth Edition). Available from http://www.w3.org/TR/REC-xml/
[49]W3C’s XML Path Language (XPath) 2.0.
Available from http://www.w3.org/TR/xpath20/
[50]W3C’s XQuery 1.0: An XML Query Language.
Available from http://www.w3.org/TR/xquery/
[51]W3C’s XSL Transformations (XSLT) Version 2.0. Available from http://www.w3.org/TR/xslt20
[52]XML DOM Tutorial. Available from http://www.w3schools.com/dom/
[53]XPath Tutorial. Available from http://www.w3schools.com/xpath/
[54]XQuery FLWOR Expressions. Available from http://www.w3schools.com/xquery/xquery_flwor.asp |