CN111651406B - Automatic carrier scheduling system file reading method and device - Google Patents
Automatic carrier scheduling system file reading method and device Download PDFInfo
- Publication number
- CN111651406B CN111651406B CN202010436509.6A CN202010436509A CN111651406B CN 111651406 B CN111651406 B CN 111651406B CN 202010436509 A CN202010436509 A CN 202010436509A CN 111651406 B CN111651406 B CN 111651406B
- Authority
- CN
- China
- Prior art keywords
- content
- reading
- chain pair
- coded content
- index
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 230000014509 gene expression Effects 0.000 claims abstract description 21
- 238000001914 filtration Methods 0.000 claims abstract description 13
- 230000003139 buffering effect Effects 0.000 claims abstract description 10
- 208000000044 Amnesia Diseases 0.000 description 2
- 208000026139 Memory disease Diseases 0.000 description 2
- 238000003491 array Methods 0.000 description 2
- 239000000872 buffer Substances 0.000 description 2
- 230000006984 memory degeneration Effects 0.000 description 2
- 208000023060 memory loss Diseases 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 239000000969 carrier Substances 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 208000037265 diseases, disorders, signs and symptoms Diseases 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000000630 rising effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
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 an automatic carrier scheduling system file, 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 feed is read; coding the content between the current line-feeding symbol and the last line-feeding symbol into UTF-8 format, judging whether the coded content is needed or not, filtering the coded content by using a regular expression and releasing the memory if not needed, and storing the coded content into a HASHMAP index linked list if needed; continuing reading until the last line feed is reached; the invention has the advantages that: the memory consumption is small and 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 an automatic carrier scheduling system file.
Background
With the advent of the 5G era, mobile communication has been advanced at an unprecedented speed, and competition of various mobile operators for user resources is more and more intense, and network coverage, network capacity and network quality fundamentally reflect the service level of the mobile network, which becomes a key factor for operators to obtain competitive advantages, and meanwhile, with the rapid increase of urban mobile users and the increasing of high-rise buildings, traffic magic and coverage requirements are also continuously rising. Almost all urban and rural areas have an uneven distribution of carrier frequency resources. The traffic peak occurs in different time periods due to the crowd activity characteristics of different base station coverage areas in different sectors of the same base station, the traffic peak is burst, and the network cannot meet the burst traffic peak. The solution generally adopted is to guarantee the network capacity of the cell by increasing the number of carriers or multiple coverage, etc., but this results in occupying more carrier resources. The intelligent carrier scheduling system, namely the automatic carrier scheduling system, is a cell resource scheduling system capable of effectively improving the unbalanced condition of cell users in a mobile network.
The method is characterized in that the file reading in the resource scheduling process of the automatic carrier scheduling system is critical, the existing automatic carrier scheduling system file reading scheme adopts a DOM mode to read the base station hardware data XML file, the method research on reading XML file based on DOM is disclosed in the 26 th and 4 th period of the university of Liaoning university journal (natural science edition), and the XML file is read in one time in the DOM mode, so that the consumption of memory is very large. In addition, if the XML file is relatively large, it is easy to affect the reading performance and may cause memory leakage.
Disclosure of Invention
The invention aims to solve the technical problems that the file reading method and the device of the automatic carrier scheduling system in the prior art have large memory consumption and are easy to cause memory leakage.
The invention solves the technical problems by the following technical means: an automated carrier scheduling system file reading method, the method comprising:
step one: virtualizing a directory File into an input stream through a File class in a JAVA language;
step two: continuously reading text from an input stream by using a bufferedReader class and buffering characters until a line feed character is read;
step three: coding the content between the current line-feeding symbol and the last line-feeding symbol into UTF-8 format, judging whether the coded content is needed or not, filtering the coded content by using a regular expression and releasing the memory if not needed, and storing the coded content into a HASHMAP index linked list if needed;
step four: continuing to read downwards, returning to execute the third step until the last line-feed is reached.
According to the invention, according to the necessity of data required by carrier waves, a required file is virtualized into an input stream, texts are continuously read from the input stream and characters are buffered until a line feed character is read, so that one line is read and processed, the consumption of a memory is reduced, and the memory is pertinently read in a hashmap index building mode, the whole reading is not required, the memory loss is reduced, only the required content is read from a large number of parameter files for buffering, and the unnecessary content is discarded, thereby preventing the memory leakage caused by full-text reading.
Preferably, the regular expression in the third step is: if the node parameters containing the specific parameter symbols in the coded content need to be acquired, judging whether the coded content contains the specific parameter symbols or not for the first row of each node, and if the coded content does not contain the specific parameter symbols, filtering out the coded content and releasing the memory.
Preferably, the third step includes: establishing a first chain pair for the field name and the index, and 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 coded content is used as the value of the second chain pair.
Preferably, the method further comprises the step five of: and reading the encoded content from the HASHMAP index linked list, retrieving the encoded content in the second chain pair according to the field name in the first chain pair, and finishing the reading of the encoded content.
The invention also provides an automatic carrier scheduling system file reading device, which comprises:
the virtualization module is used for virtualizing the directory File into an input stream through the File class in the JAVA language;
the first reading module is used for continuously reading texts from the input stream by using the bufferedReader class and buffering characters until a line feed character is read;
the judging module is used for coding the content between the current line-feed symbol and the last line-feed symbol 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 HASH MAP index linked list if the coded content is needed;
and the second reading module is used for continuing to read downwards, returning to the execution judging module until the last line-changing symbol is reached.
Preferably, the regular expression in the judging module is: if the node parameters containing the specific parameter symbols in the coded content need to be acquired, judging whether the coded content contains the specific parameter symbols or not for the first row of each node, and if the coded content does not contain the specific parameter symbols, filtering out the coded 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, and 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 coded content is used as the value of the second chain pair.
Preferably, the method further comprises a third reading module: and reading the encoded content from the HASHMAP index linked list, retrieving the encoded content in the second chain pair according to the field name in the first chain pair, and finishing the reading of the encoded content.
The invention has the advantages that: according to the invention, according to the necessity of data required by carrier waves, a required file is virtualized into an input stream, texts are continuously read from the input stream and characters are buffered until a line feed character is read, so that one line is read and processed, the consumption of a memory is reduced, and the memory is pertinently read in a hashmap index building mode, the whole reading is not required, the memory loss is reduced, only the required content is read from a large number of parameter files for buffering, and the unnecessary content is discarded, thereby preventing the memory leakage caused by full-text reading.
Drawings
Fig. 1 is a flowchart of an automatic carrier scheduling system file reading method according to an embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions in the embodiments of the present invention will be clearly and completely described in the following in conjunction with the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Example 1
As shown in fig. 1, a method for reading an automated carrier scheduling system file 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 pathname in an abstract way. The File class is mainly used for creating files and catalogues, searching files, deleting files and the like. File objects represent files and directories that are actually present in the disk.
Step S2: continuously reading text from an input stream by using a bufferedReader class and buffering characters until a line feed character is read; the BufferedReader class is primarily responsible for reading text from a character input stream, buffering individual characters, and thus providing efficient reading of characters, arrays, and lines. The size of the buffer may be specified or a default value may be used, which in most cases is the case.
Step S3: coding the content between the current line-feeding symbol and the last line-feeding symbol into UTF-8 format, judging whether the coded content is needed or not, filtering the coded content by using a regular expression and releasing the memory if not needed, and storing the coded content into a HASHMAP index linked list if needed; 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 encoding is still compatible with ASCII so that the original software that processes ASCII characters can continue to be used without or with only a small number of modifications. It is therefore becoming a preferred code for use in email, web pages and other applications for storing or transmitting text.
Regular expressions, also known as regular expressions. (English: regular Expression, often abbreviated in code as regex, regex p or RE), a concept of computer science. Regular expressions are typically used to retrieve, replace, text that meets 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 generalized by the 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 coded content need to be acquired, judging whether the coded content contains the specific parameter symbols or not for the first row of each node, and if the coded content does not contain the specific parameter symbols, filtering out the coded content and releasing the memory. In practical application, regular expressions are different according to different required contents. For example, if the node parameter containing "dn=" needs to be obtained, it is determined for the first row of each node whether there is the node parameter, and if not, the memory is discarded and released.
In java programming language, the most basic structure is two, one is an array, the other is an analog pointer (reference), and all data structures can be constructed by the two basic structures, and HashMap is no exception. HashMap is effectively a "hash of linked list" data structure, i.e., a combination of arrays and linked lists. The HASHMAP is based on the principle that HASHMAP handles key-value as a whole at the bottom layer, which 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 equivalent method; when one Entry needs to be fetched, the storage position of the Entry in the array is found according to a hash algorithm, and the Entry is fetched from a linked list at the position according to an equal method, wherein the hash algorithm and the equal method belong to the prior art. Although HashMap also occupies a certain memory, the filtered content occupies less memory and has a small occupancy, so that the memory can be saved by adopting HashMap.
In this embodiment, a first chain pair for a field name and an index is established, and a second chain pair for an index and 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 coded content is used as the value of the second chain pair. The method for establishing the first chain pair and the second chain pair is matched through an indexing method, and the indexes occupy a certain storage space, but the indexing method belongs to digital matching, the occupied space is small, the field names and the coded contents are directly adopted to match characters, under the conditions that the space occupied by the character matching is large and the indexes are lack, the positions of the field names and the coded contents in the HASLMAP index chain table are difficult to determine, disorder is easy to occur, faults occur, the indexes directly correspond to the positions in the HASLMAP index chain table, and the field names and the coded contents can be directly corresponding in the HASLMAP index chain table.
Step S4: continuing to read downwards, and returning to execute the step S3 until the last line-feed symbol is reached;
step S4 is followed by step S5: and reading the encoded content from the HASHMAP index linked list, retrieving the encoded content in the second chain pair according to the field name in the first chain pair, and finishing the reading of the encoded content. The step S4 mainly filters the needed content in the whole file, filters the unnecessary content, stores the filtered content into a HASHMAP index linked list, and reads all the needed content through the HASHMAP index linked list. In practical application, step S5 may be placed after step S3, after the reading of a line of data is completed, if the line of data is the required content, the line of data is stored in the hash map index linked list, the content of the line is read out through the hash map index linked list, and the next line is continuously read until the last line is reached.
According to the technical scheme, the file reading method of the automatic carrier scheduling system provided by the invention virtualizes the needed file into the input stream according to the necessity of data needed by a carrier, continuously reads texts from the input stream and buffers characters until a line changing symbol is read, so that one line is read and processed, the consumption of a memory is reduced, the needed content is flexibly read in a hashmap index building mode, the consumption of the read file to the memory is reduced, the needed content is only read from a large number of parameter files to be cached, and unnecessary content is discarded, thereby preventing the memory leakage caused by full-text reading.
Example 2
Corresponding to embodiment 1 of the present invention, embodiment 2 of the present invention further provides an automated carrier scheduling system file reading device, where the device includes:
the virtualization module is used for virtualizing the directory File into an input stream through the File class in the JAVA language;
the first reading module is used for continuously reading texts from the input stream by using the bufferedReader class and buffering characters until a line feed character is read;
the judging module is used for coding the content between the current line-feed symbol and the last line-feed symbol 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 HASH MAP index linked list if the coded content is needed;
and the second reading module is used for continuing to read downwards, returning to the execution judging module until the last line-changing symbol is reached.
Specifically, the regular expression in the judging module is: if the node parameters containing the specific parameter symbols in the coded content need to be acquired, judging whether the coded content contains the specific parameter symbols or not for the first row of each node, and if the coded content does not contain the specific parameter symbols, filtering out the coded 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, and 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 coded content is used as the value of the second chain pair.
Specifically, the method further comprises a third reading module: and reading the encoded content from the HASHMAP index linked list, retrieving the encoded content in the second chain pair according to the field name in the first chain pair, and finishing the reading of the encoded content.
The above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the 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 scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims (6)
1. An automated carrier scheduling system file reading method, the method comprising:
step one: virtualizing a directory File into an input stream through a File class in a JAVA language;
step two: continuously reading text from an input stream by using a bufferedReader class and buffering characters until a line feed character is read;
step three: coding the content between the current line-feeding symbol and the last line-feeding symbol into UTF-8 format, judging whether the coded content is needed or not, filtering the coded content by using a regular expression and releasing the memory if not needed, and storing the coded content into a HASHMAP index linked list if needed; the third step comprises: establishing a first chain pair for the field name and the index, and establishing a second chain pair for the index and the encoded content; taking the field name as a key value of a first chain pair, taking the index as a value of the first chain pair, taking the index as a key value of a second chain pair, and taking the coded content as a value of the second chain pair;
step four: continuing to read downwards, returning to execute the third step until the last line-feed is reached.
2. The method for reading an automated carrier scheduling system file according to claim 1, wherein the regular expression in the third step is: if the node parameters containing the specific parameter symbols in the coded content need to be acquired, judging whether the coded content contains the specific parameter symbols or not for the first row of each node, and if the coded content does not contain the specific parameter symbols, filtering out the coded content and releasing the memory.
3. The method for reading an automated carrier scheduling system file according to claim 1, further comprising the step of: and reading the encoded content from the HASHMAP index linked list, retrieving the encoded content in the second chain pair according to the field name in the first chain pair, and finishing the reading of the encoded content.
4. 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 the File class in the JAVA language;
the first reading module is used for continuously reading texts from the input stream by using the bufferedReader class and buffering characters until a line feed character is read;
the judging module is used for coding the content between the current line-feed symbol and the last line-feed symbol 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 HASH MAP index linked list if the coded content is needed; the judging module is further used for: establishing a first chain pair for the field name and the index, and establishing a second chain pair for the index and the encoded content; taking the field name as a key value of a first chain pair, taking the index as a value of the first chain pair, taking the index as a key value of a second chain pair, and taking the coded content as a value of the second chain pair;
and the second reading module is used for continuing to read downwards, returning to the execution judging module until the last line-changing symbol is reached.
5. The automated carrier scheduling system file reading apparatus of claim 4, wherein the regular expression in the determining module is: if the node parameters containing the specific parameter symbols in the coded content need to be acquired, judging whether the coded content contains the specific parameter symbols or not for the first row of each node, and if the coded content does not contain the specific parameter symbols, filtering out the coded content and releasing the memory.
6. The automated carrier scheduling system file reading apparatus of claim 4, further comprising a third reading module: and reading the encoded content from the HASHMAP index linked list, retrieving the encoded content in the second chain pair according to the field name in the first chain pair, and finishing the reading of 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 CN111651406A (en) | 2020-09-11 |
| CN111651406B true 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 (4)
| 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 |
| 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 |
| CN108664487A (en) * | 2017-03-28 | 2018-10-16 | Tcl集团股份有限公司 | A kind of write-in of hash table data, read method and system |
Family Cites Families (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005332146A (en) * | 2004-05-19 | 2005-12-02 | Internatl Business Mach Corp <Ibm> | Dynamic content creation program generation device, program for generating dynamic content creation program, and dynamic content creation program generation method |
| US7593938B2 (en) * | 2006-12-22 | 2009-09-22 | Isilon Systems, Inc. | Systems and methods of directory entry encodings |
| US8429143B2 (en) * | 2008-04-25 | 2013-04-23 | International Business Machines Corporation | Methods and systems for improving hash table performance |
| CN101478608A (en) * | 2009-01-09 | 2009-07-08 | 南京联创科技股份有限公司 | Fast operating method for mass data based on two-dimensional hash |
| US8078825B2 (en) * | 2009-03-11 | 2011-12-13 | 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 |
| CN106469137A (en) * | 2015-08-19 | 2017-03-01 | 互联网域名系统北京市工程研究中心有限公司 | XML document analysis method and device |
| CN105653611B (en) * | 2015-12-24 | 2019-08-20 | 深圳市汇朗科技有限公司 | Divide table Page sorting querying method and device |
| CN108241657B (en) * | 2016-12-24 | 2022-01-07 | 北京亿阳信通科技有限公司 | Web data list processing method and device |
| CN106886439B (en) * | 2017-02-15 | 2020-03-10 | 郑州云海信息技术有限公司 | Method for rapidly initializing SCM (sparse code multiple Access) security baseline knowledge base |
| CN106909657A (en) * | 2017-02-27 | 2017-06-30 | 郑州云海信息技术有限公司 | A kind of SCAP protocol securitys baseline knowledge base fast initializing method |
| US10678768B2 (en) * | 2017-06-30 | 2020-06-09 | 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 |
| US11392570B2 (en) * | 2018-03-09 | 2022-07-19 | Microsoft Technology Licensing, Llc | Key-value store system |
| US11243745B2 (en) * | 2018-07-15 | 2022-02-08 | Microsoft Technology Licensing, Llc | Text editor buffering implementation with offsets management |
| CN111124479B (en) * | 2019-12-18 | 2024-03-22 | 北京像素软件科技股份有限公司 | Method and system for analyzing configuration file and electronic equipment |
-
2020
- 2020-05-21 CN CN202010436509.6A patent/CN111651406B/en active Active
Patent Citations (4)
| 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 |
| 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 |
| CN108664487A (en) * | 2017-03-28 | 2018-10-16 | Tcl集团股份有限公司 | A kind of write-in of hash table data, read method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111651406A (en) | 2020-09-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9230083B2 (en) | Securing application information in system-wide search engines | |
| US8301437B2 (en) | Tokenization platform | |
| US5963954A (en) | Method for mapping an index of a database into an array of files | |
| US6105019A (en) | Constrained searching of an index | |
| US7739288B2 (en) | Systems and methods of directory entry encodings | |
| CN108509437B (en) | ElasticSearch query acceleration method | |
| US20140188893A1 (en) | Data retrieval apparatus, data storage method and data retrieval method | |
| 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 | |
| US8386728B1 (en) | Methods and systems for prioritizing a crawl | |
| CN109376125A (en) | Metadata storage method, apparatus, device and computer-readable storage medium | |
| CN103778202A (en) | Enterprise electronic document managing server side and system | |
| CN104636464B (en) | The method and apparatus for accessing file | |
| CN114416670B (en) | Index creating method and device suitable for network disk document, network disk and storage medium | |
| CN110908996B (en) | Data processing method and device | |
| CN116301656A (en) | Data storage method, system and equipment based on log structure merging tree | |
| CN110147431A (en) | Key word matching method, device, computer equipment and storage medium | |
| CN111651406B (en) | Automatic carrier scheduling system file reading method and device | |
| US6640225B1 (en) | Search method using an index file and an apparatus therefor | |
| US11055266B2 (en) | Efficient key data store entry traversal and result generation | |
| US20030220914A1 (en) | Method for managing data in a network | |
| CN108509438B (en) | ElasticSearch fragment expansion method | |
| CN102750391A (en) | File previewing method and system based on Hadoop distribution type | |
| JP2675958B2 (en) | Information retrieval computer system and method of operating storage device thereof | |
| JP2000339332A (en) | Medium recording retrieval index, method and device for updating retrieval index and medium recording its program |
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 |