Abstract: A method for determining a configuration knob of a database is disclosed, and may be applied to a database management system. In this method, vectorization coding is performed on a query statement, to obtain a target feature vector of the query statement, and then a configuration knob set for determining the database is determined based on two aspects of double-state information: the target feature vector and current status information of the database (101). The configuration knob set is used to execute N query statements. The configuration knob of the database (101) may be dynamically determined based on the query statement and the current status information of the database (101), so that good performance of the database (101) in a case of different workload requirements, for example, performance in aspects of a delay and a throughput, can be ensured.

Abstract: An apparatus comprises a processing device configured to receive, at a given node of a distributed file system cluster, a request to store one or more portions of data and to monitor performance parameters for each storage device associated with the given node, the performance parameters comprising a first performance parameter characterizing data access frequency and at least a second performance parameter characterizing available space. The processing device is also configured to determine an overall performance metric for each of the storage devices associated with the given node based at least in part on the monitored performance parameters and to select, based at least in part on the overall performance metrics, at least one of the storage devices associated with the given node on which to store the one or more portions of data.

Abstract: A method for on-demand access to table partitions may include receiving, at a data execution engine, a query accessing a database table divided into a first partition and a second partition stored at different nodes of the database. The data execution engine may respond to the query by acquiring a lock on the database table and instantiating data structures to support the execution of the query without loading any of the partitions of the database table into a main memory. Instead, the loading of the individual partitions of the database table may be delegated to the operators tasked with performing the operations included in the execution plan for the query. Each operator may refrain from loading those partitions of the database table that are determined to be unnecessary for performing the individual operations. Related systems and computer program products are also provided.

Abstract: A method, apparatus, and computer program product for executing a relational database management system (RDBMS) in a computer system, wherein the RDBMS manages a relational database comprised of one or more tables storing data. The RDBMS executes a query with a semi-join operation comprising an inclusion join and/or an exclusion join performed against at least an outer table and an inner table, wherein the inclusion join returns a row from the outer table when there is a match with a row in the inner table, and the exclusion join returns a row from the outer table when there is no match with a row in the inner table. The RDBMS performs a rewrite of the query to avoid spooling and/or sorting of the inner table, when the inner table is larger than the outer table and a cost after the rewrite is lower than before the rewrite.

Abstract: A transaction request compliant with a first version of a journal schema of a multi-data-store storage system is received at a journal manager. The journal schema indicates attributes of data objects which may be materialized at various data stores of the system. The journal manager stores an entry in the system's journal if the transaction meets acceptance criteria. Writes indicated in the entry are materialized at the data stores after verifying that the entry is compliant with the journal schema. After verifying that member data stores have approved a proposed change to the journal schema, another entry indicating a different version of the journal schema is added to the journal. Client-side components of the system obtain the current version of the journal schema to prepare the transaction requests.

Abstract: The exemplary embodiments disclose a method, a computer program product, and a computer system for protecting sensitive information. The exemplary embodiments may include using an inverted text index for evaluating one or more statistical measures of an index token of the inverted text index, using the one or more statistical measures for selecting a set of candidate tokens, extracting metadata from the inverted text index, associating the set of candidate tokens with respective token metadata, tokenizing at least one document resulting in one or more document tokens, comparing the one or more document tokens with the set of candidate tokens, selecting a set of document tokens to be masked, selecting at least part of the set of document tokens that comprises sensitive information according to the associated token metadata, masking the at least part of the set of document tokens, and providing one or more masked documents.

Abstract: A method includes obtaining an input sequence and first and second word sequences of metadata of a plurality of datasets. The method also includes determining a set of scores including first scores and second scores by determining first scores by determining a score of the first scores based on a count of the word sequence of the first word sequences in the metadata without determining a count of the input sequence. The method also includes determining second scores by determining a score of the second scores based on a count of a second sequence of the second word sequences in the metadata. The method also includes determining an additional word for a predicted sequence including the input sequence based on the set of scores and retrieving a set of datasets based on the predicted sequence.

Abstract: According to an embodiment, a display control apparatus includes a clustering unit, a sub-clustering unit, and a display control unit. The clustering unit is configured to classify images into a plurality of clusters based on similarity degrees of the images and a first threshold. The sub-clustering unit is configured to further classify images within each of the plurality of clusters into a plurality of sub-clusters based on the similarity degrees and a second threshold that is higher than the first threshold. The display control unit is configured to display, on a display unit, display information including a cluster representative indicative of a representative of images included in a cluster and a sub-cluster representative indicative of a representative of an image included in a sub-cluster.

Abstract: An apparatus comprises a processing device configured to select a first data field of a first type that is associated with a second data field of a second type in a document, to determine an embedding of terms of unstructured text data in the first data field and to identify a subset of paired data fields from an unstructured text database based at least in part on metrics characterizing similarity between (i) the embedding of terms in the first data field and (ii) embeddings of terms in data fields of the first type in the paired data fields. The processing device is further configured to determine syntactic differences between the unstructured text data in the first data field and the identified subset of paired data fields, and to provide recommendations for unstructured text data to fill the second data field in the document based on the syntactic differences.

