Publication not explained
This publication has not yet been explained in plain language by the author(s). However, you can still read the publication.
If you are one of the authors, claim this publication so you can create a plain language summary to help more people find, understand and use it.
Featured Image
Read the Original
This page is a summary of: HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs, Proceedings of the ACM on Management of Data, March 2024, ACM (Association for Computing Machinery),
DOI: 10.1145/3639284.
You can read the full text:
Contributors
The following have contributed to this page
