Friday, February 1, 2019

Honest asymptotic complexity for search trees and tries

›
Fun fact that was pointed out to me by Viktor : All traditional books on algorithms and data structures that we could find gave the lookup ...
Friday, June 8, 2018

Propagation of Mistakes in Papers

›
While reading papers on cardinality estimation I noticed something odd: The seminal paper by Flajolet and Martin on probabilistic counting ...
1 comment:
Monday, April 23, 2018

Addendum to the MILP Optimization Times

›
In our upcoming SIGMOD paper on Adaptive Optimization of Very Large Join Queries we compared result quality and optimization times of over...
Saturday, December 23, 2017

The Case for B-Tree Index Structures

›
Recently a very interesting paper made a  Case for Learned Index Structures . It argued that we could, and perhaps should, replace tradition...
21 comments:
Friday, February 17, 2017

Reasoning in the presence of NULLs

›
One of the defining characteristics of SQL is that it is a declarative query language. That is, the user does not specify how the result sh...
Wednesday, August 24, 2016

Equivalence of Unicode strings is strange

›
Originally  HyPer had a very simple model for strings: We made sure that all strings are valid  UTF-8 , but otherwise did not really care ...
Monday, April 11, 2016

Comparing Join Implementations

›
In the upcoming SIGMOD the group around Jens Dittrich as a very nice paper about different join implementations: Stefan Schuh, Xiao Chen, ...
1 comment: