Abstract: A method of event based object ranking is described. An object query is computed based upon a user action. The results of the query are ranked based on one or more events associated with objects in the results to create ranked results. The ranked results are provided to the user in response to the query.

Abstract: A system provides emotionally and intellectually relevant responses to user queries received by a chatbot instantiated by a computing device. The system also receives user data associated with the user query. The user query is communicated to a first supervised machine learning model to obtain a first plurality of ranked responses. The system also communicates the received user data to a second supervised machine learning model to obtain a first plurality of emotions associated with the user data. The system then determines determine a second plurality of emotions for the first plurality of responses and re-ranks the first plurality of responses based on a comparison of the first plurality of emotions and the second plurality of emotions. The system then selects a response to the user query from the re-ranked responses and outputs the selected response using the chatbot instantiated by the computing device.

Abstract: Disclosed herein are system, method, and computer program product embodiments for interactive exploration of graph data. An embodiment operates by compiling a data query in any database-readable language based upon an input parameter. A data query of a graph data set is then conducted but is halted when a breakpoint generated from the input parameter is reached. Halting the data query includes partitioning a data subset from the graph data set. The data subsets is then displayed.

Abstract: A bitmap-based storage space management system and methods thereof are provided, which realize divisible storage blocks that a small block is distributed when storing a small data object and a large block is distributed when storing a large data object. Through a two layer structure of index bitmaps and state bitmaps, a management of a storage space is realized. The index bitmaps comprise a main resource index bitmap (11), a large block index bitmap (12), a sub-resource index bitmap (13) and a small block index bitmap (14). The state bitmaps comprise a resource state bitmap (21) and a distribution state bitmap (22). Through the resource and distribution state bitmaps, the storage space is described respectively as an unoccupied divisible state, an occupied divisible state and an occupied indivisible state. In an above storage space structure, large block distribution, small block distribution, large block release and small block release are realized.

Abstract: Systems and methods described herein generally relate to storing and verifying data. In some embodiments, reference levels are generated according to time intervals, where the first reference level comprises a predetermined number of the time intervals, and where each of the time intervals of the remaining reference levels is comprised of a predetermined number of the time intervals of a previous reference level. Hashes of data can be created at the first reference level by performing a hashing function on the data in a time-sequenced manner. First reference level time interval hashes may be generated by performing the hashing function on the hashes of the data at each of the time intervals of the first reference level. Hashes for remaining reference level time intervals can be generated by performing the hashing function on the hashes of each of the time intervals of the previous reference level.

Abstract: Universal, automatic file conversion may be provided by a universal file conversion system or application. An input file may be received by the universal file conversion system. An input file type for the input file and a recipient of the input file may be determined. Programs available to the recipient for accessing a file may be determined. A target file type accessible to the recipient may be determined for converting the input file. A sequence of file conversions to convert the input file to the target file type may be determined. The input file may be converted to the target file type based on the sequence of file conversions. The converted file may be provided to the recipient. The recipient may return the converted file, and the converted file may be automatically converted back to the original input file type and provided to the original source of the input file.

Abstract: Techniques and solutions are described for facilitating the installation of software application extensions in a multi-tenant environment. A package for an extension may include code for a plurality of objects of the extension. Extension objects can be generated or non-generated. Generated objects can be user modifiable or not user modifiable. A software-implemented classification assistant can examine properties of the objects and classify them for deployment to a shared container or prompt a user to select whether an object should be deployed to the shared container or to a tenant-specific container. Properties of objects in the shared container may be set by the classification assistant such they are not modifiable by tenants.

Abstract: Methods and systems are disclosed for enumeration of trees in a database environment. Temporary copies of trees are stored in a database accelerator environment, for efficient access by software programs operating within the database layer. Multiple trees can be enumerated concurrently using level-by-level traversal. Nodes are assigned sortable indices through which a tree structure is maintained. Enumeration supports linking from a node of a parent tree to a child tree stored separately. Enumeration supports synthesizing child nodes in order to satisfy constraints on a parent node. Filtering and sorting are supported. The disclosed technology provides unexpectedly superior results, and can be applied in many fields. Variants are disclosed.

Abstract: The invention provides a scientific computing process management system. The system includes a basic data presentation layer for storing and presenting business models, a case service module for providing addition, deletion, checking, and changing as well as task submission and data analysis triggering of a case contained in an interface, computing service modules released as a packaged based image and called through a task scheduling system, a resource statistic service module for providing computing resource consumptions statistics accurate to a task level, a persistent layer for persisting data, an audit module for performing audit work on universal data changes and performing backtracking when data is in an unexpected state, a real-time sync module for performing data synchronization in real time together with the task scheduling system, an async communication module for processing computing service communication and an async analysis module for performing analysis in a pushing process of a case.

Abstract: Systems and methods for interest-driven data visualization systems are illustrated. The system includes a processor and a memory configured to store an interest-driven data visualization application. The application configures the processor to obtain reporting data including a plurality of datasets from an interest-driven business intelligence server system; generate visualization rendering data for the datasets based on associations between visualization metadata and the datasets; and generate visualization image data based on the visualization rendering data. The visualization image data is displayable using and includes visual representations of at least a portion of the reporting data. Pieces of the visualization image data correspond to master and slave visualizations.

