Abstract
Breadth-first search (BFS) is one of the most fundamental algorithms for searching a graph. In our previous work, a mobile-assisted diagnosis scheme has been proposed and we have designed a Disease-Symptom data model as a large knowledge base. In this work, we present the design and implementation of a pruning algorithm to capture a part of the large graph-based data model. Generally, to search a large graph, most of the graph queries are too long and very cumbersome to write and sometimes very difficult to implement. Pruning algorithm is one of the prominent solutions of this problem. It results a subgraph or forest for the desired input. Here, our proposed pruning algorithm is multi-source sequential BFS algorithm and it is demonstrated on Disease-Symptom graph database.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Mondal, S., Mukherjee, N.: Mobile-assisted remote healthcare delivery. In: Fourth International Conference on Parallel, Distributed and Grid Computing (PDGC). IEEE, India (2016)
Integrated Management of Neonatal and Childhood Illness. http://www.who.int
Simon, K.: An improved algorithm for transitive closure on acyclic digraphs. Theor. Comput. Sci. 58, 325–346 (1988) (Elsevier)
Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. SIGMOD Rec. 18, 253–262 (1989)
Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA (2002)
Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-HOP a high-compression indexing scheme for reachability query. In: ACM SIGMOD International Conference on Management of Data, 813–826 (2009)
Bramandia, R., Choi, B., Ng, W.K.: On Incremental maintenance of 2-hop labeling of graphs. IEEE Trans. Knowl. Data Eng. 22, 682–698 (2010)
Jin, R., Xiang, Y., Ruan, N., Wang, H.: On efficiently answering reachability queries on very large directed graphs. In: ACM SIGMOD International Conference on Management of Data, pp. 595–608 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Mondal, S., Mukherjee, N. (2019). A BFS-Based Pruning Algorithm for Disease-Symptom Knowledge Graph Database. In: Satapathy, S., Joshi, A. (eds) Information and Communication Technology for Intelligent Systems . Smart Innovation, Systems and Technologies, vol 107. Springer, Singapore. https://doi.org/10.1007/978-981-13-1747-7_40
Download citation
DOI: https://doi.org/10.1007/978-981-13-1747-7_40
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-1746-0
Online ISBN: 978-981-13-1747-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)