Takip et
Pierre Bourhis
Pierre Bourhis
Researcher, CNRS
univ-lille.fr üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
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
1662017
JSON: Data model and query languages
P Bourhis, JL Reutter, D Vrgoč
Information Systems 89, 101478, 2020
1062020
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
652021
A circuit-based approach to efficient enumeration
A Amarilli, P Bourhis, L Jachiet, S Mengel
arXiv preprint arXiv:1702.05589, 2017
642017
Provenance circuits for trees and treelike instances
A Amarilli, P Bourhis, P Senellart
International Colloquium on Automata, Languages, and Programming, 56-68, 2015
592015
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
522015
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
502016
The AXML artifact model
S Abiteboul, P Bourhis, A Galland, B Marinoiu
2009 16th International Symposium on Temporal Representation and Reasoning …, 2009
472009
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
392013
Monadic datalog containment
M Benedikt, P Bourhis, P Senellart
International Colloquium on Automata, Languages, and Programming, 79-91, 2012
392012
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
372016
Reasonable highly expressive query languages
P Bourhis, M Krötzsch, S Rudolph
IJCAI, 2015
342015
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
332019
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
332014
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
272012
Distributed monitoring of peer to peer systems
S Abiteboul, B Marinoiu
Proceedings of the 9th annual ACM international workshop on Web information …, 2007
272007
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
252018
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
252016
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
242016
Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics.
P Bourhis, C Lutz
KR, 207-216, 2016
242016
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20