Download Education

Dr. Awny Abd El Hady Ahmed Sayed
Computer Science Dept. , Faculty of Science, Minia University, Minia, Egypt
E-mail : [email protected]
Tel. 002 – 010 710 45 35
Education:
From 1988-1992, B.Sc., Math and Computer Science Dep., Faculty of
science, Minia University, Egypt
From 1993-1998, M.Sc., Computer Science Dep.-Faculty of scienceMinia University-Egypt
Title: On Parallel Sorting Algorithms (with Prof. dr. El-Sayed El
Harbety, Ein Shams university)
From 2000-2005, P.hD., Computer Science Dep., Data Management
System and Knowledge Representation Group, Duisburg-Essen
University, Germany (Prof. Dr. Rainer Unland).
General title : Distributed XML Databases
Specific title: Indexing Collections of XML documents with Arbitrary
Links
Jobs
1. From 1992-2000 Research assistance at Minia University-Egypt.
2. From 2000-2003 Research assistance at Faculty of Computer Science- Database and
information System group- Saarland University- Germany.
3. From 2003-2005 Scientific Co-worker at Institute of Computer Science and Business
Information System, Data Management System and Knowledge Representation Group,
Duisburg-Essen University, Germany.
4. From 2005-Untill Know , Lecture at Computer Science Department, Minia University ,
Egypt.
5. From 2006 member of training project at Minia University (ICTP projects)
6. From 2006 Software manager at the management information system project (ICTP
projects)
Teaching Courses
1- Introduction to computer science
2- Introduction to Information system
3- Management information system
4- Database management system
5- Database design
6- Distributed databases
7- Decision Support System
8- Parallel Computation
9- Operating System (Future Acadamy)
10- Software engineering (Future Acadamy)
Page 1 of 4
11- Java, Visual basic and C++
Training Courses:
12345678-
Oracle 8i Database Administration, Developer 6i.
Network Installation & Administration.
Arabic Development Association ( Linux Mandrake 10.1 community)
Oracle 10g Introduction to SQL
Oracle 10g Introduction to PL/SQL
Oracle 10g Workshop I
Oracle 10g Workshop II
Java
Master and Projects Supervision :
1- “A study of Arabic Information Retrieval from XML documents ’ Master thesis
Supervisors: Prof. Dr. Ahmed Radwan
Dr. Awny Abd el Hady Ahmed
2- Supervisor at more Student projects, for example
i- AM management information system (Human resources, Security, and Reception)
(fourth year, faculty of computer and information)
ii- Electronic Stories (fourth year, faculty of computer and information)
iii- WWW.EIS.COM project (fourth year, faculty of science, Computer science Dept.)
iv- Supervisor on fifty projects at Future Academy
Publications
1. Awny Sayed, El-Sayed El Harbety. On Parallel Sorting Algorithms. Journal of Computer
Science, 2000
2. Sayed, A.; Unland, R.; Indexing and Querying Heterogeneous XML Collections; In 14th
International Conference on Computer Theory and Applications; September 28 - September
30; 2004.
3. Sayed, A.; Unland, R.; Index-Support on XML-documents Containing Links; The 46th
International IEEE Midwest Symposium On Circuits and Systems; Cairo, Egypt,
December 27, 2003.
4. Sayed A., Rainer Unland: HID: An Efficient Path Index for Complex XML Collections
with Arbitrary Links. DNIS 2005, Japan
5. Awny Sayed: A prime Scheme for reachability queries over large XML graph.
ICICIS2007, Egypt, 2007
6. Awny Sayed. Fast Computation of connectivity queries over linked XML documents
graph. To appear
Skills
Database & System Analysis:
System Analysis, System Design and Database Design.
Network Installation & Administration.
Oracle 8i database Administration.
Developer 6i (Forms, Reports Server, Graphics).
Oracle Database 9i and 10g.
Oracle Developer (2000,6,6i,9i Suite,10g Suite).
Oracle Designer
Oracle Discoverer (Administration, Desktop)
Page 2 of 4
PL/SQL, SQL * Plus.
Java
SQL Server 2000.
PL/SQL Developer.
XML.
Platforms:
Windows NT 4.0 Server Installation & Administration.
Windows NT 4.0 Work Station Installation & Administration.
Windows 2000 Server, Windows 2000 Professional
Windows 98, Me, XP
Little Background of UNIX Solaris.
PhD Abstract
In recent years, the popularity of XML has increased significantly. XML is the extensible markup language
of the World Wide Web Consortium (W3C). XML is used to represent data in many areas, such as
traditional database management systems, e-business environments, and the World Wide Web. XML data,
unlike relational and object-oriented data, has no fixed schema known in advance and is stored separately
from the data. XML data is self-describing and can model heterogeneity more naturally than relational or
object-oriented data models. Moreover, XML data usually has XLinks or XPointers to data in other
documents (e.g., global-links). In addition to XLink or XPointer links, the XML standard allows to add
internal-links between different elements in the same XML document using the ID/IDREF attributes.
The rise in popularity of XML has generated much interest in query processing over graphstructured data. In order to facilitate efficient evaluation of path expressions, structured indexes have been
proposed. However, most variants of structured indexes ignore global- or interior-document references.
They assume a tree-like structure of XML-documents, which do not contain such global-and internal-links.
Extending these indexes to work with large XML graphs considering of global- or internal-document links,
firstly requires a lot of computing power for the creation process. Secondly, this would also require a great
deal of space in which to store the indexes. As a latter demonstrates, the efficient evaluation of ancestorsdescendants queries over arbitrary graphs with long paths is indeed a complex issue.
This thesis proposes the HID index (2-Hop cover path Index based on DAG) is based on the
concept of a two-hop cover for a directed graph. The algorithms proposed for the HID index creation, in
effect, scales down the original graph size substantially. As a result, a directed acyclic graph (DAG) with a
smaller number of nodes and edges will emerge. This reduces the number of computing steps required for
building the index. In addition to this, computing time and space will be reduced as well. The index also
permits to efficiently evaluate ancestors-descendants relationships. Moreover, the proposed index has an
advantage over other comparable indexes: it is optimized for descendants- or-self queries on arbitrary
Page 3 of 4
graphs with link relationship, a task that would stress any index structures. Our experiments with real life
XML data show that, the HID index provides better performance than other indexes.
Page 4 of 4