Abstract: A computer-implemented method for storing blockchain data includes: obtaining, by a blockchain node, a first key-value pair corresponding to data to be stored, in which the first key-value pair includes a value of the data to be stored and a first key of the data to be stored; identifying, based on the first key, a corresponding leaf node in a tree data organization structure; and modifying, by the blockchain node, the first key, to update the first key-value pair to obtain an updated key-value pair including the value of the data to be stored and the modified first key, and storing the updated key-value pair into a conflict data storage structure corresponding to the identified leaf node.

Abstract: This disclosure relates generally to an information retrieval technology and more particularly to a creation of a taxonomy to facilitate subsequent search and retrieval of information. In one embodiment, an information retrieval device is disclosed, that comprises a processor and a memory that stores instructions, which, on execution, causes the processor to receive an input corpus. Thereafter, input document clusters are generated from top input n-grams associated with the input corpus. Further, top-ranked input n-grams are determined from the top input n-grams. Thereafter, an external corpus is identified based on the top-ranked input n-grams. An enriched corpus (external and input corpus), is clustered based on top enriched n-grams associated with the enriched corpus to generate enriched document clusters. Further, for each n-gram of the enriched corpus, corresponding n-gram clusters are determined.

Abstract: Methods, systems, and devices supporting differential support for frequent pattern (FP) analysis are described. Some database systems may analyze data sets to determine FPs of data attributes within the data sets. However, if data distributions for different types of data attributes vary greatly, more frequent data attribute types may skew the FPs away from the less frequent types. To reduce the noise of common attributes while maintaining sensitivity to the less common attributes, the database system may implement multiple minimum support (e.g., frequency) thresholds. For example, the database system may adaptively categorize the different data attribute types into data categories based on their distributions and may dynamically determine support thresholds for the categories. Using different minimum support thresholds for different data categories allows the system to filter out data attribute patterns based on the distributions of the data attribute types in the pattern.

Abstract: Techniques for determining character string differences between a target character string and one or more candidate character strings are provided. In some implementations, a target bitmap is produced for the target character string and a target bitmap weight is calculated. A candidate bitmap and a candidate bitmap weight associated with a candidate character string is obtained. In response to determining that the candidate bitmap weight differs from the target bitmap weight by less than a first threshold value, an exclusive OR operation is performed between the target bitmap and the candidate bitmap. In response to determining that number of ones in the result of the exclusive OR is less than a second threshold value, the candidate character string is included in a character set that includes one or more character strings that are close to the target character string.

Abstract: Technical solutions are described to implement a scalable write ahead log using a distributed file system. A general aspect includes a method for providing consistency among metadata replicas and content in an enterprise content management cluster. The method includes recording a transaction log entry in response to receiving a content modification request, the transaction log entry including a version identifier set to a first version value. The method also includes updating the transaction log entry to a second version value in response to successfully modifying content and one of a plurality of metadata replicas containing metadata corresponding to the request. The method also includes updating the transaction log entry to a third version value in response to successfully modifying each of the metadata replicas. The present document further describes examples of other aspects such as methods, computer products.

Abstract: Computing systems and related methods are provided for performing database actions responsive to input gestures made by a user. One exemplary method involves a server identifying a gesture on a graphical user interface display on a client device, identifying a subset of displayed content on the graphical user interface display corresponding to the gesture, determining a database action based on at least one of characteristics associated with the gesture and the gestured content, performing the database action with respect to an object in a database, and updating the gestured content on the graphical user interface display to reflect performance of the database action.

Abstract: A method includes determining a set of sizes for size bucket indexes of an indexing structure, and indexing a plurality of records into the size bucket indexes. The indexing comprises, for a given record, rounding a size of the given record to a nearest one of the determined set of sizes and placing the given record in a size bucket index associated with the nearest one of the determined set of sizes. The method also includes receiving one or more queries to the plurality of records, a given one of the queries specifying a record size. The method further includes processing the given query utilizing the indexing structure by mapping the specified record size to at least a given one of the size bucket indexes and returning one or more records from the given size bucket index.

Abstract: In some examples, a computing device refines feature information of query text. The device repeatedly determines attention information based at least in part on feature information of the image and the feature information of the query text, and modifies the feature information of the query text based at least in part on the attention information. The device selects at least one of a predetermined plurality of outputs based at least in part on the refined feature information of the query text. In some examples, the device operates a convolutional computational model to determine feature information of the image. The device network computational models (NCMs) to determine feature information of the query and to determine attention information based at least in part on the feature information of the image and the feature information of the query. Examples include a microphone to detect audio corresponding to the query text.

Abstract: Repairing corrupt database references. Identifying a corrupt reference within a database, whereby the corrupt reference includes a reference with a broken connection between one or more data objects within the database and the corrupt reference is associated with one or more reference corruption types. Recording reference information for the corrupt reference, whereby the reference information includes a location of the corrupt reference within the database and one or more identification numbers of the one or more data objects associated with the corrupt reference. Determining a repair procedure based on the one or more reference corruption types associated with the corrupt reference. Generating one or more lines of computer code associated with the repair procedure and based on the recorded reference information. Executing the one or more lines, whereby the one or more lines are executed in a database manager.

