Abstract: An in-memory graph query runtime is integrated inside a database management system and is capable of performing simple patter-matching queries against homogeneous graphs. The runtime efficiently combines breadth-first (BFS) and depth-first (DFS) neighbor traversal algorithms to achieve a hybrid runtime that takes the best from both sides. As a result, the hybrid runtime is able to process arbitrarily large queries with a fixed amount of memory, optimizing for memory locality.

Abstract: A computer-implemented method of processing user provided information from a plurality of users in a digital network for ranking one or more information modules is described, which involves causing at least one processor to store in memory user assessment weights, each associated with a user of the plurality of users and representing a weight to be applied to information module assessments, receive a proxy nomination message, change the user assessment weight associated with the proxy user based on the proxy nomination message, for one or more information modules: receive information module assessments, generate weighted assessments, each based on one of the information module assessments received and a user assessment weight, aggregate the weighted assessments to generate an aggregated weighted assessment, and rank a set of the plurality of information modules based at least in part on the aggregated weighted assessments. Apparatuses, systems and computer readable media also described.

Abstract: The present disclosure relates to a data search method and a data search system thereof. The data search method includes steps of: receiving a first learning content data, wherein the first learning content data includes multiple first learning sections; analysing the first learning content data by a way of Natural Language Processing to search multiple first keyword strings corresponding to each of the first learning content data; receiving a search message; analysing the search message by the way of Natural Language Processing to generate a search string; comparing the search string with the first keyword strings; and generating a search list according to the first learning section, which corresponding to the first keyword string that matches the search string.

Abstract: A query enhancement system for constructing an elastic field based on a time delay, including: dividing a network node to obtain a set of containers composed of several containers, wherein the containers are nested and each container includes a management node for performing node organization, neighbor maintenance and query services within the container. Further, a query enhancement method for constructing an elastic field based on a time delay includes: carrying out same-layer non-intersection full-coverage division on a network node to obtain a set of containers that are nested, and execute a query flow without a given low time delay requirement which uses an existing query technique and a nearby query flow with a given low time delay requirement which uses a distributed nearby querying method to carry out a nearby query; with an actual query time delay index Ti less than the requirement of an upper time delay limit Ts.

Abstract: A modeling system has a database that: stores information of resources of a computer network service. A server f has a graphical user interface application for creating and editing service models. The application receives user-entered search criteria and searches information in the database based on the criteria. The search criteria can include a name, type, attribute, and other information of the resources. In addition, the search criteria can be a user-entered search query entered that has one or more logical or Boolean conditions relating resource attributes to attribute values. Using information obtained through searching, the application is used to create at least a portion of a service model of the computer network service. Once created, the application is used to initiate publishing of at least a portion of the service model to one or more impact managers of the computer network service.

Abstract: A computer implemented method is provided for determining a delay between a first database and an associated replicated database by replicating transactions of the first database in the replicated database, determining a delay between the two databases based on a commit timestamp from the first database and a timestamp associated with the commit transaction becoming visible in the replicated database. Then, after a predefined period of time has elapsed since replicating the commit transaction, determining a second delay based on a timestamp associated with a heartbeat log and a replicated database system time. And, selectively determining to execute or deny a statement received by the replicated database based on the second delay. Related apparatus, systems, techniques and articles are also described.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: Operating a low-latency database analysis system using domain-specific chronometry may include obtaining, in the low-latency database analysis system, data expressing a usage intent with respect to the low-latency database analysis system, in response to obtaining the data expressing the usage intent, obtaining ontological data for a chronometric object in the low-latency database analysis system indicated by the data expressing the usage intent, identifying a chronometry dataset from a plurality of chronometry datasets, wherein the plurality of chronometry datasets includes a domain-specific chronometry dataset and a canonical chronometry dataset, obtaining results data in accordance with the chronometry dataset and the chronometric object, generating output data representing the results data in accordance with the chronometry dataset, and outputting the output data for presentation via a user interface.

Abstract: In various example embodiments, a system and method for versioning data in an unstructured data store are presented. The method includes generating a first record in the unstructured data store based on a version of a second record in the unstructured data store. The method further includes initializing a parent version identifier of the first record based on the version of the second record. The method further includes comparing the parent version identifier of the first record to a version identifier of the second record. The method further includes determining whether the first record is consistent based on the comparison.

Abstract: A search result providing method implemented in a computer includes providing a search result screen including a search result of a first keyword in response to a search request for the first keyword, and additionally providing a search result of a second keyword on the search result screen in response to a search request for at least one second keyword different from the first keyword.

