Query Optimization in NoSQL Databases Using an Enhanced Localized R-tree Index

N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Query optimization is a crucial process across data mining and big data analytics. As the size of the data in the modern applications is increasing due to various sources, types and multi-modal records across databases, there is an urge to optimize lookup and search operations. Therefore, indexes can be utilized to solve the matter of rapid data growth as they enhance the performance of the database and subsequently the cloud server where it is stored. In this paper an index on spatial data, i.e. coordinates on the plane or on the map is presented. This index is be based on the R-Tree which is suitable for spatial data and is distributed so that it can scale and adapt to massive amounts of data without losing its performance. The results of the proposed method are encouraging across all experiments and future directions of this work include experiments on skewed data.

Cite

CITATION STYLE

APA

Karras, A., Karras, C., Samoladas, D., Giotopoulos, K. C., & Sioutas, S. (2022). Query Optimization in NoSQL Databases Using an Enhanced Localized R-tree Index. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13635 LNCS, pp. 391–398). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-21047-1_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free