Practical and effective IR-style keyword search over semantic web

Xiaomin Ning; Hai Jin; Weijia Jia; Pingpeng Yuan

doi:10.1016/j.ipm.2008.12.005

Practical and effective IR-style keyword search over semantic web

Xiaomin Ning, Hai Jin, Weijia Jia, Pingpeng Yuan

Department of Computer Science

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

25 Citations (Scopus)

Abstract

This paper presents a novel IR-style keyword search model for semantic web data retrieval, distinguished from current retrieval methods. In this model, an answer to a keyword query is a connected subgraph that contains all the query keywords. In addition, the answer is minimal because any proper subgraph can not be an answer to the query. We provide an approximation algorithm to retrieve these answers efficiently. A special ranking strategy is also proposed so that answers can be appropriately ordered. The experimental results over real datasets show that our model outperforms existing possible solutions with respect to effectiveness and efficiency. © 2009 Elsevier Ltd. All rights reserved.

Original language	English
Pages (from-to)	263-271
Journal	Information Processing and Management
Volume	45
Issue number	2
DOIs	https://doi.org/10.1016/j.ipm.2008.12.005
Publication status	Published - Mar 2009

Research Keywords

Group Steiner tree
Keyword search
RDF graph
Top-K

Access Output

10.1016/j.ipm.2008.12.005

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{7f8b0714ae8a47c09ec10063d26a1230,

title = "Practical and effective IR-style keyword search over semantic web",

abstract = "This paper presents a novel IR-style keyword search model for semantic web data retrieval, distinguished from current retrieval methods. In this model, an answer to a keyword query is a connected subgraph that contains all the query keywords. In addition, the answer is minimal because any proper subgraph can not be an answer to the query. We provide an approximation algorithm to retrieve these answers efficiently. A special ranking strategy is also proposed so that answers can be appropriately ordered. The experimental results over real datasets show that our model outperforms existing possible solutions with respect to effectiveness and efficiency. {\textcopyright} 2009 Elsevier Ltd. All rights reserved.",

keywords = "Group Steiner tree, Keyword search, RDF graph, Top-K",

author = "Xiaomin Ning and Hai Jin and Weijia Jia and Pingpeng Yuan",

year = "2009",

month = mar,

doi = "10.1016/j.ipm.2008.12.005",

language = "English",

volume = "45",

pages = "263--271",

journal = "Information Processing and Management",

issn = "0306-4573",

publisher = "Elsevier Ltd.",

number = "2",

}

TY - JOUR

T1 - Practical and effective IR-style keyword search over semantic web

AU - Ning, Xiaomin

AU - Jin, Hai

AU - Jia, Weijia

AU - Yuan, Pingpeng

PY - 2009/3

Y1 - 2009/3

N2 - This paper presents a novel IR-style keyword search model for semantic web data retrieval, distinguished from current retrieval methods. In this model, an answer to a keyword query is a connected subgraph that contains all the query keywords. In addition, the answer is minimal because any proper subgraph can not be an answer to the query. We provide an approximation algorithm to retrieve these answers efficiently. A special ranking strategy is also proposed so that answers can be appropriately ordered. The experimental results over real datasets show that our model outperforms existing possible solutions with respect to effectiveness and efficiency. © 2009 Elsevier Ltd. All rights reserved.

AB - This paper presents a novel IR-style keyword search model for semantic web data retrieval, distinguished from current retrieval methods. In this model, an answer to a keyword query is a connected subgraph that contains all the query keywords. In addition, the answer is minimal because any proper subgraph can not be an answer to the query. We provide an approximation algorithm to retrieve these answers efficiently. A special ranking strategy is also proposed so that answers can be appropriately ordered. The experimental results over real datasets show that our model outperforms existing possible solutions with respect to effectiveness and efficiency. © 2009 Elsevier Ltd. All rights reserved.

KW - Group Steiner tree

KW - Keyword search

KW - RDF graph

KW - Top-K

UR - http://www.scopus.com/inward/record.url?scp=60549089531&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-60549089531&origin=recordpage

U2 - 10.1016/j.ipm.2008.12.005

DO - 10.1016/j.ipm.2008.12.005

M3 - RGC 21 - Publication in refereed journal

SN - 0306-4573

VL - 45

SP - 263

EP - 271

JO - Information Processing and Management

JF - Information Processing and Management

IS - 2

ER -

Practical and effective IR-style keyword search over semantic web

Abstract

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this