Proceedings of the Fifth International Conference on Electronics, Communication and Aerospace Technology (ICECA 2021)
IEEE Xplore Part Number: CFP21J88-ART; ISBN: 978-1-6654-3524-6
Distributed Multi-Dimensional Data Index Strategy in
Cloud Computing Environment
Dawei Gui*, Guoqi He
School of Information and Intelligent Technology, Shaanxi radio and Television University, Xian Shaanxi 710119, China
guidaweisxrtu@sohu.com
Abstract—The widespread application of cloud computing
2021 5th International Conference on Electronics, Communication and Aerospace Technology (ICECA) | 978-1-6654-3524-6/21/$31.00 ©2021 IEEE | DOI: 10.1109/ICECA52323.2021.9675845
technology makes data show an explosive growth trend, and
poses new challenges to traditional data management technology.
Existing cloud storage systems generally use distributed hash
tables to access data. This key-value-based model can achieve
higher access efficiency in single-dimensional queries, but it does
not support multi-dimensional queries. Therefore, in recent
years, cloud storage auxiliary indexing has become a hot topic in
academic research, and related results have been published in top
international conferences and top journals in the field of
database. This paper studies the distributed multi -dimensional
data index strategy under the cloud computing environment. The
work of the thesis is carried out from two aspects: multi-
dimensional data index in cloud storage and distributed
computing.
Keywords—Distributed Computing, Multidimensional Data
Index, Cloud Computing, Big Data
I. INT RODUCT ION
Multidimensional data index has always been an important
research problem in the field of data management. With the
arrival of the big data era, traditional relational data
management systems are gradually unable to meet the needs
of practical applications in terms of efficiency and scalability.
Large-scale distributed cloud storage systems have become a
new carrier of big data. Ho w to improve the performance of
mu lti-dimensional data query in the cloud computing
environment is one of the core issues in the cloud computing
field [1-5].
With the rapid develop ment of Internet technology, the
data generated in the fields of science, engineering, and
business computing has shown an explosive growth trend.
IDC statistical report shows that the total amount of global
data in 2009 was about 0.8ZB, and by 2010, the total amoun t
of data had reached 1.2ZB. In just one year, the amount of
data almost doubled. However, the rate of data growth is still
accelerating. It is estimated that by 2020, the statistical value
of this data will reach 35ZB, which is 44 times the amount of
data in 2009. The rapid growth of data poses severe challenges
to the storage and computing capabilit ies of existing IT
architectures in all walks of life. By continuously increasing
system hardware investment to imp rove system scalability, the
business departments have been overwhelmed. Once the
concept of cloud co mputing was put forward, it has received
extensive attention from industry and academia [6-11].
Cloud computing comb ines the advantages of distributed
processing, parallel processing and grid computing, and is
developed on this basis. It can be said that it is the commercial
realization of these computer science concepts, and it is a
978-1-6654-3524-6/21/$31.00 ©2021 IEEE
Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on December 24,2022 at 13:31:58 UTC from IEEE Xplore. Restrictions apply.
convenient way of using and service model. Major Internet
companies and scientific research institutions have invested
huge human and financial resources to develop their related
technologies and research reasonable applications, such as
Google’s Mapreduce technology, IBM’s Blue Cloud project,
and the Azure platform provided by Microsofe. At present,
major Internet service platforms at ho me and abroad have
widely used cloud computing and big data technology and
have achieved good results. Most of the text and picture data
in the do mestic Weibo social p latform and shopping trade
platform are stored on the cloud platform. The hotspot
informat ion in a fixed time period of the Internet platform can
be summarized by the user's visits and the click-through rate
of the event during the time period. The shopping platform can
lock the type of products that the user needs to buy in th e
recent period according to the user's browsing information and
analyze the reco mmendation system Reco mmend
corresponding products to users accurately. According to the
results of big data analysis, government departments can keep
abreast of social trends and make correct guidance. It can be
seen that the results of big data analysis are very important for
the corresponding decision-making of enterprises and
institutions, and this series of technological advances poses
severe challenges to the index manage ment of cloud data [12-
16].
The rapid progress of Internet technology and the increase
in the frequency of use of GIS technology in people's lives
have produced a large amount of spatial data. However, the
requirements for efficient management of these spatial data
are constantly updated with the development of time. In the
cloud computing environ ment, if the reasonable storage and
efficient indexing of spatial data can be realized, it will make
users more convenient and convenient to use spatial data,
make the application of spatial data more suitable for reality,
and have a wider range of applications. Develop greater value
and guide people’s daily behaviors, wh ich can contribute to
the development of the real society [17-20].
As the most basic infrastructure in cloud co mputing, data
storage systems play a very important role in cloud co mputing.
Through cluster technology, distributed computing,
virtualizat ion and other technologies, a large number of cheap
and different types of storage media are managed by the cloud
storage system to form a storage resource pool to provide
users with services. In the cloud storage model, data storage
and management have beco me mo re centralized and
decentralized. Centralization means that data is stored in the
cloud in a unified manner for users, and users can obtain data
as long as they request, without paying attention to where the
data comes from and how to manage it. The cloud storage
931
 Proceedings of the Fifth International Conference on Electronics, Communication and Aerospace Technology (ICECA 2021)
