Efficient DAG Reachability Query Processing Using Nested Intervals
碩士 === 國立嘉義大學 === 資訊工程學系研究所 === 94 === Testing reachability between nodes in a graph is a frequently asked query in many applications that would be modeled using directed acyclic graph (DAG). In order to support efficient reachability testing on DAGs, this thesis devises a new encoding scheme to rec...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/56286192475447326635 |