Density-optimized Intersection-free Mapping and Matrix Multiplication for Join-Project Operations

Summary: DIM3: density-optimized intersection-free mapping and matrix multiplication for the Join-Project operation. Eliminates the final dedup via intersection-free partition; uses natural-number value mapping with DenseEC and SparseBMM; adds partial caching and Join-Op support; yields 2.3x-18x speedups over prior work and orders of magnitude over RDBMS. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 12719
Venue: VLDB
Year: 2022
Pagerank: 6.6674822e-05
Overall Rank: 3,885 | 72.98%
DOI: 10.14778/3547305.3547326

Incoming Non-self Citations Over Time

Authors

1. Zichun Huang
2. Shimin Chen

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
7,162	Computing the Difference of Conjunctive Queries Efficiently	2023	SIGMOD	4.8132423e-05
8,589	Output-Optimal Algorithms for Join-Aggregate Queries	2025	PODS	4.4897014e-05
10,347	Fast Matrix Multiplication meets the Submodular Width	2025	PODS	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
55	Efficiently Updating Materialized Views	1986	SIGMOD	0.00065762967
102	The Case for Learned Index Structures	2018	SIGMOD	0.00049545203
351	Sort vs. Hash Revisited: Fast Join Implementation on Modern Multi-Core CPUs	2009	VLDB	0.0002636504
404	Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited	2014	VLDB	0.00024143076
416	Computing Queries from Derived Relations	1985	VLDB	0.0002380776
813	Left-Deep Vs. Bushy Trees: An Analysis Of Strategy Spaces And Its Implications For Query Optimization	1991	SIGMOD	0.0001639584
1,063	Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines	1990	VLDB	0.00014362773
1,105	Cardinality Estimation Done Right: Index-Based Join Sampling	2017	CIDR	0.00013990395
1,661	Managing Non-Volatile Memory in Database Systems	2018	SIGMOD	0.00010978755
2,142	Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities	2019	SIGMOD	9.4507296e-05
2,345	Transparent Mid-Tier Database Caching in SQL Server	2003	SIGMOD	8.9919454e-05
4,523	Simplicity Done Right for Join Ordering	2021	CIDR	6.1135504e-05
5,088	TCUDB: Accelerating Database with Tensor Processors	2022	SIGMOD	5.7072189e-05
6,647	Fast Join Project Query Evaluation using Matrix Multiplication	2020	SIGMOD	4.9772122e-05
7,122	Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries	2020	PODS	4.8252188e-05
7,358	Weighted Distinct Sampling: Cardinality Estimation for SPJ Queries	2021	SIGMOD	4.7529363e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
6,524	The 3D Hash Join: Building On Non-Unique Join Attributes	2022	CIDR	5.0274964e-05
4,465	Robust Join Processing with Diamond Hardened Joins	2024	VLDB	6.1604282e-05
3,490	Leveraging Set Relations in Exact Set Similarity Join	2017	VLDB	7.0465856e-05
1,763	Efficient Processing of Joins on Set-valued Attributes	2003	SIGMOD	0.00010638276
7,250	A Scalable and Generic Approach to Range Joins	2022	VLDB	4.78908e-05
7,133	Parallel Algorithms for High-dimensional Proximity Joins	1997	VLDB	4.8226285e-05
7,122	Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries	2020	PODS	4.8252188e-05
250	Efficient set joins on similarity predicates	2004	SIGMOD	0.00030661988
7,065	Fast Matrix Multiplication for Query Processing	2024	PODS	4.8447515e-05
6,647	Fast Join Project Query Evaluation using Matrix Multiplication	2020	SIGMOD	4.9772122e-05