In an example embodiment, a local search of non-local search results is introduced such that when an initial call is performed, the entire list of non-local search results is saved locally on the mobile device. When subsequent searches are to be performed after additional characters are typed in a search box, these subsequent searches are performed on the list of non-local search results that has been saved locally. As long as a preset, threshold number of matching search results is found from the list of non-local search results that has been saved locally, no additional calls to the server need to be made. If at any point the number of matching search results found from the list of non-local search results that had been saved locally falls below the threshold, then a call to the server is made for a refreshed list of non-local search results.

Systems and methods for visualizing and manipulating graph databases in accordance embodiments of the invention are disclosed. In one embodiment of the invention, a graph database manipulation device includes a processor and a memory configured to store a graph database manipulation application, wherein the graph database manipulation application configures the processor to obtain a graph database including a set of nodes and a set of edges, determine a source node within the set of nodes, locate a set of related nodes based on the source node and the set of edges, recursively locate a set of sub-related nodes based on the set of related nodes and the set of edges, generate a representation of the set of related nodes from the perspective of the source node, and recursively update the generated representation of the set of sub-related nodes from the perspective of the source node and the related nodes.

A data structure and its characteristics, and an associated process for searching the structure in a manner that ensures that each node or data location is traversed regardless of which node is the starting point of the traversal process. An embodiment of the invention may be used to locate a node of a data structure so that it may be processed or otherwise manipulated, such as by eliminating a node, moving a node, processing the data associated with a node, etc. In some embodiments, a combination of a “loosely associated” data structure and a specified method of traversing the data structure provide an efficient way to structure and administer a database, and provide a scalable and computationally efficient solution to the problems posed by conventional and more “tightly associated” structures.

A distributed computing environment data store management system includes a computer-based system for identifying a subset of element records in a data store associated with the elements of a distributed computing environment, receiving at least one user-defined data element from a user interface. Using the user-defined data element, the system adds the user-defined data element to each of the subset of element records, and stores each of the subset of element records and their associated user-defined data in the database.

A multidimensional data process method and device thereof are disclosed in the present embodiments. The method comprises: obtaining attribute information in dimension information and hierarchical relationship information of respective attributes in a data service, and generating a recursive topology; and the recursive topology comprises an attribute composition set and recursive paths of respective attribute compositions in the attribute composition set; confirming attribute compositions for querying in the attribute composition set; confirming attribute compositions for fixing in the attribute composition set according to the attribute compositions for querying; fixing the attribute compositions for fixing to form fixed attribute compositions and obtaining index data in accordance with the fixed attribute compositions; recursing index data in accordance with the attribute compositions for querying. The present invention is applied to the multidimensional data analysis.

To make it possible to prevent leakage of sensitive information from a database without using a server having both secure operation management and a high database operation processing capability. An intermediate server includes: a cryptography processing unit that encrypts or decrypts data stored in a database; a query conversion unit that converts a query to the database into a first query that does not need processing by the cryptography processing unit and a second query that needs the processing by the cryptography processing unit; and a query processing unit that sends the first query to a database server connected to the database to acquire a result from the database server, and executes the second query using the cryptography processing unit.

A method includes generating, by a processor of a computing device, an output set of models corresponding to a first epoch of a genetic algorithm and based on an input set of models of the first epoch. The input set and the output set includes data representative of a neural network. The method includes determining a particular model of the output set based on a fitness function. A first topological parameter of a first model of the input set is modified to generate the particular model of the output set. The method includes modifying a probability that the first topological parameter is to be changed by a genetic operation during a second epoch of the genetic algorithm that is subsequent to the first epoch. The method includes generating a second output set of models corresponding to the second epoch and based on the output set and the modified probability.

One or more embodiments interpret a configuration graph to efficiently and optimally construct requests and fetch data from a datastore. The values of objects of a requested data type are used to generate additional queries for pre-fetching data from the datastore. Specifically, the values are used to query for and retrieve a corresponding subset of objects of another, related data type. Recursively querying for and retrieving objects of related data types based on already retrieved objects builds a data cache of relevant objects. The cached, relevant objects may be useful in subsequent queries that are likely to follow the initial query.

The disclosed technology addresses the need in the art for a content management system that can be highly flexible to the needs of its subjects. The present technology permits any object to be shared by providing a robust and flexible access control list mechanism. The present technology utilizes a data structure that is highly efficient that both minimizes the amount of information that needs to be written into any database, but also allows for fast reads and writes of information from authoritative tables that are a source of truth for the content management system, while allowing for maintenance of indexes containing more refined data that allow for efficient retrieval of certain information that would normally need to be calculated when it is needed.

Methods and systems for data management are described, particularly for processing global queries. Each global query includes a user-defined query constraint value, such as laxity or query response time limit. The query receiving node maintains a copy of the previously updated data from all of its children node. The query receiving node first searches for the requested query data in its local data storage to minimize children node query. If any portion of the requested data in the local data storage fails to meet the query constraint value, then the child node from which the data came from is tasked with recursively executing the global query.