STAISTICAL ANALYSIS OF QUERY PROCESSING IN A DISTRIBUTED INFORMATION SYSTEM

被引:0
作者
Gulyaev, P. A. [1 ]
Kalinin, I. V. [1 ]
Muravyeva-Vitkovskaya, L. A. [1 ]
机构
[1] Univ ITMO, St Petersburg, Russia
来源
INFORMATICS, GEOINFORMATICS AND REMOTE SENSING CONFERENCE PROCEEDINGS, SGEM 2016, VOL I | 2016年
关键词
distributed information system; priority model; simulation modeling; page locking; row locking;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The scheduling model for a distributed information system is proposed to get the effective way of a query processing. The scheduling model uses internal queries to support a parallel computing, dynamic load balancing and data integrity. The data integrity insured by the two different locking strategies: the page locking or the row locking. We create the simulation model based by the University ITMO distributed system to solve two problems: 1. Estimate the expediency of using the page locking or the row locking. 2. Estimate the influence of the page size at the distributed information system productivity when the system using the page or the row locking. The evaluation of the productivity is the quantity of queries that the distributed information system lost. The simulation model was launched with the different query intensity, the different mean sizes of requested data ("big" and "small" queries) and the different pages (data blocks) sizes. The obtained results can be used by database administrators for choose locking strategy with optimal page size for their own distributed information system.
引用
收藏
页码:397 / 404
页数:8
相关论文
共 3 条
[1]  
Kirillov V., 2009, INTRO RELATIONAL DAT, P189
[2]  
Kopetz H., 1993, REAL TIME DEPENDABIL, P411
[3]  
Tanenbaum A. S, 2007, DISTRIBUTED SYSTEMS, P322