Abstract: Various methods and systems for selectively and securely sharing user data to a facility in order to accommodate the specific needs of the user. The methods further correspond to receiving, from a computing entity, geographic location information corresponding to the geographic location of the computing entity which is associated with the user and transmitting a notification to the computing entity of a facility in proximity to the geographic location of the computing entity. The methods further include receiving, from the facility, a request for user data associated with the user of the computing entity that is applicable to the facility, generating a proposed user dataset in response to the request that satisfies the facility-specific user data parameters and transmitting the proposed user dataset that meets the facility-specific user data parameters for sharing with the facility when a relevance score exceeds a relevance threshold value and the sharing eligibility is approved.

Abstract: A method is provided for performing transaction processing in a system that includes a plurality of nodes. Each of the nodes include a processor, an application executing in the processor, and an instance of a database used by the application. Each node executes transactions. At least two of the nodes are selected to receive the same request to process a transaction, and the processor at each of the at least two nodes executes the same request to process a transaction. Each of the at least two nodes replicates the steps and operations of the transactions to one or more other nodes in the system. The processor at the one or more other nodes compares the replicated steps and operations of the transactions that were received from each of the at least two nodes and executes one or more remediation actions when the result of the comparison indicates that the replicated steps and operations of the replicated transactions do not match each other.

Abstract: System and method for creating group snapshots of multiple storage objects uses storage structures to store the storage objects in a storage system. In order to create a group snapshot of storage objects, a prepare snapshot process is executed at each of multiple host computers managing the storage objects as storage structures to block input and output operations on the storage objects stored in the storage structures. A commit snapshot process is then executed at each of the multiple host computers to create snapshots of the storage object in the respective storage structures. In addition, the snapshots of the storage object are recorded in the respective storage structures as snapshot entries in the respective storage structures.

Abstract: A novel distributed graph database is provided that is designed for efficient graph data storage and processing on modern computing architectures. In particular a single node graph database and a runtime & communication layer allows for composing a distributed graph database from multiple single node instances.

Abstract: The present invention pertains to enhancement or refinement of estimated locations based upon user-specific information. Upon user authorization, geographical information is extracted from a number of user-related sources, including the web browser history, search history, maps history, address book, e-mail archives and calendar entries. Such information is used to build a spatial index of specific physical locations for a geocoded result set. From this, heat maps identifying particular locations from the user-related sources are created for different periods of time. The heat maps may be used to refine an initial location estimate of the user. This may be done by determining whether one or more positions in a given heat map provide a more accurate position of the user than the initial estimate. If so, a best position is selected. This can be used to provide enhanced driving directions to the user.

Abstract: A system for low latency caching of time-sensitive data is disclosed. The system comprises a database, one or more processors, and non-transitory memory. The non-transitory memory comprises instructions that cause the one or more processors to divide a table of the database into a plurality of logical partitions; during a first interval of time, insert new records exclusively into a first partition of the plurality of logical partitions; during a second interval of time, insert new records exclusively into a second partition of the plurality of logical partitions; during a subsequent interval of time, determine that a predetermined period of time has passed since conclusion of the first interval of time; and responsive to the determination that the predetermined period of time has passed, delete records from the first partition without changing contents of the second partition or any other partition of the plurality of logical partitions.

Abstract: Disclosed are examples of systems, apparatuses, methods and computer program products for maintaining flows to manage tasks assigned to a user of a database system. Further disclosed are examples of systems, apparatuses, methods and computer program products for sharing execution logic, including but not limited to running instances of flows, across different users of a database system.

Abstract: Automated digital asset tagging techniques and systems are described that support use of multiple vocabulary sets. In one example, a plurality of digital assets are obtained having first-vocabulary tags taken from a first-vocabulary set. Second-vocabulary tags taken from a second-vocabulary set are assigned to the plurality of digital assets through machine learning. A determination is made that at least one first-vocabulary tag includes a plurality of visual classes based on the assignment of at least one second-vocabulary tag. Digital assets are collected from the plurality of digital assets that correspond to one visual class of the plurality of visual classes. The model is generated using machine learning based on the collected digital assets.

Abstract: Systems and methods for providing data exploration techniques are provided. For instance, user inputs specifying one or more data parameters can be received. One or more data sets can be obtained from a data source based at least in part on the data parameters. The data can be grouped into one or more groupings based at least in part on the data parameters. Each data grouping can have a plurality of subsets. A distribution of data can be determined for each data subset. A plurality of data representations can be generated based at least in part on the data parameters and the distributions of data. The distributions of data for each data subset can then be compared. One or more suggested applications or at least one data subset can be determined based at least in part on the comparison.

Abstract: Application behavior is analyzed to determine relationships between data. Database objects accessed by an application are identified. Then, one or more relationships between the identified database objects are determined based on one or more from a group comprising statements of the application referring to the identified database objects and sets of the identified database objects accessed by different modules of the application.