Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries
IEEE Transactions on Software Engineering
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Extending SQL with Generalized Transitive Closure
IEEE Transactions on Knowledge and Data Engineering
On Model-Checking for Fragments of µ-Calculus
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Temporal Logics over Unranked Trees
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
XML transformation by tree-walking transducers with invisible pebbles
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of query containment in expressive fragments of XPath 2.0
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Navigational XPath: calculus and algebra
ACM SIGMOD Record
XPath, transitive closure logic, and nested tree walking automata
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Recursion in XQuery: put your distributivity safety belt on
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Satisfiability of downward XPath with data equality tests
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of query containment in expressive fragments of XPath 2.0
Journal of the ACM (JACM)
Transitive closure logic, nested tree walking automata, and XPath
Journal of the ACM (JACM)
PDL with intersection and converse is 2EXP-complete
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
A Solver for Modal Fixpoint Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Forward-XPath and extended register automata on data-trees
Proceedings of the 13th International Conference on Database Theory
Rewrite-based verification of XML updates
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Proceedings of the VLDB Endowment
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
SIAM Journal on Computing
Combining temporal logics for querying XML documents
ICDT'07 Proceedings of the 11th international conference on Database Theory
Regular languages with variables on graphs
Information and Computation
High-performance complex event processing over XML streams
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Decidability of Downward XPath
ACM Transactions on Computational Logic (TOCL)
Querying graph databases with XPath
Proceedings of the 16th International Conference on Database Theory
Trial for RDF: adapting graph query languages for RDF data
Proceedings of the 32nd symposium on Principles of database systems
High-performance complex event processing over hierarchical data
ACM Transactions on Database Systems (TODS) - Invited papers issue
| Hi-index | 0.00 |
We extend Core XPath, the navigational fragment of XPath 1.0, with transitive closure and path equalities. The resulting language, Regular XPATH≈, is expressively complete for FO* (first-order logic extended with a transitive closure operator that can be applied to formulas with exactly two free variables). As a corollary, we obtain that Regular XPATH≈ is closed under path intersection and complementation. We also provide characterizations for the *-positive fragment of Regular XPATH≈, and for μRegular XPATH (the extension of Regular XPATH≈ with least fixed points).