Technical note - On optimization approach for multidisk vertical allocation problems

doi:10.1016/j.ejor.2004.03.010

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Tsai, JF	en_US
dc.contributor.author	Li, HL	en_US
dc.date.accessioned	2014-12-08T15:18:23Z	-
dc.date.available	2014-12-08T15:18:23Z	-
dc.date.issued	2005-09-16	en_US
dc.identifier.issn	0377-2217	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/j.ejor.2004.03.010	en_US
dc.identifier.uri	http://hdl.handle.net/11536/13264	-
dc.description.abstract	Multidisk vertical allocation (MDVA) problems intend to find an allocation of relations to disks such that the expected query cost is minimized. Recently, Chang [European Journal of Operational Research 143 (2002) 210] modified Rotem et al.'s [IEEE Transactions on Knowledge and Data Engineering 5 (1993) 882] method for solving an MDVA problem using a smaller number of binary variables. Chang's method however is unable to treat MDVA problems with possible replication of relations. This paper proposes another method to solve MDVA problems, which is more effective than Rotem et al.'s and is able to treat replication problems insolvable by Chang's method. (c) 2004 Elsevier B.V. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	data allocation	en_US
dc.subject	linearization	en_US
dc.subject	global optimization	en_US
dc.title	Technical note - On optimization approach for multidisk vertical allocation problems	en_US
dc.type	Editorial Material	en_US
dc.identifier.doi	10.1016/j.ejor.2004.03.010	en_US
dc.identifier.journal	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH	en_US
dc.citation.volume	165	en_US
dc.citation.issue	3	en_US
dc.citation.spage	835	en_US
dc.citation.epage	842	en_US
dc.contributor.department	資訊管理與財務金融系註：原資管所+財金所	zh_TW
dc.contributor.department	Department of Information Management and Finance	en_US
dc.identifier.wosnumber	WOS:000228123800021	-
dc.citation.woscount	2	-
顯示於類別：	期刊論文

文件中的檔案：

000228123800021.pdf

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。