Pierre Bourhis
Pierre Bourhis
Junior Researcher, CNRS
Geverifieerd e-mailadres voor univ-lille.fr - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
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
552017
The AXML artifact model
S Abiteboul, P Bourhis, A Galland, B Marinoiu
2009 16th International Symposium on Temporal Representation and Reasoning …, 2009
472009
Provenance circuits for trees and treelike instances
A Amarilli, P Bourhis, P Senellart
International Colloquium on Automata, Languages, and Programming, 56-68, 2015
402015
The impact of disjunction on query answering under guarded-based existential rules
P Bourhis, M Morak, A Pieris
Twenty-Third International Joint Conference on Artificial Intelligence, 2013
372013
A circuit-based approach to efficient enumeration
A Amarilli, P Bourhis, L Jachiet, S Mengel
arXiv preprint arXiv:1702.05589, 2017
342017
Monadic datalog containment
M Benedikt, P Bourhis, P Senellart
International Colloquium on Automata, Languages, and Programming, 79-91, 2012
342012
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
322016
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
312015
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
292016
Highly expressive query languages for unordered data trees
S Abiteboul, P Bourhis, V Vianu
Theory of Computing Systems 57 (4), 927-966, 2015
252015
Reasonable highly expressive query languages
P Bourhis, M Krötzsch, S Rudolph
IJCAI, 2015
242015
Access patterns and integrity constraints revisited
V Bárány, M Benedikt, P Bourhis
Proceedings of the 16th International Conference on Database Theory, 213-224, 2013
242013
Distributed monitoring of peer to peer systems
S Abiteboul, B Marinoiu
Proceedings of the 9th annual ACM international workshop on Web information …, 2007
242007
Constant-delay enumeration for nondeterministic document spanners
A Amarilli, P Bourhis, S Mengel, M Niewerth
arXiv preprint arXiv:2003.02576, 2020
212020
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
212016
Efficient maintenance techniques for views over active documents
S Abiteboul, P Bourhis, B Marinoiu
Proceedings of the 12th International Conference on Extending Database …, 2009
202009
Satisfiability and relevance for queries over active documents
S Abiteboul, P Bourhis, B Marinoiu
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on …, 2009
182009
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
162018
A step up in expressiveness of decidable fixpoint logics
M Benedikt, P Bourhis, MV Boom
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016
162016
How to best nest regular path queries
P Bourhis, M Krötzsch, S Rudolph
162014
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20