Density-optimized Intersection-free Mapping and Matrix Multiplication for Join-Project Operations
Summary: DIM3 accelerates join-projects via intersection-free sparse/dense partitioning, optimized value-to-matrix mapping, and Join-Project-specific dense/sparse matrix multiplication. It extends to caching and Join-Aggregate/MJP, yielding 2.3–18× speedups. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zichun Huang (Institute of Computing Technology, Chinese Academy of Sciences)
- 2. Shimin Chen (Institute of Computing Technology, Chinese Academy of Sciences)
BibTeX Citation
@article{huang_vldb22,
title = {{Density-optimized Intersection-free Mapping and Matrix Multiplication for Join-Project Operations}},
author = {Huang, Zichun and Chen, Shimin},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {10},
pages = {2244--2256},
doi = {10.14778/3547305.3547326},
url = {https://doi.org/10.14778/3547305.3547326},
year = {2022}
}
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,444 | Output-Optimal Algorithms for Join-Aggregate Queries | 2025 | PODS | 5.8774519e-05 |
| 7,161 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD | 5.6852987e-05 |
| 10,292 | SPALM: A Sparsity-Pattern-Adaptive Library for Matrices | 2026 | SIGMOD | 5.093636e-05 |
| 10,643 | Fast Matrix Multiplication meets the Submodular Width | 2025 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,622 | Robust Join Processing with Diamond Hardened Joins | 2024 | VLDB |
| 2 | 1,592 | Efficient Processing of Joins on Set-valued Attributes | 2003 | SIGMOD |
| 3 | 3,040 | Leveraging Set Relations in Exact Set Similarity Join | 2017 | VLDB |
| 4 | 7,207 | A Scalable and Generic Approach to Range Joins | 2022 | VLDB |
| 5 | 7,326 | Parallel Algorithms for High-dimensional Proximity Joins | 1997 | VLDB |
| 6 | 10,169 | Towards Output-Optimal Uniform Sampling and Approximate Counting for Join-Project Queries | 2026 | PODS |
| 7 | 7,143 | Parallel Algorithms for Sparse Matrix Multiplication and Join-Aggregate Queries | 2020 | PODS |
| 8 | 200 | Efficient set joins on similarity predicates | 2004 | SIGMOD |
| 9 | 6,885 | Fast Matrix Multiplication for Query Processing | 2024 | PODS |
| 10 | 5,364 | Fast Join Project Query Evaluation using Matrix Multiplication | 2020 | SIGMOD |