A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Filters
Reasoning about Keys for XML
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
In contrast to other proposals of keys for XML, these two classes of keys can be reasoned about e ciently. ...
We study two classes of XML keys introduced in 6 , and investigate their associated nite implication problems. ...
We thank Leonid Libkin and Micheal Benedikt for helpful discussions. ...
doi:10.1007/3-540-46093-4_8
fatcat:h66scogdfreglj75nkgaq3kua4
Reasoning about keys for XML
2003
Information Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
In contrast to other proposals of keys for XML, these two classes of keys can be reasoned about e ciently. ...
We study two classes of XML keys introduced in 6 , and investigate their associated nite implication problems. ...
We thank Leonid Libkin and Micheal Benedikt for helpful discussions. ...
doi:10.1016/s0306-4379(03)00028-0
fatcat:wvjppp5lxjdcth63vukccl7any
Numerical Constraints for XML
[chapter]
2007
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The implication problem is coN P -hard for several restricted classes of numerical constraints. ...
Keys, as introduced by Buneman et al., are numerical keys with upper bound 1. ...
In particular, numerical keys subsume XML keys [7, 16] where the upper bound is always 1. Unlike many other classes of XML constraints, numerical keys can be reasoned about efficiently. ...
doi:10.1007/978-3-540-73445-1_15
fatcat:m4asdldaojggrk4du7zxrifl6u
Performance Analysis of Algorithms to Reason about XML Keys
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
We also evaluate the performance of the proposed algorithm, demonstrating that reasoning about expressive notions of XML keys can be done efficiently in practice and scales well. ...
In practice, however, expressive notions of XML keys with good reasoning capabilities have been widely ignored. ...
For a small set Σ with about 5 XML keys, the execution takes 0.2ms in average, whereas for a large set of about 100 XML keys, the execution takes 1.7ms in average. ...
doi:10.1007/978-3-642-32600-4_9
fatcat:uthocgfzhrhxrcdxzre2tiuh2e
Keys for XML
2001
Proceedings of the tenth international conference on World Wide Web - WWW '01
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We discuss the de nition of keys for XML documents, paying particular attention to the concept of a relative key, which i s commonly used in hierarchically structured documents and scienti c databases. ...
We are grateful to Byron Choi, Hartmut Liefke, Arnaud Sahuguet, Keishi Tajima, Chris Brew and Henry Thompson for a number of useful comments and discussions. ...
We h a ve developed algorithms for reasoning about the inclusion of certain classes of path expressions as well as for determining implication of XML keys. ...
doi:10.1145/371920.371984
dblp:conf/www/BunemanDFHT01
fatcat:nzuxca7pyzfohknj5jciflb2qi
Expressive, yet tractable XML keys
2009
Proceedings of the 12th International Conference on Extending Database Technology Advances in Database Technology - EDBT '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Constraints are important for a variety of XML recommendations and applications. Consequently, there are numerous opportunities for advancing the treatment of XML semantics. ...
We establish a sound and complete set of inference rules for this expressive fragment of XML keys, and encode these rules in an algorithm that decides the associated implication problem in time quadratic ...
More precisely, we establish an axiomatisation for K , i.e., a set of inference rules which is sound and complete for the reasoning about XML keys in K . ...
doi:10.1145/1516360.1516402
dblp:conf/edbt/HartmannL09
fatcat:xx5qx7cbubd4xoethq6l66pylm
XML Query Optimisation: Specify your Selectivity
2007
18th International Conference on Database and Expert Systems Applications (DEXA 2007)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We propose a novel optimisation technique for XML queries that is based on the semantic properties exhibited by XML data. ...
It turns out that efficient reasoning about these constraints provides effective means to predict the number of XPath and XQuery query answers, to predict the number of updates using the XQuery update ...
Efficient reasoning about these constraints can help to determine the selectivity of XML queries effectively. ...
doi:10.1109/dexa.2007.19
dblp:conf/dexaw/HartmannL07
fatcat:pymh7bi3onh5zc6patrxk5huom
Mining Approximate Keys based on Reasoning from XML Data
2014
Applied Mathematics & Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Keys are very important for data management. ...
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 ...
By using these inference rules, the keys can be reasoned about efficiently. The rest of this paper is organized as follows. ...
doi:10.12785/amis/080459
fatcat:ultlb7alengvxmzievogahj3xq
Mining Approximate Keys Based on Reasoning from XML Data
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Keys are very important for data management. ...
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 ...
By using these inference rules, the keys can be reasoned about efficiently. The rest of this paper is organized as follows. ...
doi:10.1007/978-3-642-40319-4_43
fatcat:epfa35f6k5cqdgslys7eu4juim
Design Of Integration Security System Using Xml Security
2007
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The interface is originated from XKMS protocol and is used to manage security data such as XACML policies, SAML assertions and other authentication security data including public keys. ...
In this paper, we design an integration security system that provides authentication service, authorization service, and management service of security data and a unified interface for the management service ...
OVERVIEW OF XML SECURITY XML Security technologies include XML Signature for integrity and signing solutions, XML Encryption for confidentiality, XKMS for public key registration, location and validation ...
doi:10.5281/zenodo.1071700
fatcat:5zmjxg4y6zfz7hv3crvypknclq
Reasoning about client-side web programs
2010
Proceedings of the 1st International Workshop on Data Semantics - DataSem '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This style of reasoning was introduced by O'Hearn (Queen Mary) and Reynolds (CMU) in their work on Separation Logic for reasoning modularly about large C-programs (e.g. ...
I substantially extended the range of local resource reasoning, introducing Context Logic to reason about programs that directly manipulate complex data structures such as XML. ...
about DOM programs and the identification of key examples of web applications on which to test our DOM reasoning: e.g., with current technology, we can prove by hand that mashup programs are fault free ...
doi:10.1145/1754239.1754261
dblp:conf/edbtw/Gardner10
fatcat:jss7sisnuvdizfijrn4v526kzq
The Finite Implication Problem for Expressive XML Keys: Foundations, Applications, and Performance Evaluation
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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 ...
To exemplify this potential, we use the decision algorithm to calculate non-redundant covers for sets of XML keys. ...
The authors would like to thank the anonymous reviewers for their comments and suggestions, which have contributed to improve the paper. ...
doi:10.1007/978-3-642-41221-9_3
fatcat:5ips5tlcprcmdndgk55p4kw4dm
Numerical constraints on XML data
2010
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Efficient reasoning about numerical constraints provides effective means for predicting the number of answers to XQuery and XPath queries, the number of updates when using the XQuery update facility, and ...
At the same time, they form a natural generalisation of XML keys that are popular in XML theory and practice. ...
Unlike many other classes of XML constraints, numerical keys can be reasoned about efficiently. ...
doi:10.1016/j.ic.2008.09.004
fatcat:3ogrbsmfnranjahcx3qu5vkqfe
Foundational Data Modeling and Schema Transformations for XML Data Engineering
[chapter]
2008
Lecture Notes in Business Information Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we make foundational observations about XML data management, including conceptual modeling for XML data, transformations to and from XML Schema and XML data models, and transformation guarantees ...
, and assurances about readability and maintainability. ...
A starting object set for a node becomes a key for the node. ...
doi:10.1007/978-3-540-78942-0_4
fatcat:fx746npibffbfoypbv4hqkqcdy
Efficient reasoning about a robust XML key fragment
2009
ACM Transactions on Database Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
This enables us to develop a quadratic-time algorithm for deciding implication, and shows that reasoning about this XML key fragment is practically efficient. ...
In this article, we investigate the axiomatizability and implication problem for XML keys with nonempty sets of simple key paths. ...
The example illustrates that facilities for reasoning about XML keys present us with opportunities for designing XML databases that permit a more efficient processing of frequent queries and updates Libkin ...
doi:10.1145/1538909.1538912
fatcat:qgzwdmbbojczbh2izhhypje2oq
« Previous
Showing results 1 — 15 out of 58,311 results