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系统，提供分布式哈希表（DHT）的功能，已经提出。 这些系统极大地提高了P2P系统的可扩展性和精确匹配的准确性，但只提供精确匹配的查询功能。 该建议概述了一个研究议程，建立复杂的查询设施之上的这些基于DHT的P2P系统。 拟议的研究议程有三个明确的方向： 核心代数：探索一套核心代数的实现， 代数查询运算符，在P2P网络中的DHT上运行。 DHTAPI：确定最小的原语和函数集， 需要通过P2P网络来实现，以便高效地 支持查询操作符。 查询优化：P2P网络通常分布在缓慢的 网络链接，并可能受益于分布式数据库 优化，如使用半连接。 但目前尚不清楚 查询处理文献中的各种思想如何映射到 P2P上下文，特别是在使用DHT进行路由时， 查询处理 这项建议旨在研究费用和 在此环境中， 大型网络的模拟将用于研究互联网规模的拟议技术。