Abstract: A method performed by a protocol controller for packing a frame includes selecting, based on current contents of at least one message buffer, a stored packing template, and packing the frame in accordance with the selected packing template. The packing comprises packing each slot of the frame with a respective request (e.g., read request, write request) from the message buffer in accordance with the selected packing template. The template is selected from a plurality of stored packing templates. Associated host devices on which the protocol controller is arranged are also described.

Abstract: Provided are a communication method and system for a distributed heterogeneous acceleration platform, a device and a medium. The method includes: after starting a collaborative acceleration task, determining, by a first target heterogeneous acceleration card in a distributed heterogeneous acceleration platform, a second target heterogeneous acceleration card from the distributed heterogeneous acceleration platform by querying an information table corresponding to the collaborative acceleration task; generating, by the first target heterogeneous acceleration card, a target data packet according to a predefined data packet format, and sending the target data packet to the second target heterogeneous acceleration card via a PCIE interface; and parsing, by the second target heterogeneous acceleration card, the target data packet according to the data packet format, and executing a corresponding read operation or write operation according to a parsing result, so as to complete the collaborative acceleration task.

Abstract: A subordinate device participates in address assignment through iterative communication with a host device. The subordinate device receives a first broadcast command over a multidrop serial bus, decouples a daisy chain input of the subordinate device from a daisy chain output of the subordinate device, receives a second broadcast command over the multidrop serial bus, responds to the second broadcast command when a signal received through the daisy chain input is in an active state, ignores the second broadcast command when the signal received through the daisy chain input is in an inactive state, and ignores subsequent broadcast commands after responding to the second broadcast command. Responding to the second broadcast command includes configuring a unique device identifier of the subordinate device using an address provided in the second broadcast command, and coupling the daisy chain input of the subordinate device to the daisy chain output of the subordinate device.

Abstract: A computing system includes an interconnect device, a plurality of memory devices electrically coupled to communicate with the interconnect device, a plurality of host devices electrically coupled to communicate with the interconnect device and configured to generate requests for access to the plurality of memory devices via the interconnect device, and a plurality of congestion monitors. These congestion monitors are configured to generate congestion information by monitoring a congestion degree of signal transfers with respect to at least one of the plurality of memory devices and the interconnect device in real time. The computing system is also configured to control at least one of: a memory region allocation of the plurality of host devices to the plurality of memory devices, and a signal transfer path inside the interconnect device, based on the congestion information.

Abstract: Embodiments of the present disclosure may relate to apparatus, process, or techniques in a I3C protocol environment that include identifying a pending read notification message by a slave device to be sent to a master device to indicate that the data is available to be read by the master device from a buffer associated with the slave device. The pending read notification may be subsequently transmitted to the master device. Subsequently, until the data in the buffer has been read by the master device, the slave device may wait an identified amount of time that is less than a value of a timeout of the master device, and retransmit the pending read notification message to the master device. Other embodiments may be described and/or claimed.

Abstract: A distributed storage system including memory hosts and at least one curator in communication with the memory hosts. Each memory host has memory, and the curator manages striping of data across the memory hosts. In response to a memory access request by a client in communication with the memory hosts and the curator, the curator provides the client a file descriptor mapping data stripes and data stripe replications of a file on the memory hosts for remote direct memory access of the file on the memory hosts.

Abstract: In one embodiment, a processor includes: a plurality of cores to execute instructions and a non-volatile storage coupled to the plurality of cores to store identification information regarding the plurality of cores, the identification information to identify, for each of the plurality of cores, the core as an assured core or an opportunistic core. The processor is specified with a first subset of the plurality of cores comprising assured cores and a second subset of the plurality of cores comprising opportunistic cores, and is to execute, within a specified power budget and a specified thermal budget, a specified workload on the first subset of the plurality of cores at a first performance level. Other embodiments are described and claimed.

Abstract: It is provided an apparatus comprising interface circuitry, machine-readable instructions, and processing circuitry to execute the machine-readable instructions to generate a model modelling a computational system for distributed computation of tasks of an application. The model comprises one or more processor types. The computational system comprises a plurality of processing circuitries, physical memory and a respective memory address space, and one or more interconnects for communication between the plurality of processing circuitries and the physical memory. A processor type includes a processing circuitry identifier, a memory identifier, and an interface identifier.

