On compile-time query optimization in deductive databases by means of static filtering

We extend the query optimization techniques known as algebric manipulations with relational expressions [48] to work with deductive databases. In particular, we propose a method for moving data-independent selections and projections into recursive axioms, which extends all other known techniques for...

Full description

Saved in:
Bibliographic Details
Published in:ACM transactions on database systems 1990-09, Vol.15 (3), p.385-426
Main Authors: Kifer, Michael, Lozinskii, Eliezer L.
Format: Article
Language:English
Subjects:
Applied sciences
Artificial intelligence
Computer science
control theory
systems
Computing methodologies
Data management systems
Database management system engines
Database query processing
Database query processing and optimization (theory)
Database theory
Discrete space search
Exact sciences and technology
Game tree search
Information retrieval
Information systems
Information systems. Data bases
Knowledge representation and reasoning
Machine learning
Machine learning approaches
Memory organisation. Data processing
Retrieval models and ranking
Retrieval tasks and goals
Rule learning
Search methodologies
Software
Theory and algorithms for application domains
Theory of computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!