Storage Policies for Versions Management of XML Documents using a Change Set


The KIPS Transactions:PartD, Vol. 11, No. 7, pp. 1349-1356, Dec. 2004
10.3745/KIPSTD.2004.11.7.1349,   PDF Download:

Abstract

The interest of version management is increasing in electronic commerce requiring data mining and documents processing system related to digital governmentapplications. In this paper, we define a change set that is to manage historicalinformation and to maintain XML documents during a long period of time and propose several storage policies of XML documents using a change set. A change set includes a change operation set and temporal dimensions and a change operation set is composed with schema change operations and data change operations. We propose three storage policies using a change set. Three storage policies are 1. storing all the change sets, 2. storing the change sets and the versions periodically, 3. storing the aggregation of change sets and the versions at a point of proper time. Also, we compare the performance between the existing storage policy and the proposed storage policies. Through the performance evaluation, we show that the method to store the aggregation of change sets and the versions at a point of proper time outperforms others.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
H. W. Yun, "Storage Policies for Versions Management of XML Documents using a Change Set," The KIPS Transactions:PartD, vol. 11, no. 7, pp. 1349-1356, 2004. DOI: 10.3745/KIPSTD.2004.11.7.1349.

[ACM Style]
Hong Won Yun. 2004. Storage Policies for Versions Management of XML Documents using a Change Set. The KIPS Transactions:PartD, 11, 7, (2004), 1349-1356. DOI: 10.3745/KIPSTD.2004.11.7.1349.