Database Paper Browser

Back to papers

QPPT: Query Processing on Prefix Trees

Summary: Indexed table-at-a-time model making indexes first-class citizens via intermediate indexed tables and cooperative operators that use optimized prefix trees as the common data-exchange format. Enables low-cost index materialization and composed multi-way-select-join-group operators to accelerate complex OLAP queries, outperforming state-of-the-art in-memory column stores. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
196
Venue
CIDR
Year
2013
Pagerank
4.5367151e-05
Overall Rank
8,342 | 42.03%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
20 C-Store: A Column-oriented DBMS 2005 VLDB 0.00086163998
35 MonetDB/X100: Hyper-Pipelining Query Execution 2005 CIDR 0.00076209479
59 Efficiently Compiling Efficient Query Plans for Modern Hardware 2011 VLDB 0.0006445664
104 Making B+-Trees Cache Conscious in Main Memory 2000 SIGMOD 0.00049475932
1,046 Buffering Database Operations for Enhanced Instruction Cache Performance 2004 SIGMOD 0.00014446882
Previous Page 1 / 1 Next

Semantically Similar Papers