Processing and Optimizing Main Memory Spatial-Keyword Queries

Summary: Main-memory spatial-keyword queries are processed with a cost-based optimizer over existing spatial and keyword indexes, avoiding the construction of new index structures. Three plan-building operators and five optimization techniques, with an independence-based approximation guarantee, yield 7–11× lower 99th-percentile latency and outperform single-index baselines and DBMS optimizers. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 11243
Venue: VLDB
Year: 2016
Pagerank: 4.6714423e-05
Overall Rank: 7,693 | 46.54%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
7,251	DEX: Query Execution in a Delta-based Storage System	2017	SIGMOD	4.7839943e-05
8,160	List Intersection for Web Search: Algorithms, Cost Models, and Optimizations	2019	VLDB	4.5697316e-05
9,327	Indexing for Keyword Search with Structured Constraints	2023	PODS	4.351469e-05

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
1	Access Path Selection in a Relational Database Management System	1979	SIGMOD	0.0040465394
35	MonetDB/X100: Hyper-Pipelining Query Execution	2005	CIDR	0.00076209479
454	An Overview of Query Optimization in Relational Systems	1998	PODS	0.00022796106
1,018	Automatic Physical Database Tuning: A Relaxation-based Approach	2005	SIGMOD	0.00014626746
1,156	SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases	2004	SIGMOD	0.00013606064
1,262	Efficient Query Processing in Geographic Web Search Engines	2006	SIGMOD	0.00012982825
1,317	Efficient Processing of Top-k Spatial Preference Queries	2011	VLDB	0.00012615781
2,020	Efficient Retrieval of the Top-k Most Relevant Spatial Web Objects	2009	VLDB	9.7766925e-05
2,148	Spatial Keyword Query Processing: An Experimental Evaluation	2013	VLDB	9.4278918e-05
2,342	Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring	2005	SIGMOD	9.0005088e-05
2,465	Fast Set Intersection in Memory	2011	VLDB	8.7344475e-05
2,951	Indexing Boolean Expressions	2009	VLDB	7.8248136e-05
3,449	Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions	2015	VLDB	7.0803234e-05
3,619	Efficient Processing of Window Queries in The Pyramid Data Structure	1990	PODS	6.9061356e-05
3,699	Lazy, Adaptive RID-List Intersection, and Its Application to Index Anding	2007	SIGMOD	6.827026e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
9,168	Main-Memory Operation Buffering for Efficient R-Tree Update	2007	VLDB	4.380727e-05
4,593	Keyword Search on Relational Data Streams	2007	SIGMOD	6.0559961e-05
9,487	Spatial Query Optimization With Learning	2024	VLDB	4.3300131e-05
8,342	QPPT: Query Processing on Prefix Trees	2013	CIDR	4.5367151e-05
1,337	Query Processing in Main Memory Database Management Systems	1986	SIGMOD	0.00012515176
11,256	Asymptotically Better Query Optimization Using Indexed Algebra	2023	VLDB	4.1905499e-05
1,317	Efficient Processing of Top-k Spatial Preference Queries	2011	VLDB	0.00012615781
7,925	Architecting a Query Compiler for Spatial Workloads	2020	SIGMOD	4.610914e-05
9,327	Indexing for Keyword Search with Structured Constraints	2023	PODS	4.351469e-05
6,372	Optimization of Conjunctive Predicates for Main Memory Column Stores	2016	VLDB	5.0878306e-05