Team, Visitors, External Collaborators
Overall Objectives
Research Program
Application Domains
New Software and Platforms
New Results
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


Bibliography

Major publications by the team in recent years
[1]
S. Abiteboul, P. Bourhis, V. Vianu.
Explanations and Transparency in Collaborative Workflows, in: PODS 2018 - 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles Of Database Systems, Houston, Texas, United States, June 2018.
https://hal.inria.fr/hal-01744978
[2]
A. Amarilli, M. Monet, P. Senellart.
Connecting Width and Structure in Knowledge Compilation, in: ICDT 2018 - 21st International Conference on Database Theory, Vienna, Austria, Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, March 2018, vol. 98, pp. 1-17. [ DOI : 10.4230/LIPIcs.ICDT.2018.6 ]
https://hal.inria.fr/hal-01851564
[3]
C. Bourgaux, A. Turhan.
Temporal Query Answering in DL-Lite over Inconsistent Data, in: The Semantic Web - ISWC 2017 - 16th International Semantic Web Conference, Vienna, Austria, October 21-25, 2017, Proceedings, Part I, 2017, pp. 121–137.
https://doi.org/10.1007/978-3-319-68288-4_8
[4]
F. 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
[5]
P. Lagrée, O. Cappé, B. Cautis, S. Maniu.
Effective Large-Scale Online Influence Maximization, in: 2017 IEEE International Conference on Data Mining, ICDM 2017, New Orleans, LA, USA, November 18-21, 2017, 2017, pp. 937–942.
https://doi.org/10.1109/ICDM.2017.118
[6]
M. Leclère, M.-L. Mugnier, M. Thomazo, F. Ulliana.
A Single Approach to Decide Chase Termination on Linear Existential Rules, in: DL 2018 - Description Logics, Tempe, United States, October 2018, https://arxiv.org/abs/1810.02132.
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01892353
[7]
S. Maniu, R. Cheng, P. Senellart.
An Indexing Framework for Queries on Probabilistic Graphs, in: ACM Trans. Datab. Syst, 2017.
https://hal.inria.fr/hal-01437580
[8]
D. 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
[9]
N. Schweikardt, L. Segoufin, A. Vigny.
Enumeration for FO Queries over Nowhere Dense Graphs, in: PODS 2018 - Principles Of Database Systems, Houston, United States, June 2018.
https://hal.inria.fr/hal-01895786
[10]
P. Senellart, L. Jachiet, S. Maniu, Y. Ramusat.
ProvSQL: Provenance and Probability Management in PostgreSQL, in: Proceedings of the VLDB Endowment (PVLDB), August 2018, vol. 11, no 12, pp. 2034-2037. [ DOI : 10.14778/3229863.3236253 ]
https://hal.inria.fr/hal-01851538
Publications of the year

Doctoral Dissertations and Habilitation Theses

[11]
M. Han.
Reinforcement Learning Approaches in Dynamic Environments, Télécom ParisTech, July 2018.
https://hal.inria.fr/tel-01891805
[12]
Q. Lobbé.
Archives, Web fragments and diasporas. For a disaggregated exploration of web archives related to online representations of diasporas, Université Paris-Saclay, November 2018.
https://hal.inria.fr/tel-01963548
[13]
M. Monet.
Combined Complexity of Probabilistic Query Evaluation, Université Paris-Saclay, October 2018.
https://hal.inria.fr/tel-01963559
[14]
A. Vigny.
Query enumeration and nowhere dense graphs, Université Paris-Diderot, September 2018.
https://hal.inria.fr/tel-01963540

Articles in International Peer-Reviewed Journals

[15]
E. Pitoura, P. Tsaparas, G. Flouris, I. Fundulaki, P. Papadakos, S. Abiteboul, G. Weikum.
On Measuring Bias in Online Information, in: SIGMOD record, 2018, pp. 1-6.
https://hal.inria.fr/hal-01638069
[16]
P. Senellart, L. Jachiet, S. Maniu, Y. Ramusat.
ProvSQL: Provenance and Probability Management in PostgreSQL, in: Proceedings of the VLDB Endowment (PVLDB), August 2018, vol. 11, no 12, pp. 2034-2037. [ DOI : 10.14778/3229863.3236253 ]
https://hal.inria.fr/hal-01851538

Articles in National Peer-Reviewed Journals

[17]
S. Abiteboul.
Les algorithmes du commerce, in: Concurrences - revue des droits de la concurrence, 2018.
https://hal.inria.fr/hal-01744283
[18]
S. Abiteboul.
Les déclinaisons de la neutralité, in: ANNALES DES MINES, December 2018.
https://hal.inria.fr/hal-01963510

