Conflicting XML Updates

  • Mukund Raghavachari
  • Oded Shmueli
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3896)


There has been growing interest in the addition of update operations to languages that operate on XML data, for example, XQuery and XJ. These update operations support efficient and declarative specification of transformations of XML data. The presence of update operations raises the question of detecting data dependencies between reads and updates of XML documents. The ability to optimize the execution of update operations depends on the ability to detect such conflicts. In this paper, we formalize the notions of updates on XML data and conflicts between update operations. We show that conflict detection is NP-complete when the update operations are specified using XPath expressions that support the use of the child and descendant axis, wildcard symbols, and branching. We also provide efficient polynomial algorithms for update conflict detection when the patterns do not use branching.


Polynomial Time Tree Pattern Linear Pattern Read Operation XPath Expression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Balmin, A., Papakonstantinou, Y., Vianu, V.: Incremental validation of XML documents. ACM Transactions on Database Systems (TODS) 29(4), 710–751 (2004)CrossRefGoogle Scholar
  2. 2.
    Benedikt, M., Bonifati, A., Flesca, S., Vyas, A.: Verification of tree updates for optimization. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 379–393. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Bierman, G., Meijer, E., Schulte, W.: The essence of data access in Cω.,
  4. 4.
    Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. In: Proceedings of the 28th International Conference on Very Large Data Bases (VLDB), Hong Kong (2002)Google Scholar
  5. 5.
    Harren, M., Raghavachari, M., Shmueli, O., Burke, M., Bordawekar, R., Pechtchanski, I., Sarkar, V.: XJ: Facilitating XML processing in Java. In: Proceedings of World Wide Web (WWW), pp. 278–287 (May 2005)Google Scholar
  6. 6.
    Miklau, G., Suciu, D.: Containment and equivalence for a fragment of XPath. J. ACM 51(1), 2–45 (2004)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Neven, F., Schwentick, T.: XPath containment in the presence of disjunction, dTDs, and variables. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 312–326. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Raghavachari, M., Shmueli, O.: Efficient schema-based revalidation of XML. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 639–657. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    Sur, G., Hammer, J., Sim´eon, J.: UpdateX - an XQuery-based language for processing updates. In: PLAN-X (January 2004)Google Scholar
  10. 10.
    Tatarinov, I., Ives, Z., Halevy, A., Weld, D.: Updating XML. In: Proc. ACM SIGMOD Int. Conf. on Management of Data (June 2001)Google Scholar
  11. 11.
    World Wide Web Consortium. XQuery 1.0: An XML Query Language, W3C Working draft (April 2005)Google Scholar
  12. 12.
    World Wide Web Consortium. XQuery Update Facility Requirements (June 2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Mukund Raghavachari
    • 1
  • Oded Shmueli
    • 2
  1. 1.IBM T.J. Watson Research Center 
  2. 2.Technion — Israel Institute of Technology 

Personalised recommendations