http://dx.doi.org/10.1109/ICPADS.2009.133">
 

Document Type

Conference Paper

Department/Unit

Department of Computer Science

Title

Towards keyword search over relational databases in DHT networks

Language

English

Abstract

Recent research has shown that keyword search is a friendly and potentially effective way to retrieve information of interest over relational databases. Existing work has generally focused on implementing keyword search in centralized databases. This paper addresses keyword search over distributed databases. We adopts distributed hash tables (DHTs) - a peer-to-peer inspired overlay network technology - as the infrastructure to implement keyword search over relational databases. For this end, we combine IR-based ranking techniques with a P2P-based indexing strategy, and propose an effective approach. Extensive experiments over real-world datasets show that our approach is effective and efficient. © 2009 IEEE.

Keywords

Distributed hash tables, Keyword searching, Peer-to-peer networks, Relational databases

Publication Date

2009

Source Publication Title

Proceedings of the 15th International Conference on Parallel and Distributed Systems

Start Page

448

End Page

455

Conference Location

Shenzhen, China

Publisher

IEEE

ISBN (print)

9781424457885

This document is currently not available here.

Share

COinS