Abstract: Embodiments provide a computer-executable method, computer system and non-transitory computer-readable medium for programmatically processing text information to generate attribute descriptors contained therein. The method includes programmatically accessing, via a network device, a textual unit, the textual unit associated with a commercial entity or a commercial object. The method also includes executing a text processing engine to programmatically generate an attribute descriptor from the textual unit. The method further includes storing, on a non-transitory computer-readable storage device, the attribute descriptor in association with identification of the commercial entity or the commercial object.

Abstract: Embodiments are directed to managing visualizations of data. Visualizations that include one or more marks associated with values from a data source may be provided. A mark-of-interest may be determined from the one or more marks. Assessment models may be employed to generate assessment results for the assessment models based on the mark-of-interest and the data from the data source such that each assessment result may be associated with scores that may be based on a best fit to the data from the data source and a value of the mark-of-interest. The assessment results may be rank ordered based on their association with the scores. A report that includes the rank ordered list of the assessment results may be provided.

Abstract: Systems, devices, and methods discussed herein provide improved autonomous agent applications that are configured to generate automated answers to a complex query (e.g., a query that includes more than one search parameter). A user query comprising a complex query may be received and decomposed into a number of simple queries. A simple query may be executed with a search engine to obtain a set of search results. An answer for the simple query may be obtained from the search results and then substituted for a term of the next simple query identified from the complex query. The next simple query may then be executed to obtain another set of search results. These steps may occur any suitable number of times. An answer for the complex query may be generated based at least in part on the answers one or more of the simple queries.

Abstract: A method for personalizing reviews for a user on a social network, comprising the steps of: receiving from at least two or more users a rating and a recommendation for a reviewable item, wherein the rating is numerical value in a rating scale, and wherein a recommendation is a binary endorsement; receiving a request from a user to view the ratings and recommendations for one or more reviewable items; determining a combined rating and an combined recommendation for all users of the social network at one or more social degrees for the one or more reviewable items; and displaying, by a user interface, the combined rating and combined recommendation for all users of the social network at one or more social degrees for the one or more reviewable items.

Abstract: Embodiments are directed to traversing a file system to determine file system objects to copy to an object store. In response to visiting a document object in the file system, performing further actions, including: determining a hierarchical file path of the document object that corresponds to a location in the file system based on the file system objects that are ancestor file system objects of the document object; generating an object key for the document object that encodes the hierarchical file path such that each portion of the object key corresponds to an ancestor file system object; copying the document object and the object key to the object store such that the document object may be stored in the object store as an object store object and such that the object store object may be indexed using an unordered index based on the object key; or the like.

Abstract: Embodiments of the present invention provide a new multi-level data structure, log-structured merge bush (LSM-bush), to alleviate the performance compromise between LSH-table and LSM-tree data structures. Similar to LSM-tree, LSM-bush may buffer writes in memory, merge the writes as sorted runs across multiple levels in storage, and use in-memory fence pointers and Bloom filters to facilitate lookups. LSM-bush differs from LSM-tree in that it allows newer data to be merged more “lazily” than LSM-tree. This can be achieved by allowing larger numbers of runs to be collected at the smaller levels before merging them.

Abstract: A configuration for a key management system is provided for managing cryptographic keys in cryptosystems. The configuration includes the use of database replication to improve the reliability, accessibility, and partition tolerance of the key management system. The configuration also includes the use of database sharding and distributed networks to improve the functionality of the key management system. From a logical level, the system can appear multi-master because client software can connect with any compute node in a plurality of compute nodes and perform key management operations on the entire key database from that compute node. From a physical level, the system can be a master-slave configuration with each database shard replication group having a single master shard instance and one or more slave shard instances. In some examples, the present disclosure provides better redundancy, load balancing, availability, and partition tolerance for key management systems.

Abstract: A system to improve real-time generation of a graphical user interface for overlapping electronic content is described. The system retrieves, responsive to a search request input into a computing device and received via a computer network, places of interest from a places of interest database, and content items from a content item database. The system selects, based on a heuristic technique, a content item as a match for a place of interest. The system combines the content item with the place of interest to prevent a first marker of the content item from obscuring a second marker of the place of interest. The system renders, for display on the graphical user interface via the computing device, a single marker for the content item and the place of interest combined to prevent the first marker of the content item from obscuring the second marker of the place of interest.

Abstract: Embodiments presented herein disclose techniques for capturing a snapshot of a file system object (e.g., a file or a directory) that is associated with a write journal having outstanding data. A bridge process in a storage server receives a request to capture a snapshot of a file system object. The snapshot is a backup of a state of the file system object in a given point in time. Upon determining that the file system object has one or more outstanding updates recorded in a write journal, the bridge process generates a copy of the write journal. The bridge process captures the snapshot of the file system object. The bridge process also associates the copy of the write journal with the snapshot of the file system object.

