CN103309939A - Dynamic retrieval method and device based on metadata - Google Patents

Abstract

The invention discloses a dynamic retrieval method and device based on metadata. The method comprises the steps of searching to obtain all paths of a target value; calculating a search cost of the paths; finding out the path with the minimum cost; collecting analysis dimensions; analyzing dimension and dividing a target space; comparing the dimensions one by one to find out an optimum search space so as to obtain a target result. The metadata can be reused so as to reduce a development cost; the whole process is completely finished by business personnel independently, so that business advantages can be better exerted; a metadata base is shared and is continuously perfected and developed; when report forms need to be modified or redone, operation can be carried out only through selection and combination, which is simple and rapid, and the development cost is low; when a data base blueprint which is described by the metadata is used, an analysis background can automatically optimize a data retrieval path to realize efficient retrieval.

Description

A kind of dynamic search method and device based on metadata

Technical field

The present invention relates to field of computer technology, in particular, relate to dynamic search method and device based on metadata.

Background technology

Structured Query Language (SQL) (Structured Query Language) is called for short SQL, and SQL is a kind of data base querying and programming language, is used for access data and inquiry, renewal and administrative relationships Database Systems.Generally, the staff can write SQL statement according to user's demand, with the data in the tables of data of database are increased, the operation such as deletion, inquiry or modification.

In the research and practice process to prior art, the present inventor finds that there is following problem in prior art:

The purpose that the staff writes the SQL query statement is the target data of wanting in the tables of data of Query Database.But, might there be multiple inquiry mode in the query aim data, and each inquiry mode to need time and resource all may be different, expend time in and the mode of resource if the inquiry mode that the staff adopts belongs to, so just reduced the efficient of query aim data.

Therefore, how to improve the efficient of query aim data, become the problem that needs most at present solution.

Summary of the invention

In view of this, purpose of design of the present invention is, a kind of dynamic search method and device based on metadata are to improve the efficient of query aim data.

The embodiment of the invention is achieved in that

A kind of dynamic search method based on metadata comprises:

Search all paths that obtain desired value;

Calculate the searching cost in described path;

Find out the minimum cost path;

The collection analysis dimension;

Dimension is analyzed, and divides object space;

By dimensional comparison, find out best search volume, draw objective result.

A kind of dynamic indexing unit based on metadata comprises:

First searches module, is used for searching all paths that obtain desired value;

Computing module is used for calculating the searching cost in described path;

Second searches module, is used for finding out the minimum cost path;

Collection module is used for the collection analysis dimension;

Divide module, be used for the dimension analysis, divide object space;

Determination module is used for finding out best search volume by dimensional comparison as a result, draws objective result.

Compared with prior art, the technical scheme that provides of the present embodiment has the following advantages and characteristics:

In scheme provided by the invention, can reuse metadata, reducing development cost; Whole process is business personnel's complete independently fully, can better bring into play professional advantage; Metadatabase is shared, and constantly improves development; Report modification or reform only needs to select and work in combination, simple and fast, and cost of development is low; The database blueprint of describing by metadata, analyzing the backstage can the automatic optimization of data searching route, realizes efficient retrieval.

Description of drawings

In order to be illustrated more clearly in the present invention or technical scheme of the prior art, the below will do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art, apparently, accompanying drawing in the following describes only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain according to these accompanying drawings other accompanying drawing.

Fig. 1 is the process flow diagram of a kind of dynamic search method based on metadata provided by the present invention;

Fig. 2 is the schematic diagram of an embodiment provided by the present invention;

Fig. 3 is the schematic diagram of an embodiment provided by the present invention;

Fig. 4 is the schematic diagram of an embodiment provided by the present invention;

Fig. 5 is the module map of a kind of dynamic indexing unit based on metadata provided by the present invention.

Embodiment

Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills belong to the scope of protection of the invention not making the every other embodiment that obtains under the creative work prerequisite.

The embodiment of the invention provides a kind of dynamic search method based on metadata, to improve the efficient of query aim data.

Because there is various ways in the specific implementation of above-mentioned dynamic search method based on metadata, is elaborated below by specific embodiment:

See also shown in Figure 1ly, shown in Figure 1 is a kind of dynamic search method based on metadata, comprising:

Step S11, search all paths that obtain desired value;

The searching cost in step S12, the described path of calculating;

Step S13, find out the minimum cost path;

Step S14, collection analysis dimension;

