Index data distribution is an important approach that provides parallelism and can improve the usability of a distributed parallel database. tree is a storage structure, which perfectly fits for distributed and parallel indexing, and the distributed tree is adopted to index the massive and rapidly increasing data available in a distributed network. This paper proposes an index data distribution strategy using distributed parallel tree in a distributed network environment. In our proposal, the basic data distribution strategy can improve the efficiency of a query by utilizing a data fragment method based on the scope of value, and the replica distribution can be adjusted dynamically, according to the number of system access. The performance evaluation and experiment results show that this index data distribution strategy can improve the query’s efficiency and load balance.
M.K.Aguilera, W.Golab and M.A.Shah, A practical scalable distributed B-tree, Proceedings of the VLDB Endowment1(1) (2008), 598–609.
2.
M.H.Ali, The PN-tree: A parallel and distributed multidimensional index, Distributed and Parallel Databases17 (2005), 111–133.
3.
C.D.Barrancoa, J.R.Campanab and J.M.Medinab, A -tree based indexing technique for fuzzy numerical data, Fuzzy Sets and Systems159 (2008), 1431–1449.
4.
F.Chang, J.Dean, S.Ghemawat, W.C.Hsieh, D.A.Wallach, M.Burrows, T.Chandra, A.Fikes and R.E.Gruber, Bigtable: A distributed storage system for structured data, ACM Transactions on Computer Systems26(2) (2008), 205–218.
5.
H.G.Cheng, H.Lu, B.C.Ooi and T.L.Tan, Indexing temporal data using existing -trees, Data & Knowledge Engineering18 (1996), 147–165.
6.
G.DeCandia, D.Hastorun, M.Jampani, G.Lakshman, A.Pilchin, S.Sivasubramanian, P.Vosshall and W.Vogels, Dynamo: Amazon’s highly available key-value store, in: Proceedings of the 21st ACM SIGOPS Symposium on Operating Systems Principles, Stevenson, USA, 2007, pp. 205–220.
7.
J.Ding, H.Han and A.Zhou, A data placement strategy for data-intensive cloud storage, Advanced Materials Research354–355 (2012), 896–900.
8.
S.Dolev and R.Kat, Self-stabilizing distributed file system, Journal of High Speed Networks14(2) (2005), 135–153.
9.
W.Guo, K.Luo, X.Wang and L.Cui, The design and evaluation of a strategy of data placement in cloud computing platform, International Journal on Smart Sensing and Intelligent Systems7(1) (2014), 13–30.
10.
H.He, H.Wang, J.Yanget al., BLINKS: Ranked keyword searches on graphs, in: Proceeding of ACM SIGMOD, 2007, pp. 305–316.
11.
B.Huang and Y.Peng, An efficient distributed B-tree index method in cloud computing, The Open Cybernetic & Systemics Journal8 (2014), 302–308.
12.
Y.Huang, Y.Zhang, X.Ji, Z.Wang and S.Wang, A data distribution strategy for scalable main-memory database, in: Proceeding of Advances in Web and Network Technologies, and Information Management, Suzhou, China, 2009, pp. 13–24.
13.
H.V.Jagadish, On indexing line segments, in: Proceedings of the International Conference on Very Large Databases (VLDB), 1990, pp. 614–625.
14.
G.Li, B.C.Ooiet al., EASE: An effective 3-in-1 keyword search method for unstructured, semi-structured and structured data, in: Proceeding of ACM SIGMOD, 2008, pp. 903–914.
15.
J.Li, Q.Wang, C.Wang, N.Cao, K.Ren and W.Lou, Fuzzy keyword search over encrypted data in cloud computing, in: Proceeding of the 29th IEEE International Conference on Computer Communications (INFOCOM 2010), San Diego, USA, 2010, pp. 441–445.
16.
J.Li, F.Zhang and Y.Wang, A new hierarchical ID-based cryptosystem and CCA-secure PKE, in: Emerging Directions in Embedded and Ubiquitous Computing, Seoul, Korea, 2006, pp. 362–371.
17.
X.Li, Research of data allocation strategy in distributed database, Master thesis, Dalian University of Technology, 2009.
18.
X.Liu and Z.Peng, On-line dynamic index update scheme based on self-learning of allocated space, Journal of Computer Research and Development49(10) (2012), 2118–2130.
19.
A.Markowetz, Y.Yang and D.Papadias, Reachability indexes for relational keyword search, in: Proceeding of International Conference on Data Engineering, 2009, pp. 1163–1166.
20.
F.Palmieri, An MPLS-based architecture for scalable QoS and traffic engineering in converged multiservice mobile IP networks, Computer Networks47(2) (2005), 257–269.
21.
F.Palmieri, Scalable service discovery in ubiquitous and pervasive computing architectures: A percolation-driven approach, Future Generation Computer Systems29(3) (2013), 693–703.
22.
F.Palmieri, U.Fiore and A.Castiglione, Automatic security assessment for next generation wireless mobile networks, Mobile Information Systems7(3) (2011), 217–239.
23.
C.Tang, J.Gao and T.Wang, Distributed tree index system and building method, Patent CN101576915, Nov. 11, 2009.
24.
J.Tang, X.Bai and F.Yang, DPB+: A new distributed and paralleling index tree, Computer Science32(12) (2005), 75–78.
25.
M.Tao, S.Dong and K.He, A new replication scheduling strategy for grid workflow applications, in: The 6th ChinaGrid Annual Conference (ChinaGrid 2011), Dalian, China, 2011, pp. 74–80.
26.
M.Tao, S.Dong and L.Zhang, A multi-strategy collaborative prediction model for the runtime of online tasks in computing cluster/grid, Cluster Computing14(2) (2011), 199–210.
27.
A.Vizziello and L.Favalli, Smart social architecture for green distributed networks, Journal of High Speed Networks19(3) (2013), 227–250.
28.
S.Wu, D.Jiang, B.C.Ooi and K.-L.Wu, Efficient based indexing for cloud data processing, Proceedings of the VLDB Endowment3(1) (2010), 1207–1218.
29.
M.Zhong and M.Liu, Efficient keyword proximity search using a frontier-reduce strategy based on d-distance graph index, in: Proceeding of International Database Engineering and Applications Symposium, 2009, pp. 206–216.
30.
M.Zhou, Y.Cuan, D.Yuan and Y.Wen, A partition clustering algorithm for transaction database based on FCM, Lecture Notes in Computer Science8933 (2014), 655–666.
31.
W.Zhou, J.Lu and Z.Luan, SNB-index: A SkipNet and tree based auxiliary cloud index, Cluster Computing17 (2014), 453–462.
