The following pages link to XQuery (Q18755):
Displaying 50 items.
- A survey on tree matching and XML retrieval (Q394973) (← links)
- An overview on XML similarity: background, current trends and future directions (Q458492) (← links)
- The complexity of higher-order queries (Q498405) (← links)
- Conjunctive query containment over trees (Q532363) (← links)
- XML graphs in program analysis (Q532414) (← links)
- A WSDL-based type system for asynchronous WS-BPEL processes (Q537948) (← links)
- Computational complexity of the problem of tree generation under fine-grained access control policies (Q553325) (← links)
- Structural properties of XPath fragments (Q555765) (← links)
- On reasoning about structural equality in XML: a description logic approach (Q555777) (← links)
- Efficient processing of ordered XML twig pattern matching based on extended Dewey (Q621460) (← links)
- On the tree-transformation power of XSLT (Q855270) (← links)
- Well-definedness and semantic type-checking for the nested relational calculus (Q870267) (← links)
- Propagating XML constraints to relations (Q878752) (← links)
- On the memory requirements of XPath evaluation over XML streams (Q878756) (← links)
- Transaction management in RDBMSs with XML support (Q885860) (← links)
- Transformation of XML data using updates without side effects (Q885863) (← links)
- Querying a graph database -- language selection and performance considerations (Q891682) (← links)
- Dynamic class hierarchy management for multi-version ontology-based personalization (Q891684) (← links)
- Query triggers for XML DBMS: Efficient implementation based on shadow mechanism (Q927443) (← links)
- Graph queries for data integration using XML (Q946760) (← links)
- Numerical constraints on XML data (Q964502) (← links)
- Efficient preprocessing of XML queries using structured signatures (Q1014435) (← links)
- Introduction to databases. From biological to spatio-temporal (Q1049894) (← links)
- XML with data values: Typechecking revisited. (Q1401966) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- Markov fundamental tensor and its applications to network analysis (Q1715839) (← links)
- Tractable XML data exchange via relations (Q1762192) (← links)
- Querying linguistic treebanks with monadic second-order logic in linear time (Q1770837) (← links)
- An abstract, reusable, and extensible programming language design architecture (Q1799296) (← links)
- XML data manipulation in conventional and temporal XML databases: a survey (Q2026276) (← links)
- Backward type inference for XML queries (Q2182320) (← links)
- The fuzzy logic programming language FASILL: design and implementation (Q2206451) (← links)
- Structural recursion as a query language on lists and ordered trees (Q2272218) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- On the hardness of learning queries from tree structured data (Q2343989) (← links)
- Minimal type inference for linked data consumers (Q2348796) (← links)
- Tight lower bounds for query processing on streaming and external memory data (Q2373746) (← links)
- The query language to XML documents connected by XLink links (Q2432967) (← links)
- Path constraints in semistructured data (Q2456353) (← links)
- Equivalences and optimizations in an expressive XSLT subset (Q2491211) (← links)
- Support measures for graph data (Q2508500) (← links)
- Advanced structural joins using element distribution (Q2509239) (← links)
- On the equivalence between FDs in XML and FDs in relations (Q2641879) (← links)
- Manipulating trees with hidden labels (Q2864150) (← links)
- Computerizing mathematical text with MathLang (Q2866734) (← links)
- Static and dynamic semantics of NoSQL languages (Q2931787) (← links)
- A type theory for memory allocation and data layout (Q2942924) (← links)
- High-performance complex event processing over hierarchical data (Q2943548) (← links)
- Satisfiability of Constraint Specifications on XML Documents (Q2945725) (← links)
- Efficiently Deciding μ-Calculus with Converse over Finite Trees (Q2957698) (← links)