Abstract: An information processing device includes processing circuitry and a storage. The storage is configured to store each of metadata and actual file data in file data in a different data block. File data that is to be newly stored in the storage is first file data. File data that has already been stored in the storage and is to be updated using the first file data is second file data. When the first file data has the same data size as the second file data, the processing circuitry is configured to update actual file data of the second file data using data to which information on an updated time is added to actual file data of the first file data, without updating metadata of the second file data.

Abstract: Methods and systems are configured for receiving data associated with a data item, accessing first data structures, corresponding to a first time window, and comprising a first data structure that maps to first storage locations and a second data structure that maps to second storage locations. Second data structures corresponding to the second time window are accessed. The second data structures comprise a first data structure that maps to a set of storage locations that are absent the storage locations of the first storage locations and a second data structure that maps to a set of storage locations that are absent the storage locations of the second storage locations. Elements of each of the first data structures second data structures are identified. First and second storage locations are selected based on the elements.

Abstract: The present teaching relates to method, system, medium, and implementations for storage management. A hash table includes an index file having one or more slots. Each slot has one or more search regions, each of which is of a known size and has one or more buckets. Each bucket can be used to store one or more types of records, including a direct record and an indirect record. A direct record stores data directly as direct data in a bucket of a search region in a slot of the index file when the data satisfies a pre-determined condition.

Abstract: Techniques are provided for an automated crawler for crawling a primary online content object and storing a set of results, a parser for parsing the stored set of results to generate a plurality of key phrases and a content corpus, a plurality of models for processing at least one of the plurality of key phrases or the content corpus, wherein the processing results in a plurality of topic clusters which arrange topics within the primary online content object around a core topic based on semantic similarity, a suggestion generator for generating a suggested topic that is similar to at least one topic among the plurality of topic clusters and for storing the suggested topic, and an application for developing a strategy for development of online presence content.

Abstract: Techniques are provided for implementing a defragmentation process during a merge operation performed by a re-compaction process upon a log structured merge tree. The log structured merge tree is used to store keys of key-value pairs within a key-value store. As the log structured merge tree fills with keys over time, the re-compaction process is performed to merge keys down to lower levels of the log structured merge tree to re-compact the keys. Re-compaction can result in fragmentation because there is a lack of spatial locality of where the re-compaction operations re-writes the keys within storage. Fragmentation increases read and write amplification when accessing the keys stored in different locations within the storage. Accordingly, the defragmentation process is performed during a last merge operation of the re-compaction process in order to store keys together within the storage, thus reducing read and write amplification when accessing the keys.

Abstract: According to certain embodiments, a provisioning manager comprises an interface and processing circuitry. The interface is configured to obtain provisioning data from a provisioning database. The processing circuitry is configured to prepare one or more configuration files based on the provisioning data. The configuration file(s) indicate how to provision one or more service instances. The processing circuitry is further configured to commit the configuration file(s) to one or more repositories in order to make the configuration file(s) available to at least one of the service instances. The processing circuitry is further configured to send one or more notifications indicating to one or more of the service instances that the configuration file(s) have been committed to the one or more repositories.

Abstract: Techniques are described for checkpointing multiple key ranges in parallel and concurrently during file storage replications between file systems in different cloud infrastructure regions. In certain embodiments, multiple range threads processing multiple key ranges, one thread per key range, create checkpoints for their respective key ranges in parallel and concurrently after processing a per-determined number of B-tree keys. In certain embodiments, upon encountering a failure event, either a system crash or a thread failure, each thread restarts its B-tree key processing from a B-tree key after the most recent checkpoint.

Abstract: Data resiliency in a cloud-based storage system, including: receiving, for storage within a first tier of cloud storage of the cloud-based storage system, one or more segments of data; generating, for each of one or more shards of data of the one or more segments of data, self-describing information for recoverability of the one or more shards of data; and storing, within a second tier of cloud storage of the cloud-based storage system, both the one or more shards of data and the generated self-describing information for recoverability of the one or more shards of data.

