218results about How to "Query speed" patented technology

The embodiment of the invention discloses a method and device for processing and querying data. The processing method comprises the following steps of: establishing a first level index for the data, wherein the data is stored in at least one file, the first level index is used for indexing each file, and the corresponding data is stored in the file; and respectively establishing a second level index for each file, wherein the second level index is used for indexing the corresponding data in the corresponding file. The querying method comprises the following steps of: utilizing the first level index to search within each file according to a received data querying request, thereby acquiring a queried file storing the data queried by the querying request; and then utilizing the second level index to search within the queried file according to the data querying request, thereby acquiring the data queried by the querying request. By using the method, the speed for querying a large amount of data is increased.

The invention discloses a user authentication method and system. The method comprises the steps of: creating a user block chain; obtaining information data provided by a user; encrypting the hash value of the information data of the user by adopting a digital signature technology, and sending the encrypted hash value and the information data to a user block chain node; and, according to the information data and the hash value, judging whether the user is a user registered in the user block chain or not, and if so, completing identity authentication of the user. By means of the user authentication method and system disclosed by the invention, the purpose of ensuring security of the user information and relatively high authentication efficiency can be achieved.

The invention provides a multi-dimensional interval query method based on cloud computing. The method includes the steps of index construction and multi-dimensional interval data query. The index construction step includes: automatically constructing and storing a distributed grid file index and metadata according to an externally entered index construction command. The multi-dimensional interval data query step includes: positioning a data block to be read, according to an externally entered query command and on the basis of the distributed grid file index and metadata, and automatically and evenly distributing reading requests to nods of a server cluster, parallelly processing query requests in the system, parallelly acquiring all query results, and collecting the results before returning to users. The invention further provides a multi-dimensional interval query system based on the distributed grid file index.

The invention provides a method and a device for storing and inquiring mass semantic data. The method comprises the following steps of: constructing a cluster with a plurality of computer nodes based on cloud computing, wherein the cluster comprises a master control node and a plurality of slave nodes; establishing a distributed database for each node in the cluster; and importing mass semantic data into the distributed database of each node by a cloud computing programming model. Therefore, distributed storage is realized; and the problems of storage bottleneck and management difficulties of a stand alone system when mass data is processed are solved. Simultaneously if data scale continues to expand, good expandability is achieved by only adding the slave nodes of the cluster. In addition, when the problem of inquiring the mass data is solved, the method of the invention segments an inquiry by utilizing RMI technology, so that each node of the cluster can process the obtained segmented inquiry at the same time; and therefore, inquiry velocity is higher and efficiency is higher.

The invention discloses a method and a device for processing table items based on a Hash table. The method comprises the steps of: during table item storage, storing table items to be stored in a result table in a sequential arrangement manner; calculating Hash values of key values of the table items to be stored by using dual Hash functions of an index table; and storing the Hash values and address pointers of the result table of the table items to be stored at idle positions in the index table. According to the invention, while lower access frequency and higher inquiry speed are guaranteed, the clause memory capacity of the service table items is increased effectively, the capacity of the Hash table for supporting possible services is increased, high spatial utilization rate is achieved for the Hash table, in addition, the probability of conflicts is reduced, and thus, the performance and the capacity of the Hash table are balanced.

The invention discloses a spatial data double cache method and a mechanism based on a key value structure, and belongs to the technical field of spatial data storage and management. A double cache mechanism of memory caching and file caching is disclosed by the spatial data double cache method and the mechanism based on the key value structure, the memory caching is first level caching, uses B+tree organizing data, and is written in the file caching by adopting a caching write-back mechanism in an asynchronous mode; the file caching is second level caching, uses large files to be built, and builds caching index based on the B+tree so as to accelerate the speed of searching; and a free space of the file caching uses free space management based on the B+tree to manage. The spatial data double cache method and the mechanism based on the key value structure have the advantages of being free in key value storage mode, fast in searching speed, high in concurrency performance and the like. Storage and visiting efficiency of spatial data caching in network environment are improved, and the spatial data double cache method and the mechanism based on the key value structure can be used for caching of generic spatial data such as remote-sensing images, vector data and dynamic effect model (DEM) in a network geographic information system (GIS).

