Optimized index structures for querying RDF from the Web

被引：65

作者：

Harth, A ^{[1
]}

Decker, S ^{[1
]}

机构：

[1] Natl Univ Galway, DERI, Galway, Ireland

来源：

Third Latin American Web Congress, Proceedings | 2005年

关键词：

D O I：

10.1109/LAWEB.2005.25

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Storing and querying Resource Description Framework (RDF) data is one of the basic tasks within any Semantic Web application. A number of storage systems provide assistance for this task. However current RDF database systems do not use optimized indexes, which results in a poor performance behavior for querying RDF. In this paper we describe optimized index structures for RDF show how to process and evaluate queries based on the index structure, describe a lightweight adaptable implementation in Java, and provide a performance comparison with existing RDF databases.

引用

页码：71 / 80

页数：10

共 17 条

[1]

ALEXAKI S, 2001, P 2 INT WORKSH SEM W

[2]

[Anonymous], RDF PRIMER

[3] The, design and implementation of the Redland RDF application framework [J].

Beckett, D .

COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2002, 39 (05) :577-588

[4]

BERNERSLEE T, NOTATION, V3

[5]

Bertino E., 1991, Proceedings. Seventh International Conference on Data Engineering (Cat. No.91CH2968-6), P160, DOI 10.1109/ICDE.1991.131463

[6]

BROEKSTRA J, 2002, P 1 INT SEM WEB C IS, P54

[7] UBIQUITOUS B-TREE [J].

COMER, D .

COMPUTING SURVEYS, 1979, 11 (02) :121-137

[8]

Guha R. V., RDFDB RDF DATABASE

[9]

Guo YB, 2004, LECT NOTES COMPUT SC, V3298, P274

[10]

Hayes P., 2004, RDF semantics

← 1 2 →