QPPT: Query Processing on Prefix Trees

@inproceedings{Kissinger2013QPPTQP,
  title={QPPT: Query Processing on Prefix Trees},
  author={Thomas Kissinger and Benjamin Schlegel and Dirk Habich and Wolfgang Lehner},
  booktitle={CIDR},
  year={2013}
}
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 columnstores that exchange columns or vectors between operators and suer from a high tuple reconstruction overhead. In this paper, we present the indexed table-at-a… CONTINUE READING

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 14 CITATIONS

Allocation Strategies for Data-Oriented Architectures

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Query Processing Based on Compressed Intermediates

  • PhD@VLDB
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

Processing Declarative Queries through Generating Imperative Code in Managed Runtimes

  • 2017 IEEE 33rd International Conference on Data Engineering (ICDE)
  • 2014
VIEW 1 EXCERPT
CITES METHODS