864 JOURNAL OF SOFTWARE, VOL. 6, NO. 5, MAY 2011 Fig.10. Comparison <strong>of</strong> Comprehensive performance VI. CONCLUSIONS A new approach is introduced in this paper, which can be used to decrease the time cost for frequently used queries, including cube queries. The core <strong>of</strong> the approach is BBI which is an integrative index, inheriting the advantage <strong>of</strong> bitmap index, b-tree index and inverted index. Inverted index represented by bitmap is adopted to get result quickly by intersection operations. Meanwhile, tree structure is used to accelerate speed for range queries. BBI can be built on both high-cardinality and lowcardinality columns and it is suitable to all data types. BBI established on different columns can cooperate with each other to promote the efficiency. Combining with aggregation which is based on user-driven, the approach can promote the efficiency for <strong>of</strong> cube queries as well. It does not only greatly promote the efficiency <strong>of</strong> frequently used queries, but also improve the performance <strong>of</strong> other queries. This paper discusses the space and time complexity <strong>of</strong> BBI, and the experiment results show good performance on space and time <strong>of</strong> this approach. Future work is planned to be focused on live update strategy. ACKNOWLEDGMENT This work was supported by the National Natural Science Foundation <strong>of</strong> China under Grant NO. 70871033 and the National High-Tech Research and Development Plan <strong>of</strong> China under Grant NO. 2007AA04Z116. REFERENCES [1] Joshi.S, Jermaine.C, “Materialized Sample Views for Database,” [J] IEEE Transactions on Knowledge and Data Engineering, Volume 20, Issue 3, pp: 337 – 351, March 2008 [2] Guangrong.Li, Xiaohua.Hu and etc, “A Novel Unsupervised Feature Selection Method for Bioinformatics Data Sets through Feature Clustering” Proc. Granular Computing, 2008. IEEE International Conference on 26-28 Aug. 2008(GrC 2008.), pp: 41 - 47 [3] Dimension-Join: A New Index for Data Warehouses http://www4.wiwiss.fu-berlin.de/dblp/resource/record/ conf/sbbd/BizarroM01 [4] M.E Morita, R. Sabourin, F. Bortolozzi, and C.Y. Suen, “Unsupervised Feature Selection Using Multi-Objective Genetic Algorithm for Handwritten Word Recognition”, in the 7th International Conference on Document Analysis and Recognition, Edinburgh, Scotland, 2003, pp.666-670. © 2011 ACADEMY PUBLISHER [5] Gibas.M, Canahuate.G, Ferhatosmanoglu.H, “On row Index Recommendations for High-Dimensional Databases Using Query Workloads” IEEE Transactions on Knowledge and Data Engineering, Volume 20, Issue 2, Feb. 2008 Page(s):246 - 260 [6] P·O’Neil, D·Quass. Improved query performance with variant indexes [EB/OL]. http://www.cs.duke.edu/~ junyang /courses/cps216-2003-spring/papers/oneil-quass- 1997.pdf,1997-05. [7] Jingren.Zho, Larson.P.A, Goldstein.J, Luping.Ding, “Dynamic Materialized Views”, Data Engineering, 2007. ICDE 2007. IEEE 23rd International Conference on 15-20 April 2007 Page(s):526 - 535 [8] Yin.GS ,Yu.X, Lin.LD, ” Strategy <strong>of</strong> Selecting Materialized Views Based on Cache updating”, IEEE International Conference on Integration Technology Shenzhen, CHINA, MAR 20-24, 2007 pp:789-792 [9] Jeffrey.Xu.Yu, Xin.Yao, ChiHon.Choi, Gang.Gou. “Materialized View Selection as Constrained Evolutionary Optimization”, IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, Volume 33, Issue 4, Nov. 2003 Page(s):458 - 467 [10] H. Gupta and I. S. Mumick, “Selection <strong>of</strong> views to materialize under a maintenance cost constraint,” in Proc. 7th Int. Conf. Database Theory,1999, pp. 453–470. [11] A. Shukla, P. Deshpande, and J. F. Naughton, Materialized view selection for multidimensional datasets,in Proc. 24th Int. Conf. Very Large Data Bases, 1998, pp. 488–499. [12] Byeong-Seob You, Dong-Wook Lee, et al. Hybrid Index for Spatio-temporal OLAP Operations[A] //International Conference on Advances in Information Systems(ADVIS 2006). Germany:Springer,2006:110-118. [13] Wen Juan, Xue Yongshen, et al. An Efficient Method for Multi-Table Joining in Data Warehouse[J]. <strong>Journal</strong> <strong>of</strong> Computer Research and Development, 2005, 44(11): 2010~2017(in Chinese). [14] M. Frank, E. Omiecinski, and S. Navathe, “Adaptive and Automated Index Selection in RDBMS,” Proc. Third Int’l Conf. Extending Database Technology (EDBT ’92), 1992. [15] S. Choenni, H. Blanken, and T. Chang, “On the Selection <strong>of</strong> Secondary Indexes in Relational Databases,” Data and Knowledge Eng., 1993. [16] A. Capara, M. Fischetti, and D. Maio, “Exact and Approximate Algorithms for the Index Selection Problem in Physical Database Design”, Knowledge and Data Engineering, IEEE Transactions on Volume 7, Issue 6, Dec. 1995 Page(s):955 - 967 [17] Xiaolei Li, Jiawei Han, Hector Gonzalez.Highdimensional OLAP:a minimal cubing approach[A]. NASCIMENTO M A,OZSU M T,KOSSMANN D,et al. International Conference on Very Large Data Bases(VLDB 2004).San Fransisco:Morgan Kaufmann,2004:528-539. [18] Yan.Jun; Liu, Ning; Yan, Shuicheng; Yang, Qiang; Chen, Zheng;, “Synthesizing Novel Dimension Reduction Algorithms in Matrix Trace Oriented Optimization Framework”, Data Mining, 2009. ICDM '09. Ninth IEEE International Conference on 6-9 Dec. 2009 Page(s):598 - 606 [19] Smalter.A, Huan.Jun, Lushington.G, “Feature Selection in the Tensor Product Feature Space”, in the ICDM '09. 2009 Page(s):1004-1009.
JOURNAL OF SOFTWARE, VOL. 6, NO. 5, MAY 2011 865 Zhiwei Ni (Tongcheng City, Anhui Province,1963), Pr<strong>of</strong>essor, Doctoral supervisor. He received his master degree from the Department <strong>of</strong> Computer Science and Engineering, Anhui University, Hefei, China, 1991 and a PhD degree from the Department <strong>of</strong> Computer Science and Technology, Hefei, China, in 2002, all in computer science. He is currently a full Pr<strong>of</strong>essor in the School <strong>of</strong> Management and also the Director for the Institute <strong>of</strong> Intelligent Management in Hefei University <strong>of</strong> Technology, Hefei, China. His major research interests include Artificial Intelligence, Machine Learning, Intelligent Management and Intelligent Decision Technique. Junfeng Guo (Hefei City, Anhui Province, 1983), graduate student. He focuses on the research <strong>of</strong> business intelligence, data warehouse and OLAP (online analytical processing). Li Wang (Fuyang City, Anhui Province, 1982), PhD student. His research field includes business intelligence, data mining and cloud computing. Yazhuo Gao (Zibo City, Shandong Province, 1984), PhD student. Her research field includes business intelligence, data mining and OLAP. © 2011 ACADEMY PUBLISHER
- Page 1 and 2:
Journal of Software ISSN 1796-217X
- Page 3 and 4:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 5 and 6:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 7 and 8:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 9 and 10:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 11 and 12:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 13 and 14:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 15 and 16:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 17 and 18:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 19 and 20:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 21 and 22:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 23 and 24:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 25 and 26:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 27 and 28:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 29 and 30:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 31 and 32:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 33 and 34:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 35 and 36:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 37 and 38:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 39 and 40:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 41 and 42:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 43 and 44:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 45 and 46:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 47 and 48:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 49 and 50:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 51 and 52:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 53 and 54:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 55 and 56:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 57 and 58:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 59 and 60:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 61 and 62:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 63 and 64:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 65 and 66:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 67 and 68:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 69 and 70: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 71 and 72: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 73 and 74: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 82 and 83: 826 JOURNAL OF SOFTWARE, VOL. 6, NO
- Page 84 and 85: 828 JOURNAL OF SOFTWARE, VOL. 6, NO
- Page 86 and 87: 830 JOURNAL OF SOFTWARE, VOL. 6, NO
- Page 88 and 89: 832 JOURNAL OF SOFTWARE, VOL. 6, NO
- Page 90 and 91: 834 JOURNAL OF SOFTWARE, VOL. 6, NO
- Page 92 and 93: 836 JOURNAL OF SOFTWARE, VOL. 6, NO
- Page 94 and 95: 838 JOURNAL OF SOFTWARE, VOL. 6, NO
- Page 97 and 98: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 99 and 100: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 101 and 102: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 103 and 104: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 105 and 106: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 107 and 108: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 109 and 110: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 111 and 112: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 113 and 114: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 115 and 116: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 117 and 118: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 119: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 123 and 124: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 125 and 126: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 127 and 128: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 129 and 130: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 131 and 132: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 133 and 134: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 135 and 136: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 137 and 138: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 139 and 140: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 141 and 142: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 143 and 144: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 145 and 146: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 147 and 148: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 149 and 150: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 151 and 152: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 153 and 154: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 155 and 156: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 157 and 158: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 159 and 160: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 161 and 162: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 163 and 164: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 165 and 166: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 167 and 168: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 169 and 170: JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 171 and 172:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 173 and 174:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 175 and 176:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 177 and 178:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 179 and 180:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 181 and 182:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 183 and 184:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 185 and 186:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 187 and 188:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 189 and 190:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 191 and 192:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 193 and 194:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 195 and 196:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 197 and 198:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 199 and 200:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 201 and 202:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 203 and 204:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 205 and 206:
JOURNAL OF SOFTWARE, VOL. 6, NO. 5,
- Page 207 and 208:
Aims and Scope. Call for Papers and