D. Willard. Efficient processing of relational calculus using range query theory. In Proc. ACM Symp. on Principles of Database Systems, pages 164--175, 1984.  Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Negative Boolean Constraints - Marriott, Odersky (1994) (3 citations) (Correct)
....by just positive constraints. Using the results given here, arbitrary multivariate spatial queries can be decomposed into sequences of univariate queries. Previously, spatial query languages were restricted to queries with acyclic variable dependencies in order to make query decomposition feasible [20]. This has been investigated in more detail in [9, 10] Part of this work was done while both authors were at I.B.M. Thomas J. Watson Research Center Another application is in machine reasoning as simple Boolean inequations suffice to complete all possible syllogistic moods, and thus complete ....
D. Willard. Efficient processing of relational calculus using range query theory. In Proc. ACM Symp. on Principles of Database Systems, pages 164--175, 1984.
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