文献类型：期刊文献

英文题名：BSBM+: Extending BSBM to Evaluate Annotated RDF Features on Graph Databases

作者：Zhang, Le[1]; Ruan, Tong[1]; Wang, Haofen[2,3]; Xia, Yuhang[1]; Wang, Qi[1]; Xu, Dong[4]

机构：[1] East China University of Science and Technology, Shanghai, 200237, China; [2] Shenzhen Gowild Robotics Co. Ltd., Shenzhen, China; [3] Tianjin Key Laboratory of Cognitive Computing and Application, Tianjin, China; [4] North China Sea Marine Technical Support Center, SOA, Qingdao, 266033, China

年份：2017

卷号：784

起止页码：129

外文期刊名：Communications in Computer and Information Science

收录：EI(收录号：20181605011562)

语种：英文

外文关键词：Virtual storage - Graph Databases - Linked data - Query processing - Resource Description Framework (RDF)

摘要：Nowadays, more and more knowledge are published in form of RDF triples enriched with numerous types of annotations such as provenance, temporal and geospatial information. Due to the popularity of the ever-growing annotations, graph databases have proposed various storage engine to store these data and extended their query engine to support queries with these annotation constraints. The developers may be curious about the performance of different engines. Regarding the lack of such a benchmark, we develop the first benchmark for this purpose by extending BSBM (one of the most widely used graph database benchmark). We formalize the annotated RDF into a data model with well-defined categories of annotations and their corresponding operators to be supported. Then we extend the data set of BSBM to allow some triples to be annotated with one or more annotations. We further extend the query set to include annotation constraints in a given query, which can be seen as an extension of SPARQL query. We finally select several popular graph databases for benchmark. The experiment results show for each engine, it performs similarly when queried with different type of annotation constraints. No general database designs a special storage or query plan for a specific type of annotations. ? 2017, Springer Nature Singapore Pte Ltd.