Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An external memory data structure for shortest path queries
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Implementing a scalable XML publish/subscribe system using relational database systems
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Scalable mining of large disk-based graph databases
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fast and practical indexing and querying of very large graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
DTD-directed publishing with attribute translation grammars
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Database Systems: The Complete Book
Database Systems: The Complete Book
SoQL: A Language for Querying and Creating Data in Social Networks
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
GConnect: a connectivity index for massive disk-resident graphs
Proceedings of the VLDB Endowment
Speed-up techniques for shortest-path computations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
ERACER: a database approach for statistical inference and data cleaning
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
TEDI: efficient shortest path query answering on graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Finding maximal cliques in massive networks by H*-graph
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
Fast personalized PageRank on MapReduce
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Data mining using relational database management systems
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
A framework for SQL-Based mining of large graphs on relational databases
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
HLDB: location-based services in databases
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
A survey on proximity measures for social networks
Search Computing
Graph analysis: do we have to reinvent the wheel?
First International Workshop on Graph Data Management Experiences and Systems
Proceedings of the 22nd international conference on World Wide Web
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
With the rapid growth of large graphs, we cannot assume that graphs can still be fully loaded into memory, thus the disk-based graph operation is inevitable. In this paper, we take the shortest path discovery as an example to investigate the technique issues when leveraging existing infrastructure of relational database (RDB) in the graph data management. Based on the observation that a variety of graph search queries can be implemented by iterative operations including selecting frontier nodes from visited nodes, making expansion from the selected frontier nodes, and merging the expanded nodes into the visited ones, we introduce a relational FEM framework with three corresponding operators to implement graph search tasks in the RDB context. We show new features such as window function and merge statement introduced by recent SQL standards can not only simplify the expression but also improve the performance of the FEM framework. In addition, we propose two optimization strategies specific to shortest path discovery inside the FEM framework. First, we take a bi-directional set Dijkstra's algorithm in the path finding. The bi-directional strategy can reduce the search space, and set Dijkstra's algorithm finds the shortest path in a set-at-a-time fashion. Second, we introduce an index named SegTable to preserve the local shortest segments, and exploit SegTable to further improve the performance. The final extensive experimental results illustrate our relational approach with the optimization strategies achieves high scalability and performance.