An analytical study of large SPARQL query logs
A Bonifati, W Martens, T Timm - The VLDB Journal, 2020 - Springer
With the adoption of RDF as the data model for Linked Data and the Semantic Web, query
specification from end users has become more and more common in SPARQL endpoints. In …
specification from end users has become more and more common in SPARQL endpoints. In …
An analytical study of large SPARQL query logs
A Bonifati, W Martens, T Timm - arXiv preprint arXiv:1708.00363, 2017 - arxiv.org
With the adoption of RDF as the data model for Linked Data and the Semantic Web, query
specification from end-users has become more and more common in SPARQL end-points …
specification from end-users has become more and more common in SPARQL end-points …
[PDF][PDF] Inferring XML schema definitions from XML data
Although the presence of a schema enables many optimizations for operations on XML
documents, recent studies have shown that many XML documents in practice either do not …
documents, recent studies have shown that many XML documents in practice either do not …
Enumeration on trees with tractable combined complexity and efficient updates
A Amarilli, P Bourhis, S Mengel… - Proceedings of the 38th …, 2019 - dl.acm.org
We give an algorithm to enumerate the results on trees of monadic second-order (MSO)
queries represented by nondeterministic tree automata. After linear time preprocessing (in …
queries represented by nondeterministic tree automata. After linear time preprocessing (in …
Interactive learning of node selecting tree transducer
J Carme, R Gilleron, A Lemay, J Niehren - Machine Learning, 2007 - Springer
We develop new algorithms for learning monadic node selection queries in unranked trees
from annotated examples, and apply them to visually interactive Web information extraction …
from annotated examples, and apply them to visually interactive Web information extraction …
MSO queries on trees: Enumerating answers under updates using forest algebras
M Niewerth - Proceedings of the 33rd Annual ACM/IEEE Symposium …, 2018 - dl.acm.org
We investigate efficient enumeration of answers to MSO-definable queries over trees which
are subject to local updates. We exhibit an algorithm that uses an O (n) preprocessing phase …
are subject to local updates. We exhibit an algorithm that uses an O (n) preprocessing phase …
BonXai: Combining the Simplicity of DTD with the Expressiveness of XML Schema
While the migration from DTD to XML Schema was driven by a need for increased
expressivity and flexibility, the latter was also significantly more complex to use and …
expressivity and flexibility, the latter was also significantly more complex to use and …
Running tree automata on probabilistic XML
S Cohen, B Kimelfeld, Y Sagiv - Proceedings of the twenty-eighth ACM …, 2009 - dl.acm.org
Tree automata (specifically, bottom-up and unranked) form a powerful tool for querying and
maintaining validity of XML documents. XML with uncertain data can be modeled as a …
maintaining validity of XML documents. XML with uncertain data can be modeled as a …
Optimizing schema languages for XML: Numerical constraints and interleaving
The presence of a schema offers many advantages in processing, translating, querying, and
storage of XML data. Basic decision problems such as equivalence, inclusion, and …
storage of XML data. Basic decision problems such as equivalence, inclusion, and …
Operational state complexity of nested word automata
X Piao, K Salomaa - Theoretical Computer Science, 2009 - Elsevier
We introduce techniques to prove lower bounds for the number of states needed by finite
automata operating on nested words. We study the state complexity of Boolean operations …
automata operating on nested words. We study the state complexity of Boolean operations …