메뉴 건너뛰기




Volumn 6496 LNCS, Issue PART 1, 2010, Pages 436-452

Optimizing enterprise-scale OWL 2 RL reasoning in a relational database system

Author keywords

[No Author keywords available]

Indexed keywords

BIRDS; ENGINES; RELATIONAL DATABASE SYSTEMS; SEMANTIC WEB;

EID: 78650891538     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17746-0_28     Document Type: Conference Paper
Times cited : (39)

References (28)
  • 1
    • 84874619325 scopus 로고    scopus 로고
    • AllegroGraph, http://www.franz.com/products/allegrograph/
    • AllegroGraph
  • 2
    • 38549097071 scopus 로고    scopus 로고
    • The Universal Protein Resource (UniProt)
    • The UniProt Consortium. The Universal Protein Resource (UniProt). Nucleic Acids Res. 36, D190-D195 (2008), http://www.UniProt.org/
    • (2008) Nucleic Acids Res. , vol.36
  • 4
    • 25144513579 scopus 로고    scopus 로고
    • LUBM: A benchmark for OWL knowledge base systems
    • DOI 10.1016/j.websem.2005.06.005, PII S1570826805000132, Selected Papers from the International Semantic Web Conference 2004 ISWC, 2004
    • Guo, Y., Pan, Z., Heflin, J.: LUBM: A Benchmark for OWL Knowledge Base Systems. Journal of Web Semantics 3(2), 158-182 (2005) (Pubitemid 41336740)
    • (2005) Web Semantics , vol.3 , Issue.2-3 , pp. 158-182
    • Guo, Y.1    Pan, Z.2    Heflin, J.3
  • 5
    • 34548305118 scopus 로고    scopus 로고
    • Tractable reasoning and efficient query answering in description logics: The DL-Lite family
    • DOI 10.1007/s10817-007-9078-x, Special Issue on Reasoning in Description Logics
    • Calvanese, D., de Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family. J. of Automated Reasoning 39(3), 385-429 (2007) (Pubitemid 47340922)
    • (2007) Journal of Automated Reasoning , vol.39 , Issue.3 , pp. 385-429
    • Calvanese, D.1    De Giacomo, G.2    Lembo, D.3    Lenzerini, M.4    Rosati, R.5
  • 8
    • 0018455018 scopus 로고
    • A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets
    • Tarjan, R.: A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets. Journal of Computer and System Sciences 18(2), 110-127 (1979)
    • (1979) Journal of Computer and System Sciences , vol.18 , Issue.2 , pp. 110-127
    • Tarjan, R.1
  • 11
  • 13
    • 84866262574 scopus 로고    scopus 로고
    • Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema
    • Horrocks, I., Hendler, J. (eds.) ISWC 2002. Springer, Heidelberg
    • Broekstra, J., van Harmelen, F., Kampman, A.: Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, p. 54. Springer, Heidelberg (2002)
    • (2002) LNCS , vol.2342 , pp. 54
    • Broekstra, J.1    Van Harmelen, F.2    Kampman, A.3
  • 15
    • 78650857455 scopus 로고    scopus 로고
    • OWLIM: LUBM Tests, http://ontotext.com/owlim/benchmarking/lubm.html
    • OWLIM: LUBM Tests
  • 17
    • 78650896939 scopus 로고    scopus 로고
    • Oracle SQL Parallel Execution, http://www.oracle.com/technology/products/ bi/db/11g/pdf/twp-bidw-parallel-execution-11gr1.pdf
    • Oracle SQL Parallel Execution
  • 20
    • 78650892419 scopus 로고    scopus 로고
    • PelletDB. More information
    • PelletDB. More information, http://clarkparsia.com/pelletdb
  • 22
    • 78650884488 scopus 로고    scopus 로고
    • RDF Semantics
    • Latest version available at
    • Hayes, P. (ed.): RDF Semantics, W3C Recommendation. Latest version available at, http://www.w3.org/TR/rdf-mt/
    • W3C Recommendation
    • Hayes, P.1
  • 23
    • 78650868590 scopus 로고    scopus 로고
    • Oracle Semantic Technologies, http://www.oracle.com/technology/tech/ semantic-technologies/index.html
  • 24
    • 78650902487 scopus 로고    scopus 로고
    • OpenCyc, http://www.opencyc.org/downloads
  • 25
    • 77954418304 scopus 로고    scopus 로고
    • OWL reasoning with WebPIE: Calculating the closure of 100 billion triples
    • Aroyo, L., Antoniou, G., Hyvönen, E., ten Teije, A., Stuckenschmidt, H., Cabral, L., Tudorache, T. (eds.) ESWC 2010. Springer, Heidelberg
    • Urbani, J., Kotoulas, S., Maassen, J., van Harmelen, F., Bal, H.: OWL reasoning with WebPIE: calculating the closure of 100 billion triples. In: Aroyo, L., Antoniou, G., Hyvönen, E., ten Teije, A., Stuckenschmidt, H., Cabral, L., Tudorache, T. (eds.) ESWC 2010. LNCS, vol. 6088, pp. 213-227. Springer, Heidelberg (2010)
    • (2010) LNCS , vol.6088 , pp. 213-227
    • Urbani, J.1    Kotoulas, S.2    Maassen, J.3    Van Harmelen, F.4    Bal, H.5
  • 27
    • 84949636003 scopus 로고    scopus 로고
    • Memory Management for Union-Find Algorithms
    • Reischuk, R., Morvan, M. (eds.) STACS 1997. Springer, Heidelberg
    • Fiorio, C., Gustedt, J.: Memory Management for Union-Find Algorithms. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 67-79. Springer, Heidelberg (1997)
    • (1997) LNCS , vol.1200 , pp. 67-79
    • Fiorio, C.1    Gustedt, J.2
  • 28
    • 84865637548 scopus 로고    scopus 로고
    • OpenRuleBench: An Analysis of the Performance of Rule Engines
    • ACM Press, New York
    • Liang, S., Fodor, P., Wan, H., Kifer, M.: OpenRuleBench: An Analysis of the Performance of Rule Engines. In: WWW 2009, pp. 601-610. ACM Press, New York (2009)
    • (2009) WWW 2009 , pp. 601-610
    • Liang, S.1    Fodor, P.2    Wan, H.3    Kifer, M.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.