RDF Subgraph Matching by Means of Star Decomposition,ERICDATA高等教育知識庫
高等教育出版
熱門: 崔雪娟  王美玲  李明昆  王善边  黃昱倫  黃乃熒  
高等教育出版
首頁 臺灣期刊   學校系所   學協會   民間出版   大陸/海外期刊   政府機關   學校系所   學協會   民間出版   DOI註冊服務
篇名
RDF Subgraph Matching by Means of Star Decomposition
並列篇名
RDF Subgraph Matching by Means of Star Decomposition
作者 Mingyan WangQingrong HuangNan WuYing Pan
英文摘要

With the continuous development of the network, the scale of RDF data is becoming larger and larger. In the face of large-scale RDF data processing, the traditional database query method has been unable to meet the needs. Due to the limited characteristics of subgraph matching, most existing algorithms often have the phenomenon that many subgraphs are repeatedly traversed during the query process, resulting in a large number of intermediate result sets and low query efficiency. The core problem to be solved is how to efficiently match subgraphs. In order to improve the query efficiency of RDF subgraphs in massive RDF data graphs and solve the problem of repeated calculation of some graphs in the query process of RDF subgraphs, an RDF subgraph query algorithm based on star decomposition is proposed in this paper. The algorithm uses graph structure to decompose RDF subgraphs into stars and uses a custom node cost model to calculate the query order of the star subgraphs. By decomposing, the amount of communication among subgraphs is reduced, and the communication cost for query processing is lowered. Moreover, utilizing the query order for RDF subgraph matching can effectively reduce the generation of intermediate result sets and accelerate the efficiency of subgraph matching. On this basis, the performances of the proposed algorithm and several other widely used algorithms are compared and analyzed on two different datasets. Experiments show that the proposed algorithm has better advantages in database recreation, memory size, and execution efficiency.

 

起訖頁 1613-1621
關鍵詞 RDF querySubgraph matchingSubgraph querySearch problemsStar decomposition
刊名 網際網路技術學刊  
期數 202212 (23:7期)
出版單位 台灣學術網路管理委員會
DOI 10.53106/160792642022122307015   複製DOI
QR Code
該期刊
上一篇
PyRS: Cross-platform Data Fault-tolerant Storage Library Based on RS Erasure Code
該期刊
下一篇
Improved Whale Optimization Algorithm via the Inertia Weight Method Based on the Cosine Function

高等教育知識庫  閱讀計畫  教育研究月刊  新書優惠  

教師服務
合作出版
期刊徵稿
聯絡高教
高教FB
讀者服務
圖書目錄
教育期刊
訂購服務
活動訊息
數位服務
高等教育知識庫
國際資料庫收錄
投審稿系統
DOI註冊
線上購買
高點網路書店 
元照網路書店
博客來網路書店
教育資源
教育網站
國際教育網站
關於高教
高教簡介
出版授權
合作單位
知識達 知識達 知識達 知識達 知識達 知識達
版權所有‧轉載必究 Copyright2011 高等教育文化事業股份有限公司  All Rights Reserved
服務信箱:edubook@edubook.com.tw 台北市館前路 26 號 6 樓 Tel:+886-2-23885899 Fax:+886-2-23892500