EN FR
EN FR


previous Previous | up Home


Bibliography

Major publications by the team in recent years
  • 1S. Abiteboul, B. André, D. Kaplan.

    Managing your digital life, in: Commun. ACM, 2015, vol. 58, no 5, pp. 32–35.

    http://doi.acm.org/10.1145/2670528
  • 2S. Abiteboul, R. Hull, V. Vianu.

    Foundations of Databases, Addison-Wesley, 1995.

    http://webdam.inria.fr/Alice/
  • 3S. Abiteboul, I. Manolescu, P. Rigaux, M. Rousset, P. Senellart.

    Web Data Management, Cambridge University Press, 2011.

    http://webdam.inria.fr/Jorge
  • 4A. Amarilli, P. Bourhis, P. Senellart.

    Provenance Circuits for Trees and Treelike Instances, in: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, 2015, pp. 56–68.

    https://doi.org/10.1007/978-3-662-47666-6_5
  • 5M. Benedikt, P. Senellart.

    Databases, in: Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 169–229.

    https://doi.org/10.1007/978-1-4614-1168-0_10
  • 6N. Francis, L. Segoufin, C. Sirangelo.

    Datalog Rewritings of Regular Path Queries using Views, in: Logical Methods in Computer Science, 2015, vol. 11, no 4.

    https://doi.org/10.2168/LMCS-11(4:14)2015
  • 7F. Jacquemard, L. Segoufin, J. Dimino.

    FO2(<, +1, ~) on data trees, data tree automata and branching vector addition systems, in: Logical Methods in Computer Science, 2016, vol. 12, no 2.

    https://doi.org/10.2168/LMCS-12(2:3)2016
  • 8W. Kazana, L. Segoufin.

    Enumeration of monadic second-order queries on trees, in: ACM Trans. Comput. Log., 2013, vol. 14, no 4, pp. 25:1–25:12.

    http://doi.acm.org/10.1145/2528928
  • 9S. Lei, S. Maniu, L. Mo, R. Cheng, P. Senellart.

    Online Influence Maximization, in: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Sydney, NSW, Australia, August 10-13, 2015, 2015, pp. 645–654.

    http://doi.acm.org/10.1145/2783258.2783271
  • 10D. Montoya, S. Abiteboul, P. Senellart.

    Hup-me: inferring and reconciling a timeline of user activity from rich smartphone data, in: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, Bellevue, WA, USA, November 3-6, 2015, 2015, pp. 62:1–62:4.

    http://doi.acm.org/10.1145/2820783.2820852
Publications of the year

Articles in International Peer-Reviewed Journals

Invited Conferences

  • 14S. Abiteboul.

    Issues in Ethical Data Management - Extended Abstract, in: PPDP 2017 - 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 2017.

    https://hal.inria.fr/hal-01621687
  • 15S. Abiteboul, D. Montoya.

    Personal Knowledge Base Systems, in: PAP 2017, Personal analytics and privacy, Skopje, Macedonia, September 2017.

    https://hal.inria.fr/hal-01592601