International Conferences with Proceedings

[19]
S. Abiteboul, P. Bourhis, V. Vianu.
Explanations and Transparency in Collaborative Workflows, in: PODS 2018 - 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles Of Database Systems, Houston, Texas, United States, June 2018.
https://hal.inria.fr/hal-01744978
[20]
A. Amarilli, M. Monet, P. Senellart.
Connecting Width and Structure in Knowledge Compilation, in: ICDT 2018 - 21st International Conference on Database Theory, Vienna, Austria, Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, March 2018, vol. 98, pp. 1-17. [ DOI : 10.4230/LIPIcs.ICDT.2018.6 ]
https://hal.inria.fr/hal-01851564
[21]
M. Han, P.-H. Wuillemin, P. Senellart.
Focused Crawling through Reinforcement Learning, in: 18th International Conference on Web Engineering (ICWE 2018), Cáceres, Spain, T. Mikkone, R. Klamma, J. Hernández (editors), Lecture Notes in Computer Science, Springer, June 2018, vol. 10845, pp. 261-278. [ DOI : 10.1007/978-3-319-91662-0_20 ]
https://hal.inria.fr/hal-01851547
[22]
M. Leclère, M.-L. Mugnier, M. Thomazo, F. Ulliana.
A Single Approach to Decide Chase Termination on Linear Existential Rules, in: DL 2018 - Description Logics, Tempe, United States, October 2018, https://arxiv.org/abs/1810.02132.
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01892353
[23]
Q. Lobbé.
Revealing Historical Events out of Web Archives, in: 22nd International Conference on Theory and Practice of Digital Libraries (TPDL 2018), Porto, Portugal, September 2018.
https://hal.archives-ouvertes.fr/hal-01895951
[24]
Q. Lobbé.
Where the dead blogs are. A Disaggregated Exploration of Web Archives to Reveal Extinct Online Collectives, in: ICADL 2018 - 20th International Conference on Asia-Pacific Digital Libraries, Hamilton, New Zealand, November 2018, pp. 1-12.
https://hal.archives-ouvertes.fr/hal-01895955
[25]
D. Montoya, T. P. Tanon, S. Abiteboul, P. Senellart, F. M. Suchanek.
A Knowledge Base for Personal Information Management, in: LDOW2018 - Linked Open Data Workshop at the World Wide Web Conference, Lyon, France, April 2018.
https://hal-imt.archives-ouvertes.fr/hal-01719312
[26]
M. Niewerth, L. Segoufin.
Enumeration of MSO Queries on Strings with Constant Delay and Logarithmic Updates, in: Principles of Databse Systems, PODS'18, Houston, United States, ACM Press, June 2018. [ DOI : 10.1145/3196959.3196961 ]
https://hal.inria.fr/hal-01895796
[27]
K. Rafes, S. Abiteboul, S. Cohen-Boulakia, B. Rance.
Designing scientific SPARQL queries using autocompletion by snippets, in: 14th IEEE International Conference on eScience, Amsterdam, Netherlands, October 2018.
https://hal.archives-ouvertes.fr/hal-01874780
[28]
Y. Ramusat, S. Maniu, P. Senellart.
Semiring Provenance over Graph Databases, in: 10th USENIX Workshop on the Theory and Practice of Provenance (TaPP 2018), London, United Kingdom, July 2018.
https://hal.inria.fr/hal-01850510
[29]
N. Schweikardt, L. Segoufin, A. Vigny.
Enumeration for FO Queries over Nowhere Dense Graphs, in: PODS 2018 - Principles Of Database Systems, Houston, United States, June 2018.
https://hal.inria.fr/hal-01895786
[30]
B. Spencer, M. Benedikt, P. Senellart.
Form Filling based on Constraint Solving, in: 18th International Conference on Web Engineering (ICWE 2018), Cáceres, Spain, T. Mikkone, R. Klamma, J. Hernández (editors), LNCS - Lecture Notes in Computer Science, Springer, June 2018, vol. 10845. [ DOI : 10.1007/978-3-319-91662-0_20 ]
https://hal.inria.fr/hal-01851555

Scientific Books (or Scientific Book chapters)

[31]
S. Abiteboul.
The Digital Shoebox, in: Memory, edited by Philippe Tortell, Mark Turin, and Margot Young, UBC Press, October 2018.
https://hal.inria.fr/hal-01875161

Internal Reports

[32]
M. Leclère, M.-L. Mugnier, M. Thomazo, F. Ulliana.
A Single Approach to Decide Chase Termination on Linear Existential Rules, arXiv:1810.02132, October 2018.
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01892375

