An Incremental Correction Algorithm for XML Documents and Single Type Tree Grammars

نویسندگان

  • Martin Svoboda
  • Irena Holubová
چکیده

XML documents represent an integral part of the contemporary Web. Unfortunately, a relatively high number of them is affected by well-formedness errors, structural invalidity or data inconsistencies. The purpose of this paper is to continue with our previous work on a correction model for invalid XML documents with respect to schemata in DTD and XML Schema languages. Contrary to other existing approaches, our model ensures that we are always able to find all minimal repairs. The contribution of this paper is the description and experimental evaluation of our new incremental algorithm, which is able to efficiently follow only perspective correction ways even to the depth of the recursion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Grammar Inference for Web Documents

Presentational XML documents, such as XHTML or Presentation MathML, use XML tags mainly for formating purposes, while descriptive XML applications, such as a wellstructured movie database, use tags to structure data items in a semantically meaningful way. There is little semantic connection between tags in a presentational XML document and its content, so the tagging is often complex and seemin...

متن کامل

Structural Similarity Evaluation Between XML Documents and DTDs

The automatic processing and management of XML-based data are ever more popular research issues due to the increasing abundant use of XML, especially on the Web. Nonetheless, several operations based on the structure of XML data have not yet received strong attention. Among these is the process of matching XML documents and XML grammars, useful in various applications such as documents classifi...

متن کامل

Automata for XML - A survey

Since the arrival of XML as a data representation language, concepts from formal language theory like regular expressions, grammars and automata have been used for various purposes, e.g., as algorithm models for efficient evaluation of simple queries, as a proof tool, as a tool for static analysis and as an operational model with a clear semantics. Besides automata that read XML documents as st...

متن کامل

Approximate XML structure validation based on document-grammar tree similarity

Comparing XML documents with XML grammars, also known as XML document and grammar validation, is useful in various applications such as: XML document classification, document transformation, grammar evolution, XML retrieval, and the selective dissemination of information. While exact (Boolean) XML validation has been extensively investigated in the literature, the more general problem of approx...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012