A dynamic index approach for big data / Sura Ibrahim Mohammed Ali ; Supervised Fatma A. Omara , Hussein M. Sharaf
Material type:
- نهج الفهرس الدينامكى للبيانات الكبيرة [Added title page title]
- Issued also as CD
Item type | Current library | Home library | Call number | Copy number | Status | Barcode | |
---|---|---|---|---|---|---|---|
![]() |
قاعة الرسائل الجامعية - الدور الاول | المكتبة المركزبة الجديدة - جامعة القاهرة | Cai01.20.03.M.Sc.2015.Su.D (Browse shelf(Opens below)) | Not for loan | 01010110067485000 | ||
![]() |
مخـــزن الرســائل الجـــامعية - البدروم | المكتبة المركزبة الجديدة - جامعة القاهرة | Cai01.20.03.M.Sc.2015.Su.D (Browse shelf(Opens below)) | 67485.CD | Not for loan | 01020110067485000 |
Browsing المكتبة المركزبة الجديدة - جامعة القاهرة shelves Close shelf browser (Hides shelf browser)
No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | ||
Cai01.20.03.M.Sc.2015.Sa.A Authorization management for private cloud computing / | Cai01.20.03.M.Sc.2015.Sa.A Authorization management for private cloud computing / | Cai01.20.03.M.Sc.2015.Su.D A dynamic index approach for big data / | Cai01.20.03.M.Sc.2015.Su.D A dynamic index approach for big data / | Cai01.20.03.M.Sc.2015.Wa.E Enhancement of a secure coercion-free electronic voting system / | Cai01.20.03.M.Sc.2015.Wa.E Enhancement of a secure coercion-free electronic voting system / | Cai01.20.03.M.Sc.2016.Ab.F Feature-based framework for Arabic Opinion Mining / |
Thesis (M.Sc.) - Cairo University - Faculty of Computers and Information - Department of Computer Science
The 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
Issued also as CD
There are no comments on this title.