122 results about "Distributed index" patented technology

Embodiments of a distributed index mechanism for indexing and searching for identity information in peer-to-peer networks. In one embodiment, a distributed index may be used to store identity information in a decentralized manner on a plurality of peer nodes. The identity information may be used, for example, to authenticate users. Distributed indexes may allow identity information to be spread across multiple peer nodes so that the load is spread among the various peer nodes. In one embodiment, the distributed index may be a distributed hash table. One embodiment of a distributed index of identity information may be implemented in peer-to-peer networks implemented according to a peer-to-peer platform including one or more peer-to-peer platform protocols for enabling peer nodes to discover each other, communicate with each other, and cooperate with each other to form peer groups and share network resources.

Embodiments of a distributed index mechanism for indexing and searching for presence information in peer-to-peer networks. In one embodiment, a distributed index may be used to store presence information in a decentralized manner on a plurality of peer nodes. In one embodiment, a notification service may be implemented on top of the distributed index to notify peers of other peers joining a peer-to-peer session. Participating peers may query the distributed index to detect the presence of other participating peers registered in the distributed index. One embodiment of a distributed index of presence information may be implemented in peer-to-peer networks implemented according to a peer-to-peer platform including one or more peer-to-peer platform protocols for enabling peer nodes to discover each other, communicate with each other, and cooperate with each other to form peer groups and share network resources.

Embodiments of a shared resource distributed index mechanism that peers in a peer-to-peer network may utilize to distribute index entries corresponding to resources to indexes of shared resources among one or more other peers. These indexes may be used to direct queries to peers where the queries are most likely to be answered. When a query is received by a rendezvous peer including one or more indexes, contents of the query may be "looked up" in the index to find matches. The results of the lookup may include information on one or peer(s) that may hold advertisement(s) to the resource requested by the query. The query may then be forwarded to one or more peers that may hold the advertisement for the resource. Embodiments may provide "loosely-coupled" distribution of index entries for use in querying for resources in the peer-to-peer network.

Embodiments of a distributed instant messaging system that uses a distributed index in peer-to-peer networks. A distributed index may be used to implement an instant messaging system in a group of participating peers. The distributed index may be used, for example, to route messages between participating peers, in identifying and authenticating peers wishing to participate, in notifying peers of newly joined peers, and in notifying joining peers of participating peers. In one embodiment, zones of the distributed index may be moved to joining peers. In one embodiment, zones of the distributed index stored on departing peers may be moved to participating peers. One embodiment may be implemented in peer-to-peer networks implemented according to a peer-to-peer platform including one or more peer-to-peer platform protocols for enabling peer nodes to discover each other, communicate with each other, and cooperate with each other to form peer groups and share network resources.

Embodiments of a distributed index mechanism for indexing and searching for identity information in peer-to-peer networks. In one embodiment, a distributed index may be used to store identity information in a decentralized manner on a plurality of peer nodes. The identity information may be used, for example, to authenticate users. Distributed indexes may allow identity information to be spread across multiple peer nodes so that the load is spread among the various peer nodes. In one embodiment, the distributed index may be a distributed hash table. One embodiment of a distributed index of identity information may be implemented in peer-to-peer networks implemented according to a peer-to-peer platform including one or more peer-to-peer platform protocols for enabling peer nodes to discover each other, communicate with each other, and cooperate with each other to form peer groups and share network resources.

Embodiments of a shared resource distributed index mechanism that peers in a peer-to-peer network may utilize to distribute index entries corresponding to resources to indexes of shared resources among one or more other peers. These indexes may be used to direct queries to peers where the queries are most likely to be answered. When a query is received by a rendezvous peer including one or more indexes, contents of the query may be “looked up” in the index to find matches. The results of the lookup may include information on one or peer(s) that may hold advertisement(s) to the resource requested by the query. The query may then be forwarded to one or more peers that may hold the advertisement for the resource. Embodiments may provide “loosely-coupled” distribution of index entries for use in querying for resources in the peer-to-peer network.

Embodiments of a distributed instant messaging system that uses a distributed index in peer-to-peer networks. A distributed index may be used to implement an instant messaging system in a group of participating peers. The distributed index may be used, for example, to route messages between participating peers, in identifying and authenticating peers wishing to participate, in notifying peers of newly joined peers, and in notifying joining peers of participating peers. In one embodiment, zones of the distributed index may be moved to joining peers. In one embodiment, zones of the distributed index stored on departing peers may be moved to participating peers. One embodiment may be implemented in peer-to-peer networks implemented according to a peer-to-peer platform including one or more peer-to-peer platform protocols for enabling peer nodes to discover each other, communicate with each other, and cooperate with each other to form peer groups and share network resources.

