Abstract: A method of performing a navigated associative search on a set of heterogeneous databases is described, the method implemented on a general purpose computer. The method comprises converting each database of the set of databases into a schema-free structure called a hyperbase. The hyperbases corresponding to each database of the set of databases are combined into a single combined hyperbase, and that single hyperbase is normalized into a single normalized hyperbase. An associative search on the single hyperbase includes providing a set of input words and a set of locations. The method of the present invention determines an answer, which is that sub-hyperbase of the hyperbase to be searched which has minimum "cost" according to a criterion. The location representing the object of the query answer also is determined. Once an answer is determined, the answer is displayed to the user. New queries may be navigated starting at a location or locations chosen by the user.

Abstract: A method of performing an associative search on a set of heterogeneous databases is described, the method implemented on a general purpose computer. The method comprises converting each database of the set of databases into a schema-free structure called a hyperbase. The hyperbases corresponding to each database of the set of databases are combined into a single combined hyperbase, and that single hyperbase is normalized into a single normalized hyperbase. An associative search on the single hyperbase includes providing a set of input words. The method of the present invention determines an answer, which is that sub-hyperbase of the hyperbase to be searched which has minimum "cost" according to a criterion. Once an answer is determined, the answer is displayed to the user.