This paper proposes extensions to a relational database system to support the selection and execution of algorithms for shortest path search problems. An expert system can employ this extended DBMS to provide unified management of data and part of the knowledge base. Several search algorithms have been prototyped using the database extensions. Their performance characteristics are described and comparisons with main memory algorithms are made.