The present invention provides a dynamic heterogeneous metadata acquisition method and system. A metadata dynamic acquisition module is provided with a unified interface used for dynamically acquiring metadata and is connected to a data storage device by means of the unified interface; a dynamic metadata cache module is used for storing and changing metadata information; a distributed message service module is used for publishing a metadata change request; and a metadata synchronization server subscription module is used for subscribing the metadata change request, and maintaining a metadata dynamic partition and metadata structural information. Moreover, provided is a second-type dynamic heterogeneous metadata acquisition system. According to the method and system provided by the present invention, a unified metadata system can be constructed based on a heterogeneous data source, and storage, management and usage abilities for the system are provided; and the method and system are applicable to providing a basic unified data standard for massive data mining and analysis, and lays a foundation for constructing an industry semantic library.

The invention relates to a man-machine interactive system and a scheme which is composed of four parts: a man-machine interactive scheme (1) used for interacting medical information, a man-machine interactive hardware device (2) used for interacting medical information, a physical sign / symptom analysis software program (3), a medical information database and an inquire software program (4). The system can be assembled manufactured by using accessory random that is mass popularization manufactured in current social such as singlechip, computer, PDA, mobile phone and e-dictionary. The system realizes arranging inquire and multiple inquire to special information (the medical health type information having individuation requirement characteristic), provides target medical information service to broad masses of other specialty with culture standard more than middle. The system solves social requirement that ordinary masses obtains systematic and comprehensive medical health information guidance urgently who take medicine / health by experience at once because of lackness medical health information.

The invention relates to a searching system based on encyclopedic data extracting integration. The searching system is characterized by comprising a data extracting module, a data integrating module and a data searching module, wherein the data extracting module is used for extracting encyclopedic webpage from internet, positioning and initially filtering tables in various encyclopedic webpage, positioning and extracting the tables based on visual features, uniformly converting the extracted tables into a list mode, classifying the tables with the same feature parameters into a sort, extracting and identifying the classification information for the tables of each sort, and storing the classified information into an information database and an XML database; the data integrating module is used for classifying and marking according to sorts, adopting an integrating method to merge the tables with the same attribute into the same mode library, clustering the mode information in each mode library, and outputting mode cluster and recommended mode; and the data searching module is used for searching corresponding table information from the information database, and outputting searching results and the recommended mode.

The invention discloses an IP address ownership information indexing and fast querying method. The method includes the first step that an ownership information configuration file is selected or built; the second step that CIDR block records in the configuration file are read and each record is built as a new node of a query tree; if a block belongs to an IPV4 address block or an IPV6 address block, and a head node corresponding to a query sub-tree of the IPV4 or a query sub-tree of the IPV6 is empty, then the new node is used as the head node, or the corresponding head nodes are selected to carry out transversal on the query sub-tree until conditions are met (the transversal is carried out to reach leaf nodes, or comparing bits of current nodes are larger than the new node and comprises CIDR block information), and joint network prefix length L of the current nodes and the new node is calculated, if the L is larger than the comparing bits of the current nodes, the L will return to father nodes and the father nodes are set as the current nodes; the insertion position of the new node is determined according to the L value and the current nodes and the ownership information of the L value is associated to the new node. The IP address ownership information indexing and fast querying method has higher querying efficiency.

The invention discloses a visual-content-based method for establishing a multi-level semantic map. The visual-content-based method comprises the following steps: gathering images shot by a robot wandering in an environment and labeling the scenes of spots for photography; constructing a hierarchical vocabulary tree; constructing a knowledge topological layer so as to grant knowledge to the knowledge topological layer; constructing a scene topological layer; constructing a spot topological layer. According to the visual-content-based method, a visual sensor is utilized for constructing the multi-level semantic map for a space, and digraph structure is used on the knowledge topological layer for storing and inquiring the knowledge, so that unnecessary operation can be eliminated in a knowledge expression system, and the inserting and inquiring speed is quick; the scene topological layer is utilized for carrying out abstract division on the environment so as to abstractly divide the whole environment into subdomains, so that the image searching space and the path searching space can be reduced; the spot topological layer is utilized for storing specific spot images, the self-positioning can be realized by adopting image searching technology, and the error accumulation problem of self-positioning estimation is solved without maintaining the global world coordinate system.

The invention discloses a grouping method of Internet protocol (IP) addresses or cell phone numbers and a query method of an attribution place. The grouping method comprises the steps of grouping of the IP addresses or the cell phone numbers first according to the attribution place, and then converting the IP addresses or the cell phone numbers in each group into integer numbers and storing the integer numbers into a digit group after the integer numbers are sequenced; and grouping of the IP addresses or the cell phone numbers to generate a digit group list according to the grouping method of the IP addresses or the cell phone numbers. The query method comprises the steps of first converting the IP addresses or the cell phone numbers which are requested to be queried into the integer numbers in a corresponding mode, and afterwards, querying the positions of the integer numbers which are matched with the IP addresses or the cell phone numbers in the digit group list through the dichotomy, and finally, returning corresponding attribution place information. By means of the grouping method of the IP addresses or the cell phone numbers and the query method of the attribution place, system consumption can be lowered, a high concurrent processing capacity is achieved, the query speed is higher than query speed of a database query and an internal memory query, and initialization time which is shorter than time of a query of a corresponding relation of internal memory distributed storage is achieved.

The invention provides a peer-to-peer structure based distributed high-dimensional indexing parallel query framework, which comprises an index creation module, a monitor module, a peer-to-peer site cluster and a soft load balance module. The index creation module is used for creating an index and storing index block files. The monitor module is used for detecting information of available memory of operation sites in the peer-to-peer site cluster and corresponding index block information of each operation site so as to coordinate the operation sites according to detection results. The soft load balance module is used for controlling load balance for the each operation site, and control is regularly synchronized through the monitor module so that the soft load balance module can timely regulate and update a lift of the operation sites currently available. The peer-to-peer structure based distributed high-dimensional indexing parallel query framework has the advantages of capability of reliably searching massive candidates in real time under support of dynamic increase and decrease, and is fast in query speed.

The invention discloses a chain log storage structure, a hash index structure and a data operation method thereof, a server and a medium. The chain log storage structure comprises a plurality of storage segments and an array; a storage unit of each storage segment is a log entry; the log entry includes an initial size field, an index position field, a key length field, a Key field and a Value field, wherein the Value field is used for storing data; the Value field is used for storing data keys; the initial size field is used for storing an initial size of the storage log entry; the index position field is used for storing the position of an index of the log entry in a hash table; and the array is used for storing meta information of each storage segment. The hash index structure comprises a plurality of hash buckets; and a data structure of each hash bucket includes an index number field, a valid mark field, a label field, an offset field and an extension bucket field. According to the chain log storage structure, the hash index structure and the data operation method thereof, the server and the medium, the close continuity of the whole structure memory can be maintained and the fragmentation rate is reduced.

The invention discloses a power keyword segmentation based data retrieval method and device. The method includes the steps of S01, inputting a keyword in a to-be-inputted textbox on a page; S02, according to the inputted keyword, structuring single searching, recording and parsing structural objects and segmenting the keyword into two or more keywords to form a keyword set; S03, determining matching relations of the keywords in the keyword set and a word bank and processing the keywords, wherein the matching relations include complete matching, incomplete matching and non-matching; S04, sorting all the keywords stored in the searching, recording and parsing structural objects according to the size of weight and filtering the keywords to be displayed on the page; S05, outputting data after assembling SQL (structured query language) and searching a database. With the method and device, searching efficiency can be greatly improved, and searching of the power keywords is facilitated.