Abstract: Aspects of the disclosure relate to logical map generation and injection. A computing platform may train a key value engine to assign logical map data priority values based on data use cases. The computing platform may receive first data and a first use case, which the computing platform may input into the key value engine to produce the logical map data priority values for the first data. The computing platform may generate, based on the logical map data priority values, a logical map for the first data. The computing platform may modify the first data by embedding, into a header of the first data, the logical map. The computing platform may send, to a recipient computing device, a portion of the modified first data and one or more commands to re-assemble the first data using the logical map stored in the portion of the modified first data.

Abstract: An apparatus comprises a processing device configured to identify a source database of a first database type that is to be migrated to a target database of a second database type, to determine a set of migration factors for migrating the source database to the target database, and to select a given migration machine learning model for estimating a size required for the target database based at least in part on the first database type of the source database and the second database type of the target database. The processing device is further configured to estimate the size required for the target database utilizing the given migration machine learning model and the determined set of migration factors and to provision, for the target database, a given amount of storage resources based at least in part on the estimated size required for the target database.

Abstract: Storing compressed data objects by decompressing a first data object, identifying, differences between the first and second data objects, creating a new version of the second data object according to the differences, the first data object, and a reference object, and storing the first data object and the new version of the second data object.

Abstract: A structured data analysis system and a method for structured data analysis are provided. The structured data analysis system includes a memory and a processor. The processor obtains input data from an electronic device and converts the same into tree structure data to form nodes. The processor selects a first and a second node among the nodes. The first and the second nodes respectively correspond to a first and a second collection among the collections in the input data. The processor generates missing judgment result by judging whether the first node is missing according to a first amount of the first collection and a second amount of elements included in the second collection. The processor judges that whether the processor generates output data to the server based on original field data according to the missing judgment result to enable the server to operate correctly according to the completed output data.

Abstract: Embodiments described herein comprise an advanced Software as a Service (SaaS) platform addressing challenges including trust, governance, quality, data accuracy, and transparency, ensuring full visibility of enterprise data warehouse data pipelines. These embodiments seamlessly integrate with cloud-based and legacy data platforms, enhancing visibility through monitoring data quality, tracking metadata changes, and generating exceptions for review. Data quality management allows for custom script creation to validate pipelines and business rules. Cloud-native connectors facilitate integration with one or more cloud-based services streamlining data delivery processes. Personalized notifications aid administrators in responsive action, while data profiling capabilities identify quality issues and provide distribution insights. Actionable data intelligence for privacy, security, and governance is enabled through data classification.

Abstract: A data storage management system is enhanced to accommodate, and moreover to optimize, the storing and retention of deduplicated secondary copies at write-once read-many (WORM) enabled storage platforms. Enhancements include without limitation: user interface (UI) options to enable WORM functionality for secondary storage, whether used for deduplicated or non-deduplicated secondary copies; enhancements to secondary copy (e.g., deduplication copy, backup) operations; and pruning changes. The storage manager is generally responsible for managing the creation, tracking, and deletion of secondary copies, with and without deduplication. Media agents that store secondary copies to and prune them from the WORM-enabled storage platforms also are enhanced for communicating and interoperating with both bucket-level and object-level WORM-enabled storage platforms to implement the features disclosed herein.

Abstract: Embodiments disclosed herein generally relate to detecting variants in a data set. A variant-specific unique data set, which includes a variant-inclusive portion that includes a particular variant and one or more other portions is accessed. The variant-specific unique data set corresponds to a particular region of a reference data set. A plurality of reads is received, with each read of the plurality of reads having been generated by processing a material collected from a subject. For each read of a subset of the plurality of reads, a first matching criterion and a second matching criterion can be determined to be satisfied, with the first matching criterion being more stringent than the second matching criterion. A data set associated with the subject can be determined to include the particular variant based on a quantity of reads in the subset. A result identified based on the particular variant can be output.

Abstract: An auto-encoder model processes a datasets describing a physical part from a part catalogue in the form of a property co-occurrence graph is provided, and performs entity resolution and auto-completion on the co-occurrence graph in order to compute a corrected and/or completed dataset. The encoder includes a recurrent neural network and a graph attention network. The decoder contains a linear decoder for numeric values and a recurrent neural network decoder for strings. The auto-encoder model provides an automated end-to-end solution that can auto-complete missing information as well as correct data errors such as misspellings or wrong values. The auto-encoder model is capable of auto-completion for highly unaligned part specification data with missing values.

