| PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12 - 17, 2022 | 0 | 0.34 | 2022 |
| Incorporating Data Context to Cost-Effectively Automate End-to-End Data Wrangling | 1 | 0.35 | 2021 |
| Coping with Incomplete Data: Recent Advances | 1 | 0.35 | 2020 |
| Reasoning about Measures of Unmeasurable Sets. | 0 | 0.34 | 2020 |
| Updating Graph Databases with Cypher. | 1 | 0.35 | 2019 |
| Research Highlights: Bridging Theory and Practice with Query Log Analysis | 0 | 0.34 | 2019 |
| An Operational Approach to Consistent Query Answering. | 2 | 0.37 | 2018 |
| Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). | 5 | 0.41 | 2018 |
| Certain Answers Meet Zero-One Laws. | 0 | 0.34 | 2018 |
| How Standard is the SQL Standard? | 0 | 0.34 | 2018 |
| 2017 ACM PODS Alberto O. Mendelzon Test-of-Time Award. | 0 | 0.34 | 2018 |
| Explainable Certain Answers. | 0 | 0.34 | 2018 |
| On Querying Incomplete Information in Databases under Bag Semantics. | 4 | 0.40 | 2017 |
| Correctness of SQL Queries on Databases with Nulls. | 2 | 0.37 | 2017 |
| Schema Mappings for Data Graphs. | 0 | 0.34 | 2017 |
| A formal semantics of SQL queries, its validation, and applications | 8 | 0.57 | 2017 |
| On the Codd semantics of SQL nulls | 0 | 0.34 | 2017 |
| Technical Perspective: Data Distribution for Fast Joins. | 0 | 0.34 | 2017 |
| Querying Graphs with Data. | 17 | 0.62 | 2016 |
| SQL's Three-Valued Logic and Certain Answers. | 5 | 0.46 | 2015 |
| Path Logics for Querying Graphs: Combining Expressiveness and Efficiency | 5 | 0.43 | 2015 |
| How to define certain answers | 2 | 0.39 | 2015 |
| SQL's Handling of Nulls: Can It Be Fixed? | 0 | 0.34 | 2015 |
| Certain Answers over Incomplete XML Documents: Extending Tractability Boundary | 4 | 0.39 | 2015 |
| Naïve Evaluation of Queries over Incomplete Databases. | 11 | 0.82 | 2014 |
| Querying Regular Graph Patterns | 4 | 0.39 | 2014 |
| Certain Answers as Objects and Knowledge. | 15 | 0.63 | 2014 |
| Logic, Language, Information, and Computation - 20th International Workshop, WoLLIC 2013, Darmstadt, Germany, August 20-23, 2013. Proceedings | 23 | 1.79 | 2013 |
| Querying graph databases with XPath | 32 | 1.25 | 2013 |
| Containment of pattern-based queries over data trees | 13 | 0.58 | 2013 |
| Regular Expressions with Binding over Data Words for Querying Graph Databases. | 2 | 0.40 | 2013 |
| Graph Logics with Rational Relations | 0 | 0.34 | 2013 |
| Static Analysis and Query Answering for Incomplete Data Trees with Constraints. | 0 | 0.34 | 2013 |
| Graph Logics with Rational Relations | 3 | 0.39 | 2013 |
| When is naive evaluation possible? | 9 | 0.52 | 2013 |
| On the complexity of query answering over incomplete XML documents | 9 | 0.54 | 2012 |
| Querying graph patterns | 10 | 0.56 | 2011 |
| Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization | 12 | 0.54 | 2011 |
| Efficient reasoning about data trees via integer linear programming | 11 | 0.55 | 2011 |
| Data exchange and schema mappings in open and closed worlds | 34 | 1.20 | 2011 |
| Parameterized regular expressions and their languages | 5 | 0.40 | 2011 |
| A Direct Translation from XPath to Nondeterministic Automata. | 3 | 0.42 | 2011 |
| Algorithmic metatheorems for decidable LTL model checking over infinite systems | 13 | 0.58 | 2010 |
| On Incomplete XML Documents with Integrity Constraints | 1 | 0.36 | 2010 |
| On the tradeoff between mapping and querying power in XML data exchange | 7 | 0.46 | 2010 |
| XML with incomplete information: models, properties, and query answering | 9 | 0.60 | 2009 |
| Open and Closed World Assumptions in Data Exchange | 2 | 0.37 | 2009 |
| Recurrent Reachability Analysis in Regular Model Checking | 10 | 0.75 | 2008 |
| Game-based notions of locality over finite models | 2 | 0.39 | 2008 |
| Combining temporal logics for querying XML documents | 7 | 0.44 | 2007 |