Abstract: Described are techniques for reducing inaccurate values in databases by managing the order in which processes are enqueued and executed. A modification process to modify a first value in a database may be received. A precomputation process that modifies values dependent on the first value may be enqueued prior to enqueuing of the modification process to ensure that the modification process does not occur if the precomputation process fails. The modification process may be executed prior to executing the precomputation process to ensure that the precomputation process acts to modify the dependent values using the modified version of the first value.

Abstract: Methods, systems, and computer programs are presented for structuring a database to support multiple partitioning orders at the storage layer. One method includes an operation for identifying partitioning fields for a database that is stored distributed across computing devices, where each computing device stores an extent that holds a subset of entries from the database. For each partitioning field, the database entries are stored in extents associated with the partitioning field, the database entries in the extents for the partitioning field being organized based on the value of the partitioning field. Further, the method includes operations for receiving a database query that includes a filter based on values of a selected partitioning field, and for retrieving the data for the database query from one or more of the extents associated with the selected partitioning field. The retrieved data is returned for the database query.

Abstract: Systems and methods for synchronizing database operations with a distributed blockchain are disclosed. The database operations are performed on a database that is shared between multiple users including a first user. Exemplary implementations may: receive database information reflecting one or more database operations performed by the first user on a first version of the database; verify whether the one or more database operations are allowed to be performed by the first user; record on the distributed blockchain, responsive to the verification being affirmative, a message that describes or refers to a description of one or more modifications to the database; effectuate transmissions of notifications to the first version of the database; subsequent to the transmissions, propagate or revert the one or more database operations, based on the verification result.

Abstract: Provided are systems and methods for storing checkpoints of an in-memory storage device. In one example, the method may include detecting database transactions performed on a slice of an in-memory storage and storing a record of the database transactions in a log file, receiving a request to persist the slice of in-memory storage, the request comprising a timing indicator corresponding to a timing of database transactions, trimming the log file based on the timing indicator to remove a record of one or more database transactions from the log file that occurred prior to the timing indicator and to preserve a record of one or more database transactions that occurred after the timing indicator, and persisting, to disk, data from the slice of in-memory storage and the trimmed log file preserving the record of the one or more database transactions that occurred after the timing indicator.

Abstract: A database search system ensures the privacy of a search request and the security of a database with high processing efficiency. The system comprises a database server residing on a network that stores predetermined data, and a client terminal issuing to the database server a search request for inquiring for desired data while keeping the desired data secret. The database server further comprises: a database storing predetermined data; and a search response message generation unit for receiving through a network the data search request in which data to be searched for is kept secret, searching the database by a predetermined computation based on the search request and a list of the data stored in the database while a data item involved with the search request is kept secret, and generating a response to the search request.

Abstract: System and methods are provided for parallel geospatial clustering. A link tile association is determined between one or more links and a tile of a plurality of tiles. Map matched geospatial data is acquired for the tile based on the link tile association. A family of links is generated from the one or more links. A cluster of the map matched geospatial data is identified that is at least partially associated with the family of links. The cluster is determined to be centered on a link of the family of links that originates in the tile. The cluster is assigned to the tile. The cluster is reported for aggregation with other clusters from other parallelized processes.

Abstract: A computer system is configured to provide a database system. The computer system comprises one or more processors, a primary database system implemented by the one or more processors, and a secondary database system implemented by the one or more processors. The secondary database system is configured as a hot-standby system for the primary database system. The secondary database system is capable of providing at least a minimum amount of essential functionality of the primary database system during a disruption to the primary database system. The secondary database system is configured by programming instructions, executable on the computer system, to cause the one or more processors to accept an authentication request from the client application to allow user access to the secondary database to execute the query and delegate an authentication check to the primary database system using connection credentials received from the client application.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer-readable storage medium, for evaluating a creative. Methods can include identifying one or more selection keywords that are associated with a creative. Matching criteria can be identified for comparing the selection keywords and the request keywords. The matching criteria can be defined by a range from an exact match to a broad match and include a matching threshold in the range. A bid modifier associated with the matching criteria can be established. The bid modifier can modify a bid associated with the creative based on an extent of a match determined between the selection keywords and the request keywords for a given content request. The creative responsive to received content requests can be evaluated based on the matching criteria and the bid modifier.

Abstract: Systems and methods are provided to implement a polling process for monitoring a system of interdependent hardware components. A shared aggregate state data structure comprising information of an aggregate state of the interdependent hardware components is maintained in a system memory. A poller loop process generates and utilizes two local instances in system memory of the shared aggregate state data structure, including a current state data structure and a previous state data structure. The current state data structure is utilized during a lock-free polling routine to store current aggregate state data of the interdependent hardware components, while other executing threads outside the poller loop process can access the shared aggregate state data structure. The shared aggregate state data structure is updated by performing a merge of state information contained in the shared aggregate state, current aggregate state, and previous aggregate state data structures.

Abstract: Disclosed herein are systems, methods, and devices for testing deduplication repositories. Methods may include identifying a storage location based on a request for one or more data values associated with a read-only file system, where the read-only file system is a simulated file system, and where the storage location is identified based on a plurality of request parameters included in the request. The methods may also include generating, using a processor and responsive to the request, the one or more data values based on the plurality of request parameters and a plurality of configuration parameters, where the plurality of configuration parameters enable deterministic generation of all data values stored in the tile system. The methods may further include returning the one or more data values as a result of the request.