13 results about "Wildcard character" patented technology

According to the query method, device and equipment, in the application, a query request is received, the query request is used for obtaining a query target from a file system, a query statement comprises data in the query target or a path of the query target, and the query statement comprises a wildcard character; and querying the prefix compression index based on the query statement to determine an identifier of the query target. The prefix compression index records the identifier of the file or the identifier of the catalogue, and the file or the catalogue meets any one of the following conditions: the path of the file or the catalogue comprises a catalogue file combination, and the file or the catalogue comprises a character combination. And obtaining an identifier of a query target from the prefix compression index according to the query statement, and obtaining and feeding back the query target to the user by utilizing the identifier of the query target. Compared with the prior art, the prefix compression index does not correspond to a single word any more, but is combined data, a certain specific prefix compression index can be positioned by directly utilizing the query statement, the identifier of the query target is obtained, the possibility of introducing noise in the query process is reduced, and the query accuracy is improved.

This application provides a bidirectional adaptive parsing and routing method for MQTT topics based on a single configuration template, applicable to the Internet of Things (IoT) field. The method includes: reading a user-filled topic template string; recording the method for obtaining the actual variable values ​​required for each preset placeholder in the topic template string during uplink publishing, generating a first parsing rule; replacing the preset placeholders in the topic template string with preset MQTT wildcards to obtain a subscription topic; replacing each preset placeholder in the topic template string with a capture group, then replacing the capture group with an intermediate placeholder, escaping and restoring the capture group, compiling it into a regular expression object, generating a second parsing rule; during uplink data transmission, calling the first parsing rule to replace each preset placeholder in the topic template string with the obtained corresponding actual variable values ​​to generate a publishing topic; during downlink data transmission, calling the second parsing rule to perform regular expression matching and variable extraction on the topic string, constructing downlink data packets.

The present invention provides a method, a memory, and a device for analyzing SQL table fields based on an abstract syntax tree. The method includes: parsing an initial SQL statement into an abstract syntax tree; performing table field analysis on the abstract syntax tree to obtain the initial SQL statement and the parsing results of the query statements at all levels of the initial SQL statement as the initial parsing results; traversing the initial parsing results, processing wildcards and / or fields lacking table aliases in multi-table associations, and supplementing source fields for the table field parsing results of each clause of the query statements at all levels to obtain the final parsing results. This method can effectively solve the limitations in handling full-field queries and multi-table associations in existing solutions and has universality.

An automaton management method and apparatus. A computing node constructs a fractal automaton on the basis of first information, wherein the first information comprises at least one first pattern string, the first pattern string comprises at least one character, and a first dictionary tree comprises a plurality of nodes; and if the at least one first pattern string comprises at least one wildcard character, the plurality of nodes comprises a first root node, at least one second root node, and a plurality of non-root nodes, wherein the first root node is null, one second root node corresponds to one wildcard character, and one non-root node corresponds to one non-wildcard character; and a failure pointer of the first root node or the at least one second root node points to itself, the plurality of non-root nodes comprise a first non-root node, the first non-root node is, for example, a parent node, a sibling node or a child node of the second root node, and a failure pointer of the first non-root node points to the second root node. The method provides an optimized automaton structure, such that the automaton can support fuzzy matching, and the method facilitates operation and maintenance management.

The invention relates to a dynamic switching method, device and equipment for an IDE (integrated development environment) adaptive multi-compilation tool chain. The method comprises the following steps: defining key information and interface control types of each compiling tool chain through a configuration file; and analyzing the node information of the configuration file, loading the initial value after matching the type of the interface control, and generating a user operation interface of the interface control. In an interface, interface data operated by a user is associated and stored through the control ID, rules are generated according to commands in the configuration file, the interface data are matched with wildcard characters of the rules, and an execution command corresponding to the compiling tool chain is generated. The execution command is transmitted into an execution module of the IDE, and an execution program corresponding to the compiling tool chain is called, so that when the compiling tool chain is switched, the initial value of the configuration file corresponding to the compiling tool chain is reloaded, the user operation interface is regenerated, interface data is updated, and dynamic switching is completed. By adopting the method, the configuration efficiency of the multiple compiling tool chains in the IDE can be improved, and the configuration cost is reduced.

The application provides a SQL dynamic desensitization method based on a scope fingerprint and an operator security matrix. By introducing a "scope fingerprint" mechanism, the application can accurately divide the scope and bind the source of any complex SQL structure such as nested subqueries and CTEs, effectively solving problems such as wildcard error expansion and desensitization range pollution caused by scope confusion, and ensuring the accuracy of the desensitization operation. Through the innovative "operator security matrix" and the context probe of the AST parent node, the application realizes fine-grained and differentiated desensitization at the expression level. It can achieve the best balance between ensuring data security and maintaining business logic compatibility, effectively avoiding the problems of over-desensitization and insufficient desensitization caused by the "one-size-fits-all" strategy of the prior art.