The invention relates to a database log-based real-time data query method and system. The method comprises the following steps of: obtaining increment log information of a main database; analyzing the increment log information to obtain increment data information and storing the increment data information in a kafka message queue; reading the increment data information from the kafka message queue through druid, and constructing a real-time query index of the increment data information according to a pre-defined index rule; and carrying out real-time data query by utilizing the real-time query index. Through the database log-based real-time data query method, a binlog log of the main data is used as a data source, the kafka is used as the message queue, and the druid is used as a distributed index to carry out real-time query with a query engine, so that the delay of data collection and data query analysis is reduced, the time consumption of data query is reduced from several minutes to a millisecond level, and then the user experience is enhanced.

Embodiments of a distributed index mechanism for indexing and searching for presence information in peer-to-peer networks. In one embodiment, a distributed index may be used to store presence information in a decentralized manner on a plurality of peer nodes. In one embodiment, a notification service may be implemented on top of the distributed index to notify peers of other peers joining a peer-to-peer session. Participating peers may query the distributed index to detect the presence of other participating peers registered in the distributed index. One embodiment of a distributed index of presence information may be implemented in peer-to-peer networks implemented according to a peer-to-peer platform including one or more peer-to-peer platform protocols for enabling peer nodes to discover each other, communicate with each other, and cooperate with each other to form peer groups and share network resources.

The invention provides a creating method of catalogue-grade computer file system snapshot, which comprises: the catalogue that needs to create snap is confirmed; when the catalogue creates the snap firstly, the root index node information of the catalogue work version is added to the snap index list and update the last time point of creating or deleting the snap; a new index node is distributed as the root index node of the creating snap version, and the content of the root index node of the work version is copied to the new distributed index node; the write copy chain list of the work version is copied to the root index node of the new creating snap, and then the write copy chain list content of the work version is deleted; the creating time of snap of the root index node of snap version is set as the present time of the computer system; the root index node of the snap version is linked to the snap chain list of the catalogue. The invention also provides the deleting method of the catalogue-grade computer file system snap and the modifying method of the catalogue work version.

Methods, apparatus, and programming recorded in machine readable memory are provided for the index, search and retrieval of objects on a global network. This inventive system embeds a distributed index in a routing layer to enable fast search. The method provides dynamic insertion, lookup, retrieval, and deletion of participating nodes, objects and associated metadata in a completely decentralized fashion. Nodes can dynamically join and leave the network. This infrastructure can be applied to content networks for publishing, searching, downloading, and streaming.

The invention relates to a distributed index method based on LSH (Locality Sensitive Hashing). The distributed index method comprises the following steps: firstly utilizing a clustering algorithm to cluster mass data sets; then mapping clustering centers to different computational nodes; then mapping original mass picture or video characteristic data to the computational nodes corresponding to the type so that each node can process one type; finally utilizing the method based on p-stable distribution LSH to establish data index on different nodes. In order to reduce the merging time of search results on different computational nodes and improve the quality of the search results, the invention provides two methods to select m types recently for subsequent detailed search. The invention provides a guide for automatically mapping the mass data to the different computational nodes; moreover, according to the method, the detailed comparison times during the search period of the LSH further can be effectively reduced, so that the search of the mass data is more accurate and efficient.

The invention discloses a method for storing and searching mass sensor data and belongs to the field of sensor data. The method comprises the following steps that: two layers of storage frame, which comprise a root node and a plurality of leaf nodes, are established; a receiving server distributes sampling data sent by a sensor to the corresponding leaf nodes; each leaf node stores the historic sampling value of the same monitoring target, which is acquired by the sensor, in an element group of a leaf node database in a uniform form to form a sampling data sequence of the monitoring target; and an overall time and space distributed index and an overall key word distributed index of the two layers of storage frame are established. Quick time and space search and key word search can be supported at the same time through the overall key word index, the overall time and space index and an overall search processing mechanism. Multiple searching types of quick processing are compatible, and the defects that the current time and space database is mainly used for storing relative static space data or relative single time and space data and an efficient heterogeneous data flow representation method is lacked are overcome.

There are provided methods and systems for efficient search in a peer-to-peer network topology. In various embodiments, search methods and systems provide for response times and network traffic that are independent from the number of query terms, thereby producing constant run-time searches and bandwidth hits in a P2P network search implementation. By distributing inverse indexes between peers, and storing with each inverse index a Bloom filter populated with selected keywords, multi-term search and analysis can be conducted on one network node without requiring exchange of posting lists between various network nodes.

Embodiments of the invention provide systems and methods for managing processing, memory, storage, network, and cloud computing to significantly improve the efficiency and performance of processing nodes. Embodiments can implement an object memory fabric including object memory modules storing memory objects created natively within the object memory module and may be a managed at a memory layer. The memory module object directory may index all memory objects within the object memory module. A hierarchy of object routers communicatively coupling the object memory modules may each include a router object directory that indexes all memory objects and portions contained in object memory modules below the object router in the hierarchy. The hierarchy of object routers may behave in aggregate as a single object directory communicatively coupled to all object memory modules and to process requests based on the router object directories.

The present invention provides a contact-type solid-state imaging apparatus which realizes high resolution and high sensitivity, and also implements downsizing and lowering the cost of the contact-type solid-state imaging apparatus. Each pixel includes a protection glass plate, a light-collecting device, a light-receiving device, a semiconductor integrated circuit, a light emitting diode (LED) and a mounting package. The light-collecting apparatus has two kinds of distributed index lens (o lens and convex lens), and Sin (N=2) film, which is a two-stage concentric structure, is embedded in SiO2 (N=1.45) film.

The invention relates to a P2P network technology, in particular to the resource index and discovery method based on distributed hashtable (DHT) in P2P network. Aiming at the defects of incapability of making fuzzy search, low inquiry efficiency and instability of hit ratio for shared resources in P2P network, the invention discloses a P2P network resource-sharing method by multi-keyword technology. The invention utilizes multi-keyword technology to conduct distributed index and discovery of resource so as to release and discover one shared resource via different paths, thus realizing 'fuzzy' search for resources. The invention has the advantage of that fuzzy search can be conducted by multi-keyword so that the resource inquiry efficiency is enhanced greatly. Additionally, with the advantage of the DHT technology, the invention can well conduct distributed storage of resources and can maintain good scalability, reliability and load balance among network nodes.

The invention relates to the field of water conservancy projects, in particular to a total water consumption control-based newsvendor method for the optimal allocation of water resources. The method comprises the following steps: S1, collecting water supply quantity data and water requirement data according to water distribution transferring conditions and demands for water; S2, determining the objective function and the water distributing coefficient through combining with the data collected in the step S1 and taking the comprehensive benefit of the economy, the society and the ecological environment as the maximum goal; S3, forming constraint conditions of the optimal allocation of the water resources according to data conditions in a water resource simulating system; and S4, solving a total water consumption-controlled newsvendor model for the optimal allocation of the water resources. The method disclosed by the invention has the advantages of closely integrating a current social proposition of controlling the total water consumption with dynamic change information of water market price, reflecting the influence of different total water consumption controlling index schemes onthe net income of water users, effectively coordinating relationships among drainage basin water, water demand and total water consumption control and water distributing indexes and according with water consumption characteristics of southern areas with high water consumption intensity.

A distributed index for discovering distributed data sources and computing resources based on predicates on attributes is provided. Proposed is a non-altruistic scheme for indexing distributed data, in which nodes are provided with incentives to cooperate in the referencing of data and the routing of search requests for indexed data. Indexed data is mapped to a dynamic routing graph, in which nodes earn credits each time they route a search request. Participatory nodes along a search request traversal continually modify local routing decisions in a manner necessary to maximize profit. Thus, routing paths as a whole are able to dynamically adapt to changing query workloads and access patterns. Dynamic adaptation also occurs by automatic load-balancing of recipients of frequently routed searches, known as “hot spots”, for frequently request data, “hot items”, as a result of an incentive to replicate the indexing strategy of a more profitable node.

The invention provides a searching system of big data. The searching system comprises a grouping unit, a fragmentation creating unit and a searching unit, wherein the grouping unit is used for dividing an index file of the big data into one or a plurality of source groups; the index file of each source group comprises resource data of the same type; the fragmentation creating unit is used for carrying out fragmentation operation on each source group to obtain index files of a plurality of fragmentations; corresponding index fragmentations are created by using the index file of each fragmentation; the searching unit is used for executing and sending search operation in fragmentation searching files corresponding to the appointed one or multiple index fragmentations to obtain and return a corresponding search result according to a received searching instruction. The invention also provides a searching method of the big data. By using the technical scheme of the invention, a distributed index file searching method is realized, the searching speed is favorably promoted, and the searching efficiency bottleneck problem of the big data of an enterprise is solved.

