.png){kind=icon}
Return
Technical note - On optimization approach for multidisk vertical allocation problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2004.03.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
data allocation
linearization
global optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave