Efficient Algorithms for Range Mode Queries in the Big Data Era

• Published in: Information (Basel) Vol. 15; no. 8; p. 450
• Main Authors: Karras, Christos, Theodorakopoulos, Leonidas, Karras, Aristeidis, Krimpas, George A.
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.08.2024
• Subjects: Algorithms; Big Data; Boolean; Compliance; Data analysis; Data retrieval; Data structures; Datasets; Effectiveness; Electronic commerce; Information management; internal audit; Number theory; Queries; Query processing; RAM; range mode queries; Social networks
• ISSN: 2078-2489; 2078-2489
• DOI: 10.3390/info15080450

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.