[Project] Improve neighbor count query experience

[kmcginnes]

Neighbor counts are queried when a node is added to the graph. This can be from search or through expansion.

Sometimes these queries take a long time or fail. The UI currently does not surfaces these errors to the user and the progress reporting is inconsistent.

The neighbor count queries can also be taxing to the graph database server. Typically, a request per node added to the graph will be executed. This can amount to hundreds of requests executed in parallel. This can be improved with batching or combining multiple queries together. And many of the neighbor count queries are inefficient and can be improved.

Related Issues

• Addresses #256
• Addresses #184
• Addresses #263
• Partially addresses #324
• Partially addresses #269
• Partially addresses #240
• Partially addresses #358
• Partially addresses #304

Tasks

• [x] #338
• [x] #339
• [x] #438
• [x] #380
• [x] #342
• [x] #388
• [x] #389
• [ ] #344
• [ ] #384
• [x] #442
• [x] #444
• [ ] #459

---

[!TIP] Please use a 👍 reaction to provide a +1/vote.

This helps the community and maintainers prioritize this request.

[!IMPORTANT] If you are interested in working on this issue or have submitted a pull request, please leave a comment.