Speculative Query Processing

Summary: Leverages user “think time” in a visual query interface plus ML-based user-behavior models to asynchronously precompute or reshape database state that anticipates and speeds likely future queries. Formalizes speculation as an optimization with algebraic cost properties and demonstrates a commercial-DB prototype with ~35% average latency reduction (up to 90%+). (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 12
Venue: CIDR
Year: 2003
Pagerank: 4.1905499e-05
Overall Rank: 12,618 | 12.31%
DOI: -

Incoming Non-self Citations Over Time

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

Authors

1. Neoklis Polyzotis
2. Yannis Ioannidis

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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	Online Aggregation	1997	SIGMOD	0.0010813443
160	Automated Selection of Materialized Views and Indexes for SQL Databases	2000	VLDB	0.00040053897
216	Ripple Joins for Online Aggregation	1999	SIGMOD	0.00033560137
528	Rethinking Database System Architecture: Towards a Self-tuning RISC-style Database System	2000	VLDB	0.0002085799
845	Index Selection in a Self-Adaptive Data Base Management System	1976	SIGMOD	0.00015953779
1,175	The Performance and Utility of the Cactis Implementation Algorithms	1990	VLDB	0.00013485683
1,182	Fido: A Cache That Learns to Fetch	1991	VLDB	0.00013447214
1,553	Predictive Load Control for Flexible Buffer Allocation	1991	VLDB	0.00011385736
1,890	Caching Multidimensional Queries Using Chunks	1998	SIGMOD	0.0001018961
9,063	Adaptive Information System Design: One Query at a Time	1985	SIGMOD	4.3997447e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
1,287	Multiple Query Processing in Deductive Databases using Query Graphs	1986	VLDB	0.00012798692
2,187	Least Expected Cost Query Optimization: What Can We Expect?	2002	PODS	9.3429142e-05
8,537	A Query Engine for Probabilistic Preferences	2018	SIGMOD	4.4893996e-05
74	Efficient Query Evaluation on Probabilistic Databases	2004	VLDB	0.00057797415
4,075	Towards Predicting Query Execution Time for Concurrent and Dynamic Database Workloads	2013	VLDB	6.4699689e-05
1,234	Least Expected Cost Query Optimization: An Exercise in Utility	1999	PODS	0.00013115865
5,524	Facilitating SQL Query Composition and Analysis	2020	SIGMOD	5.4589341e-05
6,277	Uncertainty Aware Query Execution Time Prediction	2014	VLDB	5.1260947e-05
439	Query Optimization for Parallel Execution	1992	SIGMOD	0.00023183237
11,430	Accelerating Complex Analytics using Speculation	2021	CIDR	4.1905499e-05