Parallel computer network and method for real time financial resource management, inventory control, and online purchasing
First Claim
Patent Images
1. A hierarchical method for indexing and searching web pages, the method comprising the steps of:
- establishing a webpage database of Internet webpages via a server which are searched by the server having access to the Internet;
wherein the server executes a set of software instructions to search the webpage database for the Internet webpages;
providing a word database of a majority of recognized words respective to a specific language wherein the word database is in signal communication with the server;
establishing a quantitative hierarchical value for each of the words in the word database according to a frequency of occurrences of each of the words in the webpage database, wherein each word is related to a quantitative value between a lowest value and a highest value having a relationship where the lowest value is respective to the highest occurrence rate and the highest value is respective to the lowest occurrence rate, wherein the quantitative hierarchical value for each of the words is assigned by the server based upon the set software instructions;
establishing a set of predetermined semantic guidelines for said language by characterizing said language into distinct grammatical categories wherein the predetermined semantic guidelines for said language is in signal communication with the server;
searching, analyzing, and indexing a plurality of web pages within the webpage database, indexing each web page via the server by executing the set of software instructions as follows;
searching each web page for each word having a highest relative quantitative value and establishing a first index relationship between the identified word and the web page;
searching each web page for each word having a second highest relative quantitative value and establishing a second index relationship between the identified word and the web page, wherein the second index relationship is a subset of the first index relationship and eliminating from calculation any web page not having the first index relationship;
searching each web page for each word having a third highest relative quantitative value and establishing a third index relationship between the identified word and the web page, wherein the third index relationship is a subset of the second index relationship and eliminating from calculation any web page not having the second index relationship and eliminating from calculation any web page not having the third index relationship;
repeating the searching steps while continuing with words following a downward trend for each relative quantitative (nth) value until reaching words having the lowest quantitative value and indexing the website with each identified matching word with a respective (nth) level index relationship between the identified word and the web page, wherein each identified matching word respective relative quantitative (nth) value is added to the files unique value; and
picking the top (n) web pages in ascending order from highest to lowest adjusted value, wherein the picking is performed according to the web pages having the highest relative quantitative value, wherein the step of picking the top webpages is performed by the set of software instructions executed by the server.
0 Assignments
0 Petitions
Accused Products
Abstract
A method for simulating the entire superset of potential valid keyword regular expression requests constructed during an Internet browser search and converting the result sets into Environmental summary report to enable efficient and accurate searching without requiring Browser Engine supercomputer cluster searching capabilities.
-
Citations
14 Claims
-
1. A hierarchical method for indexing and searching web pages, the method comprising the steps of:
-
establishing a webpage database of Internet webpages via a server which are searched by the server having access to the Internet;
wherein the server executes a set of software instructions to search the webpage database for the Internet webpages;providing a word database of a majority of recognized words respective to a specific language wherein the word database is in signal communication with the server; establishing a quantitative hierarchical value for each of the words in the word database according to a frequency of occurrences of each of the words in the webpage database, wherein each word is related to a quantitative value between a lowest value and a highest value having a relationship where the lowest value is respective to the highest occurrence rate and the highest value is respective to the lowest occurrence rate, wherein the quantitative hierarchical value for each of the words is assigned by the server based upon the set software instructions; establishing a set of predetermined semantic guidelines for said language by characterizing said language into distinct grammatical categories wherein the predetermined semantic guidelines for said language is in signal communication with the server; searching, analyzing, and indexing a plurality of web pages within the webpage database, indexing each web page via the server by executing the set of software instructions as follows; searching each web page for each word having a highest relative quantitative value and establishing a first index relationship between the identified word and the web page; searching each web page for each word having a second highest relative quantitative value and establishing a second index relationship between the identified word and the web page, wherein the second index relationship is a subset of the first index relationship and eliminating from calculation any web page not having the first index relationship; searching each web page for each word having a third highest relative quantitative value and establishing a third index relationship between the identified word and the web page, wherein the third index relationship is a subset of the second index relationship and eliminating from calculation any web page not having the second index relationship and eliminating from calculation any web page not having the third index relationship; repeating the searching steps while continuing with words following a downward trend for each relative quantitative (nth) value until reaching words having the lowest quantitative value and indexing the website with each identified matching word with a respective (nth) level index relationship between the identified word and the web page, wherein each identified matching word respective relative quantitative (nth) value is added to the files unique value; and picking the top (n) web pages in ascending order from highest to lowest adjusted value, wherein the picking is performed according to the web pages having the highest relative quantitative value, wherein the step of picking the top webpages is performed by the set of software instructions executed by the server. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A hierarchical method for indexing and searching files, the method comprising the steps of:
-
providing a reference search database comprising a plurality of search references, the reference search database being digitally stored; establishing a quantitative hierarchical value for each of the search references in the reference search database according to a frequency of occurrences of each of the search references in the reference search database, wherein each search reference is assigned a quantitative value between a lowest value and a highest value based upon a predetermined level of importance, wherein the quantitative hierarchical value for each of the search references is assigned by a server using an instruction set provided by software; establishing a stored files database comprising at least one of the files and a location of the files, the stored files database being digitally stored; searching, analyzing, and indexing a plurality of files within the stored files database, indexing each file via the server by executing the set of software instructions as follows; searching each file for each search reference having a highest relative quantitative value and establishing a first index relationship between the search reference and the file; searching each file for each search reference having a second highest relative quantitative value and establishing a second index relationship between the search reference and the file, wherein the second index relationship is a subset of the first index relationship, and attenuating any file that does not have the first index relationship; searching each file for each search reference having a third highest relative quantitative value and establishing a third index relationship between the identified search reference and the file, wherein the third index relationship is a subset of the second index relationship, and attenuating any file that does not have the second index relationship; repeating the searching steps while continuing with search references following a downward trend for each relative quantitative (nth) value until reaching search references having the lowest quantitative value and indexing the files with each identified matching search reference with a respective (nth) level index relationship between the identified search reference and the file, wherein the respective (nth) level index relationship is a subset of the previous (nth−
1) index relationship, and attenuating any file that does not have the third index relationship;repeating the searching steps while continuing with words following a downward trend for each relative quantitative (nth) value until reaching words having the lowest quantitative value and indexing the website with each identified matching word with a respective (nth) level index relationship between the identified word and the web page; wherein each identified matching word respective relative quantitative (nth) vector value is added to the files unique vector value; and returning the top list of a listing of (n) files in ascending order from highest to lowest resultant file value, wherein the returning of the top list of the listing of (n) files is accomplished by the set of software instructions executed by the server. - View Dependent Claims (8, 9, 10, 11, 12, 13, 14)
-
Specification