Database Paper Browser

Back to papers

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)

Paper ID
4616
Venue
SIGMOD
Year
2013
Pagerank
4.1945683e-05
Overall Rank
12,035 | 16.28%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

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
35 MonetDB/X100: Hyper-Pipelining Query Execution 2005 CIDR 0.00076197749
60 Efficiently Compiling Efficient Query Plans for Modern Hardware 2011 VLDB 0.00064439773
8,347 QPPT: Query Processing on Prefix Trees 2013 CIDR 4.5410746e-05
Previous Page 1 / 1 Next

Semantically Similar Papers