Directed Graph Representation and Traversal in Relational Databases

  • Mohammad Beydoun
  • Ramzi A. Haraty
Part of the Communications in Computer and Information Science book series (CCIS, volume 88)


Graph representation in computers has always been a hot topic due to the number of applications that directly benefit from graphs. Multiple methods have emerged in computer science to represent graphs in numerical/logical formats; most of these methods rely heavily on pointers. However, most current business applications also rely heavily on relational databases as a primary source of storing information. Moreover, most databases are relational by nature, and this does not provide the best-fit scenario to represent graphs. In this work, we present a solution to representing a graph in a relational database. Moreover, we will also provide a set of procedures to traverse this graph and determine the connection path between two given nodes. This work was implemented in an online social/travel website which can be found at [1].


graphs relational databases 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Tripbot. Tripbot Friends,
  2. 2.
    Mulliuns, C.: The Future of SQL. IDUG Solutions Journal (1998)Google Scholar
  3. 3.
  4. 4.
    Microsoft. MSDN - Microsoft Developer Network,
  5. 5.
  6. 6.
    Celko, J.: Joe Celko’s Trees and Hierarchies in SQL for Smarties. Morgam Kaufmann, New York (2004)Google Scholar
  7. 7.
  8. 8.
    MySQL Reference Manual,
  9. 9.
    Team, N. Neo4J Graph Database,
  10. 10.
    Ambler, S.: Agile Database Techniques: Effective Strategies for the Agile Software Developer. John Wiley & Sons, Chichester (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Mohammad Beydoun
    • 1
  • Ramzi A. Haraty
    • 1
  1. 1.Department of Computer Science and MathematicsLebanese American UniversityBeirutLebanon

Personalised recommendations