Efficient Peer-to-Peer Keyword SearchUsing Adaptive Space Partition
碩士 === 國立臺灣大學 === 資訊管理學研究所 === 92 === Locating the node that stores a particular data item is a fundamental problem in peer-topeer systems and is traditionally formulated as the construction of a distributed hash table (DHT). Typical DHTs support only a simple map from keys to values, but not keywor...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/38353603608100585374 |