17th International Workshop on Database and Expert Systems Applications (DEXA'06) (2006)
Sept. 4, 2006 to Sept. 8, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DEXA.2006.110
Zhigang Chen , Shanghai Second Polytechinc University, China
Zhongding Huang , Shanghai Second Polytechinc University, China
Bo Ling , China Executive Leadership Academy, Pudong, China
Jiang Li , China Executive Leadership Academy, Pudong, China
Query-by-keywords is the most popular manner to search for data in this computing age. However, most work was proposed for searching centralized relational databases. This paper investigates how keyword search to be deployed in Relational database-enabled peer-to-peer systems. Unlike centralized system, the key challenges in this new computing paradigm come from the autonomy of peers, the lack of a global schema, and the dynamics of the peer connectivity. First, the concept of P2P-Join is proposed, which is a join operation to combine tuples among relations from different peers containing certain keywords in the query. Second, a fully distributed framework to realize P2P-Join processing is devised, which not only inherits the syntax and semantics of traditional join but also cherishes the ideology of peer-to-peer computing. Finally, two mechanisms are proposed to improve the performance of the operation: a join path selecting order scheme and a pushbased load balancing mechanism across peers.
B. Ling, J. Li, Z. Chen and Z. Huang, "P2P-Join: A Keyword Based Join Operation in Relational Database Enabled Peer-to-Peer Systems," 17th International Workshop on Database and Expert Systems Applications (DEXA'06)(DEXA), Krakow, Poland, 2006, pp. 637-641.