A normal form for XML documents

Arenas, Marcelo; Libkin, Leonid

doi:10.1145/543613.543625

Cited by 114 publications

(147 citation statements)

References 24 publications

Supporting

Mentioning

147

Contrasting

Order By: Relevance

“…The difficulty of comparing and finding matchable schemas arises for two reasons: (1) there are three data storage units in XML: elements, attributes, and text content, and (2) the hierarchical features of the XML structure. XML schema equivalence must be evaluated from three perspectives: (1) hierarchical structure (structural equivalence), (2) elements and attributes data types (syntactic equivalence), and (3) elements and attributes names (semantic equivalence). This paper focuses on determining the structural equivalence of XML schema by using reduced XML trees generated by the Reduction Algorithm (RA) [8].…”

Section: Hypothesis and Methodologymentioning

confidence: 99%

XML Schema Structural Equivalence

2007

Proceedings of the Ninth International Conference on Enterprise Information Systems

View full text Add to dashboard Cite

The Xequiv algorithm determines when two XML schemas are equivalent based on their structural organization. It calculates the percentages of schema inclusion in another schema by considering the cardinality of each leaf node and its interconnection to other leaf nodes that are part of a sequence or choice structure. Xequiv is based on the Reduction Algorithm [8] that focuses on the leaf nodes and eliminates intermediate levels in the XML tree.

show abstract

Section: Hypothesis and Methodologymentioning

confidence: 99%

XML Schema Structural Equivalence

2007

Proceedings of the Ninth International Conference on Enterprise Information Systems

View full text Add to dashboard Cite

show abstract

“…Tree tuples resemble the notion of tuples in relational databases and have been proposed to extend functional dependencies to the XML setting [8] [9]. In a relational database, a tuple is a function assigning each attribute with a value from the corresponding domain.…”

Section: Xml Tree Tuplesmentioning

confidence: 99%

“…In a relational database, a tuple is a function assigning each attribute with a value from the corresponding domain. According to [8], we provide the following de nition:…”

Section: Xml Tree Tuplesmentioning

confidence: 99%

Managing XML Trees Using XPath, XQuery, Clustering and Tree Tuples over Sedna XML database

Elzentani¹

2014

Proceedings of the 1st International Scientific Conference - Sinteza 2014

View full text Add to dashboard Cite

Abstract:XML is a markup language that defines a set of rules for encoding semi-structured data in a readable format for both humans and machines, in other words the increase of various XML data as information source has raised a number of issues about how to represent and manage this data. Find out an ontology knowledge to derive semantics of XML document has become a major challenge in semi-structured data management. XPath and XQuery languages are used for selecting nodes and compute values from XML document, tuple the XML tree and address the problem of XML data clustering according to structure with ontology knowledge. Experiment on real XML database gives evidence that our proposed approach is highly effective in tupling and clustering of XML tree. So this paper will propose Sedna, which is a free native XML database that provides flexible XML processing facilities include W3C XQuery implementation. Finally we will discuss the results of No. of replayed nodes and time taken by XPath or XQuery.

show abstract

“…Indeed, constraints for semi-structured data and XML [38,39], keys and foreign keys for XML [26,27] have received a lot of attention from the database community. Update anomalies and normal forms for XML documents have been investigated in [14]. Unified formalisms for capturing schema and integrity constraints for XML have also been studied in order to reason about types and constraints [19].…”

Section: Preliminariesmentioning

confidence: 99%

Types and Constraints: From Relational to XML Data

Bidoit-Tollu

2011

Semantics in Data and Knowledge Bases

View full text Add to dashboard Cite

Abstract. The goal of this article is to show that, in the context of XML data processing, information conveyed by schema or XML types is a powerful component to deploy optimization methods. We focus on the one hand on recent work developed for optimizing query and update evaluation for main-memory engines and on the other hand on techniques for checking XML query-update independence. These methods are all based on static type analysis. The aim of the article is to show how types rank before constraints for XML data processing and the presentation of each method is kept informal.

show abstract

A normal form for XML documents

Cited by 114 publications

References 24 publications

XML Schema Structural Equivalence

XML Schema Structural Equivalence

Managing XML Trees Using XPath, XQuery, Clustering and Tree Tuples over Sedna XML database

Types and Constraints: From Relational to XML Data

Contact Info

Product

Resources

About