The Graph Traversal Pattern

A graph is a structure composed of a set of vertices (i.e.nodes, dots) connected to one another by a set of edges (i.e.links, lines). The concept of a graph has been around since the late 19$^\text{th}$ century, however, only in recent decades has there been a strong resurgence in both theoretical and applied graph research in mathematics, physics, and computer science. In applied computing, since the late 1960s, the interlinked table structure of the relational database has been the predominant information storage and retrieval model. With the growth of graph/network-based data and the need to efficiently process such data, new data management systems have been developed. In contrast to the index-intensive, set-theoretic operations of relational databases, graph databases make use of index-free, local traversals. This article discusses the graph traversal pattern and its use in computing.

[1]  Margaret H. Dunham,et al.  Join processing in relational databases , 1992, CSUR.

[2]  敏嗣 弓場,et al.  20世紀の名著名論：E. F. Codd : A Relational Model of Data for Large Shared Data Banks , 2003 .

[3]  Naren Ramakrishnan,et al.  Studying Recommendation Algorithms by Graph Analysis , 2003, Journal of Intelligent Information Systems.

[4]  Vassilis Christophides,et al.  RQL: a declarative query language for RDF , 2002, WWW.

[5]  Marko A. Rodriguez,et al.  Exposing multi-relational networks to single-relational network analysis algorithms , 2008, J. Informetrics.

[6]  Hanan Samet,et al.  Foundations of multidimensional and metric data structures , 2006, Morgan Kaufmann series in data management systems.

[7]  R. Manger.  A new path algebra for finding paths in graphs , 2004, 26th International Conference on Information Technology Interfaces, 2004..

[8]  Carlos A. Hurtado,et al.  Edinburgh Research Explorer Expressive Languages for Path Queries over Graph-Structured Data , 2012 .

[9]  Josephine Griffith,et al.  A Constrained Spreading Activation Approach to Collaborative Filtering , 2006, KES.

[10]  Martin Russling,et al.  A General Scheme for Breadth-First Graph Traversal , 1995, MPC.

[11]  Josep-Lluís Larriba-Pey,et al.  Dex: high-performance exploration on large graphs for information retrieval , 2007, CIKM '07.

[12]  Claudio Gutierrez,et al.  Survey of graph database models , 2008, CSUR.

[13]  Joe Lennon.  Beginning CouchDB , 2009 .

[14]  Jonathan L. Herlocker,et al.  Evaluating collaborative filtering recommender systems , 2004, TOIS.

[15]  Michael Stonebraker,et al.  The Case for Shared Nothing , 1985, HPTS.

[16]  Lakhmi C. Jain,et al.  Knowledge-Based Intelligent Information and Engineering Systems , 2004, Lecture Notes in Computer Science.

[17]  G. Chartrand,et al.  Graphs & Digraphs , 1986 .

[18]  Marko A. Rodriguez,et al.  Grammar-based random walkers in semantic networks , 2008, Knowl. Based Syst..

[19]  Marko A. Rodriguez.  Mapping Semantic Networks to Undirected Networks , 2008, ArXiv.

[20]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.

[21]  G. P. Monro,et al.  The Concept of Multiset , 1987, Math. Log. Q..

[22]  Edward A. Fox,et al.  Recommender Systems Research: A Connection-Centric Survey , 2004, Journal of Intelligent Information Systems.

[23]  Sriram Raghavan,et al.  Complex Queries over Web Repositories , 2003, VLDB.

[24]  Andy B. Yoo,et al.  Evaluating use of data flow systems for large graph analysis , 2009, MTAGS '09.

[25]  Patrik Larsson,et al.  Analyzing and adapting graph algorithms for large persistent graphs , 2008 .

[26]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[27]  E. F. CODD,et al.  A relational model of data for large shared data banks , 1970, CACM.