ArticleBioengineering (Basel, Switzerland)2025
Storage and Query of Drug Knowledge Graphs Using Distributed Graph Databases: A Case Study.
Article in Bioengineering (Basel, Switzerland), 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
Abstract
backgroundDistributed graph databases are a promising method for storing and conducting complex pathway queries on large-scale drug knowledge graphs to support drug research. However, there is a research gap in evaluating drug knowledge graphs' storage and query performance based on distributed graph databases. This study evaluates the feasibility and performance of distributed graph databases in managing large-scale drug knowledge graphs.
methodsFirst, a drug knowledge graph storage and query system is designed based on the Nebula Graph database. Second, the system's writing and query performance is evaluated. Finally, two drug repurposing benchmarks are used to provide a more extensive and reliable assessment.
resultsThe performance of distributed graph databases surpasses that of single-machine databases, including data writing, regular queries, constrained queries, and concurrent queries. Additionally, the advantages of distributed graph databases in writing performance become more pronounced as the data volume increases. The query performance benefits of distributed graph databases also improve with the complexity of query tasks. The drug repurposing evaluation results show that 78.54% of the pathways are consistent with currently approved drug treatments according to repoDB. Additionally, 12 potential pathways for new drug indications are found to have literature support according to DrugRepoBank.
conclusionsThe proposed system is able to construct, store, and query a large graph of multisource drug knowledge and provides reliable and explainable drug-disease paths for drug repurposing.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.