scholarly journals fQuery: SPARQL Query Rewriting to Enforce Data Confidentiality

Author(s):  
Said Oulmakhzoune ◽  
Nora Cuppens-Boulahia ◽  
Frédéric Cuppens ◽  
Stephane Morucci
Author(s):  
Xiaoyu Qin ◽  
Xiaowang Zhang ◽  
Muhammad Qasim Yasin ◽  
Shujun Wang ◽  
Zhiyong Feng ◽  
...  

AbstractOntology-mediated querying (OMQ) provides a paradigm for query answering according to which users not only query records at the database but also query implicit information inferred from ontology. A key challenge in OMQ is that the implicit information may be infinite, which cannot be stored at the database and queried by off -the -shelf query engine. The commonly adopted technique to deal with infinite entailments is query rewriting, which, however, comes at the cost of query rewriting at runtime. In this work, the partial materialization method is proposed to ensure that the extension is always finite. The partial materialization technology does not rewrite query but instead computes partial consequences entailed by ontology before the online query. Besides, a query analysis algorithm is designed to ensure the completeness of querying rooted and Boolean conjunctive queries over partial materialization. We also soundly and incompletely expand our method to support highly expressive ontology language, OWL 2 DL. Finally, we further optimize the materialization efficiency by role rewriting algorithm and implement our approach as a prototype system SUMA by integrating off-the-shelf efficient SPARQL query engine. The experiments show that SUMA is complete on each test ontology and each test query, which is the same as Pellet and outperforms PAGOdA. Besides, SUMA is highly scalable on large datasets.


Author(s):  
Said Oulmakhzoune ◽  
Nora Cuppens-Boulahia ◽  
Frederic Cuppens ◽  
Stephane Morucci

Author(s):  
Gianluca Correndo ◽  
Manuel Salvadores ◽  
Ian Millard ◽  
Hugh Glaser ◽  
Nigel Shadbolt

2013 ◽  
Vol 48 ◽  
pp. 253-303 ◽  
Author(s):  
I. Kollia ◽  
B. Glimm

The SPARQL query language is currently being extended by the World Wide Web Consortium (W3C) with so-called entailment regimes. An entailment regime defines how queries are evaluated under more expressive semantics than SPARQL's standard simple entailment, which is based on subgraph matching. The queries are very expressive since variables can occur within complex concepts and can also bind to concept or role names. In this paper, we describe a sound and complete algorithm for the OWL Direct Semantics entailment regime. We further propose several novel optimizations such as strategies for determining a good query execution order, query rewriting techniques, and show how specialized OWL reasoning tasks and the concept and role hierarchy can be used to reduce the query execution time. For determining a good execution order, we propose a cost-based model, where the costs are based on information about the instances of concepts and roles that are extracted from a model abstraction built by an OWL reasoner. We present two ordering strategies: a static and a dynamic one. For the dynamic case, we improve the performance by exploiting an individual clustering approach that allows for computing the cost functions based on one individual sample from a cluster. We provide a prototypical implementation and evaluate the efficiency of the proposed optimizations. Our experimental study shows that the static ordering usually outperforms the dynamic one when accurate statistics are available. This changes, however, when the statistics are less accurate, e.g., due to nondeterministic reasoning decisions. For queries that go beyond conjunctive instance queries we observe an improvement of up to three orders of magnitude due to the proposed optimizations.


2007 ◽  
Vol 23 (4) ◽  
pp. 248-257 ◽  
Author(s):  
Matthias R. Mehl ◽  
Shannon E. Holleran

Abstract. In this article, the authors provide an empirical analysis of the obtrusiveness of and participants' compliance with a relatively new psychological ambulatory assessment method, called the electronically activated recorder or EAR. The EAR is a modified portable audio-recorder that periodically records snippets of ambient sounds from participants' daily environments. In tracking moment-to-moment ambient sounds, the EAR yields an acoustic log of a person's day as it unfolds. As a naturalistic observation sampling method, it provides an observer's account of daily life and is optimized for the assessment of audible aspects of participants' naturally-occurring social behaviors and interactions. Measures of self-reported and behaviorally-assessed EAR obtrusiveness and compliance were analyzed in two samples. After an initial 2-h period of relative obtrusiveness, participants habituated to wearing the EAR and perceived it as fairly unobtrusive both in a short-term (2 days, N = 96) and a longer-term (10-11 days, N = 11) monitoring. Compliance with the method was high both during the short-term and longer-term monitoring. Somewhat reduced compliance was identified over the weekend; this effect appears to be specific to student populations. Important privacy and data confidentiality considerations around the EAR method are discussed.


2000 ◽  
Vol 12 (5) ◽  
pp. 694-714 ◽  
Author(s):  
Kian-Lee Tan ◽  
Cheng Hian Goh ◽  
Beng Chin Ooi
Keyword(s):  

Algorithms ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 149
Author(s):  
Petros Zervoudakis ◽  
Haridimos Kondylakis ◽  
Nicolas Spyratos ◽  
Dimitris Plexousakis

HIFUN is a high-level query language for expressing analytic queries of big datasets, offering a clear separation between the conceptual layer, where analytic queries are defined independently of the nature and location of data, and the physical layer, where queries are evaluated. In this paper, we present a methodology based on the HIFUN language, and the corresponding algorithms for the incremental evaluation of continuous queries. In essence, our approach is able to process the most recent data batch by exploiting already computed information, without requiring the evaluation of the query over the complete dataset. We present the generic algorithm which we translated to both SQL and MapReduce using SPARK; it implements various query rewriting methods. We demonstrate the effectiveness of our approach in temrs of query answering efficiency. Finally, we show that by exploiting the formal query rewriting methods of HIFUN, we can further reduce the computational cost, adding another layer of query optimization to our implementation.


Sign in / Sign up

Export Citation Format

Share Document