On the Midpoint of a Set of XML Documents.

Abstract : The WWW contains a huge amount of documents. Some of them share the subject, but are generated by different people or even organizations. To guarantee the interchange of such documents, we can use XML, which allows to share documents that do not have the same structure. However, it makes difficult to understand the core of such heterogeneous documents (in general, schema is not available). In this paper, we offer a characterization and algorithm to obtain the midpoint (in terms of a resemblance function) of a set of semi-structured, heterogeneous documents without optional elements. The trivial case of midpoint would be the common elements to all documents. Nevertheless, in cases with several heterogeneous documents this may result in an empty set. Thus, we consider that those elements present in a given amount of documents belong to the midpoint. A exact schema could always be found generating optional elements. However, the exact schema of the whole set may result in overspecialization (lots of optional elements), which would make it useless.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01586608
Contributor : Équipe Gestionnaire Des Publications Si Liris <>
Submitted on : Wednesday, September 13, 2017 - 9:21:47 AM
Last modification on : Tuesday, February 26, 2019 - 11:49:56 AM

Links full text

Identifiers

Citation

Alberto Abellò, Xavier de Palol, Mohand-Said Hacid. On the Midpoint of a Set of XML Documents.. Advances in Natural Language Processing Lecture Notes in Computer Science, Springer, 2005, 3588, pp.441-450. ⟨10.1007/11546924_43⟩. ⟨hal-01586608⟩

Share

Metrics

Record views

136