Computing relaxed answers on RDF databases

Hai Huang; Chengfei Liu; Xiaofang Zhou

doi:10.1007/978-3-540-85481-4_14

Computing relaxed answers on RDF databases

Hai Huang^*, Chengfei Liu, Xiaofang Zhou

^*Corresponding author for this work

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

25 Citations (Scopus)

Abstract

Database users may be frustrated by no answers returned when they pose a query on the database. In this paper, we study the problem of relaxing queries on RDF databases in order to acquire approximate answers. We address two problems for efficient query relaxation. First, to ensure the quality of answers, we compute the similarities of relaxed queries with regard to the original query and use them to score the potential relevant answers. We also propose the algorithm to get most relevant answers as soon as possible. Second, to optimise query relaxation process, we characterize a type of unnecessary relaxed queries which do not contribute to the final results and propose the method to prune them from the query relaxation graph. At last, we implement and experimentally evaluate our approach.

Original language	English
Title of host publication	Web Information Systems Engineering - WISE 2008 - 9th International Conference, Proceedings
Pages	163-175
Number of pages	13
DOIs	https://doi.org/10.1007/978-3-540-85481-4_14
Publication status	Published - 2008
Externally published	Yes
Event	9th International Conference on Web Information Systems Engineering, WISE 2008 - Auckland, New Zealand Duration: 1 Sept 2008 → 3 Sept 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5175 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th International Conference on Web Information Systems Engineering, WISE 2008
Country/Territory	New Zealand
City	Auckland
Period	1/09/08 → 3/09/08

Keywords

Query relaxation
RDF database
RDF query

Access to Document

10.1007/978-3-540-85481-4_14

Cite this

Huang, H., Liu, C., & Zhou, X. (2008). Computing relaxed answers on RDF databases. In Web Information Systems Engineering - WISE 2008 - 9th International Conference, Proceedings (pp. 163-175). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5175 LNCS). https://doi.org/10.1007/978-3-540-85481-4_14

@inproceedings{c3f5d9e92a504e9189d83405abdcb6da,

title = "Computing relaxed answers on RDF databases",

abstract = "Database users may be frustrated by no answers returned when they pose a query on the database. In this paper, we study the problem of relaxing queries on RDF databases in order to acquire approximate answers. We address two problems for efficient query relaxation. First, to ensure the quality of answers, we compute the similarities of relaxed queries with regard to the original query and use them to score the potential relevant answers. We also propose the algorithm to get most relevant answers as soon as possible. Second, to optimise query relaxation process, we characterize a type of unnecessary relaxed queries which do not contribute to the final results and propose the method to prune them from the query relaxation graph. At last, we implement and experimentally evaluate our approach.",

keywords = "Query relaxation, RDF database, RDF query",

author = "Hai Huang and Chengfei Liu and Xiaofang Zhou",

year = "2008",

doi = "10.1007/978-3-540-85481-4\_14",

language = "English",

isbn = "3540854800",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "163--175",

booktitle = "Web Information Systems Engineering - WISE 2008 - 9th International Conference, Proceedings",

note = "9th International Conference on Web Information Systems Engineering, WISE 2008 ; Conference date: 01-09-2008 Through 03-09-2008",

}

Huang, H, Liu, C & Zhou, X 2008, Computing relaxed answers on RDF databases. in Web Information Systems Engineering - WISE 2008 - 9th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5175 LNCS, pp. 163-175, 9th International Conference on Web Information Systems Engineering, WISE 2008, Auckland, New Zealand, 1/09/08. https://doi.org/10.1007/978-3-540-85481-4_14

Computing relaxed answers on RDF databases. / Huang, Hai; Liu, Chengfei; Zhou, Xiaofang.
Web Information Systems Engineering - WISE 2008 - 9th International Conference, Proceedings. 2008. p. 163-175 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5175 LNCS).

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

TY - GEN

T1 - Computing relaxed answers on RDF databases

AU - Huang, Hai

AU - Liu, Chengfei

AU - Zhou, Xiaofang

PY - 2008

Y1 - 2008

N2 - Database users may be frustrated by no answers returned when they pose a query on the database. In this paper, we study the problem of relaxing queries on RDF databases in order to acquire approximate answers. We address two problems for efficient query relaxation. First, to ensure the quality of answers, we compute the similarities of relaxed queries with regard to the original query and use them to score the potential relevant answers. We also propose the algorithm to get most relevant answers as soon as possible. Second, to optimise query relaxation process, we characterize a type of unnecessary relaxed queries which do not contribute to the final results and propose the method to prune them from the query relaxation graph. At last, we implement and experimentally evaluate our approach.

AB - Database users may be frustrated by no answers returned when they pose a query on the database. In this paper, we study the problem of relaxing queries on RDF databases in order to acquire approximate answers. We address two problems for efficient query relaxation. First, to ensure the quality of answers, we compute the similarities of relaxed queries with regard to the original query and use them to score the potential relevant answers. We also propose the algorithm to get most relevant answers as soon as possible. Second, to optimise query relaxation process, we characterize a type of unnecessary relaxed queries which do not contribute to the final results and propose the method to prune them from the query relaxation graph. At last, we implement and experimentally evaluate our approach.

KW - Query relaxation

KW - RDF database

KW - RDF query

UR - https://openalex.org/W1801077399

UR - https://www.scopus.com/pages/publications/52149121542

U2 - 10.1007/978-3-540-85481-4_14

DO - 10.1007/978-3-540-85481-4_14

M3 - Conference Paper published in a book

SN - 3540854800

SN - 9783540854807

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 163

EP - 175

BT - Web Information Systems Engineering - WISE 2008 - 9th International Conference, Proceedings

T2 - 9th International Conference on Web Information Systems Engineering, WISE 2008

Y2 - 1 September 2008 through 3 September 2008

ER -

Computing relaxed answers on RDF databases

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Cite this