Sciweavers

Share
4 search results - page 1 / 1
» Efficient Indices Using Graph Partitioning in RDF Triple Sto...
Sort
View
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
12 years 3 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
WWW
2008
ACM
12 years 2 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
DASFAA
2010
IEEE
425views Database» more  DASFAA 2010»
11 years 5 months ago
FlexTable: Using a Dynamic Relation Model to Store RDF Data
Efficient management of RDF data is an important factor in realizing the Semantic Web vision. The existing approaches store RDF data based on triples instead of a relation model. I...
Yan Wang, Xiaoyong Du, Jiaheng Lu, Xiaofang Wang
WWW
2008
ACM
12 years 2 months ago
Scaling RDF with time
The World Wide Web Consortium's RDF standard primarily consists of (subject,property,object) triples that specify the value that a given subject has for a given property. How...
Andrea Pugliese, Octavian Udrea, V. S. Subrahmania...
books