| JSON: data model, query languages and schema specification P Bourhis, JL Reutter, F Suárez, D Vrgoč Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI symposium on principles of …, 2017 | 146 | 2017 |
| JSON: Data model and query languages P Bourhis, JL Reutter, D Vrgoč Information Systems 89, 101478, 2020 | 92 | 2020 |
| A circuit-based approach to efficient enumeration A Amarilli, P Bourhis, L Jachiet, S Mengel arXiv preprint arXiv:1702.05589, 2017 | 57 | 2017 |
| Provenance circuits for trees and treelike instances A Amarilli, P Bourhis, P Senellart Automata, Languages, and Programming: 42nd International Colloquium, ICALP …, 2015 | 55 | 2015 |
| Constant-delay enumeration for nondeterministic document spanners A Amarilli, P Bourhis, S Mengel, M Niewerth ACM Transactions on Database Systems (TODS) 46 (1), 1-30, 2021 | 53 | 2021 |
| Approximated summarization of data provenance E Ainy, P Bourhis, SB Davidson, D Deutch, T Milo Proceedings of the 24th ACM International on Conference on Information and …, 2015 | 53 | 2015 |
| Guarded-based disjunctive tuple-generating dependencies P Bourhis, M Manna, M Morak, A Pieris ACM Transactions on Database Systems (TODS) 41 (4), 1-45, 2016 | 47 | 2016 |
| The AXML artifact model S Abiteboul, P Bourhis, A Galland, B Marinoiu 2009 16th international symposium on temporal representation and reasoning …, 2009 | 47 | 2009 |
| The impact of disjunction on query answering under guarded-based existential rules P Bourhis, M Morak, A Pieris Informal Proceedings of the 26th International Workshop on Description …, 2013 | 39 | 2013 |
| Monadic datalog containment M Benedikt, P Bourhis, P Senellart International Colloquium on Automata, Languages, and Programming, 79-91, 2012 | 38 | 2012 |
| Tractable lineages on treelike instances: Limits and extensions A Amarilli, P Bourhis, P Senellart Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016 | 37 | 2016 |
| How to best nest regular path queries P Bourhis, M Krötzsch, S Rudolph Informal proceedings of the 27th international workshop on description logics, 2014 | 31 | 2014 |
| Reasonable highly expressive query languages P Bourhis, M Krötzsch, S Rudolph IJCAI, 2015 | 30 | 2015 |
| Enumeration on trees with tractable combined complexity and efficient updates A Amarilli, P Bourhis, S Mengel, M Niewerth Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2019 | 29 | 2019 |
| Highly expressive query languages for unordered data trees S Abiteboul, P Bourhis, V Vianu Proceedings of the 15th International Conference on Database Theory, 46-60, 2012 | 28 | 2012 |
| Distributed monitoring of peer to peer systems S Abiteboul, B Marinoiu Proceedings of the 9th annual ACM international workshop on Web information …, 2007 | 27 | 2007 |
| Querying visible and invisible information M Benedikt, P Bourhis, B Ten Cate, G Puppis Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 24 | 2016 |
| Query answering with transitive and linear-ordered data A Amarilli, M Benedikt, P Bourhis, MV Boom Journal of Artificial Intelligence Research 63, 191-264, 2018 | 22 | 2018 |
| Efficient maintenance techniques for views over active documents S Abiteboul, P Bourhis, B Marinoiu Proceedings of the 12th International Conference on Extending Database …, 2009 | 22 | 2009 |
| A step up in expressiveness of decidable fixpoint logics M Benedikt, P Bourhis, MV Boom Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 21 | 2016 |
Antoine AmarilliI don't endorse Scholar, and just use it for recommendations and alerts. Please ignore this profile.在 a3nm.net 的电子邮件经过验证
