Flexible query processing of SPARQL queries

SPARQL is the predominant language for querying RDF data, which is the standard model for representing web data and more specifically Linked Open Data (a collection of heterogeneous connected data). Datasets in RDF form can be hard to query by a user if she does not have a full knowledge of the structure of the dataset. Moreover, many datasets in Linked Data are often extracted from actual web page content which might lead to incomplete or inaccurate data. We extend SPARQL 1.1 with two operators, APPROX and RELAX, previously introduced in the context of regular path queries. Using these operators we are able to support exible querying over the property path queries of SPARQL 1.1. We call this new language SPARQLAR. Using SPARQLAR users are able to query RDF data without fully knowing the structure of a dataset. APPROX and RELAX encapsulate different aspects of query flexibility: finding different answers and finding more answers, respectively. This means that users can access complex and heterogeneous datasets without the need to know precisely how the data is structured. One of the open problems we address is how to combine the APPROX and RELAX operators with a pragmatic language such as SPARQL. We also devise an implementation of a system that evaluates SPARQLAR queries in order to study the performance of the new language. We begin by defining the semantics of SPARQLAR and the complexity of query evaluation. We then present a query processing technique for evaluating SPARQLAR queries based on a rewriting algorithm and prove its soundness and completeness. During the evaluation of a SPARQLAR query we generate multiple SPARQL 1.1 queries that are evaluated against the dataset. Each such query will generate answers with a cost that indicates their distance with respect to the exact form of the original SPARQLAR query. Our prototype implementation incorporates three optimisation techniques that aim to enhance query execution performance: the first optimisation is a pre-computation technique that caches the answers of parts of the queries generated by the rewriting algorithm. These answers will then be reused to avoid the re-execution of those sub-queries. The second optimisation utilises a summary of the dataset to discard queries that it is known will not return any answer. The third optimisation technique uses the query containment concept to discard queries whose answers would be returned by another query at the same or lower cost. We conclude by conducting a performance study of the system on three different RDF datasets: LUBM (Lehigh University Benchmark), YAGO and DBpedia

Flexible query processing of SPARQL queries

SPARQL is the predominant language for querying RDF data, which is the standard model for representing web data and more specifically Linked Open Data (a collection of heterogeneous connected data). Datasets in RDF form can be hard to query by a user if she does not have a full knowledge of the structure of the dataset. Moreover, many datasets in Linked Data are often extracted from actual web page content which might lead to incomplete or inaccurate data. We extend SPARQL 1.1 with two operators, APPROX and RELAX, previously introduced in the context of regular path queries. Using these operators we are able to support exible querying over the property path queries of SPARQL 1.1. We call this new language SPARQLAR. Using SPARQLAR users are able to query RDF data without fully knowing the structure of a dataset. APPROX and RELAX encapsulate different aspects of query flexibility: finding different answers and finding more answers, respectively. This means that users can access complex and heterogeneous datasets without the need to know precisely how the data is structured. One of the open problems we address is how to combine the APPROX and RELAX operators with a pragmatic language such as SPARQL. We also devise an implementation of a system that evaluates SPARQLAR queries in order to study the performance of the new language. We begin by defining the semantics of SPARQLAR and the complexity of query evaluation. We then present a query processing technique for evaluating SPARQLAR queries based on a rewriting algorithm and prove its soundness and completeness. During the evaluation of a SPARQLAR query we generate multiple SPARQL 1.1 queries that are evaluated against the dataset. Each such query will generate answers with a cost that indicates their distance with respect to the exact form of the original SPARQLAR query. Our prototype implementation incorporates three optimisation techniques that aim to enhance query execution performance: the first optimisation is a pre-computation technique that caches the answers of parts of the queries generated by the rewriting algorithm. These answers will then be reused to avoid the re-execution of those sub-queries. The second optimisation utilises a summary of the dataset to discard queries that it is known will not return any answer. The third optimisation technique uses the query containment concept to discard queries whose answers would be returned by another query at the same or lower cost. We conclude by conducting a performance study of the system on three different RDF datasets: LUBM (Lehigh University Benchmark), YAGO and DBpedia

Combining flexible queries and knowledge anchors to facilitate the exploration of knowledge graphs

Semantic web and information extraction technologies are enabling the creation of vast information and knowledge repositories, particularly in the form of knowledge graphs comprising entities and the relationships between them. Users are often unfamiliar with the complex structure and vast content of such graphs. Hence, users need to be assisted by tools that support interactive exploration and flexible querying. In this paper we draw on recent work in flexible querying for graph-structured data and identifying good anchors for knowledge graph exploration in order to demonstrate how users can be supported in incrementally querying, exploring and learning from large complex knowledge graphs. We demonstrate our techniques through a case study in the domain of lifelong learning and career guidance

Optimisation techniques for flexible SPARQL queries

