Nearest known person directory function
Abstract
A system for matching nearest contacts in a logical contact hierarchy can include a logical contact hierarchy disposed in a database; and, a hierarchical query processor coupled to the logical contact hierarchy. The hierarchical query processor can be configured to produce a closest matching contact from among contacts in the logical contact hierarchy based upon a specified anchor contact in the logical contact hierarchy. A boolean operator further can be programmed to select a closest matching contact based upon a boolean expression operating upon multiple closest matching contacts produced by the hierarchical query processor.
Claims
exact text as granted — not AI-modifiedWe claim:
1 . A method for matching nearest contacts in a logical contact hierarchy, the method comprising the steps of:
establishing an anchor contact in the logical contact hierarchy; computing a distance within the logical contact hierarchy between said anchor contact and a selected contact, for each contact in the logical contact hierarchy; and, selecting as a nearest matching contact, a contact from among contacts in said logical contact hierarchy having a shortest computed distance within the logical contact hierarchy.
2 . The method of claim 1 , further comprising the steps of:
repeating said establishing, computing and selecting steps for at least one additional anchor contact in the logical contact hierarchy; and, performing at least one boolean operation on each closest matching contact produced by said repeating step for each anchor contact to compute a boolean closest matching contact in the logical contact hierarchy.
3 . The method of claim 1 , wherein the logical contact hierarchy defines a hierarchical structure of seniority of employees in an organization.
4 . The method of claim 1 , wherein the logical contact hierarchy defines office locations of contacts in an organization.
5 . The method of claim 2 , wherein the logical contact hierarchy defines a hierarchical structure of seniority of employees in an organization.
6 . The method of claim 2 , wherein the logical contact hierarchy defines office locations of contacts in an organization.
7 . A system for matching nearest contacts in a logical contact hierarchy, comprising:
a logical contact hierarchy disposed in a database; and, a hierarchical query processor coupled to said logical contact hierarchy and configured to produce a closest matching contact from among contacts in said logical contact hierarchy based upon a specified anchor contact in said logical contact hierarchy.
8 . The system of claim 7 , further comprising a boolean operator programmed to select a closest matching contact based upon a boolean expression operating upon multiple closest matching contacts produced by said hierarchical query processor.
9 . The system of claim 7 , wherein said logical contact hierarchy defines a hierarchical structure of seniority of employees in an organization.
10 . The system of claim 7 , wherein said logical contact hierarchy defines office locations of contacts in an organization.
11 . The system of claim 8 , wherein said logical contact hierarchy defines a hierarchical structure of seniority of employees in an organization.
12 . The system of claim 8 , wherein said logical contact hierarchy defines office locations of contacts in an organization.
13 . A machine readable storage having stored thereon a computer program for matching nearest contacts in a logical contact hierarchy, said computer program comprising a routine set of instructions for causing the machine to perform the steps of:
establishing an anchor contact in the logical contact hierarchy; computing a distance within the logical contact hierarchy between said anchor contact and a selected contact, for each contact in the logical contact hierarchy; and, selecting as a closest matching contact, a contact from among said logical contact hierarchy having a shortest computed distance in the logical contact hierarchy.
14 . The machine readable storage of claim 13 , further comprising the steps of:
repeating said establishing, computing and selecting steps for at least one additional anchor contact in the logical contact hierarchy; and, performing at least one boolean operation on each closest matching contact produced by said repeating step for each anchor contact to compute a boolean closest matching contact in the logical contact hierarchy.
15 . The machine readable storage of claim 13 , wherein the logical contact hierarchy defines a hierarchical structure of seniority of employees in an organization.
16 . The machine readable storage of claim 13 , wherein the logical contact hierarchy defines office locations of contacts in an organization.
17 . The machine readable storage of claim 14 , wherein the logical contact hierarchy defines a hierarchical structure of seniority of employees in an organization.
18 . The machine readable storage of claim 14 , wherein the logical contact hierarchy defines office locations of contacts in an organization.Join the waitlist — get patent alerts
Track US2019303876A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.