Repairing Inconsistent Merged XML Data

  • Wilfred Ng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2736)


XML is rapidly becoming one of the most adopted standard for information representation and interchange over the Internet. With the proliferation of mobile devices of communication such as palmtop computers in recent years, there has been growing numbers of web applications that generate tremendous amount of XML data transmitted via the Internet. We therefore need to investigate an effective means to handle such ever-growing XML data in various merging activities such as aggregation, accumulation or updating, in addition to storing and querying XML data. Previously, we recognized that FDs are an important and effective means to achieve consistent XML data merging, which we restricted data consistency for leaf nodes in an XML data tree. In this paper we further extend FDs to be satisfied in an XML document by comparing subtrees in a specified context of an XML tree. Given an XML tree T and a set of FDs F defined over a set of given path expressions, called targeted functional path expressions, we tackle the problem of repairing the inconsistency with respect to F in the most concise merged format of T.


Concise Representation Path Expression Target Path Functional Node Text Node 
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.
    Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web. Morgan Kaufmann Publishers, San Francisco (2000)Google Scholar
  2. 2.
    Buneman, P., Fan, W., Weinstein, S.: Interaction Between Path and Type Constraints. In: Proc. of the 18th ACM Symposium on Principles of Database Systems (PODS 1999), pp. 56–67 (1999)Google Scholar
  3. 3.
    Buneman, P., Davidson, S.B., Fan, W., Hara, C.S., Tan, W.C.: Keys for XML. In: Proc. of WWW10, pp. 201–210 (2001)Google Scholar
  4. 4.
    Fan, W., Kuper, G.M., Siméon, J.: A Unified Constraint Model for XML. In: Proc. of WWW10, 179–190 (2001)Google Scholar
  5. 5.
    Fan, W., Libkin, L.: On XML Integrity Constraints in the Presence of DTDs. In: Proc. of the 20th ACM Symposium on Principles of Database Systems, PODS 2001 (2001)Google Scholar
  6. 6.
    Levene, M., Loizou, G.: Maintaining consistency of imprecise relations. The Computer Journal 39, 114–123 (1996)zbMATHCrossRefGoogle Scholar
  7. 7.
    Mannila, H., Raiha, K.-J.: The Design of Relational Databases. Addison-Wesley, Reading (1992)zbMATHGoogle Scholar
  8. 8.
    Ng, W.: Maintaining Consistency of Integrated XML Trees. In: Meng, X., Su, J., Wang, Y. (eds.) WAIM 2002. LNCS, vol. 2419, pp. 145–157. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Wijsen, J.: Condensed Representation of Database Repairs for Consistent Query Answering. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 378–393. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Wilfred Ng
    • 1
  1. 1.Department of Computer ScienceThe Hong Kong University of Science and TechnologyHong KongChina

Personalised recommendations