On the Midpoint of a Set of XML Documents
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.
Unable to display preview. Download preview PDF.
- [ABS00]Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web - From Relations to Semistructured Data and XML. Morgan Kaufmann, San Francisco (2000)Google Scholar
- [W3C04]W3C. Extensible Markup Language (XML) 1.0, 3rd edn. (February 2004)Google Scholar
- [Wid99]Widom, J.: Data Management for XML: Research Directions. IEEE Data Engineering Bulletin 22(3), 44–52 (1999)Google Scholar