The following pages link to XPath (Q27652):
Displaying 50 items.
- Structural characterizations of the navigational expressiveness of relation algebras on a tree (Q896017) (← links)
- Dynamically querying possibilistic XML data (Q903605) (← links)
- Schemas for unordered XML on a DIME (Q905687) (← links)
- Reasoning about XML update constraints (Q923878) (← links)
- A run-time system for efficient execution of scientific workflows on distributed environments (Q934740) (← links)
- Numerical constraints on XML data (Q964502) (← links)
- Streaming tree automata (Q975511) (← links)
- Complete axiomatizations for XPath fragments (Q975868) (← links)
- Reasoning about XML with temporal logics and automata (Q975873) (← links)
- Parallelizing XML data-streaming workflows via MapReduce (Q980993) (← links)
- XML compression techniques: A survey and comparison (Q1021579) (← links)
- Matching subsequences in trees (Q1026243) (← links)
- Worst-case optimal algorithm for XPath evaluation over XML streams (Q1034104) (← links)
- An XPath-based OWL storage model for effective ontology management in semantic web environment (Q1048343) (← links)
- Typechecking for XML transformers (Q1394797) (← links)
- Integrity constraints for XML (Q1394804) (← links)
- Containment of queries for graphs with data (Q1678169) (← links)
- Conjunctive query containment over trees using schema information (Q1702301) (← links)
- On regular paths with counting and data tests (Q1744429) (← links)
- Efficient determinization of visibly and height-deterministic pushdown automata (Q1749148) (← links)
- Applying model-checking to solve queries on semistructured data (Q1749228) (← links)
- Efficient filtering of XML documents with XPath expressions (Q1811338) (← links)
- On the complexity of tree pattern containment with arithmetic comparisons (Q1944129) (← links)
- Compact representation for answer sets of \(n\)-ary regular queries (Q1959656) (← links)
- XML data manipulation in conventional and temporal XML databases: a survey (Q2026276) (← links)
- Learning algorithms (Q2074213) (← links)
- Characterizations for \(\mathrm{XPath}_{\mathcal{R}}(\downarrow)\) (Q2148804) (← links)
- Colored nested words (Q2149962) (← links)
- Backward type inference for XML queries (Q2182320) (← links)
- The fuzzy logic programming language FASILL: design and implementation (Q2206451) (← links)
- Free Kleene algebras with domain (Q2210872) (← links)
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Multi-adjoint concept lattices with heterogeneous conjunctors and hedges. (Q2254615) (← links)
- Querying linguistic trees (Q2268350) (← links)
- Composing stack-attributed tree transducers (Q2272204) (← links)
- Structural recursion as a query language on lists and ordered trees (Q2272218) (← links)
- Database query processing using finite cursor machines (Q2272221) (← links)
- Axiomatizing the logical core of XPath 2.0 (Q2272223) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- On the hardness of learning queries from tree structured data (Q2343989) (← links)
- Early nested word automata for XPath query answering on XML streams (Q2344752) (← links)
- Minimal type inference for linked data consumers (Q2348796) (← links)
- Tight lower bounds for query processing on streaming and external memory data (Q2373746) (← links)
- Selectivity-sensitive shared evaluation of multiple continuous XPath queries over XML streams (Q2390333) (← links)
- Query optimization in information integration (Q2391864) (← links)
- State complexity of operations on input-driven pushdown automata (Q2396831) (← links)
- Model theory of XPath on data trees. II: Binary bisimulation and definability (Q2401631) (← links)
- Axiomatizations for downward XPath on data trees (Q2402362) (← links)
- Regular queries on graph databases (Q2402613) (← links)
