Check Swinburne's subscriptions for full text availabilitySearch Swinburne Research Bank
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/195689
- Title
- Approximating query answering on RDF databases
- Author(s)
- Huang, Hai; Liu, Chengfei; Zhou, Xiaofang
- 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 in efficient query relaxation. First, to ensure the quality of answers, we compute the similarities between relaxed queries with regard to the user query and use them to score the potential relevant answers. Second, for obtaining top-k answers, we develop two algorithms. One is based on the best-first strategy and relaxed queries are executed in the ranking order. The batch based algorithm executes the relaxed queries as a batch and avoids unnecessary execution cost. At last, we implement and experimentally evaluate our approaches.
- Publication type
- Journal article
- Research centre
- Swinburne University of Technology. Faculty of Information and Communication Technologies
- Source
- World Wide Web, Vol. 15, no. 1 (Jan 2012), pp. 89-114
- Publication year
- 2012
- FOR Code(s)
- 0805 Distributed Computing
- Keyword(s)
- Algorithms; Database applications; Intelligent web services; Queries; Query processing; RDF; RDF databases; Resource Description Framework; Semantic web
- Publisher
- Springer
- ISSN
- 1386-145X
- Publisher URL
- http://dx.doi.org/10.1007/s11280-011-0131-7
- Copyright
- Copyright © Springer Science+Business Media, LLC 2011.
- Research Projects
-
XML views of relational databases: semantics and update problems, Australian Research Council grant number DP878405
Effective and efficient keyword search for relevant entities over XML data, Australian Research Council grant number DP110102407
- Peer reviewed
