XPath

swMATH15780MaRDI QIDQ27652FDOQ27652

Author name not available (Why is that?)

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

• 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
• Axiomatizations for downward XPath on data trees
• Modelling dynamic web data
• Conjunctive query containment over trees using schema information
• Title not available (Why is that?)
• Dynamic class hierarchy management for multi-version ontology-based personalization
• Querying a graph database -- language selection and performance considerations
• Efficient processing of ordered XML twig pattern matching based on extended Dewey
• Matching subsequences in trees
• Structural characterizations of the navigational expressiveness of relation algebras on a tree
• Complete axiomatizations for XPath fragments
• Hilbert-Style Axiomatization for Hybrid XPath with Data
• Determinacy and query rewriting for conjunctive queries and views
• Dynamically querying possibilistic XML data
• Schemas for unordered XML on a DIME
• Containment of queries for graphs with data
• Querying the Unary Negation Fragment with Regular Path Expressions.
• Rewriting of visibly pushdown languages for XML data integration
• An XPath-based OWL storage model for effective ontology management in semantic web environment
• Implementation and Application of Automata
• Minimal type inference for linked data consumers
• XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
• The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates
• Containment of Monadic Datalog Programs via Bounded Clique-Width
• Memory lower bounds for XPath evaluation over XML streams
• A run-time system for efficient execution of scientific workflows on distributed environments
• Some modal aspects of XPath
• Semantic Acyclicity on Graph Databases
• Implementing metcast in Scheme
• On the Notion of an XML Key
• Alternating automata on data trees and XPath satisfiability
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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

This page was built for software: XPath