You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
There could be power-law vertices existing in the graph. When a query hitting such vertices, the latency and the cpu cost will dramatically increase. We want to limit the impact of such query. One possible solution is to have a degree threshold. Any query will stop accessing more edges/neighbors when it reaches the threshold.
The text was updated successfully, but these errors were encountered:
There could be power-law vertices existing in the graph. When a query hitting such vertices, the latency and the cpu cost will dramatically increase. We want to limit the impact of such query. One possible solution is to have a degree threshold. Any query will stop accessing more edges/neighbors when it reaches the threshold.
The text was updated successfully, but these errors were encountered: