page loader
Integrating Multi-threading into Query-Subquery Nets
Tác giả: Son Thanh Cao, Phan Anh Phong, Le Quoc Anh
350    0
Lecture Notes in Networks and Systems
Quyển: 243     Trang: 189-196
Năm xuất bản: 5/2021
Tóm tắt
In this paper, we propose a new method, named QSQN-MT, for the evaluation of queries to Horn knowledge bases. Particularly, we integrate multi-threading into query-subquery nets to reduce the execution time for evaluating a query over a logic program regardless of the order of clauses. The usefulness of the proposed method is indicated by the experimental results.
Từ khóa
Horn knowledge bases, Query processing, Deductive databases, QSQN, QSQN-MT, Multi-threading
Cùng tác giả
The web ontology rule language OWL 2 RL+ and its extensionsWORL: a nonmonotonic rule language for the semantic webAn Improved Depth-First Control Strategy for Query-Subquery Nets in Evaluating Queries to Horn Knowledge BasesAn Empirical Approach to Query-Subquery Nets with Tail-Recursion EliminationOn the Efficiency of Query-Subquery Nets with Right/Tail-Recursion Elimination in Evaluating Queries to Horn Knowledge BasesQuery-Subquery Nets with Stratified NegationGiáo trình Ngôn ngữ lập trình CQuery–subquery nets for Horn knowledge bases in first-order logicExtending Query-Subquery Nets for Deductive Databases under the Well-Founded SemanticsGiải pháp hiệu quả xây dựng hệ thống thông tin tổng thể quản trị Trường Đại học VinhA Max-Min Conflict Algorithm for the Stable Marriage ProblemIncorporating Stratified Negation into Query-Subquery Nets for Evaluating Queries to Stratified Deductive DatabasesFinding Maximum Stable Matchings for the Student-Project Allocation Problem with Preferences Over ProjectsỨNG DỤNG KỸ THUẬT HỌC MÁY TRÊN DỮ LIỆU MẤT CÂN BẰNG HỖ TRỢ DỰ ĐOÁN SỚM KHẢ NĂNG THÔI HỌC CỦA HỌC SINH TRUNG HỌC PHỔ THÔNGMột thuật toán tìm kiếm cục bộ hiệu quả giải bài toán phân công địa điểm thực tập cho sinh viênA Heuristic Repair Algorithm for the Maximum Stable Marriage Problem with Ties and Incomplete ListsAn Empirical Heuristic Algorithm for Solving the Student-Project Allocation Problem with TiesFinding Maximum Weakly Stable Matchings for Hospitals/Residents with Ties Problem via Heuristic Search