System and Method for Dynamically Managing Data Centric Searches

• US 20130318122A1
• Filed: 08/05/2013
• Published: 11/28/2013
• Est. Priority Date: 03/11/2005
• 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
• Granted Patent: US 8,949,213 B2
• Time in Patent Office: Days
• US Class Current: 707/769
• 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 identifying an event related to domain-specific searches to a database, identifying data at a first memory location in the database, duplicating the data to a new memory location, and distributing processing more domain-specific searches amongst an expanded search space including the new memory location and the first memory location. The expanded search space can be reduced or collapsed in response to a reduction event by removing duplicate data from the first memory location or the new memory location and adjusting the distribution of processing amongst the 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 a new memory location in close proximity to the identified network segment.

Claims

1. A method comprising:

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

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

responding, at a second time which is later than the first time, to a first topic-specific search using the data in the new memory location;

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

collapsing, after the reduction event, the expanded search space to yield a reduced search space; and

responding to a second topic-specific search using data in the reduced search space.

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

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

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

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

organizing multiple events by network segment; and

identifying a network segment associated with the topic-specific searches, wherein the new memory location is in close proximity to the network segment.

6. The method of claim 5, wherein a distance between the 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 comprising:

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

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

expanding the search space by duplicating data in the search space into a new memory location, to yield an expanded search space;

distributing, at a second time which is later than the first time, an additional topic-specific search amongst the expanded search space;

monitoring for a reduction event associated with the topic-specific searches, to yield an identified reduction event; and

based on the identified reduction event, collapsing the expanded search space such that searches submitted after the identified reduction event are processed by a 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 a 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, at a first time, data at a memory location in response to topic-specific searches;

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

responding, at a second time which is later than the first time, to a first topic-specific search using the data in the new memory location;

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

collapsing, after the reduction event, the expanded search space to yield a reduced search space; and

responding to a second topic-specific search using data in the reduced search space.

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:

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

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

responding, at a second time which is later than the first time, to a first topic-specific search using the data in the new memory location;

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

collapsing, after the reduction event, the expanded search space to yield a reduced search space; and

responding to a second topic-specific search using data in the reduced search space.

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