IEEE Xplore Part Number: CFP21J88-ART; ISBN: 978-1-6654-3524-6
system provides users with a convenient and efficient user
experience. Decentralizat ion is for cloud data centers. Un like
traditional centralized data storage, the cloud storage system
uses a large-scale distributed data storage solution, and the
data is stored in a large number of different data nodes. This
storage architecture has obvious advantages, mainly reflected
in the fo llowing three aspects: High scalability. The cloud
storage system adopts a parallel expansion method. The newly
purchased data server only needs to install the operating
system and cloud storage software. After a simple
configuration, it can be added to the storage pool to achieve
capacity expansion [21-24].
II. T HE PROPOSED MET HODOLOGY
A. Distributed Computing
Most of the current spatio-temporal indexes are serial
spatio-temporal indexes in a centralized environment, and
most of the spatio-temporal data indexes evolved from spatial
indexes, especially so me based on the evolved spatio-temporal
data indexes. In theory, high-dimensional and its variants can
be used as high-dimensional spatiotemporal indexes. They use
the smallest space-time bounding rectangle to cluster space-
time objects into a hierarchical tree structure. This constraint
boundary may not represent the entire data range, and may
partially overlap. The overlap problem is one of the
bottlenecks of the indexing method based on data partition,
because even a simp le point query may need to check mult iple
query paths. Especially when they are used for current relat ive
time data and mobile data, obvious node overlap problems and
dead space problems will seriously affect index performance.
Fig. 1. Distributed Computing
In order to solve these problems, many spatio-temporal
indexing methods have appeared in the past ten years. From
the perspective of data structure, it mainly includes: based on
extended spatio-temporal indexes, such as B-tree, STCB-tree,
etc.; this type of spatio-temporal index mainly adopts
transformation to achieve indexing of spatio-temporal data
after data fractal dimension and data transformation
processing; Extended spatiotemporal indexes based on R-tree,
such as PTR-tree and RTR-tree, indoor moving object index
based on DR-tree, etc.; this kind of time index is extended to
R-tree, and the s mallest spatiotemporal boundary rectangle is
used to represent spatiotemporal objects, generally through
Additional time parameters and speed parameters to improve
the continuous update performance, or through multip le tree
combinations to achieve spatio-temporal data index; spatio-
temporal index based on other data structures such as Grid,
List, etc., such as the global discrete grid index based on linear
quadtree, based on Phase point analysis of mov ing data index
boundary constraint non-intersecting spherical entity object
978-1-6654-3524-6/21/$31.00 ©2021 IEEE
Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on December 24,2022 at 13:31:58 UTC from IEEE Xplore. Restrictions apply.
mu lti-dimensional unified index; this kind of spatio-temporal
index method is mostly extended to tree index. Thus, fro m the
perspective of data structure, tree structure is the mainstream
data structure of spatio-temporal index.
1n1  n2vs
v  1  P  1  vs  (1)
n1  n2
ai  zi  ( zi1  2kd 1) (2)
B. Multidimensional Data Index
Multidimensional data indexing has always been one of
the key research issues in the database field. There are already
some relatively mature indexing technologies in relational
databases. This section focuses on the analysis of existing
mu ltid imensional indexes based on tree structures,
dimensionality reduction methods based on space curve filling,
and bitmap indexes.
The tree structure is mo re efficient than sequential file
query, and the maintenance cost is also less. Therefore, the
tree structure has attracted much attention in index research.
The most representative one is the B-tree index, wh ich has
been successfully applied in a large number of data
management systems and file systems. However, B-trees only
support one-dimensional key-value queries, and mult iple B-
trees need to be established for mult i-d imensional queries,
which makes the storage space occupied by the index larger
and the maintenance of the index more co mplicated. Therefore,
many supporting multi-dimensional index tree structures have
been proposed, such as: R tree, KD tree, quad tree, octree and
so on. This article mainly analy zes R-tree index and KD-tree
index.
Fig. 2. T wo-dimensional R tree structure
In 1984, Gutt man proposed the R-tree. Since then, various
improvements to the R-tree have appeared, such as R* trees,
Hilbert R-tree trees, dynamic R-trees, etc., which are
collectively referred to as R-t ree index classes. R-tree is a
balanced tree, which is the expansion of B-tree in a mult i-
dimensional space. The R-tree encloses adjacent data objects
with a small rectangle, called the smallest outer rectangle of
the data (MBR for short). Each MBR constitutes a leaf node of
the R-tree index. At the same time, the MBR with a smaller
value range can be used as a value range. The larger MBR
covers and forms the parent node.
For an R tree o f order M (the maximu m nu mber of nodes
that an R tree node can contain), suppose m is the min imu m
value of the index items contained in the midd le node of the R
R tree Meet the
932
 Proceedings of the Fifth International Conference on Electronics, Communication and Aerospace Technology (ICECA 2021)
