OWLIM - A Pragmatic OWL Semantic repository

50 %
50 %
Information about OWLIM - A Pragmatic OWL Semantic repository
Technology

Published on July 8, 2009

Author: ontotext

Source: slideshare.net

! " #

#( $ %# & $ ' !" #$ % &' ' % !" ( ) # * + , ( +- & . # /- /- " -!" ' - # !& $ !" !" 12 ) 0

& * % !" ()( % & & % # + & ( #$ % & &1% & $ # % '- # + $ ( ( + ,# $ ( ( 3! *)4 & & + # ! 5) + # !" ' $ %& & , 5& $ #( ( *( #( * %( % %- # 6# !" 12 ) 07

# , ( %$ & <C1,rdfs:subClassOf,C2> <C2,rdfs:subClassOf,C3> <C1,rdfs:subClassOf,C3> <I,rdf:type,C1> <C1,rdfs:subClassOf,C2> <I,rdf:type,C2> <I1,P1,I2> <P1,rdfs:range,C2> <I2,rdf:type,C2> <P1,owl:inverseOf,P2> <I1,P1,I2> <I2,P2,I1> <P1,rdf:type,owl:SymmetricProperty> <P1,owl:inverseOf,P1> !" 12 ) 08

0 $ ' !" # # + 3 * 4 # !" $ 5' 9 '9 5' 9 : . ( '9 % # / ( ( / 5' 9 . '9 6 ; + 5' 9 & '9 # !" 5' 9 '9 & & !' ! 6< # # % #% . !" $ % +, -+ , & & & % $/ # 5& &! +9 %& # 3 = =5 - (# 4 -+ , & & & *)< # * & #$ $ + !" 12 ) 0>

!. /! / $ % ! $ ' # " $/ 0 ( # ( /% * *) $ ' . // $ / !" 12 ) 0?

#( !" 1 ! 2 * ' # !* !" #$ % &' ' % !" ( ) # * + , ( +- & . # /- /- " -!" ' - # !& $ !" !" 12 ) 0@

3& $ ' %, $ ' 5% # !" , 3& $ ' , $ ' - & 5' 9 '9 & & # # 3 1 # =4 5& + # 5& # *) + 6 ; + 3& . #4 +& # # % !" 6 # %# 4 %% 9 # + 6 3 = =4 -!" & # 5( # &% 5 6# A + #B ; + # &$ & % ## + ; # !" 12 ) 0

3& $ ' %, $ $ ' $ # $ % & (# $ % & ! "! " "' " "' " ! " # $ ) * &+ ) +, " "- %& ' " . + " "/ 0 /1 2 " " 3 4 5 , 66 3 ' " ' " " % + " " !" 12 ) 0C

7 %" ! 8! 9 # &3 24 6 &' 1# A D E ' # 1 & * % & %& # ' & ) A *' &# ' ; + 3"7( #=4 (# & ) A *' ; 2 # = & 6 &# ' #% . 23 & # F 6G 4 ) A *' # # #< & # #B # H= !" 12 ) 0H

$ 1 ' %* # ' # %( * # % + # # & $) # $ ),)- 7 + + + ,3 . 8 / % +3" " 5 3 " ' " 9 )- 7 + ! ! . " " % - ,3 : "- ' " ; .)- 7 ! ! + ,3 <= 3 5 3 ) 0 > / " .)- 7 ! ! ! 4 % - 0 > / ' !" 12 ) 0HH

# % & % !" && I : ( ( # . ) 37 1$ 4 ( 0 ' , # >@ J =K = -!" & ()( I # : )( ( # ; ) : * % &; + + 5 & % & 3 + #. & + ; + % $ $ & . ,14 # # 6 + & + # B / 3 . - 4 &3 = % &D H . L 4 # B & = - / 3 >. - 4 @8 &= 5& + % & # & # B $ H- = & <)( ( / 3> . - 4 8 & !" 12 ) 0H

() $ & ( ' =$ %# 5& # & 6 & % & # $ & B & & # 6+ & + $ & & $ 5& # & /- / !" ! *( 9 ' * - % 1 & # B 5& # 6+ & & & + & / )! '5 # && + & /- 5& / 3> . - 4 !" @- & # $ + & & !" 12 ) 0H7

() $ & ( ' -$ $ B ( % ( " 3$ $ 4 ! ! $ # ' LUBM PIKB LUBM(8000) UniProt LUBM(20000) (1000) # # $ % & % " ' ( ! ) * +, - .'- + . ) / 0. ) 1'2+3 4 !" 12 ) 0H8

$ ' 0 -!" 1 (& ( + 1 # # # * M 1 J # % !" $ + " . > / 9 2*59 & # 61# # !" # + ?' $ J # & # ! 6 . , % $ !" 5-( & # ' 3 4 !" # !" # & H 9 & !" 12 ) 0H>

#( !" $& % # # !" #$ % &' ' % !" ( ) # * + , ( +- & . # /- /- " -!" ' - # !& $ !" !" 12 ) 0H?

- N O >P O O Q ( #$ = = ' ) ! % &' " , # $ +( # 6+ = ) = "( >= / ( , # ' &$ ' & & B 1 "& &# + $ + O '19 # & F $ G # 6+ $ + & 1$ ! # " 6 = @ ( % & & , 2 $+ ! " ) & 1 * + # $ % &' 3 # 1# 4 96 & ' 3 4 # $ & & + !" 12 ) 0H@

7A 5 * ' ( @ *( #( "' ! K " " & $ B ' /:: ! O " K + 5 !" 1KO !" ) * # ! ( !" 12 ) 0H

# %) $ ' 5& #( # % % & $ % 8 # , 3( & # 6 3 & 6 4R 3( # & N O >P , & / $ - & . # + R # % % & ! 15 + " "* 19 < 7 %& & ' 3 4 # R ' %& + = 5& ( * # % % & K #B &' !" # #( $ 3 S 6# 4 5& % + + # % &$ & & # 6 + # !" 12 ) 0HC

* # 5& ' 3 4 # N + O 8P 96 # 1 # + % & & # # ! #B F G' $ $ # = & # , # F G' 6# 6 R – <X,rdf:type,rdf:Resource> <P,rdf:type,rdf:Property> # $ $ R ' ,# & & =" & ' : , / $ - & .; # + J 3 & )! ' 5! +% . 4 + 5& #B %& :# + = !" 12 ) 0

# " & %1# 6 !" # !" # , , 5& & # # # ! 5& # !" 9 = = 3# K 6 # 4( +% & & H #!" , 5& # # # + + & + # = 3( C #( 9 ) 5& 1 = 5& % !, J 1 3 # 4R ) . & % = * & # # # F" 5 ! G +3 $ Q / & $ 4 !" 12 ) 0 H

# $ $ ' # % & & % #B & !" 1 %1# 6 %1& , %,( $ $1 3( =. 5& #B & # & # D$ % ! &= ! 3( =. E # 5& 6 + %, # * 5& #B & # & # D$ 3( ! = !E $ # "& ' : & 1 # # & # F #B G & # 1 % = ( .& + # & # !" 12 ) 0

# # 5& 3( # !" ( - , ! 1# 6 % + & & & T1 # O $ !" & & + T + 1 # &' # 3 T4 !" 3 %1# 6 4 =!" ), !" # !" & ' # %& ) & 1 !" 3 %1# 6 4 =!" , !" & ' # %& !" # # # !" # ! 1 " = = %,& !" 12 ) 0 7

0 . / / / - &!" !' ! 6< 5' 9 '9 ; + 5' 9 : 5 '9 ' ' 9 # 9 5' 9 # '9 # / ( %&6 , F G 1 ; + 5' 9 '9 # & 3 % F # B G 5& F G # * $# & & & $F # G 5& & + % ; ; + # 1 ; + $ #B & '- !" 12 ) 0 8

#( !" !" #$ % &' ' 3& $ ' ( ) # * + , ( +- & . # /- /- " -!" ' - # !& $ !" !" 12 ) 0 >

3& $ '= % % !" & % 5' 9 '9 # %6# 5( # - & & $1 . 1 ( #$ % & ()( 1 & #( %! 5 (6 !# 5( # & J- % !" & & & H # # L> 1% &)( & @ # / 3> - 4 # !" 12 ) 0 ?

3& $ '= % !" =C=6 , 5& & + $ . ' 15 B ; F G # & $ . . % & $ % !" 7= , - + & # * % B 3 # $ -!" 4 !" 12 ) 0 @

$ ' $& !" $ + 3 * 4 *% ) 3 =H= =6 - 4= , #< # ## + = # ; + 3'A 'A ' 4 A # 6 # 3' K U 15 74 7= # $ %& # = !" 12 ) 0

& # 3& $ 9F ' 9 & # = , & 15 +% & #( , # & # ( *, % & K #B & ' % 4, % ## + # 5, % & K & #B $ . % & F G !" 12 ) 0 C

3& $ ' & #( & # $ %& # 'G ( & # = H& ( 3 = = & & + 4 ' 1 K# , 3( ( *H # 6 B, > 1 ' 3?8 - ' R H? $ * + + 4 5 H& ( 5& !" % & & & # + & #< # 1# # + * (, H #R ' 1 K# , * ( * H& ( !" 12 ) 07

#( !" !" #$ % &' ' % !" ( ) # * + , , + /- /- " -!" ' - # !& $ !" !" 12 ) 07H

& / ( 5 # & # / # + ! (% ? 01 + # # 2 7 . " 7@ 7 A9 7 C< # % $ + " / << B B+% "' "1 B , 7 " ' ' B+% D< 1 % - EB 64 . ) 0 < ;7 7 A9 C< # 8 "& 8 ?0 << B & ), 0 DF ; C< # . & A9 8 ?0 < < 7( # )3 0 % A9 @ C< # ) % & > 7G 8 ?0 << 7 !" 12 ) 07

, + 5& + #( %3 )# + ( , +3) ! ' 5! 4 . % $ & # J < " J % - R % & # + & + $ $ : + = $ (+ , & . 3 #+ & # & "J 4 - 5 +& B F G & + R 7 %& & & B R 5& % +"J- 6 %& *) . 1 # = * ; 3 ' 4 A & &H 3= = & %H . # 4= !" 12 ) 077

( , + &H 5& # B ) =C # & %& & B & + %, HC = H=> =R 7H = => =R 87 = 7=> = * $ 6 & & % & , 5& + %R %( 3 ( (% & $ H = & %# # & + = !" 12 ) 078

$ ' & =0( % %$ & 200 4cOpt12g 180 Upload speed (1000 st./sec) Pdc1.6g 160 Piv0.9g 140 PM0.7g 120 100 80 60 40 20 0 1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 Size of repository (millions of explicit statements) !" 12 ) 07>

, += ( % & !" # ( ( & . & % , • % # 6 # 3 =4 $ & $ .# A < 7 % &H2- ' R * • 2 H 2- '* & 38 ! H 4 & I • * 6 & ?81$ Q ; $ # ## + • & 6 %+ & J +7 # # & % :9J = / 3 4K ? B 9 % % F %G + & B & + 8 ! H $ H> J =K DH =R % H J =K +% &> = !" 12 ) 07?

$ ' & =8# 3 160 4cOpt12g Evaluatoin Time Q1 (msec) 140 Pdc1.6g 120 Piv0.9g 100 PM0.7g 80 60 40 20 0 1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 Size of repository (m illions of explicit statements) AH, ) HH # 1 6 # # 5& ; + # # !" 12 ) 07@

$ ' & =8# 3 $ $ 4000 4cOpt12g 3500 sec) Pdc1.6g Evaluatoin Time Q2 (m 3000 Piv0.9g 2500 PM0.7g 2000 1500 1000 500 0 1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 41 43 45 47 49 Size of re pository (millions of explicit statements) A ,) H # 1 J F6BG 9 T +T % & & % +% & & + 5& ; + # % + !" 12 ) 07

#( !" !" #$ % &' ' % !" ( ) # * + , ( +- & . # 0 '! 0 '! , , % -!" ' - # !& $ !" !" 12 ) 07C

. 0 ', , + 5& 0 5 , +3 / 4 - !" +$ & . # , =B 3 9 B 9( 9 %B # 2 B# B () +& + ! 6 !" + F + B G 5& # 6+ % & ! O " R $+ !" ) 5& H8 ; & . ; + 5& $ $ 0 ' , ! & 4 J9 ' 9 *$ ? -+ $ H ' K U !" 12 ) 08

3& $ #% ' 0 ', , + 3& $ ( % 0 ' ' , ! 9 ) +, ! *( 9HH & & ' $ $ & + #% && % &; + R # = % ! " 0 'J , ! 5 3# & 8 ! H 4 D ?> # = *$ ?2- H 2- 15 + !" 12 ) 08H

$ ' & ( # % 0 ' , ! % & & , ) & ' K U R & & & % 1 & # B = 5& # +%& & 1 !" ' R ) 3 % & 4 & 5& ) & # 3: L 4, & 8 ! 8 , 6 ! @ RH 2- ' R * ?81$ Q JH=>= R ?81$ 6 =H R !" % & %& # ( , ) : R : %1 & R ' : R 6 B, 8 1 R . : !" 12 ) 08

0 ' , ! =. ( % $ 4 ( 189 LUBM(50) Lo ad and In ference (sec .) * 6 6 B $ # = 135 ( & # 105 98 / 3> 4 - &$ 93 $ % H # 6 = 6 B & & 180% 129% 100% 93% 89% 38 # ?8 - ' 4 * # 1M-index 2M-index 4M-index* 6M-index 8M-index + # # = !" 12 ) 087

0 ' , ! = #( %$ & ' % LUBM(50) Load and Inference (sec.) 240 181 131 105 86 85 73 229% 172% 125% 100% 82% 81% 70% owl-max owl-max, p* horst horst, p* rdfs rdfs, p* empty T$ # & & ' #B % & % ! " =C=H & % F #B G && % ' &! " 1 %1& %1# 6 !" 12 ) 088

0 ' , ! = #( %$ & ' % $ $ 5& ' #B + 1 ' # &% &+ &!" # $ >17 V + $& + )# KL & 5 (( % && , %1& %& ' 5& & &&+ #B # 1& # (3 * + 3 3( 3 (3 & %1& 5& 1 % % !" 718 # # F ' G 3% & & # + 1 4 !" 12 ) 08>

0 ' , ! =. $ & 348 5& $ 1 LU BM(50) L o ad an d In feren ce (s ec .) ## + . $ & & # 3 F# + ) =G4 5& . H V & # 3 105 94 F & ' ) =G4R 77 73 ! H = H V & 331% 100% # R 90% 73% 70% F # 1# # + G # horst, horst, rdfs, empty, no Sesame- % & &F ) =G pRDFS* pRDFS, noPers. persist. memory, !" = noPers. RDFS # 7 1$ Q J H=> 37 > =4R & # ?81$ Q J% &&= !" 12 ) 08?

0 ' , ! = && - %3 ! ! ? M 541 L U B M ( 5 0 ) L o a d a n d In f e re n c e ( s e c .) 311 278 166 152 130 128 105 515% 265% 296% 124% 158% 122% 145% 100% Pm0.7g, P2c, w in32 Piv0.9g, Piv0.9g, Pdc1.6g, 4cOpt12g, 4cOpt12g, 4cOpt12g*, w in32 jdk6 w in32, jdk6 w in32, jdk5 w in32, jdk6 lin64, lin64, lin64, jdk5.64 jdk5.32 jdk6.64 ' !" < + # # + ## = !" 12 ) 08@

0 ' , ! = '#( % %$ & 344 LUBM(50) Load and Inference (sec.) 299 278 141 113 107 105 110 134% 108% 102% 100% 105% 124% 100% 108% 4cOpt12g, 4cOpt12g, 4cOpt12g, 4cOpt12g, 4cOpt12g, Piv0.9g, Piv0.9g, Piv0.9g, lin64 - 1 lin64 - 2 lin64 - 3 lin64 - 4 lin64 - 5 w in32 - 1 w in32 - 2 w in32 - 3 ' !" < + # # + ## = !" 12 ) 08

$ #% 0 , , ' ' + 5& / - N ! ' ( ! JO & # & / 3& ,K % = & % .= $ - K % % #= #K & # K . 4= /- # ! 0 ' 5( , # & 3 +$ +J - &; % & % & , # & & % R * & & R 5% !" !" H > H , : : : : = .3 &6# & & & # !" 12 ) 08C

$ #% 0 , , ' ' +$ $ N ?P - " 1! !" 3 4 9 *, ' !" & 1H $ & & 5& $ # % &! " = = = % + 5 &(3R & $# = = =7 % & & + & # = 5 /- ! % !" & $ %, : %1# 6 2 >H - '* . # & % !" &% & & 6 A5)' F A + #1 1 1 G * ; 6 & H> & & % # + !" 12 ) 0>

$ #% 0 , , ' ' + $$ $ 4 1 4 4 1 4 1 4 ) ) ) ) 2)2 # 5 6 7 ;B BB 5 ) )6 7 @ 77 B ( ; ( %& ) ! " 7 # 5 )6 (B B; 7 B(7 @; @ % & ) 7 ( 5# )6 7 B ; !" 12 ) 0>H

$ #% 0 , , ' ' +$ 1 784 1 4 784 1 4 1 4 ! " H H H H H / " , > ,0 " , > ,0 " , > ,0 " , > ,0 " , > ,0 7@ 7 7 7 7 7 7; @7 7 7 ( ; 7 (; 7 7( 7 ( 7( 7 77 7 77 B @ ; B@ B B @( B B B ; ; 77 B 7 7 ( 7 ( 7 7 ( 7 ( 7 @ ( (@( ( @7 7@7 ( @ 7 ; ( (; ( 7 B (B@ ; ( @ B @ 7 ( ; B; (@ ( B; 7 ; B@ B; ; 7( ( 7( ( 77 ( 7 7 7 ;( 7 7; 7@ 7 B ( 7 (; ( 7( 7 (( 7 7 B B@ ( B@ B @( B ( 7 ;(B 7 ; @; ; 7;@ B ;B B 7 ( B B @ 7 7 B ; @BB @; %& 92 2, 29 9 . 3, 3 3 !" 12 ) 0>

*B & % " &# ( ( 3(% ) + 9 &# $ H .9 &% 5& # &% $% 1 + % & & % 6 6 + = = + +# # ( ( ( # +# , O + + 3 $ # #+ # # 1 #4 * + 3 #+ #% & & # 4 *B & % $ & ,K % =% K % 7= % K HK% - ) K K 9 %1 " 5K $ :9F' ( 3& 4 6 # !" 5 # B & J9K' ( !" 12 ) 0>7

$ ( % ' % % !" ( % % : K 9 ) +P , # B 6 R ,: ( 9B 9R ?> =K = = 5& 1 %1# 6% & ' : R %& * & # & 8H == ,>J ( 9B 9R =K = = -!" : 9 ( % 3 * $ . . 8# = % & %1# 6 5& $ & $ & * 2 &?81$ ' 5 =7 # =3 H C@ 6= =K =4 # & &# # 3' S 14 K # *$ % % & # $ -!" $ . !" 12 ) 0>8

#( !" !" #$ % &' ' % !" ( ) # * + , ( +- & . # /- /- " , $ ' ' - # !& $ !" !" 12 ) 0>>

, $ ' -!" ( & ,K % = K % % 6= #K% #K K $ -!" # $ $ & & 5' 9 '9 5& F &1% &G !" % & & 1# # + ; + 3& $ ' -!" # & & + &# ## + -!" & & +3 & F G $ 4 + 5& % # % (4 $ 1 1 &. % # & !" 12 ) 0>?

, $ 59 3 & ' $ ' -!" % % "& & % !" +& & $ 1 & -!" # %W $ 1 .6# 4 '1 & & ; +& # & 6 # ( #$ %& & #B & # # # & # F & +; G & 6 5( # ( 3 %, # * 4 ; 6 # !" 12 ) 0>@

, $ ' 'G 0 5& & -!" &&+ $ * U F G R % # CFG1, LUBM(50,0) CFG2, LUBM(8000,0) Parameter Factor Value Memory Size (mb) Value Memory Size (mb) key.index.size 16 500,000 8 25,000,000 381 cache-size 29 500,000 14 60,000,000 1,659 entity-index-size 4 1,000,000 4 120,000,000 458 page-cache 16,000 1,000 15 10,000 153 total cache 41 2,651 entity dictionary 29 1,384,243 38 221,478,842 6,125 literals 29 461,414 13 73,826,281 2,042 dict+literals 1,845,657 51 295,305,122 8,167 trree index ref 32 2,000,000 61 2,000,000 61 Total (MB) 153 10,818 !" 12 ) 0>

, $ : '= ' + & 0 ': , ! % + %& 2- '* O % , ) =C 3) # 8 7= 2 B 0?7 4 O 7 1$ Q JH=> 1U H? #6 % ! & ! % + :: 9 / 3H - 4 $ :K ' ( H 2 ' K - U R & # $ 8& 0 ' , ! %3 ( :F ', '* $ . 7 1$ Q JH=? R U HC #6 % ! & ! % + :: +8 # % & & 1# # + * =K = !" 12 ) 0>C

#( !" !" #$ % &' ' % !" ( ) # * + , ( +- & . # /- /- " -!" 5 ,( ( & !& $ !" !" 12 ) 0?

3 : ,( ( -!" + 0 ' , ! O % ,8 ! H 3 6! @ H?2- '* '* H 4 !, H = 6 ?81$ Q JH=? 1U H

Add a comment

Related presentations

Presentación que realice en el Evento Nacional de Gobierno Abierto, realizado los ...

In this presentation we will describe our experience developing with a highly dyna...

Presentation to the LITA Forum 7th November 2014 Albuquerque, NM

Un recorrido por los cambios que nos generará el wearabletech en el futuro

Um paralelo entre as novidades & mercado em Wearable Computing e Tecnologias Assis...

Microsoft finally joins the smartwatch and fitness tracker game by introducing the...

Related pages

OWLIM – a Pragmatic Semantic Repository for OWL

OWLIM – a Pragmatic Semantic Repository for OWL Atanas Kiryakov1, Damyan Ognyanov1, Dimitar Manov1 1 Ontotext Lab, Sirma Group Corp. 135 Tsarigradsko ...
Read more

OWLIM – A Pragmatic Semantic Repository for OWL - Springer

... A Pragmatic Semantic Repository for OWL. Atanas Kiryakov Affiliated with Ontotext Lab, ... OWLIM is a high-performance Storage and Inference Layer ...
Read more

Owlim – a pragmatic semantic repository for owl (2005)

CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Abstract. OWLIM is a high-performance Storage and Inference Layer (SAIL) for ...
Read more

OWLIM—a pragmatic semantic repository for OWL - ResearchGate

[Show abstract] [Hide abstract] ABSTRACT: Recently, many approaches have been proposed to manage sensor data using Semantic Web technologies for effective ...
Read more

OWLIM - A Pragmatic Semantic Repository for OWL (0)

Developers of Semantic Web applications face a challenge with respect to the decentralised publication model: how and where to find statements about ...
Read more

CiteULike: OWLIM – A Pragmatic Semantic Repository for OWL

x. CiteULike uses cookies, some of which may already have been set. Read about how we use cookies. We will interpret your continued use of this site as ...
Read more

OWLIM: A family of scalable semantic repositories

... A family of scalable semantic repositories . ... OWLIM as the semantic repository of choice for all ... a Pragmatic Semantic Repository for OWL,
Read more

OWLIM: A family of scalable semantic repositories

... A family of scalable semantic repositories ... OWLIM semantic repository ... Pragmatic Semantic Repository for OWL, ...
Read more

Owlim – a pragmatic semantic repository for owl

Abstract. Abstract. OWLIM is a high-performance Storage and Inference Layer (SAIL) for Sesame, which performs OWL DLP reasoning, based on forward-chaining ...
Read more