From Relation Algebra to Semi-join Algebra: An Approach to Graph Query Optimization

[1]  Jan Van den Bussche,et al.  The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs , 2012, FoIKS.

[2]  Marc Gyssens,et al.  The Power of Tarski's Relation Algebra on Trees , 2018, FoIKS.

[3]  Dániel Marx,et al.  Size Bounds and Query Plans for Relational Joins , 2013, SIAM J. Comput..

[4]  Martin Grohe,et al.  Finite Variable Logics in Descriptive Complexity Theory , 1998, Bulletin of Symbolic Logic.

[5]  Martin Otto,et al.  Bounded variable logics: two, three, and more , 1999, Arch. Math. Log..

[6]  Matthias Jarke,et al.  Query Optimization in Database Systems , 1984, CSUR.

[7]  Peter James Stuckey,et al.  Cost-based optimization for magic: algebra and implementation , 1996, ACM SIGMOD Conference.

[8]  PiraheshHamid,et al.  Cost-based optimization for magic , 1996 .

[9]  Yannis E. Ioannidis,et al.  Query optimization , 1996, CSUR.

[10]  Steven Givant,et al.  The Calculus of Relations as a Foundation for Mathematics , 2006, Journal of Automated Reasoning.

[11]  Alfred Tarski,et al.  Relational selves as self-affirmational resources , 2008 .

[12]  Philip A. Bernstein,et al.  Using Semi-Joins to Solve Relational Queries , 1981, JACM.

[13]  Jelle Hellings.  On Tarski’s Relation Algebra: Querying trees and chains, and the semi-join algebra , 2018 .

[14]  Gabriel M. Kuper,et al.  Structural properties of XPath fragments , 2003, Theor. Comput. Sci..

[15]  Goetz Graefe,et al.  Query evaluation techniques for large databases , 1993, CSUR.

[16]  Marc Gyssens.  On the complexity of join dependencies , 1986, TODS.

[17]  Maarten Marx,et al.  Multi-dimensional modal logic , 1997, Applied logic series.

[18]  Alberto O. Mendelzon,et al.  A graphical query language supporting recursion , 1987, SIGMOD '87.

[19]  E. F. CODD,et al.  A relational model of data for large shared data banks , 1970, CACM.

[20]  Jan Van den Bussche,et al.  The Semijoin Algebra and the Guarded Fragment , 2004, J. Log. Lang. Inf..

[21]  Jorge Pérez,et al.  Relative Expressiveness of Nested Regular Expressions , 2012, AMW.

[22]  Dexter Kozen,et al.  Kleene algebra with tests , 1997, TOPL.

[23]  Marc Gyssens,et al.  From relation algebra to semi-join algebra: an approach for graph query optimization , 2017, DBPL.

[24]  Rance Cleaveland,et al.  A linear-time model-checking algorithm for the alternation-free modal mu-calculus , 1993, Formal Methods Syst. Des..

[25]  Maarten Marx,et al.  Navigational XPath: calculus and algebra , 2007, SGMD.

[26]  Moshe Y. Vardi,et al.  Regular Queries on Graph Databases , 2017, Theory of Computing Systems.

[27]  M. de Rijke,et al.  Semantic characterizations of navigational XPath , 2005, SGMD.

[29]  Marcelo Arenas,et al.  Foundations of Modern Query Languages for Graph Databases , 2016, ACM Comput. Surv..

[30]  Surajit Chaudhuri,et al.  An overview of query optimization in relational systems , 1998, PODS.

[31]  Pablo Barceló Baeza.  Querying graph databases , 2013, PODS 2013.

[32]  Michael Benedikt,et al.  XPath leashed , 2009, CSUR.

[33]  Martin Otto,et al.  On Logics with Two Variables , 1999, Theor. Comput. Sci..

[34]  Michael V. Mannino,et al.  Statistical profile estimation in database systems , 1988, CSUR.

[35]  Jan Van den Bussche,et al.  On the expressive power of semijoin queries , 2003, Inf. Process. Lett..

[36]  Wim Martens,et al.  Querying graph databases with XPath , 2013, ICDT '13.

[37]  Marc Gyssens,et al.  A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form and Minimization , 2009, Comput. J..

[38]  Maarten Marx,et al.  Conditional XPath , 2005, TODS.

[39]  Mihalis Yannakakis,et al.  Algorithms for Acyclic Database Schemes , 1981, VLDB.

[40]  Balder ten Cate,et al.  The expressivity of XPath with transitive closure , 2006, PODS.

[41]  Jan Van den Bussche,et al.  On the complexity of division and set joins in the relational algebra , 2007, J. Comput. Syst. Sci..

[42]  Todd L. Veldhuizen,et al.  Leapfrog Triejoin: A Simple, Worst-Case Optimal Join Algorithm , 2012, 1210.0481.

[43]  Jan Van den Bussche,et al.  Relative expressive power of navigational querying on graphs using transitive closure , 2015, Log. J. IGPL.

[44]  Jan Van den Bussche,et al.  Relative expressive power of downward fragments of navigational query languages on trees and chains , 2015, DBPL.

[45]  Martin Otto,et al.  The expressive power of fixed-point logic with counting , 1996, Journal of Symbolic Logic.

[46]  Jan Van den Bussche,et al.  Relative expressive power of navigational querying on graphs , 2011, ICDT '11.

[47]  Diego Calvanese,et al.  Containment of Conjunctive Regular Path Queries with Inverse , 2000, KR.

[48]  Yves Raimond,et al.  RDF 1.1 Primer , 2014 .

[49]  Alberto O. Mendelzon,et al.  GraphLog: a visual formalism for real life recursion , 1990, PODS '90.

[50]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[51]  Jan Van den Bussche,et al.  The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs , 2013, Annals of Mathematics and Artificial Intelligence.

[52]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[53]  Nathan Goodman,et al.  Multirelations - Semantice and Languages , 1985, VLDB.

[54]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..