Decomposition Optimization for Minimizing Label Overflow in Prime Number Graph Labeling

スポンサーリンク

概要

• 論文の詳細を見る

• Recently, a graph labeling technique based on prime numbers has been suggested for reducing the costly transitive closure computations in RDF query languages. The suggested prime number graph labeling provides the benefit of fast query processing by a simple divisibility test of labels. However, it has an inherent problem that originates with the nature of prime numbers. Since each prime number must be used exclusively, labels can become significantly large. Therefore, in this paper, we introduce a novel optimization technique to effectively reduce the problem of label overflow. The suggested idea is based on graph decomposition. When label overflow occurs, the full graph is divided into several sub-graphs, and nodes in each sub-graph are separately labeled. Through experiments, we also analyze the effectiveness of the graph decomposition optimization, which is evaluated by the number of divisions.

著者

• KIM Jaehoon

  Dept. of Information Communication, Seoil University

• PARK Seog

  Dept. of Computer Science, Sogang University

関連論文

• Decomposition Optimization for Minimizing Label Overflow in Prime Number Graph Labeling
• An Access Control Model for the Adhocracy Organization Using RBAC(Special Section on Cryptography and Information Security)
• RDFacl : A Secure Access Control Model Based on RDF Triple
• An Efficient Bottom-up Filtering of XML Messages by Exploiting the Postfix Commonality of XPath Queries
• Decomposition Optimization for Minimizing Label Overflow in Prime Number Graph Labeling

スポンサーリンク