Abstract: There are provided systems and methods for dynamic data query routing for managing access to datasets having multiple versions. A service provider, such as an electronic transaction processor for digital transactions, may provide data for different applications including local device-side software applications and web-based or server-side applications. The data may be read and provided within the application, for example, for output or processing, as well as operated on in the applications to update, add to, or delete from corresponding records. When retrieving or loading data, a data quantum may be used in a data mesh to abstract database physical locations and utilize logical names that allow for applications to code and query for data without direct entanglement with databases and corresponding stored datasets for the data. A router may then be used to route requests and queries for the data to optimized databases for the data.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. In particular, methods, apparatus devices and or/or systems for enumerating rooted partial subtrees are disclosed.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed. In particular, methods, apparatus devices and or/or systems for analyzing hierarchical data are disclosed.

Abstract: Techniques and solutions are provided for a table schema that facilitates data denormalization, and which can allow for improved database system performance. Rather than accessing multiple tables, database operations can access a single table, which can reduce the number and complexity of database operations. The table schema includes an attribute subset indicator field. Different values of the attribute subset indicator field can be associated with different contexts, such as different tables or views, which in turn can represent different entity types. A given value of the attribute subset indicator field allows data to be accessed at a coarse granularity, while more-fine grained results can be obtained by providing a value for one or more attribute fields of the table. Different subsets of attributes are retrievable for a given value of the attribute subset indicator field.

Abstract: A method for utilizing a master table is provided. The method includes: receiving a subscription table that includes at least one subscription record of at least one subscription that, upon satisfaction of at least one condition of the subscription(s), provides, to a subscriber, a notification of the at least one condition; generating the master table; and generating a mapping table that maps fields of the subscription table to fields of the master table. The master table consolidates each subscription record and stores, as a string value, each of the at least one condition.

Abstract: An apparatus to compute an attention matrix implementing an attention mechanism in artificial neural networks, having: memory to store key value pairs; a reorder buffer to provide a reordered list of keys from the key value pairs; an analog dot product accelerator configured to compute dot products of key elements of keys from the reordered list of keys with respective query elements of a query row of a query matrix; a processing device configured to generate, based on results of the dot products, a row of attention scores corresponding to the query row of the query matrix for the reordered list of keys; and a further accelerator configured to compute dot products of segments of the attention scores with value elements of respective segments of values from a list of values from the key value pairs to generate an attention matrix.

Abstract: Systems and methods use dynamically generated validation rules. These validation rules comprise a first validation rule portion that is generated using a standardized validation process (e.g., corresponding to a standardized schema) and a second validation rule portion that is generated using a validation process selected based on a non-standardized schema that is specific to a respective asset type of the plurality of respective asset types.

Abstract: Described herein are systems and methods for correcting one or more user aliases. One or more alias identifiers are identified by type based at least on one or more user aliases stored in an alias store, the one or more user aliases mapping the one or more alias identifiers to one or more users. Each of the one or more alias identifiers are assigned to one or more rules of a same type as the one or more alias identifiers. The one or more rules are executed against one or more user records in a user metadata store to establish a results table identifying one or more aliases by type found in the user metadata store. An alias correction table is established that identifies one or more aliases of the results table that do not match one or more user aliases and to one of flag, remove, or correct.

Abstract: A method of labeling training data includes inputting a plurality of unlabeled input data samples into each of a plurality of pre-trained neural networks and extracting a set of feature embeddings from multiple layer depths of each of the plurality of pre-trained neural networks. The method also includes generating a plurality of clusterings from the set of feature embeddings. The method also includes analyzing, by a processing device, the plurality of clusterings to identify a subset of the plurality of unlabeled input data samples that belong to a same unknown class. The method also includes assigning pseudo-labels to the subset of the plurality of unlabeled input data samples.

Abstract: Methods and apparatuses for improving the performance and energy efficiency of a database system are described. A database system may dynamically adjust transaction batch sizes on a per node basis. In some cases, the database system may detect that a “hot lock” condition exists for a particular page or that a node-lock has ping-ponged between two database nodes at least a threshold number of times within a threshold period of time, and in response, may adjust (e.g., temporarily increase) the batch size or the number of transactions performed by a node before releasing the node-lock.

