Relational queries computable in polynomial time
N Immerman - Proceedings of the fourteenth annual ACM symposium …, 1982 - dl.acm.org
Query languages for relational databases have received considerable attention. In 1972
Codd [Cod72] showed that two natural mathematical languages for queries—one algebraic …
Codd [Cod72] showed that two natural mathematical languages for queries—one algebraic …
[PDF][PDF] Relational Queries Computable in Polynomial Time
N Immerman - 1985 - cs.yale.edu
We characterize the polynomial time computable qneris as those expressible in relational
calculus plus a least fixed point operator and a total ordering on the universe. We also show …
calculus plus a least fixed point operator and a total ordering on the universe. We also show …
[PDF][PDF] Relational Queries Computable in Polynomial Time
N Immerman - 1985 - cvc.yale.edu
We characterize the polynomial time computable qneris as those expressible in relational
calculus plus a least fixed point operator and a total ordering on the universe. We also show …
calculus plus a least fixed point operator and a total ordering on the universe. We also show …
[PDF][PDF] Relational Queries Computable in Polynomial Time
N Immerman - Information and Control, 1986 - people.cs.umass.edu
We characterize the polynomial time computable queries as those expressible in relational
calculus plus a least xed point operator and a total ordering on the universe. We also show …
calculus plus a least xed point operator and a total ordering on the universe. We also show …
[PDF][PDF] Relational Queries Computable in Polynomial Time
N Immerman - Information and Control, 1986 - Citeseer
We characterize the polynomial time computable queries as those expressible in relational
calculus plus a least xed point operator and a total ordering on the universe. We also show …
calculus plus a least xed point operator and a total ordering on the universe. We also show …
[PDF][PDF] Relational Queries Computable in Polynomial Time
N Immerman - 1985 - cs-www.cs.yale.edu
We characterize the polynomial time computable qneris as those expressible in relational
calculus plus a least fixed point operator and a total ordering on the universe. We also show …
calculus plus a least fixed point operator and a total ordering on the universe. We also show …
[引用][C] Relational queries computable in polynomial time
N Immerman - Information and Control, 1986 - dl.acm.org
Relational queries computable in polynomial time | Information and Control skip to main
content ACM Digital Library home ACM home Google, Inc. (search) Advanced Search …
content ACM Digital Library home ACM home Google, Inc. (search) Advanced Search …
[PDF][PDF] Relational Queries Computable in Polynomial Time
N IMMERMAN - INFORMATION AND CONTROL, 1986 - core.ac.uk
We characterize the polynomial time computable queries as those expressible in relational
calculus plus a least fixed point operator and a total ordering on the universe. We also show …
calculus plus a least fixed point operator and a total ordering on the universe. We also show …
[PDF][PDF] Relational Queries Computable in Polynomial Time
N Immerman - 1985 - cs.yale.edu
We characterize the polynomial time computable qneris as those expressible in relational
calculus plus a least fixed point operator and a total ordering on the universe. We also show …
calculus plus a least fixed point operator and a total ordering on the universe. We also show …
[PDF][PDF] Relational Queries Computable in Polynomial Time
N Immerman - 1985 - cs.yale.edu
We characterize the polynomial time computable queries as those expressible in relational
calculus plus a least fixed point operator and a total ordering on the universe. We also show …
calculus plus a least fixed point operator and a total ordering on the universe. We also show …