6th DB Retreat, 2016
Date: 14.02.2016 - 16.02.2016
    Place: Glieshof, Matsch, Italy
    General Chairs: Michael Böhlen, Johann Gamper, Nikolaus Augsten, Sven Helmer
    Local Chair: Johann Gamper
   
  Program
Sunday, 14.02.2016
19:00 Welcome and opening
 
  Monday, 15.02.2016
    09:00 - 10:30 Session 1
    
      
    
      
    
      
  
  Session chair: Michael Böhlen
    David Blumenthal
      Graph Edit Distance and Quadratic Assignment
      Opponent: Francesco Cafagna
    Willi Mann
      An Empirical Evaluation of Set Similarity Join Techniques
      Opponent: Michael Shekelyan
    Oksana Dolmatova
      Linear Relational Algebra
      Opponent: Theodoros Chondrogiannis
    
    11:00 - 12:30 Session 2
    
      
    
      
    
      
  
  Session chair: Sven Helmer
    Bezaye Tesfaye
      Shortest Path and Isochrone Queries in Multimodal Networks
      Opponent: David Blumenthal
    Yvonne Mülle
      Predicates over Ongoing Timestamp
      Opponent: Giovanni Mahlknecht
    Sven Helmer
      An Academic Does Not Make a Teacher
      
    12:30 - 14:00 Lunch
  
    14:00 - 15:30 Session 3
    
      
    
      
    
      
  
  Session chair: Nikolaus Augsten
    Francesco Cafagna
      Disjoint Interval Partitioning
      Opponent: Bezaye Tesfaye
    Fabio Persia
      High-level Surveillance Event Detection Using an
          Interval-based Query Language
      Opponent: Oksana Dolmatova
    Michael Shekelyan
      MultisetHist: Compact Summary of Multi-dimensional
          Data for Selectivity Estimation
      Opponent: Georgios Garmpis
    
    16:00 - 17:00 Session 4
    
      
  
  Session chair: Johann Gamper
    Mateusz Pawlik
      Stories About Project Proposals
      
    17:30 Retreat hike and dinner at Matscher Alm
  
    
  Tuesday, 16.02.2016
    09:00 - 10:30 Session 5
    
      
    
      
    
      
  
  Session chair: Bezaye Tesfaye
    Kevin Wellenzohn
      Indexing in Jackrabbit Oak
      Opponent: Willi Mann
    Katerina Papaioannou
      Lineage-Time Adaptor
      Opponent: Fabio Persia
    Theodoros Chondrogiannis
      Alternative Routing: k Shortest Paths with Limited Overlap
      Opponent: Yvonne Mülle
    
    11:00 - 12:30 Session 6
    
      
    
      
    
      
  
  Session chair: Mateusz Pawlik
    Georgios Garmpis
      Multidimensional NNJ
      Opponent: Anton Dignös
    Giovanni Mahlknecht
      Scalable Dynamic Programming Computation of Optimal
          k-Segments for Ordered Data Sets
      Opponent: Kevin Wellenzohn
    Nikolaus Augsten
      Go's and No-Go's of Research Papers
      
    12:30 Lunch
  