Computing relaxed answers on RDF databases

Huang, Hai, Liu, Chengei and Zhou, Xiaofang (2008). Computing relaxed answers on RDF databases. In: James Bailey, David Maier, Klaus-Dieter Schewe, Bernhard Thalheim and Sean Wang, Web Information Systems Engineering - WISE 2008 - 9th International Conference, Proceedings. 9th International Conference on Web Information Systems Engineering, WISE 2008, Auckland, New Zealand, (163-175). 01 - 03 September 2008. doi:10.1007/978-3-540-85481-4_14


Author Huang, Hai
Liu, Chengei
Zhou, Xiaofang
Title of paper Computing relaxed answers on RDF databases
Conference name 9th International Conference on Web Information Systems Engineering, WISE 2008
Conference location Auckland, New Zealand
Conference dates 01 - 03 September 2008
Proceedings title Web Information Systems Engineering - WISE 2008 - 9th International Conference, Proceedings   Check publisher's open access policy
Journal name Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   Check publisher's open access policy
Place of Publication Heidelberg, Germany
Publisher Springer
Publication Year 2008
Year available 2008
Sub-type Fully published paper
DOI 10.1007/978-3-540-85481-4_14
Open Access Status
ISBN 3540854800
9783540854807
ISSN 0302-9743
Editor James Bailey
David Maier
Klaus-Dieter Schewe
Bernhard Thalheim
Sean Wang
Volume 5175 LNCS
Start page 163
End page 175
Total pages 13
Collection year 2009
Language eng
Abstract/Summary 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.
Subjects 1700 Computer Science
2614 Theoretical Computer Science
Keyword Query relaxation
RDF database
RDF query
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status UQ

 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 4 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Wed, 27 Nov 2013, 01:43:57 EST by System User on behalf of School of Information Technol and Elec Engineering