The present invention provides a blockchain system and a blockchain network transaction method. The blockchain system comprises a plurality of nodes, wherein each node stores at least one piece of complete blockchain data information, and each node comprises at least one branch node used for negotiating with a specific user to establish an encrypted channel, wherein one branch node receiving record data information transmits the information to the other nodes; and the blockchain system further comprises a plurality of blocks for storing the blockchain data information; and each branch node cangenerate a new block after receiving the block creation information of the specific user. During an actual running process, each branch node can generate a new block after receiving the block creation information of the specific user, and broadcasts the newly created block to the other nodes to inform the other nodes of the newly created block; and when the newly created block is a valid block, each node in the blockchain system stores the information of the block. The blockchain system has the advantages of high query speed, high security performance, and large data storage capacity.

The invention provides a retrieval condition error correction prompt processing method based on Pinyin in retrieval application. The method can provide error correction prompts when Chinese character retrieval conditions are input through a Pinyin input method and input errors occur, supports error correction prompts in a Chinese character mode, a Pinyin mode and a Chinese character and Pinyin mixing mode, and provides the error correction prompts according to misused character entry retrieval of homonyms and fuzzy words. According to the retrieval condition error correction prompt processing method based on the Pinyin, a dictionary tree serves as a data structure for query processing, has the advantages of being high in query speed, strong in error correction capacity, little in occupied data space and the like, can improve error correction prompt processing efficiency and response speed of a search engine on retrieval conditions, brings good use experience for users, and therefore improves loyalty of the users to retrieval application products.

The invention discloses a system and a method for controlling a 3D model based on a gesture, and belongs to the field of 3D model control. The system for controlling the 3D model based on the gesture comprises a screen event capturer for capturing a finger event on a touch screen in real time, a gesture processor for calculating a change vector according to coordinates obtained from the screen event capturer, a 3D model renderer for controlling display of the 3D model on the screen according to the change vector, and a control instruction mapper for recording a 3D model control instruction corresponding to the gesture. The screen event capturer transmits captured finger information to the gesture processor; the gesture controller transmits the calculated change vector to the 3D model renderer; the 3D model renderer controls the display on the screen; and corresponding operation steps are correspondingly performed, so that the problems that a 3D model operation engine, for the touch screen, mentioned in the prior art is realized at most through two fingers, only supports two operations and cannot support three common operations of translation, rotation and zooming at the same time are solved.

The invention discloses a network organization method of systematic searching in a peer-to-peer network video sharing system; each node executes the following steps: (1) the super node list and the neighbor list are initialized; (2) the self-attached super node pattern is decided, and similar super node list is decided from a super node index server; (3) that whether the contact ratio of the index of the nodes of the super node list and the index of the node is smaller is judged; (4) the nodes of small index contact ratio in the super node list is added to the neighbor node list; (5) that whether the interval of the current information sending and the last information sending reaches the exchange cycle is judged; (6) update information and topological maintenance information between the super node and the neighboring node is exchanged; (7) that whether an exit request is received is judged. The method of the invention uses the super node to judge the attached pattern of the node, and adds the node of small index contact ratio in the category to the neighbor node. The method is characterized by quick index speed, stable network topology structure, self-adaptive adjustment based on the interests of the user.

The invention provides a support system for rush-repair work order distributing of a distribution network and an optimization method. The system comprises a database, a Hadoop system, a Mahout system, and a data acquisition system. The database stores data collected and processed by the system. The Hadoop system is used for data calculation and storage. The Mahout system is used for work order data mining and scoring. The data acquisition system is used for collecting real-time association data information of work order distributing. In addition, the method comprises: the data acquisition system obtains work order distributing association data information; the Mahout system carries out integration of data from the data acquisition system and the database and calculates an association score between each work order and each rush-repairing individual; the Hadoop system re checks the score and generates a recommendation list; and a rush-repairing individual is selected from the recommendation list and a work order is sent out. On the basis of calculation of optimal selection, a work order is assigned to a first worker or first vehicle arriving at a rush-repairing site, so that the overall rush-repairing efficiency can be improved.

