CN111651406A - Automatic carrier scheduling system file reading method and device - Google Patents
Automatic carrier scheduling system file reading method and device Download PDFInfo
- Publication number
- CN111651406A CN111651406A CN202010436509.6A CN202010436509A CN111651406A CN 111651406 A CN111651406 A CN 111651406A CN 202010436509 A CN202010436509 A CN 202010436509A CN 111651406 A CN111651406 A CN 111651406A
- Authority
- CN
- China
- Prior art keywords
- encoded content
- reading
- content
- index
- chain pair
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/11—File system administration, e.g. details of archiving or snapshots
- G06F16/116—Details of conversion of file system types or formats
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/13—File access structures, e.g. distributed indices
- G06F16/134—Distributed indices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/14—Details of searching files based on file metadata
- G06F16/148—File search processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
- G06F8/31—Programming languages or programming paradigms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformation of program code
- G06F8/41—Compilation
- G06F8/44—Encoding
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Library & Information Science (AREA)
- Computing Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method and a device for reading files of an automatic carrier scheduling system, wherein the method comprises the following steps: virtualizing a directory File into an input stream through a File class in a JAVA language; continuously reading text from the input stream and buffering characters until a line break is read; encoding the content between the current line break and the last line break into UTF-8 format, judging whether the encoded content is needed, if not, filtering the encoded content by using a regular expression and releasing the memory, if so, storing the encoded content to a HASHMAP index linked list; continuing reading until the last line break is reached; the invention has the advantages that: the memory consumption is small and the memory leakage can be avoided.
Description
Technical Field
The invention relates to the field of data reading, in particular to a method and a device for reading a file of an automatic carrier scheduling system.
Background
With the arrival of the 5G era and the unprecedented development of mobile communication, competition of user resources by mobile operators is intensified, network coverage, network capacity and network quality fundamentally reflect that the service level of the mobile network becomes a key factor for operators to obtain competitive advantages, and simultaneously with the rapid increase of urban mobile users and more high-rise buildings, telephone traffic and coverage requirements are continuously increased. Almost all urban and rural areas have unbalanced distribution of carrier frequency resources. The traffic peak appears in different time periods due to the crowd activity characteristics of different sectors and coverage areas of different base stations of the same base station, the traffic peak is burst, and the network cannot meet the burst traffic peak. The commonly adopted solution is to guarantee the network capacity of the cell by increasing the number of carriers or multiple coverage, but this will result in occupying more carrier resources. An intelligent carrier wave scheduling system, namely an automatic carrier wave scheduling system, is a cell resource scheduling system which can effectively improve the unbalanced condition of cell users in a mobile network.
The reading of files in the process of resource scheduling by an automatic carrier scheduling system is critical, the existing automatic carrier scheduling system file reading scheme adopts a DOM mode to read a base station hardware data XML file, and the research of a method for reading the XML file based on the DOM is disclosed in Liaoning university journal (Nature science edition) volume 26, No. 4. In addition, if the XML file is large, the reading performance is easily affected and the memory leakage is caused.
Disclosure of Invention
The technical problem to be solved by the invention is that the method and the device for reading the file of the automatic carrier scheduling system in the prior art have the problems of large memory consumption and easy memory leakage.
The invention solves the technical problems through the following technical means: an automated carrier scheduling system file reading method, the method comprising:
the method comprises the following steps: virtualizing a directory File into an input stream through a File class in a JAVA language;
step two: continuously reading texts and buffering characters from the input stream by using a buffer reader class until line feed characters are read;
step three: encoding the content between the current line break and the last line break into UTF-8 format, judging whether the encoded content is needed, if not, filtering the encoded content by using a regular expression and releasing the memory, if so, storing the encoded content to a HASHMAP index linked list;
step four: continuing to read downwards, and returning to execute the third step until the last line break is reached.
The method virtualizes the required files into input streams according to the necessity of data required by the carrier waves, continuously reads texts from the input streams and buffers characters until line-changing characters are read, thereby reading a line to process a line, reducing the consumption of the memory, and pointedly reading in a manner of establishing indexes by hashmap without reading all the contents, reducing the memory loss, only reading the required contents from a large number of parameter files for caching, and discarding the unnecessary contents, thereby preventing the memory leakage caused by full-text reading.
Preferably, the regular expression in step three is: if the node parameters containing the specific parameter symbols in the encoded content need to be acquired, judging whether the encoded content has the specific parameter symbols or not for the first line of each node, and if the encoded content does not have the specific parameter symbols, filtering the encoded content and releasing the memory.
Preferably, the third step includes: establishing a first chain pair for the field name and the index, establishing a second chain pair for the index and the encoded content;
the field name is used as the key value of the first chain pair, the index is used as the key value of the second chain pair, and the encoded content is used as the value of the second chain pair.
Preferably, the method further comprises the following step five: and reading the encoded content from the HASHMAP index linked list, retrieving the encoded content in the second linked pair according to the field name in the first linked pair, and finishing reading the encoded content.
The invention also provides a device for reading the file of the automatic carrier scheduling system, which comprises:
the virtualization module is used for virtualizing the directory File into an input stream through a File class in a JAVA language;
the first reading module is used for continuously reading texts from the input stream by using a buffer reader class and buffering characters until line feed characters are read;
the judging module is used for coding the content between the current linefeed character and the last linefeed character into a UTF-8 format, judging whether the coded content is needed or not, filtering the coded content by using a regular expression and releasing a memory if the coded content is not needed, and storing the coded content into a HASHMAP index linked list if the coded content is needed;
and the second reading module is used for continuously reading downwards and returning to the execution judgment module until the last line feed character is reached.
Preferably, the regular expression in the judging module is: if the node parameters containing the specific parameter symbols in the encoded content need to be acquired, judging whether the encoded content has the specific parameter symbols or not for the first line of each node, and if the encoded content does not have the specific parameter symbols, filtering the encoded content and releasing the memory.
Preferably, the judging module is further configured to: establishing a first chain pair for the field name and the index, establishing a second chain pair for the index and the encoded content;
the field name is used as the key value of the first chain pair, the index is used as the key value of the second chain pair, and the encoded content is used as the value of the second chain pair.
Preferably, the device further comprises a third reading module: and reading the encoded content from the HASHMAP index linked list, retrieving the encoded content in the second linked pair according to the field name in the first linked pair, and finishing reading the encoded content.
The invention has the advantages that: the method virtualizes the required files into input streams according to the necessity of data required by the carrier waves, continuously reads texts from the input streams and buffers characters until line-changing characters are read, thereby reading a line to process a line, reducing the consumption of the memory, and pointedly reading in a manner of establishing indexes by hashmap without reading all the contents, reducing the memory loss, only reading the required contents from a large number of parameter files for caching, and discarding the unnecessary contents, thereby preventing the memory leakage caused by full-text reading.
Drawings
Fig. 1 is a flowchart of a file reading method of an automatic carrier scheduling system according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the embodiments of the present invention, and it is obvious that the described embodiments are some embodiments of the present invention, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Example 1
As shown in fig. 1, an automated carrier scheduling system file reading method includes:
step S1: virtualizing a directory File into an input stream through a File class in a JAVA language; the java file class represents the file name and directory path name in an abstract manner. The File class is mainly used for creating files and directories, searching files, deleting files and the like. File objects represent files and directories that actually exist in the disk.
Step S2: continuously reading texts and buffering characters from the input stream by using a buffer reader class until line feed characters are read; the buffer reader class is primarily responsible for reading text from a character input stream, buffering individual characters, and thereby providing efficient reading of characters, arrays, and lines. The size of the buffer may be specified or a default value may be used, in most cases.
Step S3: encoding the content between the current line break and the last line break into UTF-8 format, judging whether the encoded content is needed, if not, filtering the encoded content by using a regular expression and releasing the memory, if so, storing the encoded content to a HASHMAP index linked list; UTF-8(8 bit, Universal Character Set/Unicode Transformation Format) is a variable length Character encoding for Unicode. It can be used to represent any character in the Unicode standard, and the first byte in its code is still compatible with ASCII, so that the original software for processing ASCII characters can be used continuously without or after only a few modifications. Thus, it is becoming a preferred encoding for use in e-mail, web pages, and other text storage or delivery applications.
Regular expressions, also known as regular expressions. (English: Regular Expression, often abbreviated in code as regex, regexp or RE), a concept of computer science. Regular expressions are typically used to retrieve, replace, text that conforms to a certain pattern (rule). Many programming languages support string operations using regular expressions. For example, a powerful regular expression engine is built into Perl. The concept of regular expressions was originally popularized by tool software in Unix (e.g., sed and grep). The regular expression in this embodiment is: if the node parameters containing the specific parameter symbols in the encoded content need to be acquired, judging whether the encoded content has the specific parameter symbols or not for the first line of each node, and if the encoded content does not have the specific parameter symbols, filtering the encoded content and releasing the memory. In practical application, the regular expressions are different according to different required contents. For example, if a node parameter containing "Dn ═ needs to be acquired, it is determined whether the parameter exists in the head row of each node, and if not, the parameter is discarded and the memory is released.
In the java programming language, the most basic structures are two, one is an array, the other is an analog pointer (reference), all data structures can be constructed by using the two basic structures, and HashMap is no exception. HashMap is actually a "linked-list hash" data structure, i.e., a combination of an array and a linked-list. The HASHMAP has the basic principle that HashMap processes key-value as a whole at the bottom layer, and the whole is an Entry object. The HashMap bottom layer adopts an Entry [ ] array to store all key-value pairs, when an Entry object needs to be stored, the storage position of the Entry object in the array is determined according to a hash algorithm, and then the storage position of the Entry object in a linked list on the array position is determined according to an equals method; when an Entry needs to be taken out, the storage position of the Entry in the array is found according to a hash algorithm, and the Entry is taken out from the linked list at the position according to an equals method, wherein the hash algorithm and the equals method both belong to the prior art. Although the HashMap also occupies a certain memory, compared with the filtered content, the HashMap occupies less memory and occupies a small percentage, so that the HashMap can save the memory.
In this embodiment, a first chain pair for a field name and an index is established, and a second chain pair for the index and the encoded content is established;
the field name is used as the key value of the first chain pair, the index is used as the key value of the second chain pair, and the encoded content is used as the value of the second chain pair. Although the indexes occupy certain storage space through the matching of the first chain pair and the second chain pair by the indexing method, the indexing method belongs to digital matching and occupies less space, the field names are directly adopted to match with the coded contents, character matching is required, the field names and the coded contents are difficult to determine in the HASHMAP index linked list, confusion and failure occur under the condition that the character matching occupies more space and the indexes are lacked, and the field names and the coded contents directly correspond to the positions in the HASHMAP index linked list, so that the field names and the coded contents can be directly corresponding to the positions in the HASHMAP index linked list.
Step S4: continuing to read downwards, and returning to execute the step S3 until the last line break is reached;
step S5 is also included after step S4: and reading the encoded content from the HASHMAP index linked list, retrieving the encoded content in the second linked pair according to the field name in the first linked pair, and finishing reading the encoded content. The step is mainly to screen the required content in the whole file in step S4, filter out the unnecessary content and store the unnecessary content in the hash map index linked list, and read out all the required content through the hash map index linked list. In practical applications, the step S5 may be placed after the step S3, after the reading of one line of data is completed, if the line of data is the required content, the required content is stored in the hash map index linked list, the line of content is read through the hash map index linked list, and the next line of data is read continuously until the last line of data is reached.
Through the technical scheme, the file reading method of the automatic carrier scheduling system, provided by the invention, virtualizes the required file into the input stream according to the necessity of data required by a carrier, continuously reads texts and buffers characters from the input stream until line-changing characters are read, so that one line is read and processed, the consumption of a memory is reduced, the required content is flexibly read by establishing an index through a hashmap, the consumption of the read file on the memory is reduced, only the required content is read from a large number of parameter files for caching, and the unnecessary content is discarded, so that the memory leakage caused by full-text reading is prevented.
Example 2
Corresponding to embodiment 1 of the present invention, embodiment 2 of the present invention further provides an apparatus for reading a file in an automatic carrier scheduling system, where the apparatus includes:
the virtualization module is used for virtualizing the directory File into an input stream through a File class in a JAVA language;
the first reading module is used for continuously reading texts from the input stream by using a buffer reader class and buffering characters until line feed characters are read;
the judging module is used for coding the content between the current linefeed character and the last linefeed character into a UTF-8 format, judging whether the coded content is needed or not, filtering the coded content by using a regular expression and releasing a memory if the coded content is not needed, and storing the coded content into a HASHMAP index linked list if the coded content is needed;
and the second reading module is used for continuously reading downwards and returning to the execution judgment module until the last line feed character is reached.
Specifically, the regular expression in the determination module is as follows: if the node parameters containing the specific parameter symbols in the encoded content need to be acquired, judging whether the encoded content has the specific parameter symbols or not for the first line of each node, and if the encoded content does not have the specific parameter symbols, filtering the encoded content and releasing the memory.
Specifically, the judging module is further configured to: establishing a first chain pair for the field name and the index, establishing a second chain pair for the index and the encoded content;
the field name is used as the key value of the first chain pair, the index is used as the key value of the second chain pair, and the encoded content is used as the value of the second chain pair.
Specifically, the device further comprises a third reading module: and reading the encoded content from the HASHMAP index linked list, retrieving the encoded content in the second linked pair according to the field name in the first linked pair, and finishing reading the encoded content.
The above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (8)
1. An automated carrier scheduling system file reading method, the method comprising:
the method comprises the following steps: virtualizing a directory File into an input stream through a File class in a JAVA language;
step two: continuously reading texts and buffering characters from the input stream by using a buffer reader class until line feed characters are read;
step three: encoding the content between the current line break and the last line break into UTF-8 format, judging whether the encoded content is needed, if not, filtering the encoded content by using a regular expression and releasing the memory, if so, storing the encoded content to a HASHMAP index linked list;
step four: continuing to read downwards, and returning to execute the third step until the last line break is reached.
2. The method according to claim 1, wherein the regular expression in step three is: if the node parameters containing the specific parameter symbols in the encoded content need to be acquired, judging whether the encoded content has the specific parameter symbols or not for the first line of each node, and if the encoded content does not have the specific parameter symbols, filtering the encoded content and releasing the memory.
3. The method according to claim 1, wherein the third step comprises: establishing a first chain pair for the field name and the index, establishing a second chain pair for the index and the encoded content;
the field name is used as the key value of the first chain pair, the index is used as the key value of the second chain pair, and the encoded content is used as the value of the second chain pair.
4. The method according to claim 3, further comprising the following steps: and reading the encoded content from the HASHMAP index linked list, retrieving the encoded content in the second linked pair according to the field name in the first linked pair, and finishing reading the encoded content.
5. An automated carrier scheduling system file reading apparatus, the apparatus comprising:
the virtualization module is used for virtualizing the directory File into an input stream through a File class in a JAVA language;
the first reading module is used for continuously reading texts from the input stream by using a buffer reader class and buffering characters until line feed characters are read;
the judging module is used for coding the content between the current linefeed character and the last linefeed character into a UTF-8 format, judging whether the coded content is needed or not, filtering the coded content by using a regular expression and releasing a memory if the coded content is not needed, and storing the coded content into a HASHMAP index linked list if the coded content is needed;
and the second reading module is used for continuously reading downwards and returning to the execution judgment module until the last line feed character is reached.
6. The device according to claim 5, wherein the regular expression in the determining module is: if the node parameters containing the specific parameter symbols in the encoded content need to be acquired, judging whether the encoded content has the specific parameter symbols or not for the first line of each node, and if the encoded content does not have the specific parameter symbols, filtering the encoded content and releasing the memory.
7. The apparatus according to claim 5, wherein the determining module is further configured to: establishing a first chain pair for the field name and the index, establishing a second chain pair for the index and the encoded content;
the field name is used as the key value of the first chain pair, the index is used as the key value of the second chain pair, and the encoded content is used as the value of the second chain pair.
8. The automatic carrier scheduling system file reading device of claim 7, further comprising a third reading module: and reading the encoded content from the HASHMAP index linked list, retrieving the encoded content in the second linked pair according to the field name in the first linked pair, and finishing reading the encoded content.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010436509.6A CN111651406B (en) | 2020-05-21 | 2020-05-21 | Automatic carrier scheduling system file reading method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010436509.6A CN111651406B (en) | 2020-05-21 | 2020-05-21 | Automatic carrier scheduling system file reading method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111651406A true CN111651406A (en) | 2020-09-11 |
| CN111651406B CN111651406B (en) | 2023-07-25 |
Family
ID=72342792
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010436509.6A Active CN111651406B (en) | 2020-05-21 | 2020-05-21 | Automatic carrier scheduling system file reading method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111651406B (en) |
Citations (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2004006067A2 (en) * | 2002-07-09 | 2004-01-15 | Intelitrac, Inc. | System and method for structuring data in a computer system |
| US20050262042A1 (en) * | 2004-05-19 | 2005-11-24 | International Business Machines Corporation | Generating a dynamic content creation program |
| US20080154978A1 (en) * | 2006-12-22 | 2008-06-26 | Lemar Eric M | Systems and methods of directory entry encodings |
| US20090271366A1 (en) * | 2008-04-25 | 2009-10-29 | International Business Machines Corporation | Methods and Systems for Improving Hash Table Performance |
| US20100179954A1 (en) * | 2009-01-09 | 2010-07-15 | Linkage Technology Group Co., Ltd. | Quick Mass Data Manipulation Method Based on Two-Dimension Hash |
| US20100235606A1 (en) * | 2009-03-11 | 2010-09-16 | Oracle America, Inc. | Composite hash and list partitioning of database tables |
| CN102289445A (en) * | 2011-06-01 | 2011-12-21 | 宇龙计算机通信科技(深圳)有限公司 | Method and device for analyzing XML (Extensible Markup Language) file and terminal |
| EP2629212A1 (en) * | 2012-02-14 | 2013-08-21 | Alcatel Lucent | Method for storing and searching tagged content items in a distributed system |
| CN104391993A (en) * | 2014-12-15 | 2015-03-04 | 浪潮(北京)电子信息产业有限公司 | Method and system for recognizing webpage codes |
| CN105653611A (en) * | 2015-12-24 | 2016-06-08 | 深圳市汇朗科技有限公司 | Submeter paging sorting query method and device |
| CN106469137A (en) * | 2015-08-19 | 2017-03-01 | 互联网域名***北京市工程研究中心有限公司 | XML document analysis method and device |
| CN106886439A (en) * | 2017-02-15 | 2017-06-23 | 郑州云海信息技术有限公司 | A kind of method that fast initialization is carried out to SCM security baseline knowledge base |
| CN106909657A (en) * | 2017-02-27 | 2017-06-30 | 郑州云海信息技术有限公司 | A kind of SCAP protocol securitys baseline knowledge base fast initializing method |
| CN108241657A (en) * | 2016-12-24 | 2018-07-03 | 北京亿阳信通科技有限公司 | A kind of web data list processing method and processing device |
| CN108664487A (en) * | 2017-03-28 | 2018-10-16 | Tcl集团股份有限公司 | A kind of write-in of hash table data, read method and system |
| US20190005079A1 (en) * | 2017-06-30 | 2019-01-03 | Intel Corporation | Logical band-based key-value storage structure |
| CN110134398A (en) * | 2018-02-02 | 2019-08-16 | 阿里巴巴集团控股有限公司 | Analytic method, system and the equipment of list data |
| US20190278849A1 (en) * | 2018-03-09 | 2019-09-12 | Microsoft Technology Licensing, Llc | Key-value store system |
| US20200019384A1 (en) * | 2018-07-15 | 2020-01-16 | Microsoft Technology Licensing, Llc | Text editor buffering implementation with offsets management |
| CN111124479A (en) * | 2019-12-18 | 2020-05-08 | 北京像素软件科技股份有限公司 | Configuration file analysis method and system and electronic equipment |
-
2020
- 2020-05-21 CN CN202010436509.6A patent/CN111651406B/en active Active
Patent Citations (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2004006067A2 (en) * | 2002-07-09 | 2004-01-15 | Intelitrac, Inc. | System and method for structuring data in a computer system |
| US20050262042A1 (en) * | 2004-05-19 | 2005-11-24 | International Business Machines Corporation | Generating a dynamic content creation program |
| US20080154978A1 (en) * | 2006-12-22 | 2008-06-26 | Lemar Eric M | Systems and methods of directory entry encodings |
| US20090271366A1 (en) * | 2008-04-25 | 2009-10-29 | International Business Machines Corporation | Methods and Systems for Improving Hash Table Performance |
| US20100179954A1 (en) * | 2009-01-09 | 2010-07-15 | Linkage Technology Group Co., Ltd. | Quick Mass Data Manipulation Method Based on Two-Dimension Hash |
| US20100235606A1 (en) * | 2009-03-11 | 2010-09-16 | Oracle America, Inc. | Composite hash and list partitioning of database tables |
| CN102289445A (en) * | 2011-06-01 | 2011-12-21 | 宇龙计算机通信科技(深圳)有限公司 | Method and device for analyzing XML (Extensible Markup Language) file and terminal |
| EP2629212A1 (en) * | 2012-02-14 | 2013-08-21 | Alcatel Lucent | Method for storing and searching tagged content items in a distributed system |
| CN104391993A (en) * | 2014-12-15 | 2015-03-04 | 浪潮(北京)电子信息产业有限公司 | Method and system for recognizing webpage codes |
| CN106469137A (en) * | 2015-08-19 | 2017-03-01 | 互联网域名***北京市工程研究中心有限公司 | XML document analysis method and device |
| CN105653611A (en) * | 2015-12-24 | 2016-06-08 | 深圳市汇朗科技有限公司 | Submeter paging sorting query method and device |
| CN108241657A (en) * | 2016-12-24 | 2018-07-03 | 北京亿阳信通科技有限公司 | A kind of web data list processing method and processing device |
| CN106886439A (en) * | 2017-02-15 | 2017-06-23 | 郑州云海信息技术有限公司 | A kind of method that fast initialization is carried out to SCM security baseline knowledge base |
| CN106909657A (en) * | 2017-02-27 | 2017-06-30 | 郑州云海信息技术有限公司 | A kind of SCAP protocol securitys baseline knowledge base fast initializing method |
| CN108664487A (en) * | 2017-03-28 | 2018-10-16 | Tcl集团股份有限公司 | A kind of write-in of hash table data, read method and system |
| US20190005079A1 (en) * | 2017-06-30 | 2019-01-03 | Intel Corporation | Logical band-based key-value storage structure |
| CN110134398A (en) * | 2018-02-02 | 2019-08-16 | 阿里巴巴集团控股有限公司 | Analytic method, system and the equipment of list data |
| US20190278849A1 (en) * | 2018-03-09 | 2019-09-12 | Microsoft Technology Licensing, Llc | Key-value store system |
| US20200019384A1 (en) * | 2018-07-15 | 2020-01-16 | Microsoft Technology Licensing, Llc | Text editor buffering implementation with offsets management |
| CN111124479A (en) * | 2019-12-18 | 2020-05-08 | 北京像素软件科技股份有限公司 | Configuration file analysis method and system and electronic equipment |
Non-Patent Citations (1)
| Title |
|---|
| 蔡羽, pages: 82 - 91 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111651406B (en) | 2023-07-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102436513B (en) | Distributed search method and system | |
| CN102906751A (en) | Method and device for data storage and data query | |
| CN108959244A (en) | The method and apparatus of address participle | |
| GB2417342A (en) | Indexing system for a computer file store | |
| US20070156655A1 (en) | Method of retrieving data from a data repository, and software and apparatus relating thereto | |
| CN109376125A (en) | A kind of metadata storing method, device, equipment and computer readable storage medium | |
| CN114416670B (en) | Index creating method and device suitable for network disk document, network disk and storage medium | |
| US6546382B1 (en) | Finding the TOP N values through the execution of a query | |
| CN103856503B (en) | Processing method of file data of NAS cluster system and NAS cluster system | |
| Litwin et al. | The bounded disorder access method | |
| CN117216023A (en) | Large-scale network data storage method and system | |
| CN110908996B (en) | Data processing method and device | |
| US7467150B2 (en) | Block-aware encoding of bitmap for bitmap index eliminating max-slot restriction | |
| CN111651406B (en) | Automatic carrier scheduling system file reading method and device | |
| US20090225767A1 (en) | Network packet capturing method | |
| CN101600023A (en) | Short messages of terminals searching method and device thereof | |
| KR102127785B1 (en) | Method and apparatus for providing efficient indexing and computer program included in computer readable medium therefor | |
| CN116301656A (en) | Data storage method, system and equipment based on log structure merging tree | |
| US5500887A (en) | Data access method for subscriber location information | |
| CN107066581B (en) | The storage of distributed traffic monitor video data and quick retrieval system | |
| JP2000339332A (en) | Medium recording retrieval index, method and device for updating retrieval index and medium recording its program | |
| JP2675958B2 (en) | Information retrieval computer system and method of operating storage device thereof | |
| CN112714447A (en) | Platform short message purification method based on mobile phone number and short message content dual-mode detection | |
| CN107918654B (en) | File decompression method and device and electronic equipment | |
| JP4451722B2 (en) | Database server and database system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |