Re: Degree-Centrality Filtering & Search – Scalable Strategies for OLTP
"zb...@gmail.com" <zblu...@...>
Thank you Boxuan, Was using the term “job” pretty loosely. Your inference about doing these things within ingest/deletion process makes sense. I know there is a lot on the community’s plate now, but if my above solution is truly optimal for current state, I wonder if a JG feature addition may help tackle this problem more consistently. Something like an additional, 3rd , index type (in addition to “graph” and “vertex-centric” indices) . i.e. “edge-connection” or “degree-centrality” index. The feature would require a mixed indexing backend, and minimally a mechanism to choose vertex and edge label combinations to count IN, OUT, and/or BOTH degree centrality. Not sure what the level of effort or implementation details would be, but this is a very common business requirement for graph-based search. If JanusGraph has native/tested support for it, it would make JanusGraph even easier to champion. 😊 Best, Zach
On Tuesday, December 29, 2020 at 3:19:46 AM UTC-5 li...@... wrote:
|
|