Abstract: An embedded controller is provided for a computer, including a processor, first one or more logic elements providing a serial peripheral interface (SPI) module to communicatively couple the embedded controller to an SPI bus as an SPI slave, and second one or more logic elements providing a platform environment control interface (PECI)-over-SPI engine, to build an SPI packet providing an encapsulated PECI command and send a notification to an SPI master that the packet is available.

Abstract: A network-attached storage device is provided comprising a network card with an embedded operating system that provides autonomous operation of the network card, the network card including a network port to communicate with an external device and a peripheral component interconnect express (PCIe) interface to couple to a first PCIe device in the absence of a system host processor.

Abstract: Systems and methods for building a distributed learning framework, including generating a sparse communication network graph with a high overall spectral gap. The generating includes computing model parameters in distributed shared memory of a cluster of a plurality of worker nodes; determining a spectral gap of an adjacency matrix for the cluster using a stochastic reduce convergence analysis, wherein a spectral reduce is performed using a sparse reduce graph with a highest possible spectral gap value for a given network bandwidth capability; and optimizing the communication graph by iteratively performing the computing and determining until a threshold condition is reached. Each of the plurality of worker nodes is controlled using tunable approximation based on available bandwidth in a network in accordance with the generated sparse communication network graph.

Abstract: Supporting multiple clients on a single programmable integrated circuit (IC) can include implementing a first image within the programmable IC in response to a first request for processing to be performed by the programmable IC, wherein the request is from a first process executing in a host data processing system coupled to the programmable IC, receiving, using a processor of the host data processing system, a second request for processing to be performed on the programmable IC from a second and different process executing in the host data processing system while the programmable IC still implements the first image, comparing, using the processor, a second image specified by the second request to the first image, and, in response to determining that the second image matches the first image based on the comparing, granting, using the processor, the second request for processing to be performed by the programmable IC.

Abstract: Systems, methods, and apparatuses relating to debugging a configurable spatial accelerator are described. In one embodiment, a processor includes a plurality of processing elements and an interconnect network between the plurality of processing elements to receive an input of a dataflow graph comprising a plurality of nodes, wherein the dataflow graph is to be overlaid into the interconnect network and the plurality of processing elements with each node represented as a dataflow operator in the plurality of processing elements, and the plurality of processing elements are to perform an operation by a respective, incoming operand set arriving at each of the dataflow operators of the plurality of processing elements. At least a first of the plurality of processing elements is to enter a halted state in response to being represented as a first of the plurality of dataflow operators.

Abstract: A systolic array implemented in circuitry of an integrated circuit, includes a processing element array having processing elements arranged in a vertical direction and a horizontal direction, first loaders communicatively coupled to the processing element array to load samples Am,n from at least one external memory to the processing element array, and second loaders communicatively coupled to the processing element array to load samples Bk,l from the at least one external memory to the processing element array. Each row of the samples Am,n is loaded one row at a time to a single processing element along the horizontal direction, and each row of the samples Bk,l is loaded one row at a time to a single processing element along the vertical direction, wherein pairing between the samples Am,n and Bk,l in the horizontal direction and the vertical direction enables data reuse to reduce bandwidth usage of the external memory.

Abstract: A computer-implemented method, according to one embodiment, includes: capturing a snapshot of data stored at a primary storage location, and determining a transaction identification which corresponds to each file operation included in the snapshot, where each file operation includes a respective number of sub-operations. Data included in the snapshot which corresponds to completed ones of the sub-operations is identified, and the determined transaction identifications as well as the identified data is used to populate entries in a data structure. The snapshot is sent to a secondary storage location, and an acknowledgement is received from the secondary storage location for each of the completed sub-operations that are successfully performed at the secondary storage location. Furthermore, the data structure is updated based on the received acknowledgements.

