US6278992B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Search engine using indexing method for storing and retrieving data
Assignee: EXCELLERATE LLC
•
Filing: 1999-02-17
•
Granted: 2001-08-21
•
Expires: 2019-02-17
Abstract
Abstract A Search Engine utilizing a method and system for efficient storage and retrieval of data. The system comprises a record file, an index file, a duplicate segment file and access to a network of computers. The index files contains locations of data items, pointers to other index files, or an empty designation. The index files are arrays that contain locations corresponding to a predetermined range of characters with which the data items may be formed. Data items are stored according to the character strings of each data item. The first portion of a data object is indexed according to the indexing method of the present invention while a second portion of the data object is indexed according to another known database technology, such as B-tree.
Inventors
- 👤 John Andrew Curtis
- 👤 Gordon Frank Scherer
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 21:49
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/22; G06F16/2228; G06F16/2237; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99932; Y10S707/99933; Y10S707/99941; Y10S707/99944
Claims Analysis
Total Claims: 58
Claim 1
Independent Claim
158 words
A method for storing data for rapid retrieval, comprising the steps of: creating a plurality of index arrays having locations wherein said locations are associated with a character or group of characters; providing a record file for storing a plurality of data items, each of said data items having a string of characters, wherein said locations of said plurality of index arrays are adapted to store either a pointer to a second index array or a second data item and wherein at least one of said plurality of index arrays is adapted to store a pointer to another database indexing structure; indexing a first predetermined portion of each of said plurality of data items in said plurality of index arrays; pointing to said another database indexing structure; indexing a second predetermined portion of each of said plurality of data items in said another database indexing structure; and wherein said another database indexing structure is a B-tree indexing structure.
Claim 2
Independent Claim
158 words
A method for storing data for rapid retrieval, comprising the steps of: creating a plurality of index arrays having locations wherein said locations are associated with a character or group of characters; providing a record file for storing a plurality of data items, each of said data items having a string of characters, wherein said locations of said plurality of index arrays are adapted to store either a pointer to a second index array or a second data item and wherein at least one of said plurality of index arrays is adapted to store a pointer to another database indexing structure; indexing a first predetermined portion of each of said plurality of data items in said plurality of index arrays; pointing to said another database indexing structure; indexing a second predetermined portion of each of said plurality of data items in said another database indexing structure; and wherein said another database indexing structure is a B-tree indexing structure.
Claim 3
Dependent Claim
17 words
A method according to claim 1 wherein said another database indexing structure is a hash indexing structure.
Claim 4
Independent Claim
148 words
A method of indexing a collection of data objects, wherein a tree index structure is used in combination with a predetermined second indexing structure, comprising the steps of: creating a first level index array; expanding the levels of said tree index structure to a plurality of additional layers of index arrays and wherein said first level index array and each of said index arrays in said plurality of additional layers of index arrays have a plurality of locations corresponding to at least one character of a predetermined list of characters; indexing a first predetermined portion of a data object in said first level index array and in each of said plurality of additional layers of index arrays; pointing to said predetermined second indexing structure; indexing a second portion of said data object in said second indexing structures; and wherein said second indexing structure is a B-tree indexing structure.
Claim 5
Independent Claim
148 words
A method of indexing a collection of data objects, wherein a tree index structure is used in combination with a predetermined second indexing structure, comprising the steps of: creating a first level index array; expanding the levels of said tree index structure to a plurality of additional layers of index arrays and wherein said first level index array and each of said index arrays in said plurality of additional layers of index arrays have a plurality of locations corresponding to at least one character of a predetermined list of characters; indexing a first predetermined portion of a data object in said first level index array and in each of said plurality of additional layers of index arrays; pointing to said predetermined second indexing structure; indexing a second portion of said data object in said second indexing structures; and wherein said second indexing structure is a B-tree indexing structure.
Claim 6
Dependent Claim
120 words
A hybrid indexing structure for indexing a plurality of data objects comprising: a plurality of index segments, said plurality of index segments having locations associated with a character or group of characters, and wherein said locations of said index segments are adapted to store either a pointer to another index segment or a second data element; a second database structure pointed to by at least one location of one index segment; wherein a first portion of each of said plurality of data objects are indexed by said plurality of index segments and a second portion of each of said plurality of data objects are indexed by said second database structure; and wherein said second database structure is a B-tree structure.
Claim 7
Dependent Claim
120 words
A hybrid indexing structure for indexing a plurality of data objects comprising: a plurality of index segments, said plurality of index segments having locations associated with a character or group of characters, and wherein said locations of said index segments are adapted to store either a pointer to another index segment or a second data element; a second database structure pointed to by at least one location of one index segment; wherein a first portion of each of said plurality of data objects are indexed by said plurality of index segments and a second portion of each of said plurality of data objects are indexed by said second database structure; and wherein said second database structure is a B-tree structure.
Claim 8
Dependent Claim
22 words
A system according to claim 4 wherein said second data element is a pointer to one of said plurality of data objects.
Claim 9
Dependent Claim
19 words
A system according to claim 4 wherein said second data element is a pointer to said second database structure.
Claim 10
Dependent Claim
23 words
A system according to claim 4 wherein each one of said index segments corresponds to a predetermined character position of said data objects.
Claim 11
Dependent Claim
139 words
A hybrid indexing structure for indexing a plurality of data objects comprising: a first database structure; a plurality of layers of index segments, each of said index segments having locations wherein each of said locations are associated with a character, and wherein said locations of said index segments are adapted to store either a pointer to another index segment or a second data element, wherein said first database structure points to said at least one of said index segments from said plurality of layers of index segments; wherein a first portion of each of said plurality of data objects are indexed by said first database structure and wherein a second portion of each of said plurality of data objects are indexed by said plurality of layers of index segments; and wherein said first database structure is a B-tree structure.
Claim 12
Dependent Claim
139 words
A hybrid indexing structure for indexing a plurality of data objects comprising: a first database structure; a plurality of layers of index segments, each of said index segments having locations wherein each of said locations are associated with a character, and wherein said locations of said index segments are adapted to store either a pointer to another index segment or a second data element, wherein said first database structure points to said at least one of said index segments from said plurality of layers of index segments; wherein a first portion of each of said plurality of data objects are indexed by said first database structure and wherein a second portion of each of said plurality of data objects are indexed by said plurality of layers of index segments; and wherein said first database structure is a B-tree structure.
Claim 13
Dependent Claim
140 words
An indexing process for use in Internet search engines, comprising the steps of: retrieving a collection of data items from the Internet, said collection of data items associated with an address; indexing said data items, said indexing further comprising the steps of: a. creating a plurality of index arrays, each of said index arrays having locations wherein each of said locations is associated with a character or group of characters; b. indexing a first predetermined portion of each of said plurality of data items in said plurality of index arrays; c. configuring at least one of said index arrays with a reference for each unique data item, said reference used to locate an address associated with each of said indexed data items; and d. wherein said reference is stored in a terminating character position of one of said index arrays.
Claim 14
Dependent Claim
140 words
An indexing process for use in Internet search engines, comprising the steps of: retrieving a collection of data items from the Internet, said collection of data items associated with an address; indexing said data items, said indexing further comprising the steps of: a. creating a plurality of index arrays, each of said index arrays having locations wherein each of said locations is associated with a character or group of characters; b. indexing a first predetermined portion of each of said plurality of data items in said plurality of index arrays; c. configuring at least one of said index arrays with a reference for each unique data item, said reference used to locate an address associated with each of said indexed data items; and d. wherein said reference is stored in a terminating character position of one of said index arrays.
Claim 15
Dependent Claim
45 words
An indexing process according to claim 9 , wherein a first level index array corresponds to a first character of said data items to be indexed and wherein a second level index array corresponds to a second character of said data items to be indexed.
Claim 16
Dependent Claim
23 words
An indexing process according to claim 9 , wherein said reference is a unique numerical value associated with a corresponding unique data item.
Claim 17
Dependent Claim
39 words
An indexing process according to claim 11 , further comprising the step of: associating each of said unique numerical values with all addresses of said collections of data items containing said data item referenced by said unique numerical value.
Claim 18
Dependent Claim
25 words
An indexing process according to claim 12 , wherein said collection of data items is a web page and wherein said address is a URL.
Claim 19
Dependent Claim
30 words
An indexing process according to claim 9 , wherein said reference is a record location for a record containing addresses of all collections of data items containing said data item.
Claim 20
Dependent Claim
14 words
An indexing process according to claim 9 , wherein said address is a URL.
Claim 21
Dependent Claim
27 words
An indexing process according to claim 9 , further comprising: providing a separate index structure for each of said URLs of said collection of data items retrieved.
Claim 22
Dependent Claim
151 words
An indexing process for use in Internet search engines, comprising the steps of: retrieving a Web page from said Internet, including a URL associated with said retrieved Web page; indexing data items from said Web page, said indexing further comprised of the steps of: a. creating an index structure by creating a plurality of index arrays, each of said index arrays having locations wherein each of said locations is associated with a character or group of characters, wherein said locations of said plurality of index arrays are adapted to store either a pointer to another index array or a second data element; b. associating a unique reference for each unique data item in said index structure; associating each of said unique references to Web pages containing said unique data items; and wherein said unique reference for each unique data item is stored in a terminating character position of said index structure.
Claim 23
Dependent Claim
151 words
An indexing process for use in Internet search engines, comprising the steps of: retrieving a Web page from said Internet, including a URL associated with said retrieved Web page; indexing data items from said Web page, said indexing further comprised of the steps of: a. creating an index structure by creating a plurality of index arrays, each of said index arrays having locations wherein each of said locations is associated with a character or group of characters, wherein said locations of said plurality of index arrays are adapted to store either a pointer to another index array or a second data element; b. associating a unique reference for each unique data item in said index structure; associating each of said unique references to Web pages containing said unique data items; and wherein said unique reference for each unique data item is stored in a terminating character position of said index structure.
Claim 24
Dependent Claim
15 words
An indexing process according to claim 17 , wherein said unique reference is a number.
Claim 25
Dependent Claim
29 words
An indexing process according to claim 22 , further comprising the step of: expanding said index structure to accommodate all unique combinations of said characters or group of characters.
Claim 26
Dependent Claim
24 words
An indexing process according to claim 17 wherein at least one of said plurality of index arrays stores pointer to another database indexing structure.
Claim 27
Independent Claim
178 words
A method for indexing Internet pages for subsequent searching and retrieval, said method comprising: providing a first index structure, said index structure having a plurality of index arrays, wherein each of said index arrays has a predetermined number of locations and wherein each of said locations is associated with a character and, wherein one of said locations of each of said index arrays corresponds to a terminating character reference; obtaining a first data item from a first Internet page; determining a first character of said first data item; placing a pointer to a second level index array in a location of a first level index array corresponding to said first character; indexing the remaining characters of said first data item in said index structure; placing a pointer to a last index array in an index array and index location corresponding to a last character of said first data item; and placing a reference value in a terminating character location of said last index array, wherein said reference value is used to retrieve the location of the Internet page.
Claim 28
Independent Claim
178 words
A method for indexing Internet pages for subsequent searching and retrieval, said method comprising: providing a first index structure, said index structure having a plurality of index arrays, wherein each of said index arrays has a predetermined number of locations and wherein each of said locations is associated with a character and, wherein one of said locations of each of said index arrays corresponds to a terminating character reference; obtaining a first data item from a first Internet page; determining a first character of said first data item; placing a pointer to a second level index array in a location of a first level index array corresponding to said first character; indexing the remaining characters of said first data item in said index structure; placing a pointer to a last index array in an index array and index location corresponding to a last character of said first data item; and placing a reference value in a terminating character location of said last index array, wherein said reference value is used to retrieve the location of the Internet page.
Claim 29
Dependent Claim
22 words
A method according to claim 21 , wherein said reference value is a unique numerical value assigned to said first data item.
Claim 30
Dependent Claim
29 words
A method according to claim 21 , further comprising the step of: using said reference value to look up all locations of Internet pages containing said first data item.
Claim 31
Dependent Claim
16 words
A method according to claim 21 , wherein said location of said Internet pages are URLs.
Claim 32
Dependent Claim
22 words
A method according to claim 24 , further comprising the step of: providing a second index structure for indexing all retrieved URLs.
Claim 33
Dependent Claim
18 words
A method according to claim 25 , wherein a URL reference value is assigned to each indexed URL.
Claim 34
Dependent Claim
123 words
An index structure for indexing data items retrieved from an Internet web page, said index structure comprised of: a plurality of index arrays, said index arrays having a predetermined number of locations and wherein each of said locations is associated with at least one character; wherein said locations of said index arrays are adapted to hold a pointer to another index array or another data element; wherein said data element is a reference value used to retrieve locations of Internet pages; wherein said reference value is a unique numerical value assigned to a unique data item indexed in said index structure; and wherein said unique numerical value for each unique data item is stored in a terminating character location of an index array.
Claim 35
Dependent Claim
123 words
An index structure for indexing data items retrieved from an Internet web page, said index structure comprised of: a plurality of index arrays, said index arrays having a predetermined number of locations and wherein each of said locations is associated with at least one character; wherein said locations of said index arrays are adapted to hold a pointer to another index array or another data element; wherein said data element is a reference value used to retrieve locations of Internet pages; wherein said reference value is a unique numerical value assigned to a unique data item indexed in said index structure; and wherein said unique numerical value for each unique data item is stored in a terminating character location of an index array.
Claim 36
Dependent Claim
25 words
An index structure according to claim 27 , wherein said character may be any character or symbol that may be found on a web page.
Claim 37
Dependent Claim
33 words
An index structure according to claim 27 , wherein said unique numerical value is used to retrieve all locations of web pages containing the unique data item assigned to said unique numerical value.
Claim 38
Dependent Claim
31 words
An index structure according to claim 27 , wherein said reference value used to retrieve locations of said Internet pages is stored in a terminating character location of an index array.
Claim 39
Dependent Claim
25 words
An index structure according to claim 30 , wherein said terminating character for each unique data item follows the last character of said data item.
Claim 40
Dependent Claim
92 words
An index structure for indexing a data item, comprising: a first index array, said first index array further comprised of: a. a first portion having a predetermined number of locations, each of said locations corresponding to a predetermined character or group of characters; b. a first pointer location for storing a pointer to another index array or a reference value, wherein said reference value is used to locate web pages containing the data item; and c. wherein said first pointer and said first pointer location are located in non-continuous locations in memory.
Claim 41
Dependent Claim
92 words
An index structure for indexing a data item, comprising: a first index array, said first index array further comprised of: a. a first portion having a predetermined number of locations, each of said locations corresponding to a predetermined character or group of characters; b. a first pointer location for storing a pointer to another index array or a reference value, wherein said reference value is used to locate web pages containing the data item; and c. wherein said first pointer and said first pointer location are located in non-continuous locations in memory.
Claim 42
Dependent Claim
23 words
An index structure according to claim 32 , wherein said first portion stores a “1”bit in a location to represent a “full” value.
Claim 43
Dependent Claim
43 words
An index structure according to claim 32 , wherein said first index array is further comprised of a second pointer location and wherein said second pointer location is adapted to store a pointer to another index array or to an overflow pointer array.
Claim 44
Dependent Claim
28 words
An index structure according to claim 34 , wherein said overflow pointer array is adapted to store a pointer to another index array or another overflow pointer array.
Claim 45
Dependent Claim
17 words
An engine utilizing said index structure of claim 32 for indexing data retrieved from Internet web pages.
Claim 46
Dependent Claim
23 words
An engine according to claim 36 wherein URL associated with each of said Internet web pages are indexed in a separate index structure.
Claim 47
Dependent Claim
32 words
An index structure according to claim 32 , wherein said first index array is further comprised of a counter location for tracking the number of set bits stored in said bitmap portion.
Claim 48
Dependent Claim
28 words
An index array according to claim 32 , wherein the number of pointers to other index arrays corresponds to the number of set bits in said first portion.
Claim 49
Dependent Claim
41 words
An index array according to claim 39 , wherein the first location of said first portion of said index array (from leftmost most position to rightmost position) that is “full” is associated with a pointer stored in the first pointer location.
Claim 50
Dependent Claim
22 words
An index array according to claim 32 wherein one of said locations in said first portion relates to a terminating character value.
Claim 51
Dependent Claim
22 words
An index array according to claim 32 wherein said index structure indexes data retrieved from the Internet allowing subsequent search and retrieval.
Claim 52
Dependent Claim
23 words
An index array according to claim 32 , wherein said reference value is a location in memory for storing references to Web pages.
Claim 53
Dependent Claim
90 words
An index structure for indexing a data item, comprising: a first index array, said first index array further comprised of: a. a first portion having a predetermined number of locations, each of said locations corresponding to a predetermined character or group of characters; b. a first pointer location for storing a pointer to another index array or a reference value, wherein said reference value is used to locate web pages containing the data item; and c. wherein one of said locations in said first portion relates to an unknown character.
Claim 54
Dependent Claim
90 words
An index structure for indexing a data item, comprising: a first index array, said first index array further comprised of: a. a first portion having a predetermined number of locations, each of said locations corresponding to a predetermined character or group of characters; b. a first pointer location for storing a pointer to another index array or a reference value, wherein said reference value is used to locate web pages containing the data item; and c. wherein one of said locations in said first portion relates to an unknown character.
Claim 55
Dependent Claim
91 words
An index structure for indexing a data item, comprising: a first index array, said first index array further comprised of: a. a first portion having a predetermined number of locations, each of said locations corresponding to a predetermined character or group of characters; b. a first pointer location for storing a pointer to another index array or a reference value, wherein said reference value is used to locate web pages containing the data item; and c. wherein said reference value is a unique numerical value assigned to a particular data string.
Claim 56
Dependent Claim
91 words
An index structure for indexing a data item, comprising: a first index array, said first index array further comprised of: a. a first portion having a predetermined number of locations, each of said locations corresponding to a predetermined character or group of characters; b. a first pointer location for storing a pointer to another index array or a reference value, wherein said reference value is used to locate web pages containing the data item; and c. wherein said reference value is a unique numerical value assigned to a particular data string.
Claim 57
Dependent Claim
84 words
An index structure for indexing a data item, comprising: a first index array, said first index array further comprised of: a. a first portion having a predetermined number of locations, each of said locations corresponding to a predetermined character or group of characters; b. a first pointer location for storing a pointer to another index array or a reference value, wherein said reference value is used to locate web pages containing the data item; and c. wherein said first portion is a bitmap portion.
Claim 58
Dependent Claim
84 words
An index structure for indexing a data item, comprising: a first index array, said first index array further comprised of: a. a first portion having a predetermined number of locations, each of said locations corresponding to a predetermined character or group of characters; b. a first pointer location for storing a pointer to another index array or a reference value, wherein said reference value is used to locate web pages containing the data item; and c. wherein said first portion is a bitmap portion.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-08-20 | 2005-02-19 | 2005-08-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-08-20 | 2009-02-19 | 2009-08-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-08-20 | 2013-02-19 | 2013-08-21 | $7700.00 | Window Closed / Lapsed |