Abstract: As digital assets are created and shared, design components that comprise those digital assets are curated, organized, and tracked so as to allow meaningful relationships to be established between shared assets and design components. The tracking that underlies such relationships is provided by metadata associated with a given design component. This metadata may include information such as an asset identifier that identifies a source digital asset from which the design component was extracted; a version identifier that identifies a version of the source digital asset; an author identifier that identifies an author of the source digital asset; and a layer identifier that can be used to reveal the context in which the design component was derived from the source asset. This metadata allows relationships to be established between a design component and the digital assets that incorporate that design component, thus facilitating asset and component tracking and update notification broadcasting.

Abstract: Digital content search techniques are described. In one example, the techniques are incorporated as part of a multi-head self-attention module of a transformer using machine learning. A localized self-attention module, for instance, is incorporated as part of the multi-head self-attention module that applies local constraints to the sequence. This is performable in a variety of ways. In a first instance, a model-based local encoder is used, examples of which include a fixed-depth recurrent neural network (RNN) and a convolutional network. In a second instance, a masking-based local encoder is used, examples of which include use of a fixed window, Gaussian initialization, and an adaptive predictor.

Abstract: Techniques are described for performing automated operations related to identifying and using repair and maintenance information, such as summarizing and encoding such information for a number of problems, identifying specific repair or maintenance instructions in response to natural language queries, and using the identified instructions in further automated manners in some situations (e.g., to automatically initiate repair or maintenance actions on a particular target computing device).

Abstract: A method for storing a file in cloud storage service (CSS) having a blocks index indexing blocks each having a unique block identifier, the entries thereof indicating for each block identifier a location of the block within an object storage system (OSS), the method comprising: the CSS transmitting a list of block identifiers indicating respective blocks that are not in the blocks index but which are indicated by a received file map for the file; adding an entry into the blocks index to indicate a location of uploaded blocks within the OSS for each block of the list and that has been successfully uploaded to the OSS; and when all of the blocks have been successfully uploaded, concatenating all blocks of the received file map in an order specified by the received file map to form a file object corresponding to the file in the OSS.

Abstract: Techniques of data flow control are disclosed herein. One example technique includes upon receiving a notification indicating a change to a content item in a source shard, parsing the content item to extract data representing attributes of the content item and identifying a partition of the system-wide index based on the extracted data representing the attributes of the content item. The example technique can also include transmitting, to a token issuer, a request for a token that represents a permission to write to the identified partition of the system-wide index and upon receiving a token issued by the token issuer in response to the transmitted request, transmitting the extracted data representing the attributes of the content item along with the received token to write the extracted data in the partition of the system-wide index.

Abstract: Provided are methods and systems comprising determining one or more relationships between a plurality of data sets, determining a score for each of the one or more relationships, generating a graphical data set object for each of the plurality of data sets, classifying each graphical data set object as connected or unconnected based on the score for each of the one or more relationships, generating a graphical connector object between connected graphical data set objects, and outputting the connected graphical data set objects with corresponding graphical connector objects and the unconnected graphical data set objects.

Abstract: Systems and methods for creating a live copy of a data object from a production system for use by third party applications. The systems and methods include receiving at least one request for a copy of production data from an application; creating a live backup copy; creating a flash copy of the live backup copy, and a flash copy bitmap; creating a modified version of the live backup copy by changing a subset of data in the live backup copy; recording the changed subset of data using the flash copy bitmap; mounting, the modified version of the live backup copy to the application; and transforming the modified version of the live backup copy back to the live backup copy when unmounting the modified version of the live backup copy of the production data from the application by applying changes associated with the flash copy bitmap to the live backup copy.

Abstract: Various embodiments of the disclosure disclose a method and an apparatus, which includes: a display, a memory, and a processor operatively connected to the display and/or the memory, wherein the processor is configured to: add a frame to an appended file based on a request to update application data, allocate a reserved space to the appended file, update a database file based on an update condition, and allocate the reserved space to the database file.

Abstract: Methods, computer program products, and systems are presented. The methods include, for instance: receiving a request for a lock on a page from a virtual database amongst two or more virtual databases, the virtual database including a number of containers respectively corresponding to the same number of database components of the virtual database. A copy of the page is refreshed with a latest copy of the page in an overall cache prior to granting the lock based on ascertaining that the page is not locked by any other virtual database. The virtual database is granted with the lock and have an exclusive access to the page.

Abstract: Voice data from a current conversation between a user and a voice-controlled user device can be used to determine a search constraint for searching a database. Other search constraints can be determined based at least in part on the current conversation, a previous conversation, and/or a previous action. Properties can be associated with the search constraints. Once the search constraints have been determined, a plurality of search query plans is determined and a first search query plan is executed to query the database.

Abstract: A method, computer program product, and computer system for controlling, by a computing device, access to a non-volatile memory using a non-volatile lock as a reader of the non-volatile memory. Metadata (MD) non-volatile memory commits may be throttled until capacity of the non-volatile memory is at a threshold capacity.