Abstract: Techniques for scheduling search queries in a computing environment are disclosed. A search query scheduling system associates a first set of queries with a first skew tolerance, the first set of queries scheduled to be performed during a first period, where the first skew tolerance is based on a duration of the first period. The search query scheduling system reschedules a first subset of search queries included in the first set of queries by skewing the first subset of search queries over a first portion of the first period based on the first skew tolerance.

Abstract: A database is identified, wherein the database has two or more tablespaces. A local partition and a global partition for each tablespace of the two or more tablespaces is created, wherein the created two or more global partitions are included in a global storage pool. A request to move an object to a first local partition of a first tablespace of the two or more tablespaces is received. That an amount of used space of the first local partition is above a first threshold is determined. Responsive to determining that the amount of used space of the first local partition is above the first threshold, at least a portion of the object is stored in the global storage pool.

Abstract: An image query method and apparatus, where the method may include obtaining a global feature of a query image and an attributive feature of the query image, where the attributive feature is a feature used to describe a specific attribute area in the query image, querying an image library using the global feature to obtain a first image set that includes at least one image, where an image included in the image library includes the attributive feature, selecting at least one image whose similarity of the attributive feature to the attributive feature of the query image is greater than a preset threshold from the first image set, and setting the at least one selected image as a second image set. Hence, the method may improve image query efficiency.

Abstract: The disclosed embodiments relate to a computer-implemented method for column-oriented access to data. The method can include inserting data into a data store. The data is randomly or sequentially retrievable from the data store by ordering keys for a table in a key-value store and recursively dividing a key space of said table into tablets that each have a range of possible keys. The tablets each contain partitions for key sub-ranges and each partition contains segments. Further, operations on tablets are distributed on different nodes and operations on partitions or segments are handled by using different threads.

Abstract: A data sync cache is maintained to facilitate syncing of child data objects between a first computing system and a second computing system. Responsive to successful syncing of a parent data object of a child data object by a first sync engine, parent object data sync information indicating that the parent data object was successfully synced is written to the data sync cache. Prior to initiating a sync of the child data object by a second sync engine different from the first sync engine, a cache lookup of the data sync cache is performed to determine if the sync information is contained therein. If the data sync cache includes the sync information, the child data object sync is initiated. In this manner, failed syncs of child data objects are reduced along with the expensive API calls to the second computing system that would otherwise be required to retry failed syncs.

Abstract: In-stream data load in a replication environment includes extracting source data from a source data store that is in a replication relationship with a target data store. A replication facility replicates to a target system changes made to the source data store. The replication facility includes a replication engine that reads a replication log into which the replication facility records the changes and sends the changes to the target system for application to the target data store. The extracting is performed by an extract utility separate from the replication engine. The in-stream data load also includes injecting, by the extract utility, the extracted source data into the replication log in-line with the changes recorded in the replication log by the replication facility and according to a format such that the replication engine can read and send the source data to the target system.

Abstract: Embodiments of the present invention provide a computer system a computer program product, and a method that comprises identifying replicated data within a respective data container in a plurality of data containers based on an indicative marker that reflects replication; calculating an amount of time to interact with the identified replicated data based on an alert threshold that, when triggered, alerts remaining data containers in the plurality of data containers; and synchronizing the identified replicated data within each respective data container such that reduces a wait time to interact with the identified replicated data based on a priority order of the calculated amount of time to interact, wherein the priority order places higher calculated interaction times higher than lower calculated interaction times.

Abstract: Disclosed herein are devices, methods, systems, and apparatus, including computer programs encoded on computer storage media, for managing trust points in ledger systems. One of the methods includes obtaining a request for establishing a trust point for a specified record in a series of records in a ledger system, determining whether the specified record is a candidate trust point that is trustworthy traceable to a preceding trust point, if so, determining whether the specified record is a timestamp record including trust timestamp information from a trust time server, in response to determining the specified record is not a timestamp record, identifying a timestamp record adjacent to the specified record, determining whether the timestamp record is trustworthily traceable to the specified record, and in response to determining the timestamp record is trustworthily traceable to the specified record, marking the timestamp record to be the trust point in the series of records.

Abstract: The process includes receiving a data set comprising a plurality of rows and a plurality of columns, and applying a first rule based decisioning to the data set to generate a first layer of metadata that comprises at least one of a key, a type indicator, a categorical indicator, and/or a continuous indicator. The first layer of metadata may be descriptive of the data set. The processor may further apply a second rule based decisioning to the first layer to generate a second layer that includes at least one of the key, the type indicator, the categorical indicator, or the continuous indicator. The second layer may be descriptive of the first layer. The process may also include generating an output file from at least one of the first layer or the second layer.

