Review Paper on Graph Based Approach for Mining Health Examination Records Using Views
|Reshma Ravi1 , emya R2|
1 College Of Engineering Perumon, APJ Abdul Kalam Technological University,kerala ,India.
2 College Of Engineering Perumon, APJ Abdul Kalam Technological University,kerala ,India.
|Correspondence should be addressed to: email@example.com.|
Section:Review Paper, Product Type: Journal Paper
Volume-5 , Issue-11 , Page no. 64-67, Nov-2017
Online published on Nov 30, 2017
Copyright © Reshma Ravi, Remya R . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
|View this paper at Google Scholar | DPI Digital Library|
|XML View||PDF Download|
IEEE Style Citation: Reshma Ravi, Remya R, “Review Paper on Graph Based Approach for Mining Health Examination Records Using Views”, International Journal of Computer Sciences and Engineering, Vol.5, Issue.11, pp.64-67, 2017.
MLA Style Citation: Reshma Ravi, Remya R "Review Paper on Graph Based Approach for Mining Health Examination Records Using Views." International Journal of Computer Sciences and Engineering 5.11 (2017): 64-67.
APA Style Citation: Reshma Ravi, Remya R, (2017). Review Paper on Graph Based Approach for Mining Health Examination Records Using Views. International Journal of Computer Sciences and Engineering, 5(11), 64-67.
|108||85 downloads||18 downloads|
|Answering Queries using Views is proven as an effective technology for querying real life graphs. Real life graphs are really large, so if a query arises from such graph it’s a troublesome process. Answering using views is an easy method. When SHG health algorithm is combined with answering queries using views, we can analyze the medical data and based on that data we can predict whether a health examination participant is at risk, if yes what the key associated disease category is. This helps to predict the risks at an early stage. Medical data are usually large and distributed. So we use efficient algorithms like maximally contained rewriting, Minimal containment along with the SHG algorithm to analyze medical data. Semi supervised Heterogeneous algorithm is an efficient algorithm. Maximally contained rewriting algorithm helps to find an approximate answer to the query even if it is not contained in the views.|
|Key-Words / Index Term :|
|Pattern containment,SHG,Minimal Containment|
 A.Y. Halevy’s, “Answering queries using views: A Survey, “VLDBJ, vol.10, no.4, pp-270-294 2001.
 X. Wu, Theodoratos and W .H. Wang, “Answering XML queries using materialized views revisited”, in proc.18th ACM conf .inf. Knowl. Manage. , 2009, pp.475-484.
 W. Fan, X. Wang, and Y. Wu, “Distributed graph simulation: impossibility and possibility”, proc. VLDB Endowment, vol.7, no.12, pp.1083-1094, 2014.
 Y. Papakonstantinou and V. Vassalos , “Query rewriting for the semi structured data,” in the ACM SIGMOD int. conf. Manag. Data, 1999, pp. 455-466.
 J. Wang, J, J, X. Yu’ and J.Li’s paper, “Answering tree pattern queries using views: A revisit,” in the 14 th Int. conf. Extending Database Technol., 2011, pp. 153-164.
 W. Fan, X. Wang, and Y. Wu, “Incremental graph pattern matching ,” ACM Trans. Database syst., vol.38, no. 3,2013.
 W. Fan, J. Li, X. Wang, and Y. Wu, “Query preserving graph compression,” in proc. ACM SIGMOD Int. conf. Manag . Data, 2012, pp. 157-168.
 R . Pottinger and A. Y. Levy, “A scalable algorithm for the answering using views,” Very Large Data Bases, of 2000, pp. 485.
 D. Calvanese, G. D. Giacomo, , M. Y. Vardi and M. Lenzerini, : “View based query processing and the constraint satisfaction,” in Proc. 15th Annu . IEEE Symp. Logic Comput. Sci., 2000, pp. 475-484.
 Y. Zhuge and H. Garcia-Molina , “ Graph structured views and their Incremental maintenance algorithm ,” in 14th Int .Conf, held at 1998, pp. 116-125.
 M. Muralidharan, V.Valli Mayil, "A Study of Natural Language Processing Procedures", International Journal of Computer Sciences and Engineering, Vol.5, Issue.6, pp.300-304, 2017.