Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method for searching character string

A string and character technology, applied in the field of string retrieval, can solve the problem that the value of the hash table is not very large, and achieve the effect of overcoming low retrieval efficiency and saving memory resources

Inactive Publication Date: 2007-01-03
ZHEJIANG UNIV
View PDF0 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, in some applications that require ordered storage of strings (such as index maintenance and prefix lookup), hash tables are not very valuable
The B-tree also has this problem when it requires fast retrieval of strings;

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
  • Method for searching character string
  • Method for searching character string
  • Method for searching character string

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0041] In the application system based on large-scale character string processing, the multi-fork tree index access method provided by the present invention can realize efficient retrieval of character strings. Taking the word segmentation dictionary in the search engine as an example, the overall structure diagram of the system is as follows figure 1 As shown, the specific implementation steps are as follows:

[0042] 1. Create a string storage structure, initialize the string storage structure, allocate the necessary memory space, and determine the number of layers for statically allocated memory and the number of layers for dynamically allocated memory.

[0043] 2. Call the program to insert character strings into the multi-fork tree, the specific process is as follows:

[0044] a) For Chinese strings:

[0045] The first step is to use the difference between the GB2312 encoding of the first Chinese character in the string and the GB2312 encoding of "A" to index to the bran...

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 a method to search the character string. The invention records the character sequence information of the character string using the manifold tree as the storage mode and searches the character string using the information. So it is proper for searching the character string and the prefix, suffix. It manages the memory distribution of the manifold tree crunode hierarchically and compresses the manifold tree. So it saves the memory resource and has the high efficient.

Description

technical field [0001] The invention relates to the technical field related to the management of a large number of character string collections, in particular to a method for retrieving character strings. Background technique [0002] In recent years, with the continuous increase of computer users, various computer applications continue to emerge, and many computer applications involve the effective management of a very large character string collection. For example, processing from file management, bibliography search, geographic information index, search engine to a large amount of text on the WEB all involves a very large string collection. At the same time, with the rise of IPv6, how to realize the rapid retrieval of IP in a huge number of IP addresses has become a concern of people; [0003] Currently, there are many data structures for string management, among which the binary search tree (BST) is the simplest and most intuitive one. The performance of the BST struct...

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
IPC IPC(8): G06F17/30
Inventor 陈纯卜佳俊刘康苗陈伟赵梦潘照明
Owner ZHEJIANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com