Conditional XPath, the first order complete XPath dialect

Marx, Maarten

doi:10.1145/1055558.1055562

Cited by 41 publications

(73 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Readers interested in a formal semantics for evaluating XPath queries may wish to refer to [Mar04a].…”

Section: The Document Object Model Xml and Xpath 20mentioning

confidence: 99%

“…Conditional axes have been proposed by Maarten Marx in [Mar04b,Mar04a]. A conditional axis takes the form: do a step along the child axis until test holds at the resulting node.…”

Section: Conditional Axesmentioning

confidence: 99%

“…In [GKP02,Mar04a,CDGLV09], the core axes of XPath are defined in terms of a minimal set of relations on tree nodes, e.g. the axes can be defined in terms of right-sibling and child.…”

Section: An Embedded Dsl For Spath In Scalamentioning

confidence: 99%

“…Modal and temporal logic has been widely used as a foundation for query-languages on semi-structured data [Mar04b,BJ07,Mar04a,CG04]. LTL in particular, is expressively equivalent to first-order logic over linear sequences [GPSS80].…”

Section: Conclusion and Related Workmentioning

confidence: 99%

See 3 more Smart Citations

SPath: an extensible query-language for Scala.

Nguyen

2011

JOT

View full text Add to dashboard Cite

Scala combines the functional and object-oriented paradigms and is good at supporting embedded domain-specific languages. Scala presents therefore an opportunity for designing a new kind of query-language that belongs to the family of XPath-like query-languages, for querying semistructured data that is stored within internal memory. In the terminology of XPath, a relation between the nodes of a tree, is called an axis and their purpose is to provide a way of navigating between the nodes within a tree. An XPath query is then, approximately, a path of axis-steps, resembling a directory path in a file-system. XPath has 13 axes. However, it is natural to extend the notion of axis to any relation on tree-nodes, by allowing queries with user-defined axes. The effect of the approach that has been taken in this article is an alternative syntax and semantics for user-defined axes, compared with XPath 2.0.It also turns out that separating the query-language from specific types of trees, enables reuse with any tree data-structure that conforms to the composite design-pattern.SPath is an XPath-like query-language based on Linear Temporal Logic that has been implemented as a domain-specific language, embedded into Scala.

show abstract

“…Readers interested in a formal semantics for evaluating XPath queries may wish to refer to [Mar04a].…”

Section: The Document Object Model Xml and Xpath 20mentioning

confidence: 99%

“…Conditional axes have been proposed by Maarten Marx in [Mar04b,Mar04a]. A conditional axis takes the form: do a step along the child axis until test holds at the resulting node.…”

Section: Conditional Axesmentioning

confidence: 99%

“…In [GKP02,Mar04a,CDGLV09], the core axes of XPath are defined in terms of a minimal set of relations on tree nodes, e.g. the axes can be defined in terms of right-sibling and child.…”

Section: An Embedded Dsl For Spath In Scalamentioning

confidence: 99%

Section: Conclusion and Related Workmentioning

confidence: 99%

See 2 more Smart Citations

SPath: an extensible query-language for Scala.

Nguyen

2011

JOT

View full text Add to dashboard Cite

show abstract

“…Nevertheless, direct language support is not only justified by the ease of use for the query author but also by complexity results, e.g., in [70] that show that regular path expressions do not affect the complexity of a query language such as XPath and can be evaluated in polynomial time w.r.t. data and query size.…”

Section: Triple Patterns Vs Path Expressionsmentioning

confidence: 99%

RDF Querying: Language Constructs and Evaluation Methods Compared

Furche¹,

Linse²,

Bry³

et al. 2006

Reasoning Web

View full text Add to dashboard Cite

Abstract. This article is firstly an introduction into query languages for the Semantic Web, secondly an in-depth comparison of the languages introduced. Only RDF query languages are considered because, as of the writing of this paper, query languages for other Semantic Web data modeling formalisms, especially OWL, are still an open research issue, and only a very small number of, furthermore incomplete, proposals for querying Semantic Web data modeled after other formalisms than RDF exist. The limitation to a few RDF query languages is motivated both by the objective of an in-depth comparison of the languages addressed and by space limitations. During the three years before the writing of this article, more than three dozen proposals for RDF query languages have been published! Not only such a large number, but also the often immature nature of the proposals makes the focus on few, but representative languages a necessary condition for a non-trivial comparison.For this article, the following RDF query languages have been, admittedly subjectively, selected: Firstly, the "relational" or "pattern-based" query languages SPARQL, RQL, TRIPLE, and Xcerpt; secondly the reactive rule query language Algae; thirdly and last the "navigational access" query language Versa. Although subjective, this choice is arguably a good coverage of the diverse language paradigms considered for querying RDF data. It is the authors' hope and expectation, that this comparison will motivate and trigger further similar studies, thus completing the present article and overcoming its limitation.

show abstract

Logics for Unranked Trees: An Overview

Libkin

2005

Automata, Languages and Programming

View full text Add to dashboard Cite

Abstract. Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing navigational properties, and some make it easy to relate complex properties of trees to the existence of tree automata for those properties. Furthermore, logics differ significantly in their model-checking properties, their automata models, and their behavior on ordered and unordered trees. In this paper we present a survey of logics for unranked trees.

show abstract

Conditional XPath, the first order complete XPath dialect

Cited by 41 publications

References 30 publications

SPath: an extensible query-language for Scala.

SPath: an extensible query-language for Scala.

RDF Querying: Language Constructs and Evaluation Methods Compared

Logics for Unranked Trees: An Overview

Contact Info

Product

Resources

About