高级检索

    面向高效复杂查询的常数度P2P系统构建技术

    A Construction Technique of Constant Degree P2P Systems towards Efficient Complex Queries

    • 摘要: 常数度P2P系统成为P2P领域的关注热点,但其研究主要集中于拓扑构建与维护,复杂查询研究及其支持优化技术相对较少.P2P系统高层特性很大程度上由底层拓扑决定,常数度拓扑的特点使得经典技术构建的常数度P2P系统数据局部性不佳,从而不支持高效复杂查询.针对这一不足提出了通用的面向高效复杂查询的构建技术,通过在数据层与DHT overlay间添加嵌入变换逻辑层,将拓扑结构信息引入构建过程以改善数据局部性,并采用此技术重构FissionE.分析与实验结果表明,新构建技术在不改变底层DHT的前提下有效确保数据局部性,减少查询综合开销,提高系统应用效率.

       

      Abstract: Constant degree peer-to-peer (P2P) system is turning into the P2P domain’s promising hotspot due to constant degree digraphs having good propertis. However, it is often hard to convert a stardard constant degree digraph to a DHT schema. Thus, most researches focus on DHT’s construction and maintenance, while leaving optimization and supporting to complex query behind. Underlying topology affects upper-layers’ character a lot. For constant degree P2P topologies, their inherent property makes a constant degree P2P system built using classical technique be poor in the data locality, and unfit for efficient, low-cost complex queries. Aiming at this shortage, a general-purpose construction technique towards efficient complex queries is proposed, which adds an embedding transformation layer between data layer and DHT overlay. In this way, adjacent data are stored in overlay’s adjacent peers and the data locality is improved, so that the number of peers referred in complex queries can be minimized with a limited time overhead. To validate this technology, the first constant degree P2P system based on Kautz digraph FissionE is reconstructed as a typical example, which includes re-allocating of resources, query algorithm and locality maintenance strategies. Experimental results show that this construction technique can ensure data locality, reduce query cost and lead to systems’ efficiency without changing the underlying DHT layer.

       

    /

    返回文章
    返回