DB&IS Seminar WS 2020/21

Seminar on Recent Developments in Databases and Information Systems. 

To attend this seminar, students need to register according to the registration procedure explained below. After the end of the registration process, participants are selected and informed. Each selected student will get assigned one research paper that needs to be presented in a 45-minute talk at the end of the semester. Finally, also a short report (4 pages) about the presented paper needs to be submitted, the latest two weeks after the presentation.

Log

  • 2020-10-28 LaTeX Template uploaded
  • 2020-10-28 Kickoff slides and the first set of deadlines published
  • 2020-10-05 OLAT course created
  • 2020-10-05 Papers assigned
  • 2020-08-31 Initial collection of papers published, registration opened
  • 2020-08-20 Page created

Dates and Deadlines

  • 2 days before presentation Final version of slides 
  • 2020-12-13 No-left-todo version of slides 
  • 2020-11-18 Meeting with supervisor
  • 2020-10-28 Kickoff meeting
  • 2020-09-30 Registration for the seminar

Information on the Registration Process

  • This seminar is offered in the Winter semester of 2020/21.
  • The number of participants is limited.
  • Registration is not done on a first-come, first-served basis.
  • In order to register, download this json template registration file, rename it to yourmatriculationnumber.json, edit it to reflect your information and send it as an attachment via email to Damjan Gjurovski (gjurovski at cs.uni-kl.de). Make sure the file is valid JSON and ASCII or UTF-8 encoded, the latter without byte order mark. Use the paper ids from the following table to specify your preference for at least five papers. Please use your official university email account @cs.uni-kl.de or @student.uni-kl.de to register and to send the email. 
  • Registration due September 30th (This deadline will NOT be extended).
  • Soon after the end of the registration, we will let you know whether or not you got a slot in the seminar.

Papers

ID Paper Student Supervisor
1 Junzhou Zhao, Pinghui Wang, Jing Tao, Shuo Zhang, John C.S. Lui: Continuously Tracking Core Items in Data Streams with Probabilistic Decays link Suchetana Day  Damjan Gjurovski
2 Edward Gan, Peter Bailis, Moses Charikar: CoopStore: Optimizing Precomputed Summaries for Aggregation link  Ashwini Bysaravalli Ananda Murthy  Prof. Michel
3 Kevin Wellenzohn, Michael H. Böhlen, Sven Helmer: Dynamic Interleaving of Content and Structure for Robust Indexing of Semi-Structured Hierarchical Data link  Florian Bollig  Nico Schäfer
4 Harald Lang, Alexander Beischl, Viktor Leis, Peter Boncz, Thomas Neumann, Alfons Kemper: Tree-Encoded Bitmaps link  Ahmed Cheema  Gajendra Doniparthi
5 Robin Rehrmann, Carsten Binnig, Alexander Boehm, Kihong Kim, Wolfgang Lehner: Sharing Opportunities for OLTP Workloads in Different Isolation Levels link  Shreeka Shakya  Prof. Deßloch
6 Huanchen Zhang, Xiaoxuan Liu, David G. Andersen, Michael Kaminsky, Kimberly Keeton, Andrew Pavlo: Order-Preserving Key Compression for In-Memory Search Trees link  Eugene Kadiri  Nico Schäfer
7 Dawei Huang, Dong Young Yoon, Seth Pettie, Barzan Mozafari: Joins on Samples: A Theoretical Guide for Practitioners link  Preethika Anand  Michael Hohenstein
8 Jeyhun Karimov, Volker Markl, Tilmann Rabl: AJoin: Ad-hoc Stream Joins at Scale link  Muhammad Zaid Tariq  Manuel Dossinger
9 Zongheng Yang, Eric Liang, Amog Kamsetty, Chenggang Wu, Yan Duan, Xi Chen, Pieter Abbeel, Joseph M. Hellerstein, Sanjay Krishnan, Ion Stoica: Deep Unsupervised Cardinality Estimation link  Shi Chen  Angjela Davitkova
10 Zongheng Yang, Badrish Chandramouli, Chi Wang, Johannes Gehrke, Yinan Li, Umar Farooq Minhas, Per-Åke Larson, Donald Kossmann, Rajeev Acharya: Qd-tree: Learning Data Layouts for Big Data Analytics link  Tarik Krück  Prof. Michel
11 Lefteris Zervakis, Vinay Setty, Christos Tryfonopoulos, Katja Hose: Efficient Continuous Multi-Query Processing over Graph Streams link  Philipp Bird  Damjan Gjurovski
12 Maurice Herlihy, Barbara Liskov, Liuba Shrira: Cross-chain Deals and Adversarial Commerce link  Basit Daodu  Gajendra Doniparthi
13 Rundong Li, Wolfgang Gatterbauer, Mirek Riedewald: Near-Optimal Distributed Band-Joins through Recursive Partitioning link  Tobias Horst  Prof. Michel
14 Chenggang  Wu, Vikram  Sreekanti, Joseph M. Hellerstein: Transactional Causal Consistency for Serverless Computing link  Yannick Wagner  Prof. Deßloch

You have to be in the University's VPN (full tunnel) for accessing some of the papers. 

Prerequisites

  • Participants should have successfully attended the core lecture Datenbanksysteme (database systems) or equivalent.
  • Having attended the beginner's course Informationssysteme (information systems), or equivalent, is assumed anyway.

 

AG DBIS, TU Kaiserslautern

Datenschutzerklärung/Data Privacy Statement