CONCURRENT SEARCHING OF STRUCTURED AND UNSTRUCTURED DATA

• US 20080263006A1
• Filed: 04/20/2007
• Published: 10/23/2008
• Est. Priority Date: 04/20/2007
• Status: Abandoned Application

• Current Assignee: SAP AG (SAP SE)
• Original Assignee: SAP AG (SAP SE)
• Inventors: Vossen, Oliver, Bechtold, Johannes, Wolber, Andreas
• Application Number:
  US11/738,278
• Publication Number:
  US 20080263006A1
• Time in Patent Office: Days
• US Class Current: 707/3
• CPC Class Codes: G06F 16/2471 Distributed queries
• CPC Class Codes: G06F 16/90335 Query processing

Abstract

The present disclosure relates to methods, systems, and software for querying heterogeneous business data comprising structured data and unstructured data. The structured data and unstructured data may be stored across one or more repositories. The combined query may be initiated when the system receives a query for the heterogeneous business data and automatically parses the received query into sub-queries. Each sub-query can be associated with either structured or unstructured data stored in one of the repositories. At least one of the sub-queries can include of a portion of the received query. The results of the various sub-queries can be merged automatically using business logic.

Claims

1. Software for querying heterogeneous business data, the software comprising computer readable instructions embodied on media and operable when executed to:

receive a query for heterogeneous business data, the business data comprising structured data and unstructured data stored across a plurality of repositories;

automatically parse the received query into sub-queries, each sub-query associated with either the structured or the unstructured data and one of the repositories and at least one of the sub-queries consisting of a portion of the received query; and

automatically merge results of the various sub-queries using business logic.

2. The software of claim 1, the plurality of repositories comprising a first structured repository and a first unstructured repository.

3. The software of claim 2 further operable to identify further results in the first structured repository based on results from the first unstructured repository.

4. The software of claim 2, the first structured repository storing a plurality of business objects, each business object associated with one or more nodes.

5. The software of claim 4, the first unstructured repository storing a plurality of attachments, each of at least a subset of the attachments associated with a business object node.

6. The software of claim 2 further operable to search the first unstructured repository based on a textual search of the unstructured data.

7. The software of claim 2 further operable to search the first unstructured repository based on an attribute search of the unstructured data.

8. The software of claim 1, wherein the software operable to automatically parse the received query into sub-queries comprises software operable to:

generate a first sub-query for structured data based on a subset of the query elements and business logic; and

generate a second sub-query for unstructured data based on a second subset of query elements and the business logic.

9. The software of claim 1, wherein the software operable to automatically merge the results comprises the software further operable to execute a union operation on the results.

10. The software of claim 1, wherein the software operable to automatically merge the results comprises software operable to execute an intersection operation of the results.

11. The software of claim 1 further operable to communicate the merged results on a rolling basis.

12. The software of claim 1, the software comprising at least two modules, the first module comprising a query splitter module and the second module comprising a result merger module.

13. The software of claim 12, the software operating as a service that is logically coupled to at least one search provider.

14. The software of claim 1, wherein the software operable to automatically merge the results comprises software operable to:

execute a query, with sorting criteria and independent of the query elements, on the structured data;

determine a union of the fast search and the results of the particular sub-query associated with the unstructured data; and

merge results of the union and the results of at least one sub-query associated with the structured data.

15. A computer implemented method for search structured and unstructured data comprising:

receiving a query for heterogeneous business data, the business data comprising structured data and unstructured data stored across a plurality of repositories;

automatically parsing the received query into sub-queries, each sub-query associated with either the structured or the unstructured data and one of the repositories and at least one of the sub-queries consisting of a portion of the received query; and

automatically merging results of the various sub-queries using business logic.

16. The method of claim 15, the plurality of repositories comprising a first structured repository and a first unstructured repository.

17. The method of claim 15, wherein automatically parsing the received query into sub-queries comprises:

generating a first sub-query for structured data based on a subset of the query elements and business logic; and

generating a second sub-query for unstructured data based on a second subset of query elements and the business logic.

18. The method of claim 15, wherein automatically merging the results comprises:

executing a query, with sorting criteria and independent of the query elements, on results obtained from at least one sub-query associated with the unstructured data;

determining a union of the fast search and the results of the particular sub-query associated with the unstructured data; and

merging results of the union and the results of at least one sub-query associated with the structured data.