header
Image from OpenLibrary

Generation and evaluation of graph database from relational data sources / Youmna A. Megid A. Aziz ; Supervised Aly Fahmy , Neamat Eltazi

By: Contributor(s): Material type: TextTextLanguage: English Publication details: Cairo : Youmna Abdelmegid Abdelaziz , 2019Description: 108 Leaves ; 30cmOther title:
  • توليد و تقييم قواعد بيانات رسومية من مصادر بيانات علاقية [Added title page title]
Subject(s): Available additional physical forms:
  • Issued also as CD
Dissertation note: Thesis (M.Sc.) - Cairo University - Faculty of Computer and Information - Department of Computer Science Summary: Nowadays the exponential growth of interconnected data is resulting from social media, computer networks and geographic applications. These applications need to store a huge amount of unstructured/semi-structured connected data that is not easily to be handled by the relational database. Graph database management systems are widely used in scenarios where the data are intensively connected. Storing and representing such connected data in a relational database is not an efficient task that is why there is a need to convert a relational database to graph database to handle such connected data. To the best of our knowledge, two main algorithms relational to graph algorithm (R2G) and Gupta{u2019}s algorithm are proposed to convert relational databases to graph databases. After studying R2G algorithm in details, we find two main problems in it. First, R2G algorithm has some limitations which are; it cannot handle multiple relationships types such as unary relationships and cannot handle associative entities (many-to-many relationships) with non-foreign key attributes. In addition to that, after step by step tracing R2G algorithm, we conclude that the given cases mentioned in R2G algorithm do not reach to the output graph database model described by R2G authors on their work
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Call number Copy number Status Date due Barcode
Thesis Thesis قاعة الرسائل الجامعية - الدور الاول المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.20.03.M.Sc.2019.Yo.G (Browse shelf(Opens below)) Not for loan 01010110079559000
CD - Rom CD - Rom مخـــزن الرســائل الجـــامعية - البدروم المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.20.03.M.Sc.2019.Yo.G (Browse shelf(Opens below)) 79559.CD Not for loan 01020110079559000

Thesis (M.Sc.) - Cairo University - Faculty of Computer and Information - Department of Computer Science

Nowadays the exponential growth of interconnected data is resulting from social media, computer networks and geographic applications. These applications need to store a huge amount of unstructured/semi-structured connected data that is not easily to be handled by the relational database. Graph database management systems are widely used in scenarios where the data are intensively connected. Storing and representing such connected data in a relational database is not an efficient task that is why there is a need to convert a relational database to graph database to handle such connected data. To the best of our knowledge, two main algorithms relational to graph algorithm (R2G) and Gupta{u2019}s algorithm are proposed to convert relational databases to graph databases. After studying R2G algorithm in details, we find two main problems in it. First, R2G algorithm has some limitations which are; it cannot handle multiple relationships types such as unary relationships and cannot handle associative entities (many-to-many relationships) with non-foreign key attributes. In addition to that, after step by step tracing R2G algorithm, we conclude that the given cases mentioned in R2G algorithm do not reach to the output graph database model described by R2G authors on their work

Issued also as CD

There are no comments on this title.

to post a comment.