CN108763413A - Data memory format and its data search localization method - Google Patents
Data memory format and its data search localization method Download PDFInfo
- Publication number
- CN108763413A CN108763413A CN201810500445.4A CN201810500445A CN108763413A CN 108763413 A CN108763413 A CN 108763413A CN 201810500445 A CN201810500445 A CN 201810500445A CN 108763413 A CN108763413 A CN 108763413A
- Authority
- CN
- China
- Prior art keywords
- data
- area
- tables
- data point
- file
- 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
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention provides a kind of data memory format, including handling function library, console instruction collection, tree construction describe area and tables of data area；Tree construction describes area and is located at before tables of data area, and tree construction describes area and tables of data area and is all made of numerous data points, and tree construction describes the first data point statement file rank in area, and the second data point states folder name；Tables of data area is to be constituted data point with sheet form storage；Data point includes jump help area and valid data area, and valid data area is indicated by English, Chinese, binary-coded character or its combination；It is the width description to valid data area that jump, which helps area, the present invention also provides the data search localization methods of the data memory format, corresponding data is extracted by the byte number for helping the value in area to redirect respective width according to the jump of reading, the present invention directly positions reading and parsing conducive to computer, it avoids search type from reading, reduces difficulty, improves speed.
Description
Technical field
The invention belongs to data storage technologies, and in particular to a kind of data memory format and data search localization method.
Background technology
Data memory format system and Internet industrial control system important composition, existing mainstream identifiable language are xml languages
Speech, existing code speech size of code are big so that search speed is slow when program is run, and consumption cpu is calculated and hard-disc storage and network
Resource is more.Requirement with people to automation control is gradually increased, size of code must bigger, programming be difficult to safeguard, for property
The relatively low microcontroller of energy is difficult the so many information of load, is considerable hurdle for production, existing xml code search speed is slow.
It is high to the Hardware Arrangement of microcontroller since program code amount ambassador's calling program of html and xml is difficult to safeguard, still
The equipment funds input for replacing high configuration is very big, and existing mainstream programming language pursues efficient, more work(for existing equipment
The control of energy causes considerable hurdle.It is almost impossible in the equipment of existing relatively low configuration requirement of real-time, xml algorithms are multiple
Application that is miscellaneous, being related to write-in escape substitution problem and read all kinds of digital device drivers such as escape recovery.Make Communication Layer by oneself
Agreement, be mutually connected with obstacle, driver equipment end computer end without specification, microcontroller access PC equipment it is difficult.
Invention content
Present invention seek to address that the above problem, provides a kind of new data storage lattice, document code amount is few, is conducive to file and reads
Take, directly positioned conducive to microcontroller reading, parsing obtain each data point, avoid search type from reading.
The present invention solves described problem, the technical solution adopted is that：
A kind of data memory format, including handling function library, console instruction collection further include that tree construction describes area and tables of data
Area；The tree construction describes area and is located at before tables of data area, and the structure that tree construction describes area is：
Start the data point of the data point of symbol/first/second, wherein
It is that tree construction describes area and describes the identifier that file starts to start symbol, is double back slashes of ansi gbk codings
\\；First data point states file rank；Second data point states folder name；Tables of data area is located at tree construction description
Behind the second data point of area, tables of data area is to be constituted data point with sheet form storage, first data point in tables of data area
State the columns of the lower data point of this document folder；Data point includes jump help area and valid data area, valid data area are by English
Language, Chinese, binary-coded character or its combination indicate；It is the width to the data in valid data area followed by that jump, which helps area,
The description of degree, it is with decimal integer string representation that jump, which helps area, and string encoding abides by GBK coding rules, conventional word
Symbol string is indicated by 00-99；Overlength character string indicates that wherein * * * * are arbitrary two or more decimal numbers with [[* * * *]].
Further, the file that file rank is 0 is root files, and root files are what the beginning part was hidden
Simplified-file presss from both sides.
The data search localization method of data memory format of the present invention is：
When spot file, the starting point of this document folder across, then across the first data point, across the second data point, second
It is exactly that tables of data starts after data point.
If this document accompanies lower folder, it is previous that the end position of tables of data is that lower folder starts character position
Store the position of byte.
If this document folder, without lower folder, the end of tables of data is the beginning that this document presss from both sides subsequent file at the same level
The position of the previous storage byte of symbol.
If this document is pressed from both sides without lower folder, while behind without file at the same level, while behind without upper file
Folder, the end of tables of data be this document tail the last one be stored with the byte of character.
The process of inquiry tables of data is the every a line of ergodic data table, and the first data point of data line is identical as searched data,
Then judge that search terminates, which is extracted.
In ergodic data point, the reading process of data point is：
A. data are read and describe area, identify double back slashes be denoted as file and start；
B. read double back slashes behind state other first data point of folder level, read its jump first and help area, root
It helps the value in area to redirect corresponding width downwards according to the jump, and the character in the width range is read, identify file
Place rank；
C. the second data point for reading statement folder name reads its jump and helps area, area is helped according to the jump first
Value redirects downwards corresponding width, and the character within the scope of this is read, and recognizes the need for the folder name searched；
D. tables of data area is read, first data point of data statement tables of data columns is read first, first reads the data point
Jump helps area, helps the value in area to redirect corresponding width downwards according to the jump, reads the value in the width range, be denoted as number
According to table columns；
E. first data point is read to all data points between next double Fan Xiegang labels, by above-mentioned reading access point
Method read all effective contents of file, the number of data points divided by columns read are the line numbers of this tables of data.
The present invention's is effective：The width record jump for providing each title or numerical value helps jumphelper, in favor of
Microcontroller directly positions reading, parsing, and search type is avoided to read, and reduces difficulty, improves speed.Effectively save electric energy reduces cpu
Power consumption is parsed, is more environmentally friendly data protocol.It can help microcontroller to access internet and PC equipment xrb-based-WDM-
Driver. providing the microcontroller access large database of no operating system and internet may.
Specific implementation mode
The present invention is a kind of data point configuration file system including jump information, includes the design and level knot of data point
The design of structure file and the design of tables of data.
The present invention provides a kind of data memory format, including handling function library（function lib）, console instruction collection
（query language）, tree construction describes area（folder description）, tables of data area（data table）.It is this new
The data memory format of type can be described as " xing rong byte ", hereinafter simply referred to as XRB.
Tree construction describes area（folder description）Position is before tables of data area, it is for describing tables of data
Area.Have file in tree construction description and starts symbol and two data points.
The structure that tree construction describes area is：Start the data point of the data point of symbol/first/second, wherein it is text to start symbol
Part presss from both sides beginning label, be ansi gbk coding double back slashes；First data point states file rank；Second data point
State folder name.
Tables of data area is located at tree construction and describes behind the second data point of area, it is to be constituted data point with sheet form storage
, first data point in tables of data area states the columns of the lower data point of this document folder.
It constitutes tree construction and describes area（folder description）And tables of data（data table）Fundamental be
Data point (xrb datapoint).
The structure of data point is：Front is that the visual readable jump of people helps area, and being followed by the unlimited code of the arbitrary code of all-key has
Imitate data field.What each jump helped area and valid data area is combined as a data point.
It is the description to the width of the data in valid data area followed by that jump, which helps area,.Jump helps Qu Yongshi
System integer string representation, string encoding abide by GBK coding rules, and ordinary symbol string is indicated by 00-99, overlength character string
It is indicated with [[* * * *]], wherein " * * * * " is arbitrary two or more decimal numbers.Jump helps the data in area to be usually defaulted as
Arbitrary two numbers table number in 00-99 is supplied before units with 0, two when the byte data that significant character area occupies is units
It is enough that position decimal number copes with usual data.Jump helps the number in area to be more than or equal to 100 (i.e. three or more the decimal systems）When,
Record is realized with [[* * * *]].It is ascii gbk encoding schemes that byte, which turns character string,.Character string meaning is decimal integer, it
To be in this way：
00,01,02,......,98,99,[[0100]],[[0101]],......,[[0999]],[[1000]],......,
[[9999]],[[010000]],......[[065536]]......[[16777216]]......
The appearance of [[4294967296]] ... [[18446744073709551616]] ....Jump helps area two minimum,
It is at most theoretically unlimited.Such as numerical value short of width two, then one 0 is mended in front.
Under GBK specifications, a Chinese character is at least mono- English letter of and Arabic numerals for occupying the storage of 2 bytes
Occupy 1 byte.So 04 China 05china meets xrb data point syntax gauges.
(explanation:65536 correspond to 64K, 256*256, the short int short variable overflow value theoretical maximums of c language
Value;;4294967296 correspond to 4G, and 256*256*256*256 becomes the int overflow value theoretical maximums of c language;;;
18446744073709551616 correspond to 16M T, the long int long variable overflow value theoretical maximums of c language
Value;... ...) (18446744073709551616 quantity is about 184,400,000,000 hundred million, and an xrb data point can
To accommodate the data of so big byte number, than it also greatly can also this be about 1,006,000,000 1T disks appearance
It measures)
The valid data area can be that English, Chinese, binary system byte data or its combination indicate.
The structure that tree construction describes area is：" the data point of beginning label/first（Jump helps area+valid data area）/ the second
Data point（Jump helps area+valid data area）", wherein the content in the first data point valid data area is file rank,
Its content can be 1,2,3 or extremely infinity；The content in the second data point valid data area is folder name, it is definition
Title, it can be number, the character string of letter, character or combinations thereof.
First data point in tables of data area states the columns of the tables of data, the content in the valid data area of the first data point
It is generally digital.Other data points are the content informations of the tables of data, and the content in their valid data area can be character, text
Shelves, picture, can also be certain function, instruction etc..
The width of data point is the occupied byte number of the data, and each letter accounts for a byte, and each Chinese character accounts for two
Byte.
Data point can be sky.When data point is empty, jump helps area and tables of data area to show as：It, which jumps, helps area
It is 00, and jumps and help behind area without valid data area.Be exactly only jump assistant " 00 ", behind do not belong to the data
Point effective significant byte, but next data point jump help area beginning or.
It is this document folder F between the FSI of the file F of certain L rank and the FSI of next neighbours' file of peer
Confining spectrum.It is tables of data (L+1 ranks) first within the scope of this, it is lower folder (L+1 ranks) to be then followed by.Tables of data
It is the deterministic needs programmed for xrb function libraries that rank, which is so defined,.
And so on, each subordinate's (L+1 grades) file can continue to possess more subordinate (L+2 grades) tables of data of oneself and
More subordinate (L+2) file of oneself.
In the confining spectrum of the file F of certain L rank directly under L+1 grades tables of data end position acquisition side
Method is：If this document press from both sides F do not include lower folder, F directly under table end position be F peer's (L grades) it is next
Before the FSI of a neighbours' file：If this document folder F includes lower folder, F directly under the end position of table be F
Before the FSI of first subordinate's (L+1 grades) file, this judgment method has verified that.
In the confining spectrum of the file F of certain L rank directly under L+1 grades tables of data starting position.
Acquisition methods are：The FSI that this document presss from both sides F crosses over two data point DP later, is exactly tables of data.
The data search localization method of data memory format of the present invention is：
When spot file, the starting point of this document folder across, then across the first data point, across the second data point, second
It is exactly that tables of data starts after data point.
If this document accompanies lower folder, it is previous that the end position of tables of data is that lower folder starts character position
Store the position of byte.
If this document folder, without lower folder, the end of tables of data is the beginning that this document presss from both sides subsequent file at the same level
The position of the previous storage byte of symbol.
If this document is pressed from both sides without lower folder, while behind without file at the same level, the end of tables of data is this document tail
The last one is stored with the byte of character.
The process of line inspection tables of data is the every a line of ergodic data table, and the first data point of data line is identical as searched data,
Then judge that search terminates, which is extracted.Deposit array seekednamevalue [1] respectively,
Seekednamevalue [2] ... seekednamevalue [N], N are the columns of table.
In ergodic data point, data point reading process is：
A. data are read and describe area, identify double back slashes be denoted as file and start；
B. read double back slashes behind state other first data point of folder level, read its jump first and help area, root
It helps the value in area to redirect corresponding width downwards according to the jump, and the character in the width range is read, identify file
Place rank；
C. the second data point for reading statement folder name reads its jump and helps area, area is helped according to the jump first
Value redirects downwards corresponding width, and the character within the scope of this is read, and recognizes the need for the folder name searched；
D. continue to read subsequent tables of data area, read first data point of data statement tables of data columns first, first read
The jump of the data point helps area, helps the value in area to redirect corresponding width downwards according to the jump, reads in the width range
Value, be denoted as tables of data columns；
E. first data point is read to the data point between next double Fan Xiegang labels, and the data read are counted
Amount divided by columns are the line numbers of this tables of data；
All effective contents of file are read by the method for above-mentioned reading access point.
Citing one, file descriptive statement：
\\01207windows
Wherein indicate file beginning label.First data point " 012 ", 2 be effective content character area, and the 2nd grade of file should
The width of effective content character area of data point is 1 byte, and 01 helps area for jump.Therefore, the value of this jump assistant is 01.
Second data point " 07windows " indicates that catalogue file presss from both sides entitled windows, this has the effective of the significant character area of data point
Data width is 7, therefore its jump assistant is 07.
The first file that you see must the 1st grade of ..root be the 0th grade, be hide it is invisible.What you saw is all
In root files.It is considered that 01004root be hidden.
Citing two, the table described using xrb：
01204name06button05color03red
The description language is meant that：012 explanation of data point：The width of table is 2 (tables often 2 data points of row)；
The first row 04name06button. of table means name:button；
Second row 05color03red of table means color:red.
Citing three, tables of data description：
The comparison of design of tables of data is illustrated:3 row *, 4 columns groups, entitled myarray
1 2 3 4
5 6 7 8
9 10 11 12
Above-mentioned array is described as follows with Xml:
<root col=2>
<myarray col=2>
<pb col=04>
<d>1</d><d>2</d><d>3</d><d>4</d>
<d>5</d><d>6</d><d>7</d><d>8</d>
<d>9</d><d>10</d><d>11</d><d>12</d>
</pb>
</myarray>
</root>
Above-mentioned array is described as follows with xrb
012\\01107myarray012
\\0202pb
014
011012013014
015016017018
019021002110212
Xrb systems are to hide root titles, more efficient.File describes area followed by being tables of data area, and first counts
Strong point " 014 " is the column number information M of table.Later be N rows M row total N*M sequence of data points.
XML descriptions and xrb descriptions are compared, as a result:
Paidload bytes effective word joint numbers:
（A）Xrb is：1 myarray, 2 pb 123456789 10 11 12 224 amount to 29 bytes.
（B）Xml has used the statement of same tables of data 164 byte.Total bytes total bytes:70 words of xrb
Section, and xml has 164 bytes.
Effective Percent efficiencies:
Xml 29/164=18%,
Xrb 29/70=41%,
Gap:The xrb ratios of 41%-18%=23%. xml increases 23% efficiency.
Meaning:If improving 10% speed, save 10% electricity charge and reduce by 10% hard-disc storage, if super calculation center is daily (about
17.8MW power) ten thousand yuan of electricity charge of 30-60, hundred million yuan of electricity charge of annual 1-2,10% saves ten thousand yuan of 1000-2000 of meaning.
Xml obtains data point process:Xml needs<a>With</a>Starting and ending language as one section of code.Reading is sentenced three times
Break and is<a>, it is known that data point starts.If in one section of code data point beginning and end tab character have `10000 word it is necessary to
10000 characters read 10000 judgements.It reads these character workloads to add up to just very greatly, processor efficiency is caused to be
It is very low.Preliminary to obtain data point, escape restores, and continues 10000 characters and reads 10000 judgements, if there is escape character, if
Have, then recovery operation.
Xrb obtains data point process:A data point for possessing 10000 words is equally read, jump assistant is
The process of [[010000]], analysis jump assistant only needs to read 5 times, obtains " [[", " 01 ", " 00 ", " 00 ", "]] ", sentences
Break and indicates that jump assistant terminates for "]] ".The character string between " [[" and "]] " is cut, obtains 010000,6 characters of progress
Copy, character to decimal string turns computer integer.6 characters, each ASCII value subtract 48, are multiplied by the power of oneself, respectively
It is：100000,10000,1000,100,10,1, summation amounts to 6 subtractions, 6 multiplication, 6 sub-additions.
By the comparison of existing xml and xrb provided by the invention, 3 reading characters of xml judge character for 3 times, 10000
Secondary character reads 10000 judgements, and 10000 characters that escape restores are read, and escape restores 10000 judgements.And xrb 5 times
Read 56 sub-additions of multiplication of subtraction 6 times of the copy for judging 6 characters of character 6 times of character.Mutually same data point is retouched
It states, the processing speed of xrb is obviously faster than xml speed.
The web application embodiment of this xrb data memory formats:
012
\\01112myguideclare
013
10MYTEXTBOX102*107textbox
\\01112myguiinitial
013
10MYTEXTBOX101110helloworld
08MYLABEL101104home
\\01111myguilayout
017
10MYTEXTBOX101104504004196004197504149508bymyself
08MYLABEL1011045040042160039750349513newlinecenter
\\01112myguimission
015
08MYLABEL101115inside:web1.xrb02no02no
4 dimension matrix storage citings of this Xrb data memory formats:dim myarray(2,3,4,5) as string
012
\\01107myarray
013
05array072,3,4,528comment:to time add reverse
\\012041,1,
015
011011011011011
011011011011011
011011011011011
011011011011011
\\012041,2,
015
011011011011011
011011011011011
011011011011011
011011011011011
\\012041,3,
015
011011011011011
011011011011011
011011011011011
011011011011011
\\012042,1,
015
011011011011011
011011011011011
011011011011011
011011011011011
\\012042,2,
015
011011011011011
011011011011011
011011011011011
011011011011011
\\012042,3,
015
011011011011011
011011011011011
011011011011011
011011011011011
Data memory format provided by the invention includes the entitled * .xrb of holonomic system save file suffix of file and tables of data
, do not include the entitled * .bxr of simplification system save file suffix of file and several self-defining data points of tables of data.
Technical solution of the present invention, prominent feature are：
1. superiority：It avoids and occurs agreement dedicated specific function symbol inside valid data string and need escape problem.Servo region
Domain only with 0123456789 character [[]] specific function symbol and specific function accord with, read jumping step number (press character to decimal
String is converted to integer) or obtain file and start, dancing mode can ensure that can get significant figure not entering valid data area
According to data direct transfer, and escape zero relies on；
2. people is tool-free readable writeable, the xrb files of the read-write text formattings of notepad are used；
3. packaging efficiency：The servo data of xrb formats is seldom, and paidload/total effective bytes percentage is high, can
Than xml high 23%.
Through experiment：Xrb format packaging efficiencies: paidload /total ...
Extra small data point (1 byte of data point, 30 data points) 20%-32% packaging efficiencies.
Decimal strong point (- 20 data points of 3 byte of data point) 67%-73% packaging efficiencies.
96% packaging efficiency of middle data point (byte 1 of data point hundred data point).
Big data point (byte 1 of data point thousand data point) 99% packaging efficiency.
Mean：If improving 10% speed, 10% electricity charge are saved, reduce by 10% hard-disc storage.If super calculation center is daily (about
17.8MW power) ten thousand yuan of electricity charge of 30-60, hundred million yuan of electricity charge of annual 1-2,10% saves ten thousand yuan of 1000-2000 of meaning.
Claims (5)
1. a kind of data memory format, including handling function library, console instruction collection, it is characterized in that：It further include tree construction description
Area and tables of data area；
The tree construction describes area and is located at before tables of data area, and the structure that tree construction describes area is：
Start the data point of the data point of symbol/first/second,
It is that tree construction describes area and describes the label symbol that file starts wherein to start symbol, is double backslashs of ansi gbk codings
Thick stick；First data point states file rank；Second data point states folder name；
Tables of data area is located at tree construction and describes behind the second data point of area, and tables of data area is to be constituted data point with sheet form storage
, first data point in tables of data area states the columns of the lower data point of this document folder；
Data point includes jump help area and valid data area, and valid data area is by English, Chinese, binary-coded character or its knot
It closes and indicates；It is description to the width of the data in valid data area followed by that jump, which helps area, jump help area be with
Decimal integer string representation, string encoding abide by GBK coding rules, and ordinary symbol string is indicated by 00-99；Overlength character
String indicates that wherein * * * * are arbitrary two or more decimal numbers with [[* * * *]].
2. data memory format as described in claim 1, it is characterized in that：The file that file rank is 0 is root files,
Root files are the simplified-file folder that the beginning part is hidden.
3. the data search localization method of data memory format as described in the claims is：
When spot file, the starting point of this document folder across, then across the first data point, across the second data point, second
It is exactly that tables of data starts after data point；
If this document accompanies lower folder, the end position of tables of data is that lower folder starts the previous storage of character position
The position of byte；
If this document folder, without lower folder, the end of tables of data is the beginning symbol that this document presss from both sides subsequent file at the same level
The position of previous storage byte；
If this document is pressed from both sides without lower folder, while behind without file at the same level, while behind without upper level folder, number
End according to table be this document tail the last one be stored with the byte of character,
The process of inquiry tables of data is the every a line of ergodic data table, and the first data point of data line is identical as searched data, then sentences
Disconnected search terminates, which is extracted.
4. the method for the data search positioning as described in claim 3：In ergodic data point, the reading process of data point is,
A. data are read and describe area, identify double back slashes be denoted as file and start；
B. read double back slashes behind state other first data point of folder level, read its jump first and help area, root
It helps the value in area to redirect corresponding width downwards according to the jump, and the character in the width range is read, identify file
Place rank；
C. the second data point for reading statement folder name reads its jump and helps area, area is helped according to the jump first
Value redirects downwards corresponding width, and the character within the scope of this is read, and recognizes the need for the folder name searched；
D. continue to read subsequent tables of data area, read first data point of data statement tables of data columns first, first read
The jump of the data point helps area, helps the value in area to redirect corresponding width downwards according to the jump, reads in the width range
Value, be denoted as tables of data columns；
E. first data point is read to all data points between next double Fan Xiegang labels, by above-mentioned reading access point
Method read all effective contents of file, the number of data points divided by columns read are the line numbers of this tables of data.
5. the method for the data search positioning as described in claim 3 or 4, it is characterized in that：The root files that file is 0 grade
The tree construction of the declaratives of the beginning of folder describe area be hide do not read, the file of lookup is since 1 grade of file.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810500445.4A CN108763413B (en) | 2018-05-23 | 2018-05-23 | Data searching and positioning method based on data storage format |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810500445.4A CN108763413B (en) | 2018-05-23 | 2018-05-23 | Data searching and positioning method based on data storage format |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108763413A true CN108763413A (en) | 2018-11-06 |
| CN108763413B CN108763413B (en) | 2021-07-23 |
Family
ID=64004766
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810500445.4A Active CN108763413B (en) | 2018-05-23 | 2018-05-23 | Data searching and positioning method based on data storage format |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108763413B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111078650A (en) * | 2019-12-20 | 2020-04-28 | 成都康赛信息技术有限公司 | File storage method |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010084712A1 (en) * | 2009-01-23 | 2010-07-29 | 日本電気株式会社 | Data retrieval device |
| CN102289451A (en) * | 2011-06-17 | 2011-12-21 | 奇智软件（北京）有限公司 | Method and device for searching files or folders |
| CN104063438A (en) * | 2014-06-11 | 2014-09-24 | 惠州华阳通用电子有限公司 | Multimedia file searching method |
| CN104268280A (en) * | 2014-10-17 | 2015-01-07 | 中国人民解放军国防科学技术大学 | Layering storage and inquiring method based on key value database |
| CN104408041A (en) * | 2014-10-13 | 2015-03-11 | 深圳市德传技术有限公司 | A method for storing GPS data |
| CN106663056A (en) * | 2014-08-28 | 2017-05-10 | 华为技术有限公司 | Metadata index search in file system |
| CN107679212A (en) * | 2017-10-17 | 2018-02-09 | 安徽慧视金瞳科技有限公司 | A kind of data query optimization method for being applied to jump list data structure |
| CN107729451A (en) * | 2017-10-09 | 2018-02-23 | 四川巧夺天工信息安全智能设备有限公司 | A kind of method of data in lookup EDB database source files |
-
2018
- 2018-05-23 CN CN201810500445.4A patent/CN108763413B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010084712A1 (en) * | 2009-01-23 | 2010-07-29 | 日本電気株式会社 | Data retrieval device |
| CN102289451A (en) * | 2011-06-17 | 2011-12-21 | 奇智软件（北京）有限公司 | Method and device for searching files or folders |
| CN104063438A (en) * | 2014-06-11 | 2014-09-24 | 惠州华阳通用电子有限公司 | Multimedia file searching method |
| CN106663056A (en) * | 2014-08-28 | 2017-05-10 | 华为技术有限公司 | Metadata index search in file system |
| CN104408041A (en) * | 2014-10-13 | 2015-03-11 | 深圳市德传技术有限公司 | A method for storing GPS data |
| CN104268280A (en) * | 2014-10-17 | 2015-01-07 | 中国人民解放军国防科学技术大学 | Layering storage and inquiring method based on key value database |
| CN107729451A (en) * | 2017-10-09 | 2018-02-23 | 四川巧夺天工信息安全智能设备有限公司 | A kind of method of data in lookup EDB database source files |
| CN107679212A (en) * | 2017-10-17 | 2018-02-09 | 安徽慧视金瞳科技有限公司 | A kind of data query optimization method for being applied to jump list data structure |
Non-Patent Citations (2)
| Title |
|---|
| BLOCKHEADING: "Oracle分级查询（CONNECT BY PRIOR）", 《HTTPS://BLOG.CSDN.NET/U013169075/ARTICLE/DETAILS/56026438?UTM_MEDIUM=DISTRIBUTE.PC_RELEVANT.NONE-TASK-BLOG-BAIDUJS_TITLE-0&SPM=1001.2101.3001.4242》 * |
| 一本书的伤痕: "Linux文件查找方法", 《HTTPS://WWW.CNBLOGS.COM/SHANGBOLEI/P/4371242.HTML》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111078650A (en) * | 2019-12-20 | 2020-04-28 | 成都康赛信息技术有限公司 | File storage method |
| CN111078650B (en) * | 2019-12-20 | 2023-07-25 | 成都康赛信息技术有限公司 | File storage method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108763413B (en) | 2021-07-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9928289B2 (en) | Method for storing XML data into relational database | |
| US8572126B2 (en) | Systems and methods for optimizing very large n-gram collections for speed and memory | |
| US7844642B2 (en) | Method and structure for storing data of an XML-document in a relational database | |
| US7509574B2 (en) | Method and system for reducing delimiters | |
| CN101620608A (en) | Information collection method and system | |
| CN101393529B (en) | Method for implementing multi language support for computer software | |
| US20130086035A1 (en) | Method and apparatus for generating extended page snippet of search result | |
| CN102043852B (en) | Path information based extensible markup language (XML) ancestor-descendant indexing method | |
| CN104199812B (en) | Data system and method supporting multiple languages | |
| US20060212800A1 (en) | Method and system for sequentially accessing compiled schema | |
| Diab | Word sense disambiguation within a multilingual framework | |
| CN1424670A (en) | Webpage searching method in different languages | |
| JP3022539B1 (en) | Document search device | |
| CN108763413A (en) | Data memory format and its data search localization method | |
| CN108664546A (en) | Xml data structure conversion method and device | |
| CN110347390A (en) | A kind of method quickly generating WEB page, storage medium, equipment and system | |
| Blackwell et al. | The CITE architecture: a conceptual and practical overview | |
| CN102473175B (en) | Compression of XML data | |
| Thomas et al. | Abstract Data Types: Their Specification, Representation, and Use | |
| CN103116607B (en) | A kind of text retrieval system based on the Chinese phonetic alphabet newly | |
| US20060184874A1 (en) | System and method for displaying an acceptance status | |
| US20060212799A1 (en) | Method and system for compiling schema | |
| CN1116647C (en) | Chinese character search method using decoding | |
| Li et al. | Extraction and integration information in HTML tables | |
| JP2001357031A (en) | Method and system for converting unicode text into mixed code page |
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 |