Abstract: A method for validating a query result for a query of a database uses an index of the database. A selection of a set of source data from the database is received and a first hash operation is performed on the source data in the database resulting in a database hash value for the source data. A second hash operation is performed on the source data in the index resulting in an index hash value. The index hash value is compared with the database hash value, and a guarantee indication is provided for the source data in the index.

Abstract: The present invention discloses an efficient storage method for time-series data, comprising: storing time-series data collected by each data sampler and static attribute data of its data sampler separately; when each time series is stored, based on a unique ID of each time series, storing corresponding time-series data; and when the static attribute data is stored, the static attribute data are stored in another database independently, wherein each data sampler saves one corresponding record in a database storing the static attribute data. According to the present invention, the storage space can be saved, the processing efficiency and the processing speed can be improved, and the query processing can be flexibly carried out.

Abstract: A high-performance distributed ledger and transaction computing network fabric over which large numbers of transactions (involving the transformation, conversion or transfer of information or value) are processed concurrently in a scalable, reliable, secure and efficient manner. In one embodiment, the computing network fabric or “core” is configured to support a distributed blockchain network that organizes data in a manner that allows communication, processing and storage of blocks of the chain to be performed concurrently, with little synchronization, at very high performance and low latency, even when the transactions themselves originate from distant sources. This data organization relies on segmenting a transaction space within autonomous but cooperating computing nodes that are configured as a processing mesh. Each computing node typically is functionally-equivalent to all other nodes in the core.

Abstract: Cloud-based data loss prevention (DLP) systems and methods include monitoring a file to be checked for sensitive data from a user associated with a tenant; obtaining one or more dictionaries for the tenant; identifying a DLP match based on any of identifying exact document matches between the file and files in the one or more dictionaries, identifying same text in the file as in an indexed document in the one or more dictionaries, identifying content in the file that contains a subset of text in an indexed document in the one or more dictionaries, and identifying content that is similar but not exact as the text in an indexed document in the one or more dictionaries; and, responsive to the DLP match, blocking the file in the cloud-based system.

Abstract: Described herein are systems and methods for transaction identification (ID) generation in transaction-based environments. The systems and methods provided generated transaction IDs which inherently define a range of values (a range of blockchain heights) within which the transaction is valid. This obviates problems associated with traditional transaction ID databases where a transaction ID only comprises a hashed value. That is, the presently disclosed systems and methods are an improvement over traditional hashing schemes as in traditional hashing schemes, a server must traverse an entire transaction ID database to determine if an incoming transaction is valid.

Abstract: Embodiments use a visual cue to identify a record with missing information among a plurality of hierarchical records. Each record includes a parent field and an associated records field. An entry in the parent field identifies a parent record of a given record. An entry in the associated records field identifies records that are associated with the record based on a criterion or one or more predetermined criteria. For a selected record, a first group of records are identified based on the parent field of the selected record. The entries in the associated records field of the selected record are then compared to the first group of records. A missing record missing an entry in the associated records field is identified among the first group of records. When the first record and the first group of hierarchical records are graphically represented on a target output medium, the missing record is represented using a visual cue.

Abstract: An apparatus comprises a first processing node configured to participate in a consensus protocol with a plurality of additional processing nodes. The first processing node is further configured in conjunction with its participation in the consensus protocol to implement repeated polling of respective selected subsets of the additional processing nodes, to resolve a state for a given transaction to a particular one of a plurality of possible states for the given transaction responsive to results of the repeated polling; and to initiate at least one automated action based at least in part on the resolved state for the given transaction. In some embodiments, the first processing node utilizes the results of the repeated polling to maintain a directed acyclic graph or other data structure of transactions that characterizes relationships between the given transaction and a plurality of other transactions.

Abstract: A method of storing semi-structured data includes receiving user data from a user of a query system where the user data includes semi-structured user data. The method also includes receiving an indication that the semi-structured user data fails to include a fixed schema. In response to the indication that the semi-structured user data fails to include the fixed schema, the method further includes parsing the semi-structured user data into a plurality of data paths and extracting a data type associated with each respective data path of the plurality of data paths. The method additionally includes storing the semi-structured user data as a row entry in a table of a database in communication with the query system wherein each column value associated with the row entry corresponds to a respective one of the plurality of data paths and the data type associated with the respective data path.

Abstract: Systems and methods are provided for determining an alias file that defines aliases for one or more datasets. At least one Structured Query Language (SQL) query that includes one or more aliases defined in the alias file can be determined. The at least one SQL query can be translated to a corresponding executable SQL expression. The corresponding executable SQL expression can be executed.

Abstract: Systems and methods are provided for optimizing data storage and improving the speed of data retrieval in a data store, such as a storage server connected to a large network through the use of bucketing techniques to create efficient data structures for storing received key-value datasets at one or more storage servers. Fast key-value read requests and key-value retrievals may be accomplished through the use of multiphase lookup operations on the one or more storage servers. The system is optimized for best performance of retrieval through the separation of the write and read mechanisms. Systems and methods provided herein control the level of wastefulness on the back end of a system and reduce read operation inefficiencies on the front end of a system.

