Abstract

Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. The dominant strategies to improve the performance of answering queries are reusing answers to subqueries for top-down methods, and transforming rules based on demand from the query, such as the well-known magic sets transformation, for bottom-up methods. However, the performance of these strategies vary drastically, and the most effective method has remained unknown.

Keywords:
Datalog Computer science Query language Set (abstract data type) Query optimization Deductive database Reuse MAGIC (telescope) Conjunctive query Spatial query Transformation (genetics) Top-down and bottom-up design Theoretical computer science Sargable Information retrieval Programming language Database Web search query Relational database Search engine Chemistry

Metrics

24
Cited By
1.55
FWCI (Field Weighted Citation Impact)
33
Refs
0.83
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Data Management and Algorithms
Physical Sciences →  Computer Science →  Signal Processing
Advanced Database Systems and Queries
Physical Sciences →  Computer Science →  Computer Networks and Communications
Data Mining Algorithms and Applications
Physical Sciences →  Computer Science →  Information Systems

Related Documents

BOOK-CHAPTER

Datalog Queries

Texts in computer science Year: 2006 Pages: 40-55
JOURNAL ARTICLE

Efficient provenance tracking for datalog using top-k queries

Daniel DeutchAmir GiladYuval Moskovitch

Journal:   The VLDB Journal Year: 2018 Vol: 27 (2)Pages: 245-269
© 2026 ScienceGate Book Chapters — All rights reserved.