Abstract: Various implementations of the invention provide load balancing in a data storage system. A computing processor receives a request to create a new data storage container on a selected one of a plurality of data storage assets, where each of the plurality of data storage assets is configured to host a plurality of data storage containers. The computing processor determines which of the plurality of data storage assets is farthest away from an existing data storage container corresponding to the new data storage container and creates the new data storage container on the data storage asset that is farthest away from the existing data storage container.

Abstract: Techniques for searching documents are described. An exemplary method includes receiving a document search query; querying at least one index based upon the document search query to identify matching data; fetching the identified matched data; one or more of a top ranked passage and top ranked documents from the set of documents based upon one or more invocations of one or more machine learning models based at least on the fetched identified matched data and the document search query, wherein at least one of the machine learning models has been trained for the third party; and returning one or more of the top ranked passage and the proper subset of documents.

Abstract: A system and method for translating and matching attributes in data records that describe travel items is provided. In an embodiment, a plurality of records is received from a plurality of data sources. Record parsing logic is used divide strings in the records into individual words and match single words in the plurality of records to attributes. Using the matched attributes, record comparison logic creates a confidence score that describes the likelihood that two records describe the same listing or inventory item. If the confidence score exceeds a given threshold, the records are determined to match. A consolidated record is then created from the two matched records.

Abstract: A Controlled Environment Secure Media Streaming System with Digital Video Recording (DVR) manages the delivery of content to Secured Devices. Cloud Services provide content to Integration Hub. The Integration Hub interfaces with various cloud services providers and prepares content for consumption by a resident of a secured facility. Integration Hub utilizes Content Filter to inspect content received from cloud service providers for suitability for use in a secured environment. Once content is retrieved, filtered, formatted, and packaged by Integration Hub, the content is stored in Data Warehouse. When requested content is not available, the system schedule a future retrieval or DVR of the content when it becomes available. When the system detects that the content is stopped, the system creates a bookmark, so the user can resume the content at the bookmarked portion at a later time.

Abstract: Disclosed is a system and method for resolving conflicts that arise in changes made to data by multiple client devices. A data manipulation operation is represented as a changeset, which has instructions for performing an operation on the data. When two client devices perform operations that change the state of a data object, a changeset is generated at each of the two client devices. These changesets are merged at each of the two client devices based on merging rules that resolve any conflict between the operations. The rules ensure that the data at each of the multiple client devices will eventually be consistent.

Abstract: One or more storage locations of file inodes in a data source to be backed up are identified. Filesystem metadata information is extracted from the one or more identified storage locations. At least one item of the extracted filesystem metadata information includes a reference to a parent inode. The extracted filesystem metadata information is stored in a data structure. The contents of the data structure are analyzed to index a relationship structure of file system contents of the data source.

Abstract: A computer-implemented method is provided.

Abstract: Systems and methods are disclosed for comparing annotations in files to show changes in the annotations at a granular level. In one implementation, a system receives a first file and a second file for comparison. The system determines the annotation ranges for each annotation in the first file and the annotation range for each annotation in the second file. The system then determines the annotations from the first file that overlap with annotations from the second file and compares annotations that overlap. The system then incorporates the comparison of the annotations into a main comparison file. In certain implementations, the system uses an index to determine what annotations overlap. In other implementations, matched pairs are created from overlapping annotations.

Abstract: A merge join method by a merge join system including a database is provided. The merge join system unequally divides data after a current position of a join column participating in merge join in the database into K partitions, K being greater than 2, and compares the first value of each of remaining partitions excluding the first partition from the K partitions with a value to be searched for the merge join, in order to check whether the first value and the value to be searched satisfy a specific condition. Further, the merge join system determines a partition in which the value to be searched is expected to exist based on a comparison result, and applies a k-ary search to the determined partition.

Abstract: Apparatuses, methods, and systems are provided for making sequential recommendations using transition regularized non-negative matrix factorization. A non-application specific collaborative filtering based personalized recommender system can recommend a next logical item from a series of related items to a user. The recommender system can recommend a next desirable or series of next desirable new items to the user based on the historical sequence of all user-item preferences and a user's most recent interaction with an item. An asymmetric item-to-item transition matrix can capture aggregate sequential user-item interactions to design a loss function for matrix factorization that incorporates the transition information during decomposition into low-rank factor matrices.

Abstract: An authenticated modular map library may support partial state for a key-value store. A key-value store may be created that is organized as a tree data structure that divides items into pages. Features to access the key-value store may also be specified when the key-value store is created. A portion of the key-value store may be sent to a participant of a blockchain network, which may attempt to access an item to be found in a page in the key-value store according to the specified features. If the page is not included in the portion, the page may be requested from another participant, received, and verified before being used to complete the attempted access of the item.