Abstract: A system and method for handling file system quotas are disclosed. In one implementation, a processing device receives a first command to disable a quota capability of a file system. In response, one or more instructions are initiated to delete a first association of a quota attribute with a directory, where the first association assigns a first value to a first string comprising a combination (e.g., concatenation, etc.) of an attribute name and a first symbol. Prior to completion of the execution of the one or more instructions, one or more commands are received to enable the quota capability and assign a second value of the quota attribute to the directory. In response, a second association of the quota attribute with the directory is generated, the second association assigning a second value of the quota attribute to a second string comprising a combination of the attribute name and a second symbol.

Abstract: A system for displaying product information to a customer is described herein. The system includes a database and a server including a processor. The processor is programmed to receive a search query including a plurality of search terms via a computing device. The processor selects a search term from the plurality of search terms and determines an optionalization probability associated with the selected search term. The processor generates a search request as a function of the search query and determines whether to retain the selected search term with the search request as a function of the optionalization probability. The processor retrieves product records from the database as a function of the search request, and generates and displays a product search result including product information associated with the retrieved product records.

Abstract: A method and apparatus for migrating data. A computer system locates information about a structure used to store the data in a source database. The computer system identifies similarities between first columns in the source database and second columns in a destination database based on column names and compatible data types in the information. The computer system also displays suggestions for matches between the first columns in the source database and the second columns in the destination database on a display system based on the similarities identified. Further, the computer system receives user input to the suggestions, enabling reaching a desired level of matching to migrate the data from the source database to the destination database.

Abstract: Disclosed are systems and methods for providing a user-centric interface into an information management system. The interface may enable a user to search for, view, and modify data objects in an information management system that are associated with the user or with the user's username. The interface may also enable a user to apply administrator-like functions to the data objects associated with the user. The administrator-like functions may include content modification, deduplication operations, and storage policy adjustments, among others.

Abstract: Disclosed are examples of systems, apparatus, methods and computer program products for automatically matching start criteria and completion criteria of a walkthrough for an application or an online service. A database storing data objects identifying walkthroughs and walkthrough stages can be maintained. An indication can be received that walkthrough stages of a first walkthrough in the database have been added, removed, or modified. It can be determined that a first completion criterion associated with a first walkthrough stage of the first walkthrough and a first start criterion associated with a second walkthrough stage of the first walkthrough do not match. The first start criterion and the first completion criterion can be processed to generate a matched start criterion and a matched completion criterion. The first start criterion and the first completion criterion can be replaced with the matched start criterion and the matched completion criterion to generate a modified walkthrough.

Abstract: The present disclosure is drawn to methods and systems for providing a representative image for a search result in a search result listing of a searching system. At least one search result based on a search query is received. Each search result has a plurality of images. For each search result, a similarity score for at least some of the images is computed, based on a similarity with the search query. Then, at least one of the images is selected, on the basis of the similarity score, and the selected image is assigned as the representative image of the search result. A number of modification steps may be performed on the search result prior to computing the similarity score. The search result and assigned representative image may also be presented in a search result listing.

Abstract: Techniques for implementing a distributed, scalable key-value store (DSKVS) across a plurality of nodes are provided. In one embodiment, each node in the plurality of nodes can store: (1) a hash table in a nonvolatile storage of the node, where the hash table is configured to hold a partition of a total set of key-value data maintained by the DSKVS; (2) a logical log in the nonvolatile storage, where the logical log is configured to hold transaction log records corresponding to key-value update operations performed on the node; and (3) a cache in a volatile memory of the node, where the cache is configured to hold key-value data that has been recently updated on the node via one or more of the key-value update operations.

Abstract: A method of generating hash codes from a query vector. An ordering of dimensions is determined for a lattice hole in an A* lattice, the lattice hole being located nearest to the query vector and the ordering of dimensions represents a mapping applied to transform a canonical hole of the A* lattice to the lattice hole. An initial hash code is determined for a first point in the A* lattice, based on the query vector, using a plurality of predetermined constants. A subsequent hash code is generated for a second point in the A* lattice, from the initial hash code by modifying the initial hash code by a multiple of a constant. The constant is selected from the plurality of predetermined constants using the determined ordering of dimensions.

Abstract: Implementations of the present disclosure include methods, systems, and computer-readable storage mediums for receiving an annotated query execution plan (aQEP), the aQEP being processed to execute a query on an in-memory database in a hybrid memory system, and including one or more annotations, each annotation indicating an output of a respective operator that is to be provided as input to a join operator, determining a payload size at least partially based on an estimated size of an intermediate output of the join operator, selecting a memory type from a plurality of memory types in the hybrid memory system based on the payload size and a cache size, and storing, after execution of the aQEP, the intermediate output on the memory type in the hybrid memory system.

Abstract: Mechanisms are provided to implement an answer change notification system. The mechanisms receive a change operation to change a portion of a user profile data structure associated with a user and identify a first entry in a question and answer (QA) log data structure, corresponding to the user, having an indicator identifying a previous answer of the first entry as being dependent upon information in the user profile data structure. The mechanisms resubmit a question of the first entry to a question and answer (QA) system to generate a new answer to the question in response to identifying the entry. The mechanisms receive the new answer from the QA system and output, to a client device associated with the user, a notification identifying the new answer to the question in response to receiving the new answer.

