| 000 | 01738cam a2200361 a 4500 | ||
|---|---|---|---|
| 003 | EG-GiCUC | ||
| 005 | 20250223030217.0 | ||
| 008 | 100329s2010 ua d f m 000 0 eng d | ||
| 040 |
_aEG-GiCUC _beng _cEG-GiCUC |
||
| 041 | 0 | _aeng | |
| 049 | _aDeposite | ||
| 097 | _aPh.D | ||
| 099 | _aCai01.20.04.Ph.D.2010.Ne.E | ||
| 100 | 0 | _aNeamat Abdelhadi Hadi Eltazi | |
| 245 | 1 | 0 |
_aEfficient processing of queries in semi - structured data / _cNeamat Abdelhadi Hadi Eltazi ; Supervised Osman Hegazy , H . V. jagadish , Mohamed Elsharkawi |
| 246 | 1 | 5 | _aالتشغيل الفعال للاستفسارات فى البيانات شبه المهيكلة |
| 260 |
_aCairo : _bNeamat Abdelhadi Hadi Eltazi , _c2010 |
||
| 300 |
_a88Leaves : _bcharts ; _c30cm |
||
| 502 | _aThesis (Ph.D.) - Cairo University - Faculty of Computers and Information - Department of Information System | ||
| 520 | _aXML queries are based on path expressions which are composed of some elements connected to each other in a tree pattern structure called Query Tree Pattern (QTP) . Thus the core operation of XML query processing is finding al instances of QTP in the XML document . A number of methods are offered for QTP matching but they process too many elements in XML documentwhile most of them have no opportunity to participate in the final result | ||
| 530 | _aIssued also as CD | ||
| 653 | 4 | _aQuery processing | |
| 653 | 4 | _aTwin queries | |
| 653 | 4 | _aXML | |
| 700 | 0 |
_aH . V. jagadish , _eSupervisor |
|
| 700 | 0 |
_aMohamed Elsharkawi , _eSupervisor |
|
| 700 | 0 |
_aOsman Hegazy , _eSupervisor |
|
| 856 | _uhttp://172.23.153.220/th.pdf | ||
| 902 | _a1 | ||
| 905 |
_aNazla _eRevisor |
||
| 905 |
_aSoheir _eCataloger |
||
| 942 |
_2ddc _cTH |
||
| 999 |
_c29904 _d29904 |
||