Порівняльний аналіз алгоритмів скорочення url-адрес: міркування щодо продуктивності та безпеки в прикладній області веб-пошуку та інформаційно-пошукових технологій

Abstract

The paper examines a range of URL shortening algorithms, including Hash-based and Randomized algorithms, and compares their effectiveness based on factors such as URL length, randomness, and resistance to brute-force attacks. In addition, the article explores the security risks involved in URL shortening and suggests strategies for mitigating them. The paper also includes a performance analysis of different URL shortening algorithms, considering the time required to generate a shortened URL and redirect the user to the original URL. Finally, the article discusses the challenges of evaluating URL shortening algorithms and outlines potential avenues for future research in this area