327 search results - page 24 / 66 » Efficiently querying rdf data in triple stores |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
COCOON
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
RR
2007
Springer
14 years 1 months ago
2007
Springer
For the foreseeable future, most data will continue to be stored in relational databases. To work with these data in ontology-based applications, tools and techniques that bridge t...
ESWS
2008
Springer
13 years 9 months ago
2008
Springer
This paper concerns versioning services over Semantic Web (SW) repositories. We propose a novel storage index (based on partial orders), called POI, that exploits the fact that RDF...