Directed Graph Representation and Traversal in Relational Databases

LAUR Repository

Show simple item record

dc.contributor.author Haraty, Ramzi A.
dc.contributor.author Beydoun, Mohammad
dc.contributor.editor Zavoral, Filip
dc.date.accessioned 2018-02-02T08:12:25Z
dc.date.available 2018-02-02T08:12:25Z
dc.date.copyright 2010 en_US
dc.date.issued 2018-02-02
dc.identifier.isbn 9783642143052 en_US
dc.identifier.uri http://hdl.handle.net/10725/7013
dc.description.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 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 http://www.tripbot.com [1]. en_US
dc.language.iso en en_US
dc.publisher Springer en_US
dc.subject Computer networks -- Congresses en_US
dc.subject Internet research -- Congresses en_US
dc.subject Internet searching -- Congresses en_US
dc.title Directed Graph Representation and Traversal in Relational Databases en_US
dc.type Conference Paper / Proceeding en_US
dc.author.school SAS en_US
dc.author.idnumber 199729410 en_US
dc.author.department Computer Science and Mathematics en_US
dc.description.embargo N/A en_US
dc.publication.place Heidelberg en_US
dc.keywords Graphs en_US
dc.keywords Relational databases en_US
dc.description.bibliographiccitations Includes bibliographical references. en_US
dc.identifier.doi https://doi.org/10.1007/978-3-642-14306-9_44 en_US
dc.identifier.ctation Beydoun, M., & Haraty, R. A. (2010, July). Directed Graph Representation and Traversal in Relational Databases. In International Conference on Networked Digital Technologies (pp. 443-455). Springer, Berlin, Heidelberg. en_US
dc.author.email rharaty@lau.edu.lb en_US
dc.conference.date July 7-9, 2010 en_US
dc.conference.pages 443-455 en_US
dc.conference.place Prague, Czech Republic en_US
dc.conference.subtitle second international conference, NDT 2010 en_US
dc.conference.title Networked digital technologies en_US
dc.identifier.tou http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php en_US
dc.identifier.url https://link.springer.com/chapter/10.1007/978-3-642-14306-9_44 en_US
dc.orcid.id https://orcid.org/0000-0002-6978-3627 en_US
dc.publication.date 2010 en_US
dc.volume 2 en_US
dc.author.affiliation Lebanese American University en_US
dc.relation.numberofseries 88 en_US
dc.title.volume Communications in computer and information science en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account