Abstract: Disclosed are examples of systems, apparatus, methods and computer program products for deleting data of an object within a multi-tenant database. Described is a mechanism for performing operations such as an efficient delete operation by introducing a new delete operation (or method) that is configured to allow a data structure such as an object to identify one or more records to be deleted. In order to ensure that the operation is efficient, the mechanism may determine characteristics of a data store and determine whether the information provided within the data structure provides an efficient identification of the data to be deleted. Upon a successful validation, an initial delete request may be translated to an appropriate delete operation for the underlying database.

Abstract: A method and apparatus for reserving a usable storage space on a storage device is provided. The method includes collecting context data representing an environment surrounding the storage device; selecting at least one file from among files stored in the storage device by using at least one of the context data and user profile data; and processing the selected file and reserving a usable storage space on the storage device. The method reserves the usable storage space by using the context data or user profile data, thereby allowing efficient reserving of usable storage space without a user's manual intervention and preventing waste of unnecessary resources.

Abstract: A system and method for identifying write filter exclusions for information handling systems in a computing environment. Each information handling system includes a file exclusion driver and a file exclusion service. The file exclusion driver can monitor files to be stored in a write filter overlay and identify recurring files previously stored in the write filter overlay. The file exclusion driver can determine if a cumulative file size of a recurring file exceeds an adjustable threshold, and add data describing the recurring file to an exclusion list if the cumulative file size exceeds the adjustable threshold. The file exclusion service can transmit the exclusion list to the device management server for analysis, receive a master exclusion list from the device management server based on analysis, and can store a set of excluded files in a local storage resource based on the master exclusion list.

Abstract: A communication system and methods for data compression and the management of data transmitted between computing devices in a communication network are provided. Compression dictionaries generated from data previously maintained at a recipient computing device and a transmitting computing device are maintained at each respective device. The compression dictionaries are made up of fixed length data chunks from the data previously maintained on the computing device that can be matched to data to be compressed or de-compressed. Data can be transmitted without requiring the exchange of the compression dictionaries between the recipient computing device and the transmitting computing device.

Abstract: Aspects of the subject technology relate to ways to avoid file duplication in a cloud storage service. In some aspects, a method of the technology includes steps for retrieving, via a computer network, one or more files from a first memory location, identifying a first signature and a second signature for each of the files, and storing the first signature and the second signature into a duplication reference list. In some aspects, the method further includes steps for analyzing files in a second memory location to identify duplicate files using the duplication reference list. Systems and computer-readable media are also provided.

Abstract: Systems and methods for managing an inline conversation area within a document are provided. In example embodiments, a collaboration system causes presentation of a user interface displaying a document that is being collaboratively edited by a plurality of users. The collaboration system receives an indication to present an inline conversation area within the document. In response, the inline conversation area is displayed within the document on the user interface, whereby the inline conversation area is visually distinguished from content of the document. The collaboration system receives, via the inline conversation area, input from the plurality of users. The input comprises comments being exchanged between the plurality of users and draft content. The inputs are displayed in the inline conversation area within the document on the user interface.

Abstract: In one embodiment, a telemetry system may track a cloud synchronization system to improve performance. A service proxy 114 may receive a matching file metadata set 304 for a matching file 134 stored in a cloud user account 132 of a cloud synchronization system. The service proxy 114 may execute a synchronization verification of the matching file metadata set 304 to a local file 112 stored in a client device 110. The service proxy 114 may create a telemetry report 400 describing a synchronization error 412 as determined by the synchronization verification.

Abstract: Examples described herein include virtualized environments including a virtualized file server. Examples of secure domain join processes are described which may facilitate joining a virtualized file server or portions thereof to a domain. In some examples, the secure domain join process itself, and/or an associated file server virtual machine, may have insufficient credentials to write objects into an active directory. The active directory credentials need not be shared with the file server virtual machine. Rather, in some examples, the secure domain join process may provide a user system with a list of actions to be performed using active directory credentials.

Abstract: Techniques for dataset schema and metadata management are described. A data model management service provides a logically centralized repository that allows discovery of datasets via exploration of dataset metadata. The data model management service can ensure the validity of the datasets and the associated metadata by enforcing dataset validation rules and/or requiring dataset metadata to be provided and limiting visibility into non-compliant datasets.

