@article{333,
  author = {Ramzi A. Haraty, Mohammad Beydoun},
  title = {Traversing Graphs in RDBMSs},
  journal = {Journal of Information Technology Review},
  year = {2010},
  volume = {1},
  number = {3},
  doi = {},
  url = {http://www.dline.info/jitr/fulltext/v1n3/4.pdf},
  abstract = {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 presenta solution to representing a graph in a relational database.We also provide a set of procedures to traverse this graph and determine the connection path between two given nodes.},
}