Abstract: A journaling system provides access to subsets of user information in a segregated fashion. This permits its users to define access settings for their user information thereby limiting which other users may access the user information. In one or more embodiments, the journaling system may include a server or other computing device and one or more storage devices used to store the user information, associated access settings, or both. The access settings may define particular criteria which must be met before a subset of user information may be accessed, and may identify particular users that may access the subset of user information.

Abstract: A request may be received to transfer from a first entity to a second entity a right related to a digital asset stored in an on-demand database system. The on-demand database system may provide computing services to a plurality of entities via the internet. A token associated with the digital asset may be identified. The token may being included in a smart contract recorded within a distributed trust ledger and may be owned by a first distributed trust ledger account. The smart contract may be executed within the distributed trust ledger to record a transfer of the token from the first distributed trust ledger account to a second distributed trust ledger account. The on-demand database system may be updated to include one or more database entries reflecting the recorded transfer.

Abstract: Disclosed is a method for processing a query related to a plurality of partitions included in a plurality of tables having different partition information, which is performed by a computing device including one or more processors. The method includes acquiring the plurality of partitions for processing the query. The method includes acquiring global partition indexes for encompassing the acquired partitions and acquiring local partition indexes corresponding to the acquired partitions, respectively. The method includes processing the query at least partially based on the global partition indexes and the local partition indexes.

Abstract: A device, system, and computer implemented method for storing segmented data in a computer memory, the segmented data indicating which of a plurality of entities belong to which of a plurality of segments, each segment accommodating entities sharing a single binary characteristic. A computer receives a list of entity identifiers selected from a sequence of entity identifiers, each entity identifier in the list representing an entity which belongs to a segment; the computer uses the list to create a bitmap in which each bit has a bit position in a bit sequence corresponding to the sequence of entity identifiers. The state of each bit indicates whether the entity identifier representing that position in the sequence identifies an entity belonging in the segment or not; and the bitmap is stored in a memory in association with a segment identifier, as the segmented data.

Abstract: A method for configuring an observable object as a digital twin in a digital twin system of any one domain is provided. The method for configuring a digital twin includes defining a purpose for expressing the observable as a digital twin in the domain, organizing data based on a role of the observable object in the domain, configuring the observable object into the digital twin based on the data for the purpose, and synchronizing the observable object and the digital twin.

Abstract: A method for operating a decentralized application by users of a blockchain. In the method, a first user proposes a state change on a state channel anchored in a blockchain. If a confirmation of the state change by the other users on the state channel does not occur, the first user prompts the other users to confirm within a predefined time span on the blockchain. If the confirmation also does not occur on the blockchain, the state change is carried out at the blockchain.

Abstract: Provided is an aggregation index structure and an aggregation index method for improving aggregation query efficiency. The aggregation index partitions streaming data through two dimensions of grouping and slicing, and then aggregates the partitioned data. The structure includes index metadata, a sliced data list and a detailed data store; the aggregation index method includes three parts: aggregation index definition, aggregation index creation and aggregation index query. The aggregation index structure and method provided by the present disclosure can greatly improve the efficiency of aggregation query, support the ad hoc aggregation query of PB-level data, complete the aggregation query of a large amount of data in seconds, support the insertion of new data at any time, and return the query results in minutes or even seconds latency in the event of changes of the query range conditions.

Abstract: Embodiments are directed to association of storage objects in a multi-tenant, cloud-based storage environment. More specifically, a first object can be made available in the file system of the environment and can be accessed, for example, by its file or object name. At some point thereafter, an auxiliary object can be provided that is related to the first object. For example, this auxiliary object can comprise metadata or other content associated with or related to the first object. According to one embodiment, this auxiliary object can be assigned an identifier that not only uniquely identifies the auxiliary object but also identifies, within the identifier itself, the relationship to the first object. This relational naming can be used to track the relationship between objects, e.g., to update the auxiliary object based on changes to the first object, but without a separate mapping of the objects.

Abstract: One or more computing devices may comprise congestion management circuitry, one or more client file system request buffers, and DESS interface circuitry. The one or more client file system request buffers is/are operable to queue first client file system requests of a first priority level and second client file system requests of a second priority level, where the first priority level is higher priority than the second priority level. The DESS interface circuitry is operable to determine a choking level according to the load on a plurality of DESS resources. Individual load values of the DESS resources are mapped to a composite load value using a first function. The composite load value is mapped to a congestion contribution using a second function. And, the congestion contribution is mapped to a choking level using a third function.

Abstract: A computer-implemented system with a processor provides a reversible transfer of an atomic token from one side of an imperfect link to the other, such that if the protocol (or process) on either side fails at a critical moment, the atomic token will be found on both sides to be verifiably incomplete, unless the protocol has completed successfully past its ‘irreversible threshold’ on both sides.

