Abstract: An embodiment of the invention may include a method, computer program product, and system for data management. The embodiment may include receiving a login token and instruction from a user device. The login token is associated with a user of the user device. The instruction may be reading or writing profile data belonging to the user. The embodiment may include determining whether a user profile container exists for the user based on the received login token. The embodiment may include creating the user profile container for the user based on determining that the user profile container does not exist. Creating the user profile container for the user may include identifying profile data belonging to the user located in a plurality of locations within a file system and storing identified profile data belonging to the user within a single binary large object. The embodiment may include executing the received instruction.

Abstract: A procedural pattern in a received query execution plan can be matched to a stored pattern for which an equivalent declarative operator has been pre-defined. The query execution plan can describe a query for accessing data. A hybrid execution plan can be generated by replacing the procedural pattern with the equivalent declarative operator. A hybrid execution plan processing cost can be assigned to execution of the hybrid execution plan and a query execution plan processing cost can be assigned to execution of the query execution plan. The assigning can include evaluating a cost model for the hybrid execution plan and the query execution plan. The query can be executed using the hybrid execution plan if the hybrid execution plan processing cost is less than the query execution plan processing cost or the query execution plan if the hybrid execution plan processing cost is greater than the query execution plan processing cost. Related systems, methods, and articles of manufacture are disclosed.

Abstract: A method, computer-readable medium, and a computer system for automatically generating sentiment data are disclosed. One or more portions of at least one document may be determined to be associated with at least one sentiment of one or more other portions of the at least one document. One or more scores associated with the at least one sentiment may be automatically determined based on at least one respective attribute of the one or more portions. The at least one respective attribute may include a positive category, a negative category, a neutral category, a degree associated with a positive sentiment, a degree associated with a negative sentiment, some combination thereof, etc. In this manner, data associated with sentiment of one or more portions of at least one document may be generated.

Abstract: Content objects are associated with metadata via content identifiers that are derived from sensed signals captured by requesting mobile devices. In response to a content based query from a mobile device, content fingerprints and extracted digital codes decoded from the sensed signals are issued to a network based router system. This system determines identification priority, metadata responses associated with different forms of identification, and priority of metadata responses to the query.

Abstract: The relevance or ranking of various dynamically-determined instances of content can be adjusted or otherwise improved based on aspects such as the freshness or seasonality of the content. In many conventional relevance or ranking algorithms, factors such as popularity, performance, and profit are used to determine which content to present to a user, as well as how to display the selected content. Such algorithms do not necessarily reflect domain-specific knowledge very well, and thus fail to accurately select content that is of differing levels appeal at various ages of the content and/or during various seasons of the year. Freshness and/or seasonality adjustment scores can be used to generate improved relevance, selection, or ranking determinations for various categories of content.

Abstract: In one embodiment, a method receives a query for data in a database system and calls a plurality of engines to analyze information for the query. A calculation graph is generated from at least a portion of the plurality of engines where each of the at least a portion of the plurality of engines add a node to the calculation graph based on analyzing of the information for the query. Then, the method executes the query by calling the nodes of the calculation graph. Each node uses metadata added to the node from a respective calculation engine to perform a calculation for the node. Then, a result of the query is output based on the respective calculations performed by the nodes.

Abstract: Methods and systems for selecting listing based on a click predictions score are disclosed. The server system includes one or more processors, memory, and one or more programs stored in the memory. The server system receives a search query from a client system. In response to receiving the search query, the server system identities a plurality of item listings relevant to the received search query. For each identified item listing, the server system generates a click prediction score, wherein a click predication score represents the estimated likelihood that a user will click on the listing. The server system ranks the plurality of item listings based on the generated click prediction score and selects a predetermined number of the item listings for transmission to the client system based on their ranking and associated click prediction score. The server system transmits one or more item listings to the client system for display.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to crawling content and provide a novel and non-obvious method, system and computer program product for seed lists for hierarchically structured content sources. In one embodiment, a method for crawling seed lists for hierarchically structured content sources can be provided. The method can include specifying a depth of crawling for hierarchically structured content, crawling only seed lists at the specified depth among other seed lists in a hierarchy of seed lists mimicking the hierarchically structured content, and returning indexed data for the crawled seed lists. Optionally, an administrator user interface can be provided for specifying the depth of crawling for the hierarchically structured content.

Abstract: A computer system identifies an information set stored at a data store. The computer system then identifies first metadata that includes first instructions indicating how the information set is to present a plurality of data items, and second pre-existing metadata that includes second instructions indicating how the information set is to present the plurality of data items. The computer system determines that a portion of the first metadata will override a portion of the second metadata, to create combined metadata. The computer system provides the combined metadata to the information set, including combining the second metadata with the first metadata by at least overriding the second instructions of the second metadata with the first instructions of the first metadata. The computer system presents the plurality of data items in accordance with the second metadata, at least as modified by the first instructions of the first metadata.

Abstract: Embodiments are directed to managing documents where clauses in a document may be identified. Evaluations of the clauses may be provided based on evaluators and machine learning (ML) models that assign each of the clauses to a category and a confidence score. Actions associated with the clauses may be monitored including updates to content of the clauses. Inconsistent evaluations associated with the clauses be identified. The ML models may be retrained based on the content of the clauses associated with the inconsistent evaluations.

