Moving selections into linear least fixpoint queries
- 6 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 452-461
- https://doi.org/10.1109/icde.1988.105491
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Alpha: an extension of relational algebra to express a class of recursive queriesIEEE Transactions on Software Engineering, 1988
- Bounds on the propagation of selection into logic programsPublished by Association for Computing Machinery (ACM) ,1987
- A study of transitive closure as a recursion mechanismPublished by Association for Computing Machinery (ACM) ,1987
- A time bound on the materialization of some recursively defined viewsAlgorithmica, 1986
- An amateur's introduction to recursive query processing strategiesPublished by Association for Computing Machinery (ACM) ,1986
- Filtering data flow in deductive databasesPublished by Springer Nature ,1986
- Magic sets and other strange ways to implement logic programs (extended abstract)Published by Association for Computing Machinery (ACM) ,1985
- Logic and Databases: A Deductive ApproachACM Computing Surveys, 1984
- Horn clauses and the fixpoint query hierarchyPublished by Association for Computing Machinery (ACM) ,1982
- Universality of data retrieval languagesPublished by Association for Computing Machinery (ACM) ,1979