Results 11 to 20 of about 4,278 (200)

Expressiveness and static analysis of extended conjunctive regular path queries

Journal of Computer and System Sciences, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Freydenberger, Dominik D., Schweikardt, Nicole   +1 more
openaire   +3 more sources

Size Bounds and Algorithms for Conjunctive Regular Path Queries

, 2023
Conjunctive regular path queries (CRPQs) are one of the core classes of queries over graph databases. They are join intensive, inheriting their structure from the relational setting, but they also allow arbitrary length paths to connect points that are to be joined.
Cucumides, Tamara, Reutter, Juan, Vrgoč, Domagoj   +2 more
openaire   +5 more sources

Dynamic Graph Queries [PDF]

, 2016
Graph databases in many applications - semantic web, transport or biological networks among others - are not only large, but also frequently modified. Evaluating graph queries in this dynamic context is a challenging task, as those queries often combine ...
, Vortmeier, Nils, Zeume, Thomas
core   +1 more source

Logics for Unranked Trees: An Overview [PDF]

, 2005
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing ...
A. Arnold, B. Courcelle, B. Courcelle, B.-H. Schlingloff, E. Clarke, F. Moller, F. Neven, F. Neven, G. Gottlob, G. Gottlob, I. Walukiewicz, J. Niehren, J.R. Büchi, J.W. Thatcher, J.W. Thatcher, L. Cardelli, L. Cardelli, L. Libkin, L. Stockmeyer, M. Benedikt, M. Grohe, M. Rabin, M.Y. Vardi, P. Bouyer, S. Abiteboul, T. Hafer, W. Thomas   +26 more
core   +6 more sources

Evaluating Datalog via Tree Automata and Cycluits [PDF]

, 2019
We investigate parameterizations of both database instances and queries that make query evaluation fixed-parameter tractable in combined complexity. We show that clique-frontier-guarded Datalog with stratified negation (CFG-Datalog) enjoys bilinear-time ...
Amarilli, Antoine, Bourhis, Pierre, Monet, Mikaël, Senellart, Pierre   +3 more
core   +2 more sources

Four Lessons in Versatility or How Query Languages Adapt to the Web [PDF]

, 2009
Exposing not only human-centered information, but machine-processable data on the Web is one of the commonalities of recent Web trends. It has enabled a new kind of applications and businesses where the data is used in ways not foreseen by the data ...
A. Bonifati, A. Gelder van, A. Polleres, A. Polleres, A.C. Klug, B. Adida, B. Cooper, B. Jenner, D. Olteanu, D. Olteanu, D. Recordon, D.D. Chamberlin, D.R. Fulkerson, E. Augurusa, F. Bry, F. Bry, F. Bry, F. Wei, F. Weigel, G. Gottlob, G. Karvounarakis, H. Björklund, H. Garcia-Molina, H. Meuss, H. Meuss, H. Przymusinska, H. Tamaki, H. Wang, H.V. Jagadish, J. Bailey, J. Euzenat, J. Pérez, J. Pérez, J. Pérez, J.D. Ullman, J.J. Carroll, J.V.D. Bussche, K. Kochut, K.A. Ross, K.R. Apt, K.S. Booth, L. Cabibbo, M. Habib, M. Kay, M. Marx, M. Marx, N. Bruno, N. Walsh, P. Boncz, P. Buneman, P. Cholak, P. O’Neil, P.G. Kolaitis, P.P. Schneider, R. Agrawal, R. Fagin, R. Goldman, R. Hull, R. Khare, R. Khare, R. Schenkel, S. Abiteboul, S. Abiteboul, S. Abiteboul, S. Al-Khalifa, S. Berger, S. Groppe, S. Trißl, T. Chen, T. Furche, T. Grust, T. Schwentick, T.C. Przymusinski, U. Assmann, W. Akhtar, W. Chen, W.L. Hsu, W.L. Hsu, Z. Chen   +78 more
core   +2 more sources

Complexity of Conjunctive Regular Path Query Homomorphisms

, 2019
15 pages. Short version appeared in the proceedings of the 15th Conference on Computability in Europe (CIE 2019)
Beaudou, Laurent, Foucaud, Florent, Madelaine, Florent, Nourine, Lhouari, Richard, Gaétan   +4 more
openaire   +2 more sources

Minimizing Conjunctive Regular Path Queries

Proceedings of the ACM on Management of Data
We study the minimization problem for Conjunctive Regular Path Queries (CRPQs) and unions of CRPQs (UCRPQs). This is the problem of checking, given a query and a number k , whether the query is equivalent to one of size at most k . For CRPQs we consider the size to be the number of atoms, and
Diego Figueira, Rémi Morvan, Miguel Romero   +2 more
openaire   +2 more sources

Joining Extractions of Regular Expressions [PDF]

, 2017
Regular expressions with capture variables, also known as "regex formulas," extract relations of spans (interval positions) from text. These relations can be further manipulated via Relational Algebra as studied in the context of document spanners, Fagin
Freydenberger, Dominik D., Kimelfeld, Benny, Peterfreund, Liat   +2 more
core   +2 more sources

Reasoning & Querying – State of the Art [PDF]

, 2008
Various query languages for Web and Semantic Web data, both for practical use and as an area of research in the scientific community, have emerged in recent years.
Bry, François, Furche, Tim, Weiand, Klara   +2 more
core   +1 more source