Supporting Identity Reasoning in SPARQL Using Bloom Filters
نویسنده
چکیده
The SPARQL Query Language presents a standardized interface to accessing RDF graphs. Its use allows templated queries to retrieve information from remote sources about known entities. However, such templated queries present a key problem: Queries cannot be made directly about nodes whose identity depends on reasoning. We present an efficient approach to solving this problem using a SPARQL extension function and the SPARQL XML Results format. We then discuss the use of this technique in federated query execution.
منابع مشابه
P-LUPOSDATE: Using Precomputed Bloom Filters to Speed Up SPARQL Processing in the Cloud
Increasingly data on the Web is stored in the form of Semantic Web data. Because of today’s information overload, it becomes very important to store and query these big datasets in a scalable way and hence in a distributed fashion. Cloud Computing offers such a distributed environment with dynamic reallocation of computing and storing resources based on needs. In this work we introduce a scalab...
متن کاملAnytime Query Answering in RDF through Evolutionary Algorithms
We present a technique for answering queries over RDF data through an evolutionary search algorithm, using fingerprinting and Bloom filters for rapid approximate evaluation of generated solutions. Our evolutionary approach has several advantages compared to traditional databasestyle query answering. First, the result quality increases monotonically and converges with each evolution, offering “a...
متن کاملAutoscaling Bloom Filter: Controlling Trade-off Between True and False Positives
A Bloom filter is a simple data structure supporting membership queries on a set. The standard Bloom filter does not support the delete operation, therefore, many applications use a counting Bloom filter allowing the deletion. This paper proposes a generalization of the counting Bloom filters approach, called “autoscaling Bloom filters”, which allows elastic adjustment of its capacity with prob...
متن کاملOpportunistic Linked Data Querying Through Approximate Membership Metadata
Between uri dereferencing and the sparql protocol lies a largely unexplored axis of possible interfaces to LinkedData, eachwith its own combination of trade-offs. One of these interfaces is Triple Pattern Fragments, which allows clients to execute sparql queries against low-cost servers, at the cost of higher bandwidth. Increasing a client’s efficiency means lowering the number of requests, whi...
متن کاملVerification of Process Models
This chapter presents an ontology-driven approach that aims at supporting semantic verification of semiformal process models. The ontology-driven approach suggested consists of two steps. The first step is the development of a model for ontology-based representation of process models. This representation allows enriching process models by annotating them with semantics specified in a formal ont...
متن کامل