Browsing by Subject "Conjunctive regular path queries"

Now showing items 1-2 of 2

    • Regular queries on graph databases 
      Reutter, Juan L.; Romero, Miguel; Vardi, Moshe Y. (Springer, 2017)
      Graph databases are currently one of the most popular paradigms for storing data. One of the key conceptual differences between graph and relational databases is the focus on navigational queries that ask whether some nodes ...
    • Semantic Acyclicity on Graph Databases 
      Barceló Baeza, Pablo; Romero Orth, Miguel; Vardi, Moshe (SIAM, 2016)
      It is known that unions of acyclic conjunctive queries (CQs) can be evaluated in linear time, as opposed to arbitrary CQs, for which the evaluation problem is NP-complete. It follows from techniques in the area of ...