Efficient Evaluation of Path Expressions Using Connectivity of Nodes


The KIPS Transactions:PartD, Vol. 9, No. 3, pp. 337-344, Jun. 2002
10.3745/KIPSTD.2002.9.3.337,   PDF Download:

Abstract

Recently, there has been a lot of research on graph-type data because it can model seamless the application domains such as GIS, network, WWW, multimedia presentations etc., and domain in which the data sequence is important. In this paper, an efficient code system, called node code system, is proposed to evaluate paths of DAG in a multimedia presentation graph. The node code system assigns a unique binary string to each node of a graph. The comparison of node codes of two nodes tells the connectivity between the nodes without actual traversal of a graph. The method using the property of the node code system allows us to construct the paths between two nodes more efficiently than the method using conventional graph traversals. The algorithms to construct paths using the node code system are provided.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
T. K. Lee, "Efficient Evaluation of Path Expressions Using Connectivity of Nodes," The KIPS Transactions:PartD, vol. 9, no. 3, pp. 337-344, 2002. DOI: 10.3745/KIPSTD.2002.9.3.337.

[ACM Style]
Tae Kyong Lee. 2002. Efficient Evaluation of Path Expressions Using Connectivity of Nodes. The KIPS Transactions:PartD, 9, 3, (2002), 337-344. DOI: 10.3745/KIPSTD.2002.9.3.337.