Abstract: Embodiments include method, systems and computer program products for compressing instrumentation data. Aspects include defining an intermediate region of memory. Instrumentation data associated with a processing device is received and stored in the intermediate region of the memory. The instrumentation data is compressed in the intermediate region of memory and stored in a sample region of memory.

Abstract: Systems and processes for operating an intelligent automated assistant are provided. In accordance with one example, a method includes, at an electronic device with one or more processors and memory, obtaining a first set of data corresponding to one or more interactions between a user and the digital assistant on the electronic device; obtaining a second set of data corresponding to one or more interactions between the user and an application on the electronic device; and storing the first set of data and the second set of data. The method further includes receiving a set of executable instructions; processing, based on the received set of executable instructions, the first set of data and the second set of data to obtain a third set of data; and transmitting the third set of data to a remote electronic device.

Abstract: Methods and systems for determining relationships between two or more nominally unrelated data sources utilizing a combination of probabilistic modeling and graphical clustering are described. The systems and methods for utilizing probabilistic model functions as a way of determining and judging the likelihood that two records from different systems are related to the same entity.

Abstract: A method and module for industrial process automation for acquiring measured values, wherein the measured value datasets have an identifier for each measured value, and an assignment table for cyclical data and an assignment table for acyclical data are present, which have a user-defined data structure created by a configurer via a configuration tool.

Abstract: Disclosed herein are devices, methods, systems, and apparatus, including computer programs encoded on computer storage media, for managing trust points in ledger systems. One of the methods includes obtaining a request for establishing a trust point for a specified record in a series of records in a ledger system, determining whether the specified record is a candidate trust point that is trustworthy traceable to a preceding trust point, if so, determining whether the specified record is a timestamp record including trust timestamp information from a trust time server, in response to determining the specified record is not a timestamp record, identifying a timestamp record adjacent to the specified record, determining whether the timestamp record is trustworthily traceable to the specified record, and in response to determining the timestamp record is trustworthily traceable to the specified record, marking the timestamp record to be the trust point in the series of records.

Abstract: A method, system and computer program product for operating a database includes: receiving a query including a first component indicating a criteria for generating a materialized query table (MQT) from the database and a second component having a condition for generating a reference value indicating a state of one or more items in the database; generating the MQT from the database where the MQT includes data items satisfying the criteria; generating, by executing the second component in response to receiving the query, a first reference value; receiving, subsequent to generating the first reference value, a second query for retrieving a data item from the MQT; generating, by executing the second component in response to receiving the second query, a second reference value; determining whether the first and second reference values are equal; and updating the MQT when the first reference value is not equal to the second reference value.

Abstract: The described technology is generally directed towards data storage using a node cluster, and garbage collecting unused chunks (data storage units) in the cluster based on which node owns the particular unused chunks. A node determines which chunks are in use, and exchanges datasets identifying those chunks with other nodes such that the other nodes know which of the chunks that they own are in use. When a node obtains the dataset identifying the chunks in use, the node determines the chunks not in use by a difference of those owned and those in use. This difference dataset is used to garbage collect owned, unused chunks. Garbage collection via this technology is able to be performed in a single cycle.

Abstract: Various embodiments are generally directed to an apparatus, system, and other techniques for shared, trusted token generation for a token-bucket flow control policy implemented in a distributed ledger. Tokens may be generated by blocks in the distributed ledger, which may be a blockchain system. Trusted execution hardware may be used as a proof algorithm to ensure that a token exists, and that client has legitimately acquired or accumulated the token prior to using it to submit a transaction.

Abstract: In general, embodiments of the invention relates to a method for managing data, the method includes obtaining, by an untrusted device and from a querying system, an item query, identifying a leaf block of a hierarchical block tree associated with the item query, identifying a plurality of indirect blocks that allow the querying system to calculate a top hash of the hierarchical block tree, and sending an item query response to the querying system, wherein the item query response specifies the leaf block, the plurality of indirect hashes corresponding to the plurality of indirect blocks, and a signature of the top hash, wherein the signature is obtained from a trusted system.

Abstract: Systems and associated methods for highly parallel processing of parameterized simulations are described. Embodiments permit processing of stochastic data-intensive simulations in a highly parallel fashion in order to distribute the intensive workload. Embodiments utilize methods of seeding records in a database with a source of pseudo-random numbers, such as a compressed seed for a pseudo-random number generator, such that seeded records may be processed independently in a highly parallel fashion. Thus, embodiments provide systems and associated methods facilitating quicker data-intensive simulation by enabling highly parallel asynchronous simulations.

Abstract: An embodiment of the present invention is directed to creating a re-usable code component that may be used with the data manipulation and transformation tool to natively support DML functionality. In addition to Insert, Update, and Delete, an addition function directed to “DeDup” may be implemented as it is used frequently in data transformation processes. An embodiment of the present invention is directed to capability to roll-back to a prior version of the original dataset. Any number of versions as required may be maintained.