Search In this Thesis
   Search In this Thesis  
العنوان
AC-PT :
الناشر
Randa Osman Morsi ,
المؤلف
Randa Osman Morsi
هيئة الاعداد
باحث / Randa Osman Morsi
مشرف / Elsayed E. Hemayed
مشرف / Mona F. Ahmed
مشرف / Reda Abd Alwahab Ahmed
تاريخ النشر
2020
عدد الصفحات
93 P . :
اللغة
الإنجليزية
الدرجة
ماجستير
التخصص
Computational Mechanics
تاريخ الإجازة
11/5/2020
مكان الإجازة
جامعة القاهرة - كلية الهندسة - Computer Engineerin
الفهرس
Only 14 pages are availabe for public view

from 113

from 113

Abstract

SQLIA is one of the most severe threats to the database. In general, the approaches that provide the best guard for the database against SQLIA are those that make use of a mix of primitive approaches as this leads to strengthening their merits and improving their weaknesses. One of the most powerful algorithms, Parsing Tree validation (PT), depends only on accurate detection but takes much time so combining it with a fast-dynamic algorithm with the purpose of learning and storing the malicious input patterns to compare with the next coming inputs will be a great achievement. An algorithm was proposed that is based on the combination of two of the existing detection algorithms: pattern matching algorithm using Aho-Corasick (AC) and PT. The results showed that the proposed approach guarantees high accuracy of 99.9%, reasonable time which was 53.6% of PT’s time and less memory usage