Datenschutzerklärung|Data Privacy

A. Borusan

11.11.2015, 16 Uhr c.t. TU Berlin, EN building, seminar room EN 719 (7th floor), Einsteinufer 17, 10587 Berlin: "On Debunking Computational Models when Measuring Data-intensive Main-Memory Algorithms" (Prof. Jens Dittrich, Saarland University)

Assume you measure the weight of a car and the scale shows minus 42 kg. You double-check the scale: it is correct. You remove all wheels: the scale shows plus 5 metric tons. You buy another, more expensive scale: it shows minus 100 kg. You flip the car upside down: both scales show about plus 200 kg. Great! Now we are in a fantastic situation to compare the weights of five different cars. We publish the results and know for sure which car is heavier than others. Or, ... maybe not?

I will present some of our recent research in experiments and analyses of data-intensive main-memory algorithms and systems. This includes: adaptive indexing (PVLDB 2013/VLDB 2014 best paper award), compressed radix tries (ICDE 2015), hash tables (PVLDB 2016), join algorithms (ongoing), and systems (ongoing). Our experimental results show several surprises and indicate that order of magnitude runtime differences may be obtained, even for super-well researched building blocks like indexes and joins. I will also briefly demo our open source pdbf-janiform toolkit for archiving experimental results inside your pdf-papers (VLDB 2015), see .

DISCLAIMER: This is not a talk showing you how to make your car pass environmental testing situations.