Database replication method based on the task of (0,1)-knapsack

Please use this identifier to cite or link to this item: http://repository.hneu.edu.ua/handle/123456789/23351

Full metadata record

DC Field	Value	Language
dc.contributor.author	Holubnychyi D.	-
dc.contributor.author	Tretiak V.	-
dc.date.accessioned	2020-07-10T09:58:15Z	-
dc.date.available	2020-07-10T09:58:15Z	-
dc.date.issued	2020	-
dc.identifier.citation	Holubnychyi D. Database replication method based on the task of (0,1)-knapsack / D. Holubnychyi, V. Tretiak // Modern Problems Of Computer Science And IT-Education : collective monograph / [editorial board K. Melnyk, O. Shmatko]. – Vienna : Premier Publishing s.r.o., 2020. – Pp. 142–156. DOI: http://doi.org/10.29013/MelnikK.ShmatkoO.MPCSIE.2020.352	ru_RU
dc.identifier.uri	http://repository.hneu.edu.ua/handle/123456789/23351	-
dc.description.abstract	Is proposed a parallel computation method based on the ranking approach to its solution the principle of ptimization in the direction and strategies for cutting out unpromising decisions for fragmentation of network database data.	ru_RU
dc.language.iso	en	ru_RU
dc.subject	fragmentation method	ru_RU
dc.subject	organization	ru_RU
dc.subject	replication	ru_RU
dc.subject	integer linear programming	ru_RU
dc.title	Database replication method based on the task of (0,1)-knapsack	ru_RU
dc.type	Book chapter	ru_RU
Appears in Collections:	Монографії (ІС)

Files in This Item:

File	Description	Size	Format
Holubnychyi_Monograph__Ch.III.pdf		3,5 MB	Adobe PDF	View/Open