IEEE Xplore Part Number: CFP21J88-ART; ISBN: 978-1-6654-3524-6

following characteristics: 1) The root node contains at least

two nodes, unless it is a leaf node. 2) The number of all
intermediate nodes except the root node must be between m
and M, that is, there are at most M subtrees and at least m
subtrees. 3) Each leaf node has at most M data items and at
least m data items. 4) A ll leaf nodes must be at the same level.
Figure 2 is an examp le of a two-d imensional R-tree structure.
In the figure, the MBR of each parent node covers the MBR of
its child nodes.
C. Cloud Computing Fig. 3. T he impact of data size on data space
The emergence of cloud computing benefits fro m the
development of the Internet and computers. Ord inary users The search efficiency of mu lti-dimensional range with
different selection rates is shown in the figure.
believe that it is mo re convenient and quicker to obtain
resources and services. IT companies such as Google, IBM,
Microsoft, and Amazon believe that cloud computing can be
based on the needs of different scenarios. A platform capable
of continuously configuring computing and storage.
As the birthplace of cloud computing, the United States
has its own advanced technology that drives the development
of cloud computing and is the leader in the cloud co mputing
industry. More and more countries have begun to participate
in the field of cloud co mputing applications, and according to
the actual situation of each country Formu late reasonable and
effective plans and programs to pro mote its development. IBM
developed and imp lemented InterCloud storage software in
2013, M icrosoft also released a cloud service operating system
called W indows Azure in 2013, A mazon released streaming
computing services, and other well-known co mpanies also
designed and implemented corresponding cloud storage
services and cloud computing platforms.
my country's research on cloud computing has also
achieved fruitful results. Various relevant departments have
Fig. 4. Multi-dimensional range search efficiency with different selection
actively formu lated corresponding policies and programs to rates
promote the development of do mestic cloud computing, and
developed some technologically advanced cities such as Based on cloud computing, the efficiency of distributed
Beijing and Shanghai into pilot cities for cloud computing multi-dimensional data indexing is shown in the figure.
research and development. Some technology companies such
as Tencent, BaiDu, and Alibaba have also launched their own
cloud computing platforms in response to the general trend,
and important domestic enterprises or scientific research
institutions such as Lenovo, Sugon, and Huawei hav e also
actively responded by investing a large amount of manpower,
material resources and financial resources on related issues.
Cloud computing related projects. As a result, under the
impetus of various enterprises or institutions, my country's
cloud computing technology is constantly innovating, and the Fig. 5. Distributed multi-dimensional data index efficiency
industry is constantly optimizing and developing.
IV. CONCLUSION
SSE   i 1  pC p  mi
k 2
(3) This paper studies the distributed multi-dimensional data
i
index strategy under the cloud computing environ ment. The
work of the thesis is carried out fro m two aspects: mult i-
 t 
n  n0   n  n0  t 0 exp   (4) dimensional data index in cloud storage and distributed
R  computing. First, this article introduces the principles and
methods of distributed co mputing; then analyzes the strategies
III. EXPERIMENT and methods of mult i-d imensional data indexing; finally,
Based on cloud computing, the impact of data scale on analyzes the distributed mult i-dimensional data indexing
data space is shown in the figure. strategies based on cloud computing.

978-1-6654-3524-6/21/$31.00 ©2021 IEEE 933

Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on December 24,2022 at 13:31:58 UTC from IEEE Xplore. Restrictions apply.
 Proceedings of the Fifth International Conference on Electronics, Communication and Aerospace Technology (ICECA 2021)
