A Pragmatic Approach to Semantic Repositories Benchmarking

被引:0
作者
Thakker, Dhavalkumar [1 ,2 ]
Osman, Taha [1 ]
Gohil, Shakti [1 ]
Lakin, Phil [2 ]
机构
[1] Nottingham Trent Univ, Clifton Lane, Nottingham NG11 8NS, England
[2] Press Assoc, Nottingham, England
来源
SEMANTIC WEB: RESEARCH AND APPLICATIONS, PT 1, PROCEEDINGS | 2010年 / 6088卷
关键词
LINKED DATA; WEB;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The aim of this paper is to benchmark various semantic repositories in order to evaluate their deployment in a commercial image retrieval and browsing application. We adopt a two-phase approach for evaluating the target semantic repositories: analytical parameters such as query language and reasoning support are used to select the pool of the target repositories, and practical parameters such as load and query response times are used to select the best match to application requirements. In addition to utilising a widely accepted benchmark for OWL repositories (UOBM). we also use a real-life dataset from the target application, which provides us with the opportunity of consolidating our findings. A distinctive advantage of this benchmarking study is that the essential requirements for the target system such as the semantic expressivity and data scalability are clearly defined, which allows us to claim contribution to the benchmarking methodology for this class of applications.
引用
收藏
页码:379 / +
页数:3
相关论文
共 16 条
  • [1] [Anonymous], MEASURABLE TARGETS S
  • [2] Auer S., 2007, 2 AS SEM WEB C
  • [3] BIZER C, 2008, P ISWC WORKSH SCAL S
  • [4] Bock J, 2008, AREA2008 WORKSH ADV
  • [5] Broekstra J, 2002, LECT NOTES COMPUT SC, V2342, P54
  • [6] Ding Z., 2005, P AAAI 05 C O WORKSH
  • [7] Erling O., 2009, NETWORKED KNOWLEDGE, V221, P7, DOI [DOI 10.1007/978-3-642-02184-8_2, 10.1007/978-3-642-02184-8_2]
  • [8] Gardiner T., 2006, P 2006 INT WORKSH DE
  • [9] Guo YB, 2004, LECT NOTES COMPUT SC, V3298, P274
  • [10] Exploiting Linked Data to Build Web Applications
    Hausenblas, Michael
    [J]. IEEE INTERNET COMPUTING, 2009, 13 (04) : 68 - 73