Abstract: Systems, methods, and computer-readable media for managing storing of data in a data storage system using a client tag. In some examples, a first portion of a data load as part of a transaction and a client identifier that uniquely identifies a client is received from the client at a data storage system. The transaction can be tagged with a client tag including the client identifier and the first portion of the data load can be stored in storage at the data storage system. A first log entry including the client tag is added to a data storage log in response to storing the first portion of the data load in the storage. The first log entry is then written from the data storage log to a persistent storage log in persistent memory which is used to track progress of storing the data load in the storage.

Abstract: A method and apparatus for performing storage and retrieval in an information storage system cache is disclosed that uses the hashing technique with the open-addressing method for collision resolution. Insertion, retrieval, and deletion operations are limited to a predetermined number of probes, after which it may be assumed that the table does not contain the desired data. Moreover, when using linear probing, the technique facilitates maximum concurrent, multi-thread access to the table, thereby improving system throughput, since only a relatively small section is locked and made unavailable while a thread modifies that section, allowing other threads complete access to the remainder of the table.

Abstract: Methods and systems may be associated with a cloud platform computing environment. A mapping expression data store may contain mapping expressions previously created by customer tenants of the cloud platform. Each mapping expression may be associated with at least one source mapping element and at least one target mapping element. A mapping expression generator may receive, from a user of a first customer tenant, a mapping expression search request that includes at least one requested source mapping element and at least one requested target mapping element. The mapping expression generator may then search the mapping expression data store based on the at least one requested source mapping element and at the least one requested target mapping element and output a result of the search to the user. The result of the search may include at least one mapping expression created by a customer tenant other than the first customer tenant.

Abstract: An example computer implemented method for updating a first version of a content item on a client device. The example method includes recording an indicator that the first version is going to be updated to a second version of the content item. The computer can then begin updating the first version of the content item to the second version of the content item. Next, the computer can determine that the updating of the content item was interrupted. The computer can then determine if the second version of the content item is the same version as a current version of the content item. The computer can then change a description in a cache and the indicator accordingly.

Abstract: A method enables identification of a similarity level between a user-provided data item and a data item within a set of data documents. The method includes a representation generator determining, for each term in an enumeration of terms, occurrence information. The representation generator generates, for each term, a sparse distributed representation (SDR) using the occurrence information. The method includes receiving, by a filtering module, a filtering criterion. The method includes generating, by the representation generator, for the filtering criterion, at least one SDR. The method includes generating, by the representation generator, for a first of a plurality of streamed documents received from a data source, a compound SDR. The method includes determining, by a similarity engine executing on the second computing device, a distance between the filtering criterion SDR and the generated compound SDR. The method includes acting on the first streamed document, based upon the determined distance.

Abstract: A method, a system, and a computer program product for performing on-demand feature extraction from a raw image of an object for analysis. A query is executed to retrieve an image of an object. Using one or more parameters of the query, a raw image of the object is compressed to generate a compressed image of the object. One or more features associated with the object are extracted from the compressed image of the object. Based on the compressed image of the object, the image of the object is generated using the extracted one or more features of the object.

Abstract: An enhanced multidimensional data management system significantly reduces the resources required to convert a spreadsheet into an enterprise collaborative system. A spreadsheet may be imported as is without modifications. Additional information that cannot be automatically inferred about the data model used in the spreadsheet is obtained. Dimensions, timescale, and measure data are clearly defined and located. The spreadsheet is kept in the system in the form of both a spreadsheet and as a multidimensional data structure such as an online analytical processing (OLAP) cube or structure. This duality allows the spreadsheet to be manipulated as if it was an OLAP cube, modifying iterations within the dimensions, and the OLAP cube to be computed as if it was a spreadsheet.

Abstract: A computing system, program products and computer-implemented method of exploring data comprises accessing data structures and executing an interaction loop. Data structure captures connected graph nodes associated with attributes containing human-readable data. Interaction loop receives user-selected attributes associated with focal nodes and executes subroutines to determine layouts of an arborescence extending from focal nodes. The subroutines use starting nodes and pivot attributes as arguments. Identifying nodes of subroutines are connected to starting nodes by walking the graph and comparing pivot attributes with attributes associated with connected nodes, obtaining distance-dependent quantities. Subroutines compute layout data, including coordinates of the connected nodes. Coordinates are determined in accordance with the distance-dependent quantities. Interaction loop displays arborescence according to the layout data.

Abstract: Techniques are provided for automatic discovery of data records. One method comprises obtaining data records each corresponding to a different item and comprising features extracted from a data source, wherein the data records identify related items identified using a collaborative filter that relates items based on user preferences; generating an item network comprising multiple nodes each corresponding to a different item, where two nodes are connected by an edge based on: (i) an item type of the two nodes, (ii) a ratio of numerical values associated with the two nodes, and/or (iii) a pairwise configuration similarity score for the two nodes; clustering the nodes into node clusters based on topological properties of the item network; and identifying items related to a given item that (i) share an edge with the given item and (ii) are in a node cluster comprising a node of the given item.

Abstract: A method for providing automated customer feedback monitoring in real-time to facilitate identification and resolution of errors is disclosed. The method includes ingesting, via an application programming interface, data from a source, the data including feedback information from a customer; persisting the data in a file format, the file format including a tabular file format; filtering the persisted data based on a rating and a keyword; identifying a category for the filtered data based on a characteristic of the filtered data; determining whether a log file corresponds to the filtered data based on the identified category, the log file including an error log file that corresponds to an issue, and when the log file corresponds to the filtered data; correlating the filtered data with the determined log file; and determining a priority level for the issue by using the correlated data and the log file.