Abstract: A method and system including a common dictionary module; a common dictionary processor in communication with the common dictionary module and operative to execute processor-executable process steps to cause the system to: define a common dictionary type; assign one or more characteristics to the common dictionary type; receive one or more data values; compress the dictionary type; and generate a common dictionary. Numerous other aspects are provided.

Abstract: An approach is provided in which the approach generates a first set of sample documents based on a first schema and generates a second set of sample documents based on a second schema. The approach determines a set of validation results by comparing the first set of sample documents against the second schema and comparing the second set of sample documents against the first schema. The approach evaluates the set of validation results and declares a type of equivalence between the first schema and the second schema accordingly.

Abstract: Disclosed is a system and method for efficient comparison of experimental research documents to identify original research work. The system when operated, provides a platform for comparing a user submitted document with documents existing in the platform and documents available in public domain. Further, the system is capable of identifying originality and the similarity of the user submitted documents, in comparison with existing documents, based on a calculated similarity index.

Abstract: Methods and systems relating to a file distribution scheme in a computer network are disclosed that distributes files in an efficient manner that reduces, among other things, network traffic. In an embodiment of the invention, a method for updating a file is disclosed. In such a method, unique chunks in a first version of a digital file are identified. For a second version of the digital file, chunks that are the same as in the first version are identified. Recompilation information is generated and stored for these identified chunks. Also, for the second version of the digital file, chunks in the second version that are different from chunks in the first version are identified. Recompilation information is generated and stored for these identified chunks. With this information, the second version of the digital file is completely defined and can be efficiently stored.

Abstract: The subject matter disclosed herein relates to out of memory error handling in a database system. A database operation can be received by an in-memory database. The database operation can be for a database object stored in a database table that can be represented as a plurality of pages that can be persisted in a page chain. The in-memory database can reserve out of memory space sufficient to load a predetermined number of pages in the page chain into memory. The in-memory database can iteratively process each page in the page chain until completion of the database operation. The iterative process can include loading the page from persistence into memory of the in-memory database, performing at least a portion of the database operation using the loaded page, and unloading the page from the memory of the in-memory database. Related apparatus, systems, techniques, and articles are also described.

Abstract: A data storage method and apparatus for a distributed database which includes receiving, by a first node, a record insertion request, where the record insertion request carries a first record, and determining, by the first node according to a mapping relationship between a foreign key identifier and a storage node, a first storage node on which a first associated record that corresponds to the first record is located, where a primary key identifier of the first associated record is same as a foreign key identifier of the first record, and inserting, by the first node, the first record to a second node in the first storage nodes.

Abstract: An improved content indexing (CI) system is disclosed herein. For example, the improved CI system may include a distributed architecture of client computing devices, media agents, a single backup and CI database, and a pool of servers. After a file backup occurs, the backup and CI database may include file metadata indices and other information associated with backed up files. Servers in the pool of servers may, in parallel, query the backup and CI database for a list of files assigned to the respective server that have not been content indexed. The servers may then request a media agent to restore the assigned files from secondary storage and provide the restored files to the servers. The servers may then content index the received restored files. Once the content indexing is complete, the servers can send the content index information to the backup and CI database for storage.

Abstract: This disclosure relates to bitmap index writing, dumping, merging, and querying. In one aspect, a method includes determining, based on update data, a to-be-updated row of a bitmap index that indexes data of a database using a bitmap data structure. The to-be-updated row of the bitmap index is locked. The locking includes adding a row lock to the to-be-updated row, thereby preventing the to-be-updated row from being updated by other update operations. At least one other row of the bitmap index remains unlocked for updating by other update operations. Data in the to-be-updated row of the bitmap index is updated based on the update data.

