Index combining method and index combining device

An index and sub-index technology, applied in the field of information processing, can solve the problems of inability to dynamically adjust, unstable system performance, and the impact of index merging costs are not considered, and achieve a good balance, reduce the number of merging, and reduce the effect of impact.

Inactive Publication Date: 2010-11-10
FUJITSU LTD
View PDF0 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] However, judging from many published articles, patents and patent applications, most of the index merging schemes focus on the direct merging of newly added indexes or merging according to the chronological order of addition, without considering the size of the index on the merging. The impact of the cost, and the index merge process cannot be dynamically adjusted, so it leads to unstable system performance that needs to be optimized in the dynamic text set environment

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Index combining method and index combining device
  • Index combining method and index combining device
  • Index combining method and index combining device

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0065] In the first example, as shown in Table 1, the index library includes four sequentially numbered sub-indexes, whose sizes are 1, 1, 1, and 3 respectively.

[0066] Table 1

[0067] subindex number

1

2

3

4

index size

1

1

1

3

[0068] It can be seen from Table 1 that the smallest sub-index size s in the index library is 1. Such as Figure 5 As shown, s=1 can be used as the reference size, and then it is possible to calculate whether the size of each sub-index conforms to the formula (1), and judge whether the total number of sub-indexes conforming to the formula (1) conforms to the formula ( 2). It can be seen from Table 1 that the sub-indexes conforming to formula (1) are sub-index 1, sub-index 2 and sub-index 3, the total number of which is 3, conforming to formula (2). Therefore, these sub-indexes are determined as a sub-index set: {sub-index 1, sub-index 2, sub-index 3}. If the sub-indices in the sub-...

example 2

[0073] In the second example, as shown in Table 3, the index library includes 5 sequentially numbered sub-indexes whose sizes are 1, 1, 1, 1, and 2 respectively.

[0074] table 3

[0075] subindex number

1

2

3

4

5

index size

1

1

1

1

2

[0076] It can be seen from Table 3 that the smallest sub-index size s in the index library is 1. Such as Figure 6 As shown, s=1 can be used as the reference size, and then it is possible to calculate whether the size of each sub-index conforms to the formula (1), and judge whether the total number of sub-indexes conforming to the formula (1) conforms to the formula ( 2). It can be seen from Table 3 that the sub-indexes conforming to formula (1) are sub-index 1, sub-index 2, sub-index 3 and sub-index 4, the total number of which is 4, conforming to formula (2). Therefore, these sub-indexes are determined as a sub-index set: {sub-index 1, sub-index 2, sub-index 3, sub-i...

example 3

[0081] In the third example, as shown in Table 5, the index library includes 5 sequentially numbered sub-indexes whose sizes are 1, 1, 1, 3, and 3, respectively.

[0082] table 5

[0083] subindex number

1

2

3

4

5

index size

1

1

1

3

3

[0084] It can be seen from Table 5 that the smallest sub-index size s in the index library is 1. Such as Figure 7 As shown, s=1 can be used as the reference size, and then it is possible to calculate whether the size of each sub-index conforms to the formula (1), and judge whether the total number of sub-indexes conforming to the formula (1) conforms to the formula (2). It can be seen from Table 5 that the sub-indexes conforming to formula (1) are sub-index 1, sub-index 2 and sub-index 3, the total number of which is 3, conforming to formula (2). Therefore, these sub-indexes are determined as a sub-index set: {sub-index 1, sub-index 2, sub-index 3}. If the sub-indexe...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an index combining method and an index combining device. The index combining method comprises the following steps: determining whether not less than n sub-indexes of which the sizes meet preset combining conditions based on a preset reference exist in an index base or not, wherein n is an integer and is greater than or equal to 2, and the preset reference is related to thesizes of the preset sub-indexes; if the sub-indexes exist, taking the determined sub-indexes as a sub-index set; if the sub-indexes in the sub-index set are combined, computing the sizes of new sub-indexes to be acquired; searching not less than m sub-indexes of which the sizes meet the preset conditions based on the reference related to the sizes of the new sub-indexes in residual sub-indexes, wherein m is the integer and is greater than or equal to 1; if the sub-indexes are searched, adding the searched sub-indexes into the sub-index set, and executing the computing step and the searching step to the new sub-index set; and if the sub-indexes are not searched, combining the sub-indexes in the sub-index set. The method and/or the device of the invention can be used for obtaining relatively stable optimized system performance under dynamic text set environment.

Description

technical field [0001] The present invention generally relates to the field of information processing, and in particular relates to an index merging method and an index merging device using index technology. Background technique [0002] Frequent and efficient index updates are often required in a dynamic document set environment. Since the real-time retrieval system requires support for dynamic document sets and concurrent indexing and querying, that is, it is required to allow users to query while updating the index. However, frequent index updates consume a lot of system performance. In a dynamic document set environment, the main requirement for index update is to compromise the performance of index update and query performance to achieve a more optimal overall performance. For example, in "Dynamic Collections in Indri. CIIR Technical Report (2005)" written by Strohman, T., the requirement of dynamic collection environment for index update technology is analyzed. [0...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
Inventor 葛付江王主龙孟遥于浩
Owner FUJITSU LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap