Query Processing on Prefix Trees Live
Summary: DexterDB uses a prefix-tree processing model that treats indexes as first-class citizens, with each operator consuming and outputting an index on the next operator's attribute. This enables composed operators (e.g., multi-way-select-join-group) for fast in-memory OLAP, with an interactive GUI to explore optimization options. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Thomas Kissinger (Technical University of Dresden)
- 2. Benjamin Schlegel (Technical University of Dresden)
- 3. Dirk Habich (Technical University of Dresden)
- 4. Wolfgang Lehner (Technical University of Dresden)
BibTeX Citation
@inproceedings{kissinger_sigmod13,
title = {{Query Processing on Prefix Trees Live}},
author = {Kissinger, Thomas and Schlegel, Benjamin and Habich, Dirk and Lehner, Wolfgang},
series = {{SIGMOD} '13},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2463676.2463682},
url = {https://dl.acm.org/doi/10.1145/2463676.2463682},
year = {2013}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 14 | MonetDB/X100: Hyper-Pipelining Query Execution | 2005 | CIDR | 0.0006312782 |
| 23 | Efficiently Compiling Efficient Query Plans for Modern Hardware | 2011 | VLDB | 0.00054886415 |
| 8,625 | QPPT: Query Processing on Prefix Trees | 2013 | CIDR | 5.3979222e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 718 | Covering Indexes for Branching Path Queries | 2002 | SIGMOD |
| 2 | 3,876 | Cracking the Database Store | 2005 | CIDR |
| 3 | 4,107 | Processing Queries on Tree-Structured Data Efficiently | 2006 | PODS |
| 4 | 6,012 | Parallel Index-based Stream Join on a Multicore CPU | 2020 | SIGMOD |
| 5 | 7,300 | DEX: Query Execution in a Delta-based Storage System | 2017 | SIGMOD |
| 6 | 1,355 | Query Processing in Main Memory Database Management Systems | 1986 | SIGMOD |
| 7 | 964 | Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes | 2016 | SIGMOD |
| 8 | 11,453 | Asymptotically Better Query Optimization Using Indexed Algebra | 2023 | VLDB |
| 9 | 5,852 | DEX: Scalable Range Indexing on Disaggregated Memory | 2024 | VLDB |
| 10 | 8,625 | QPPT: Query Processing on Prefix Trees | 2013 | CIDR |