7. A computer for providing a visualization graph, comprising: a database configured to store data corresponding to nodes, wherein a semantic net includes the nodes and wherein the nodes are linked to each other by relations; a storage medium having recorded therein processor readable code processable to: provide a visualization graph, perform a query on the database to determine result nodes, and determine a predetermined distance as a number of relations on a shortest path between a particular result node and a focus node, wherein the result nodes outside the predetermined distance are not displayed on the visualization graph unless they are of particular interest, and wherein the predetermined distance is more than one relation; and an output device configured to display the visualization graph representing results of the query by displaying a subset of the result nodes, the visualization graph including: the focus node, defined by a user or the query; a first result node that is directly related to the focus node; a second result node that is indirectly related to the focus node and is within a predetermined distance from the focus node; and a third result node that is indirectly related to the focus node and is outside the predetermined distance from the focus node yet which is displayed because it is of particular interest, wherein the code further includes context code processable to express context information which is processable to determine that the third result node is of particular interest with respect to the focus node, wherein the context information identifies the particular interest on the basis of a node type or relations linking the third result node to the focus node wherein the results of the query comprise a fourth node that is indirectly related to the focus node, and wherein the fourth node is not displayed in the visualization graph because it is outside the predetermined distance and is not determined to be of particular interest.
7. A computer for providing a visualization graph, comprising: a database configured to store data corresponding to nodes, wherein a semantic net includes the nodes and wherein the nodes are linked to each other by relations; a storage medium having recorded therein processor readable code processable to: provide a visualization graph, perform a query on the database to determine result nodes, and determine a predetermined distance as a number of relations on a shortest path between a particular result node and a focus node, wherein the result nodes outside the predetermined distance are not displayed on the visualization graph unless they are of particular interest, and wherein the predetermined distance is more than one relation; and an output device configured to display the visualization graph representing results of the query by displaying a subset of the result nodes, the visualization graph including: the focus node, defined by a user or the query; a first result node that is directly related to the focus node; a second result node that is indirectly related to the focus node and is within a predetermined distance from the focus node; and a third result node that is indirectly related to the focus node and is outside the predetermined distance from the focus node yet which is displayed because it is of particular interest, wherein the code further includes context code processable to express context information which is processable to determine that the third result node is of particular interest with respect to the focus node, wherein the context information identifies the particular interest on the basis of a node type or relations linking the third result node to the focus node wherein the results of the query comprise a fourth node that is indirectly related to the focus node, and wherein the fourth node is not displayed in the visualization graph because it is outside the predetermined distance and is not determined to be of particular interest. 11. The computer according to claim 7 , wherein the predetermined distance further comprises a number of relations between an indirectly related result node and the focus node.