SYSTEM AND METHOD FOR DYNAMICALLY MANAGING DATA CENTRIC SEARCHES

• US 20100088304A1
• Filed: 10/03/2008
• Published: 04/08/2010
• Est. Priority Date: 10/03/2008
• Status: Active Grant

• Current Assignee: III Holdings 12, LLC (Intellectual Ventures LLC)
• Original Assignee: Cluster Resources, Inc. (Ala Services LLC)
• Inventors: JACKSON, David B.
• Granted Patent: US 8,504,548 B2
• Time in Patent Office: Days
• 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:

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 more domain-specific searches amongst the at least one new memory location.

2. The method of claim 1, wherein the distributing further distributes more domain-specific searches amongst the first memory location.

3. The method of claim 1, wherein the distributing further distributes processing more domain-specific searches randomly.

4. The method of claim 1, wherein the distributing further distributes processing more domain-specific searches serially.

5. The method of claim 1, wherein the first memory location and at least one memory location comprise an expanded search space, the method further comprising:

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

collapsing the expanded search space by ceasing to access one or more memory locations and distributing domain specific searches after the reduction event amongst at least one remaining memory location.

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

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.

7. The method of claim 6, wherein proximity is measured by one or more of geographic distance, network latency, number of intermediate network hops, temperature, and cost.

8. The method of claim 1, wherein the method is managed by a workload manager.

9. 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 domain-specific searches to a database;

identifying data in the search space having at least one memory location in the database, the data being data identified in response to the domain-specific searches;

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

distributing more domain-specific searches amongst at least the expanded search space.

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

monitoring reduction events associated with the domain-specific searches;

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

11. The method of claim 9, 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 domain-specific searches amongst the expanded search space in advance of expected events based on the predicted schedule.

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

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

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

13. The method of claim 12, wherein proximity is measured by one or more of geographic distance, network latency, number of intermediate network hops, temperature, and cost.

14. The method of claim 9, wherein the method is processed by a workload manager.

15. A system for dynamically managing data centric searches, the system comprising:

a module configured to receive information associated with an event related to domain-specific searches to a database;

a module configured to identify data at a first memory location in the database, the data being data identified in response to the domain-specific searches;

a module configured to duplicate the data at least once to at least one new memory location; and

a module configured to distribute processing more domain-specific searches amongst the at least one new memory location.

16. The system of claim 15, wherein the module configured to distribute further distributes processing amongst the first memory location.

17. The system of claim 15, wherein the first memory location and at least one memory location comprise an expanded search space, the system further comprising:

a module configured to identify a reduction event related to the domain-specific searches; and

a module configured to collapse the expanded search space by ceasing to access one or more memory location and distributing processing amongst at least one remaining memory location.

18. The system of claim 15, wherein the system is managed by a workload manager module.

19. A tangible computer-readable medium storing a computer program having instructions for dynamically managing data centric searches, the instructions comprising:

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 new memory location.

20. The tangible computer-readable medium of claim 19, wherein the instructions are managed by a workload manager.