RDF datasets can be queried using the SPARQL language but are often irregularly structured and incomplete, which may make precise query formulation hard for users. The SPARQL$^{AR}$ language extends SPARQL 1.1 with two operators - APPROX and RELAX - so as to allow flexible querying over property paths. These operators encapsulate different dimensions of query flexibility, namely approximation and generalisation, and they allow users to query complex, heterogeneous knowledge graphs without needing to know precisely how the data is structured. Earlier work has described the syntax, semantics and complexity of SPARQL$^{AR}$, has demonstrated its practical feasibility, but has also highlighted the need for improving the speed of query evaluation. In the present paper, we focus on the design of two optimisation techniques targeted at speeding up the execution of SPARQL$^{AR}$ queries and on their empirical evaluation on three knowledge graphs: LUBM, DBpedia and YAGO. We show that applying these optimisations can result in substantial improvements in the execution times of longer-running queries (sometimes by one or more orders of magnitude) without incurring significant performance penalties for fast queries

Magnolia officinalis L. bark extract and respiratory diseases: From traditional Chinese medicine to western medicine via network target

The understanding of the use of Magnolia officinalis L. (Magnoliaceae) as a possible dietary supplement for supporting the treatment of airway pathologies might be of clinical interest. Two commercially available bark extracts (M. officinalis extract [MOE]) were characterized by quantitation in honokiol and magnolol content by means of high-performance liquid chromatography with UV detection. MOE effects, as well as those of the reference compounds per se, on some targets connected to airway pathologies (antibacterial- and lung and trachea relaxing- activities) were investigated. Results showed that MOE possessed interesting antibacterial activity against Staphylococcus aureus, Pseudomonas aeruginosa, and Streptococcus pneumoniae. This was accompanied by a spasmolytic and antispasmodic activity, possibly owing to its ability to concurrently modulate different targets such as H-1-, beta(2)- and muscarinic receptors and l-type calcium channels involved in bronchodilation. All these effects were directly related to the MOE content in honokiol and magnolol. In conclusion, the properties of MOE highlighted here strongly encourage its application as dietary supplement in the treatment of airway diseases

Upper limb function in Duchenne muscular dystrophy: 24 month longitudinal data

The aim of the study was to establish 24 month changes in upper limb function using a revised version of the performance of upper limb test (PUL 2.0) in a large cohort of ambulant and non-ambulant boys with Duchenne muscular dystrophy and to identify possible trajectories of progression. Of the 187 patients studied, 87 were ambulant (age range: 7\u201315.8 years), and 90 non-ambulant (age range: 9.08\u201324.78). The total scores changed significantly over time (p<0.001). Non-ambulant patients had lower total scores at baseline (mean 19.7) when compared to the ambulant ones (mean 38.4). They also had also a bigger decrease in total scores over 24 months compared to the ambulant boys (4.36 vs 2.07 points). Multivariate model analysis showed that the Performance of Upper Limb changes reflected the entry level and ambulation status, that were independently associated to the slope of Performance of Upper Limb changes. This information will be of help both in clinical practice and at the time of designing clinical trials

Dopamine Transporter SPECT Imaging in Corticobasal Syndrome

evidence of preserved nigral neuronal density. imaging evidence of preserved nigral terminals have been recently described.In this multicenter study, we investigated presynaptic nigrostriatal function in 36 outpatients fulfilling clinical criteria for “probable corticobasal degeneration” (age 71±7.3 years; disease duration 3.9±1.6 years), 37 PD and 24 healthy control subjects using FP-CIT single photon emission computed tomography. Clinical, neuropsychological, and magnetic resonance imaging assessment was performed to characterize CBS patients. Linear discriminant analysis was used to categorize normal vs. pathological scans.FP-CIT binding reduction in patients with CBS was characterized by larger variability, more uniform reduction throughout the striatum and greater hemispheric asymmetry compared to PD. Moreover, there was no significant correlation between tracer uptake values and clinical features such as disease duration and severity. Despite all CBS subjects showed obvious bilateral extrapyramidal signs, FP-CIT uptake was found to be normal bilaterally in four CBS patients and only unilaterally in other four cases. Extensive clinical, neuropsychological and imaging assessment did not reveal remarkable differences between CBS subjects with normal vs. pathological FP-CIT uptake.Our findings support the hypothesis that extrapyramidal motor symptoms in CBS are not invariably associated with SNc neuronal degeneration and that supranigral factors may play a major role in several cases. CBS individuals with normal FP-CIT uptake do not show any clinical or cognitive feature suggesting a different pathology than CBD

A study of CP violation in B-+/- -> DK +/- and B-+/- -> D pi(+/-) decays with D -> (KSK +/-)-K-0 pi(-/+) final states

A first study of CP violation in the decay modes $B^\pm\to [K^0_{\rm S} K^\pm \pi^\mp]_D h^\pm$ and $B^\pm\to [K^0_{\rm S} K^\mp \pi^\pm]_D h^\pm$, where $h$ labels a $K$ or $\pi$ meson and $D$ labels a $D^0$ or $\overline{D}^0$ meson, is performed. The analysis uses the LHCb data set collected in $pp$ collisions, corresponding to an integrated luminosity of 3 fb$^{-1}$. The analysis is sensitive to the CP-violating CKM phase $\gamma$ through seven observables: one charge asymmetry in each of the four modes and three ratios of the charge-integrated yields. The results are consistent with measurements of $\gamma$ using other decay modes

