The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - October (1994 vol.6)
pp: 842-849
ABSTRACT
<p>We study the complexity of processing a class of rules called simple binary rule sets. The data referenced by the rules are stored in secondary memory. A necessary and sufficient condition that a simple binary rule set can be processed in a single pass of a file containing the base relations is given. Because not all simple binary rule sets can be processed in a single pass, a necessary and sufficient condition that a simple binary rule set can be processed by a constant number of passes is also given.</p>
INDEX TERMS
query processing; computational complexity; expert systems; query processing; linear recursive binary rules; complexity; binary rule sets; secondary memory; necessary and sufficient condition
CITATION
K.-C. Guh, C. Yu, "Efficient Query Processing for a Subset of Linear Recursive Binary Rules", IEEE Transactions on Knowledge & Data Engineering, vol.6, no. 5, pp. 842-849, October 1994, doi:10.1109/69.317712
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool