000 | 01955cam a2200337 a 4500 | ||
---|---|---|---|
003 | EG-GiCUC | ||
005 | 20250223031405.0 | ||
008 | 160109s2015 ua d f m 000 0 eng d | ||
040 |
_aEG-GiCUC _beng _cEG-GiCUC |
||
041 | 0 | _aeng | |
049 | _aDeposite | ||
097 | _aM.Sc | ||
099 | _aCai01.20.03.M.Sc.2015.Su.D | ||
100 | 0 | _aSura Ibrahim Mohammed Ali | |
245 | 1 | 2 |
_aA dynamic index approach for big data / _cSura Ibrahim Mohammed Ali ; Supervised Fatma A. Omara , Hussein M. Sharaf |
246 | 1 | 5 | _aنهج الفهرس الدينامكى للبيانات الكبيرة |
260 |
_aCairo : _bSura Ibrahim Mohammed Ali , _c2015 |
||
300 |
_a95 Leaves : _bcharts ; _c30cm |
||
502 | _aThesis (M.Sc.) - Cairo University - Faculty of Computers and Information - Department of Computer Science | ||
520 | _aThe growing need for information retrieval (IR) from big data requires more efficient techniques for data indexing. According to the work in this thesis, a dynamic order multifield index (DOMI) has been introduced and implemented. The proposed indexing structure allows dynamic rather than sequential ordering of fields. Hence, the proposed DOMI allows answering queries that involve composite - fields, as well as, queries that involve a single field. The DOMI is based on a collection of radix trees in addition to single hash table. The use of a hash table allows random access of any sub - radix tree (RT) without traversing the trees at the upper layers. In addition, the use of radix trees decreases the space consumption by storing common prefix values only once | ||
530 | _aIssued also as CD | ||
653 | 4 | _aBig data | |
653 | 4 | _aComputer science | |
653 | 4 | _aDynamic index approach | |
700 | 0 |
_aFatma Abdelstaar Omara , _eSupervisor |
|
700 | 0 |
_aHussein Mohamed Sharaf , _eSupervisor |
|
856 | _uhttp://172.23.153.220/th.pdf | ||
905 |
_aNazla _eRevisor |
||
905 |
_aSamia _eCataloger |
||
942 |
_2ddc _cTH |
||
999 |
_c54329 _d54329 |