1 |
IBM Blue Cloud Solution.
|
2 |
Sun Cloud Architecture Introduction White Paper.
|
3 |
Barroso LA , Dean J , Holzle U . Web search for a planet:the Google cluster architecture. IEEE Micro, 2003, 23(2): 22~28
|
4 |
International Telegraph Union(ITU).
|
5 |
Organization for the Advancement of Structured Information Standards(OASIS).
|
6 |
冯登国, 张敏, 张妍 等. 云计算安全研究. 软件学报, 2011, 22(1): 71~83
|
7 |
郑湃, 崔立真, 王海洋 等. 云计算环境下面向数据密集型应用的数据布局策略与方法. 计算机学报, 2010, 33(8): 1472~1480
|
8 |
Oinn T , Addis M , Ferris J , et al. Taverna:a tool for the composition and enactment of bioinformatics workf1ows. Bioinformatics, 2004, 20>(17): 3045~3054.
|
9 |
A1tintas I , Berkley C , Jaeger E , et al. Kepler:an extensible system for design and execution of scientific workflows. Proceedings of the 16th International Conference on Scientific and Statistical Database Management, Santorini Island,Greece 2004: 423~424.
|
10 |
Biton O , Boulakia S C , Davidson S B , et al. Querying and managing provenance through user views in scientific workflows. Proceedings of the 24th International Conference on Data Engineering, Cancun, Mexico 2008: 1072~1081.
|
11 |
Biton O , Davidson S B , Khanna S , et al. Optimizing user views for workflows. Proceedings of the 12th International Conference on Database Theory, St, Petersburg, Russia 2009: 310~323.
|
12 |
Cohen S , Boulakia S C , Davidson S B . Towards a model of provenance and user views in scientific workf1ows, Proceedings of Lecture Notes in Computer Science Data Integration in the Life Sciences, Hinxton, UK 2006: 264~279.
|
13 |
Shao Q , Chen Y , Tao S , et al. Easy Ticket:a ticket routing recommendation engine for enterprise problem resolution. Proceedings of the VLDB Endowment, Auckland 2008: 1436~1439.
|
14 |
Shao Q , Chen Y , Tao S , et al. Efficient ticket routing by resolution sequence mining. Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas 2008: 605~613.
|
15 |
Shao Q , Sun P , Chen Y . Efficiently discovering critical workflows in scientific exp.lorations. Future Generation Computer System, 2009,25(5): 577~585.
|
16 |
Sun P , Liu Z Y , Susan D , et al. Detecting and resolving unsound workflow views for correct provenance analysis. Proceedings of the ACM SIGMOD International Conference on Management of Data, Rhode Island 2009: 549~562.
|
17 |
邹兆年, 李建中, 高宏 等. 从不确定图中挖掘频繁子图模式. 软件学报, 2009, 20(11): 2965~2976.
|
18 |
Chui C K , Kao B , Hung E . Mining frequent itemsets from uncertain data. Proceedings of the 11th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, Nanjing 2007: 47~58.
|
19 |
Zhou S G , Yu Z C , Jiang H L . Concepts, issues, and advances of searching in graph structured data. Communication, 2007,3(8): 59~65.
|
20 |
Shasha D , Wang T L , Guigno R . Algorithmic and applications of tee and graph searching. Proceedings of the 21st ACM SIGMOD-SIGART Symposium on Principles of Database Systems, Madison 2002: 39~52.
|
21 |
Yan X , Yu P S , Han J . Graph indexing:a frequent structure based approach. Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, Paris 2001: 335~346.
|
22 |
Hintsanen P , Toivonen H . Finding reliab1e subgraphs from large probabilistic graphs. Data Mining and Knowledge Discovery, 2008,17(1): 3~23.
|
23 |
Cheng J , Yu J , Lin X . Fast computing reachability labelings for large graphs with high compression rate. Proceedings of 11th International Conference on Extending Database Technology, Nantes 2008: 193~204.
|
24 |
Jin R , Hong H , Wang HX , et al. Computinglabel-constraint reachability in graph databases. Proceedings of the ACM SIGMOD International Conference on Management of Data, Indianapolis,Indiana 2010: 123~134.
|