International Conferences with Proceedings

  • 16A. Amarilli, Y. Amsterdamer, T. Milo, P. Senellart.

    Top-k Querying of Unknown Values under Order Constraints, in: ICDT 2017 - International Conference on Database Theory, Venice, Italy, March 2017. [ DOI : 10.4230/LIPIcs.ICDT.2017.5 ]

    https://hal.inria.fr/hal-01439295
  • 17A. Amarilli, P. Bourhis, M. Monet, P. Senellart.

    Combined Tractability of Query Evaluation via Tree Automata and Cycluits, in: ICDT 2017 - International Conference on Database Theory, Venice, Italy, March 2017. [ DOI : 10.4230/LIPIcs.ICDT.2017.6 ]

    https://hal.inria.fr/hal-01439294
  • 18A. Amarilli, M. Lamine Ba, D. Deutch, P. Senellart.

    Possible and Certain Answers for Queries over Order-Incomplete Data, in: 24th International Symposium on Temporal Representation and Reasoning (TIME 2017), Mons, Belgium, S. Schewe, T. Schneider, J. Wijsen (editors), Schloss Dagstuhl, October 2017, vol. 90, pp. 4:1-4:19, https://arxiv.org/abs/1707.07222. [ DOI : 10.4230/LIPIcs.TIME.2017.4 ]

    https://hal.inria.fr/hal-01570603
  • 19A. Amarilli, M. Monet, P. Senellart.

    Conjunctive Queries on Probabilistic Graphs: Combined Complexity, in: Principles of Database Systems (PODS), Chicago, United States, May 2017, https://arxiv.org/abs/1703.03201. [ DOI : 10.1145/3034786.3056121 ]

    https://hal.inria.fr/hal-01486634
  • 20M. Crochemore, A. Heliou, G. Kucherov, L. Mouchard, S. P. Pissis, Y. Ramusat.

    Minimal absent words in a sliding window & applications to on-line pattern matching, in: FCT 2017, Bordeaux, France, Lecture Notes in Computer Science, Springer, September 2017, forthcoming.

    https://hal.archives-ouvertes.fr/hal-01569264
  • 21O. Savković, E. Kharlamov, W. Nutt, P. Senellart.

    Towards Approximating Incomplete Queries over Partially Complete Databases (Extended Abstract), in: AMW, Montevideo, Uruguay, AMW 2017 - 11th Alberto Mendelzon International Workshop on Foundations of Data Management Montevideo, Uruguay June 5 – 9, 2017, June 2017.

    https://hal.inria.fr/hal-01586884
  • 22L. Segoufin, A. Vigny.

    Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion, in: ICDT, Venise, Italy, March 2017.

    https://hal.inria.fr/hal-01589303
  • 23J. Stoyanovich, B. Howe, S. Abiteboul, G. Miklau, A. Sahuguet, G. Weikum.

    Fides: Towards a Platform for Responsible Data Science, in: SSDBM'17 - 29th International Conference on Scientific and Statistical Database Management, Chicago, United States, June 2017. [ DOI : 10.1145/3085504.3085530 ]

    https://hal.inria.fr/hal-01522418

National Conferences with Proceedings

  • 24K. Rafes, S. Cohen-Boulakia, S. Abiteboul.

    Une autocomplétion générique de SPARQL dans un contexte multi-services, in: BDA 2017 - 33ème conférence sur la «Gestion de Données — Principes, Technologies et Applications», Nancy, France, November 2017.

    https://hal.inria.fr/hal-01627760

Books or Proceedings Editing

Scientific Popularization

Other Publications

  • 29A. Amarilli, Y. Amsterdamer, T. Milo, P. Senellart.

    Top-k Querying of Unknown Values under Order Constraints (Extended Version), January 2017, https://arxiv.org/abs/1701.02634 - 32 pages, 1 figure, 1 algorithm, 51 references. Extended version of paper at ICDT'17.

    https://hal.inria.fr/hal-01439310
  • 30A. Amarilli, M. L. Ba, D. Deutch, P. Senellart.

    Possible and Certain Answers for Queries over Order-Incomplete Data, October 2017, https://arxiv.org/abs/1707.07222 - 55 pages, 5 figures, 1 table, 44 references. Accepted at TIME'17. This paper is the full version with appendices of the article in the TIME proceedings. The main text of this full version is the same as the TIME proceedings version, except some superficial changes (to fit the proceedings version to 15 pages, and to obey LIPIcs-specific formatting requirements). [ DOI : 10.4230/LIPIcs.TIME.2017.4 ]

    https://hal.inria.fr/hal-01614571
  • 31P. Senellart, A. Amarilli, M. Monet.

    Connecting Width and Structure in Knowledge Compilation, October 2017, https://arxiv.org/abs/1709.06188 - 32 pages, no figures, 39 references. Submitted.

    https://hal.inria.fr/hal-01614551