Abstract: Disclosed is a device (106) for bulk-only transfer of data including a query unit (110) and a control unit (112). The query unit (110) is configured to configure the second device (104) based on the set of descriptors received from the first device (102). The control unit (112) identifies a direction of transfer of data between the first device (102) and the second device (104), determines a status of a bulk-input endpoint (120) and a bulk-output endpoint (122) for the transfer of the data between the first device (102) and the second device (104), transfers the plurality of CBWs to the first device (102) and transfers the data between the first device (102) and the second device (104) based on the identified direction.

Abstract: Generating a first data query in accordance with a first structured query language includes obtaining first results data responsive to execution of the first data query by a database system, determining that the first result data indicates that the database system is incompatible with the first data query, generating first database operation mapping configuration data, wherein the first database operation mapping configuration data includes first database operation definition data describing the database operation, obtaining second database operation mapping configuration data, wherein the second database operation mapping configuration data includes the first database operation mapping configuration data mapped to second database operation definition data describing the database operation in accordance with the second structured query language, generating a second data query, obtaining second results data responsive to execution of the second data query by the database system, outputting data representing th

Abstract: A method, system, and computer program product that are configured to: receive a Structured Query Language (SQL) statement including placeholders; generate sets of predicted values for the placeholders; generate candidate access paths in a database using the sets of predicted values; receive a query including the SQL statement with actual values instead of the placeholders; select one of the candidate access paths based on determining similarities of the actual values to ones of the sets of predicted values; in response to the selected one of the candidate access paths being acceptable, execute the query using the selected one of the candidate access paths; and in response to the selected one of the candidate access paths not being acceptable, generate a new access path in the database using the actual values, and execute the query using the new access path.

Abstract: An analytics system can include a display on which a plurality of images are shown, and an analytics application communicably coupled to the display. The analytics application can receive a question and hypotheses from a user using the display. The analytics application can also generate queries using a natural language module, and send the queries to a plurality of data sources. The analytics application can further receive data from the data sources in response to the queries, and evaluate the data to generate evaluated data. The analytics application can also present the evaluated data, and receive a selection of at least one data item of the evaluated data. The analytics application can further convert the at least one data item into evidence, receive a selection of the evidence applied to a hypothesis, and evaluate the hypothesis. The analytics application can also present an assessment that the hypothesis answers the question.

Abstract: Methods, systems and computer program products are described herein that provide a serverless, multi-engine, multi-user data lake indexing subsystem and application programming interface. Indexes are defined as derived datasets and stored on the data lake in a universal format that enables disparate engines to create and/or discover indexes for workload optimization. Embodiment of indexes enable stateful control and management of an index via metadata included in the index and stored on the data lake.

Abstract: A large highly parallel database management system includes thousands of nodes storing huge volume of data. The database management system includes multiple query optimizers for determining low cost execution plans for queries. The database management system is adapted to receive a data query. An execution plan generator component of the database management system generates an initial execution plan for the query. The initial execution plan is fed as input to more than one query optimizers. Each optimizer starts with the initial execution plan, generates alternative execution plans, and determines a satisfactory execution plan that incurs the lowest cost. The database management system compares the selected execution plans by the optimizers and selects one with the lowest cost. The multiple query optimizers run in parallel.

Abstract: A method includes receiving, by a first computing entity of a database system, a query request that is formatted in accordance with a generic query format. The method further includes generating, by the first computing entity, an initial query plan based on the query request and a query instruction set. The method further includes determining, by the first computing entity, storage parameters. The method further includes determining, by the first computing entity, processing resources for processing the query request based on the storage parameters. The method further includes generating, by the first computing entity, an optimized query plan from the initial query plan based on the storage parameters, the processing resources, and optimization tools. The method further includes sending, by the first computing entity, the optimized query plan to a second computing entity for distribution and execution of the optimized query plan.

Abstract: A method comprises receiving a request to combine data from a plurality of data collections based on one or more constraints, and analyzing the request using one or more machine learning algorithms to determine an order by which respective ones of the plurality of data collections are to be searched. The respective ones of the plurality of data collections are searched according to the determined order, and an output of combined data from the searching is generated in response to the request.