Abstract: A method, apparatus, and system for a time-based checkpoint target is provided for standby databases. Change records received from a primary database are applied for a standby database, creating dirty buffer queues. As the change records are applied, a mapping is maintained, which maps timestamps to logical times of change records that were most recently applied at the timestamp for the standby database. On a periodic dirty buffer queue processing interval, the mapping is used to determine a target logical time that is mapped to a target timestamp that is prior to a present timestamp by at least a checkpoint delay. The dirty buffer queues are then processed up to the target logical time, creating an incremental checkpoint. On a periodic header update interval, file headers reflecting a consistent logical time for the checkpoint are also updated. The intervals and the checkpoint delay are adjustable by user or application.

Abstract: Described are methods, systems, and apparatus, including computer program products for de-duplicating access control lists (ACLs). A first ACL associated with a first computer file is received. A first checksum based at least in part on the first ACL is calculated. One or more directory entries based on the first checksum are retrieved from a de-duplication directory, wherein each directory entry of the one or more directory entries comprises a reference to an ACL and a name comprising the first checksum. A directory entry of the one or more directory entries is identified that references a second ACL that specifies the same permissions as the first ACL. A reference to the second ACL of the directory entry is added to the first computer file.

Abstract: Each of a plurality of media clips accessed by a user is scored by analyzing metadata associated with the media clips. A representative subset of the media clips is selected based on the scoring. A visual representation of the representative subset of the media clips is displayed.

Abstract: In one embodiment, a system and method is illustrated including receiving a feedback request identifying a particular user, retrieving a feedback entry in response to the feedback request, the feedback entry containing a first term, building a scoring model based, in part, upon a term frequency count denoting a frequency with which the first term appears in a searchable data structure, mapping the first term to a graphical illustration based upon a second term associated with the graphical illustration such that the graphical illustration may be used to represent the second term, and generating a feedback page containing the first term and the graphical illustration. The method may include assigning a value to the first term so as to identify the first term, assigning the first term to the searchable data structure, and extracting the first term from the searchable data structure based, in part, upon an extraction rule.

Abstract: A system and method for automated multi-channel customer journey testing, that links communication channels and follows a customer interaction across multiple channels as a single journey, incorporating data and interaction content from each channel utilized to maintain a “big picture” view of a customer's journey across these channels during an interaction. The invention also provides flexible success indicators to accommodate virtual assistant and chat bot programs, by accommodating variances in expected test results such as to handle natural language variance, time of day, context, and other factors that may cause variances in interaction content.

Abstract: Embodiments of the present disclosure provide for a method and system for storing content based on one or more attributes associated with the content. Specifically, the present disclosure provides for determining storage capabilities of one or more storage devices associated with a computing device and also determining a retention policy associated with the content. In certain embodiments, the retention policy is identified by the one or more attributes. When the retention policy and the capabilities of the one or more storage devices have been determined, the content is written to the one or more storage devices based on the retention policy.

Abstract: A method begins by a dispersed storage (DS) processing module receiving a request for a data index list that identifies data objects having one or more common attributes, searching a hierarchical ordered index structure to identify a data object level index node corresponding to a first data object boundary match, and determining whether the data object level index node corresponds to a second data object boundary match. When the data object level index node does not correspond to the second data object boundary match, the method continues with the DS processing module searching an adjacent data object level index node to determine whether the adjacent data object level index node corresponds to the second data object boundary match. When the adjacent data object level index node corresponds to the second data object boundary match, the method continues with the DS processing module generating the data index list.

Abstract: A system includes a first application executable on a first electronic device. The system further includes a second application executable on a second electronic device in communication with the first electronic device. The second electronic device is configured to store a first electronic file. Subsequent to a user modifying the first electronic file, the second application is operable to automatically transfer the modified first electronic file, or a copy thereof, to the first electronic device. The system further includes a third application executable on a third electronic device in communication with the first electronic device. The third electronic device is configured to store a second electronic file. Subsequent to the user modifying the second electronic file, the third application is operable to automatically transfer the modified second electronic file, or a copy thereof, to the first electronic device.

Abstract: A lock manager configured for locking files is tested. As part of the test and based on a lock assignment plan, a process acquires locks on portions of the files. Based on a lock testing plan, a second process performs a lock verification for a portion of the locked portions. A result of this lock verification is compared to its expected result. Based on an updated lock assignment plan, the process transitions from the locks to other locks on other portions of the files. Based on an updated lock testing plan, the second process performs a second lock verification for a portion of the other locked portions. A result of this second lock verification is compared to its expected result. Based at least in part on the two comparisons, the lock manager is evaluated.

Abstract: Techniques for category-based content recommendation are described. Some embodiments provide a content recommendation system (“CRS”) configured to recommend content items (e.g., Web pages, images, videos) that are related to specified categories. In one embodiment, the CRS processes content items to determine entities referenced by the content items, and to determine categories related to the referenced entities. The determined entities and/or categories may be part of a taxonomy that is stored by the CRS. Then, in response to a received request that indicates a category, the CRS determines and provides indications of one or more content items that each have a corresponding category that matches the indicated category. In some embodiments, at least some of these techniques are employed to implement a category-based news service.