Abstract: An executable utility is injected into cloud-based virtual machines (VMs) that are subject to backups by a data storage management system tasked with protecting the cloud-based VMs and their associated data. The utility is injected into a target VM which is “live” and operating. The utility analyzes the VM's live volume to discover data extents therein, and for each extent computes a respective checksum and determines whether the extent is a “hole.” Afterwards, checksums help identify changed data in successive snapshots of the live volume, so that only changed data will be read and backed up in incremental backups. Time is saved in performing the backup operation first by pre-warming the backup's source volume in parallel with the utility analyzing the live volume, and second by skipping read operations for extents unchanged since a preceding backup. The resulting incremental backup operation is sped up as compared to prior art approaches.

Abstract: A method and apparatus for replicating a data container of a source storage server at the logical level in an unordered stream of individual data units are described. In certain embodiments, the replication operations can be performed without regard to the differences in geometry of physical persistent storage of the source and destination storage servers and without regard to the differences in data container format of the source and destination storage servers. An initial replication operation of the source data container is performed by transferring the data objects within the source data container to a replica data container in the destination storage server as an unordered stream of individual data units while preserving data object identifiers of the source data objects. Afterwards, incremental replication operations can be performed to capture modifications to the source data container over time after the initial replication operation.

Abstract: In one example in accordance with the present disclosure, a system comprises a computing node. The computing node comprises: a memory, and a processor to: execute a database in the memory, and invoke, with the database, singular value decomposition (SVD) on a data set. To invoke SVD, the processor may sparsify, with the database, the data set to produce a sparse data set, iteratively decompose, with the database, the data set to produce a set of eigenvalues, solve, with the database a linear system to produce a set of eigenvectors, and multiply, with the database, the eigenvectors with the data set to produce a data set of reduced dimension.

Abstract: A user may establish a reservation for content that is not currently available to the user via a group of sources, including broadcast, streaming, and/or download sources. For example the a user may establish a reservation to record a broadcast of specific content that is currently not scheduled for broadcast. As another example, the user may establish a reservation for the purpose of alerting the user once a new movie becomes available through a subscription streaming service. Based on a reservation, the service provider and/or the user's media playback device may monitor content availability data for one or more sources. When the content is indicated as available, the user may be so informed. The content may then be streamed or downloaded, or a recording of the content may be scheduled. Additionally, or alternatively, the content may be automatically scheduled for recording or download.

Abstract: Data replication groups may be used to store data in a distributed computing environment. The data replication groups may include a set of nodes executing a consensus protocol to maintain data durably. In order to increase the speed of provisioning, a data replication may be provision with less than the total number of nodes to be included in the group. Once an initial set of nodes have been provisioned and are implementing a consensus protocol, the data replication group may begin to receive traffic. Furthermore, new nodes may be added to the group until the total number of nodes for the group has been reached.

Abstract: Methods and systems are provided for determining whether a search query with an observed number of occurrences in a set of search queries is a local search query. In accordance with one implementation, a method is provided that comprises determining an expected number of occurrences of a search query and comparing the expected number of occurrences to a threshold. Further, the method includes determining whether the search query is a local search query based, at least in part, on the comparison.

Abstract: A method for capturing evolving data, comprising observing a data graph, identifying a first entity within the graph, defining a first property of the first entity, and identifying a first data value corresponding to the property and the entity. The method further comprises associating a second entity with the first entity at first data value, and forming a dimension of the first entity with associations to other entities within the graph for different data values of the first property. Identifying the first entity comprises identifying a property of the first entity representing a dimension but the property does not relate to other entities through the dimension. Defining the first property comprises identifying an attribute of the first entity that will not change; establishing the attribute as the first property.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for an audience of network devices. One of the methods includes receiving information from a source, the information associated with a device identifier. The method includes determining, based on the device identifier, a unique user identifier, wherein the unique user identifier identifies a user independent of network, media, and location. The method includes identifying at least one user attribute based on the received information. The method includes associating the user attribute with the unique user identifier. The method also includes storing the user attribute in a repository. The repository stores a plurality of other user attributes associated with the unique user identifier, the other stored user attributes being received from a plurality of different sources.

Abstract: A system is arranged to receive data which is written to a data store by a writer. A controller is able to read data from the data store. That controller is able to control the rate at which data is read from the data store with respect to the rate at which data is written to the data store. A query function receives a stream of said data substantially in real time and when said stream of data is unavailable in real time, the query function is able to subsequently obtain that unavailable data from said data store.

Abstract: A method, system, and apparatus for managing a persistent query result set are disclosed. A resource manager is disclosed that receives a query from a client over a computer network. A computer database server is disclosed that executes the query and generates a result set based on and in response to the received query. An execution platform is disclosed that divides the result set into a plurality of chunks, wherein each chunk comprises a portion of the generated result set. The resource manager adds metadata to each of the plurality of chunks. A first chunk of the plurality of chunks comprises metadata pointing to the plurality of chunks. The resource manager delivers at least the first chunk of the plurality of chunks to the client in response to the query. The execution platform offloads the remaining plurality of chunks to cloud storage in parallel.

Abstract: Embodiments of the present invention provide methods, computer program products, and systems for web link quality analysis. Embodiments of the present invention can be used to receive a first indication that a web link has been accessed by a first device and record one or more resources of the web link and actions taken on the one or more resources of the web link and generate a score for the web link based on one or more similar web links to the web link and then displaying the score associated with the web link. Embodiments of the present invention can be used to generate a second score for the web link based on actions taken on the web link and an amount of accessed resources of the one or more resources of the web link and generate a display of the second score associated with the web link.