Abstract: A method is provided to process a hierarchical query request for requesting to query a target database table, where the hierarchical query request includes a query start condition and a connection condition. The method includes: in a first query round, first data is queried from the target database table based on the query start condition, and the first data is used as a root node of a tree structure; a plurality of pieces of service data in the target database table are grouped into N data groups corresponding to N worker threads based on the connection condition, where N is an integer greater than 1; and in an ith query round greater than 1, a leaf node in the current tree structure is selected as a parent node; and a target worker thread corresponding to the parent node is determined from the N worker threads based on the connection condition.

Abstract: Methods and systems for using dispersed cached data stored in multiple database nodes for serving database access requests are described herein. Upon receiving a request for data from a requesting device, a first application server determines whether the requested data is stored in a local cache memory. If it is determined that the requested data is not stored in the local cache memory, without accessing a local, first database, the first application server determines that the requested data is stored in a cache memory of a second application server, wherein the second application server stores at least a portion of the data from a second database in its cache memory. The first application server retrieves the requested data from the cache memory of the second application server and provides the retrieved data to the requesting device.

Abstract: Embodiments of this specification provide a table data query method, a table data query apparatus, and a system that are of a distributed database. In response to that a table data processing node executes a first execution subplan to read row data of a driving table, the table data query apparatus generates a data rescanning instruction or a data scanning instruction based on whether a cache apparatus of the table data processing node caches the read row data, and sends the data rescanning instruction or the data scanning instruction to a driven table scanning scheduling apparatus of the table data processing node. The driven table scanning scheduling apparatus obtains a driven table data query result based on the data rescanning instruction or the data scanning instruction, and returns the driven table data query result to the table data query apparatus.

Abstract: Systems and methods of improving the functioning of a streaming platform system by managing database change stream offsets using a time series database are disclosed. In some example embodiments, a computer system retrieves an offset value from a plurality of offset values stored in a time series database, with the plurality of offset values being indexed in the time series database in time order, and the retrieved offset value being retrieved using a time parameter, and then the computer system transmits a data request to a stream-processing platform, with the data request comprising the retrieved offset value, and the data request being operable to retrieve a data record stored in association with the retrieved offset value in a storage layer of the stream-processing platform using the offset value.

Abstract: An electronic device generates training data to train a classifier to classify a respective search query as complete or incomplete, including: obtaining a first search query input by a first user; determining a media content item selected by the first user from the first search query; comparing metadata associated with the media content item with the first search query input by the first user; and labeling the first search query as complete or incomplete based on the comparison. The electronic device trains the classifier, using the generated training data, to classify a respective search query as complete or incomplete and uses the trained classifier to determine whether a second search query is complete or incomplete. The electronic device provides, for display, for a second user, one or more complete search queries as recommendations for a received search query, including the second search query if second search query is complete.

Abstract: An advanced search system leverages a pre-trained large language model to enhance user query responses. The system, equipped with hardware processors, a search query via an interface and accesses a pre-trained large language model designed to respond to the search query. The system fine-tunes the model to generate a task-specific generative model. The system employs the task-specific generative model to generate a search result to the search query and analyzes the search result based on a performance metric associated with the task-specific generative model. The system refines the task-specific generative model based on the analyzing of the search result.

Abstract: The present disclosure provides new and innovative systems and methods for automating functional safety scoring in applications. An example method includes a computing device having a processor detecting a requirement to generate a functional safety score for at least a portion of a program. The functional safety score may be based on a functional safety standard (e.g., the ISO 26262 standard). The method may further include determining one or more provisions of the functional safety standard; and identifying one or more signatures for each of the one or more provisions. For each provision, the processor may query the portion of the program for the corresponding one or more signatures. For each provision, the processor may determine a subscore based on the query for the corresponding one or more signatures, resulting in a set of subscores. Based on the set of subscores, the processor may generate the functional safety score.

Abstract: A system including a mobile application to assist users in assessing current and/or potential romantic partners/mates based on specific criteria. The application enables users to create a list of, for example, the top ten categories that are important to them in a relationship, and then further specify, for example, the ten subcategories for each category. The system can identify potential partners and the application assesses each potential (or current) partner based on feedback (i.e., prevalence) and behaviors. The system provides users with notifications of deal-breakers and desirable traits. The system helps users avoid investing time and effort in partners who do not meet their expectations (i.e., do not possess the desired traits) and ultimately assists the users in making informed and objective decisions in relationships.