Department of Computer Science
Towards keyword search over relational databases in DHT networks
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.
Distributed hash tables, Keyword searching, Peer-to-peer networks, Relational databases
Source Publication Title
Proceedings of the 15th International Conference on Parallel and Distributed Systems
Link to Publisher's Edition
Yu, J., Guan, J., Xu, J., & Zhou, S. (2009). Towards keyword search over relational databases in DHT networks. Proceedings of the 15th International Conference on Parallel and Distributed Systems, 448-455. https://doi.org/10.1109/ICPADS.2009.133