Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
Add to Favorite Get Latest Update

Hierarchical Encoding of Optimal Path and Its Retrieval

WU Jing JING Ning CHEN Hong Sheng(Department of Electrical Engineering, National University of Defense Technology, Changsha 410073)  
Efficient path query processing is a key requirement for advanced applications including GIS (Geographic Information Systems), navigation systems, and computer networks. The author investigates the best path query algorithm in the context of networks with large number of nodes and links, such as transportation networks and computer networks. To guarantee efficient response for best path queries, this paper employs a path view materialization strategy for pre computing and store the best paths, proposes the HEPV (Hierarchical Encoded Path View) approach, gives the optimality theorem of path retrieval over HEPV, as well as proposes best path retrieval algorithm.
【CateGory Index】: TP301
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved