Efficient Algorithms for Range Mode Queries in the Big Data Era-Reference-Cited by-同舟云学术

Efficient Algorithms for Range Mode Queries in the Big Data Era

Published:2024-07-30 Issue:8 Volume:15 Page:450
ISSN:2078-2489
Container-title:Information
language:en
Short-container-title:Information

Author:

Karras Christos¹^ORCID,Theodorakopoulos Leonidas²^ORCID,Karras Aristeidis¹^ORCID,Krimpas George A.¹^ORCID

Affiliation:

1. Computer Engineering and Informatics Department, University of Patras, 26504 Rion, Greece

2. Department of Management Science and Technology, University of Patras, 26334 Patras, Greece

Abstract

The mode is a fundamental descriptive statistic in data analysis, signifying the most frequent element within a dataset. The range mode query (RMQ) problem expands upon this concept by preprocessing an array A containing n natural numbers. This allows for the swift determination of the mode within any subarray A[a..b], thus optimizing the computation of the mode for a multitude of range queries. The efficacy of this process bears considerable importance in data analytics and retrieval across diverse platforms, including but not limited to online shopping experiences and financial auditing systems. This study is dedicated to exploring and benchmarking different algorithms and data structures designed to tackle the RMQ problem. The goal is to not only address the theoretical aspects of RMQ but also to provide practical solutions that can be applied in real-world scenarios, such as the optimization of an online shopping platform’s understanding of customer preferences, enhancing the efficiency and effectiveness of data retrieval in large datasets.

Publisher

MDPI AG

Link

https://www.mdpi.com/2078-2489/15/8/450/pdf

Reference67 articles.

1. Range mode and range median queries on lists and trees;Krizanc;Nord. J. Comput.,2005

2. Linear-space data structures for range mode query in arrays;Chan;Theory Comput. Syst.,2014

3. Durocher, S., and Morrison, J. (2011). Linear-space data structures for range mode query in arrays. arXiv.

4. El-Zein, H., He, M., Munro, J.I., and Sandlund, B. (2018). Improved time and space bounds for dynamic range mode. arXiv.

5. Range mode and range median queries in constant time and sub-quadratic space;Petersen;Inf. Process. Lett.,2009