CN117370342A - Binary system-based method and binary system-based system for label storage and query - Google Patents
Binary system-based method and binary system-based system for label storage and query Download PDFInfo
- Publication number
- CN117370342A CN117370342A CN202311278253.0A CN202311278253A CN117370342A CN 117370342 A CN117370342 A CN 117370342A CN 202311278253 A CN202311278253 A CN 202311278253A CN 117370342 A CN117370342 A CN 117370342A
- Authority
- CN
- China
- Prior art keywords
- tag
- binary
- taga
- data
- label
- 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.)
- Pending
Links
- 229910002056 binary alloy Inorganic materials 0.000 title claims abstract description 20
- 238000000034 method Methods 0.000 title claims abstract description 18
- 238000006243 chemical reaction Methods 0.000 claims description 6
- 238000013500 data storage Methods 0.000 abstract description 5
- 230000000694 effects Effects 0.000 description 4
- 235000019633 pungent taste Nutrition 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 235000015097 nutrients Nutrition 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/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/2237—Vectors, bitmaps or matrices
-
- 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/2282—Tablespace storage structures; Management thereof
-
- 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/24—Querying
- G06F16/245—Query processing
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
- G06F16/2474—Sequence data queries, e.g. querying versioned data
-
- 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/24—Querying
- G06F16/248—Presentation of query results
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Fuzzy Systems (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a method for storing and inquiring labels based on binary system, which comprises the following steps: 1. the known tags are arranged according to any sequence and then fixed, n binary digits are used for representing whether n tags are contained or not, each binary digit corresponds to one tag, 2, when tag data are required to be set, the corresponding binary digit is set to 1 according to the tags contained in the data, the rest binary digits are set to 0, then binary digits are converted into decimal digits to obtain a number x, tag fields of the data are set to be tag_a=x, and the data are inserted into a database; 3. when inquiring data containing the set tag, according to the tag sequence of the step 1, the binary value of the position of the tag is expressed by 1, and the rest is expressed by 0, namely the set tag is converted into a binary value taga; then, the data of the field 'tag_a' column and the binary value 'taga' in the data table, wherein the bitwise and operation result of the field 'tag_a' column and the binary value 'taga' is equal to the data of the binary value 'taga', and the data is the query result required by setting the tag; the capacity of data storage can be reduced.
Description
Technical Field
The invention relates to the technical field of data storage, in particular to a method and a system for storing labels based on binary system.
Background
With the popularization of the internet, the mobile terminal application has higher and higher acquisition cost, which also makes the company put higher demands on the operation of the user, and not only the mobile terminal application needs to be refined but also personalized.
One solution to this problem is to build a relatively complete label system. Such a label system needs to be tightly coupled with the business, acquire nutrients from the business-the user label, and also serve the business-providing more accurate and personalized services to the user.
Conventional tag systems are typically based on text or string forms and are therefore easily limited by an upper limit on the number of tags, which can result in difficulty in handling large sets of tags or the need to use complex data structures to store and process tags. When the number of data containing tags is very large, conventional tag systems often cannot be represented compactly, so that data storage capacity is increased drastically, and complexity of development and maintenance is increased.
Disclosure of Invention
In order to overcome the problems, the invention aims to provide a method for storing labels based on binary system, which can reduce the capacity of data storage and improve the performance of a system.
The invention is realized by adopting the following scheme: a method for binary-based tag storage and querying, the method comprising the steps of:
step 1, after the known labels are arranged according to any sequence, fixing, using n binary digits to represent whether n labels are contained, wherein each binary digit corresponds to one label, a binary value of 0 indicates that the position label is not contained, and a binary value of 1 indicates that the position label is contained;
step 2, when the tag data need to be set, setting the corresponding binary bit as 1 according to the tag contained in the data, setting the rest binary bits as 0, then converting the binary system into decimal system to obtain a number x, setting the tag field of the data as tag_a=x, and inserting the tag field into a database;
step 3, when inquiring data containing the set tag, according to the tag sequence of the step 1, the binary value of the position of the tag is represented by 1, and the rest is represented by 0, namely the set tag is converted into a binary value taga; then, the data of the field 'tag_a' column and the binary value 'taga' in the data table are queried, wherein the bitwise and operation result of the field 'tag_a' column and the binary value 'taga' is equal to the data of the binary value 'taga', and the data is the query result required by setting the tag.
Further, the method further comprises a step 4 of inserting new labels to the leftmost part of the existing label sequence when the (n+1) th new label needs to be added.
Further, in the step 3, the column of "tag_a" and the binary value "taga" in the data table are queried, and the result of the bitwise and operation of the column is equal to the binary value "taga", and the query statement is select from table window (tag_a & b '@ taga')=b '@ taga'; where @ is the query syntax in mysql, @ taga is a binary, i.e., a variable, representing the conversion of the set tag; b is a fixed format of query statement, representing binary; b '@ taga' is a binary number representing the tag pattern to be queried, each bit corresponding to the presence or absence of a tag; (tag_a & b '@ taga') represents the bitwise AND operation of the field "tag_a" column and the binary value "taga" in the table and results in a new binary number.
The invention also provides a system for storing and inquiring the labels based on the binary system, which comprises a label setting module, a label storage module and a label inquiring module;
the label setting module is used for arranging the known labels according to any sequence and fixing the known labels, n binary digits are used for indicating whether the known labels contain n labels, each binary digit corresponds to one label, a binary value of 0 indicates that the known labels do not contain the position label, and a binary value of 1 indicates that the known labels contain the position label;
when the tag data needs to be set, the tag storage module sets the corresponding binary bit as 1 according to the tag contained in the data, sets the rest binary bits as 0, then converts the binary system into decimal system to obtain a number x, sets the tag field of the data as tag_a=x, and inserts the tag field into a database;
the label inquiry module is used for expressing the binary value of the position of the label by 1 and the rest by 0 according to the label sequence of the label setting module when inquiring the data containing the set label, namely converting the set label into a binary value taga; then, the data of the field 'tag_a' column and the binary value 'taga' in the data table are queried, wherein the bitwise and operation result of the field 'tag_a' column and the binary value 'taga' is equal to the data of the binary value 'taga', and the data is the query result required by setting the tag.
Further, the system also comprises a label inserting module, wherein when the (n+1) th new label is needed to be added, the new label is inserted to the leftmost part of the existing label sequence.
Further, the tag query module queries the data with the bitwise sum operation result of the field 'tag_a' column and the binary value 'taga' in the data table equal to the binary value 'taga', and the query statement is select from table window (tag_a & b '@ taga')=b '@ taga'; where @ is the query syntax in mysql, @ taga is a binary, i.e., a variable, representing the conversion of the set tag; b is a fixed format of query statement, representing binary; b '@ taga' is a binary number representing the tag pattern to be queried, each bit corresponding to the presence or absence of a tag; (tag_a & b '@ taga') represents the bitwise AND operation of the field "tag_a" column and the binary value "taga" in the table and results in a new binary number.
The invention has the beneficial effects that: the invention provides a method for storing and inquiring labels based on binary system, which uses bit operation and bit operation, can efficiently represent and operate a large-scale label set, and provides a lightweight and efficient label representation mode by utilizing the state of binary bits and the quick performance of bit operation; thereby enabling a reduction in the capacity of data storage.
Drawings
FIG. 1 is a schematic flow chart of the method of the present invention.
Fig. 2 is a system schematic block diagram of the present invention.
Detailed Description
The invention is further described below with reference to the accompanying drawings.
Referring to fig. 1, the method for storing and querying labels based on binary system of the present invention includes the following steps:
step 1, after the known labels are arranged according to any sequence, fixing, using n binary digits to represent whether n labels are contained, wherein each binary digit corresponds to one label, a binary value of 0 indicates that the position label is not contained, and a binary value of 1 indicates that the position label is contained;
step 2, when the tag data need to be set, setting the corresponding binary bit as 1 according to the tag contained in the data, setting the rest binary bits as 0, then converting the binary system into decimal system to obtain a number x, setting the tag field of the data as tag_a=x, and inserting the tag field into a database;
step 3, when inquiring data containing the set tag, according to the tag sequence of the step 1, the binary value of the position of the tag is represented by 1, and the rest is represented by 0, namely the set tag is converted into a binary value taga; then, the data of the field 'tag_a' column and the binary value 'taga' in the data table are queried, wherein the bitwise and operation result of the field 'tag_a' column and the binary value 'taga' is equal to the data of the binary value 'taga', and the data is the query result required by setting the tag.
In the step 3, the data of the field 'tag_a' column and the binary value 'taga' in the data table are queried, and the bitwise and operation result of the field 'tag_a' column and the binary value 'taga' is equal to the binary value 'taga', and the query statement is select from table window (tag_a & b '@ taga')=b '@ taga'; where @ is the query syntax in mysql, @ taga is a binary, i.e., a variable, representing the conversion of the set tag; b is a fixed format of query statement, representing binary; b '@ taga' is a binary number representing the tag pattern to be queried, each bit corresponding to the presence or absence of a tag; (tag_a & b '@ taga') represents the bitwise AND operation of the field "tag_a" column and the binary value "taga" in the table and results in a new binary number.
And 4, inserting new labels into the leftmost part of the existing label sequence when the (n+1) th new label is needed to be added.
The invention is further described with reference to the following specific examples:
a method for label storage and query based on binary system comprises the following steps:
step 1, after the known labels are arranged according to any sequence, fixing, and using n binary digits to indicate whether n labels are contained, wherein each binary digit corresponds to one label, a binary value of 0 indicates that the position label is not contained, and a binary value of 1 indicates that the position label is contained.
For example, an order system, with label attributes for an order, known labels are as follows: hotness, time limit, second kill, new, recommended, gift, free sales, special price, package. Given 9 tags, n=9, with one tag for each binary bit, a binary value of 0 indicating that the location tag is not included, and a binary value of 1 indicating that the location tag is included. Then an initial of 000000000 indicates that no tags are included, 100000000 indicates that hot tags are included, 110000000 indicates that both hot and time limited tags are included, 111111111 indicates that 9 tags are included, and so on.
And 2, when the tag data needs to be set, setting the corresponding binary bit as 1 according to the tag contained in the data, setting the rest binary bits as 0, converting the binary system into decimal system to obtain a number x, setting the tag field tag_a=x of the data, and inserting the data into a database.
A field of type int named tag_a is designed for the order table for storing the decimal value of the data containing tag. When the tag data needs to be set, assuming that a certain order contains hotness, killing is performed in seconds, 3 tags are recommended, and the subscript positions corresponding to the 3 tags are known to be 0,2 and 4. Binary 101010000 and converted to decimal 336, tag a is stored as 336. That is, representing that this order data contains popular, seconds-kill, 3 tags are recommended.
And 3, when the data containing the specified label is inquired, the binary value of the position of the label is expressed by 1 according to the label sequence of the step 1, and the rest is expressed by 0, namely the specified label is converted into binary @ taga. Then, the column of 'tag_a' and the binary value '@taga' in the data table are queried, and the bitwise and operation result of the column of 'tag_a' and the binary value '@taga' is equal to the result of the binary value '@taga', namely, a query statement select from table window (tag_a & b '@taga')=b '@ taga'; the @ taga is a binary representation of the calculation, interpreted as a variable or placeholder. b is a fixed format of query statement, used to represent binary, e.g., b '101000000'.
Assuming that order data containing 2 tags of hot and second kills now needs to be queried, according to the tag sequence known in the step 1, the subscript positions of the hot and second kills are 0 and 2, the binary value of the position of the tag is represented by 1, and the rest is represented by 0, so that taga= 101000000 in query conditions is obtained, and a query statement select is organized (tag_a & b '101000000')=b '101000000'). Where b '101000000' is a binary number (b '101000000' represents a binary number in the query syntax in mysql. If no b is added, it is mistaken to be considered a string.) indicating the tag pattern that needs to be queried, each bit corresponding to the presence or absence of a tag. (tag_a & b '101000000') means that the tag in the "tag_a" column is bitwise and operated and a new binary number is obtained. This new binary number will hold the bits in the "tag_a" column that match the query-specific tag pattern, with the other bits being 0. (tag_a & b '101000000') =b '101000000' is used to screen out data containing tags with subscript positions 0 and 2, i.e., data containing hot and second kills. The system now comprises the following data:
then select from table where (tag_a & b '101000000')=b '101000000'; id data 1 and 3 will be obtained.
And 4, inserting new labels into the leftmost part of the existing label sequence when the (n+1) th new label is needed to be added.
Assuming that a new tag "activity" needs to be newly added to the existing 9 tags, a new tag is inserted to the leftmost side of the existing tag sequence, namely, 10 new tag sequences are obtained: activity, hotness, time-limited, second-kill, new, recommended, gift, free-selling, special price, package. The new tag is inserted to the far left because this does not affect the meaning of the tag field tag_a of the original order data. In the new tag order, if the data containing the popular and second-kill tags exemplified in step 3 is to be queried, the new subscripts are 1 and 3, taga= 0101000000, and the query statement becomes select from table where (tag_a & b '0101000000')=b '0101000000'.
As shown in fig. 2, the invention further provides a system for storing and querying labels based on binary system, which comprises a label setting module, a label storing module and a label querying module;
the label setting module is used for arranging the known labels according to any sequence and fixing the known labels, n binary digits are used for indicating whether the known labels contain n labels, each binary digit corresponds to one label, a binary value of 0 indicates that the known labels do not contain the position label, and a binary value of 1 indicates that the known labels contain the position label;
when the tag data needs to be set, the tag storage module sets the corresponding binary bit as 1 according to the tag contained in the data, sets the rest binary bits as 0, then converts the binary system into decimal system to obtain a number x, sets the tag field of the data as tag_a=x, and inserts the tag field into a database;
the label inquiry module is used for expressing the binary value of the position of the label by 1 and the rest by 0 according to the label sequence of the label setting module when inquiring the data containing the set label, namely converting the set label into a binary value taga; then, the data of the field 'tag_a' column and the binary value 'taga' in the data table are queried, wherein the bitwise and operation result of the field 'tag_a' column and the binary value 'taga' is equal to the data of the binary value 'taga', and the data is the query result required by setting the tag.
The tag query module queries data with a field 'tag_a' column and a binary value 'taga' in a data table, wherein the bitwise sum operation result of the field 'tag_a' column and the binary value 'taga' is equal to the binary value 'taga', and the query statement is select from table window (tag_a & b '@ taga')=b '@ taga'; where @ is the query syntax in mysql, @ taga is a binary, i.e., a variable, representing the conversion of the set tag; b is a fixed format of query statement, representing binary; b '@ taga' is a binary number representing the tag pattern to be queried, each bit corresponding to the presence or absence of a tag; (tag_a & b '@ taga') represents the bitwise AND operation of the field "tag_a" column and the binary value "taga" in the table and results in a new binary number.
Assuming that order data containing 2 tags of hot and second kills needs to be queried now, according to the tag sequence known by the tag setting module, the subscript positions of the hot and second kills are 0 and 2, the binary value of the position of the tag is represented by 1, and the rest is represented by 0, so that taga= 101000000 in query conditions is obtained, and a query statement select from table where (tag_a & b '101000000')=b '101000000' is organized. Where b '101000000' is a binary number (b '101000000' represents a binary number in the query syntax in mysql. If no b is added, it is mistaken to be considered a string.) indicating the tag pattern that needs to be queried, each bit corresponding to the presence or absence of a tag. (tag_a & b '101000000') means that the tag in the "tag_a" column is bitwise and operated and a new binary number is obtained. This new binary number will hold the bits in the "tag_a" column that match the query-specific tag pattern, with the other bits being 0. (tag_a & b '101000000') =b '101000000' is used to screen out data containing tags with subscript positions 0 and 2, i.e., data containing hot and second kills. The system now comprises the following data:
then select from table where (tag_a & b '101000000')=b '101000000'; id data 1 and 3 will be obtained.
The system also comprises a label inserting module, wherein when the (n+1) th new label is needed to be added, the new label is inserted to the leftmost part of the existing label sequence.
Assuming that a new tag "activity" needs to be newly added to the existing 9 tags, a new tag is inserted to the leftmost side of the existing tag sequence, namely, 10 new tag sequences are obtained: activity, hotness, time-limited, second-kill, new, recommended, gift, free-selling, special price, package. The new tag is inserted to the far left because this does not affect the meaning of the tag field tag_a of the original order data. In the new tag order, if the data containing the popular and second-kill tags exemplified in step 3 is to be queried, the new subscripts are 1 and 3, taga= 0101000000, and the query statement becomes select from table where (tag_a & b '0101000000')=b '0101000000'.
The foregoing description is only of the preferred embodiments of the invention, and all changes and modifications that come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein.
Claims (6)
1. A method for storing and inquiring labels based on binary system is characterized in that: the method comprises the following steps:
step 1, after the known labels are arranged according to any sequence, fixing, using n binary digits to represent whether n labels are contained, wherein each binary digit corresponds to one label, a binary value of 0 indicates that the position label is not contained, and a binary value of 1 indicates that the position label is contained;
step 2, when the tag data need to be set, setting the corresponding binary bit as 1 according to the tag contained in the data, setting the rest binary bits as 0, then converting the binary system into decimal system to obtain a number x, setting the tag field of the data as tag_a=x, and inserting the tag field into a database;
step 3, when inquiring data containing the set tag, according to the tag sequence of the step 1, the binary value of the position of the tag is represented by 1, and the rest is represented by 0, namely the set tag is converted into a binary value taga; then, the data of the field 'tag_a' column and the binary value 'taga' in the data table are queried, wherein the bitwise and operation result of the field 'tag_a' column and the binary value 'taga' is equal to the data of the binary value 'taga', and the data is the query result required by setting the tag.
2. A method for binary-based tag storage and querying as claimed in claim 1, wherein: the method also comprises a step 4 of inserting new labels to the leftmost part of the existing label sequence when the (n+1) th new label needs to be added.
3. A method for binary-based tag storage and querying as claimed in claim 1, wherein: in the step 3, the data of the field 'tag_a' column and the binary value 'taga' in the data table are queried, and the bitwise and operation result of the field 'tag_a' column and the binary value 'taga' is equal to the binary value 'taga', and the query statement is select from table window (tag_a & b '@ taga')=b '@ taga'; where @ is the query syntax in mysql, @ taga is a binary, i.e., a variable, representing the conversion of the set tag; b is a fixed format of query statement, representing binary; b '@ taga' is a binary number representing the tag pattern to be queried, each bit corresponding to the presence or absence of a tag; (tag_a & b '@ taga') represents the bitwise AND operation of the field "tag_a" column and the binary value "taga" in the table and results in a new binary number.
4. A system for binary-based tag storage and query, characterized by: the system comprises a label setting module, a label storage module and a label inquiring module;
the label setting module is used for arranging the known labels according to any sequence and fixing the known labels, n binary digits are used for indicating whether the known labels contain n labels, each binary digit corresponds to one label, a binary value of 0 indicates that the known labels do not contain the position label, and a binary value of 1 indicates that the known labels contain the position label;
when the tag data needs to be set, the tag storage module sets the corresponding binary bit as 1 according to the tag contained in the data, sets the rest binary bits as 0, then converts the binary system into decimal system to obtain a number x, sets the tag field of the data as tag_a=x, and inserts the tag field into a database;
the label inquiry module is used for expressing the binary value of the position of the label by 1 and the rest by 0 according to the label sequence of the label setting module when inquiring the data containing the set label, namely converting the set label into a binary value taga; then, the data of the field 'tag_a' column and the binary value 'taga' in the data table are queried, wherein the bitwise and operation result of the field 'tag_a' column and the binary value 'taga' is equal to the data of the binary value 'taga', and the data is the query result required by setting the tag.
5. A binary-based tag storage and query system as claimed in claim 4, wherein: the system also comprises a label inserting module, wherein when the (n+1) th new label is needed to be added, the new label is inserted to the leftmost part of the existing label sequence.
6. A binary-based tag storage and query system as claimed in claim 4, wherein: the tag query module queries data with a field 'tag_a' column and a binary value 'taga' in a data table, wherein the bitwise sum operation result of the field 'tag_a' column and the binary value 'taga' is equal to the binary value 'taga', and the query statement is select from table window (tag_a & b '@ taga')=b '@ taga'; where @ is the query syntax in mysql, @ taga is a binary, i.e., a variable, representing the conversion of the set tag; b is a fixed format of query statement, representing binary; b '@ taga' is a binary number representing the tag pattern to be queried, each bit corresponding to the presence or absence of a tag; (tag_a & b '@ taga') represents the bitwise AND operation of the field "tag_a" column and the binary value "taga" in the table and results in a new binary number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311278253.0A CN117370342A (en) | 2023-09-28 | 2023-09-28 | Binary system-based method and binary system-based system for label storage and query |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311278253.0A CN117370342A (en) | 2023-09-28 | 2023-09-28 | Binary system-based method and binary system-based system for label storage and query |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117370342A true CN117370342A (en) | 2024-01-09 |
Family
ID=89388388
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311278253.0A Pending CN117370342A (en) | 2023-09-28 | 2023-09-28 | Binary system-based method and binary system-based system for label storage and query |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117370342A (en) |
-
2023
- 2023-09-28 CN CN202311278253.0A patent/CN117370342A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP2718881B2 (en) | Token identification system | |
| CN101751432B (en) | Addressing method and system for internet of things | |
| CN101661509B (en) | Method for generating major key field of database table and device thereof | |
| US7218252B2 (en) | System and method for character conversion between character sets | |
| CN101061500A (en) | Methods, systems, devices and computer program products for providing dynamic product information in short-range communication | |
| CN102622444A (en) | XML (extensible markup language) message processing method and XML message processing device | |
| CN103399934A (en) | Form data transmission and storage method | |
| CN102541926B (en) | Data exchange processing method, equipment and system | |
| CN113868252A (en) | Database mode matching method and device and SQL query statement generation method | |
| CN103297554A (en) | Method and device for compatibility processing of IPv4 and IPv6 | |
| CN113722533B (en) | Information pushing method and device, electronic equipment and readable storage medium | |
| CN110825919B (en) | ID data processing method and device | |
| CN117370342A (en) | Binary system-based method and binary system-based system for label storage and query | |
| CN101754155B (en) | Call bill format conversion method and device and call bill processing method and system | |
| CN1838665B (en) | Adapting method between different byte sequence styles in network communication | |
| CN112380238A (en) | Database data query method and device, electronic equipment and storage medium | |
| CN111611267A (en) | Method for converting database data into JSON object configuration visual chart | |
| CN101516086B (en) | Service matching method for mobile communication | |
| CN101963957B (en) | Method for implementing electronic dictionary on intelligent card and intelligent card | |
| CN104053135B (en) | A kind of method and device for realizing unstructured supplementary data traffic | |
| CN112989142A (en) | Configurable tag processing system, method and device | |
| CN1484174A (en) | Universal inquiry statement dynamic generation system and method | |
| CN100390783C (en) | Method and system for case conversion | |
| CN108984713B (en) | XML file processing method and device | |
| CN113434657B (en) | E-commerce customer service response method and corresponding device, equipment and medium thereof |
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 |