Querying Communities in Relational Databases

— Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is specified by a set of l keywords, {k1, k2, · · · , kl}. It finds how the tuples that contain the keywords are connected in a relational database via the possible foreign key references. Conceptually, it is to find some structural information in a database graph, where nodes are tuples and edges are foreign key references. The existing work studied how to find connected trees for an l-keyword query. However, a tree may only show partial information about how those tuples that contain the keywords are connected. In this paper, we focus on finding communities for an l-keyword query. A community is an induced subgraph that contains all the l-keywords within a given distance. We propose new efficient algorithms to find all/top-k communities which consume small memory, for an l-keyword query. For topk l-keyword ...

• Type: Conference
• Year: 2009
• Where: ICDE
• Authors: Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao
• Keywords: Database, Foreign Key References, ICDE 2009, L-keyword Query, Relational Database