Volcano— An Extensible and Parallel Query Evaluation System
IEEE Transactions on Knowledge and Data Engineering
Breaking the memory wall in MonetDB
Communications of the ACM - Surviving the data deluge
Efficiently compiling efficient query plans for modern hardware
Proceedings of the VLDB Endowment
KISS-Tree: smart latch-free in-memory indexing on modern architectures
DaMoN '12 Proceedings of the Eighth International Workshop on Data Management on New Hardware
| Hi-index | 0.00 |
Modern database systems have to process huge amounts of data and should provide results with low latency at the same time. To achieve this, data is nowadays typically hold completely in main memory, to benefit of its high bandwidth and low access latency that could never be reached with disks. Current in-memory databases are usually column-stores that exchange columns or vectors between operators and suffer from a high tuple reconstruction overhead. In this demonstration proposal, we present DexterDB, which implements our novel prefix tree-based processing model that makes indexes the first-class citizen of the database system. The core idea is that each operator takes a set of indexes as input and builds a new index as output that is indexed on the attribute requested by the successive operator. With that, we are able to build composed operators, like the multi-way-select-join-group. Such operators speed up the processing of complex OLAP queries so that DexterDB outperforms state-of-the-art in-memory databases. Our demonstration focuses on the different optimization options for such query plans. Hence, we built an interactive GUI that connects to a DexterDB instance and allows the manipulation of query optimization parameters. The generated query plans and important execution statistics are visualized to help the visitor to understand our processing model.