An efficient light solver for querying the semantic web

Authors:
Vianney le Clément de Saint-Marcq;Yves Deville;Christine Solnon
Affiliations:
ICTEAM Research Institute, Université catholique de Louvain, Louvain-la-Neuve, Belgium and Université de Lyon, LIRIS, CNRS UMR5205, Villeurbanne, France;ICTEAM Research Institute, Université catholique de Louvain, Louvain-la-Neuve, Belgium;Université de Lyon, LIRIS, CNRS UMR5205, Villeurbanne, France
Venue:
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Year:
2011

Citing 11
Cited 1

Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema

ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Solving SQL Constraints by Incremental Translation to SAT

IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
A SQL database system for solving constraints

Proceedings of the 2nd PhD workshop on Information and knowledge management
The Expressive Power of SPARQL

ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
SP^2Bench: A SPARQL Performance Benchmark

ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Semantics and complexity of SPARQL

ACM Transactions on Database Systems (TODS)
Foundations of SPARQL query optimization

Proceedings of the 13th International Conference on Database Theory
AllDifferent-based filtering for subgraph isomorphism

Artificial Intelligence
Structured data on the web

Communications of the ACM
RDF entailment as a graph homomorphism

ISWC'05 Proceedings of the 4th international conference on The Semantic Web
SPARQL query processing with conventional relational database systems

WISE'05 Proceedings of the 2005 international conference on Web Information Systems Engineering

Castor: a constraint-based SPARQL engine with active filter processing

ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The SemanticWeb 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.