Techniques for compiling and presenting query results
Improved crawling and curation of data and metadata from diverse data sources is described. In some embodiments, improvements are achieved by interpreting the context, vocabulary and relationships of data element, to enable relational data search capability for users. The user querying process is improved by systematic identification of the data objects, context, and relationships across data objects and elements, aggregation methods and operators on the data objects and data elements as identified in the curation process. User query suggestions and recommendations can be adjusted based on the context, relationships between the data elements, user profile, and the data sources. When the user query is executed, the query text is translated into an equivalent of one or more query statements, such as SQL or PostGre statements, and the query is performed on the identified data sources. Results are assembled to present the answer in a meaningful visualization for the user query.
1. A computer-implemented method, comprising:
identifying a set of related data entities in a data source, each data entity including multiple data values;
generating, based on a number of repeated values included in a distribution of data values included in the set of related data entities, a classification of the set of related data entries as finite or non-finite;
receiving a request for presenting the data values included in the set of related data entities; and
generating a response to the request based on the classification.
2. The computer-implemented method of claim 1 , wherein the classification for the set of related data entities is based on whether the distribution of values is random.
3. The computer-implemented method of claim 1 , wherein generating the response comprises selecting, based on the classification, a presentation format for a result of the request.
4. The computer-implemented method of claim 3 , wherein the presentation format includes one of:
a first visualization type associated with finite sets; or
a second visualization type associated with non-finite sets.
5. The computer-implemented method of claim 1 , wherein:
the request comprises an incomplete request, and
generating the response comprises generating, based on the classification, one or more completion suggestions associated with the incomplete request.
6. The computer-implemented method of claim 1 , wherein:
the request comprises a search request, and
generating the response comprises generating, based on the classification, one or more related search requests.
7. One or more non-transitory computer readable media storing instructions that, when executed by one or more processors, cause the one or more processors to perform the steps of:
identifying a set of related data entities in a data source, each data entity including multiple data values;
generating, based on a number of repeated values included in a distribution of data values included in the set of related data entities, a classification of the set of related data entries as finite or non-finite;
receiving a request for presenting the data values included in the set of related data entities; and
generating a response to the request based on the classification.
8. The one or more non-transitory computer readable media of claim 7 , wherein the classification for the set of related data entities is based on whether the distribution of values is random.
9. The one or more non-transitory computer readable media of claim 7 , wherein generating the response comprises selecting, based on the classification, a presentation format for a result of the request.
10. The one or more non-transitory computer readable media of claim 9 , wherein the presentation format includes one of:
a first visualization type associated with finite sets; or
a second visualization type associated with non-finite sets.
11. The one or more non-transitory computer readable media of claim 7 , wherein:
the request comprises an incomplete request, and
generating the response comprises generating, based on the classification, one or more completion suggestions associated with the incomplete request.
12. The one or more non-transitory computer readable media of claim 7 , wherein:
the request comprises a search request, and
generating the response comprises generating, based on the classification, one or more related search requests.
13. A system, comprising:
a memory storing instructions, and
one or more processors for executing the instructions to:
identify a set of related data entities in a data source, each data entity including multiple data values;
generate, based on a number of repeated values included in a distribution of data values included in the set of related data entities, a classification of the set of related data entries as finite or non-finite;
receive a request for presenting the data values included in the set of related data entities; and
generate a response to the request based on the classification.
14. The system of claim 13 , wherein:
the request comprises an incomplete request, and
the one or more processors generate the response by generating, based on the classification, one or more completion suggestions associated with the incomplete request.
15. The system of claim 13 , wherein:
the request comprises a search request, and
the one or more processors generate the response by generating, based on the classification, one or more related search requests.
16. The system of claim 13 , wherein the one or more processors generate the response by selecting, based on the classification, a presentation format for a result of the request.
17. The system of claim 16 , wherein the presentation format includes one of:
a first visualization type associated with finite sets; or
a second visualization type associated with non-finite sets.