Performance Analysis of Algorithms to Reason about XML Keys

Ferrarotti, Flavio; Hartmann, Sven; Link, Sebastian; Marin, Mauricio; Muñoz, Emir

doi:10.1007/978-3-642-32600-4_9

Cited by 7 publications

(18 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More precisely, we characterize the associated implication problem axiomatically, and propose a low-degree polynomial time decision algorithm. The set of XML keys that are expressible in this new fragment includes strictly the sets of XML keys that are expressible in the fragments considered in previous proposals [15,16,11,12]. The first source of expressiveness results from the very general notion of value equality: two element nodes v and w are considered value equal, if the subtrees rooted at v and w are isomorphic by an isomorphism that is the identity on string values.…”

Section: Contributionssupporting

confidence: 43%

“…Our performance tests give empirical evidence that reasoning about expressive notions of XML keys is practically efficient, and scales well. In fact, the performance of this new algorithm is comparable to the performance of the algorithm presented in [12] for a strictly less expressive fragment of XML keys. Our results unleash XML keys on real-world XML practice, where a little more semantics makes applications a lot more effective.…”

Section: Contributionsmentioning

confidence: 43%

“…This includes the single-label wildcard, child navigation, and descendant navigation as known from XPath. Note that in [12] we have considered XML keys whose context and target nodes can be selected by a path language that uses child navigation and descendant navigation, and key nodes by using only child navigation. While this fragment of XML keys can already capture many desirable properties, the MaxKeys fragment proposed in this paper captures a considerably more expressive class of properties by allowing the use of single-label wildcards, a controlled use of variable-length wildcards in the key paths and XML keys without key paths that allow one to express structural keys.…”

Section: Contributionsmentioning

confidence: 43%

“…Aiming to fill this gap between theory and practice, we initiated in [12] an empirical study of an XML key fragment, namely the fragment of XML keys with nonempty sets of simple key paths. As shown in [8,15], automated reasoning about this XML key fragment can be done efficiently, in theoretical terms.…”

Section: Related Workmentioning

confidence: 46%

See 3 more Smart Citations

The Finite Implication Problem for Expressive XML Keys: Foundations, Applications, and Performance Evaluation

Ferrarotti

Hartmann

Link

et al. 2013

Transactions on Large-Scale Data- And Knowledge-Centered Systems X

Self Cite

View full text Add to dashboard Cite

Abstract. The increasing popularity of XML for persistent data storage, processing and exchange has triggered the demand for efficient algorithms to manage XML data. Both industry and academia have long since recognized the importance of keys in XML data management. In this paper we make a theoretical as well as a practical contribution to this area. This endeavour is ambitious given the multitude of intractability results that have been established. Our theoretical contribution is based in the definition of a new fragment of XML keys that keeps the right balance between expressiveness and efficiency of maintenance. More precisely, we characterize the associated implication problem axiomatically and develop a low-degree polynomial time decision algorithm. In comparison to previous work, this new fragment of XML keys provides designers with an enhanced ability to capture properties of XML data that are significant for the application at hand. Our practical contribution includes an efficient implementation of this decision algorithm and a thorough evaluation of its performance, demonstrating that reasoning about expressive notions of XML keys can be done efficiently in practice, and scales well. Our results promote the use of XML keys on real-world XML practice, where a little more semantics makes applications a lot more effective. To exemplify this potential, we use the decision algorithm to calculate non-redundant covers for sets of XML keys. In turn, this allow us to reduce significantly the time required to validate large XML documents against keys from the proposed fragment.

show abstract

Section: Contributionssupporting

confidence: 43%

Section: Contributionsmentioning

confidence: 43%

Section: Contributionsmentioning

confidence: 43%

Section: Related Workmentioning

confidence: 46%

See 2 more Smart Citations

The Finite Implication Problem for Expressive XML Keys: Foundations, Applications, and Performance Evaluation

Ferrarotti

Hartmann

Link

et al. 2013

Transactions on Large-Scale Data- And Knowledge-Centered Systems X

Self Cite

View full text Add to dashboard Cite

show abstract

“…Though key definitions and their implication are suggested and researchers have analyzed their expressiveness and computational properties in theory and experiments [21,22], there are still some challenges encountered in the practical mining of XML keys, as pointed out in [23]. Firstly, due to the reason that the semi-structured XML data is usually integrated from multiple heterogeneous data sources and provides a high degree of syntactic flexibility, there could be no clear keys, that is, keys can not be expected to be satisfied at 100% in the data.…”

Section: Introductionmentioning

confidence: 44%

Mining Approximate Keys based on Reasoning from XML Data

Liu¹,

Ye²,

Liu³

et al. 2014

Appl. Math. Inf. Sci.

View full text Add to dashboard Cite

Keys are very important for data management. Due to the hierarchical structure and syntactic flexibility of XML, mining keys from XML data is a more complex and difficult task than from relational databases. In discovering keys from XML data there are some challenges in practice such as unclearness of keys, storage of enormous keys, efficient mining algorithms, etc. In this paper, in order to fill the gap between theory and practice, we propose a novel approximate measure of the support and confidence for XML keys on the basis of the number of null values on key paths. In the mining process, inference rules are used to derive new keys. Through the two-phase reasoning, a target set of approximate keys and its reduced set are obtained. Our research conducted experiments over ten benchmark XML datasets from XMark and four files in the UW XML Repository. The results show that the approach is feasible and efficient, with which effective keys in various XML data can be discovered.

show abstract

Mining Approximate Keys Based on Reasoning from XML Data

Liu

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Performance Analysis of Algorithms to Reason about XML Keys

Cited by 7 publications

References 11 publications

The Finite Implication Problem for Expressive XML Keys: Foundations, Applications, and Performance Evaluation

The Finite Implication Problem for Expressive XML Keys: Foundations, Applications, and Performance Evaluation

Mining Approximate Keys based on Reasoning from XML Data

Mining Approximate Keys Based on Reasoning from XML Data

Contact Info

Product

Resources

About