Abstract: A computing device is configured to carry out actions including: generating, in a graph database, an access role vertex that defines an access role of a user, where the access role vertex is connected to a user vertex representing the user; generating a query vertex including a traversal clause that represents a query of the graph database; generating a permission edge between the access role vertex and the query vertex, where the permission edge defines the access role's permission to access the results of the query; receiving a request to execute the query on behalf of the user; in response to the request, traversing the graph database according to the traversal clause to locate a set of vertices; and generating a set of results based on the set of vertices.

Abstract: A storing unit stores a data set including a plurality of data elements and a first Bloom filter used to determine whether a query-target data element is present in the data set. A calculating unit deletes, when some data elements are deleted, a first bit array from the first Bloom filter. The first bit array has the number of bits corresponding to the number of deleted data elements. When a query-target first data element is entered, the calculating unit adds a second bit array temporarily to a second Bloom filter obtained by deleting the first bit array. The second bit array has the same number of bits as the first bit array, with all bits set to a specific value. Using the second Bloom filter, the calculating unit determines whether the first data element is present in the data set, from which some data elements have been deleted.

Abstract: The disclosed embodiments provide a system for managing a materialized view of data in a data store. During operation, the system obtains a first creation time of a first materialized view of the data in the data store. Next, the system verifies that the first materialized view is not affected by deletions applied to the data since the first creation time. The system then identifies one or more additions to the data that are not included in the first materialized view. Finally, the system applies the additions to the first materialized view to maintain an eventual consistency of the first materialized view with the data store.

Abstract: Systems and methods are described herein for efficiently updating a secondary index associated with a log-structured merge-tree (LSM) database. A Global approximate member query (AMQ) Filter is queried to determine whether a primary key, retrieved from a list of LSM database updates, already exists in the LSM database. If the primary key does not already exist in the LSM database then read-before-write and delete operations, typically performed with known approaches, do not need to be performed on the secondary index in order to update the secondary index, thereby avoiding significant additional computer processing and input/output operations.

Abstract: A system includes an interface and a processor. The interface is configured to receive a table indication of a data table and to receive a transaction indication to perform a transaction. The processor is configured to determine a current position N in a transaction log; determine a current state of the metadata; determine a read set associated with a transaction; attempt to write an update to the transaction log associated with a next position N+1; in response to a transaction determination that a simultaneous transaction associated with the next position N+1 already exists, determine a set of updated files; and in response to a determination that there is not an overlap between the read set associated with the current transaction and the set of updated files associated with the simultaneous transaction, attempt to write the update to the transaction to the transaction log associated with a further position N+2.

Abstract: A coordination point for assigning clients to remote backup storages includes a persistent storage and a processor. The persistent storage includes client type to remote backup storage mappings. The processor obtains a data storage request for data from a client of the clients; obtains an inferential characterization of the client; identifies a type of the client using the inferential characterization of the client; selects a remote backup storage of the remote backup storages based on the identified type of the client using the client type to remote backup storage mappings; and assigns the selected remote backup storage to service the data storage request.

Abstract: Aspects of a data environment, such as the creation, provisioning, and management of data stores and instances, are managed using a separate control environment. A user can call into an externally-facing interface of the control environment, the call being analyzed to determine actions to be performed in the data environment. A monitoring component of the control plane also can periodically communicate with the data environment to determine any necessary actions to be performed, such as to recover from faults or events in the data environment. A workflow can be instantiated that includes tasks necessary to perform the action. For each task, state information can be passed to a component in the data environment operable to perform the task, until all tasks for an action are completed. Data in the data environment can be accessed directly using an externally-facing interface of the data environment, without accessing the control plane.

Abstract: Data deduplication for data storage tapes includes intercepting tape control commands for a single data storage tape. The intercepted tape control commands are modified for adding processing logic and parameters for placement of deduplicated file data on the single data storage tape. Deduplication metadata is written to a metadata portion of the single data storage tape. The deduplicated file data is written to a data portion of the single data storage tape based on the placement to increase read throughput for a deduplicated set of individual files and to reduce an average number of per-file gaps on the single data storage tape without re-duplicating deduplicated data for meeting optimization of individual file accesses.

Abstract: A method of processing a document for searching includes obtaining document text, and generating streamlined document text. The streamlined document text is generated by: (i) discarding a plurality of strings from the document text that match any of a plurality of preconfigured low-relevance strings to generate condensed document text; (ii) in the condensed document text, replacing a plurality of content strings with respective ones of a plurality of preconfigured content class identifiers. The method further includes determining respective frequency values indicating the frequency of the content class identifiers in the streamlined document text; determining a proximity value for at least one pair of the content class identifiers in the streamlined document text; and storing a subset of the frequency values and the proximity value in the memory.

Abstract: A method and system for managing searches of a data set that is partitioned based on a plurality of events. A structure of a search query may be analyzed to determine if logical computational actions performed on the data set is reducible. Data in each partition is analyzed to determine if at least a portion of the data in the partition is reducible. In response to a subsequent or reoccurring search request, intermediate summaries of reducible data and reducible search computations may be aggregated for each partition. Next, a search result may be generated based on at least one of the aggregated intermediate summaries, the aggregated reducible search computations, and a query of adhoc non-reducible data arranged in at least one of the plurality of partitions for the data set.