Other Publications

[33]
A. Amarilli, M. L. Ba, D. Deutch, P. Senellart.
Computing Possible and Certain Answers over Order-Incomplete Data, October 2018, https://arxiv.org/abs/1801.06396 - 63 pages, 48 references. Submitted. Extended journal version of arXiv:1707.07222.
https://hal.inria.fr/hal-01891811
[34]
A. Amarilli, P. Bourhis, M. Monet, P. Senellart.
Evaluating Datalog via Tree Automata and Cycluits, October 2018, https://arxiv.org/abs/1808.04663 - 53 pages, 61 references. Journal version of "Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version)" at arXiv:1612.04203. To appear in Theory of Computing Systems.
https://hal.inria.fr/hal-01891814
[35]
A. Amarilli, M. Monet, P. Senellart.
Connecting Width and Structure in Knowledge Compilation (Extended Version), May 2018, https://arxiv.org/abs/1709.06188 - 33 pages, no figures, 40 references. This is the full version with proofs of the corresponding ICDT'18 publication, and it integrates all reviewer feedback. Except for the additional appendices, and except for formatting differences and inessential changes, the contents are the same as in the conference version. [ DOI : 10.4230/LIPIcs.ICDT.2018.6 ]
https://hal.inria.fr/hal-01614551
[36]
D. Basu, P. Senellart, S. Bressan.
BelMan: Bayesian Bandits on the Belief–Reward Manifold, October 2018, https://arxiv.org/abs/1805.01627 - working paper or preprint.
https://hal.inria.fr/hal-01891813
[37]
W. Kazana, L. Segoufin.
First-order queries on classes of structures with bounded expansion, February 2018, working paper or preprint.
https://hal.inria.fr/hal-01706665
References in notes
[38]
S. 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
[39]
S. 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
[40]
S. Abiteboul, P. Buneman, D. Suciu.
Data on the Web: From Relations to Semistructured Data and XML, Morgan Kaufmann, 1999.
[41]
S. 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
[42]
S. Abiteboul, L. Herr, J. Van 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
[43]
S. Abiteboul, R. Hull, V. Vianu.
Foundations of Databases, Addison-Wesley, 1995.
http://webdam.inria.fr/Alice/
[44]
S. 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
[45]
S. Abiteboul, I. Manolescu, P. Rigaux, M. Rousset, P. Senellart.
Web Data Management, Cambridge University Press, 2011.
http://webdam.inria.fr/Jorge
[46]
S. 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
[47]
A. 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
[48]
A. 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
[49]
Y. 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
[50]
Y. 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
[51]
P. 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
[52]
D. 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
[53]
D. 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
[54]
M. 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
[55]
M. 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
[56]
M. 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
[57]
M. 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
[58]
P. 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. Van 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
[59]
B. 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
[60]
N. 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
[61]
A. 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
[62]
P. 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
[63]
M. 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
[64]
N. 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
[65]
A. 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
[66]
F. 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
[67]
L. Getoor.
Introduction to statistical relational learning, MIT Press, 2007.
[68]
G. 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
[69]
T. 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
[70]
T. 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
[71]
A. 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
[72]
M. 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
[73]
T. Imielinski, W. Lipski 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
[74]
W. 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
[75]
B. 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
[76]
A. 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
[77]
D. 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
[78]
J. 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.
[79]
S. 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
[80]
M. Mohri.
Semiring Frameworks and Algorithms for Shortest-Distance Problems, in: Journal of Automata, Languages and Combinatorics, 2002, vol. 7, no 3, pp. 321–350.
[81]
F. 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
[82]
L. 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
[83]
P. 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
[84]
B. 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
[85]
B. Settles.
Active Learning, Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers, 2012.
https://doi.org/10.2200/S00429ED1V01Y201207AIM018
[86]
F. 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
[87]
D. Suciu, D. Olteanu, C. , C. Koch.
Probabilistic Databases, Synthesis Lectures on Data Management, Morgan & Claypool Publishers, 2011.
https://doi.org/10.2200/S00362ED1V01Y201105DTM016
[88]
R. S. Sutton, A. G. Barto.
Reinforcement learning - an introduction, Adaptive computation and machine learning, MIT Press, 1998.
http://www.worldcat.org/oclc/37293240
[89]
M. 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
[90]
K. 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
[91]
M. T. Özsu, P. Valduriez.
Principles of Distributed Database Systems, Third Edition, Springer, 2011.
https://doi.org/10.1007/978-1-4419-8834-8