Abstract: Methods, systems and apparatus, including computer programs encoded on a computer storage medium for selecting keywords for resources are disclosed. In one aspect, a search query is received associated with a first user. A determination is made that the first user is a follower of an entity feed that is provided by a first entity and that is provided through a social network. A content item is selected having distribution parameters specifying that the content item is to be provided to users that are followers of the entity feed and that submit the search query. The selected content item is provided for the first user.

Abstract: Disclosed are systems and methods for extracting and visualizing patterns in large-scale data sets. A data set comprising a plurality of data points is received. A plurality of connections between the plurality of data points is generated. Based on the plurality of connections, a plurality of groups from the plurality of data points is generated. A visual analytic comprising a plurality of geometrical shapes corresponding to the plurality of groups is generated.

Abstract: A method and system for executing database queries in parallel using a shared metadata store. The metadata store may reside on a master node, and the master node may distribute this metadata with query plans to worker nodes. The worker nodes may request additional metadata from the master node when necessary.

Abstract: Embodiments include a data platform for attribute management related to a key-attribute-value data store. An attribute repository comprises attributes grouped by classifications. A hierarchical object definition repository comprises a plurality of object definitions, each having associated classifications. Objects in an object repository are associated with definitions. An attribute value repository stores values for each attribute object pair. APIs can provide attribute metadata, and automatically generate forms based on object definitions. The data platform can provide a product data platform linking products, product offerings, trade items, and supply items.

Abstract: Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage devices, for processing data requests. One of the methods include receiving, by a storage system, a processing request of data of a distributive ledger system. Types of the data of the distributive ledger system include block data, transaction data, state data, and index data. The storage system determines a type of the data among the types of the data of the distributive ledger system, and applies a type of a processing engine specified for processing the type of the data.

Abstract: A request to access to a logical location in a file stored in a content addressable storage (CAS) system can be processed by retrieving first tree data from a first node in a first hash tree that represents a first version of the file. Based on the first tree data, a second node is selected from which a CAS signature is compared to a reserved CAS signature to determine the proper file version. In response to a match, a third node is accessed in a second hash tree that represents a second version of the file. Tree data is retrieved from a third node.

Abstract: Techniques for generating highlight clips of an event are described herein. For example, unstructured data associated with an event may be received. Audio data and video data for the event may be obtained. Structured data may be extracted from the unstructured data using one or more feature extractors. In embodiments, a duration for a highlight clip of the event may be determined based at least in part on a model that uses the structured data, the audio data and the video data of the event. Metadata that identifies the duration for the highlight clip of the event may be generated based at least in part on the model. The highlight clip of the event may be stored based at least in part on the metadata.

Abstract: A request to access to a logical location in a file stored in a content addressable storage (CAS) system can be handled by retrieving first tree data from a first node in a hash tree that represents the file, the first tree data including a first hash tree depth, a first CAS signature, a block size and a file size. Based on the tree data, a second node is selected from a higher level in the hash tree. Second tree data from the second node of the hash tree that represents the file is retrieved, including a second CAS signature. The second CAS signature is determined to match a reserved CAS signature, and in response, an indication that the requested logical location is unallocated within the file is provided.

Abstract: A system that implements a data storage service may store data for database tables in multiple replicated partitions on respective storage nodes. In response to a request to back up a table, the service may export individual partitions of the table from the database and package them to be independently uploaded (e.g., in parallel) to a remote storage system (e.g., a key-value durable storage system). Prior to uploading the exported and packaged partitions to the remote storage system, the service may verify that the exported and packaged partitions can be subsequently restored, which may include unpackaging and/or re-inflating the exported and packaged partitions to create additional unpackaged copies of the partitions, re-importing the additional unpackaged copies of the partitions into the database (e.g., as additional replicas), and/or comparing checksums generated for the exported partitions with checksums generated for the additional unpackaged copies of the partitions.

Abstract: A text vectorizer is provided to compute vectors for respective text units. The text vectorizer computes a given vector for a given text unit by: (i) computing word vectors for respective words in the text unit; (ii) computing phrase vectors for respective phrases in the text unit; and (ii) combining the word vectors and the phrase vectors to produce the given vector for the given text unit. For a corpus of documents, the text vectorizer computes corpus vectors for the respective corpus documents. Search text is received, and, based thereon, the text vectorizer computes a search vector for the search text. Search scores are then computed for respective corpus documents by comparing the search vector with the corpus vectors of the respective corpus documents.

Abstract: A system and computer implemented method of patent mapping are provided. The method comprises maintaining a database of patent portfolios and a database of patents, each patent stored in the database of patents associated with one or more patent portfolios stored in the database of patent portfolios; maintaining a database of ontologies, the ontologies including one or more patent concepts in defined groups; receiving a search query associated with a first patent portfolio; searching the first portfolio as a function of the search query; generating search results, the search results including one or more patent claims associated with the search query; and mapping the one or more patent claims to a patent concept in a defined group.