Abstract: A size associated with a first content file is determined to be less than a threshold size. In response to determining that the size associated with the first content file is less than the threshold size, a combined metadata structure is updated at least in part by combining metadata of the first content file with metadata of a second content file in the combined metadata structure. A snapshot tree is updated to reference a first portion of the combined metadata structure corresponding to the first content file and to reference a second portion of the combined metadata structure corresponding to the second content file.

Abstract: A method includes providing a server including a memory and a processor coupled to the memory; defining a plurality of databases in the memory, the databases including fields for respective client matters, and the databases including a plurality of notes for respective matters, the notes including text, and the databases including a plurality of buzzwords; associating respective buzzwords with descriptive pages; generating a user interface including a text editing screen area in which a user can type text for a note, the text including a plurality of terms; comparing terms to the buzzwords and, in response to a term matching a buzzword, indicating that the matching term is a buzzword in the user interface. Other systems and methods are also provided.

Abstract: A method for determining a competitive relation of Points of Interest (POI), and a device are provided in the present disclosure. The specific implementation includes: determining POI representation data between two target POIs based on service-related data of the target POIs; and determining a competitive relation between the target POIs based on the POI representation data.

Abstract: A computer-implemented method for recalling user-specific interactions is disclosed. User-specific application data for each of a plurality of different computer application programs is received at a computing system. The user-specific application data is translated into different content vectors representing different user-specific interactions between a user and one or more other users while using the plurality of different computer application programs. Each content vector includes parameters quantifying interaction attributes of the corresponding user-specific interaction. The content vectors are mapped to a high-dimensional content space. A query is received at the computing system and translated into a query vector. Geometric mathematical operations are performed to compare content vectors in the high-dimensional content space to the query vector to identify a content vector that correlates to the query vector.

Abstract: The subject invention functions to use available data and information to automatically create narrative stories that describes domain events, circumstances and/or entities in a comprehensible and compelling and audience customized, manner. Computer executable instructions provide for generating a narrative story using standard and uniform structures and data for receiving domain related data and a story specification, parsing the story specification to provide constituent components, transforming the constituent components into executable code, instantiating content blocks having at least one feature for the domain according to the story specification and rendering the narrative story using the constituent components specified by the content blocks.

Abstract: A method for reducing a storage of duplicated documents is provided. Methods may include hashing each document stored in the centralized data repository by executing a hashing algorithm on the document, outputting a hash-value and adding the hash-value and a hash pointer to a hash table. Methods may further include crawling the hash table to identify duplicate hash-values. For each hash-value recorded on the hash table two or more times, methods may include combining two or more duplicate hash-values into a cluster and for each cluster identifying, on the hash table, a unique hash-value. For the unique hash-value, methods may include maintaining the unique hash-value on the hash table and maintaining the document corresponding to the unique hash-value in the memory address. For each remaining duplicate hash-value stored in the cluster, deleting the corresponding document from the memory address and store the reference pointer at the memory address.

Abstract: Systems and methods are disclosed that receive a search request with one or more data items to search against filters. Masked versions of the data items are generating using a first predetermined algorithm. The masked versions can be transmitted to another computing device to be secured. Query data can be generated by applying a second algorithm to the secured version of the data items. The query data can be transmitted to a storage system to query the filters to identify search results.

Abstract: A computer-implemented method selects an access path for high cost and/or complex queries. The method includes building a classification model configured to identify a lowest cost access path. The method further includes receiving a query, where the query is configured to retrieve a set of data from a database. The method also includes generating an access map for the query, where the access map includes one or more potential access paths to execute the query. The method includes collecting, for the query, a set of data for each potential access path. The method further includes classifying, by the classification model, the query. The method also includes selecting a first access path of the one or more potential access paths and executing the query.

Abstract: Methods and apparatus are provided for processing a transaction that has been aborted on a source system. Transactions are completed within a transaction processing system, and the transactions are replicated from a source database to a target database by a replication engine. Each transaction is a series of one or more transaction steps or operations. The aborted transaction on the source system was replicated and is a pre-committed transaction on the target database. Transaction pattern data in a transaction pattern table is used to predict when a pre-committed transaction is an erroneously committed transaction. The pre-committed transaction is reversed on the target database when the prediction indicates that the pre-committed transaction was erroneously committed.

Abstract: Embodiments of the present invention are directed to managing process analytics across process components. In some embodiments, an indication of a state of a process instance associated with a process is determined by querying a process engine. In accordance with the indication of the state of the process instance, an augmented process model is used to search machine data for data corresponding with at least one component of the process. The data corresponding with the at least one component of the process is associated with a process instance identifier that uniquely identifies the process instance. Thereafter, the data along with the process instance identifier is provided to the process engine to update the state of the process instance.