Abstract
Office applications such as OpenOffice.org and Microsoft office are widely used to do everything you expect from your needs. Because of more and more requirements of information exchange and retrieve, XML becomes a standard in doing this way. With the adoption of using XML in both office application groups, the abilities for efficient storing historical office documents are become a growing issue. This paper introduces an efficient way to process multi-version XML documents. It is not only effective storage space need but also keeping the integral of original documents. It minimizes the change of data values or structures transmutation of historical XML documents. The purpose is to well-managed electronic documents for enterprises and all the messages were involved in should be preserved.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
林昌正,「多XML文件整合萃取工具之研究」, 國立中央大學, 碩士論文, 民國97年。
Chebotko, A., Liu, D., Atay, M., Lu, S., Fotouhi, F.: Reconstructing XML subtrees from relational storage of XML documents. In: Proceedings of the Second IEEE International Workshop on XML Schema and Data Management (XSDM 2005), in conjunction with ICDE 2005, Tokyo, Japan (April 2005)
Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD 2000), Dallas, TX, pp. 1–12 (May 2000)
Chen, L., Bhowmick, S.S., Chia, L.T.: FRACTURE-Mining: Mining Frequently and Concurrently Mutating Structures from Historical XML Documents. Elsevier Science Journal: Data & Knowledge Engineering 59(2), 320–347 (2006)
Chen, L., Bhowmick, S.S., Chia, L.T.: 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, pp. 68–76 (2004)
Rusu, L.H., Rahayu, W., Taniar, D.: Mining Changes from Versions of Dynamic XML Documents. In: Nayak, R., Zaki, M.J. (eds.) KDXD 2006. LNCS, vol. 3915, pp. 3–12. Springer, Heidelberg (2006)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 1994 Int. Conf. Very Large Data Bases, VLDB 1994, Santiago, Chile, pp. 487–499 (September 1994)
Krishnamurthy, R., Chakaravarthy, V.T., Kaushik, R., Naughton, J.F.: Recursive XML schemas, recursive XML queries, and relational storage: XML-to-SQL query translation. In: Proc. of the ICDE Conference, pp. 42–53 (2004)
Chien, S.Y., Tsotras, V.J., Zaniolo, C.: Efficient schemes for managing multiversion XML documents. VLDB J. 11(4), 332–353 (2002)
Wang, F.J., Li, J., Homayounfar, H.: A space efficient XML DOM parser. Data & Knowledge Engineering 60, 185–207 (2007)
Extensible Markup Language (XML), http://www.w3.org/xml/
Megginson Technologies: Simple API for XML, http://www.megginson.com/downloads/SAX/
OpenOffice.org 2.0 in Enterprises. English version, http://www.ba.ncu.edu.tw/dmerplab/CeBIT_OOo_En.odp
Preserving The Past To Protect The Future, The Strategic Plan of The National Archives and Records Administration (2006-2016)
World Wide Web Consortium, http://www.w3.org/
W3C’s Document Object Model (DOM), http://www.w3.org/DOM
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chih-Chun, C., Ming-Shien, C., Ping-Yu, H. (2010). Effective Storage Structure for Multi-version XML Documents. In: Kim, Th., Lee, Yh., Kang, BH., Ślęzak, D. (eds) Future Generation Information Technology. FGIT 2010. Lecture Notes in Computer Science, vol 6485. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17569-5_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-17569-5_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17568-8
Online ISBN: 978-3-642-17569-5
eBook Packages: Computer ScienceComputer Science (R0)