Towards keyword search over relational databases in DHT networks

Jian Yu*, Jihong Guan, Jianliang XU, Shuigeng Zhou

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationICPADS '09 - 15th International Conference on Parallel and Distributed Systems
Pages448-455
Number of pages8
DOIs
Publication statusPublished - 2009
Event15th International Conference on Parallel and Distributed Systems, ICPADS '09 - Shenzhen, Guangdong, China
Duration: 8 Dec 200911 Dec 2009

Publication series

NameProceedings of the International Conference on Parallel and Distributed Systems - ICPADS
ISSN (Print)1521-9097

Conference

Conference15th International Conference on Parallel and Distributed Systems, ICPADS '09
Country/TerritoryChina
CityShenzhen, Guangdong
Period8/12/0911/12/09

Scopus Subject Areas

  • Hardware and Architecture

User-Defined Keywords

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

Fingerprint

Dive into the research topics of 'Towards keyword search over relational databases in DHT networks'. Together they form a unique fingerprint.

Cite this