The invention provides a method for preparing hydroxyl-terminated polybutadiene of low molecular weight. The method adopts butadiene as a monomer, lithium alkylide of aliphatic series which contains silane protecting hydroxyl as an evocating agent, an organic non-polar compound as a solvent, an epoxy compound as an end capping reagent and fluoride as a detaching reagent for protecting groups. Anion polymer technology is adopted and polymerization is carried out at a temperature of 20 to 80 DEG C in the environment of inert gases; a prepolymer obtained goes through acid hydrolysis and a series of hydroxyl-terminated polybutadiene fluid rubber with narrow molecular distribution and controllable molecular weight is obtained. In the process of preparing hydroxyl-terminated polybutadiene polymer of the invention, the polymer does not encounter with a fake gel phenomenon during the process of end capping and detaching protecting group and the polymerization process is easy for control; the micro-structure of molecular chains is adjustable and controllable. The obtained hydroxyl-terminated polybutadiene has a molecular weight distributing index less than or equal to 1.2; the average functionality is close to 2; the cured products of hydroxyl-terminated polybutadiene have extremely good mechanical property and can be applied to the fields of rocket technology, optical fiber communication technology, etc.

The invention relates to a distributed data processing platform. The distributed data processing platform comprises a storage layer, a calculation layer, a query interface, an algorithm library and an application layer, wherein the storage layer comprises a hadoop distributed file system HDFS, an HBase database system and a distributed index system ES; the HBase is built on the HDFS and is used for storing corresponding relationships between microblog identifiers and microblog data; corresponding relationships between microblog key fields and the microblog identifiers are built in the ES; the application layer is used for receiving a processing instruction sent by a user terminal and sending a corresponding query request to the query interface and the algorithm library according to the processing instruction; the query interface and the algorithm library are used for querying the microblog data from the storage layer according to the query request; the calculation layer is used for processing the queried microblog data according to the processing instruction and returning a processing result to the application layer, so that the query speed and analysis efficiency of the distributed data processing platform are improved through cooperation of the HBase and the ES; the requirements of big data of microblogs can be met.

The invention discloses a distributed safe retrieval system, which belongs to the technical field of computer information retrieval, and comprises a user client end which sends out index and retrieval requests to a management server, a management server which distributes indexes and retrieval instructions of a user client end to a retrieval server, and receives processing results and returns to the user client end, an index server which stores distributed ciphertext inverted index, receives index and retrieval instructions submitted by the management server, and returns results, an encryption server which receives the encryption request of the management server, enciphers to index terms and terms according to appointed keys, and returns information after enciphering, and a key matrix which stores encryption keys of index terms and terms. The invention further discloses an index and retrieval method suitable for the distributed safe retrieval system. The invention can achieve highly-effective retrieval and safety requirements of large-scale secret-related documents, simultaneously lowers the risk that ciphertext inverted index suffers statistic attack, and optimizes the communication load of the management server.

The invention relates to a system maintenance time distribution method based on operation decomposition, which comprises the following steps: 1. analyzing tasks, the step of analyzing the tasks comprises distribution request analysis, distribution object analysis, maintenance activity and influence factor analysis, wherein the distribution object analysis is mainly used for determining distributive system levels, functions and structural levels of all components of a device, and a product decomposed into the needed level by the system, namely, a replaceable unit, and mapping systemic functions and structural level diagrams; and the number of the levels is determined by complexity level of the device; 2. obtaining data, obtaining existing data of a distribution object required to be analyzed, namely, data of a similar product, fault frequency data, reachability data, testability data and the like; 3. selecting a distribution method, selecting high-level distribution or low-level distribution according to the stage of product design and the product level; 4. distributing indexes, distributing maintainability indexes of the given product to product units at all levels according to the selected method; 5. analyzing a result, judging whether a distribution result is in line with requirements and is feasible.

One embodiment of the present invention includes a technique for distributing work slices associated with a graphics processing unit for processing. A primitive distribution system receives a draw command related to a graphics object associated with a plurality of indices. The primitive distribution system creates a plurality of work slices, where each work slice is associated with a different subset of the indices included in the plurality of indices. The primitive distribution system scans a first subset of indices to identify a first set of characteristics that is needed to process a second subset of indices. The primitive distribution system processes the second subset of indices based at least in part on the one or more characteristics. Advantageously, because multiple work slices are analyzed in parallel for duplicate indices, the time required to analyze work slices is more in balance with the time required to process the work slices, leading to greater utilization of GPU resources and improved overall performance.