The invention relates to a database ciphertext wildcard character fuzzy retrieval method, system and device and a medium, and belongs to the technical field of data security. In the aspect of the client, plaintext fields of a target database are preprocessed, an intermediate index vector is constructed based on an inner product relationship, and encryption is performed by adopting a secure KNN encryption algorithm to obtain an encrypted ciphertext; meanwhile, constructing a common prefix index tree, and sending the index tree and the ciphertext to a server; and then constructing and sending a retrieval ciphertext to the server side, waiting for a returned result and decrypting the returned result. In the server side aspect, the encrypted ciphertext and the index tree are received and stored; and after the retrieval ciphertext is received, matching the index tree and / or the encrypted ciphertext column based on the retrieval ciphertext, and returning a result to the client. By combining a unique vector construction mode and a secure KNN encryption algorithm, the encryption efficiency is improved, and wildcard character retrieval and plaintext recovery by decrypting the encrypted ciphertext are supported.

An automaton management method and device, in which a computational node constructs a fractal automaton according to first information, the first information comprises at least one first pattern string, the first pattern string comprises at least one character, a first dictionary tree comprises a plurality of nodes, and if at least one first pattern string comprises at least one universal character, the first pattern string comprises at least one character; the plurality of nodes comprise a first root node, at least one second root node and a plurality of non-root nodes, the first root node is empty, one second root node corresponds to one universal character, and the non-root nodes correspond to one non-universal character; the failure pointer of the first root node or the at least one second root node points to itself, the plurality of non-root nodes comprise a first non-root node, the first non-root node is such as a father node, a brother node or a child node of the second root node, and the failure pointer of the first non-root node points to the second root node. The optimized automaton structure is provided through the method, so that the automaton can support fuzzy matching, and operation and maintenance management is facilitated.

The invention provides an electric power automatic mapping method and system based on topology identification, and relates to the technical field of electric power monitoring, and the method comprises the steps: determining the wiring modes and independent intervals of different voltage levels through the analysis of a power grid topology structure; performing layout on the primary equipment by adopting an automatic layout algorithm according to the wiring mode and the independent interval, and generating an equipment coordinate position; automatically generating a main wiring diagram based on the coordinate position of the equipment, and completing data association between the primary equipment and a database; based on the independent intervals in the main wiring diagram, the interval types are automatically recognized, interval diagrams are generated in batches through a dynamic template, and the dynamic template replaces wildcard characters with actual interval names and device names to complete data association between devices in the interval diagrams and a database. According to the automatic mapping method, the topology of the power system can be intelligently analyzed, graph layout can be automatically completed, data seamless association can be realized, and the efficiency and quality of power system design work can be improved.

The invention provides a word query method and device for an input method, electronic equipment, a computer readable storage medium and a computer program product. The method comprises the steps that a to-be-queried stroke sequence is obtained, the stroke sequence comprises at least one stroke, at least one wildcard character and at least one word segmentation character, and the word segmentation character is used for dividing the stroke sequence into a plurality of stroke units; determining at least one stroke belonging to the same stroke unit as a target stroke; querying offset and data length corresponding to at least one target stroke from the dictionary tree; querying a target character corresponding to the at least one target stroke from a character file according to the offset and the data length; querying a plurality of candidate words corresponding to the target word from the word combination file; determining the word length according to the number of the word segmentation characters, and filtering out candidate words which do not accord with the word length from the plurality of candidate words; and generating a word query result based on the residual candidate words after filtering. By means of the method and device, the word query result of the input method can be efficiently and accurately obtained.

A search language is provided for writing rules that allow semantic and syntactic checking of source code to find potential errors in a target code. The language allows for wildcards (also called placeholders), which provide a more expansive matching of search terms. A compiler is described that converts a search language query into a semantic graph representation. The target code being searched can also be converted to a target graph representation. A comparison can then be performed between the semantic graph representation and the target graph representation to determine if the semantic graph representation is contained within the target graph representation. If so, then a semantic match is found in the target source code. More specifically, semantic matching can be realized by checking homomorphism against the target graph representation. In one example, the semantic matching can include a comparison of nodes and edges connecting the nodes.

The present invention discloses a decentralized fine-grained privacy protection crowdsourcing task matching method and system. A key authorization agency cooperates to generate original attribute keys for each task executor and secretly distributes and shares them with the corresponding task executors; the task publisher calculates the task ciphertext and submits the ciphertext to the smart contract; the task executor performs homomorphic calculation on the secret shares and then sends them to the task executor; the task executor recovers the converted attribute key and generates a search trapdoor, and uploads the search trapdoor to the blockchain; the smart contract matches the task ciphertext submitted by the task publisher and the search trapdoor of the task executor, and stores the matching result on the blockchain; the task executor obtains the task ciphertext from the blockchain and performs two decryptions to obtain the task plaintext. The present invention provides bilateral privacy protection while considering the preferences of both parties, uses the blockchain to achieve decentralized task matching and ensures the correctness of the matching result; in addition, aiming at the problem that the task access control policy may have multiple wildcards affecting the matching overhead, the original attribute key is converted, which can effectively reduce the on-chain task matching overhead.