Abstract: A method for mining an entity relationship, apparatus, electronic device, and a storage medium are provided. An implementation of the method may include: searching, in a query statement set, for a query statement satisfying a preset condition corresponding to a target entity word; in response to at least one query statement satisfying the preset condition corresponding to the target entity word being found in the query statement set, mining an associated entity word corresponding to the target entity word based on the found at least one query statement satisfying the preset condition corresponding to the target entity word.

Abstract: Symbolic link based placeholders are used for cloud stored data synchronization. To synchronize cloud stored data, placeholders may be implemented as bidirectional symbolic links to a location that has a custom virtual file system (VFS) mounted. When a symbolic link is opened, the operating system may be directed to the custom VFS. The custom VFS may hydrate the file through a synchronization engine, and place the hydrated file at the location of the original symbolic link. The custom VFS may then redirect back to the primary file system of the operating system to allow the operation on the file to complete. Complexity and resource consumption may be reduced by passing placeholder requests instead of all requests through the custom VFS.

Abstract: Techniques are provided for supporting a lookup structure for a file system implementing hierarchical reference counting. A write operation to write data to a page maintained by the file system is received. A lookup within a lookup structure is performed using information related to the page in order to identify a lookup entry within the lookup structure. A hash generation count within the lookup entry is compared to a file system info generation count within a file system info object for a volume associated with the page. In response to the lookup entry generation count not matching the file system info generation count, a file system tree of the file system is traversed to determine a reference count for the page, and the write operation is implemented based upon the reference count. Otherwise, the lookup entry is utilized to access the page for processing the write operation.

Abstract: The described embodiments include a computing device that enables the placement of data guards on data items (e.g., files, data in an application, etc.). The data guard is associated with a conflict priority that is used to determine users that are permitted to make changes to the data item. When the data guard has been placed, the data item is visually identified (e.g., when displayed on a display) as being guarded. In addition, the computing device includes various mechanisms for enabling synchronization of data items between computing devices.

Abstract: Systems and methods are provided for indexable and searchable replay of website user behavior. The method includes recording actions of users on a website; grouping the recorded actions into a plurality of sessions; defining a plurality of critical events for at least one webpage of the website, wherein each of the critical events represents a possible action of the users on the at least one webpage; labeling each critical event with a time stamp; receiving a request to replay one of the sessions; and responsive to the request, replaying the one of the sessions according to the time stamps.

Abstract: A method, apparatus, computer system, and computer program product for managing information. A set of bucket hashes and comparison information for a data record are identified by a computer system. The set of bucket hashes is generated from the comparison information, wherein the set of bucket hashes and the comparison information form a metadata record. A number of candidate metadata records in a metadata database is identified by the computer system using the set of bucket hashes, wherein the number of candidate metadata records comprises a set of candidate bucket hashes and candidate comparison information. An entity membership is identified by the computer system for the data record from a comparison of the comparison information in the metadata record with the candidate comparison information in the number of candidate metadata records.

Abstract: A context-based recommendation system for feature search automatically identifies features of a feature-rich system (e.g., an application) based on the program code of the feature-rich system and additional data corresponding to the feature-rich system. A code workflow graph describing workflows in the program code is generated. Various data corresponding to the feature-rich system, such as help data, analytics data, social media data, and so forth is obtained. The code workflow graph and the data are analyzed to identify sentences in the workflow. These sentences are used to a train machine learning system to generate one or more recommendations. In response to a user query, the machine learning system generates and outputs as recommendations workflows identified based on the user query.

Abstract: In an aspect, an interactive electronic map module displays, from a screen, a geographical layout that includes land area divided into zip code regions defined by respective zip codes. Responsive to user selection in the land area, the selected zip code region is highlighted. Online dating candidates are filtered based on location within the selected zip code region. In another aspect, the module is configured for: a) interactively with the user, drawing for display a continuous line by, starting from a starting point, advancing to a current ending point; b) in real time, detecting user disengagement from the drawing; and c) responsive to detecting disengagement, highlighting display of the at least one enclosed area that was formed if the starting and current ending points are already connected or, if the starting and current ending points are not already connected, would be formed by connecting the points with a straight line. Filtering is based on location within an enclosed area.

Abstract: A method, an electronic device, and a computer program product for obtaining a hierarchical data structure and processing a log entry is disclosed. The method for obtaining the hierarchical data structure includes: obtaining corresponding characteristic information included in each log entry of a set of log entries and determining multiple log entry patterns based on the corresponding characteristic information. The pattern characteristic information of each log entry pattern corresponds to the characteristic information of a subset of log entries in the set of log entries. The method also includes storing the set of log entries according to the hierarchical data structure so that each log entry is associated with at least one of multiple nodes of the hierarchical data structure. The multiple nodes respectively correspond to the multiple log entry patterns, and are hierarchically organized based on respective corresponding log entry patterns.

Abstract: A method, computer program, and computer system is provided for query matching of sentences based on co-attention scores. Two or more query inputs to a neural network are received. A correlation factor between the two or more query input is identified based on attention weights. A feature vector is generated based on the attention weights. A probability value corresponding to the two or more query inputs is determined based on the generated feature vector.