An Efficient Light Solver for Querying the Semantic Web - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

An Efficient Light Solver for Querying the Semantic Web

Abstract

The Semantic Web aims at building cross-domain and distributed databases across the Internet. SPARQL is a standard query language for such databases. Evaluating such queries is however NP-hard. We model SPARQL queries in a declarative way, by means of CSPs. A CP operational semantics is proposed. It can be used for a direct implementation in existing CP solvers. To handle large databases, we introduce a specialized and efficient light solver, Castor. Benchmarks show the feasibility and efficiency of the approach.
Fichier principal
Vignette du fichier
cp2011.pdf (153.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01354448 , version 1 (24-03-2020)

Identifiers

Cite

Vianney Le Clément de Saint-Marcq, Yves Deville, Christine Solnon. An Efficient Light Solver for Querying the Semantic Web. 17th International Conference on Principles and Practice of Constraint Programming (CP), Sep 2011, Perugia, Italy. pp.145-159, ⟨10.1007/978-3-642-23786-7_13⟩. ⟨hal-01354448⟩
62 View
60 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More