Abstract: Technologies are described for managing database queries based on bill of materials (BOM). For example, a set of database queries can be optimized (e.g., in terms of time and sequence of execution) based on a BOM explosion. In some implementations, database queries are managed by generating a BOM for an application programming interface (API) call. Various data structures can be created from the BOM, which can comprise procedure information, application and action information, and/or hierarchy information. A logical sequence of execution can be determined based, at least in part, on one or more of the data structures, where the logical sequence of execution comprises a plurality of database queries to execute the API call. The logical sequence of execution can be optimized to produce an optimized sequence of execution. The API call can be executed according to the optimized sequence of execution.

Abstract: When a first search query including an image of an item is received to search for items associated with similar images, a second search query that includes text based on the image is generated. The text may be based on previous queries associated with the depicted item, visual features of the image, or text that is present in the image. The results from the first search query are scored based on their correspondence with the image of the item. Results having a score greater than a threshold are presented first in the output, followed by a selected number of results from the second search query. Results from the first search query that are associated with a score less than the threshold may be presented after the results from the second search query. This presentation increases the likelihood that items presented earlier in the output are relevant to the initial query.

Abstract: Included are a 2D processing unit 11 that generates 2D latitude and longitude information by dimensionally compressing a feature vector generated from target information, and a map generation unit 12 that generates a 2D map in which a plurality of pieces of target information is plotted on a 2D plane based on a plurality of pieces of latitude and longitude information generated for a plurality of pieces of target information.

Abstract: A transaction processing protocol for serverless database management systems can use a transaction scheduler to guarantee consistent serializable execution though analysis of the access pattern of transaction types and appropriate ordering of the transaction's events at runtime. A transaction topology is determined for each type of transaction and these are combined and used to generate a serialization graph. Cycles in the serialization graph are identified and breaking transaction types which may break the cycles are determined. When transaction requests are received, a breaking type of transaction is scheduled as a last transaction in the current epoch and later transactions not having the breaking transaction type are scheduled to execute in the next epoch.

Abstract: Techniques are disclosed relating to managing data objects. A computer system may access a first application comprising a set of functions and may execute a second application to facilitate execution of the first application. The first application may be written in a different programming language than the second application. The second application may manage, on behalf of the first application, memory resources of data objects that are defined within ones of the set of functions of the first application. The second application may establish, for the data objects, ownership information that indicates which ones of the functions are utilizing the data objects. The ownership information may be usable to determine, upon completion of a function of the set of functions, whether a given one of the data objects can be deallocated based on whether the given data object is being utilized by another function.

Abstract: A computer-implemented method is disclosed for mapping a dataset from a Hilbert space of a given dimension to a Hilbert space of a different dimension, the method comprising obtaining a dataset, for each data sample of the dataset, for a plurality of episodes, generating an encoded sample; configuring an adiabatic quantum device by embedding each encoded sample into a q-body Hamiltonian H representative of an adiabatic quantum device, causing the adiabatic quantum device to evolve from an initial state to a final state; and performing a projective measurement along z axis at the final state to determine the value of each qubit; generating a corresponding binary vector representative of the given data sample in a transformed Hilbert space using the determined value of each qubit at each episode and providing a mapped dataset comprising each of the generated corresponding binary vectors.

Abstract: Methods of and systems for searching a catalog include parsing the items of the catalog into tokens, determining the frequency with which each token appears in the catalog, and storing the frequencies in a cache. Queries to the catalog are likewise parsed into tokens, and the tokens of the query string are compared to frequency values in the cache to identify a smaller search space within the catalog.

Abstract: Disclosed herein are various embodiments, for a content display and clustering system. An example embodiment operates by receiving a request to display the plurality of content items. At each of multiple levels different pairs of content items are identified and a similarity score is computed for each pair. A subset of pairs for which their similarity score exceeds a similarity threshold for the respective level are identified and clustered. This process is repeated for one or more iterations at the same level, and then the process is repeated for each of the multiple levels. A final clustered subset is identified, and output for display, responsive to the request to display the plurality of content items.

Abstract: Apparatus and methods for reconciling data in a big data environment is provided. Methods may receive a first data set and a second data set for reconciliation. Methods may identify a first set of metadata associated with the first data set. Methods may identify a second set of metadata associated with the second data set. Methods may include a data reconciliation algorithm. The algorithm may compare the first set of metadata to the second set of metadata to obtain a subset of data found within the first data set and a subset of data found within the second data set that are joinable. Methods may dynamically construct one or more SQL queries to identify any discrepancies between the first data set and the second data set. Methods may execute the one or more SQL queries that identify any discrepancies between the first data set and the second data set.

Abstract: The present disclosure relates to systems that perform text-based palette searches that convert a text query into a color distribution and utilize the color distribution to identify relevant color palettes. More specifically, the disclosed systems receive a textual color palette search query and convert, utilizing a text-to-color model, the textual color palette search query into a color distribution. The disclosed systems determine, utilizing a palette scoring model, distance metrics between the color distribution and a plurality of color palettes in a color database by: identifying swatch matches between colors of the color distribution and unmatched swatches of the plurality of color palettes and determining distances between the colors of the color distribution and matched swatches of the plurality of color palettes. The disclosed systems return one or more color palettes of the plurality of color palettes in response to the textual color palette search query based on the distance metrics.