Abstract: A computer-implemented method for transferring a total data record from an input node to an output node using a blockchain. The total data record may be a total payment, in some cases, such as using Bitcoin. The output node shares public key material and the input node selects unspent transaction outputs to use in paying the total value, and determines a plurality of outputs payable to the output node in fixed denominations. The input node generates an output address for each output using the public key material and a respective random number, and mixes the inputs and outputs in one or more coin mixing transactions. A nonce public key for each output, generated based on the respective random number, is shared with the output node either separately or through the blockchain, and the output node can derive the corresponding private key for each output address, enabling it to search for and identify the outputs to which it can then claim ownership.

Abstract: A method may include receiving a first transaction inserting a record into a database and a second transaction deleting the record from the database. A validity period for the record may be determined based on a first commit time at which the first transaction is committed and a second commit time at which the second transaction is committed. A current table and/or a history table of a system versioned table may be updated to include the record based on the validity period of the record. One or more temporal operations may be performed based on the system versioned table. For example, a time travel operation may be performed to retrieve, based on the system versioned table, one or more records that are valid at a given point in time. Related systems and computer program products are also provided.

Abstract: A method is provided for performing transaction processing in a system. The system includes a plurality of processors. Each processor executes a plurality of transactions. Two of the processors receive requests to process the same subset of the plurality of transactions and each of the two processors execute each of the requests to process the same subset of the plurality of transactions. Each of the two processors create local indicia from the outcome of each transaction in the same subset of the plurality of transactions. Each of the two processors assign a transaction tag to each of the local indicia, wherein the same transaction tag is assigned by each of the two processors executing the same transaction. The local indicia and the respectively assigned transaction tags from each of the two processors are queued. It is then detected when queued transaction tags from the two processors match each other. The local indicia associated with the matching transaction tags are then compared to each other.

Abstract: An example method of tuning a machine learning operation can include receiving a data query comprising a reference to an input data set of a database, generating a plurality of unique sets of hyperparameters by varying a hyperparameter value of each set of hyperparameters of the plurality of unique sets of hyperparameters based on the input data set, in response to receiving the data query, training a plurality of machine learning models using the input data set of the data query, each of the plurality of machine learning models configured according to a respective one of a plurality of unique sets of hyperparameters, selecting a first machine learning model of the plurality of machine learning models based on an accuracy of an output of the first machine learning model, and returning the output of the first machine learning model in response to the data query.

Abstract: A method for visualizing a process map is executed by a process map server. The method includes receiving a flowchart and a step-by-step recording related to a process. Generating a process map by combining the flowchart and the step-by-step recording and displaying the process map. The process map displays a task, step, and action related to the process. A detail window shows information associated with the process, and portions of the process, in response to user input. The action is based on information from the step-by-step recording.

Abstract: In various embodiments, a data integration system is disclosed which enables incremental loads into a data warehouse by developing a data partitioning plan and selectively disabling and enabling indexes to facilitate incremental loads into fact tables.

Abstract: Techniques are provided for synchronous replication based cutover. An asynchronous replication process is executed to perform asynchronous incremental transfers of data of a storage object from a first computing environment to a replicated storage object at a second computing environment until a cutover criteria is met. A synchronous replication process is executed to synchronously replicate operations, targeting the storage object, to the replicated storage object based upon the cutover criteria being met. A cutover is performed to direct operations from targeting the storage object to targeting the replicated storage object based upon the synchronous replication process reaching a steady state of synchronous replication for sub-objects of the storage object, where operations are committed to both the storage object and the replicated storage object.

Abstract: A computer-implemented method of determining indexed fields at query time comprises indexing time-stamped events ingested from a plurality of source types. The time-stamped searchable events compare portions of raw data. The method also comprises generating an index containing each keyword in the time-stamped searchable events and an associated location reference of a respective event in which the keyword appears. Further, the method comprises generating a fields metadata file identifying indexed fields in the time-stamped searchable events for each source type. The fields metadata file comprises reference values for accessing indexed fields associated with each source type from the index. The method also comprises accessing the fields metadata file to identify the indexed fields associated with each source type prior to executing a query.

Abstract: Techniques are disclosed relating to methods that include an authentication management process, executing on a computer system, authorizing a plurality of applications to access a database, and sending one or more passcodes to the authorized applications. In response to an authentication update request, the method further includes selecting a new passcode for accessing the database, and sending, to a plurality of applications authorized to access the database, a notification that the new passcode is available. In response to a request from a particular application, the method also includes sending the new passcode to the particular application. The method further includes determining that each of the plurality of applications has retrieved the new passcode. In response to the determining, the method also includes enabling the new passcode for use by the plurality of applications for accessing the database.

Abstract: A distributed database system can implement a column-based database system and a row-based database system for processing data. The row-based database system can store data organized into key value pairs, and data to be processed by the row-based database system is converted to a key-value format compressing keys that correspond to values. The distributed database system can perform serialization and compression in converting the data to the key-value format for efficient data storage performance. The distributed database system can unpack portions of the converted serialized compressed data in response to queries that process a portion of serialized compressed data without unpacking the entire converted dataset.