Object space is divided in step S15, dimension analysis;

Step S16, by dimensional comparison, find out best search volume, draw objective result.

In the embodiment shown in fig. 1, can reuse metadata, reducing development cost; Whole process is business personnel's complete independently fully, can better bring into play professional advantage; Metadatabase is shared, and constantly improves development; Report modification or reform only needs to select and work in combination, simple and fast, and cost of development is low; The database blueprint of describing by metadata, analyzing the backstage can the automatic optimization of data searching route, realizes efficient retrieval.

Below in conjunction with specific embodiment, scheme provided by the invention is described, see also Fig. 2 to shown in Figure 4, the application scenarios of the present embodiment is for seeking the desired value of dist index, wherein: index (dist)=data item (a)+data item (b)+data item (c).

In step S11, search all paths that obtain desired value, by the analysis to Fig. 1, draw 3 paths:

Path 1:dist=a+b+c;

Path 2:dist=e+c;

Path 3:dist=f;

In step S12, calculate the searching cost in described path, searching cost (C is total)=sum (sub-search node cost Ci), sub-search node cost (Ci), minute situation is processed.

By above-mentioned algorithm, draw the searching cost of 3 paths

Path 1 cost: C path 1=C node a+C node b+C node c;

Path 2 costs: C path 2=C node e+C node c;

Path 3 costs: C path 3=C node f;

In step S13, find out the minimum cost path, relatively the minimum cost path is found out in C path 1, C path 2, C path 3, supposes that " path 3 " is minimal path.

Finding that relatively " path 3 " is shortest path, is that addressing target begins the dimension search so select f; Be the basis with the pass of technical element data description, by the relations such as subregion (submeter) situation of f institute mapping table, data granularity are analyzed, draw a circle to approve minimum search range.Example is retrieved according to time and area under one's jurisdiction dimension.

In step S14, the collection analysis dimension to the relationship analysis of technical element data description, draws this analysis and only relates to time and area under one's jurisdiction 2 dimensions.

In step S15, object space is divided in the dimension analysis, in the multidigit search volume that the dimensions such as time, area under one's jurisdiction consist of, and the selected target region of search.In this example, form the plane of one 2 dimension according to time and area under one's jurisdiction, formed " N time * M area under one's jurisdiction " individual search volume: (a, 1), (a, 2), (c, 1), (b, 2), (c, 3) ... (d, 4).

In step S16, by dimensional comparison, find out best search volume, draw objective result.This example, the time of supposing just drops in 3 intervals, and the area under one's jurisdiction just is in the c interval, so we determine that (c, 3) is minimum search volume.According to one, 22 analysis, determine to go out the F value in (C, 3) spatial retrieval, be objective result.

See also shown in Figure 5ly, shown in Figure 5 is a kind of dynamic indexing unit based on metadata, comprising: first searches module 1, is used for searching all paths that obtain desired value; Computing module 2 is used for calculating the searching cost in described path; Second searches module 3, is used for finding out the minimum cost path; Collection module 4 is used for the collection analysis dimension; Divide module 5, be used for the dimension analysis, divide object space; Determination module 6 as a result, are used for finding out best search volume by dimensional comparison, draw objective result.

Need to prove, Fig. 1 is the preferred embodiment that the present invention introduces to embodiment shown in Figure 5, and those skilled in the art can design more embodiment on this basis fully, does not therefore give unnecessary details herein.

Multiple modification to these embodiment will be apparent concerning those skilled in the art, and General Principle as defined herein can be in the situation that do not break away from the spirit or scope of the present invention, in other embodiments realization.Therefore, the present invention will can not be restricted to these embodiment shown in this article, but will meet the widest scope consistent with principle disclosed herein and features of novelty.

Claims (2)

1. the dynamic search method based on metadata is characterized in that, comprising:

Search all paths that obtain desired value;

Calculate the searching cost in described path;

Find out the minimum cost path;

The collection analysis dimension;

Dimension is analyzed, and divides object space;

By dimensional comparison, find out best search volume, draw objective result.

2. the dynamic indexing unit based on metadata is characterized in that, comprising:

First searches module, is used for searching all paths that obtain desired value;

Computing module is used for calculating the searching cost in described path;

Second searches module, is used for finding out the minimum cost path;

Collection module is used for the collection analysis dimension;

Divide module, be used for the dimension analysis, divide object space;

Determination module is used for finding out best search volume by dimensional comparison as a result, draws objective result.

Images