S. Chaudhuri. Finding nonrecursive envelopes for database predicates. In ACM Symposium on Principles of Database Systems (PODS'93), pages 135--146. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Models of Approximation in Databases - Libkin (Correct)
.... to classify those models according to some general principle ffl Do approximation constructs correspond to (a combination of) known datatypes ffl How can we program with approximations Note that the problems of approximation have been studied by the datalog community; see, for example, [10, 11]. There are, however, major differences between the problems that are addressed. In papers like [10, 11] information is complete, and using approximations reduces the complexity of query evaluation. For example, upper and lower envelopes are defined as datalog programs whose result would always be ....
....to (a combination of) known datatypes ffl How can we program with approximations Note that the problems of approximation have been studied by the datalog community; see, for example, 10, 11] There are, however, major differences between the problems that are addressed. In papers like [10, 11] information is complete, and using approximations reduces the complexity of query evaluation. For example, upper and lower envelopes are defined as datalog programs whose result would always be superset (subset) of a given program P . If P is a recursive program, envelopes are usually sought in ....
[Article contains additional citation context not shown here]
S. Chaudhuri. Finding nonrecursive envelopes for database predicates. In ACM Symposium on Principles of Database Systems (PODS'93), pages 135--146.
Approximation in Databases - Libkin (1995) (7 citations) (Correct)
.... Is it possible to classify those models according to some general principle Do approximations corresponds to (a combination of) known datatypes How do we program with approximations Note that the problems of approximation have been studied by the datalog community; see, for example, [6, 7]. There are, however, major differences between the problems that are addressed. In papers like [6, 7] information is complete, and using approximations reduces the complexity of query evaluation. For example, upper and lower envelopes are defined as datalog programs whose result would always be ....
....corresponds to (a combination of) known datatypes How do we program with approximations Note that the problems of approximation have been studied by the datalog community; see, for example, 6, 7] There are, however, major differences between the problems that are addressed. In papers like [6, 7] information is complete, and using approximations reduces the complexity of query evaluation. For example, upper and lower envelopes are defined as datalog programs whose result would always be superset (subset) of a given program P . If P is a recursive program, envelopes are usually sought in ....
[Article contains additional citation context not shown here]
S. Chaudhuri. Finding nonrecursive envelopes for database predicates. In PODS-93, pages 135--146.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC