Inspector Joins

Summary: Inspector Joins exploits hash-join partitioning’s mandatory first pass to inspect data, build query-specific cache-friendly indexes, and select the best join algorithm. It matches state-of-the-art joins and reaches 1.4× speedups, especially for foreign-key and nearly sorted joins. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 9550
Venue: VLDB
Year: 2005
Pagerank: 6.073697e-05
Overall Rank: 5,829 | 60.01%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Shimin Chen (Carnegie Mellon University)
2. Anastassia Ailamaki (Carnegie Mellon University)
3. Phillip B. Gibbons (Intel)
4. Todd C. Mowry (Carnegie Mellon University; Intel)

BibTeX Citation

@article{chen_vldb05,
        title = {{Inspector Joins}},
        author = {Chen, Shimin and Ailamaki, Anastassia and Gibbons, Phillip B. and Mowry, Todd C.},
        journal = {PVLDB},
        series = {{VLDB} '05},
        pages = {817--828},
        year = {2005}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
632	Adaptive Aggregation on Chip Multiprocessors	2007	VLDB	0.00015575286
1,717	Improving the Performance of List Intersection	2009	VLDB	9.9327227e-05

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
29	Database Architecture Optimized for the New Bottleneck: Memory Access	1999	VLDB	0.00052093615
39	Efficiently Updating Materialized Views	1986	SIGMOD	0.00047309646
74	Cache Conscious Algorithms for Relational Query Processing	1994	VLDB	0.00037330605
100	LEO - DB2's LEarning Optimizer	2001	VLDB	0.00034385207
151	Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans	1998	SIGMOD	0.00029161879
492	Robust Query Processing through Progressive Optimization	2004	SIGMOD	0.0001756877
987	What happens during a Join? Dissecting CPU and Memory Optimization Effects	2000	VLDB	0.00012814017

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,740	Adopting Worst-Case Optimal Joins in Relational Database Systems	2020	VLDB
2	1,779	An Adaptive Hash Join Algorithm for Multiuser Environments	1990	VLDB
3	6,207	The 3D Hash Join: Building On Non-Unique Join Attributes	2022	CIDR
4	5,443	Generalized Hash Teams for Join and Group-by	1999	VLDB
5	3,011	Design and Evaluation of Parallel Pipelined Join Algorithms	1987	SIGMOD
6	2,470	Hash-Based Join Algorithms for Multiprocessor Computers with Shared Memory	1990	VLDB
7	209	Sort vs. Hash Revisited: Fast Join Implementation on Modern Multi-Core CPUs	2009	VLDB
8	959	Memory-Efficient Hash Joins	2015	VLDB
9	5,663	Early Hash Join: A Configurable Algorithm for the Efficient and Early Production of Join Results	2005	VLDB
10	360	Design and Evaluation of Main Memory Hash Join Algorithms for Multi-core CPUs	2011	SIGMOD