The invention discloses a health intelligent inquiring system, which comprises a client, an inquiring subsystem and a database, wherein the inquiring subsystem comprises a disease form inquiring interface and a searching engine, and the disease form inquiring interface comprises a disease information input interface and a treatment information output interface; the disease information input interface comprises a disease name input frame and / or a disease symptom input frame; and the database comprises a disease name database corresponding to the disease name input frame, a disease symptom database corresponding to the disease symptom input frame and a treatment method database corresponding to the treatment information output interface, and the searching engine searches the database according to content inputted by the disease information input interface and feeds the searching result back to the treatment information output interface. Due to adopting the health intelligent inquiring system, the disease and symptom can be timely and accurately found, and an accurate treatment method can be provided.

The invention relates to a method for eliminating repetition of memory dialog list, comprising the following steps of: step 1, reading a dialog list document into a memory; step 2, reading a dialog list record from the dialog list document; step 3, finding the index list which is corresponding to the dialog list record from the memory according to the key information of the dialog list record; step 4, piecing the field content of the dialog list record to form a character string, working out the MD5 value as the index of the dialog list record; step 5, interpolating the MD5 value in the index list; if the interpolating operation is successful, writing the dialog list record into a normal dialog list document; otherwise, writing the dialog list record into a repeated list document; and step 6, repeating the second step to the fifth step until traversing all dialog list records of the dialog list document. The method provided by the invention eliminates the repetition by using the index list and the MD5 value, realizes the operation for implementing relatively quick repetition eliminating treatment in a relatively small memory space, and the repetition eliminating processing performance of the dialog list is not relative to the data volume of the dialog list.

A service data query method includes: establishing a database connection pool corresponding to a plurality of application systems; Receiving an externally inputted query request, wherein the query request comprises one or more business item query requests; Querying services from different databases in the database connection pool according to the query application and obtaining a query result; Anddisplaying query results obtained from databases corresponding to the plurality of application systems into the same table. The invention also provides a service data inquiry device, an electronic device and a storage medium. The invention can realize SQL inquiry request configuration items of different types of databases of different systems, display service items in different types of databasesof the different systems in a WEB display page of a table, and realize business process optimization. The invention can realize SQL inquiry request configuration items of different types of databasesof different systems, display service items in different types of databases of the different systems in a WEB display page of a table, and realize business process optimization.

The invention discloses a massive distributed relational database-oriented cursor creation method which is used for solving the technical problem of cursor function structure deficiency of SQL (Structured Query Language) process flow in an existing OceanBase. According to the technical scheme, a complete cursorcreation method is designed based on a massive distributed relational database structure according to SQL92 standard syntax, unified syntax tree, logic plan and physical plan are created according to a common key word of a cursor, and anSQL execution process of a cursor is designed. The method can finishthe cursor function of the distributed database and has relatively good query performance during mass data query; compared with the cursor execution performance of a commercial database DB2 in one million data sets, the query speed of the cursor created by the method is higher than that of the DB2 by about 70 times.

The invention discloses a double compensation based multi-table Hash image retrieval method. The method comprises the steps of image characteristics extraction and category information processing, Hash table training, mapping of image characteristics to hamming space according to Hash tables and category weight calculation, hamming distance calculation based on query and query result returning and re-sorting operation. The method has the advantages of being quick in query response, small in internal storage expenditure and high query performance on the aspect of image retrieval, is greatly improved on the aspect of multi-table Hash image retrieval and overcomes the shortcoming of additional expenditure of multi-table Hash.