References in notes
  • 32S. Abiteboul, P. Bourhis, V. Vianu.

    Comparing workflow specification languages: A matter of views, in: ACM Trans. Database Syst., 2012, vol. 37, no 2, pp. 10:1–10:59.

    http://doi.acm.org/10.1145/2188349.2188352
  • 33S. Abiteboul, P. Buneman, D. Suciu.

    Data on the Web: From Relations to Semistructured Data and XML, Morgan Kaufmann, 1999.
  • 34S. Abiteboul, D. Deutch, V. Vianu.

    Deduction with Contradictions in Datalog, in: Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014., N. Schweikardt, V. Christophides, V. Leroy (editors), OpenProceedings.org, 2014, pp. 143–154.

    https://doi.org/10.5441/002/icdt.2014.17
  • 35S. Abiteboul, L. Herr, J. V. den Bussche.

    Temporal Versus First-Order Logic to Query Temporal Databases, in: Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 3-5, 1996, Montreal, Canada, R. Hull (editor), ACM Press, 1996, pp. 49–57.

    http://doi.acm.org/10.1145/237661.237674
  • 36S. Abiteboul, B. Kimelfeld, Y. Sagiv, P. Senellart.

    On the expressiveness of probabilistic XML models, in: VLDB J., 2009, vol. 18, no 5, pp. 1041–1064.

    https://doi.org/10.1007/s00778-009-0146-1
  • 37S. Abiteboul, L. Segoufin, V. Vianu.

    Representing and querying XML with incomplete information, in: ACM Trans. Database Syst., 2006, vol. 31, no 1, pp. 208–254.

    http://doi.acm.org/10.1145/1132863.1132869
  • 38A. Amarilli, P. Bourhis, P. Senellart.

    Tractable Lineages on Treelike Instances: Limits and Extensions, in: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, June 26 - July 01, 2016, T. Milo, W. Tan (editors), ACM, 2016, pp. 355–370.

    http://doi.acm.org/10.1145/2902251.2902301
  • 39Y. Amsterdamer, D. Deutch, V. Tannen.

    Provenance for aggregate queries, in: Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, June 12-16, 2011, Athens, Greece, M. Lenzerini, T. Schwentick (editors), ACM, 2011, pp. 153–164.

    http://doi.acm.org/10.1145/1989284.1989302
  • 40Y. Amsterdamer, Y. Grossman, T. Milo, P. Senellart.

    CrowdMiner: Mining association rules from the crowd, in: PVLDB, 2013, vol. 6, no 12, pp. 1250–1253.

    http://www.vldb.org/pvldb/vol6/p1250-amsterdamer.pdf
  • 41P. B. Baeza.

    Querying graph databases, in: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, NY, USA - June 22 - 27, 2013, R. Hull, W. Fan (editors), ACM, 2013, pp. 175–188.

    http://doi.acm.org/10.1145/2463664.2465216
  • 42D. Barbará, H. Garcia-Molina, D. Porter.

    The Management of Probabilistic Data, in: IEEE Trans. Knowl. Data Eng., 1992, vol. 4, no 5, pp. 487–502.

    https://doi.org/10.1109/69.166990
  • 43D. Basu, Q. Lin, W. Chen, H. T. Vo, Z. Yuan, P. Senellart, S. Bressan.

    Regularized Cost-Model Oblivious Database Tuning with Reinforcement Learning, in: T. Large-Scale Data- and Knowledge-Centered Systems, 2016, vol. 28, pp. 96–132.

    https://doi.org/10.1007/978-3-662-53455-7_5
  • 44M. Benedikt, G. Gottlob, P. Senellart.

    Determining relevance of accesses at runtime, in: Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, June 12-16, 2011, Athens, Greece, M. Lenzerini, T. Schwentick (editors), ACM, 2011, pp. 211–222.

    http://doi.acm.org/10.1145/1989284.1989309
  • 45M. Bienvenu, D. Deutch, D. Martinenghi, P. Senellart, F. M. Suchanek.

    Dealing with the Deep Web and all its Quirks, in: Proceedings of the Second International Workshop on Searching and Integrating New Web Data Sources, Istanbul, Turkey, August 31, 2012, M. Brambilla, S. Ceri, T. Furche, G. Gottlob (editors), CEUR Workshop Proceedings, CEUR-WS.org, 2012, vol. 884, pp. 21–24.

    http://ceur-ws.org/Vol-884/VLDS2012_p21_Bienvenu.pdf
  • 46M. Bojańczyk, L. Segoufin, S. Toruńczyk.

    Verification of database-driven systems via amalgamation, in: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, NY, USA - June 22 - 27, 2013, R. Hull, W. Fan (editors), ACM, 2013, pp. 63–74.

    http://doi.acm.org/10.1145/2463664.2465228
  • 47P. Buneman, S. Khanna, W.-C. Tan.

    Why and Where: A Characterization of Data Provenance, in: Database Theory - ICDT 2001, 8th International Conference, London, UK, January 4-6, 2001, Proceedings., J. V. den Bussche, V. Vianu (editors), Lecture Notes in Computer Science, Springer, 2001, vol. 1973, pp. 316–330.

    https://doi.org/10.1007/3-540-44503-X_20
  • 48B. Courcelle.

    The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs, in: Inf. Comput., 1990, vol. 85, no 1, pp. 12–75.

    https://doi.org/10.1016/0890-5401(90)90043-H
  • 49N. N. Dalvi, D. Suciu.

    The dichotomy of probabilistic inference for unions of conjunctive queries, in: J. ACM, 2012, vol. 59, no 6, pp. 30:1–30:87.

    http://doi.acm.org/10.1145/2395116.2395119
  • 50A. Deshpande, Z. G. Ives, V. Raman.

    Adaptive Query Processing, in: Foundations and Trends in Databases, 2007, vol. 1, no 1, pp. 1–140.

    https://doi.org/10.1561/1900000001
  • 51P. Donmez, J. G. Carbonell.

    Proactive learning: cost-sensitive active learning with multiple imperfect oracles, in: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008, J. G. Shanahan, S. Amer-Yahia, I. Manolescu, Y. Zhang, D. A. Evans, A. Kolcz, K. Choi, A. Chowdhury (editors), ACM, 2008, pp. 619–628.

    http://doi.acm.org/10.1145/1458082.1458165
  • 52M. Faheem, P. Senellart.

    Adaptive Web Crawling Through Structure-Based Link Classification, in: Digital Libraries: Providing Quality Information - 17th International Conference on Asia-Pacific Digital Libraries, ICADL 2015, Seoul, Korea, December 9-12, 2015, Proceedings, R. B. Allen, J. Hunter, M. L. Zeng (editors), Lecture Notes in Computer Science, Springer, 2015, vol. 9469, pp. 39–51.

    https://doi.org/10.1007/978-3-319-27974-9_5
  • 53A. Galland, S. Abiteboul, A. Marian, P. Senellart.

    Corroborating information from disagreeing views, in: Proceedings of the Third International Conference on Web Search and Web Data Mining, WSDM 2010, New York, NY, USA, February 4-6, 2010, B. D. Davison, T. Suel, N. Craswell, B. Liu (editors), ACM, 2010, pp. 131–140.

    http://doi.acm.org/10.1145/1718487.1718504
  • 54F. Geerts, A. Poggi.

    On database query languages for K-relations, in: J. Applied Logic, 2010, vol. 8, no 2, pp. 173–185.

    https://doi.org/10.1016/j.jal.2009.09.001
  • 55L. Getoor.

    Introduction to statistical relational learning, MIT Press, 2007.
  • 56G. Gouriten, S. Maniu, P. Senellart.

    Scalable, generic, and adaptive systems for focused crawling, in: 25th ACM Conference on Hypertext and Social Media, HT '14, Santiago, Chile, September 1-4, 2014, L. Ferres, G. Rossi, V. A. F. Almeida, E. Herder (editors), ACM, 2014, pp. 35–45.

    http://doi.acm.org/10.1145/2631775.2631795
  • 57T. J. Green, G. Karvounarakis, V. Tannen.

    Provenance semirings, in: Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China, L. Libkin (editor), ACM, 2007, pp. 31–40.

    http://doi.acm.org/10.1145/1265530.1265535
  • 58T. J. Green, V. Tannen.

    Models for Incomplete and Probabilistic Information, in: IEEE Data Eng. Bull., 2006, vol. 29, no 1, pp. 17–24.

    http://sites.computer.org/debull/A06mar/green.ps
  • 59A. Y. Halevy.

    Answering queries using views: A survey, in: VLDB J., 2001, vol. 10, no 4, pp. 270–294.

    https://doi.org/10.1007/s007780100054
  • 60M. A. Hearst, S. T. Dumais, E. Osuna, J. Platt, B. Scholkopf.

    Support vector machines, in: IEEE Intelligent Systems, 1998, vol. 13, no 4, pp. 18–28.

    https://doi.org/10.1109/5254.708428
  • 61T. Imielinski, W. L. Jr..

    Incomplete Information in Relational Databases, in: J. ACM, 1984, vol. 31, no 4, pp. 761–791.

    http://doi.acm.org/10.1145/1634.1886
  • 62W. Kazana, L. Segoufin.

    Enumeration of first-order queries on classes of structures with bounded expansion, in: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, NY, USA - June 22 - 27, 2013, R. Hull, W. Fan (editors), ACM, 2013, pp. 297–308.

    http://doi.acm.org/10.1145/2463664.2463667
  • 63B. Kimelfeld, P. Senellart.

    Probabilistic XML: Models and Complexity, in: Advances in Probabilistic Databases for Uncertain Information Management, Z. Ma, L. Yan (editors), Studies in Fuzziness and Soft Computing, Springer, 2013, vol. 304, pp. 39–66.

    https://doi.org/10.1007/978-3-642-37509-5_3
  • 64A. C. Klug.

    Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions, in: J. ACM, 1982, vol. 29, no 3, pp. 699–717.

    http://doi.acm.org/10.1145/322326.322332
  • 65D. Kossmann.

    The State of the art in distributed query processing, in: ACM Comput. Surv., 2000, vol. 32, no 4, pp. 422–469.

    http://doi.acm.org/10.1145/371578.371598
  • 66J. D. Lafferty, A. McCallum, F. C. N. Pereira.

    Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data, in: Proceedings of the Eighteenth International Conference on Machine Learning (ICML 2001), Williams College, Williamstown, MA, USA, June 28 - July 1, 2001, C. E. Brodley, A. P. Danyluk (editors), Morgan Kaufmann, 2001, pp. 282–289.
  • 67M. Mohri.

    Semiring Frameworks and Algorithms for Shortest-Distance Problems, in: Journal of Automata, Languages and Combinatorics, 2002, vol. 7, no 3, pp. 321–350.
  • 68F. Neven.

    Automata Theory for XML Researchers, in: SIGMOD Record, 2002, vol. 31, no 3, pp. 39–46.

    http://doi.acm.org/10.1145/601858.601869
  • 69L. Segoufin.

    A glimpse on constant delay enumeration (Invited Talk), in: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France, E. W. Mayr, N. Portier (editors), LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014, vol. 25, pp. 13–27.

    https://doi.org/10.4230/LIPIcs.STACS.2014.13
  • 70P. Senellart, A. Mittal, D. Muschick, R. Gilleron, M. Tommasi.

    Automatic wrapper induction from hidden-web sources with domain knowledge, in: 10th ACM International Workshop on Web Information and Data Management (WIDM 2008), Napa Valley, California, USA, October 30, 2008, C. Y. Chan, N. Polyzotis (editors), ACM, 2008, pp. 9–16.

    http://doi.acm.org/10.1145/1458502.1458505
  • 71B. Settles, M. Craven, L. Friedland.

    Active learning with real annotation costs, in: NIPS 2008 Workshop on Cost-Sensitive Learning, 2008.

    http://burrsettles.com/pub/settles.nips08ws.pdf
  • 72B. Settles.

    Active Learning, Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers, 2012.

    https://doi.org/10.2200/S00429ED1V01Y201207AIM018
  • 73F. M. Suchanek, S. Abiteboul, P. Senellart.

    PARIS: Probabilistic Alignment of Relations, Instances, and Schema, in: PVLDB, 2011, vol. 5, no 3, pp. 157–168.

    http://www.vldb.org/pvldb/vol5/p157_fabianmsuchanek_vldb2012.pdf
  • 74D. Suciu, D. Olteanu, C. Ré, C. Koch.

    Probabilistic Databases, Synthesis Lectures on Data Management, Morgan & Claypool Publishers, 2011.

    https://doi.org/10.2200/S00362ED1V01Y201105DTM016
  • 75R. S. Sutton, A. G. Barto.

    Reinforcement learning - an introduction, Adaptive computation and machine learning, MIT Press, 1998.

    http://www.worldcat.org/oclc/37293240
  • 76M. Y. Vardi.

    The Complexity of Relational Query Languages (Extended Abstract), in: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, May 5-7, 1982, San Francisco, California, USA, H. R. Lewis, B. B. Simons, W. A. Burkhard, L. H. Landweber (editors), ACM, 1982, pp. 137–146.

    http://doi.acm.org/10.1145/800070.802186
  • 77K. Zhou, M. Lalmas, T. Sakai, R. Cummins, J. M. Jose.

    On the reliability and intuitiveness of aggregated search metrics, in: 22nd ACM International Conference on Information and Knowledge Management, CIKM'13, San Francisco, CA, USA, October 27 - November 1, 2013, Q. He, A. Iyengar, W. Nejdl, J. Pei, R. Rastogi (editors), ACM, 2013, pp. 689–698.

    http://doi.acm.org/10.1145/2505515.2505691
  • 78M. T. Özsu, P. Valduriez.

    Principles of Distributed Database Systems, Third Edition, Springer, 2011.

    https://doi.org/10.1007/978-1-4419-8834-8


previous Previous | up Home