Query Processing in Structured Peer-to-Peer Networks

结构化对等网络中的查询处理

• 批准号: 0209108
• 负责人: Ion Stoica
• 金额: $ 17.98万
• 依托单位: University of California-Berkeley
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2002
• 资助国家: 美国
• 起止时间: 2002-08-01 至 2005-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0209108&HistoricalAwards=false
• 关键词: Query; Processing; Structured; Peer; Networks

Recently a new generation of P2P systems, offering distributed hashtable (DHT) functionality, have been proposed. These systems greatlyimprove the scalability and exact-match accuracy of P2P systems, butoffer only the exact-match query facility. This proposal outlines aresearch agenda for building complex query facilities on top of theseDHT-based P2P systems. There are three defining directions of theproposed research agenda: Core Algebra: Explore the implementation of a core set of algebraic query operators that run over DHTs in a P2P network. DHT APIs: Identify the minimum set of primitives and functions that need to be implemented by a P2P network in order to efficiently support the query operators. Query Optimization: P2P networks are often distributed across slow network links, and may benefit from distributed database optimizations like the use of semi-joins. However, it is not clear how the various ideas in the query processing literature map into the P2P context, particularly when using DHTs for routing during query processing. This proposal intends to study the costs and tradeoffs of various alternatives for the query plan space in this context.Simulation of large networks will be used to study the proposedtechniques at Internet scale.

最近，已经提出了新一代的P2P系统，提供分布式的Hashtable（DHT）功能。 这些系统极大地破解了P2P系统的可扩展性和精确匹配精度，但仅配备了确切的匹配查询设施。 该提案概述了Aresearch议程，用于在基于这些的P2P系统的顶部建立复杂的查询设施。 规定研究议程的三个定义方向：核心代数：探索在P2P网络中通过DHTS运行的代数查询运算符的实现。 DHT API：确定需要由P2P网络实现的最小原始和功能集，以便有效地支持查询运营商。 查询优化：P2P网络通常分布在慢速网络链接上，并且可能会受益于分布式数据库优化（例如使用半加入）。 但是，尚不清楚查询处理文献中的各种思想如何映射到P2P上下文中，尤其是在查询处理过程中使用DHT进行路由时。 该提案旨在在这种情况下研究查询计划空间的各种替代方案的成本和权衡。大型网络的构图将用于在互联网规模上研究拟议技术。