Adapting prime number labeling scheme for directed acyclic graphs

  • Authors:

  • Gang Wu;Kuo Zhang;Can Liu;Juanzi Li

  • Affiliations:

  • Knowledge Engineering Lab, Department of Computer Science, Tsinghua University, Beijing, P.R. China;Knowledge Engineering Lab, Department of Computer Science, Tsinghua University, Beijing, P.R. China;Knowledge Engineering Lab, Department of Computer Science, Tsinghua University, Beijing, P.R. China;Knowledge Engineering Lab, Department of Computer Science, Tsinghua University, Beijing, P.R. China

  • Venue:
  • DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Directed Acyclic Graph(DAG) could be used for modeling subsumption hierarchies. Several labeling schemes have been proposed or tailored for indexing DAG in order to efficiently explore relationships in such hierarchy. However few of them can satisfy all the requirements in response time, space, and effect of updates simultaneously. In this paper, the prime number labeling scheme is extended for DAG. The scheme invests intrinsic mapping between integer divisibility and subsumption hierarchy, which simplifies the transitive closure computations and diminishes storage redundancy, as well as inherits the dynamic labeling ability from original scheme. Performance is further improved by introducing some optimization techniques. Our extensive experimental results show that prime number labeling scheme for DAG outperforms interval-based and prefix-based labeling schemes in most cases.