Foundations of logic programming
Foundations of logic programming
On compiling queries in recursive first-order databases
Journal of the ACM (JACM)
Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
On the implementation of a simple class of logic queries for databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
The generalized counting method for recursive logic queries
Proceedings on International conference on database theory
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Sets and negation in a logic data base language (LDL1)
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bounds on the propagation of selection into logic programs
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A framework for testing safety and effective computability of extended datalog
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Compiling separable recursions
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
SYGRAF: Implementing Logic Programs in a Database Style
IEEE Transactions on Software Engineering
Efficient evaluation of right-, left-, and multi-linear rules
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Logic programming as constructivism: a formalization and its application to databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bottom-up beats top-down for datalog
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the power of Alexander templates
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Linearising nonlinear recursions in polynomial time
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On compile-time query optimization in deductive databases by means of static filtering
ACM Transactions on Database Systems (TODS)
Parallel processing of recursive queries in distributed architectures
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Commutativity and its role in the processing of linear recursion
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Argument reduction by factoring
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Necessary and sufficient conditions to linearize doubly recursive programs in logic databases
ACM Transactions on Database Systems (TODS)
Hard problems for simple logic programs
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Towards an algebraic theory of recursion
Journal of the ACM (JACM)
Detecting redundant tuples during query evaluation
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the expected size of recursive Datalog queries
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient Evaluation of Multiple Linear Recursions
IEEE Transactions on Software Engineering
Communicating control knowledge to a deductive database system
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Communications of the ACM
Implementing deductive databases by linear programming
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Magic-sets transformation in nonrecursive systems
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An alternating fixpoint tailored to magic programs
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Compiling query constraints (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
LogicBase: a deductive database system prototype
CIKM '94 Proceedings of the third international conference on Information and knowledge management
A performance study of transitive closure algorithms
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
How to forget the past without repeating it
Journal of the ACM (JACM)
Modular stratification and magic sets for Datalog programs with negation
Journal of the ACM (JACM)
Decomposition of magic rewriting
Journal of the ACM (JACM)
Shape analysis as a generalized path problem
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Magic factoring of closure programs (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Scheduling and mapping for parallel execution of extended SQL queries
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Demand interprocedural dataflow analysis
SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
ACM Transactions on Database Systems (TODS)
Practical program analysis using general purpose logic programming systems—a case study
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Implementing deductive databases by mixed integer programming
ACM Transactions on Database Systems (TODS)
Perspectives on database theory
ACM SIGACT News
An analysis of magic sets and related optimization strategies for logic queries
Journal of the ACM (JACM)
Polynomial-time program transformations in deductive databases
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Modular stratification and magic sets for DATALOG programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Graph-theoretic methods in database theory
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimizing existential datalog queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A generalized transitive closure for relational queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Counting methods for cyclic relations
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An experimental performance study of a pipelined recursive query processing strategy
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Dynamically distributed query evaluation
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Generating efficient plans for queries using views
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Answering queries with useful bindings
ACM Transactions on Database Systems (TODS)
Database compression with data mining methods
Information organization and databases
An introduction to deductive database languages and systems
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
The glue-nail deductive database system: design, implementation, and evaluation
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
DECLARE and SDS: early efforts to commercialize deductive database technology
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
The aditi deductive database system
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
What You Always Wanted to Know About Datalog (And Never Dared to Ask)
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Moving Selections into Linear Least Fixpoint Queries
IEEE Transactions on Knowledge and Data Engineering
COMPLEX: An Object-Oriented Logic Programming System
IEEE Transactions on Knowledge and Data Engineering
Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs
IEEE Transactions on Knowledge and Data Engineering
A Study on the Structure of Linear Recursion
IEEE Transactions on Knowledge and Data Engineering
A Deductive Environment for Dealing with Objects and Nonmonotonic Reasoning
IEEE Transactions on Knowledge and Data Engineering
Efficient Recursive Aggregation and Negation in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
Hyperlog: A Graph-Based System for Database Browsing, Querying, and Update
IEEE Transactions on Knowledge and Data Engineering
LDL: A Technology for the Realization of Tightly Coupled Expert Database Systems
IEEE Expert: Intelligent Systems and Their Applications
Logic Approaches for Deductive Databases
IEEE Expert: Intelligent Systems and Their Applications
Evaluating Recursive Queries in Distributed Databases
IEEE Transactions on Knowledge and Data Engineering
On Answering Queries in the Presence of Limited Access Patterns
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Query Optimization of Disjunctive Databases with Constraints through Binding Propagation
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Binding Propagation in Disjunctive Databases
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Computing Facts in Non-Horn Deductive Systems
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
The Magic of Duplicates and Aggregates
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Factoring Augmented Regular Chain Programs
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Right-, left- and multi-linear rule transformations that maintain context information
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
How to Forget the Past Without Repeating It
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Aggregation and Relevance in Deductive Databases
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A Domain-theoretic Approach to Integrating Functional and Logic Database Languages
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Query Optimization by Predicate Move-Around
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Magic Sets Method with Fuzzy Logic
ADVIS '02 Proceedings of the Second International Conference on Advances in Information Systems
Data and knowledge in database systems: deductive databases
Handbook of data mining and knowledge discovery
Computing complete answers to queries in the presence of limited access patterns
The VLDB Journal — The International Journal on Very Large Data Bases
Managing multiple and distributed ontologies on the Semantic Web
The VLDB Journal — The International Journal on Very Large Data Bases
Bottom-up method for processing recursive sets of rules
CompSysTech '03 Proceedings of the 4th international conference conference on Computer systems and technologies: e-Learning
Declarative routing: extensible routing with declarative queries
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A mapping system for the integration of OWL-DL ontologies
Proceedings of the first international workshop on Interoperability of heterogeneous information systems
Using views to generate efficient evaluation plans for queries
Journal of Computer and System Sciences
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
Journal of Automated Reasoning
Adding magic to an optimising datalog compiler
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A New Proposal for Debugging Datalog Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
A Theoretical Framework for the Declarative Debugging of Datalog Programs
Semantics in Data and Knowledge Bases
Efficient maintenance techniques for views over active documents
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Automating rendezvous and proxy selection in sensornets
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Query Answering for OWL-DL with rules
Web Semantics: Science, Services and Agents on the World Wide Web
The consistency extractor system: Answer set programs for consistent query answering in databases
Data & Knowledge Engineering
A semantically enabled service oriented architecture
WImBI'06 Proceedings of the 1st WICI international conference on Web intelligence meets brain informatics
Optimizing query answering over OWL ontologies
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
D2R2: disk-oriented deductive reasoning in a RISC-style RDF engine
RuleML'11 Proceedings of the 5th international conference on Rule-based modeling and computing on the semantic web
Query optimization for a graph database with visual queries
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Datalog relaunched: simulation unification and value invention
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Finitely recursive programs: Decidability and bottom-up computation
AI Communications
Spinning fast iterative data flows
Proceedings of the VLDB Endowment
Modifying Intensional Logic Knowledge
Fundamenta Informaticae
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
Efficient querying of inconsistent databases with binary integer programming
Proceedings of the VLDB Endowment
| Hi-index | 0.02 |
This paper considers the efficient evaluation of recursive queries expressed using Horn Clauses. We define sideways information passing formally and show how a query evaluation algorithm may be defined in terms of sideways information passing and control. We then consider a class of information passing strategies which suffices to describe most query evaluation algorithms in the database literature, and show that these strategies may always be implemented by rewriting a given program and evaluating the rewritten program bottom-up. We describe in detail several algorithms for rewriting a program. These algorithms generalize the Counting and Magic Sets algorithms to work with arbitrary programs. Safety and optimality of the algorithms are also considered.