Sciweavers

327 search results - page 7 / 66
» Efficiently querying rdf data in triple stores
Sort
View
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
14 years 7 months ago
Scalable join processing on very large RDF graphs
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
Thomas Neumann, Gerhard Weikum
WEBI
2010
Springer
13 years 5 months ago
A Scalable Indexing Mechanism for Ontology-Based Information Integration
In recent years, there has been an explosion of publicly available RDF and OWL web pages. Some of these pages are static text files, while others are dynamically generated from la...
Yingjie Li, Abir Qasem, Jeff Heflin
SEMWEB
2005
Springer
14 years 28 days ago
BRAHMS: A WorkBench RDF Store and High Performance Memory System for Semantic Association Discovery
Discovery of semantic associations in Semantic Web ontologies is an important task in various analytical activities. Several query languages and storage systems have been designed ...
Maciej Janik, Krys Kochut
WWW
2008
ACM
14 years 8 months ago
SPARQL basic graph pattern optimization using selectivity estimation
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
Markus Stocker, Andy Seaborne, Abraham Bernstein, ...
CIKM
2004
Springer
14 years 26 days ago
RStar: an RDF storage and query system for enterprise resource management
Modern corporations operate in an extremely complex environment and strongly depend on all kinds of information resources across the enterprise. Unfortunately, with the growth of ...
Li Ma, Zhong Su, Yue Pan, Li Zhang, Tao Liu