Abstract: Disclosed are methods, systems, and non-transitory computer-readable medium for filtering vehicle information. For instance, the method may include receiving a vehicle search request from a user device, the vehicle search request including conditions with corresponding weights. The method may also include, in response to receiving the vehicle search request, forming a search query based on the conditions and the weights of the vehicle search request; obtaining vehicle information; filtering the vehicle information based on the search query to obtain a result set and a partial match set; and transmitting a search result message based on the result set and the partial match set to the user device.

Abstract: A full-text index can be created for each mailbox of an EDB to facilitate the performance of complex queries to quickly search for email data. In this way, relevant email data can be identified and retrieved quickly and efficiently from the full-text index rather than from the EDB. To create such indexes, each email in a mailbox can be retrieved and processed to convert the email from its native format into textual name/value pairs which can then be submitted for indexing. This use of name/value pairs to index each email enables the emails across all mailboxes to be efficiently queried using any possible combination of values.

Abstract: A system including a data center hosting a representational state transfer (REST) server in communication with a client network, wherein the REST server includes a GraphQL schema describing tables and fields of a communicatively coupled database. The REST server is configured to: receive a request that includes a GraphQL query; open a streaming connection to the client network; and output a beginning of a response via the streaming connection. The REST server is also configured to process the GraphQL query based on the GraphQL schema to generate a GraphQL result, and to output the GraphQL result in a body of the response via the streaming connection. The REST server is further configured to output an end of the response via the streaming connection, such that the response is correctly formatted in JavaScript Object Notation (JSON).

Abstract: Various examples are directed to systems and methods for executing distributed transactions with dynamic form. A transaction coordinator may send to a first transaction node a commit request indicating a first transaction operation and a first object and receive an indication that the first transaction node holds a lock for the first object. The transaction coordinator may also send to a second transaction node a commit request indicating a second transaction operation and a second object and receive an indication that the second transaction node is one-phase-aware. If the number of enrolled transaction nodes includes at least a threshold number of nodes, the distributed transaction may be converted to a compensation transaction.

Abstract: A device may generate, in a first data structure of a first system, a data lineage record. The data lineage record may include attributes that are common among a plurality of records of the first data structure. The data lineage record may be used to map the first data structure and a second data structure of a second system. The device may populate the data lineage record with unique values for the attributes. The unique values may be used to identify the attributes of the data lineage record after the data lineage record has been included in the second data structure. The device may provide, from the first system, data included in the first data structure to the second system. The data lineage record may be included in the data provided to the second system. The device may perform an action related to the data provided to the second system.

Abstract: An apparatus comprises a processing platform configured to implement an analysis and visualization tool utilizing a mixture of multiple reliability measures to characterize each of a plurality of product and part combinations. The analysis and visualization tool comprises a data aggregation module configured to extract product and part data from a big data repository, a reliability measure generator configured to process the extracted product and part data to generate a plurality of reliability measures for each of a plurality of different product and part combinations, a mixture model module configured to compute a score from the plurality of reliability measures for each of the different product and part combinations, and a visualization module configured to generate at least one visualization as a function of the scores computed for the respective different product and part combinations. The generated visualization may comprise a quadrant plot view visualization displaying the computed scores.

Abstract: An apparatus comprises a processing platform configured to implement an expert recommender engine. The expert recommender engine receives information relating to a communication from a user device, and identifies at least one subject matter expert for the communication based on the received information and unstructured text data of a service events database. The expert recommender engine is associated with a clustering module that separates the unstructured text data into topic clusters. The expert recommender engine comprises a collaborative filtering module that receives the topic clusters from the clustering module and utilizes the topic clusters to identify the subject matter expert. The user device is connected with an expert device corresponding to the identified subject matter expert. The expert recommender engine may utilize structured data, social media data and customer satisfaction survey data in combination with the received information and the topic clusters to identify the subject matter expert.

Abstract: A computer-implemented technique performs block deduplication. The technique involves generating a list of candidate blocks and adding classifications to the list of candidate blocks. The classifications classify the candidate blocks on the list into different categories based on a set of block sequence matching criteria. The technique further involves performing, based on the classifications added to the list of candidate blocks, further block deduplication processing on first candidate blocks having a first classification while not performing further block deduplication processing on second candidate blocks having a second classification. Examples of the categories include an “exact long match” category, a “disrupted long match” category, a “loosely long match” category, and a “short match” category.

Abstract: According to an aspect, a database system for integrating calculation models into execution plans includes a first engine configured to parse a query to be applied on a database. The first engine is configured to invoke a second engine during query compilation. The second engine is configured to instantiate a calculation model based on the query, and the second engine is configured to derive a converted calculation model by converting the calculation model into a format compatible with the first engine. The first engine is configured to incorporate the converted calculation model into an execution plan during the query compilation and execute the query on the database according to execution plan.