US8577987B2ActiveUtilityA1
Index rank optimization system and method
Est. expiryOct 3, 2028(~2.2 yrs left)· nominal 20-yr term from priority
H03M 7/04H03M 7/40
37
PatentIndex Score
0
Cited by
2
References
15
Claims
Abstract
An index ranking optimization system and method are provided herein.
Claims
exact text as granted — not AI-modifiedThe invention claimed is:
1. A method executing on a computing system for exposing juice contributions indicative of a target juice value corresponding to a target node within a web of inter-linked nodes, the method comprising:
obtaining a first index comprising a multiplicity of first-index node entries, said multiplicity of first-index node entries comprising a node entry corresponding to the target node and a plurality of other node entries corresponding to at least a representative sample of the web of inter-linked nodes;
identifying via said first index a first plurality of inbound links targeting the target node;
for each of said first plurality of inbound links:
identifying via said first index a current source node corresponding to the current inbound link;
obtaining via said first index a current-source-node juice value corresponding to the current source node; and
determining, in accordance with a plurality of link-weighting factors, a current juice-passed value indicating a portion of said current-source-node juice value that contributes to said target-node juice value;
providing, from the computing system to a remote computing system, a plurality of juice-passed values determined for each of said first plurality of inbound links.
2. The method of claim 1 , wherein obtaining via said first index said current-source-node juice value corresponding to the current source node comprises:
traversing at least a portion of said web of inter-linked nodes in accordance with said first index; and
determining said current-source-node juice value in accordance with said plurality of link-weighting factors.
3. The method of claim 1 , further comprising:
selecting, from among said first plurality of inbound links, a second plurality of significant inbound links in accordance with said juice-passed values determined for each of said plurality of inbound links; and
providing link metadata associated with said second plurality of significant inbound links from the computing system to said remote computing system.
4. The method of claim 3 , wherein selecting said second plurality of significant inbound links comprises:
ranking said first plurality of inbound links according to their respective juice-passed values; and
identifying inbound links that rank highly.
5. The method of claim 3 , wherein selecting said second plurality of significant inbound links comprises:
grouping said first plurality of inbound links into a plurality of link groups according to a link metadata criterion;
determining an aggregate juice-passed value for each of said plurality of link groups;
ranking said plurality of link groups according to their respective aggregate juice-passed values; and
identifying link groups that rank highly.
6. The method of claim 1 , further comprising:
obtaining a user-provided selection criterion;
selecting, from among said first plurality of inbound links, a second plurality of selected inbound links in accordance with said user-provided selection criterion; and
providing link metadata associated with said second plurality of selected inbound links from the computing system to said remote computing system.
7. The method of claim 6 , wherein said user-provided selection criterion comprises at least one of an image-link criterion, a redirect criterion, a meta-refresh criterion, a link-source-node attribute criterion, and a source-node content criterion.
8. The method of claim 1 , further comprising providing, from the computing system to a remote computing system, at least one of a count of said first plurality of inbound links and a freshness indication associated with at least one first-index entry associated with the target node.
9. The method of claim 1 , further comprising:
identifying via said first index a first plurality of outbound links sourced from the target node; and
for each of said plurality of outbound links:
identifying via said first index a current outbound-target node corresponding to the current outbound link;
identifying via said first index a current outbound-target-node juice value corresponding to the current outbound-target node; and
determining, in accordance with said plurality of link-weighting factors, a contribution value indicating a positive or negative contribution to said target-node juice value, said contribution value being associated with the current outbound link.
10. The method of claim 9 , wherein obtaining a first index comprising a multiplicity of first-index node entries comprises creating said first index to overlap a closed index, said closed index comprising a plurality of closed-index node entries and a corresponding plurality of closed-index juice values, and wherein said plurality of link-weighting factors are indicative of said plurality of closed-index juice values.
11. The method of claim 10 , wherein said first index further comprises:
a plurality of link entries, each link entry indicating a source one of the plurality of first-index node entries and a target one of the plurality of first-index node entries; and
a plurality of link metadata entries corresponding to said plurality of link entries.
12. The method of claim 11 , wherein creating said first index overlapping said closed index comprises:
for each of a plurality of nodes:
recording a node entry corresponding to the current node;
obtaining content data corresponding to the current node, said content data including one or more outbound links and a plurality of non-link content data;
for each outbound link:
recording a link entry indicating the current node and a target node; and
recording a link metadata entry corresponding to the current outbound link.
13. The method of claim 12 , wherein creating said first index overlapping said closed index further comprises discarding at least a majority of said non-link content data.
14. A non-transitory computer-readable storage medium having stored thereon instructions that, when executed by a processor, perform the method of claim 1 .
15. A computing apparatus comprising a processor and a memory, the memory storing instructions that, when executed by the processor, perform the method of claim 1 .Join the waitlist — get patent alerts
Track US8577987B2 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.