Using SPARQL – the practitioners’ viewpoint

A number of studies have analyzed SPARQL log data to draw conclusions about how SPARQL is being used. To complement this work, a survey of SPARQL users has been undertaken. Whilst confirming some of the conclusions of the previous studies, the current work is able to provide additional insight into how users create SPARQL queries, the difficulties they encounter, and the features they would like to see included in the language. Based on this insight, a number of recommendations are presented to the community. These relate to predicting and avoiding computationally expensive queries; extensions to the language; and extending the search paradigm

Spontaneous magnetization of the Ising model on the Sierpinski carpet fractal, a rigorous result

We give a rigorous proof of the existence of spontaneous magnetization at finite temperature for the Ising spin model defined on the Sierpinski carpet fractal. The theorem is inspired by the classical Peierls argument for the two dimensional lattice. Therefore, this exact result proves the existence of spontaneous magnetization for the Ising model in low dimensional structures, i.e. structures with dimension smaller than 2.Comment: 14 pages, 8 figure

Dynamical phase transition in one-dimensional kinetic Ising model with nonuniform coupling constants

An extension of the Kinetic Ising model with nonuniform coupling constants on a one-dimensional lattice with boundaries is investigated, and the relaxation of such a system towards its equilibrium is studied. Using a transfer matrix method, it is shown that there are cases where the system exhibits a dynamical phase transition. There may be two phases, the fast phase and the slow phase. For some region of the parameter space, the relaxation time is independent of the reaction rates at the boundaries. Changing continuously the reaction rates at the boundaries, however, there is a point where the relaxation times begins changing, as a continuous (nonconstant) function of the reaction rates at the boundaries, so that at this point there is a jump in the derivative of the relaxation time with respect to the reaction rates at the boundaries.Comment: 17 page

Context-Free Path Queries on RDF Graphs

Navigational graph queries are an important class of queries that canextract implicit binary relations over the nodes of input graphs. Most of the navigational query languages used in the RDF community, e.g. property paths in W3C SPARQL 1.1 and nested regular expressions in nSPARQL, are based on the regular expressions. It is known that regular expressions have limited expressivity; for instance, some natural queries, like same generation-queries, are not expressible with regular expressions. To overcome this limitation, in this paper, we present cfSPARQL, an extension of SPARQL query language equipped with context-free grammars. The cfSPARQL language is strictly more expressive than property paths and nested expressions. The additional expressivity can be used for modelling graph similarities, graph summarization and ontology alignment. Despite the increasing expressivity, we show that cfSPARQL still enjoys a low computational complexity and can be evaluated efficiently.Comment: 25 page

Ground state numerical study of the three-dimensional random field Ising model

The random field Ising model in three dimensions with Gaussian random fields is studied at zero temperature for system sizes up to 60^3. For each realization of the normalized random fields, the strength of the random field, Delta and a uniform external, H is adjusted to find the finite-size critical point. The finite-size critical point is identified as the point in the H-Delta plane where three degenerate ground states have the largest discontinuities in the magnetization. The discontinuities in the magnetization and bond energy between these ground states are used to calculate the magnetization and specific heat critical exponents and both exponents are found to be near zero.Comment: 10 pages, 6 figures; new references and small changes to tex

An introduction to Graph Data Management

A graph database is a database where the data structures for the schema and/or instances are modeled as a (labeled)(directed) graph or generalizations of it, and where querying is expressed by graph-oriented operations and type constructors. In this article we present the basic notions of graph databases, give an historical overview of its main development, and study the main current systems that implement them

Answering SPARQL queries over databases under OWL 2 QL entailment regime

We present an extension of the ontology-based data access platform Ontop that supports answering SPARQL queries under the OWL 2 QL direct semantics entailment regime for data instances stored in relational databases. On the theoretical side, we show how any input SPARQL query, OWL 2 QL ontology and R2RML mappings can be rewritten to an equivalent SQL query solely over the data. On the practical side, we present initial experimental results demonstrating that by applying the Ontop technologies—the tree-witness query rewriting, T-mappings compiling R2RML mappings with ontology hierarchies, and T-mapping optimisations using SQL expressivity and database integrity constraints—the system produces scalable SQL queries

On large deviation properties of Erdos-Renyi random graphs

We show that large deviation properties of Erd\"os-R\'enyi random graphs can be derived from the free energy of the $q$-state Potts model of statistical mechanics. More precisely the Legendre transform of the Potts free energy with respect to $\ln q$ is related to the component generating function of the graph ensemble. This generalizes the well-known mapping between typical properties of random graphs and the $q\to 1$ limit of the Potts free energy. For exponentially rare graphs we explicitly calculate the number of components, the size of the giant component, the degree distributions inside and outside the giant component, and the distribution of small component sizes. We also perform numerical simulations which are in very good agreement with our analytical work. Finally we demonstrate how the same results can be derived by studying the evolution of random graphs under the insertion of new vertices and edges, without recourse to the thermodynamics of the Potts model.Comment: 38 pages, 9 figures, Latex2e, corrected and extended version including numerical simulation result