Abstract | ||
---|---|---|
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 pro- vide unified management of data and part of the knowledge base. Several search algorithms have been pro- totyped using the database extensions. Their performance characteristics are described and comparisons with main memory algorithms are made. |
Year | Venue | Keywords |
---|---|---|
1984 | Expert Database Workshop | heuristic search |
DocType | Citations | PageRank |
Conference | 56 | 42.25 |
References | Authors | |
22 | 6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ru-mei Kung | 1 | 56 | 42.25 |
Eric N. Hanson | 2 | 917 | 376.11 |
Yannis E. Ioannidis | 3 | 5497 | 1988.40 |
Timos K. Sellis | 4 | 4970 | 1255.07 |
Leonard D. Shapiro | 5 | 636 | 302.16 |
Michael Stonebraker | 6 | 12463 | 4310.17 |