To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org

1. GLOBALSOFT TECHNOLOGIES
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE
BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS
CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401
Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmail.com
Shortest Path Computing in Relational DBMS
Abstract
This paper takes the shortest path discovery to study efficient relational approaches to graph
search queries. We first abstract three enhanced relational operators, based on which we introduce an
FEM framework to bridge the gap between relational operations and graph operations. We show new
features introduced by recent SQL standards, such as window function and merge statement, can
improve the performance of the FEM framework. Second, we propose an edge weight aware graph
partitioning schema and design a bi-directional restrictive BFS (breadth-first-search)over partitioned
tables, which improves the scalability and performance without extra indexing overheads. The final
extensive experimental results illustrate our relational approach with optimization strategies can
achieve high scalability and performance.
Existing system
This paper takes the shortest path discovery to study efficient relational approaches to graph
search queries. We first abstract three enhanced relational operators, based on which we introduce an
FEM framework to bridge the gap between relational operations and graph operations. We show new
features introduced by recent SQL standards, such as window function and merge statement, can
improve the performance of the FEM framework.
Proposed system
we propose an edge weight aware graph partitioning schema and design a bi-directional
restrictive BFS (breadth-first-search)over partitioned tables, which improves the scalability and
performance without extra indexing overheads. The final extensive experimental results illustrate our
relational approach with optimization strategies can achieve high scalability and performance.

2. SYSTEM CONFIGURATION:-
HARDWARE CONFIGURATION:-
 Processor - Pentium –IV
 Speed - 1.1 Ghz
 RAM - 256 MB(min)
 Hard Disk - 20 GB
 Key Board - Standard Windows Keyboard
 Mouse - Two or Three Button Mouse
 Monitor - SVGA
SOFTWARE CONFIGURATION:-
 Operating System : Windows XP
 Programming Language : JAVA
 Java Version : JDK 1.6 & above.