Abstract: In an approach, a processor receives a first request to store a specific key to index pages of a database, wherein: the request indicates that the specific key is to be stored to a specific leaf page in a key-ordered chain of the index pages, and there is insufficient room in the specific leaf page to store the specific key. A processor determines at least one sibling leaf page of the specific leaf page in the key-ordered chain, the specific leaf page and the at least one sibling leaf page forming a first set. A processor determines that there is enough room in leaf pages of the first set to store existing keys in the leaf pages of the first set together with the specific key. A processor stores the existing keys in the leaf pages of the first set together with the specific key according to a redistribution policy.

Abstract: Embodiments for providing memory for continuous data protection in a data storage system by storing a first key-value map as a data structure wherein the key is an address of a volume and the value comprises timestamp and hash value pairs for each time the address had data written thereto, and corresponding hash values of the written data, and storing a second key-value map as a data structure wherein the key comprises the hash value and the value comprises the written data. The first key-value map and second key-value map are implemented as a driver component in a server computer of the data storage system. The driver exposes a block device protocol on the server computer and leverages the key-value data structures for use with a deduplication storage system.

Abstract: A compact data structure generation engine can be used to generate a compact data structure that represents performance data for high-scale networks. The compact data structure representing the performance data can be used to monitor the operation performed on or by a computer system to identify potentially anomalous conditions. In response, a corrective action can be taken to address the issue. This can be useful, for example, in improving the efficiency, effectiveness, and reliability of the computer system during operation.

Abstract: Provided is a method and system for transforming a GUID of a database entry into a reduced identifier. The transformation may be performed by a bijective function. In one example, the method may include one or more of receiving a database entry which includes a global unique identifier (GUID) which uniquely identifies the database entry, identifying a transformation function associated with the database entry, transforming the GUID into a reduced identifier based on the transformation function wherein the reduced identifier has a reduced size with respect to a size of the GUID, and storing the database entry based on the reduced identifier.

Abstract: Systems, methods, and devices for generating a transactional change tracking summary for a database. A method includes executing a transaction on a table of a database, wherein the table includes a micro-partition and the transaction is executed on the micro-partition. The method includes, in response to the transaction being fully executed, generating a change tracking entry comprising an indication of one or modifications made to the table by the transaction. The method includes storing the change tracking entry in a change tracking stream, wherein the change tracking stream includes one or more sequential change tracking entries that each correspond to a different transaction that is fully executed on the table.

Abstract: A database platform can track changes using a stream that records changes made by database transactions. Streams on views can be implemented by applying a stream to source data, and applying the view to the streamed data. Users of the database platform can query the stream on the view to review recent changes to the view, such as changes made since the last database transaction.

Abstract: A plugin is provided to a service that includes a database for storing data corresponding to transactions received by the service and applied to the database. Upon receipt of a transaction to be performed by the service, the plugin receives a message generated by the service and associated with informing another service of the transaction. The message is stored in the database together with the transaction, the message and transaction thereby being in the same transactional context. Upon the transaction being committed, the message is also processed because the transaction and message are in the same single transactional context within the database.

Abstract: Embodiments of the present disclosure provide systems, methods, and computer storage media for optimizing computing resources generally associated with cloud-based media services. Instead of decoding digital assets on-premises to stream to a remote client device, an encoded asset can be streamed to the remote client device. A codebook employable for decoding the encoded asset can be embedded into the stream transmitted to the remote client device, so that the remote client device can extract the embedded codebook, and employ the extracted codebook to decode the encoded asset locally. In this way, not only are processing resources associated with on-premises decoding eliminated, but on-premises storage of codebooks can be significantly reduced, while expensive bandwidth is freed up by virtue of transmitting a smaller quantity of data from the cloud to the remote client device.

Abstract: Systems, methods, and computer programmable products are described herein for tracking modifications of a hierarchical database table of an application. Data including a modification to the hierarchical database table having a plurality of database entries is received. A change trigger table having a record corresponding to the modification of a database entry of the plurality of database entries is defined. The change trigger table is provided to a unified instance authorization application for further definition of an explosion database table.

