Graphical user interface graphics-based interpolated animation performance
View Patent ↗A computer-implemented method provides for receiving via a processor a query of at least two terms, presenting a node for each term in a graphical display, positioning a cursor in the graphical display, displaying a list of results, repositioning a cursor in the graphical display based on a user input, and displaying a new list of results based on the relative weightings of at least one term associated with its node in a new processing of the query. The method also provides for receiving via a processor a query, presenting a plurality of nodes in a graphical display where each node is associated with a search engine, displaying results from processing the query using the search engine associated with the nodes, repositioning a cursor in the graphical display, and displaying a new list of results where repositioning the cursor changes the relative weightings of the search engine associated with its node.
1. A computer-implemented method of searching, the method comprising:
receiving via a processor a query having at least two terms;
presenting in a graphical display a node for each received term;
positioning a cursor in the graphical display;
displaying a list of results from a processing of the query;
repositioning a cursor in the graphical display based on a user input; and
displaying a new list of results in which the repositioning of the cursor causes a change in relative weightings of at least one term associated with its node in a new processing of the query.
2. The method of claim 1 , wherein the nodes are arranged in a simulated three dimensional display.
3. The method of claim 1 , wherein terms having no semantic association are arranged near one another.
4. The method of claim 1 , wherein the closer the cursor is to a respective node, the stronger the relative weighting is for that term in processing the query.
5. The method of claim 1 , wherein the change in relative weightings is based on a distance between the cursor and each respective node.
6. The method of claim 1 , further comprising:
modifying a position of a respective node in the graphical display based on received user input.
7. The method of claim 1 , wherein the existence of a node is manipulated by receiving a chosen factor from a list of factors by the user.
8. The method of claim 1 , wherein when the cursor is positioned on a node, the term associated with that node receives a strongest respective weighting in processing the query.
9. A computer-implemented method of searching, the method comprising:
receiving via a processor a query;
presenting in a graphical display a plurality of nodes, wherein each node is associated with a search engine;
positioning a cursor in the graphical display;
displaying a list of results from a processing of the query using the search engine associated with the plurality of nodes;
repositioning a cursor in the graphical display; and
displaying a new list of results in which the repositioning of the cursor causes a change in relative weightings of at least one search engine associated with its node in a new processing of the query.
10. The method of claim 9 , wherein the nodes are arranged in a simulated three dimensional display.
11. The method of claim 9 , wherein the closer the cursor is to a respective node, the stronger the relative weighting is for that search engine in processing the query.
12. The method of claim 9 , wherein the change in relative weightings is based on a distance between the cursor and each respective node.
13. The method of claim 9 , further comprising:
modifying a position of a respective node in the graphical display based on received user input.
14. The method of claim 9 , wherein the existence of a node is manipulated by receiving a chosen factor from a list of factors by the user.
15. The method of claim 9 , wherein when the cursor is positioned on a node, the search engine associated with that node receives a strongest respective weighting in processing the query.