Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- articleApril 2017
Portfolio Rebalancing with a Consideration of Market Conditions Changes Using Instance-Based Policy Optimization
Electronics and Communications in Japan (WECJ), Volume 100, Issue 4Pages 66–75https://doi.org/10.1002/ecj.11950The portfolio optimization problem involves decisions pertaining to the investment target and proportion of investment in a large number of assets in order to minimize risk and maximize returns. In recent years, metaheuristics methods have been actively ...
- ArticleSeptember 2012
A Heterogeneity-aware Data Distribution and Rebalance Method in Hadoop Cluster
CHINAGRID '12: Proceedings of the 2012 Seventh ChinaGrid Annual ConferencePages 176–181https://doi.org/10.1109/ChinaGrid.2012.22The current Hadoop implementation assumes that computing nodes in a cluster are homogeneous. Due to the fact that the input data are split into data blocks with a predefined block size, Hadoop suffers performance degradation during Map phase in ...
- articleNovember 2007
An adaptive packed-memory array
ACM Transactions on Database Systems (TODS), Volume 32, Issue 4Pages 26–eshttps://doi.org/10.1145/1292609.1292616The packed-memory array (PMA) is a data structure that maintains a dynamic set of N elements in sorted order in a Θ(N)-sized array. The idea is to intersperse Θ(N) empty spaces or gaps among the elements so that only a small number of elements need to ...
- ArticleJune 2006
Cache-oblivious string B-trees
PODS '06: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsPages 233–242https://doi.org/10.1145/1142351.1142385B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally
- when keys are long or of variable length,
- when keys are compressed, even when using front compression, the standard B-tree compression ...
- ArticleJune 2006
An adaptive packed-memory array
PODS '06: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsPages 20–29https://doi.org/10.1145/1142351.1142355The packed-memory array (PMA) is a data structure that maintains a dynamic set of N elements in sorted order in a Θ(N)-sized array. The idea is to intersperse Θ(N) empty spaces or gaps among the elements so that only a small number of elements need to ...
