Optimization Method of Concurrency Scheduling of Graphical Database Transaction
- 10.2991/iccset-14.2015.5How to use a DOI?
- concurrent scheduling; artificial fish swarm algorithm; database transaction
The transaction scheduling problem of graphic database is researched. The reasonable arrangement of the database transaction commit is taken in order, and the fitting first heuristic algorithm and artificial fish swarm algorithm are combined. The graphic database transaction scheduling problem in the massive database is calculated. The foraging and clustering mathematical models are constructed in the artificial fish swarm, the constraint conflict drawbacks aresolved. The optimal scheduling is obtained. The experimental results show that the scheduling problem of hybrid artificial fish swarm algorithm is solved, and the performance of massive database transaction scheduling is improved, the database transaction scheduling is quick and effective. The serializable processing of database transaction is ensured.
- © 2015, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Lin Nan AU - Dongming Li AU - Yongqi Han PY - 2015/01 DA - 2015/01 TI - Optimization Method of Concurrency Scheduling of Graphical Database Transaction BT - Proceedings of the 2014 International Conference on Computer Science and Electronic Technology PB - Atlantis Press SP - 22 EP - 26 SN - 2352-538X UR - https://doi.org/10.2991/iccset-14.2015.5 DO - 10.2991/iccset-14.2015.5 ID - Nan2015/01 ER -