참고문헌
- R. Agrawal and H. Jagadish, 'Algorithms for Searching Massive Graphs,' In IEEE Transactions on Knowledge and Data Engineering, Vol. 6, No.2, pp.225-238, April 1994 https://doi.org/10.1109/69.277767
- R. Kung, E. Hanson, Y. Ioannnidis, T. Sellis, L. Shapiro, and M. Stonebraker, 'Heuristic Search in Data Base System,' In Proc. 1st Int. Workshop Expert Database Systems, pp.96-107, Oct. 1984
- R. Agrawal, S. Dar, and H. Jagadish, 'Direct Transitive Closure Algorithms; Design and Performance Evaluation,' In ACM Transactions on Database System, Vol. 15, No.3, pp.427-458, September 1990 https://doi.org/10.1145/88636.88888
- S. Dar and R. Ramakirishnan, 'A Performance Study of Transitive Closure Algorithms,' In Proc. ACM-SIGMOD 1994 Int'l Conference on Management of Data, pp.454-465, 1994 https://doi.org/10.1145/191843.191928
- K. Hua, J. Su, and C. Hua, 'Efficient Evaluation of Traversal Recursive Queries Using Connectivity Index,' In Proc. IEEE 9th Int'l Conf. on Data Engineering, pp.549-558, 1993 https://doi.org/10.1109/ICDE.1993.344025
- Y. Ioannidis and R. Ramakirishnan, 'Efficient Transitive Closure Algorithms,' In Proc. of the 14th VLDB Conference, pp.382-394, 1988
- Y. Ioannidis, R. Ramakirishnan, and L. Winger 'Transitive Closure Algorithms Based on Graph Traversal,' In ACM Transactions on Database Systems, Vol. 18, No.3, pp.513-576, September 1993 https://doi.org/10.1145/155271.155273
- B. Jiang, 'A Suitable Algorithm of Computing Partial Transitive Closures in Databases,' In Proc. IEEE 6th Int'l Conf. Data engineeringm pp.264-271, 1990 https://doi.org/10.1109/ICDE.1990.113477
- G. Qadah, L. Henschen, and J. Kim, 'Efficient Algorithms for the Instantiated Transitive Closure Queries,' In IEEE Transactions on Software Engineering, Vol. 17, No. 3, pp.296-309, March 1991 https://doi.org/10.1109/32.75418
- A. Rosenthal, S. Heiler, U. Dayal, and F. Manola, 'Traversal Recursion: A practical approach to supporting recursive applications' In Proc. IEEE 3rd Int'l Conf. Data Engineering, pp.580-590, 1987
- I. Toroslu and G. Qadah, 'The Efficient Computation of Strong Partial Transitive-Closures,' In Proc. IEEE 9th Int'l Conf. Data Engineering, pp.530-537, 1993 https://doi.org/10.1109/ICDE.1993.344027
- Y. Huang, N. Jing, and E. Rundensteiner, 'Hierarchical Path Views: A Model Based on Fragmentation and Transportation Road Types,' In Proc. of the 3rd ACM Workshop on Geographic Information Systems, pp.93-100, 1995
- K. Ishikawa, M. Ogawa, S. Azume, and T. Ito, 'Map Navigation Software of the Electro Multivision of the '91 Toyota Soarer,' Int. Conf. on Vehicle Navigation and Information Systems (VNIS IVHS), IEEE, (1991) 463-473
- B. Liu, S. Choo, S. Lok, S. Leong, S. Lee, F. Poon, and H. Tan, 'Integrating Case-Based Reasoning, Knowledge-Based Approach and Dijkstra Algorithm for Route Finding,' Proc. Tenth Conf. Artificial Intelligence for Applicatons (CAIA '94), pp.149-155, 1994 https://doi.org/10.1109/CAIA.1994.323680
- J. Shapiro, J. Waxman, and D. Nir, 'Level Graphs and Approximate Shortest Path Algorithms,' In Networks, Vol. 22, pp.691-717, 1992 https://doi.org/10.1002/net.3230220707
- T. Yang, S. Shekhar, B. Hamidzadeh, and P. Hancock, 'Path Planning and Evaluation in IVHS Database,' IEEE Int'l Conf. on Vehicle Navigation and Information Systems(VNIS IVHS), pp.283-290, 1991
- N. Jing, Y. Huang, and E. Rundensteiner, 'Hierarchical Optimization of Optimal Path Finding for Transportation Applications,' In roc. of 5th Int'l Conf. on Information and Knowledge Management, pp.261-268, 1996 https://doi.org/10.1145/238355.238550
- N. Jing, Y. Huang, and E. Rundensteiner, 'Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation,' In IEEE Transactions on Knowledge and Data Engineering, Vol. 10, No. 3, pp.409-432, May/June 1998 https://doi.org/10.1109/69.687976
- R. Goldman, N. Shivakumar, S. Venkatasubramanian, and H. Gracia-Molina, 'Proximity Search in Databases,' In Proceedings of the 24th VLDB Conference, pp.26-37, 1998
- S. Shekhar, A. Fetterer, and B. Goyal, 'Materialization Trade-Offs in Hierarchical Shortest Path Algorithms,' In Proc.1997 Symposium on Spatial Databases, 1997
- W. McCormick Jr., P. Schweitzer, and T. White, 'Problem Decomposition and Data Reorganization by a Clustering Technique,' In Operation Research, Vol. 20, No. 5, pp.993-1009, 1972
- R. Lipton and R. Tarjan, 'Application of a planar seperator theorem,' In SIAM Journal on Computing, Vol. 9, No. 3, pp.615-627, 1980 https://doi.org/10.1137/0209046
- G. Miller, S. Teng, and S. Vavasis, 'A unified geometric approach to graph separators,' In Proceedings of 31st Annual Symposium on Foundations of Computer Science, pp.538-547, 1991 https://doi.org/10.1109/SFCS.1991.185417
- G. Miller, S. Teng, W. Thurston, and S. Vavasis, 'Automatic mesh partitioning,' In A. George, J. Gilbert, and J. Liu, editors, Sparse Matrix Computations: Graph Theory Issues and Algorithms, (An IMA Workshop Volume), Springer-Verlag, New York, 1993
- M. Houstma, P. Apers, and G. Schipper, 'Data Fragmentation for Parallel Transitive Closure Strategies,' In Proc. IEEE 9th Int'l Conference on Data Engineering, pp.447-456, 1993 https://doi.org/10.1109/ICDE.1993.344036
- D. Galperin, 'On the optimality of A*,' In Artificial Intelligence, Vol. 8, No. 1, pp.69-76, 1977 https://doi.org/10.1016/0004-3702(77)90005-4
- R. Agrawal and J. Kierman, 'An Access Structure for Generalized Transitive Closure Queries,' In Proc. IEEE Ninth Int'l Conf. on Data Engineering, pp.429-438, April, 1993 https://doi.org/10.1109/ICDE.1993.344038
- J. Banerjee, S. Kim, W. Kim, and J. Garza, 'Clustering a DAG for CAD Databases,' In IEEE Transaction on Software Engineering, Vol. 14, No. 11, pp.1684-1699, 1998 https://doi.org/10.1109/32.9055
- P. Larson and V. Deshpande, 'A File Structure Supporting Traversal Recursion,' In Proc. ACM-SIGMOD 1989 Int'l Conference on Management of Data, pp.243-252, 1989 https://doi.org/10.1145/66926.66949
- S. Shekhar and D. Liu, 'CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations,' In IEEE Transaction on Knowledge and Data Engineering, Vol. 9, No. 1, pp.102-119, 1997 https://doi.org/10.1109/69.567054
- S. Shekhar, A. Kohli, and M. Coyle, 'Path Computation Algorithms for Advanced Traveler Information System (ATIS),' In Proc. IEEE 9th Int'l Conf. Data engineering, pp.31-39, 1993 https://doi.org/10.1109/ICDE.1993.344080
- J. Pearl, In Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison Wesley, Reading, Mass., 1984
- Y. Huang, H. Jing, and E. Rundensteiner, 'Effective Graph Clustering for Path Queries in Digital Map Databases,' In Proc. 5th Int'l Conference on Information and Knowledge Management, pp.215-222, 1996 https://doi.org/10.1145/238355.238497
- T. Mohr and C. Pasche, 'A Parallel Shortest Path Algorithm,' Computing, Vol. 40, pp.281-292, 1988 https://doi.org/10.1007/BF02276912