Abstract: An intuitive interface that allows a non-technical person to search a computer database without having to understand the underlining database software or its structure by assembling a graphical database query.

Abstract: Methods and system for determining a similarity relationship between a plurality of digital assets and a target digital asset comprises creating a normalized semantic feature vector associated with a search query, discovering the target asset based on the normalized semantic feature vector, generating a normalized latent feature vector associated with the target asset, comparing the normalized semantic feature vector with semantic feature vectors for each of the digital assets to generate a semantic comparison value, comparing the normalized target latent feature vector with latent feature vectors for each of the digital assets to generate a latent comparison value, blending the semantic comparison vector value with the latent feature comparison vector value to create a target comparison value for each of the digital assets, and reporting the digital assets having the highest target comparison values to the user or group of users.

Abstract: A method and apparatus for managing variations in a product structure for a product. In one illustrative embodiment, a product management system for managing variations in a product structure for a product comprises a model. The model comprises a primary hierarchical organization and a number of optimized product variant structures. The primary hierarchical organization comprises a group of domain master objects. The number of optimized product variant structures comprises a group of domain configuration objects in which each domain configuration object in the group of domain configuration objects represents a configuration for a component represented by a corresponding domain master object in the group of domain master objects.

Abstract: Systems and methods for search result replication in a search head cluster of a data aggregation and analysis system. An example method may comprise maintaining a replication count corresponding to how many replicas of a result of a particular map-reduce search exist in a search head cluster comprising a plurality of search heads that are each configured to enable them to manage a reduce phase of a map-reduce search, determining that the replication count is less than a target replication count, selecting, based the determining, a target search head from the search head cluster to receive a replica of the search result, initiating a replication of the search result from a source search head in the search head cluster to the selected target search head, receiving an indication that the replication is complete, and based on receiving the indication, increasing the replication count corresponding to the search result.

Abstract: Systems and methods are described that recommend images, items, and/or metadata based at least in part on a reference color palette or reference color name. A color name can be converted into a representation of the color name in a color space. The reference color can be used to identify images that contain the reference color. The identified images and associated metadata can be analyzed, sorted and provided as an ordered list of items. Systems and methods are also described that identify items that contain colors affiliated with the reference color. Systems and methods are also described that validate color identifier information in metadata associated with an image. Systems and methods are also described that identify non-color specific keywords associated with the reference color.

Abstract: Embodiments relate to scheduling operations to perform on objects. A method for scheduling operations to perform on objects is provided. The method identifies a plurality of operations to perform on a plurality of objects each having at least one attribute. At least one of the operations has scheduling dependency on another operation. The method generates a numeric value for each of the objects from the attribute of the object. The method schedules the operations to perform on the objects based on the numeric values of the objects and the scheduling dependency.

Abstract: A method for team analytics context graph generation and augmentation may include extracting a set of relevant features from a received message and predicting a context graph corresponding to the received message being sparse based on the extracted relevant features. A context of the received message is indeterminable from the context graph in response to the context graph being sparse. The method may also include generating an augmented context graph in response to the context graph being predicted to be sparse. The context of the received message is determinable from the augmented context graph. The method may additionally include presenting the augmented context graph.

Abstract: A cluster file system comprises a parallel file system and a plurality of burst buffers, with the burst buffers collectively configured to provide an interface between the parallel file system and compute nodes of a computer system. Each of the burst buffers comprises a virtual file system component and a metadata server component. The virtual file system components of respective ones of the burst buffers collectively implement a virtual file system. Metadata relating portions of the virtual file system to portions of the parallel file system is stored in a distributed manner over the metadata server components of the respective burst buffers. Each burst buffer independently manages its own flash memory, but the burst buffers are configured such that data consistency is ensured across their flash memories. The virtual file system illustratively comprises a parallel log-structured file system (PLFS) and the metadata server components illustratively comprise respective TO forwarding servers.

Abstract: Systems and methods for rewriting queries based on data features are disclosed. A data source contains a history of queries and results associated with the queries. A source query is received and a subset of the data source is extracted that is related to the query. Costs are then associated with the associations of the queries and results, and an absorbed cost is determined for each query. The queries having the lowest absorbed cost are recommended for rewrites.

Abstract: An apparatus, system, and method are provided for evaluating database accesses. The apparatus may comprise a computer program that causes a computer system to exchange profiling data between a client application module and a database module; execute a database access; determine a database access policy violation at a detection point module; and selectively request context information from a context point module related to the database access.

