Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Dataset
Data sources: ZENODO
addClaim

KATTA MA'LUMOTLAR MUHITIDA AXBOROT IZLASH ALGORITMLARINI OPTIMALLASHTIRISH

Authors: Ataboyeva Shohista;

KATTA MA'LUMOTLAR MUHITIDA AXBOROT IZLASH ALGORITMLARINI OPTIMALLASHTIRISH

Abstract

Raqamli ma'lumotlarning eksponensial o'sishi — 2025 yilga kelib 175 zettabaytga yetishi kutilmoqda — an'anaviy qidiruv algoritmlarini hajm, tezlik va turlilik (3V) bilan tavsiflanadigan Big Data muhitlarida samarasiz qilib qo'ydi. Ushbu maqolada taqsimlangan katta ma'lumotlar infratuzilmalarida axborot qidiruv algoritmlarini optimallashtirish bo'yicha tizimli tahlil va model taqdim etilgan. Tajriba natijalari shuni ko'rsatadiki, taklif etilayotgan mashina o'rganishiga asoslangan gibrid algoritm chiziqli qidiruv bilan solishtirganda so'rov kechikishini 99,4% ga kamaytiradi va petabayt hajmdagi ma'lumotlarda sekundiga 7 400 ta so'rovni qayta ishlaydi.

Powered by OpenAIRE graph
Found an issue? Give us feedback