电子健康记录数据模型中的表达性与查询复杂性
Expressiveness and query complexity in an electronic health record data model.
作者信息
Dolin R H
机构信息
Kaiser Permanente, Southern California Region, USA.
出版信息
Proc AMIA Annu Fall Symp. 1996:522-6.
OBJECTIVE
Describe a high-level conceptual electronic health record (EHR) data model, explain how the model is expressive, present an algorithm for querying the model and determine the complexity of this algorithm.
DESIGN
Entity-Relationship diagramming is used to represent the model, which relies on variably nested relations to enable expressiveness. The algorithm complexity is described using "big-oh" or "O()" notation.
RESULTS
The data model appears to be highly expressive. A tractable recursive query processing algorithm is presented which is polynomial in time and space complexity.
CONCLUSION
Several hurdles remain before the model and algorithm described can be fully tested in a live setting, including the development of techniques to populate the model. However, the study does show the ability to formally analyze an EHR model to understand its particular expressiveness and query complexity.
目的
描述一个高层次的概念性电子健康记录（EHR）数据模型，解释该模型的表达能力，提出一种查询该模型的算法，并确定该算法的复杂度。
设计
使用实体-关系图来表示该模型，该模型依赖可变嵌套关系来实现表达能力。算法复杂度使用“大O”或“O()”表示法来描述。
结果
该数据模型似乎具有很高的表达能力。提出了一种易于处理的递归查询处理算法，其时间和空间复杂度均为多项式。
结论
在实际环境中对所描述的模型和算法进行全面测试之前，仍有几个障碍需要克服，包括开发填充模型的技术。然而，该研究确实展示了正式分析EHR模型以了解其特定表达能力和查询复杂度的能力。
Zotero 插件