Output details
11 - Computer Science and Informatics
University of Edinburgh
Article title
Efficient reasoning about data trees via integer linear programming
Type
D - Journal article
Title of journal
ACM Transactions on Database Systems
Article number
19
Volume number
37
Issue number
3
First page of article
19:1
ISSN of journal
0362-5915
Year of publication
2012
Number of additional authors
2
Additional information
<11> Originality: The paper bridged two main approaches to the static analysis of XML documents with data values: the abstract ones (that produce general results but of very high complexity) and concrete ones (that concentrate on specific tasks, and are hard to extend). It proposed a simple formalism that subsumes many concrete reasoning tasks and captures the essence of many abstract formalisms. Unlike previous approaches, this formalism is easy to implement, and experimental results confirmed the feasibility of our approach.
Significance: The conference version won the Best Paper Award at ICDT 2011.
Rigour: Complete proofs of correctness of all the algorithms are provided.
Interdisciplinary
-
Cross-referral requested
-
Research group
F - Laboratory for Foundations of Computer Science
Citation count
1
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
