Effective Storage Structure for Multi-version XML Documents

  • Chang Chih-Chun
  • Cheng Ming-Shien
  • Hsu Ping-Yu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6485)


Office applications such as 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.

Keywords XML Historical document Storage structure 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    林昌正,「多XML文件整合萃取工具之研究」, 國立中央大學, 碩士論文, 民國97年。Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Chien, S.Y., Tsotras, V.J., Zaniolo, C.: Efficient schemes for managing multiversion XML documents. VLDB J. 11(4), 332–353 (2002)CrossRefzbMATHGoogle Scholar
  10. 10.
    Wang, F.J., Li, J., Homayounfar, H.: A space efficient XML DOM parser. Data & Knowledge Engineering 60, 185–207 (2007)CrossRefGoogle Scholar
  11. 11.
    Extensible Markup Language (XML),
  12. 12.
    Megginson Technologies: Simple API for XML,
  13. 13. 2.0 in Enterprises. English version,
  14. 14.
    Preserving The Past To Protect The Future, The Strategic Plan of The National Archives and Records Administration (2006-2016)Google Scholar
  15. 15.
    World Wide Web Consortium,
  16. 16.
    W3C’s Document Object Model (DOM),

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Chang Chih-Chun
    • 1
  • Cheng Ming-Shien
    • 1
  • Hsu Ping-Yu
    • 1
  1. 1.Department of Business AdministrationNational Central UniversityJhongli CityTaiwan R.O.C.

Personalised recommendations