System and method for preferred services in nomadic environments

• US 8,234,264 B2
• Filed: 02/08/2008
• Issued: 07/31/2012
• Est. Priority Date: 02/08/2008
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Mani, Kumar, Narayanan, Purushothaman Kunnath, Venkata, Hema
• Primary Examiner(s): LU, KUEN S
• Application Number:
  US12/028,151
• Publication Number:
  US 20090204597A1
• Time in Patent Office: 1,635 Days
• Field of Search: 707/104.1, 707/10, 707/3, 707/708, 709/229
• US Class Current: 707/708
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/9537 Spatial or temporal dependent retrieval, e.g. spatiotemporal queries

Abstract

A method of locating preferred services includes searching an augmented spatial index, which is based on a user'"'"'s determined preferred services. Additionally, the method includes indicating a location of a currently-sought preferred service.

Claims

1. A method of locating preferred services, comprising:

creating an augmented spatial index, which comprises;

creating matching vectors for at least one preferred service, and

augmenting a spatial index with the matching vectors;

searching the augmented spatial index, which is based on a user'"'"'s determined preferred services; and

indicating a location of a currently-sought preferred service,

wherein the augmenting the spatial index with the matching vectors comprises;

inputting a location of the at least one preferred service;

calculating a space quantification co-efficient (SQC) for the location;

inserting a service-point representative of the at least one preferred service into an entry of a leaf node of the spatial index;

setting matching vectors for the entries of leaf nodes of the spatial index; and

setting matching vectors for nodes of the spatial index.

2. The method of claim 1, wherein the setting the matching vector for nodes of the spatial index comprises:

if a node is a leaf node, performing a logical OR of the matching vectors of the leaf node entries and setting a result of the performing as the matching vector of the leaf node; and

if a node is a non-leaf node, performing a logical OR of the matching vectors of child nodes of the non-leaf node and setting a result of the performing as the matching vector of the non-leaf node.

3. A method of locating preferred services, comprising:

searching an augmented spatial index, which is based on a user'"'"'s determined preferred services; and

indicating a location of a currently-sought preferred service,

wherein the searching the augmented spatial index comprises;

deriving a current position;

constructing a user vector indicating the one or more currently-sought preferred service;

determining if the current position is within bounds of a minimum bounded box (MBB) represented by a node of the augmented spatial index;

if the current position is not within bounds of the MBB represented by the node, proceeding to a next node of the augmented spatial index; and

if the current position is within bounds of the MBB represented by the node, performing a matching method of the user vector and a matching vector of the node.

4. The method of claim 3, wherein the matching method comprises performing a logical AND of the user vector and the matching vector of the node.

5. The method of claim 3, wherein the searching the augmented spatial index further comprises:

if a resultant match is determined performing the matching method, storing the resultant match and proceeding to the next node; and

if no match is determined performing the matching method, pruning the entire MBB represented by the node and proceeding to the next node.

6. The method of claim 5, further comprising reporting resultant matches to the user.

7. The method of claim 6, wherein the reporting comprises indicating the resultant matches on a map.

8. A computer program product comprising a computer usable storage medium having computer readable program code embodied in the storage medium, the computer program product includes at least one component operable to:

search an augmented spatial index, the search comprising;

deriving a current position,

constructing a user vector indicating one or more currently-sought preferred services,

determining if the current position is within bounds of a minimum bounded box (MBB) represented by a node of the augmented spatial index,

if the current position is not within bounds of the MBB represented by the node, proceeding to a next node of the augmented spatial index; and

if the current position is within bounds of the MBB represented by the node, performing a matching method of the user vector and a matching vector of the node; and

indicate a location of the one or more currently-sought preferred services.

9. A system, comprising:

a CPU, a computer readable memory and a computer readable storage media;

first program instructions to create at least one matching vector;

second program instructions to at least one of create and update an augmented spatial index;

third program instructions to create at least one user vector indicating one or more currently-sought preferred services;

fourth program instructions to determine a current location; and

fifth program instructions to locate the one or more currently-sought preferred services by determining if the current position is within bounds of a minimum bounded box (MBB) represented by a node of the augmented or updated spatial index, if the current position is not within bounds of the MBB represented by the node, proceeding to a next node of the augmented spatial index, and if the current position is within bounds of the MBB represented by the node, performing a matching method of the at least one user vector and at least one matching vector of the node,

wherein the first, second, third, fourth and fifth program instructions are stored on the computer readable storage media for execution by the CPU via the computer readable memory.