System and method for dynamically managing data centric searches

• US 8,504,548 B2
• Filed: 10/03/2008
• Issued: 08/06/2013
• Est. Priority Date: 10/03/2008
• Status: Active Grant

• Current Assignee: III Holdings 12, LLC (Intellectual Ventures LLC)
• Original Assignee: Adaptive Computing Enterprises, Inc. (Ala Services LLC)
• Inventors: Jackson, David Brian
• Primary Examiner(s): Beausoliel, Jr., Robert
• Assistant Examiner(s): Arjomandi, Noosha
• Application Number:
  US12/245,276
• Publication Number:
  US 20100088304A1
• Time in Patent Office: 1,768 Days
• Field of Search: 707/706, 707/999.1, 707/716, 707/752, 711/165, 711/108
• US Class Current: 707/706
• CPC Class Codes: G06F 16/90335 Query processing
• CPC Class Codes: G06F 16/957 Browsing optimisation, e.g. caching or content distillation

Abstract

Disclosed herein are systems, methods, and computer readable-media for dynamically managing data-centric searches. The method includes receiving information associated with an event related to domain-specific searches to a database, identifying data at a first memory location in the database, the data being data identified in response to the domain-specific searches, duplicating the data at least once to at least one new memory location, and distributing processing more domain-specific searches amongst the at least one of the new memory location and the first memory location. The system can distribute the processing for more or additional domain-specific searches randomly, serially or using any other approach. The method optionally includes an expanded search space made up of the first memory location and at least one memory location and can identify a reduction event related to the domain-specific searches, and collapse the expanded search space by removing duplicate data from one or more memory location and adjusting the distribution of processing amongst at least one remaining memory location. The method can optionally include organizing multiple events by network segment, identifying a network segment associated with domain-specific searches, and duplicating the data to at least one new memory location in close proximity to the identified network segment. The method can measure proximity by one or more of geographic distance, network latency, number of intermediate network hops, temperature, and cost.

Claims

1. A method of dynamically managing data centric searches, the method comprising:

identifying data at a memory location in response to topic-specific searches;

duplicating the data to at least one new memory location, wherein the memory location and the at least one new memory location comprise an expanded search space;

responding to at least some first additional topic-specific searches using the data in the at least one new memory location;

identifying a reduction event related to the topic-specific searches;

and collapsing, after the reduction event, the expanded search space by ceasing to access at least one memory location and

responding to at least some second additional topic-specific searches using the data in at least one remaining memory location.

2. The method of claim 1, wherein responding to at least some first additional topic-specific searches further comprises responding using the data at the first memory location.

3. The method of claim 1, wherein the at least one new memory location is selected at random.

4. The method of claim 1, wherein the at least one new memory location is selected serially.

5. The method of claim 1, the method further comprising:

organizing multiple events by network segment;

identifying a network segment associated with the topic-specific searches; and

duplicating the data to at least one new memory location in close proximity to the network segment.

6. The method of claim 5, wherein a distance between the at least one new memory location and the network segment is measured by at least one of geographic distance, network latency, number of intermediate network hops, temperature, and cost.

7. The method of claim 1, wherein a workload manager manages at least part of identifying data, duplicating the data, and responding.

8. A method of predictively expanding a search space in a data centric search environment, the method comprising:

receiving information associated with an expected event related to topic-specific searches to a database;

identifying data in the search space having at least one memory location in the database in response to the topic-specific searches;

expanding the search space by duplicating data in the search space into at least one new memory location;

distributing at least some additional topic-specific searches amongst the search space;

monitoring for reduction events associated with the topic-specific searches; and

based on an identified reduction event, collapsing the search space such that searches submitted after the identified reduction event are processed by at least one remaining memory location.

9. The method of claim 8, the method further comprising:

storing received information in a log organized by date and time;

predicting a schedule of expected events based on the log; and

expanding the search space and distributing topic-specific searches amongst the search space in advance of expected events based on the schedule of expected events.

10. The method of claim 8, the method further comprising:

identifying a network segment associated with the expected event related to topic-specific searches; and

duplicating the data to at least one new memory location in close proximity to the network segment.

11. The method of claim 10, wherein the proximity is measured by at least one of geographic distance, network latency, number of intermediate network hops, temperature, and cost.

12. The method of claim 8, wherein the method is processed by a workload manager.

13. A system comprising:

a processor;

and a computer-readable storage medium storing instructions which, when implemented by the processor, cause the processor to perform a method comprising;

identifying data at a memory location in response to topic-specific searches;

duplicating the data to at least one new memory location, wherein the memory location and the at least one new memory location comprise an expanded search space;

responding to at least some first additional topic-specific searches using the data in the at least one new memory location;

identifying a reduction event related to the topic-specific searches; and

collapsing, after the reduction event, the expanded search space by ceasing to access at least one memory location and

responding to at least some second additional topic specific searches using the data in at least one remaining memory location.

14. The system of claim 13, wherein the method further comprises responding using the data at the memory location.

15. The system of claim 13, further comprising a workload manager module.

16. A non-transitory computer-readable medium storing a computer program having instructions comprising:

receiving information associated with an expected event related to topic-specific searches to a database;

identifying data in the search space having at least one memory location in the database in response to the topic-specific searches;

expanding the search space by duplicating data in the search space into at least one new memory location;

distributing at least some additional topic-specific searches amongst the search space;

monitoring for reduction events associated with the topic-specific searches; and

based on an identified reduction event, collapsing the search space such that searches submitted after the identified reduction event are processed by at least one remaining memory location.

17. The non-transitory computer-readable medium of claim 16, wherein the instructions further comprising a workload manager.