Abstract: Techniques for database versioning are described. In one embodiment, an apparatus may comprise a database change management component operative to compare a developer table to a reference table to determine a database change set, wherein both the developer table and the reference table are based on a target table; a database conflict management component operative to compare the database change set to the target table to determine a conflicting change set; and a user interface component operative to display the conflicting change set where the conflicting change set comprises one or more conflicting changes; and indicate a conflict-free change set where the conflicting change set is empty. Other embodiments are described and claimed.

Abstract: Certain aspects described herein are directed to methods and systems for updating a status of a first process. In certain aspects, a method includes periodically examining a first table stored in a consistent and distributed database, wherein the table includes a first indication of a status of the first process and a second indication of a status of a second process and the first process and the second process are clustered for implementing functions of a distributed application in a distributed manner. The method further includes determining that the first indication has not changed during a first time period and changing the status of the first process in a second table to reflect that the first process is non-operational, wherein a different share of workload associated with the distributed application is performed by the second process as compared to when the first process was operational.

Abstract: A computer-implemented method for implementing native contract on blockchain comprises: obtaining combined bytecode associated with a blockchain contract, wherein the combined bytecode comprises an indicator representing a type of the blockchain contract; determining the type of the blockchain contract based at least on the indicator; and executing the blockchain contract based on the determined type of the blockchain contract.

Abstract: Systems for dynamically transforming data are provided. Database data may be received and ingested into a system. Ingesting the data may include executing one or more first data governance functions, such as data quality evaluation functions, data controls, and the like. The ingested data may then be output for further processing as first processed data and first data governance information may be captured and stored. The first processed data may be processed to execute one or more data transformations. Data transformations may include calculations, formatting, derivations, and the like. In some arrangements, second data governance functions may be executed on the transformed data. The transformed data may then be output as second processed data. The system may capture second data governance information as the data is transformed. The second processed data may then be published to one or more downstream databases for use in one or more applications executed by an entity.

Abstract: Disclosed are methods and systems for retrieving data based on a plurality of blockchain networks. One method comprises: receiving a first-type transaction hash sent by a user, wherein the first-type transaction hash is a hash value of a first-type blockchain transaction associated with a first-type blockchain network, wherein the first-type blockchain network and the second-type blockchain network are comprised in a data recording system; identifying a second-type blockchain transaction that comprises the first-type transaction hash; identifying a network identifier from the second-type blockchain transaction; identifying a first-type blockchain transaction corresponding to the first-type transaction hash from a blockchain of a first-type blockchain network corresponding to the network identifier; and providing the first-type blockchain transaction to the user.

Abstract: Processing is provided for operating an in-memory database, wherein transaction data is stored by a persistence buffer in an FIFO queue, and update processor subsequently: waits for a trigger; extracts the last transactional data associated with a single transaction of the in-memory database from the FIFO memory queue; determines if the transaction data includes updates to data fields in the in-memory database which were already processed; and if not, then stores the extracted transaction data to a store queue, remembering the fields updated in the in-memory database, or otherwise updates the store queue with the extracted transaction data. The process continues until the extracting is complete, and the content of the store queue is periodically written into a persistent storage device.

Abstract: Systems and methods including one or more processors and one or more non-transitory storage devices storing computing instructions configured to run on the one or more processors and perform acts of storing one or more notifications in a central data store pursuant to one or more user preferences; receiving a new notification; determining when a number of the one or more notifications is equal to a maximum number of notifications set in the one or more user preferences using a reclamation pointer and an ingestion pointer; when the number of the one or more notifications is equal to the maximum number of notifications, moving the reclamation pointer forward by one or more messages; deleting, from the central data store, notifications of the one or more notifications that are behind the reclamation pointer; storing the new notification with the one or more notifications in the central data store; and facilitating delivery of the new notification of the one or more notifications from the central data store to on

Abstract: Disclosed are systems and methods for providing an improved hardware-assisted multi-table database with reduced memory footprint. A method includes receiving a request to perform an operation on a selected logical table of a plurality of logical database tables. The method also includes accessing a data structure comprising a plurality of records each including: a logical table identifier corresponding to one of the plurality of logical database tables, wherein the logical table identifier is accessed from a register, and at least one sort key. The method also includes performing the operation using one or more sort criteria, wherein the one or more sort criteria are maintained for the selected logical table using the at least one sort key of the plurality of records corresponding to the selected logical table. The method also includes updating the data structure to reflect the performed operation.

