I have been working on a research tool for several years now and I keep running into database performance constraints. So far SQL common table expressions (SQL-Server) have given me the best performance, but it often takes over 30 minutes to process hierarchical data that is rather less challenging than I anticipate in production.
With high hopes, I have spent the last few months learning graph databases (JanusGraph with BerkeleyDB) only to discover that a query comparable to my 30-40 minute cte query, crashes after about 10 hours…
I asked about this on stackoverflow https://stackoverflow.com/questions/63112168/graph-database-or-relational-database-common-table-extensions-comparing-acyclic where the details of my of my use case are given.
Is it true that graph databases are not a good solution for my use case, or will Nebula Graph be orders of magnitude faster when the query language is updated to support the kind of query I will need to construct?
Thank you for your assessment.