The invention relates to a distributed index time varying slip mode posture cooperation tracking control method and belongs to the technical field of spacecraft formation flight. The method comprises: by establishing a posture kinetic equation in a form of Euler-langrage, selecting index time varying slip mode surface function, calculating a synchronization expectation posture for each spacecraft, and according to the design idea of a time varying slip mode controller, designing a distributed posture cooperation tracking controller so as to enable aircrafts to perform cooperation tracking on the expectation postures and have higher robustness in terms of extraneous interference and inertia uncertainties. Compared to conventional slip mode control, a time varying slip mode enables the phase trajectory of a system to always remain at a slip mode surface, so that in the posture cooperation process of the formation spacecrafts, even if communication is limited and a topology structure needs to be changed, the posture cooperation tracking of the spacecrafts can still be realized.

A distributed index for discovering distributed data sources and computing resources based on predicates on attributes is provided. Proposed is a non-altruistic scheme for indexing distributed data, in which nodes are provided with incentives to cooperate in the referencing of data and the routing of search requests for indexed data. Indexed data is mapped to a dynamic routing graph, in which nodes earn credits each time they route a search request. Participatory nodes along a search request traversal continually modify local routing decisions in a manner necessary to maximize profit. Thus, routing paths as a whole are able to dynamically adapt to changing query workloads and access patterns. Dynamic adaptation also occurs by automatic load-balancing of recipients of frequently routed searches, known as “hot spots”, for frequently request data, “hot items”, as a result of an incentive to replicate the indexing strategy of a more profitable node.

The invention relates to an ocean big data master-slave index system and method based on a Spark cloud network. The ocean big data master-slave index system and method are particularly suitable for ocean big data which have the advantages of space autocorrelation, high similarity, real-time performance and the like. The big data age internet of things, the cloud calculation and other technologies are applied to the field of distributed indexes, the internet of things serves as an antenna for ocean information collection, data division strategies are designed and the data are deployed and saved to all pieces of physical cloud in a distributed mode on the basis of the clustering thought, rapid and one-stop calling of the multi-source ocean data is achieved through the combination with a multi-layer master-slave index structure, and the requirements for high-performance calculation, strong real-time feedback, high-frequency inquiry and the like in various offshore pre-warning and emergency models are met. According to the system and the method, on the basis of physical cloud storage, the millisecond-grade inquiry response requirements are ensured, and therefore rapid and real-time disaster inversion and pre-warning are rapidly focused, and the digitalization and intellectualization progresses of ocean disaster prevention and reduction and the like are accelerated.

The invention discloses a distribution transformer health state evaluation method based on real-time operation information. The method comprises the following steps: step 1, selecting evaluation indexes, i.e., selecting a load rate, a voltage bias, a three-phase imbalance degree, a harmonic total distortion rate as the evaluation indexes; step 2, quantifying the indexes, i.e., calculating a health state reduced score of each index, and accordingly, according to Si=100-SDi, obtaining a health state score Si of each index; step 3, distributing index weights, i.e., calculating a weight of each index by use of a weight varying method; and step 4, calculating a state evaluation score, i.e., after the weight of each index is obtained, calculating a health state integrated score S<operation> of a distribution transformer according to a formula indicated in the descriptions. According to the invention, the real-time operation information is taken as an evaluation index for combination with an existing state evaluation technology, such that the defect of timeliness of a conventional maintenance technology is made up for, and the health state of the transformer is reflected more timely.

The embodiment of the invention discloses a malicious clicking behavior detection method and device. The method includes the steps that a streaming treatment mode is adopted for obtaining clicking behavior information, collected by a terminal, of a web page; according to a distributed index relation, the clicking behavior information of the web page is stored on a corresponding target node, wherein the distributed index relation describes corresponding relations between all web pages and all nodes; all the clicking behavior information, stored on the target node and within the closest set time window, of the web page is searched for, and according to the search result, whether a malicious clicking behavior of the web page exists or not is detected in real time. According to the technical scheme, the problem that through an existing post-event analysis detection mechanism, a merchant can not learn about the malicious clicking behavior, performed on an own website, of a lawbreaker in time is solved, good detection real-time performance is achieved, and better user experience is achieved.