Abstract: The present disclosure is directed toward a method and system for deconstructing and searching binary based vehicular data. The method includes extracting a vehicle filename metadata for one or more vehicular files; parsing data of the vehicular files to generate categorized objects based on a vehicular data dictionary for the vehicular files; associating each of the categorized objects with a respective vehicle filename metadata; storing vehicular documents indicative of the categorized objects with associated vehicle filename metadata in a database system; building a query based on a search input acquired by way of a search interface being displayed; and transmitting search results in response to the search input. The vehicular data dictionary defines multiple terms indicative of decoding logic provided in the vehicular files.

Abstract: A method for executing a computerized query includes receiving a new query from a user device. The query includes natural language text. Based on a type of user, and using an alternative term generator, a selected data model is selected from among pre-determined data models. The selected data model is particular to the type of user. Each of the pre-determined data models includes a corresponding semantic graph data model that establishes semantic relationships between words. Query words in the natural language text are compared to the selected data model using the alternative term generator to find at least one alternative term. The alternative term has a semantic relationship to a query word in query words. The semantic relationship exceeds a first threshold value. The alternative term is substituted for a query word to form a revised query. The revised query is executed on a search engine using the alternative terms.

Abstract: A dataset management system organizes datasets using a data relationship graph that serves as a representation of datasets that are related to one another. For example, the data relationship graph includes nodes that each represent a dataset as well as edges that each connect two nodes. Each edge represents a similarity in characteristics of the similar datasets such as a similarity in the datasets' origin, organizational schema, lineage, or data values. When a user is to be provided recommended datasets, the dataset management system identifies candidate datasets by traversing the nodes and edges of the data relationship graph. Amongst these candidate datasets, the dataset management system evaluates users that have accessed the candidate datasets as well as the context in which the candidate datasets were accessed to identify recommended datasets for presentation to the user.

Abstract: A method of dynamically converting a document from a non-DICOM format to a DICOM format includes receiving a query for use in searching for the document from one or more repositories, searching the one or more repositories for the document that matches the query, receiving from the one or more repositories one or more document results of the searching, receiving from a user a request for retrieval of at least one document from the one or more document results of the searching, determining if the at least one document requested for retrieval is in the non-DICOM format, upon positive determination, converting the at least one document requested for retrieval from the non-DICOM to the DICOM format, and sending the at least one converted document to the user.

Abstract: Techniques for data processing may include: receiving a data chunk of the data set; determining, in accordance with criteria including a compressibility ratio for the data set and a cost ratio of compression computation cost and entropy computation cost, whether to activate or deactivate entropy computation for the data set, wherein the compressibility ratio is ratio of a number of compressible data chunks of the data set and a number of uncompressible data chunks of the data set; and responsive to determining to activate entropy computation for the data set, performing first processing comprising: determining an entropy value for the data chunk; and determining, in accordance with the entropy value for the data chunk, whether to compress the data chunk.

Abstract: A data storage system implements aggregation, bifurcation, and/or reduction techniques to improve the efficiency of processing data storage requests. Data storage requests and/or their associated payloads may be aggregated based on one or more parameters. Data to be the stored and the associated commands may be separated so as to optimize a system's throughput and latency for each. Furthermore, extraneous commands and requests may be reduced or eliminated based on heuristics associated with the requests and the data.

Abstract: Aspects of the present invention disclose a method for identifying a relationship between objects of a NoSQL database based on queries of an application programming interface (API) call. The method includes one or more processors identifying an API call that includes two or more NoSQL query requests. The method further includes determining a class for the two or more NoSQL query requests of the API call. The method further includes determining whether a query value of the first NoSQL query request of the API call is present in a second NoSQL query request. The method further includes determining a relationship between the first NoSQL query request and the second NoSQL query request of the API call. The method further includes creating a view in a relational model database based on the respective determined classes for the two or more NoSQL query requests of the API call and the determined relationship.

Abstract: Various embodiments for managing data stored in a tiered data storage environment, by a processor device, are provided. A data file is proactively migrated from a lower tier to a higher tier of the tiered data storage environment by using a multidimensional algorithm adopting an actual frequency of access of the data file to gauge a slope of a predicted frequency of access of the data file. The data file is migrated from the lower tier to the higher tier only if each of a plurality of criteria of the multidimensional algorithm is satisfied.

Abstract: Transaction requests may be ordered in a distributed database according to an independently assigned sequence. Different distributed system nodes, such as a transaction coordinator and a storage node may independently assign sequence numbers to requests to access a distributed database. A storage node may receive the request from a transaction coordinator with an assigned sequence number and another request to which the storage node may assign a sequence number. The storage node can then order performance of the requests based on the sequence numbers.