19 citations · 26 across the 5 of their papers we have counts for
5 papers
Optimal-Depth Sorting Networks
Daniel Bundala, Michael Codish, Luís Cruz-Filipe +2
We solve a 40-year-old open problem on the depth optimality of sorting networks. In 1973, Donald E. Knuth detailed, in Volume 3 of "The Art of Computer Programming", sorting networ…
Optimal Sorting Networks
Daniel Bundala, Jakub Závodný
This paper settles the optimality of sorting networks given in The Art of Computer Programming vol. 3 more than 40 years ago. The book lists efficient sorting networks with n <= 16…
Aggregation and Ordering in Factorised Databases
Nurzhan Bakibayev, Tomáš Kočiský, Dan Olteanu +1
A common approach to data analysis involves understanding and manipulating succinct representations of data. In earlier work, we put forward a succinct representation system for re…
FDB: A Query Engine for Factorised Relational Databases
Nurzhan Bakibayev, Dan Olteanu, Jakub Závodný
Factorised databases are relational databases that use compact factorised representations at the physical layer to reduce data redundancy and boost query performance. This paper in…
Factorised Representations of Query Results
Dan Olteanu, Jakub Zavodny
Query tractability has been traditionally defined as a function of input database and query sizes, or of both input and output sizes, where the query result is represented as a bag…