Method and apparatus for indexing, searching and displaying data

• US 20060242564A1
• Filed: 04/17/2006
• Published: 10/26/2006
• Est. Priority Date: 06/14/1993
• Status: Active Grant

• Current Assignee: Daniel Egger
• Original Assignee: Software Rights Archive, LLC (Altitude Capital Partners)
• Inventors: Cannon, Shawn, Egger, Daniel, Sauers, Ronald D.
• Granted Patent: US 7,840,524 B2
• Time in Patent Office: Days
• US Class Current: 715/210
• CPC Class Codes: G06F 16/2228 Indexing structures
• CPC Class Codes: G06F 16/2457 with adaptation to user needs
• CPC Class Codes: G06F 16/248 Presentation of query results
• CPC Class Codes: G06F 16/35 Clustering; Classification
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 16/9532 Query formulation
• CPC Class Codes: G06F 16/9538 Presentation of query results
• CPC Class Codes: G06F 16/9558 Details of hyperlinks; Management of linked annotations
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing

Abstract

A computer research tool for indexing, searching and displaying data is disclosed. Specifically, a computer research tool for performing computerized research of data including textual objects in a database or a network and for providing a user interface that significantly enhances data presentation is described. Textual objects and other data in a database or network is indexed by creating a numerical representation of the data. The indexing technique called proximity indexing generates a quick-reference of the relations, patterns and similarity found among the data in the database. Proximity indexing indexes the data by using statistical techniques and empirically developed algorithms. Using this proximity index, an efficient search for pools of data having a particular relation, pattern or characteristic can be effectuated. The Computer Search program, called the Computer Search Program for Data represented in Matrices (CSPDM), provides efficient computer search methods. The CSPDM rank orders data in accordance with the data'"'"'s relationship to time, a paradigm datum, or any similar reference. An alternative embodiment of the invention employs a cluster link generation algorithm which uses links and nodes to index and search a database or network. The algorithm searches for direct and indirect links to a search node and retrieves the nodes which are most closely related to the search node. The user interface program, called the Graphical User Interface (GUI), provides a user friendly method of interacting with the CSPDM program and prepares and presents a visual graphical display. The graphical display provides the user with a two or three dimensional spatial orientation of the data.

Claims

1. A method related to a web having identifiable web pages and Universal Resource Locators with pointers, comprising:

identifying Universal Resource Locators for the web pages, wherein the identified Universal Resource Locators either point to or point away from an identified web page;

analyzing Universal Resource Locators, including the identified Universal Resource Locators, wherein Universal Resource Locators which have an indirect relationship to the chosen web page are located, wherein the step of analyzing further comprises cluster analyzing the Universal Resource Locators for indirect relationships; and

,

wherein the located Universal Resource Locators are used to identify at least one web page.

2. The method of claim 1, further comprising hyperjumping to the identified web page.

3. A method for navigating documents on the world wide web, comprising:

identifying documents that have a direct relationship to a chosen document;

locating documents that have an indirect relationship to the chosen document identifying Universal Resource Locators for the documents, wherein the identified Universal Resource Locators either point to or point away from the chosen document; and

,

analyzing Universal Resource Locators, including the identified Universal Resource Locators, wherein Universal Resource Locators which have an indirect relationship to the chosen document are located, wherein the step of analyzing further comprises cluster analyzing the Universal Resource Locators for indirect relationships.

4. The method of claim 3, wherein pages and their respective Universal Resource Locators are used and locating documents comprises analyzing the pages and their respective Universal Resource Locators.

5. The method of claim 3, wherein analyzing pages comprises cluster analyzing the pages.

6. A method adapted for use with a network having hyperjump data, comprising:

accessing the hyperjump data;

identifying hyperjump data from within the accessed hyperjump data that has a direct reference to a chosen node;

determining hyperjump data from within the accessed hyperjump data that has an indirect reference to the chosen node using the identified hyperjump data;

generating a source map using one or more of the determined hyperjump data, wherein the source map represents hyperjump links that identify the chosen node as a destination of a link; and

,

activating a link represented on the source map, wherein a user may hyperjump to a node represented as a node of the link.