CN103853772A - High-efficiency reverse index structure and organizing method - Google Patents
High-efficiency reverse index structure and organizing method Download PDFInfo
- Publication number
- CN103853772A CN103853772A CN201210511478.1A CN201210511478A CN103853772A CN 103853772 A CN103853772 A CN 103853772A CN 201210511478 A CN201210511478 A CN 201210511478A CN 103853772 A CN103853772 A CN 103853772A
- Authority
- CN
- China
- Prior art keywords
- row
- attribute
- record
- recording mechanism
- 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.)
- 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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2272—Management thereof
Abstract
The invention discloses a high-efficiency reverse index structure and an organizing method. A recording reverse item and an attribute reverse item are separately stored, so that information redundancy is reduced; reverse indexes are stored in a partitioning mode; the optimization of a database index is taken as an entry point and the advantages of a chain table and a centralized positioning table are comprehensively utilized to manage the reverse blocks, so that the dynamic maintenance of indexes is benefited and the random access under the SKIP technique is convenient; the compression technique is adopted according to inter-domain incidence relation, so that much information is stored in less space; according to the high-efficiency reverse index structure and the organizing method provided by the invention, the storage space is reduced, the access time is optimized, the problem of reverse index optimization is solved to some extent and the effective management for mass data is realized.
Description
Technical field
The present invention relates to information retrieval technique, specifically, relate to the efficient inverted index structure and the method for organizing that in text retrieval system, use.
Background technology
In the network environment of large data age, quantity of information and customer volume are explosive growth, have brought pressure and challenge to the service of extensive information retrieval system precise and high efficiency.Inverted index is the core of information retrieval, and its storage organization and organizational form have a significant impact the lifting of information retrieval performance.In improving searching algorithm, people are also making great efforts to optimize inverted index structure and organizational form thereof.
The research of optimizing for inverted index both at home and abroad at present, mainly launches from following three aspects:: (1) reduces the volume of index on external memory by compress technique; (2) organizational form of inverted list content is optimized, reduces the inverted list content that needs access; (3) the disk storage structure of inverted list is managed, reduce IO number of disk as far as possible.But existing achievement comprises that compress technique, inverted index organizational form and storage organization are also immature, being difficult to adapt to large data age information retrieval system contains much information, responds fast essence and accurate demand, therefore the present invention proposes a kind of efficient inverted index structure and method for organizing that merges compress technique, to solve current inverted index optimization problem, realize effective management of mass data.
Summary of the invention
The technical problem to be solved in the present invention is to provide a kind of inverted index structure and method for organizing of optimizing storage space, simplifying the time of reading.
The technical matters that contains much information, responds fast essence quasi need aspect for solving current information retrieval system, the invention provides a kind of inverted index structure efficiently, and this structure comprises:
S101 inverted index is made up of the row of falling, and the row's of falling item comprises that record falls row and attribute and falls row two types, they separately storage to reduce information redundancy, the while logically inverted index be also just divided into and record inverted index and attribute inverted index;
S102 records inverted index and forms by recording down row, and " record is row " forms by " recording mechanism " is independent, comprises " recording mechanism " and " linker ";
S103 " recording mechanism " is the record at the place while occurring in database of the word in a field value or full-text data;
The particular content of S104 " linker " depends on different organizational forms, can be that address pointer, side-play amount or attribute fall row's number etc., and its function is to locate fast and to read all properties item of a word in this record;
S105 attribute inverted index falls to arrange item by attribute and forms, and " attribute is row " is made up of " position attribution " and " attribute of a configuration ";
S106 " position attribution " is one of position of occurring in current record of the word in full-text data, and position attribution divides three levels " paragraph, sentence, position ";
S107 " attribute of a configuration " is that other format information that position has (as Native XML index) is appearring in the word in full-text data;
The present invention also provides a kind of inverted index method for organizing efficiently, and the method comprises:
S201 inverted index adopts the mode of piecemeal to organize storage hereof, arranges piece and comprehensively adopts chained list and two kinds of modes of concentrated navigation watch to manage, and makes inverted index not only be convenient to Dynamic Maintenance but also be conducive to the random access under SKIP technology; For improving data loading efficiency, be conducive to data random access simultaneously, select to arrange the way to manage of piece as critical point using the optimization of database index: the inverted index after optimization adopts concentrates navigation watch to manage, and the new corresponding inverted index of data loading is still managed with chained list after optimizing, until the optimization of database index next time;
S202, in whole inverted index, regards concentrated navigation watch as a special chained list node, and adopting zone bit mechanism to distinguish is conventional chained list node, or concentrates navigation watch; Attribute fall row's data block be placed on record fall row's data block after, combination is stored in the same row's of falling data block of identical file;
The S203 table block of falling row chain is made up of " linker " and " row's of falling data block ", the basic role of " linker " is the first address of next table block of falling row chain of indication or concentrated navigation watch, and what wherein indicate next address sensing containing 1 zone bit is the table block of falling row chain or concentrated navigation watch;
S204 concentrates navigation watch to be made up of " gauge outfit " and " list item ", and because the row's of falling section is piecemeal storage, the major function of " gauge outfit " is the address that provides the concentrated navigation watch of next row's of falling section; Last row's of falling section is public, for depositing the searching algorithm of precise results collection and non-precise results collection, therefore, the gauge outfit of the each row's of falling section all needs the address of the concentrated navigation watch of depositing last row's of falling section, so that the searching algorithm of precise results collection can navigate to this section rapidly;
What the concentrated navigation watch of S205 was managed arranges piece all through optimizing, and a list item is arranged piece with respect to one, and institute takes up space very little, directly uses each territory of natural data types to express list item; The same with the table block of falling row chain " linker ", " address " is indispensable territory for each list item, " dominant record number " and " smallest record number " territory can not be omitted simultaneously, can avoid like this obtaining " dominant record number " and " smallest record number " from the row's of falling data block, to reduce unnecessary operation; In addition, record in concentrated navigation watch falls to arrange item and carries out Fragmentation by recording mechanism, therefore, each " list item " also needs the length of a recording mechanism page number table, is convenient to quick location, searches recording mechanism, after page number table, it is the start address of recording mechanism offset table, 1 bit flag position in " page number table length " territory, distinguishes and arranges whether paging of piece, when not paging, low level is used for representing attribute side-play amount, otherwise represents recording mechanism side-play amount;
In the S206 table block of falling row chain, arrange that piece and concentrated navigation watch manage to arrange piece different on storage mode, the latter adopts the Fragmentation mode of optimizing of having passed through, the former still adopts the simplest storage mode, thus the record of the two correspondence fall row logical organization not identical yet;
In the S207 table block of falling row chain, record falls to arrange item and is made up of " recording mechanism " and " linker ".The attribute that all properties of a record falls between row and record falls row and all deposits continuously in attribute falls row's data block, and the effect of " linker " is that all properties of this record of indication falls row's reference position of falling in row's data block at attribute;
S208 concentrates in navigation watch, and record falls to arrange item and in storage, is divided into " recording mechanism page number table " list item and " recording mechanism offset table " list item.Each " recording mechanism page number table " storage recording mechanism page number of a page and the locating information of corresponding recording mechanism offset table." recording mechanism offset table " is made up of " recording mechanism skew " and " attribute side-play amount " two territories, in " the page number table length " territory of concentrating navigation watch " list item ", carries out tagged tissue;
S209 attribute falls to arrange a contained subitem many, some subitems are optional, subitem number is unfixing, have 8 kinds of concrete forms, be respectively: < position >, < sentence, position >, < paragraph, position >, < paragraph, sentence, position >, < position, form >, < sentence, position, form >, < paragraph, position, form >, < paragraph, sentence, position, form >, " position attribution " territory adopts 2 byte representations, attribute falls to arrange item can comprise the attribute of a configuration, the attribute of a configuration is to using Narive XML index, it is the node number of XML data, with four byte representations, in order to support to retrieve weighting, by one of them bytes store weight (supporting at most 256 kinds of weights), three remaining bytes are used for storing original node number.
Efficient inverted index structure and method for organizing that technical solution of the present invention provides, be divided into record and fall row and attribute and fall row's item and store falling row item in inverted index, to reduce information redundancy; Inverted index is organized storage in the mode of piecemeal, the advantage of comprehensive chained list and concentrated navigation watch, manage arranging piece, make inverted index not only be convenient to Dynamic Maintenance but also be conducive to the random access under SKIP technology, in the time of data storage, adopt certain compress technique, to realize the space storage information how as far as possible of trying one's best few simultaneously; Reduce data space, improved data directory efficiency.
Accompanying drawing explanation
The efficient inverted index structure schematic diagram of one that Fig. 1 provides for the embodiment of the present invention.
A kind of high-efficient inverted row index organization frame diagram that Fig. 2 provides for the embodiment of the present invention.
The organisational chart of arranging piece in the concentrated navigation watch that Fig. 3 provides for the embodiment of the present invention.
Accompanying drawing explanation
For solving magnanimity information epoch data directory, optimization problem, efficient inverted index structure and method for organizing that the embodiment of the present invention provides, from storage space with read times two aspect inverted index is optimized, a row of falling is divided into row's item and row's item of attribute of record, reduce information redundancy, inverted index is organized storage with partitioned mode, the comprehensive advantage that adopts chained list and concentrated navigation watch manages, not only be convenient to Dynamic Maintenance but also be conducive to random access, can solve inverted index optimization problem.
For making object, technical method and the advantage of the embodiment of the present invention clearer, the technical scheme embodiment of the present invention being provided below in conjunction with accompanying drawing is elaborated.
Be illustrated in figure 1 the efficient inverted index structure schematic diagram in the embodiment of the present invention, searching system falls to arrange item by vocabulary position the record, in " record falls to arrange item ", comprise " recording mechanism " and " linker ", fall to arrange item by " linker " location attribute, provide this word all properties information in record, simultaneously attribute falls all properties information of row's item between also having recorded, " attribute falls to arrange item " comprises " position attribution " and " attribute of a configuration ", wherein " attribute of a configuration " is optional content, " position attribution " comprises again " paragraph ", " sentence ", " position ", wherein " paragraph ", " sentence " is optional content, realize thus separating between record and attribute, make each record only need a record to fall row and can complete the index to it, reduce information redundancy, when having reduced data space, improve data directory efficiency.
Inverted index organization need is hereof considered the factor of two aspects: the random access under Dynamic Maintenance and SKIP technology.Inverted index need to be carried out to piecemeal storage, a kind of high-efficient inverted providing is provided arrange index organization's frame diagram in the embodiment of the present invention.By attribute fall row's data block be placed on record fall row's data block after, combination is stored in the same row's of falling data block of identical file, forms and arranges piece.
Be divided into chained list and two kinds of modes of concentrated navigation watch to arranging the management of piece.According to the strengths and weaknesses analysis to two kinds of modes, be optimized for point of penetration with database index, the inverted index after optimization adopts concentrates navigation watch management, and after optimizing, the new data that load still adopt chained list management.Consider to arrange block size to IO performance impact problem simultaneously, the piece of arranging after optimizing is carried out to paging by recording mechanism, be illustrated in figure 3 the organisational chart of arranging piece in the concentrated navigation watch providing in the embodiment of the present invention.The max cap. of setting one page is 256, if recording mechanism is 32, least-significant byte is recording mechanism skew, and high 24 is the recording mechanism page number.
Fall to arrange item according to vocabulary position the record, locking falls to arrange a data block, according to the organizational form of " linker " information and recording mechanism descending sort in the row's of falling data block, search respective attributes information and next record information, therefore chained list " linker " and optimize before record fall row logical organization can be designed to:
The logical organization of the table block of falling row chain " linker ":
The logical organization that record before optimization falls to arrange item:
| domain name | byte number |
| recording mechanism | 4 bytes. |
| attribute space size | 2 bytes. |
Owing to concentrating navigation watch to adopt the mode of paging to store, if next record information is managed in " concentrating navigation watch " mode, need to obtain minimum and maximum recording mechanism and the page number table length of current page, therefore concentrate the list item of navigation watch and the logical organization of gauge outfit can be designed as:
Concentrate the logical organization of navigation watch " list item ":
Concentrate the logical organization of navigation watch " gauge outfit ":
The logical organization that record after optimization falls to arrange item can be designed as:
| domain name | byte number |
| recording mechanism skew | 1 byte. |
| attribute side-play amount | 3 bytes. |
The logical organization of recording mechanism page number table list item:
| domain name | byte number |
| the recording mechanism page number | 3 bytes. |
| in page, record number | 1 byte. |
Attribute falls to arrange item and is divided into 8 kinds of concrete array configurations, and the logical organization of each array configuration can specific design be:
" position " logical organization that attribute falls to arrange item:
| domain name | byte number |
| position | 2 bytes. |
" sentence-position " logical organization that attribute falls to arrange item:
| domain name | byte number |
| sentence | 2 bytes. |
| position | 2 bytes. |
" paragraph-position " logical organization that attribute falls to arrange item:
| domain name | byte number |
| paragraph | 2 bytes. |
| position | 2 bytes. |
" paragraph-sentence-position " logical organization that attribute falls to arrange item:
| domain name | byte number |
| paragraph | 2 bytes. |
| sentence | 2 bytes. |
| position | 2 bytes. |
" position-form " logical organization that attribute falls to arrange item:
| domain name | byte number |
| position | 2 bytes. |
| form | 4 bytes. |
" sentence-position-form " logical organization that attribute falls to arrange item:
| domain name | byte number |
| sentence | 2 bytes. |
| position | 2 bytes. |
| form | 4 bytes. |
" paragraph-position-form " logical organization that attribute falls to arrange item:
| domain name | byte number |
| paragraph | 2 bytes. |
| position | 2 bytes. |
| form | 4 bytes. |
" paragraph-sentence-position-form " logical organization that attribute falls to arrange item:
| domain name | byte number |
| paragraph | 2 bytes. |
| sentence | 2 bytes. |
| position | 2 bytes. |
| form | 4 bytes. |
Claims (13)
1. an efficient inverted index structure, is characterized in that, this inverted index is made up of the row of falling, and the row's of falling item is split into record and falls row and attribute and fall row's item, and inverted index is divided into and records inverted index and attribute inverted index thus.
2. efficient inverted index structure according to claim 1, is characterized in that, records inverted index and forms by recording down row, and " record is row " forms by " recording mechanism " is independent, comprises " recording mechanism " and " linker "; " recording mechanism " is the record at the place while occurring in database of the word in a field value or full-text database; The particular content of " linker " depends on different organizational forms, and its function is to locate fast and to read all properties item of a word in this record.
3. efficient inverted index structure according to claim 1, is characterized in that, attribute inverted index falls to arrange item by attribute and forms, and " attribute is row " is made up of " position attribution " and " attribute of a configuration "; " position attribution " is one of position of occurring in current record of the word in full-text data, and position attribution is divided into three levels " paragraph, sentence, position "; " attribute of a configuration " is that word in full-text data is at other format information that occurs that position has.
4. a high-efficient inverted row index organization method, is characterized in that, inverted index adopts partitioned mode to organize storage, arranges piece and comprehensively adopts chained list and concentrated navigation watch to manage.
5. high-efficient inverted according to claim 4 row index organization method, is characterized in that, with the way to manage that is optimized for cut-off point selection and arranges piece of database index, concentrated navigation watch is regarded as a special chained list node, adopts zone bit mechanism to distinguish.
6. high-efficient inverted according to claim 4 row index organization method, is characterized in that, attribute fall row's data block be placed on record fall row's data block after, combination is stored in the same row's of falling data block of identical file, is called for short and arranges piece.
7. according to claim 4 and high-efficient inverted claimed in claim 5 row index organization method, it is characterized in that, the table block of falling row chain is made up of " linker " and " row's of falling data block ", the basic role of " linker " is the first address of indicating next to arrange piece or concentrated navigation watch, and what wherein indicate next address sensing containing 1 zone bit is the table of falling row chain or concentrated navigation watch.
8. according to claim 4 and high-efficient inverted claimed in claim 5 row index organization method, it is characterized in that, concentrate navigation watch to be formed by " gauge outfit " and " list item ", the row's of falling section piecemeal storage, list item carries out paging by recording mechanism.
9. according to claim 4 and high-efficient inverted claimed in claim 8 row index organization method, it is characterized in that, concentrate a list item in navigation watch to arrange piece with respect to one, each piece of arranging need contain " arranging block address ", " dominant record number ", " smallest record number " and " page number table length ".
10. high-efficient inverted according to claim 9 is arranged index organization's method, it is characterized in that, page number table length is used for the length of the page number table of storing a recording mechanism, after page number table, it is the start address of recording mechanism offset table, 1 bit flag position in " page number table length " territory, distinguishes and arranges whether paging of piece, when not paging, low level is used for representing attribute side-play amount, otherwise represents recording mechanism side-play amount.
11. according to claim 4, claim 6 and high-efficient inverted claimed in claim 7 row index organization method, it is characterized in that, the row's of falling data block is divided into that association database arranged in record and attribute is arranged association database piece, attribute falls to arrange a contained subitem and comprises: paragraph, sentence, position, form, different array modes can form form concrete in 8, be followed successively by: < position >, < sentence, position >, < paragraph, position >, < paragraph, sentence, position >, < position, form >, < sentence, position, form >, < paragraph, position, form >, < paragraph, sentence, position, form >.
12. high-efficient inverteds according to claim 11 are arranged index organization's method, it is characterized in that, in the table of falling row chain, record falls to arrange item and is made up of " recording mechanism " and " linker ", the attribute that all properties of a record falls between row and record falls row and all deposits continuously in attribute falls row's data block, and the effect of " linker " is that all properties of this record of indication falls row's reference position of falling in row's data block at attribute.
13. high-efficient inverteds according to claim 11 are arranged index organization's method, it is characterized in that, in concentrated navigation watch, record falls to arrange item and in storage, is divided into " recording mechanism page number table " list item and " recording mechanism offset table " list item, each " recording mechanism page number table " storage recording mechanism page number of a page and the locating information of corresponding recording mechanism offset table, " recording mechanism offset table " is made up of " recording mechanism skew " and " attribute side-play amount " two territories, in " the page number table length " territory of concentrating navigation watch " list item ", carries out tagged tissue.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210511478.1A CN103853772B (en) | 2012-12-04 | 2012-12-04 | High-efficiency reverse index organizing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210511478.1A CN103853772B (en) | 2012-12-04 | 2012-12-04 | High-efficiency reverse index organizing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103853772A true CN103853772A (en) | 2014-06-11 |
| CN103853772B CN103853772B (en) | 2017-02-08 |
Family
ID=50861438
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210511478.1A Active CN103853772B (en) | 2012-12-04 | 2012-12-04 | High-efficiency reverse index organizing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103853772B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106575294A (en) * | 2014-07-31 | 2017-04-19 | 华为技术有限公司 | Trajectory data inquiry method and apparatus |
| CN106909623A (en) * | 2017-01-19 | 2017-06-30 | 中国科学院信息工程研究所 | A kind of data set and date storage method of supporting efficient mass data to analyze and retrieve |
| CN108509625A (en) * | 2018-04-08 | 2018-09-07 | 中国人民解放军63601部队 | A kind of data inactivity table location positioning method |
| CN110162662A (en) * | 2019-04-18 | 2019-08-23 | 阿里巴巴集团控股有限公司 | Verification method, device and the equipment of data record in a kind of piece of chain type account book |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6578026B1 (en) * | 1999-07-29 | 2003-06-10 | International Business Machines Corporation | Method and system for conducting reverse index scans |
| US20090300013A1 (en) * | 2008-06-02 | 2009-12-03 | Microsoft Corporation | Optimized Reverse Key Indexes |
| CN102063446A (en) * | 2009-11-13 | 2011-05-18 | 中国移动通信集团四川有限公司 | Method for creating inverted index and inverted indexing device |
| CN102201001A (en) * | 2011-04-29 | 2011-09-28 | 西安交通大学 | Fast retrieval method based on inverted technology |
| CN102722553A (en) * | 2012-05-24 | 2012-10-10 | 浙江大学 | Distributed type reverse index organization method based on user log analysis |
-
2012
- 2012-12-04 CN CN201210511478.1A patent/CN103853772B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6578026B1 (en) * | 1999-07-29 | 2003-06-10 | International Business Machines Corporation | Method and system for conducting reverse index scans |
| US20090300013A1 (en) * | 2008-06-02 | 2009-12-03 | Microsoft Corporation | Optimized Reverse Key Indexes |
| CN102063446A (en) * | 2009-11-13 | 2011-05-18 | 中国移动通信集团四川有限公司 | Method for creating inverted index and inverted indexing device |
| CN102201001A (en) * | 2011-04-29 | 2011-09-28 | 西安交通大学 | Fast retrieval method based on inverted technology |
| CN102722553A (en) * | 2012-05-24 | 2012-10-10 | 浙江大学 | Distributed type reverse index organization method based on user log analysis |
Non-Patent Citations (2)
| Title |
|---|
| 郭琦娟: ""基于全文数据库的全文检索模型研究"", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 阚忠良: ""数字图书馆中基于结构和内容的文本信息检索技术的研究"", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106575294A (en) * | 2014-07-31 | 2017-04-19 | 华为技术有限公司 | Trajectory data inquiry method and apparatus |
| CN106909623A (en) * | 2017-01-19 | 2017-06-30 | 中国科学院信息工程研究所 | A kind of data set and date storage method of supporting efficient mass data to analyze and retrieve |
| CN106909623B (en) * | 2017-01-19 | 2019-11-26 | 中国科学院信息工程研究所 | A kind of data set and date storage method for supporting efficient mass data to analyze and retrieve |
| CN108509625A (en) * | 2018-04-08 | 2018-09-07 | 中国人民解放军63601部队 | A kind of data inactivity table location positioning method |
| CN110162662A (en) * | 2019-04-18 | 2019-08-23 | 阿里巴巴集团控股有限公司 | Verification method, device and the equipment of data record in a kind of piece of chain type account book |
| CN110162662B (en) * | 2019-04-18 | 2023-02-28 | 创新先进技术有限公司 | Verification method, device and equipment for data records in block chain type account book |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103853772B (en) | 2017-02-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101782922B (en) | Multi-level bucket hashing index method for searching mass data | |
| US9576006B2 (en) | Method and system for storing data in a database | |
| CN103020204B (en) | A kind of method and its system carrying out multi-dimensional interval query to distributed sequence list | |
| CN102024047A (en) | Data searching method and device thereof | |
| CN102629269B (en) | Searching and storing method for embedded database | |
| CN102156711B (en) | Cloud storage based power full text retrieval method and system | |
| RU2008101529A (en) | INTELLIGENT CONTAINER INDEXING AND SEARCH IN IT | |
| CN107045531A (en) | A kind of system and method for optimization HDFS small documents access | |
| CN106055621A (en) | Log retrieval method and device | |
| CN106844555A (en) | A kind of time series data storage method for power network WAMS systems | |
| JP2012526320A5 (en) | ||
| CN103853772A (en) | High-efficiency reverse index structure and organizing method | |
| CN102446184B (en) | Industrial data storage and index method based on time series | |
| CN104331446A (en) | Memory map-based mass data preprocessing method | |
| CN104462141A (en) | Data storage and query method and system and storage engine device | |
| CN101464901A (en) | Object search method in object storage device | |
| CN101551807A (en) | Multilevel index technology for file database | |
| CN107451233A (en) | Storage method of the preferential space-time trajectory data file of time attribute in auxiliary storage device | |
| CN103383690A (en) | Distributed data storage method and system | |
| CN101751475B (en) | Method for compressing section records and device therefor | |
| CN103198150A (en) | Big data indexing method and system | |
| CN102890721A (en) | Database establishment method and database establishment system based on column storage technology | |
| CN103198157B (en) | A kind of compression storage processing method of telluric electricity field data | |
| CN102999637A (en) | Method and system for automatically adding file tab to file according to file feature code | |
| CN102609531A (en) | Method for pegging files according to keywords |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 100088 Beijing city Haidian District No. 6 Zhichun Road Jinqiu International Building 14 floor 14B04 Patentee after: TOLS INFORMATION TECHNOLOGY Co.,Ltd. Address before: 100088 Beijing city Haidian District No. 6 Zhichun Road Jinqiu International Building 14 floor 14B04 Patentee before: BEIJING TRS INFORMATION TECHNOLOGY Co.,Ltd. |
|
| CP01 | Change in the name or title of a patent holder |