Study of the rare B-s(0) and B-0 decays into the pi(+) pi(-) mu(+) mu(-) final state

A search for the rare decays $B_s^0 \to \pi^+\pi^-\mu^+\mu^-$ and $B^0 \to \pi^+\pi^-\mu^+\mu^-$ is performed in a data set corresponding to an integrated luminosity of 3.0 fb$^{-1}$ collected by the LHCb detector in proton-proton collisions at centre-of-mass energies of 7 and 8 TeV. Decay candidates with pion pairs that have invariant mass in the range 0.5-1.3 GeV/$c^2$ and with muon pairs that do not originate from a resonance are considered. The first observation of the decay $B_s^0 \to \pi^+\pi^-\mu^+\mu^-$ and the first evidence of the decay $B^0 \to \pi^+\pi^-\mu^+\mu^-$ are obtained and the branching fractions are measured to be $\mathcal{B}(B_s^0 \to \pi^+\pi^-\mu^+\mu^-)=(8.6\pm 1.5\,({\rm stat}) \pm 0.7\,({\rm syst})\pm 0.7\,({\rm norm}))\times 10^{-8}$ and $\mathcal{B}(B^0 \to \pi^+\pi^-\mu^+\mu^-)=(2.11\pm 0.51\,({\rm stat}) \pm 0.15\,({\rm syst})\pm 0.16\,({\rm norm}) )\times 10^{-8}$, where the third uncertainty is due to the branching fraction of the decay $B^0\to J/\psi(\to \mu^+\mu^-)K^*(890)^0(\to K^+\pi^-)$, used as a normalisation.A search for the rare decays Bs0→π+π−μ+μ− and B0→π+π−μ+μ− is performed in a data set corresponding to an integrated luminosity of 3.0 fb−1 collected by the LHCb detector in proton–proton collisions at centre-of-mass energies of 7 and 8 TeV . Decay candidates with pion pairs that have invariant mass in the range 0.5–1.3 GeV/c2 and with muon pairs that do not originate from a resonance are considered. The first observation of the decay Bs0→π+π−μ+μ− and the first evidence of the decay B0→π+π−μ+μ− are obtained and the branching fractions, restricted to the dipion-mass range considered, are measured to be B(Bs0→π+π−μ+μ−)=(8.6±1.5 (stat)±0.7 (syst)±0.7(norm))×10−8 and B(B0→π+π−μ+μ−)=(2.11±0.51(stat)±0.15(syst)±0.16(norm))×10−8 , where the third uncertainty is due to the branching fraction of the decay B0→J/ψ(→μ+μ−)K⁎(892)0(→K+π−) , used as a normalisation.A search for the rare decays Bs0→π+π−μ+μ− and B0→π+π−μ+μ− is performed in a data set corresponding to an integrated luminosity of 3.0 fb−1 collected by the LHCb detector in proton–proton collisions at centre-of-mass energies of 7 and 8 TeV . Decay candidates with pion pairs that have invariant mass in the range 0.5–1.3 GeV/c2 and with muon pairs that do not originate from a resonance are considered. The first observation of the decay Bs0→π+π−μ+μ− and the first evidence of the decay B0→π+π−μ+μ− are obtained and the branching fractions, restricted to the dipion-mass range considered, are measured to be B(Bs0→π+π−μ+μ−)=(8.6±1.5 (stat)±0.7 (syst)±0.7(norm))×10−8 and B(B0→π+π−μ+μ−)=(2.11±0.51(stat)±0.15(syst)±0.16(norm))×10−8 , where the third uncertainty is due to the branching fraction of the decay B0→J/ψ(→μ+μ−)K⁎(892)0(→K+π−) , used as a normalisation.A search for the rare decays $B_s^0 \to \pi^+\pi^-\mu^+\mu^-$ and $B^0 \to \pi^+\pi^-\mu^+\mu^-$ is performed in a data set corresponding to an integrated luminosity of 3.0 fb$^{-1}$ collected by the LHCb detector in proton-proton collisions at centre-of-mass energies of 7 and 8 TeV. Decay candidates with pion pairs that have invariant mass in the range 0.5-1.3 GeV/$c^2$ and with muon pairs that do not originate from a resonance are considered. The first observation of the decay $B_s^0 \to \pi^+\pi^-\mu^+\mu^-$ and the first evidence of the decay $B^0 \to \pi^+\pi^-\mu^+\mu^-$ are obtained and the branching fractions, restricted to the dipion-mass range considered, are measured to be $\mathcal{B}(B_s^0 \to \pi^+\pi^-\mu^+\mu^-)=(8.6\pm 1.5\,({\rm stat}) \pm 0.7\,({\rm syst})\pm 0.7\,({\rm norm}))\times 10^{-8}$ and $\mathcal{B}(B^0 \to \pi^+\pi^-\mu^+\mu^-)=(2.11\pm 0.51\,({\rm stat}) \pm 0.15\,({\rm syst})\pm 0.16\,({\rm norm}) )\times 10^{-8}$, where the third uncertainty is due to the branching fraction of the decay $B^0\to J/\psi(\to \mu^+\mu^-)K^*(890)^0(\to K^+\pi^-)$, used as a normalisation