CAJ | 학술논문

数据库领域越来越多的数据通过图的结构进行存储，随着图数据规模的快速增长和云计算的兴起，数据拥有者希望将数据外包给具有强大计算能力的服务商为其客户提供查询服务。为解决数据库中的可达性查询问题，提出一种隐私保护的可达性索引和查询方法。对原始的2-hop索引构建方法进行优化，设计maxISCover启发式方法，给出根据人工节点添加算法建立pp-2-hop索引的unifyIS和unifyLS算法，并在此基础上，给出基于密文域的优化可达性查询方法。实验结果表明，基于maxISCover优化方法和unifyIS算法建立的索引大小相比于基于原始2-hop索引的方法减小1个~2个数量级。
수거고영역월래월다적수거통과도적결구진행존저，수착도수거규모적쾌속증장화운계산적흥기，수거옹유자희망장수거외포급구유강대계산능력적복무상위기객호제공사순복무。위해결수거고중적가체성사순문제，제출일충은사보호적가체성색인화사순방법。대원시적2-hop색인구건방법진행우화，설계maxISCover계발식방법，급출근거인공절점첨가산법건립pp-2-hop색인적unifyIS화unifyLS산법，병재차기출상，급출기우밀문역적우화가체성사순방법。실험결과표명，기우maxISCover우화방법화unifyIS산법건립적색인대소상비우기우원시2-hop색인적방법감소1개~2개수량급。
Due to the massive volume of graph data from a wide range of recent applications and unprecedented graph data growth,it is becoming economically appealing for data owners to outsource their data to a powerful Service Provider ( SP) ,such as a cloud computing platform,which provides high computational query services. This paper studies a novel privacy preserving 2-hop index and query algorithm for a fundamental query for graphs namely the reachability query. It optimizes the existing method for building 2-hop index, proposes one optimizing method ( maxISCover ) , and two algorithms(unifyIS and unifyLS) to build privacy preserving 2-hop(pp-2-hop) index by adding some surrogate nodes, and raises up an optimized query processing algorithm based on pp-2-hop index. Experimental results show that the index size of this algorithm based on maxISCover optimization method and the unifyIS is reduced by 1~2 orders of magnitude, compared with the method based on the original 2-hop.