Colin Dellow 16cdd70f2b Short-circuit row group evaluation ...

We can avoid eagerly computing bitmasks for other constraints this way.

Possible future work - order the constraints such that we evaluate the
one that is cheapest/most likely to prune a row group first.

This reduces the cyclist query from ~65ms to ~60ms

2018-06-24 11:08:56 -04:00

..

.gitignore

Initial checkin of CSV table

2018-03-02 18:59:34 -05:00

cmds.txt

Code to pretty print constraints

2018-03-10 10:59:53 -05:00

go

Code to pretty print constraints

2018-03-10 10:59:53 -05:00

Makefile

tweak Makefile

2018-06-23 16:13:18 -04:00

parquet_cursor.cc

Short-circuit row group evaluation

2018-06-24 11:08:56 -04:00

parquet_cursor.h

Cache clauses -> row group mapping

2018-03-24 23:57:15 -04:00

parquet_filter.cc

Cache clauses -> row group mapping

2018-03-24 23:57:15 -04:00

parquet_filter.h

Revert "Don't eagerly evaluate constraints"

2018-06-23 20:48:39 -04:00

parquet_table.cc

Move some code out of ensureColumn

2018-06-23 19:10:23 -04:00

parquet_table.h

Move some code out of ensureColumn

2018-06-23 19:10:23 -04:00

parquet.cc

Short-circuit row group evaluation

2018-06-24 11:08:56 -04:00