|
羅敏 研究業績一覧 (10件)
- 2024
- 2023
- 2022
- 2021
- 2020
- 全件表示
論文
国際会議発表 (査読有り)
-
Min Luo,
Nam Dang,
Haruo Yokota.
A Fragmented Data-declustering Strategy for High Skew Tolerance and Efficient Failure Recovery,
International Database Engineering and Applications Symposium (IDEAS 2014),
Proc. of IDEAS 2014,
pp. 227-236,
July 2014.
-
Min LUO,
Akitsugu WATANABE,
Haruo YOKOTA.
Compound Treatment of Chained Declustered Replicas Using a Parallel Btree for High Scalability and Availability,
Database and Expert Systems Applications, 21th International Conference, DEXA 2010,,
Database and Expert Systems Applications, Springer LNCS.,
Springer,
vol. 6262/2010,
pp. 49-63,
Aug. 2010.
公式リンク
-
Min LUO,
Haruo YOKOTA.
Comparing Hadoop and Fat-Btree based access method for Small File I/O Applications,
the 11th International Conference on Web-Age Information Management,
Web-Age Infromation Management, Springer LNCS,
Springer,
6184/2010,
182-193,
July 2010.
公式リンク
国内会議発表 (査読なし・不明)
-
近藤直樹,
羅敏,
渡辺陽介,
横田治夫.
複数分散インデックス手法の実装・比較のための共通フレームワークの実現,
DEIM Forum 2012 C2-2,
Mar. 2012.
-
Min LUO,
Takeshi Mishima,
Haruo YOKOTA.
Evaluation of Multiple Fat-Btrees on a Parallel Database,
The 4th Forum on Data Engineering and Information Management,
Mar. 2012.
-
近藤直樹,
羅敏,
渡辺陽介,
横田治夫.
Fat-Btree, P-tree, SkipGraphを用いた範囲問合せ性能の比較実験,
第152回 データベースシステム・第103回 情報基礎とアクセス技術 合同研究発表会,
Aug. 2011.
-
Min Luo,
Haruo Yokota.
An Evaluation on Dynamic Access-Skew Balancing Performance of Compound Parallel Btree for Chained Declustering Parallel Systems,
The 3rd Forum on Data Engineering and Information Management,
Mar. 2011.
公式リンク
-
Min Luo,
Haruo Yokota.
An evaluation of Fat-Btree based and HDFS based Storage Systems for Small File I/O Applications,
The 73rd National Convention of IPSJ,
Mar. 2011.
公式リンク
-
近藤直樹,
羅敏,
渡辺陽介,
横田治夫.
範囲問合せ可能な分散インデックスの性能評価,
DEIM Forum 2011 E2-2,
Mar. 2011.
[ BibTeX 形式で保存 ]
[ 論文・著書をCSV形式で保存
]
[ 特許をCSV形式で保存
]
|