Abstract: A method and system for streaming data from portable storage devices. Specifically, the disclosed method and system implement iterative data streaming from a portable storage device for remote storage operations, while requiring zero over-provisioning storage space for buffering incoming write operations to the portable storage device.

Abstract: An intuitive interface that allows a non-technical person to search a computer database without having to understand the underlining database software or its structure by assembling a graphical database query.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for enterprise connectivity are described. In one aspect, a method includes the actions of receiving, by a data analysis server and from a web client running on a first device, a request to begin a web session, where the data analysis server is configured to generate queries to a data storage device based on user input to the web client. The actions further include receiving a request to generate a dashboard interface that provides a visualization of a portion of data in the data storage device. The actions further include generating the dashboard interface and a corresponding dashboard file that is viewable outside of the web client. The actions further include transmitting the dashboard file to a second device that includes a data analysis application that is configured to view the dashboard file.

Abstract: Systems and methods for providing interaction data in response to a query from a content provider are provided. One method includes receiving a query from the content provide including a plurality of parameters relating to interactions with a content item of the content provider. The method includes retrieving a set of log file records using the included plurality of parameters and generating a current set of records identifying interaction data with the content item. The method includes comparing the current set of records to a previous set of records generated by the one or more processors for a previous query from the content provider and determining a similarity between the current set of records and the previous set of records. The method includes modifying, if the similarity is above a threshold, the current set of records and providing the modified set of records to the content provider.

Abstract: A method and system provides assistance to users of a data management system. The method and system trains an analysis model with a machine learning process to generate sub-word embeddings corresponding to vectorized representations of portions of a search term entered by a user. The method and system generates augmented query data based on the sub-word embeddings. The method and system provides assistance to the user based on the augmented query data.

Abstract: In one embodiment, a method includes, by one or more computing systems, receiving, from a client system associated with a user, an initial portion of a user input, wherein the initial portion comprises a partial request, and wherein the initial portion is received while the user is continuing to provide further input, generating, responsive to receiving the initial portion of the user input, one or more speculative queries based on the partial request and a machine-learning predictive model, wherein each speculative query is a predicted complete request based on the partial request, calculating a confidence score for each speculative query based on the predictive model, ranking the one or more speculative queries based on their respective confidence scores and associated costs, executing one or more of the speculative queries based on their ranks, and caching one or more results of the executed one or more speculative queries.

Abstract: Techniques are disclosed herein for resolving a natural language query. Input (e.g., text input, audio input) corresponding to a query requesting data is received. A type of the query is determined based on a natural language analysis on the query. A form of response to the query is identified based on the type of the query. A visualization associated with the form of response is identified. The visualization is presented via a user interface. The presented visualization includes the requested data.

Abstract: An information retrieval system and method are presented. A template is retrieved from a template repository. The template repository stores a plurality of templates. Each of the plurality of templates includes a concept and a relationship from a knowledge model. The knowledge model defines a plurality of entities and interrelationships between one or more of the plurality of entities. The plurality of entities include concepts and instances. The template is transmitted to a client computer, and a statement is received from the client computer. The statement includes an instantiation of the template. A knowledge base is queried using the statement to generate a result listing identifying an item in the knowledge base. The knowledge base identifies a plurality of items. Each of the plurality of items is associated with at least one annotation identifying at one of the entities in the knowledge model.

Abstract: A computer-implemented method for generating ground-truth for natural language querying may include providing a knowledge graph as data model, receiving a natural language query from a user and translating the natural language query into a formal data query. The method can also include visualizing the formal data query to the user and receiving a feedback response from the user. The feedback response can include a verified and/or edited formal data query. The method can also include storing the natural language query and the corresponding feedback response as ground-truth pair. Corresponding system and a related computer program product may be provided.