Identifier

etd-1109103-231721

Degree

Doctor of Philosophy (PhD)

Department

Computer Science

Document Type

Dissertation

Abstract

In this dissertation we propose a new technique for efficient query processing in knowledge base systems. Query processing in knowledge base systems poses strong computational challenges because of the presence of combinatorial explosion. This arises because at any point during query processing there may be too many subqueries available for further exploration. Overcoming this difficulty requires effective mechanisms for choosing from among these subqueries good subqueries for further processing. Inspired by existing works on stochastic logic programs, compositional modeling and probabilistic heuristic estimates we create a new, nondeterministic method to accomplish the task of subquery selection for query processing. Specifically, we use probabilistic heuristic estimates to make the necessary decisions. This approach combines subquery and knowledge base properties and previous query processing experience with conditional probability theory to derive a probability of success for each subquery. The probabilities of success are used to select the next subquery for further processing. The underlying, property-specific probabilities of success are learned via a machine learning process involving a set of training sample queries. In this dissertation we present our new methodology and the algorithms used to accomplish both the training and query processing phases of the system. We also present a method for determining the minimum training set size needed to achieve probability estimates with any desired limit on the maximum size of the errors.

Date

2003

Document Availability at the Time of Submission

Release the entire work immediately for access worldwide.

Committee Chair

Jianhua Chen

Share

COinS