XPath

swMATH15780MaRDI QIDQ27652FDOQ27652

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• A survey on tree matching and XML retrieval
• On the minimization of XPath queries
• Transformation of structure-shy programs with application to XPath queries and strategic functions
• XML graphs in program analysis
• A WSDL-based type system for asynchronous WS-BPEL processes
• The fuzzy logic programming language FASILL: design and implementation
• Deciding twig-definability of node selecting tree automata
• Static analysis of navigational XPath over graph databases
• Frontiers of tractability for typechecking simple XML transformations
• Limiting Until in Ordered Tree Query Languages
• On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
• XPath evaluation in linear time
• On the complexity of tree pattern containment with arithmetic comparisons
• View-based query answering in description logics: semantics and complexity
• Regular languages with variables on graphs
• Containment and equivalence for a fragment of XPath
• Conjunctive query containment over trees
• Structural properties of XPath fragments
• Advanced structural joins using element distribution
• Alternating register automata on finite words and trees
• An extension of data automata that captures XPath
• Applying model-checking to solve queries on semistructured data
• Multi-adjoint concept lattices with heterogeneous conjunctors and hedges.
• On the tree-transformation power of XSLT
• The complexity of tree automata and XPath on grammar-compressed trees
• Automata for XML -- a survey
• On the minimization of XML schemas and tree automata for unranked trees
• View-based query processing: on the relationship between rewriting, answering and losslessness
• Distributed XML processing: theory and applications
• Streaming tree automata
• The implication problem for `closest node' functional dependencies in complete XML documents
• Title not available (Why is that?)
• Title not available (Why is that?)
• Worst-case optimal algorithm for XPath evaluation over XML streams
• Controllable Combinatorial Coverage in Grammar-Based Testing
• Numerical constraints on XML data
• Rewriting XPath queries using materialized XPath views
• Free Kleene algebras with domain
• Merging image databases as an example for information integration
• Typechecking for XML transformers
• Containment for Conditional Tree Patterns
• Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
• Federation and Navigation in SPARQL 1.1
• On the memory requirements of XPath evaluation over XML streams
• Propagating XML constraints to relations
• XPath-logic and XPathLog: A logic-programming style XML data manipulation language
• Efficient filtering of XML documents with XPath expressions
• Static analysis of XML security views and query rewriting
• Building knowledge maps of web graphs
• Structural recursion as a query language on lists and ordered trees
• Expressive Path Queries on Graph with Data
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reasoning about XML with temporal logics and automata
• Scrap your boilerplate with XPath-like combinators
• Efficient determinization of visibly and height-deterministic pushdown automata
• Characterizing EF and EX tree logics
• Regular languages of nested words: fixed points, automata, and synchronization
• Extending two-variable logic on data trees with order on data values and its automata
• Using variable automata for querying data graphs
• PiDuce- A project for experimenting web services technologies
• Spatial reasoning with rectangular cardinal relations. The convex tractable subalgebra
• RSS query algebra: towards a better news management
• XML queries and constraints, containment and reformulation
• The complexity of query containment in expressive fragments of XPath 2.0
• The complexity of XPath query evaluation and XML typing
• XPath satisfiability in the presence of DTDs
• Transitive closure logic, nested tree walking automata, and XPath
• Bounded Delay and Concurrency for Earliest Query Answering
• Efficient algorithms for supergraph query processing on graph databases
• Automata for unordered trees
• Integrity constraints for XML
• Solutions in XML data exchange
• Parallelizing XML data-streaming workflows via MapReduce
• Algebraic Specialization of Generic Functions for Recursive Types
• Constraint-aware Schema Transformation
• Relative expressive power of navigational querying on graphs
• Model checking hybrid logics (with an application to semistructured data)
• Path constraints in semistructured data
• \textsc{Plat}{\(\Omega\)}: a mediator between text-editors and proof assistance systems
• Streamable Fragments of Forward XPath
• Automated Reasoning with Analytic Tableaux and Related Methods
• Efficient processing of partially specified twig pattern queries
• Computational complexity of the problem of tree generation under fine-grained access control policies
• Queries on XML streams with bounded delay and concurrency
• The Web services resource framework in a peer-to-peer context
• Least common container of tree pattern queries and its applications
• Tight lower bounds for query processing on streaming and external memory data
• Reasoning about XML update constraints
• Query optimization in information integration
• Title not available (Why is that?)
• State complexity of operations on input-driven pushdown automata
• From searching text to querying XML streams
• Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees
• Axiomatizing the logical core of XPath 2.0
• Title not available (Why is that?)
• Transaction management in RDBMSs with XML support
• Transformation of XML data using updates without side effects
• Beyond multi-adjoint logic programming
• XML compression techniques: A survey and comparison

This page was built for software: XPath