Abstract: Some embodiments relate generally to the processing of compressed multidimensional data and selection of engagement rules based on the compressed multidimensional data. In some embodiments, a method includes retrieving, via a processor, a multidimensional data profile that includes a set of first inclination distributions, each associated with a data dimension. The processor matches a first set of engagement rules to the multidimensional data profile to define a matched set, each engagement rule of the first set of engagement rules having a corresponding confidence level and a corresponding set of second inclination distributions. The processor selects an engagement rule from the matched set that has a corresponding confidence level no less than a corresponding confidence level for each remaining engagement rule from the matched set, and sends a signal causing display of a stimulus to a user according to the selected engagement rule and not according to the remaining engagement rules.

Abstract: A system and method for identifying whether data skew is causing delays in a map phase and/or a reduce phase of a query of a distributed database. The system and method identify the values of various metrics relating to a database query. These metrics include map phase and reduce phase durations and various related metrics. The system and method gather statistics of multiple queries to determine correlation levels between the metrics and the map phase and reduce phase durations. Based on the statistics, the system and method determine whether one or both of the map and reduce phases for a query/response are taking longer than expected. If the durations are longer than expected, the system identifies the delay as caused by data skew and informs the originator of the query.

Abstract: In general, embodiments of the invention relate to a method and system for managing persistent storage in a local computing device. More specifically, embodiments of the invention relate to determining the amount of space that will be freed up (or become available) in the persistent storage during a data transfer using a perfect hash function. Once the amount of data to be transferred is determined, embodiments of the invention initiate the allocation of an appropriate amount of space in the remote storage device and, subsequently, initiate the transfer of the data to the remote storage device.

Abstract: Embodiments perform string similarity analysis by receiving candidate strings of a collection to be searched and transforming each candidate string into one or more features. Embodiments generate a feature index that maps each of the features to one or more candidate strings which include the features, and transform the feature index into a low-memory index by byte encoding a sorted integer array into an encoded byte array. The transforming into a low-memory index further includes hashing each feature to an integer value and storing using a tightly-packed map a hashed value to feature identification (“ID”) mapping, using a first tightly-packed list to map each of the feature IDs to one or more candidate strings which include the features, and using a second tightly-packed list to store the feature IDs.

Abstract: An arrangement of physical objects can be analyzed using a captured digital image of the arrangement and a reference display file database. A processing device communicatively coupled to the reference display file database receives the captured image depicting the arrangement of physical objects and accesses a reference display file from the reference display file database. The reference display file includes multi-viewpoint image data and scoring components. The processing device identifies at least some of the physical objects using the reference display file. The processing device scores each identified object for such attributes as presence, position and orientation using the scoring components from the reference display file, producing an overall score based on the scoring of each identified object. The processing device can then transmit the overall score to other systems.

Abstract: A voice input may be received, and from the voice input, a topic may be identified. A sentiment score for the topic may be generated using sentiment analysis on the voice input, and the sentiment score may reflect an individual's reaction to the topic. The sentiment score may be compared to a sentiment threshold. In response, one or more images may be selected, based on the topic, from an image database. The one or more images may be validated, and then displayed.

Abstract: Example embodiments herein include a system having one or more edge servers disposed in an edge site of a content delivery network (CDN). The system can include a collector for collecting analytics associated with requests for content in the CDN. One or more additional collectors can be instantiated in the system, for example, in response to an increase in recordable events detected in the CDN. The system can include an aggregator for aggregating the collected analytics with analytics collected from other edge stages of the CDN. The system can also include a data store that stores the aggregated analytics according to a configurable data model.

Abstract: In an approach for dynamically ranking SMEs, based on the SMEs' activities during a critical situation, a processor identifies SMEs to work in a collaboration channel. A processor monitors an activity of the SME within the collaboration channel. A processor receives information from the monitored activity. A processor analyzes the information from the monitored activity. A processor updates a database that contains details about a plurality of SMEs.

Abstract: Relationship extraction can include applying unsupervised relationship learning to a logic knowledge base and a plurality of entity groups recognized from a document to provide a probabilistic model. Relationship extraction can include performing joint inference on the probabilistic model to make simultaneous statistical judgments about a respective relationship between at least two entities in one of the plurality of entity groups. Relationship extraction can include extracting a relationship between at least two entities in one of the plurality of entity groups based on the joint inference.

Abstract: A mechanism is provided in a data processing system comprising at least one processor and a memory comprising instructions which, when executed by the at least one processor, causes the at least one processor to implement a network protocol based file system client for read-only exports. The file system client receives a mount request to mount an export at a file system server. The file system client stores an access type of the mounted export. Responsive to the file system client receiving from a user a modification request to perform a modification on an object in the mounted export, the file system client sends an attribute check request to the file system server. Responsive to the file system client receiving a first read-only file system error from the file system server, the file system client sets a read-only file system error flag.