Abstract: Systems and methods are described to quickly search a data store based on one or more n-dimensional colors. The n-dimensional colors in the data store may be converted to interleaved integers and indexed. An n-dimensional color search range may be converted to one or more integer search ranges. A fast color search query may be formulated based on the one or more integer search ranges, and transmitted to the data store for searching. The data store may use the interleaved integer index to quickly compare the integer search ranges to the interleaved integers, and send back one or more colors or object results that matched the desired color range.

Abstract: In one embodiment, a method receives a query for analyzing data in a database. The method then determines a constant in the query and determines an operator applied to the constant in the query. The operator explicitly controls a behavior of the constant. The constant is represented as a scalar representation in the query instead of as a vectorial representation where the constant would have been used as the vectorial representation without the use of the operator due to a rule governing use of constants. Then, the method performs a calculation for the query to determine a query result using the constant as the scalar representation.

Abstract: Systems and methods are provided for extracting application relevant data from messages. In one embodiment, a system can comprise a message parser that parses messages and builds a message tree having one or more objects, one or more data type templates that define a given data type based on one or more data elements and a comparison engine that matches data elements in the one or more objects with data elements in the one or more data type templates. The comparison engine groups data elements in the one or more objects that matches data elements in the one or more data templates as a specific data type corresponding to the associated data type template that is matched.

Abstract: A method of backing up data includes backing up, using a processor, multiple save sets of data to a first backup data storage; obtaining a first save set from the first backup data storage after the backup of the first save set has completed on the first backup data storage; determining that the first backup data storage is capable of concurrent read and write operations; and replicating, based at least in part on the determining, the first save set onto a second backup data storage while backing up of one or more other save sets of the multiple save sets to the first backup data storage is pending.

Abstract: In one example, documents that are examined by a search process may be scored in a manner that is specific to a domain. A domain may be a substantive area, such as medicine, sports, etc. Different scoring approaches that take aspects of the domain into account may be applied to the documents, thereby producing different scores than might have been produced by a simple comparison of the terms in the query with the terms in the documents. These domain-based approaches may take a query into account in scoring the documents, or may be query-independent. Each approach may be implemented by a scorer. The combined output of the scorers may be used to generate a score for each document. Documents then may be ranked based on the scores, and search results may be provided.

Abstract: Technologies are generally described for cache based key-value store mapping and replication. In some examples, key-value stores may be mapped for data structure replication through extraction of file breaks in an existing key-value store by iterating through the store and examining changes in cache addresses to detect jumps in address values. Specially formulated queries may be executed to return the values within an address range that spans a physical storage volume in order to recover full key-value sets that are physically grouped at a current data center including record duplicates. Such sets may be used to replicate or inform the key-value sets at a new location or in a new key-value store allowing construction of a replicated database tree structure complete with record duplications that develop as tables are optimized over time.

Abstract: Example processes for determining a match type include: receiving a query token from a content provider; consulting a database stored in memory to determine past performance of the query token for associated content, where the past performance includes performance information indicating how well the query token performed for different match types, where a match type indicates a way that components of the query token match components of another query token in order to achieve a token match; determining, based on the performance information, differences in performance between ones of the different match types; comparing the differences in performance to a threshold; and selecting a match type for the query token based on the comparing.

Abstract: A method and system for cryptographically indexing, searching for, and retrieving documents is provided. In some embodiments, an encryption system is provided that generates a document index that allows users to retrieve documents by performing encrypted queries for keywords associated with the documents. In some embodiments, each keyword maps to the same number of encrypted document identifiers. In some embodiments, an extractor graph is employed to map an indication of each keyword to a number of buckets storing encrypted document identifiers. In some embodiments, an order-preserving encryption system is provided. The encryption system uses an ordered index that maps encrypted instances of ordered attribute values to documents that are associated with those values. The ordered index enables queries containing query operators that rely on order, such as less than (“<”) or greater than (“>”), to be successfully performed on encrypted attribute values.

Abstract: A device is configured to receive information that identifies an XML data structure, an input key including information that identifies an element in the XML data structure, and an output key including information that identifies a manner in which the element is to be identified in a JSON data structure. The device is configured to parse the XML data structure to determine an element identified by the input key, and generate the JSON data structure by storing an association between the element and the output key in the JSON data structure. The device is configured to populate the JSON data structure with content from the XML data structure, where the content is identified by the input key and is placed in a location in the JSON data structure identified by the output key. The device is configured to store the JSON data structure.

Abstract: A method and system are presented in which a query attribute is used as the basis for accessing stored attribute combinations and their frequencies of occurrence for query-attribute-positive individuals and query-attribute-negative individuals and tabulating, based on frequencies of occurrence, those attribute combinations that are most likely to co-occur with the query attribute.