Home   >   CSC-OpenAccess Library   >    Manuscript Information
Multi-GranularityUser Friendly List Locking Protocol for XML Repetitive Data
Eunjung Lee
Pages - 126 - 135     |    Revised - 01-11-2011     |    Published - 15-12-2011
Volume - 2   Issue - 3    |    Publication Date - July / August 2011  Table of Contents
MORE INFORMATION
KEYWORDS
Locking, Shared XML, Repetition, Edit actions
ABSTRACT
We propose a list data sharing model, which utilizes semantics expressed in DTD for concurrency control of shared XML trees. In this model, tree updating actions such as inserting and/or deleting subtrees are allowed only for repetitive parts. The proposed model guarantees that the resulting XML tree is valid even when tree update actions are applied concurrently. In addition, we propose a new multi-granularity locking mechanism called list locking protocol. This protocol locks on the (index) list of repetitive children nodes and thus allows updates to the descendents when the node child¡¯s subtree is being deleted or inserted. This protocol is expected to be more accessible and to produce fewer locking objects on XML data compared to other methods. Moreover, the prototype system shows that list locking is well suited to user interface of shared XML clients by enabling/disabling corresponding edit operation controls.
1 Google Scholar 
2 CiteSeerX 
3 refSeek 
4 Scribd 
5 SlideShare 
6 PdfSR 
B. Bouchou, and M. Halfeld and, F. Alves., “"Updates and Incremental Validation of XML Documents,". The 9th International Workshop on Data Base Programming Languages(DBPL), 2003, pp.216-232.
E. Harder, C. Mathis, S. Bachle, K. Schmidt and, A. Weiner., “Essential performance drivers in native XML DBMSs,”. LNCS 5901, 2010, pp. 29-46.
H. Tan, X. Chen and, J. Gu, . “A transaction mechanism for native XML database,”.Proceedings of the 5th WSEAS International Conference on Applied Computer Science,2006, pp. 486-490.
KuenK.-Fang F. Jea, ShihS.-Ying Y. Chen and ShengS.-H.Hsien Wang., “Concurrency Control in XML Document Databases: XPath Locking Protocol,”. In: Proceedings of the 9th International Conference on Parallel a6d and Distributed Systems (ICPADS 2002), 2002,pp.551-556.
M.Haustein, T.Harder, “Optimizing lock protocols for native XML processing,” Data & Knowledge Engineering, vol.65(1), 2008, pp.147-173.
N. S. Barghouti, G. E. Kaiser., “Concurrency control in advanced database applications,”.AACM Computing Surveys, vol.23(3), pp.269-317, 1991.
P. Bernstein, N. Goodman., “Multiversion concurrency control – theory and algorithms,”.ACM TransTransactions. On on Database Systems, vol. 8(4), pp.465-483, 1983.
P.Pleshachkov, P.Chardin, S.Kusenetzov, “SXDGL: Snapshot based concurrency protocol for XML data,” XSym 2007, LNCS 4704, 2007, pp.122-136.
S. Bachle, T. Harder and, M. Haustein., “Implementing and optimizing fine-granular lock management for XML document Trees,”. DASFAA’09, 2009, pp.631-635.
S. Helmer, C. Kanne and, G. Moerkotte, . “"Evaluating lock-based protocols for coorperation cooperation on XML documents”.," ACM SIGMOD Record, vol. 33(1), 2004, pp.58- – 63.
S. Helmer, C. Kanne and, G. Moerkotte, “"Lock-based Protocols for Cooperation on XML Documents”.," Int.International Workshop on DB and Expert Systems Applications Conference (DEXA'03), 2003, pp.230-236.
S.-Y. Lee and R.-L. Liou. “A multi-granularity locking model for concurrency control in object-oriented database systems,”. IEEE Trans.Transactions onOn Knowledge and Data Engineering, vol. 8(1), 1996, pp.144- -- 156.
Stijn S. Dekeyser, Jan J. Hidders., “Path locks for XML Document collaboration,”. Proc.WISE'02, 2002, pp.105-114.
Torsten T. Grabs, Klemens K. Bohm and, HansH.-Jorg J. Schek., “"XMLTM: Efficient Transaction Management for XML Documents,"”. CKIM’02, 2002, pp.142-152.
V. Lanin and D. Shasha., “Tree locking on changing trees,”. Technical Report 503, New York University, 1986.
World wide web consortium, “XForms 1.0 Working draft,” http://www. w3. org/TR/xforms,Jan. 2002, [Jan. 28. 2002].
Professor Eunjung Lee
Kyonggi University - South Korea
ejlee@kyonggi.ac.kr