Abstract: Breadth-first search (BFS) is a fundamental building block of various high-performance computing applications beyond graph analysis and also known as a benchmark problem in the Graph 500 ...

During HNSW graph traversal, we are having to oversample 3x for BBQ to bring up the recall to a nice level. While 3x isn't so bad, any deep traversal for HNSW is nasty. I wonder if we can gain some ...

Pull requests help you collaborate on code with other people. As pull requests are created, they’ll appear here in a searchable and filterable list. To get started, you should create a pull request.

Abstract: We demonstrate MITra, a system for synthesizing Multi-Instance graph Traversal algorithms that traverse from multiple source vertices simultaneously over a single thread. Underlying MITra is ...