Abstract: This disclosure provides a novel framework that alleviates shortcomings in the art, and provides a token holder with authorized access to a range of attached functionalities, via data attachments that extend rights to token-associated digital data. According to an embodiment, a method comprises receiving a request from a holder of a token instance to provide a list of unique tokens associated with a user identifier, retrieving the list of unique tokens from a database, and transmitting the list of unique tokens to the holder. The method receives a selection of a unique token and transmits attachment data associated with the selected unique token to the holder. The method then receives interaction information indicating an interaction by the user with the attachment data, transmits a request to provide the attachment data to the user, and updates the database to reflect that the attachment data has been acted upon by the user.

Abstract: Seamless integration of multiple applications in tutorials is disclosed herein. In one example, a processor device of a computing device displays, within browser software, a tutorial interface comprising a tutorial guide, wherein the tutorial guide comprises a plurality of task links, and each task link corresponds to an application of a plurality of applications. The processor device receives, using the browser software via a user input device, a first user input indicating a selected task link among the plurality of task links. Responsive to receiving the first user input, the processor device initiates execution of a first application corresponding to the selected task link, wherein the first application executes within the tutorial interface instead of requiring a user to launch and switch between multiple applications in multiple browser tabs or windows.

Abstract: The disclosure provides technology for importing a set of media items from a content source by optically analyzing a graphical interface of the content source. An example method includes initiating, by a processing device, an import of a set of media items from a content source; capturing image content of a graphical interface of the content source; extracting data from the image content of the graphical interface; identifying a media item of the content source based on the data from the image content; and storing a reference to the media item.

Abstract: A manager file system (MFS) runs as a user space file system. The MFS, implemented using an OS process, exposes a mount point as a communication endpoint to the single process. Mounting, unmounting, and changing configuration of individual database file systems (DBFSs) are done by overloading extended attributes on the mount point. The MFS services all DBFSs mounted at different mount points registered to the single process of the MFS and ensures optimal resource utilization among the DBFSs in the single process while guaranteeing resource isolation.

Abstract: An example method of upgrading a distributed storage object from a first version to a second version includes: querying metadata of a first component configured according to the first version of the distributed storage object, the metadata defining extents of data on a disk group of the first component; populating, for a second component configured according to the second version of the distributed storage object, logical and middle maps based on the metadata such that initial entries in the logical map point to initial entries in the middle map, and the initial entries in the middle map point to physical addresses of the disk group of the first component; and reading the data from the disk group of the first component and writing the data to a disk group of the second component while updating the initial entries in the middle map.

Abstract: Systems, apparatuses, methods, and computer program products are disclosed for post-quantum cryptography (PQC). An example method includes receiving data. The example method further includes generating a set of data attributes about the data. The example method further includes generating a data envelope based on the set of data attributes. Subsequently, the example method includes generating an enveloped data structure based on the data envelope and the data.

Abstract: Systems and methods for of determining a replication time in a deduplicated file system are disclosed. Maximum streams are determined based on a number of allocated streams on a source node and a number of allocated streams on a target node. An available network bandwidth between the source node and the target node is determined. A delta time is estimated based at least on one or more duplicate fingerprints between a logical space unit of the source node and the target node by using at least one source smart filter and at least one target smart filter. The replication time is determined based on the maximum streams, the available network bandwidth between the source and target nodes, the estimated delta time, and a number of unique fingerprints that exist between the logical space unit of the source node and the target node.

Abstract: An analytics system is operable to receive a first plurality of query requests from a plurality of requesting entities. Query pricing scheme data is automatically generated based on the first plurality of query requests. A second plurality of query requests are received from the plurality of requesting entities. Query cost data is automatically generated for each of the second plurality of query requests by utilizing the query pricing scheme data. The query cost data for each of the second plurality of query requests is transmitted to a corresponding one of the plurality of requesting entities.

Abstract: An embodiment for identifying and sorting duplicate datasets within a large pool of heterogeneous datasets may include received a plurality of heterogeneous datasets. The embodiment may automatically compare schema information and metadata within each of the received plurality of heterogeneous datasets to generate name-based similarity scores for each dataset. The embodiment may also automatically compare data distribution information within each of the received plurality of heterogeneous datasets to generate a plurality of data distribution similarity scores for each heterogeneous dataset. The embodiment may further include automatically calculating an overall distance metric using the name-based similarity scores and plurality of data distribution similarity scores. The embodiment may also include based on the calculate overall distance metric, automatically generating distance graphs that identifying clusters of similar datasets and illustrate inferred lineage for the clusters of similar datasets.

Abstract: A query processing system is operable to determining a query pricing scheme and receive a query request from a requesting entity that indicates at least one query function for execution against a database system. Query cost data is generated based on the at least one query function by utilizing the query pricing scheme. The query cost data is transmitted to the requesting entity.