| Counting the Solutions to a Query (Invited Talk) | 0 | 0.34 | 2022 |
| Temporal Regular Path Queries | 0 | 0.34 | 2022 |
| Querying in the Age of Graph Databases and Knowledge Graphs | 0 | 0.34 | 2021 |
| A polynomial-time approximation algorithm for counting words accepted by an NFA (invited paper) | 0 | 0.34 | 2021 |
| When is approximate counting for conjunctive queries tractable? | 0 | 0.34 | 2021 |
| The future is big graphs: a community view on graph processing systems | 1 | 0.40 | 2021 |
| Is it Possible to Verify if a Transaction is Spendable? | 0 | 0.34 | 2021 |
| Foundations of Symbolic Languages for Model Interpretability. | 0 | 0.34 | 2021 |
| Chile's new interdisciplinary institute for foundational research on data | 0 | 0.34 | 2020 |
| Counting Problems over Incomplete Databases | 0 | 0.34 | 2020 |
| Cryptocurrency Mining Games with Economic Discount and Decreasing Rewards. | 0 | 0.34 | 2020 |
| Efficient Logspace Classes for Enumeration, Counting, and Uniform Generation | 1 | 0.35 | 2019 |
| G-CORE: A Core for Future Graph Query Languages. | 13 | 0.63 | 2018 |
| Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). | 5 | 0.41 | 2018 |
| On the Progression of Situation Calculus Universal Theories with Constants. | 0 | 0.34 | 2018 |
| Database Theory Column Report on PODS 2018. | 0 | 0.34 | 2018 |
| Foreword: Special Issue on Database Theory. | 0 | 0.34 | 2017 |
| Foundations of Modern Query Languages for Graph Databases. | 31 | 0.93 | 2017 |
| A Note on Computing Certain Answers to Queries over Incomplete Databases. | 0 | 0.34 | 2017 |
| SPARQLByE: Querying RDF data by example. | 0 | 0.34 | 2016 |
| A framework for annotating CSV-like data. | 3 | 0.41 | 2016 |
| SPARQLByE: Querying RDF data by example. | 10 | 0.56 | 2016 |
| SemFacet: Faceted Search over Ontology Enhanced Knowledge Graphs. | 4 | 0.59 | 2016 |
| The Exact Complexity of the First-Order Logic Definability Problem. | 1 | 0.35 | 2016 |
| Faceted search over RDF-based knowledge graphs | 28 | 0.95 | 2016 |
| Knowledge base exchange: The case of OWL 2 QL. | 0 | 0.34 | 2016 |
| Foundations of Modern Graph Query Languages. | 11 | 0.58 | 2016 |
| Reverse Engineering SPARQL Queries. | 10 | 0.61 | 2016 |
| A framework for annotating CSV-like data. | 0 | 0.34 | 2016 |
| Bidirectional constraints for exchanging data: beyond monotone queries | 1 | 0.41 | 2015 |
| A Preliminary Investigation into SPARQL Query Complexity and Federation in Bio2RDF. | 0 | 0.34 | 2015 |
| Expressive languages for querying the semantic web | 9 | 0.46 | 2014 |
| SemFacet: semantic faceted search over yago | 25 | 1.39 | 2014 |
| Enabling Faceted Search over OWL 2 with SemFacet. | 5 | 0.47 | 2014 |
| Expressiveness and Complexity of Bidirectional Constraints for Data Exchange. | 2 | 0.39 | 2014 |
| On Faceted Search over Knowledge Bases. | 0 | 0.34 | 2014 |
| OBDA: Query Rewriting or Materialization? In Practice, Both! | 21 | 0.79 | 2014 |
| A Principled Approach to Bridging the Gap between Graph Data and their Schemas. | 0 | 0.34 | 2014 |
| A principled approach to bridging the gap between graph data and their schemas | 0 | 0.34 | 2014 |
| Towards semantic faceted search | 5 | 0.79 | 2014 |
| Everything you always wanted to know about blank nodes. | 25 | 1.35 | 2014 |
| Data exchange beyond complete data | 29 | 1.19 | 2013 |
| Discovering XSD Keys from XML Data. | 6 | 0.41 | 2013 |
| Federating queries in SPARQL 1.1: Syntax, semantics and evaluation | 43 | 1.69 | 2013 |
| Computing Solutions in OWL 2 QL Knowledge Exchange. | 0 | 0.34 | 2013 |
| The Chilean Database Group. | 0 | 0.34 | 2013 |
| Solutions and query rewriting in data exchange | 2 | 0.36 | 2013 |
| Federation and Navigation in SPARQL 1.1. | 3 | 0.40 | 2012 |
| Representability in DL-Lite_R Knowledge Base Exchange. | 4 | 0.44 | 2012 |
| Ontology-based data access using views | 1 | 0.35 | 2012 |
