Christopher E. Gillies, Nilesh V. Patel, Gautam B. Singh, S. Kruk, E. Cheng, G. Wilson
{"title":"最小Steiner树自动生成SQL查询在病历数据库中的应用","authors":"Christopher E. Gillies, Nilesh V. Patel, Gautam B. Singh, S. Kruk, E. Cheng, G. Wilson","doi":"10.1109/SERVICES.2011.24","DOIUrl":null,"url":null,"abstract":"The size and complexity of medical record databases makes extracting information challenging. With the tables numbering in thousands, even database analysts have trouble finding important fields and discovering various associations between tables. This paper presents a case study of our initial method of finding minimum Steiner trees in the Epic Clarity Reporting database to solve this problem. In addition, we present a web service architecture that can be used to extend our approach to multiple databases.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Minimum Steiner Tree for Automatic SQL Query Generation Applied on a Medical Record Database\",\"authors\":\"Christopher E. Gillies, Nilesh V. Patel, Gautam B. Singh, S. Kruk, E. Cheng, G. Wilson\",\"doi\":\"10.1109/SERVICES.2011.24\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The size and complexity of medical record databases makes extracting information challenging. With the tables numbering in thousands, even database analysts have trouble finding important fields and discovering various associations between tables. This paper presents a case study of our initial method of finding minimum Steiner trees in the Epic Clarity Reporting database to solve this problem. In addition, we present a web service architecture that can be used to extend our approach to multiple databases.\",\"PeriodicalId\":429726,\"journal\":{\"name\":\"2011 IEEE World Congress on Services\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE World Congress on Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SERVICES.2011.24\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE World Congress on Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SERVICES.2011.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Minimum Steiner Tree for Automatic SQL Query Generation Applied on a Medical Record Database
The size and complexity of medical record databases makes extracting information challenging. With the tables numbering in thousands, even database analysts have trouble finding important fields and discovering various associations between tables. This paper presents a case study of our initial method of finding minimum Steiner trees in the Epic Clarity Reporting database to solve this problem. In addition, we present a web service architecture that can be used to extend our approach to multiple databases.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
