This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are propos...This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are proposed in the paper. The ideas of single queue scheduling(SQS) and dual queue scheduling (DQS) are proposed and the algorithm and the performance evaluation for these two scheduling are presented in some paper. This paper describes a new idea of thescheduling for MGL, compatible requests first (CRF). Combining the new idea with SQS and DQS,we propose two new scheduling algorithms called CRFS and CRFD. After describing the simulationmodel, this paper illustrates the comparisons of the performance among these four algorithms. Asshown in the experiments, DQS has better performance than SQS, CRFD is better than DQS, CRFSperforms better than SQS, and CRFS is the best one of these four scheduling algorithms.展开更多
现有的索引选择方法存在诸多局限性.首先,大多数方法考虑场景较为单一,不能针对特定数据模态选择合适的索引结构,进而无法有效应对海量多模态数据;其次,现有方法未考虑索引选择时索引构建的代价,无法有效应对动态的工作负载.针对上述问...现有的索引选择方法存在诸多局限性.首先,大多数方法考虑场景较为单一,不能针对特定数据模态选择合适的索引结构,进而无法有效应对海量多模态数据;其次,现有方法未考虑索引选择时索引构建的代价,无法有效应对动态的工作负载.针对上述问题,提出一种面向多模态数据的智能高效索引选择模型APE-X DQN(Distributed prioritized experience replay in deep Q-network),称为AP-IS(APE-X DQN for index selection).AP-IS设计了新型索引集编码和SQL语句编码方法,该方法使AP-IS在感知多模态数据的同时兼顾索引结构本身的特性,极大地降低了索引的存储代价.APIS集成新型索引效益评估方法,在优化强化学习奖励机制的同时,监控数据库工作负载的执行状态,保证动态工作负载下AP-IS在时间和空间上的优化效果.在真实多模态数据集上进行大量实验,验证了AP-IS在工作负载的延迟、存储代价和训练效率等方面的性能,结果均明显优于最新索引选择方法.展开更多
目的为提高医院内骨质疏松性骨折(osteoporotic fracture,OF)患者诊疗质量和管理效率,本研究自主构建一种医院内自动抓取相关资料的“骨质疏松性骨折数据库”,数据库内置管理流程相关的智能化功能模块。在此基础上,分析该数据库在实际...目的为提高医院内骨质疏松性骨折(osteoporotic fracture,OF)患者诊疗质量和管理效率,本研究自主构建一种医院内自动抓取相关资料的“骨质疏松性骨折数据库”,数据库内置管理流程相关的智能化功能模块。在此基础上,分析该数据库在实际场景应用的结果和有效性。方法构建院内封闭式多源异构数据整合的专病数据库,数据库接口可后台对接医院的信息系统(hospital information system,HIS)、影像归档和通信系统(picture archiving and communication systems,PACS)、实验室信息系统(laboratory information system,LIS)等固有数据平台,并自动运用自然语言处理(natural language processing,NLP)技术识别及整合OF患者相关信息。运用该数据库纳入2022年6月至2024年6月苏州大学附属第二医院收治的50岁以上、4部位骨折(椎体、髋部、肱骨近端和桡骨远端)的12754例患者,并对患者信息进行智能化管理应用分析。结果该数据库可按照纳入条件自动获得12754例患者数据,并自动收集患者基本资料、病历或影像检查的骨折记录、检验检查结果、实时治疗方案等407个结构化字段信息。数据库可自动完成患者的骨质疏松相关数据识别(骨折部位、骨密度值、骨代谢相关指标、抗骨质疏松药使用)、院内转科及经治医生追踪、院内多次骨折记录检索。当患者确定纳入管理,数据库可实现本次骨折后2年档案构建、辅助宣教、智能随访、院内门诊电脑同屏显示等智能化管理功能。结论“骨质疏松性骨折数据库”拥有便捷的OF患者信息抓取功能,可实时了解相应管理的基础数据,可自动完成规定时间内设定管理的指导及提醒。该数据库有院内多源异构数据整合的专病数据库特点,为OF精准化、智能化、便捷化管理提供新的思路和有效工具。展开更多
In order to rapidly and effectively meet the informative demand from commanding decision-making, it is important to build, maintain and mine the intelligence database. The type, structure and maintenance of military i...In order to rapidly and effectively meet the informative demand from commanding decision-making, it is important to build, maintain and mine the intelligence database. The type, structure and maintenance of military intelligence database are discussed. On this condition, a new data-mining arithmetic based on relation intelligence database is presented according to the preference information and the requirement of time limit given by the commander. Furthermore, a simple calculative example is presented to prove the arithmetic with better maneuverability. Lastly, the problem of how to process the intelligence data mined from the intelligence database is discussed.展开更多
文摘This paper introduces a multi-granularity locking model (MGL) for concurrency control in object-oriented database system briefiy, and presents a MGL model formally. Four lockingscheduling algorithms for MGL are proposed in the paper. The ideas of single queue scheduling(SQS) and dual queue scheduling (DQS) are proposed and the algorithm and the performance evaluation for these two scheduling are presented in some paper. This paper describes a new idea of thescheduling for MGL, compatible requests first (CRF). Combining the new idea with SQS and DQS,we propose two new scheduling algorithms called CRFS and CRFD. After describing the simulationmodel, this paper illustrates the comparisons of the performance among these four algorithms. Asshown in the experiments, DQS has better performance than SQS, CRFD is better than DQS, CRFSperforms better than SQS, and CRFS is the best one of these four scheduling algorithms.
文摘现有的索引选择方法存在诸多局限性.首先,大多数方法考虑场景较为单一,不能针对特定数据模态选择合适的索引结构,进而无法有效应对海量多模态数据;其次,现有方法未考虑索引选择时索引构建的代价,无法有效应对动态的工作负载.针对上述问题,提出一种面向多模态数据的智能高效索引选择模型APE-X DQN(Distributed prioritized experience replay in deep Q-network),称为AP-IS(APE-X DQN for index selection).AP-IS设计了新型索引集编码和SQL语句编码方法,该方法使AP-IS在感知多模态数据的同时兼顾索引结构本身的特性,极大地降低了索引的存储代价.APIS集成新型索引效益评估方法,在优化强化学习奖励机制的同时,监控数据库工作负载的执行状态,保证动态工作负载下AP-IS在时间和空间上的优化效果.在真实多模态数据集上进行大量实验,验证了AP-IS在工作负载的延迟、存储代价和训练效率等方面的性能,结果均明显优于最新索引选择方法.
文摘目的为提高医院内骨质疏松性骨折(osteoporotic fracture,OF)患者诊疗质量和管理效率,本研究自主构建一种医院内自动抓取相关资料的“骨质疏松性骨折数据库”,数据库内置管理流程相关的智能化功能模块。在此基础上,分析该数据库在实际场景应用的结果和有效性。方法构建院内封闭式多源异构数据整合的专病数据库,数据库接口可后台对接医院的信息系统(hospital information system,HIS)、影像归档和通信系统(picture archiving and communication systems,PACS)、实验室信息系统(laboratory information system,LIS)等固有数据平台,并自动运用自然语言处理(natural language processing,NLP)技术识别及整合OF患者相关信息。运用该数据库纳入2022年6月至2024年6月苏州大学附属第二医院收治的50岁以上、4部位骨折(椎体、髋部、肱骨近端和桡骨远端)的12754例患者,并对患者信息进行智能化管理应用分析。结果该数据库可按照纳入条件自动获得12754例患者数据,并自动收集患者基本资料、病历或影像检查的骨折记录、检验检查结果、实时治疗方案等407个结构化字段信息。数据库可自动完成患者的骨质疏松相关数据识别(骨折部位、骨密度值、骨代谢相关指标、抗骨质疏松药使用)、院内转科及经治医生追踪、院内多次骨折记录检索。当患者确定纳入管理,数据库可实现本次骨折后2年档案构建、辅助宣教、智能随访、院内门诊电脑同屏显示等智能化管理功能。结论“骨质疏松性骨折数据库”拥有便捷的OF患者信息抓取功能,可实时了解相应管理的基础数据,可自动完成规定时间内设定管理的指导及提醒。该数据库有院内多源异构数据整合的专病数据库特点,为OF精准化、智能化、便捷化管理提供新的思路和有效工具。
文摘In order to rapidly and effectively meet the informative demand from commanding decision-making, it is important to build, maintain and mine the intelligence database. The type, structure and maintenance of military intelligence database are discussed. On this condition, a new data-mining arithmetic based on relation intelligence database is presented according to the preference information and the requirement of time limit given by the commander. Furthermore, a simple calculative example is presented to prove the arithmetic with better maneuverability. Lastly, the problem of how to process the intelligence data mined from the intelligence database is discussed.