IEEE Xplore Part Number: CFP21J88-ART; ISBN: 978-1-6654-3524-6
REFERENCES
[1] J. Gantz, D. Reinsel. The digital universe decade – are you ready?[R].
USA: Internationla Data Corporation, July 16, 2010
[2] Armbrust M, Fox A, Griffith R, et al. A view of cloud computing [J].
Communications of the ACM, 2010, 53(4): 50-58.
[3] Mell P, Grance T. The NIST definition of cloud computing [J].
Communications of the ACM, 2010, 53(6): 50.
[4] IDC Financial Insights [EB/OL]. December 21, 2015.
[5] http://cs.com.cn/ssgs/hyzx/201510/t20151020_4820527.html, Oct 20,
2015.
[6] http://tech.caijing.com.cn/20160108/4049497.shtml, Jan 8, 2016.
[7] Agmon Ben-Yehuda O, Ben-Yehuda M, Schuster A, et al. Deconstructing
Amazon EC2 spot instance pricing[J]. ACM Transactions on Economics
and Computation, 2013, 1(3): 16.
[8] Ibm introduces ready-to-use cloud computing[EB/OL], http://www-
03.ibm.com/press/us/en/pressrelease/22613.wss.
[9] Calder B, Wang J, Ogus A, et al. Windows Azure Storage: a highly
available cloud storage service with strong consistency [C]. Proceedings
of the T wenty-Third ACM Symposium on Operating Systems
Principles, ACM, 2011: 143-157.
[10] Vavilapalli V K, Murthy A C, Douglas C, et al. Apache hadoop yarn: Yet
another resource negotiator[C]. Proceedings of the 4th annual
Symposium on Cloud Computing. ACM, 2013: 5.
[11] DB-Engines Ranking. Http://db-engines.com/en/ranking, Feb 01, 2016
[12] Chang F, Dean J, Ghemawat S, et al. Bigt able: A distributed storage
system for structured data [J]. ACM Transactions on Computer Systems,
2008, 26(2): 1-26.
[13] Decandia G, Hastorun D, Jampani M, et al. Dynamo: Amazon's highly
available key-value store [C]. Proceedings of the 21th ACM Symposium
on Operating Systems Principles. New York, USA: ACM Press, 2007:
205-220.
978-1-6654-3524-6/21/$31.00 ©2021 IEEE
Authorized licensed use limited to: ANNA UNIVERSITY. Downloaded on December 24,2022 at 13:31:58 UTC from IEEE Xplore. Restrictions apply.
[14] Laskhman A, Malik P. Cassandra: a decentralized structured storage
system[J]. ACM SIGOPS Operating Systems Review, 2010, 44(2): 35-
40.
[15] Carstoiu D, Cernian A, Olteanu A. Hadoop hbase-0.20. 2 performance
evaluation[C]. Proceedings of the 4th International Conference on New
Trends in Information Science and Service Science. New York: IEEE,
2010: 84-87.
[16] Frank C, Morin S, Chebotko A, et al. Distributed semantic web data
management in HBase and MySQL cluster [C]. Proceedings of IEEE
International Conference on Cloud Computing. New York: IEEE, 2011:
105-112.
[17] Aguilera M K, Golab W, Shah M A. A practical scalable distributed b-
tree [J]. PVLDB, 2008, 1(1): 598-609.
[18] Ghemawat S, Gobioff H, Leung S, et al. The Google file system [J].
ACM SIGOPS Operating Systems Review, 2003, 37(5): 29-43.
[19] Kala Karun A, Chitharanjan K. A review on hadoop —HDFS
infrastructure extensions[C]. Proceedings of 2013 IEEE Conference on
Information & Communication T echnologies. IEEE, 2013: 132-137.
[20] Maltzahn C, Molina-Estolano E, Khurana A, et al. Ceph as a scalable
alternative to the Hadoop Distributed File System[J]. The USENIX
Magazine, 2010, 35: 38-49.
[21] Abouzied A, Bajda-Pawlikowski K, Huang J, et al. HadoopDB in
action: building real world applications[C]. Proceedings of the 2010
ACM SIGMOD International Conference on Management of data.
ACM, 2010: 1111-1114.
[22] Dittrich J, Quian´e-Ruiz J-A, Jindal A, et al. Hadoop++: Making a
Yellow Elephant Run Like a Cheetah (Without It Even Noticing) [J].
PVLDB, 2010, 3(1):518-529.
[23] Chandrasekar S, Dakshinamurthy R, Seshakumar PG, et al. A novel
indexing scheme for efficient handling of small files in hadoop
distributed file system[C]. Proceedings of 2013 International Conference
on Computer Communication and Informatics, IEEE, 2013: 1-8.
[24] Kim J W, Kim I. Efficient Range-based Query Processing on the
Hadoop Distributed File System[C]. Proceedings of the 2nd Multimedia
Workshop, 2013.
934