Abstract
In the paper, we propose to regard a problem of processing of SPARQL queries to the ontology as a constraint satisfaction problem. The formal apparatus for formalization of constraint satisfaction problems by means of specialized matrix-like structures is briefly given. The use of this apparatus allows one to describe, store and process non-numeric constraints of the subject domain more efficiently compared with the table representation. To speed up processing of queries to big ontologies it is proposed to apply the non-numeric constraint propagation technique previously developed by the authors. Compared with the traditional approach to processing of the SPARQL queries, which is based on dynamic programming, the proposed technique allows one to accelerate their performance by compact representation of ontology, as well as by using the original rules of the search space reduction. Application of the mathematical apparatus for reducing the dimension of the search space at processing a query to the ontology of multidisciplinary knowledge is exemplified.
Highlights
We propose to regard a problem of processing of SPARQL queries to the ontology as a constraint satisfaction problem
The formal apparatus for formalization of constraint satisfaction problems by means of specialized matrix-like structures is briefly given. The use of this apparatus allows one to describe, store and process non-numeric constraints of the subject domain more efficiently compared with the table representation
To speed up processing of queries to big ontologies it is proposed to apply the non-numeric constraint propagation technique previously developed by the authors
Summary
ОЛЕЙНИК ПРИМЕНЕНИЕ МЕТОДОВ РАСПРОСТРАНЕНИЯ ОГРАНИЧЕНИЙ ДЛЯ УСКОРЕНИЯ ОБРАБОТКИ ЗАПРОСОВ Применение методов распространения ограничений для ускорения обработки запросов к онтологиям. Предлагается рассматривать задачу обработки SPARQL-запросов к онтологии как задачу удовлетворения ограничений. Для ускорения обработки запросов к онтологиям большого объема предлагается применить ранее разработанный авторами метод распространения нечисловых ограничений.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
