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: 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: 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: 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: 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: 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: 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.

Abstract: Methods, systems, and computer-readable media for partition splitting in a distributed database are disclosed. A partition of data is split into a first sub-partition and a second sub-partition. A first portion of the data is assigned to the first sub-partition, and a second portion of the data is assigned to the second sub-partition. One or more elements of the first portion of the data from the partition and an additional one or more elements of the first portion of the data from the first sub-partition are stored into a first node. One or more elements of the second portion of the data from the partition and an additional one or more elements of the second portion of the data from the second sub-partition are stored into a second node. The partition is prevented from receiving new data after the partition is split into the first and second sub-partitions.

Abstract: Aspects of the invention include assessing, by a management layer executing on a first processor, a query from a client application requesting data from a server. The assessing occurs prior to the query being executed by a provider. The assessing includes extracting, by the management layer, characteristics of the query. The management layer compares the extracted query characteristics with a policy defined by the provider. Based at least in part on results of the comparing, it is determined by the management layer whether the query is permitted to be executed by the provider at the server. The management layer initiates execution of the query at the server in response to determining that the query is permitted to be executed. The management layer prevents execution of the query at the server in response to determining that the query is not permitted to be executed.

Abstract: This disclosure describes techniques implemented partly by a service provider network for distributed storage of event data in data storage according to a data-storage schema in order to reduce the amount of computing resources required to store and access the event data. The techniques may include generating event identifiers (IDs) for actions performed by users to manage cloud-based services. Rather than indexing event IDs by writing the event IDs to a database, the techniques described herein include storing event IDs in different file folders in storage according to a storage schema where the different file folders are assigned to store event IDs having different prefix portions. In this way, event IDs may be stored, or grouped, in different file folders according to prefix portions of the event IDs to reduce the amount of reads and writes required for the event IDs.

Abstract: Multiple shots representing potential playlists of content items are generated. Each shot includes multiple shot positions into which potential content items are placed. The shot positions are individually assigned position index values. The position index values assigned to positions in a particular shot form a unique sequences of index values. Eligible content items are identified for insertion into a first shot position. The eligible content items are scored relative to each other, and associated with content index values. Selected eligible content items are placed into particular shot positions based on a comparison of content index values associated with the selected eligible content items to a position index value assigned to the particular shot positions. Shot scores are determined based on aggregate scores of eligible content items placed in shot positions associated with each individual shot, and the shot scores are compared. A broadcast schedule is generated based on the shot-score comparison.

Abstract: A method for data migration is provided. The method includes the following. A communication connection with a source migration terminal is established. A file list on the source migration terminal is acquired after the source migration terminal is accessed. First operations and second operations are executed in parallel. The first operations include reading out files on the source migration terminal according to the file list and storing the files read out on a migration terminal. The second operations include displaying the file list, receiving selection of a non-migrated file in the file list, and deleting the non-migrated file after the non-migrated file is migrated from the source migration terminal to the migration terminal and stored in the migration terminal. A terminal is further provided.

Abstract: Example methods and apparatuses for file compaction in a key-value store system relating to the field of data processing technologies are described. One example method for file compaction in a key-value store (KV-Store) system includes compacting, according to a to-be-deleted log (Delete Log) that corresponds to a to-be-compacted sorted string table (SSTable), the to-be-compacted SSTable to generate a new SSTable. A key corresponding to a non-latest value in the KV-Store system and stored in the to-be-compacted SSTable is recorded in the Delete Log, and the new SSTable does not include a key-value pair that corresponds to the key in Delete Log. The to-be-compacted SSTable is then deleted.

Abstract: An exemplary information processing system includes a first information processing device having a platform of a first type and a second information processing device having a platform of a second type different from the first type. The information processing system stores a basic user list that is a user list representing information of other uses registered while being associated with information of a subject user and that can be used by the first information processing device and the second information processing device. The information processing system changes the basic user list in response to a list change notification from the first information processing device. The information processing system sets, based on the basic user list, content of an application user list used in an application that is executed on the second information processing device.

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 system and method to aggregate subscriber-perspective data from live data packets of network traffic. The method includes inspecting live packets of network traffic exchanged with a plurality of subscriber end devices. Network traffic exchanged with a subscriber end device can include network traffic exchanged with a different subscriber end device or with an application server. The packet inspection is performed at a location of interception of the live packets, each subscriber end device being an end device correlated with a subscriber. The method further includes selecting, at the location, content data of the inspected packets that correspond to packets exchanged with a selected subscriber end device of the plurality of subscriber end devices, aggregating, at the location, the content data selected, wherein the content data has not been previously aggregated, and outputting, at the location, results of the aggregation.

Abstract: Techniques for processing event streams are provided that retain attributes or fields from a current event or group during stream aggregation. An exemplary technique includes receiving a stream of events having an input shape having a plurality of attributes and executing a query on the stream of events. The executing includes: (i) summarizing data of a first attribute of the plurality of attributes based on an aggregate function to generate values of data for a result-set, (ii) collecting data of events with values that are identical for a second attribute of the plurality of attributes based on a group by function to group the result-set by the second attribute, and (iii) preserving data of a third attribute of the plurality of attributes based on a current function. The technique further includes outputting events having an output shape having the first attribute, the second attribute, and the third attribute.

Abstract: A computer-implemented method according to one embodiment includes performing a first process for each chunk of data of each file of a snapshot of a file system. The first process includes reading a given chunk of data of a given file of a first snapshot of the file system, and reading shadow records of a shadow file of the first snapshot. The given chunk of data is compared with the shadow records for determining whether a coherent state exists between the given chunk of data and one or more of the shadow records that were recorded in a snapshot creation window. In response to determining that no coherent state exists, an indication is recorded that the given chunk of data is corrupt. In response to determining that a coherent state exist, an indication is recorded that the given chunk of data is accurate.