Uncertain Data Management (M2 Data&Knowledge, U. Paris-Saclay)

Language: English Last version: 2016–2017

Course slides:

  • For the introductory lectures and lectures on models of relational probabilistic databases see Antoine Amarilli’s [site].
  • 09/01/2017: Probabilistic Relational Databases – Query Problem [slides]
  • 09/01/2017: Probabilistic Relational Databases – Query Processing [slides]
  • 16/01/2016: Non-Relational Models for Social Networks – Uncertain Graphs [slides]
  • 16/01/2016: Uncertainty in Web and Social Networks – Applications [slides]

Practical labs:

  • 23/01/2016: Probabilistic Queries, MayBMS [pdf]

References:

  1. D. Suciu, D. Olteanu, C. Ré, C. Koch. 2011. “Probabilistic Databases”. Morgan&Claypool.

Previous exams: 2015–2016 [first] [second]

Web Data Models (M2 Data&Knowledge, U. Paris-Saclay)

Language: English Last version: 2016–2017

Exam: 07/11/2016, 2 hours starting at 9am, Télécom ParisTech, rooms B551, B559

Course slides:

  • 12/09/2016: XML, JSON – Syntax, Parsing [slides]
  • 26/09/2016: XML – Validation, Tree Automata [slides]; XML Schema Example [XSD] [XML]
  • 10/10/2016: XPath – Syntax, Semantics [slides]
  • 10/10/2016: XPath – Evaluation [slides]; example slides [slides]
  • 24/10/2016: XPath – Equivalence, Containment [slides]
  • 24/10/2016: XSLT, XQuery (slides taken from [here and [here])

Practical exercises:

  • 19/09/2016: XML – Checking, Parsing [pdf]; Java Examples [DOM] [SAX]
  • 03/10/2016: XML – Validation, Tree Grammars [pdf]
  • 17/10/2016: Programming Project [pdf]; example tests [zip]

References:

  1. Makoto Murata, Dongwon Lee, Murali Mani, and Kohsuke Kawaguchi. 2005. “Taxonomy of XML schema languages using formal language theory”. ACM Trans. Internet Technol. 5, 4, 660-704. [paper]
  2. Georg Gottlob, Christoph Koch, and Reinhard Pichler. 2005. “Efficient algorithms for processing XPath queries”. ACM Trans. Database Syst. 30, 2, 444-491. [paper]
  3. Todd J. Green, Ashish Gupta, Gerome Miklau, Makoto Onizuka, and Dan Suciu. 2004. “Processing XML streams with deterministic automata and stream indexes”. ACM Trans. Database Syst. 29, 4, 752-788. [paper]
  4. Michael Benedikt and Christoph Koch. 2009. “XPath leashed”. ACM Comput. Surv. 41, 1, Article 3, 54 pages. [paper]
  5. Thomas Schwentick. 2004. “XPath query containment”. SIGMOD Rec. 33, 1, 101-109. [paper]
  6. Gerome Miklau and Dan Suciu. 2004. “Containment and equivalence for a fragment of XPath”. J. ACM 51, 1, 2-45. [paper]

Useful reading:

  • C. Maneth’s course “XML and Databases” [page]
  • S. Abiteboul et al. “Web Data Management”. 2011. Cambridge University Press [page]
  • H. Comon et al. “Tree Automata Techniques and Applications”. 2007 [page]
  • W3Schools tutorials [site]

Previous exams: 2015–2016 [pdf]