The invention provides a name search method, a device and a mobile communication terminal for name search, wherein the method comprises: receiving the name search instruction of the user, generating a surname list of all contacts; receiving the surname selected by the user, generating a list of a second character of all contacts' names with all surnames; receiving the second character selected by the user; determining the contact according to the surname and the second character. The method comprises: receiving the second character selected by the user; generating a list of a third character of all contacts' names with the surname and the second character; receiving the third character selected by the user, determining the contact according to the surname, the second character and the third character. According to the project, the contact can be found only through the surname of the contact, without being familiar with spellings for the user, with fast search speed, wherein the corresponding contact can be found only through three steps.

The embodiment of the invention discloses a query method and a system of database, a client side, a server and a database. The method realizing on the client side comprises the following steps: receiving a first query command input by users by providing a visual interface to a user, wherein the first query command comprises a filtering condition of data needing to be queried; sending the first query command to a server; receiving and displaying a major key listing returned by the server; receiving a second query command input by users by the visual interface provided for the user; sending the second query command to the server, wherein the second query command comprises a major key assembly needing to be queried in a major key listing; receiving and displaying data which corresponds to the major key assembly and is returned by the server. One query is divided into two stages, thus reducing sending data amount; because the data quantity queried in the second stage is less if compared with all data, occupied cache is less; because sending data quantity and occupied cache are decreased, the query speed is higher.

The invention discloses a publishing and subscription method. A publisher produces an advertisement message and forwards the advertisement message to the whole network; each proxy node produces a route table based on an advertisement theme; a subscriber produces a subscription message and routes the subscription message to the publisher of the relevant theme according to a route produced by the route table based on the advertisement theme; each node produces a route table based on a subscription content; the message published by the publisher is routed to the subscriber according to the route table based on the subscription content; furthermore, during routing, the message is cached into a certain proxy node on a deliver route and is marked as cached; the subscriber sends a historical message subscription which is routed to the publisher with the corresponding theme according to the route table based on the advertisement theme; historical messages meeting a subscription condition are searched along the deliver route; and the searched historical messages are turned to the subscriber along an opposite route. By the publishing and subscription method, the problem that a user cannot acquire the historical messages in a publishing / subscription system is solved; and the historical messages can be searched quickly and reliably.

The invention relates to a privacy protection query method based on Voronoi polygons and Hilbert curve coding. The method comprises the steps that a server end performs Voronoi polygon partitioning on a plane where a target object is located, performs partitioning coding by using the Hilbert curve, and establishes a B+ tree index mapping the Hilbert cell coding and Voronoi polygons; a user submits a Hilbert curve coding value H (p) of a self-position p to the server via a client for k-neighbor query; the server end searches for a Voronoi polygon C corresponding to the H(p) on the query tree to generate the minimum enclosing rectangle R of C; the server end searches for k-1 neighbor Voronoi polygons of R, forms Hilbert curve coding values corresponding to the Voronoi polygons into a candidate query result set CaS and returns the result to the client; the user decodes the Hilbert curve coding values in the CaS to screen out the nearest neighbor target object. The method achieves k-neighbor query for protecting position privacy.

The invention discloses a fast fuzzy pinyin inquiry method of mass Chinese file names. The method comprises the following steps of: 1) determining whether an inquiry character string is Chinese pinyin, and if so, performing conversion and extension on the inquiry character string according to a fuzzy pinyin rule so as to form a new inquiry character string, otherwise, keeping the inquiry character string unchanged; 2) performing SetBackwardOracleMatching algorithm on the inquiry character string to build an oracle finite automaton of pattern string identification; 3) traversing a file name database and pre-filtering file names stored in the file name database; and 4) performing SBOM algorithm matching on the file names which are pre-filtered in the step 3) in the file name database, and ranking all the inquiry results satisfying the conditions and returning the inquiry results. The method has the advantages of high inquiry speed, support of fast Chinese inquiry, support of fuzzy-pinyin accurate inquiry and the like in mass files.