18th week of 2022 patent applcation highlights part 55 |
Patent application number | Title | Published |
20220138133 | DELIVERING INTERRUPTS TO USER-LEVEL APPLICATIONS - Systems and methods for delivering interrupts to user-level applications. An example processing system comprises: a memory configured to store a plurality of user-level APIC data structures and a plurality of user-level interrupt handler address data structures corresponding to a plurality of user-level applications being executed by the processing system; and a processing core configured, responsive to receiving a notification of a user-level interrupt, to: set a pending interrupt bit flag having a position defined by an identifier of the user-level interrupt in a user-level APIC data structure associated with a user-level application that is currently being executed by the processing core, and invoke a user-level interrupt handler identified by a user-level interrupt handler address data structure associated with the user-level application, for a pending user-level interrupt having a highest priority among one or more pending user-level interrupts identified by the user-level APIC data structure. | 2022-05-05 |
20220138134 | SCHEDULING TECHNIQUES FOR ISOCHRONOUS IN TRAFFIC IN A USB EXTENSION ENVIRONMENT - In some embodiments, a system for communicating USB information via a non-USB extension medium is provided. The system comprises an upstream facing port device (UFP device) and a downstream facing port device (DFP device). The DFP device is configured to receive, from the UFP device via the extension medium, a first ACK IN packet addressed to a first endpoint and a second ACK IN packet addressed to a second endpoint after receiving the first ACK IN packet. In response to detecting that the USB-compliant connection is available, the DFP device compares a bInterval value for the first endpoint to a bInterval value for the second endpoint; and in response to determining that the bInterval value for the second endpoint is smaller than the bInterval value for the first endpoint, the DFP device transmits a synthetic ACK IN packet to the second endpoint based on the second ACK IN packet. | 2022-05-05 |
20220138135 | USB DEVICE, USB CABLE AND USB REPEATER THEREOF - The disclosure provides a USB device, a USB cable, and a USB repeater. The USB cable or the USB device includes a USB connector and the USB repeater. The USB repeater may gain a signal of a differential pin pair of the USB connector. The USB repeater may monitor a signal of a configuration channel pin of the USB connector. The USB repeater selectively runs in one of a plurality of working modes corresponding to a plurality of protocols according to a monitoring result. | 2022-05-05 |
20220138136 | DIE TO DIE PHYSICAL LAYER TRANSLATION SWITCH - A physical translation switch may have two parallel channel interfaces (e.g., BoW interfaces) and two serial channel interfaces (e.g., XSR interfaces). The translation switch may have a parallel switching fabric for directing input traffic from input ports on a first type of channel interface to output ports of a second type of channel interface. Thus, when one wants to connect a chiplet with a BoW interface to a chiplet with an XSR interface, the translation switch is connected between the chiplets to provide the needed compatibility. The translation switch provides the needed compatible channel interfaces for the chiplets. | 2022-05-05 |
20220138137 | USB DEVICE REMOVAL AND PING INTERVENTION IN AN EXTENSION ENVIRONMENT - In some embodiments, a system for communicating USB information via an extension medium is provided. The system comprises an upstream facing port device (UFP device) and a downstream facing port device (DFP device). The UFP device is communicatively coupled to a host device via a USB-compliant connection. The DFP device is communicatively coupled to at least one USB device via a USB-compliant connection and communicatively coupled to the UFP device via a non-USB extension medium. The DFP device is configured to receive, from the UFP device, an incoming request packet addressed to a first USB endpoint provided by a USB device; and hold transmission of an outgoing request packet based on the incoming request packet to the USB device in response to determining that a ping response packet has not yet been received from the first USB endpoint. | 2022-05-05 |
20220138138 | NETWORK-ON-CHIP DATA PROCESSING METHOD AND DEVICE - The present application relates to a network-on-chip data processing method. The method is applied to a network-on-chip processing system, the network-on-chip processing system is used for executing machine learning calculation, and the network-on-chip processing system comprises a storage device and a calculation device. The method comprises: accessing the storage device in the network-on-chip processing system by means of a first calculation device in the network-on-chip processing system and obtaining first operation data; performing an operation on the first operation data by means of the first calculation device to obtain a first operation result; and sending the first operation result to a second calculation device in the network-on-chip processing system. According to the method, operation overhead can be reduced and data read/write efficiency can be improved. | 2022-05-05 |
20220138139 | COMPOSITE INTERFACE CIRCUIT - Composite interface circuit including bidirectional single-conductor bus, first switching circuit, and second switching circuit. Bidirectional single-conductor bus is coupled by first pull-up resistor (R | 2022-05-05 |
20220138140 | HIGH THROUGHPUT CIRCUIT ARCHITECTURE FOR HARDWARE ACCELERATION - A hardware acceleration device can include a switch communicatively linked to a host central processing unit (CPU), an adapter coupled to the switch via a control bus, wherein the control bus is configured to convey addresses of descriptors from the host central CPU to the adapter, and a random-access memory (RAM) coupled to the switch through a data bus. The RAM is configured to store descriptors received from the host CPU via the data bus. The hardware acceleration device can include a compute unit coupled to the adapter and configured to perform operations specified by the descriptors. The adapter may be configured to retrieve the descriptors from the RAM via the data bus, provide arguments from the descriptors to the compute unit, and provide control signals to the compute unit to initiate the operations using the arguments. | 2022-05-05 |
20220138141 | USB MODULE - A USB module includes a first USB port configured to connect a first USB-compatible device with a first USB cable and a USB plug, and a second port configured to connect a second USB-compatible device with a second USB cable. The USB cables are multi-core and respectively comprise first and second configuration lines. An interface is arranged between the first USB port and the second port in a housing interior of a housing of the USB module. The interface makes at least the first configuration line connectable to the second configuration line. The interface comprises a semiconductor module configured to reference to a ground potential of the USB module at least one output signal at the USB module on a configuration connection between the first and second configuration lines. | 2022-05-05 |
20220138142 | INITIALIZATION SEQUENCING OF CHIPLET I/O CHANNELS WITHIN A CHIPLET SYSTEM - A system comprises an interposer including interconnect and multiple chiplets arranged on the interposer. Each chiplet includes multiple chiplet input-output (I/O) channels interconnected to I/O channels of other chiplets by the interposer; a chiplet I/O interface for the chiplet I/O channels that includes multiple interface layers; and initialization logic circuitry configured to advance initialization of the chiplet interface sequentially through the interface layers starting with a lowest interface layer. | 2022-05-05 |
20220138143 | ADAPTIVE INTERFACE HIGH AVAILABILITY STORAGE DEVICE - An adaptive interface high availability storage device. In some embodiments, the adaptive interface high availability storage device includes: a rear storage interface connector; a rear multiplexer, connected to the rear storage interface connector; an adaptable circuit connected to the rear multiplexer; a front multiplexer, connected to the adaptable circuit; and a front storage interface connector, connected to the front multiplexer. The adaptive interface high availability storage device may be configured to operate in a single-port state or in a dual-port state. The adaptive interface high availability storage device may be configured: in the single-port state, to present a single-port host side storage interface according to a first storage protocol at the rear storage interface connector, and in the dual-port state, to present a dual-port host side storage interface according to the first storage protocol at the rear storage interface connector. | 2022-05-05 |
20220138144 | LONGEVITY MANAGEMENT OF SOCIAL NETWORK DATA - In an approach to longevity management of social network data, a computer detects a posting of a social artifact by a first user of a social network. A computer stores the social artifact with associated identification information. A computer stores activity associated with the social artifact by one or more other users. A computer detects a status change in an account associated with the first user, wherein the status change indicates the first user is not active in the social network. In response to detecting the status change, a computer determines a second user from the one or more other users to which to transfer the social artifact based on the social artifact, the associated identification information, and the activity associated with the social artifact by the one or more other users. A computer transfers the social artifact to an account associated with the second user on the social network. | 2022-05-05 |
20220138145 | EMPIRICAL DATA GATHERED BY AMBIENT COMPUTER OBSERVATION OF A PERSON ARE ANALYZED TO IDENTIFY AN INSTANCE OF A PARTICULAR BEHAVIOR - Computer systems configured to correlate instances of empirical data, gathered from ambient observation of a person, as being potentially relevant to each other vis-à-vis one particular behavior. A pair of correlated instances of empirical data is analyzed to identify it as an instance of the one particular behavior. Such computer systems facilitate transmission of a digital message, the content of which may be determined in response to the instance of the one particular behavior. | 2022-05-05 |
20220138146 | MERGING COMPOSITE IMAGES INTO A NEW FILESYSTEM NAMESPACE - Merging a plurality of CIMs into a merged filesystem namespace includes accessing merge configuration information that identifies a plurality of backing CIMs and a merge precedence order for the backing CIMs. Based on the merge configuration information, merged metadata is generated from metadata portions of the backing CIMs. The merged metadata defines a merged filesystem namespace comprising two or more filesystem objects from the backing CIMs. The merged metadata includes at least first and second merged metadata items that each defines a corresponding filesystem object as being part of the merged filesystem namespace. Each merged metadata item corresponds to a corresponding metadata item within a corresponding metadata portion of a different backing CIM, references a data portion of its corresponding backing CIM, and is generated based on its corresponding filesystem object having no conflict with any filesystem object from any backing CIM that has a higher merge precedence. | 2022-05-05 |
20220138147 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND NON-TRANSITORY STORAGE MEDIUM - One embodiment of the present invention provides an information processing apparatus which detects lack of information set to an information model and recommends editing. An information processing apparatus which is one embodiment of the present invention includes an acquirer and an editing recommender. The acquirer acquires content to be edited for the information model. The editing recommender outputs information which recommends editing the information model on the basis of a function template to which information set to the information model is applicable or a function model to which the information set to the information model is applied, and the content to be edited. | 2022-05-05 |
20220138148 | DATA PREVIEWING BEFORE RECALLING LARGE DATA FILES - Techniques for providing data preview before recalling large data files are disclosed. In one aspect, a data file is made accessible while being offline by converting the data file from a native format to a preview format, storing the data file in the preview format in a primary storage that is locally available and moving, after the conversion to the preview format, the data file in the native format to a secondary storage. When a viewing request is received for the data file, the data file in the preview format is displayed to fulfill the viewing request. | 2022-05-05 |
20220138149 | FILE LEVEL INCREMENTAL CONTINUOUS DATA PROTECTION - Creating point-in-time versions of files for applications at a storage system includes maintaining at the storage system a data structure correlating each of a plurality of applications with files for each of the applications and correlating each of the files with portions of the data storage system, using the data structure to determine specific files for a particular one of the applications for which a point-in-time version is being created, using the data structure to determine specific portions of the storage system corresponding to the specific files, suspending writes to the specific portions, completing previous writes to the specific portions following suspending writes, and performing a snapshot of the specific files following completing previous writes. The portions of the data storage may be extents. A host may provide information to the storage system to correlate applications with files and to correlate files with portions of the data storage system. | 2022-05-05 |
20220138150 | MANAGING CLUSTER TO CLUSTER REPLICATION FOR DISTRIBUTED FILE SYSTEMS - Embodiments are directed to managing data in a file system over a network. A source file system and a target file system associated based on a replication relationship associated with snapshot policies. Snapshots may be generated on the source file system based on snapshot policies such that each snapshot is an archive of the source file system. The snapshots may be added to a queue on the source file system that may be associated with the replication relationship such that the snapshot is associated with a snapshot retention period that is local to the source file system and a remote replication retention period based on the replication relationship. Copying the snapshot to the target file system based on the remote replication retention period being unexpired. | 2022-05-05 |
20220138151 | SIBLING OBJECT GENERATION FOR STORING RESULTS OF OPERATIONS PERFORMED UPON BASE OBJECTS - Techniques are provided for on-demand creation and/or utilization of containers and/or serverless threads for hosting data connector components. The data connector components can be used to perform integrity checking, anomaly detection, and file system metadata analysis associated with objects stored within an object store. The data connector components may be configured to execute machine learning functionality to perform operations and tasks. The data connector components can perform full scans or incremental scans. The data connector components may be stateless, and thus may be offlined, upgraded, onlined, and/or have tasks transferred between data connector components. Results of operations performed by the data connector components upon base objects may be stored within sibling objects. | 2022-05-05 |
20220138152 | FULL AND INCREMENTAL SCANNING OF OBJECTS - Techniques are provided for on-demand creation and/or utilization of containers and/or serverless threads for hosting data connector components. The data connector components can be used to perform integrity checking, anomaly detection, and file system metadata analysis associated with objects stored within an object store. The data connector components may be configured to execute machine learning functionality to perform operations and tasks. The data connector components can perform full scans or incremental scans. The data connector components may be stateless, and thus may be offlined, upgraded, onlined, and/or have tasks transferred between data connector components. Results of operations performed by the data connector components upon base objects may be stored within sibling objects. | 2022-05-05 |
20220138153 | CONTAINERIZATION AND SERVERLESS THREAD IMPLEMENTATION FOR PROCESSING OBJECTS - Techniques are provided for on-demand creation and/or utilization of containers and/or serverless threads for hosting data connector components. The data connector components can be used to perform integrity checking, anomaly detection, and file system metadata analysis associated with objects stored within an object store. The data connector components may be configured to execute machine learning functionality to perform operations and tasks. The data connector components can perform full scans or incremental scans. The data connector components may be stateless, and thus may be offlined, upgraded, onlined, and/or have tasks transferred between data connector components. Results of operations performed by the data connector components upon base objects may be stored within sibling objects. | 2022-05-05 |
20220138154 | STORAGE DEVICES FOR STORING LOG FILES - In an example implementation according to aspects of the present disclosure, a method may include, upon generating a log file, determining whether a primary log storage device is accessible, and if the primary log storage device is inaccessible, identifying storage devices available for storing the log file. For each storage device identified, the method includes determining factors, and choosing a storage device from the identified storage devices based on the determined factors. The method includes storing the log file on the chosen storage device. | 2022-05-05 |
20220138155 | LOCATING FILES USING A DURABLE AND UNIVERSAL FILE IDENTIFIER - Files can be located using a durable and universal file identifier. A content URI includes a file protocol URI specifying a path to a file. The file protocol URI includes a query string specifying properties of the file that can be utilized to locate the file, such as an object ID property specifying a GUID for the file and a volume ID property specifying a GUID for a storage volume storing the file. The content URI can be utilized to locate the file using the file protocol URI and its associated query string even if the file has been moved, renamed, or is accessed on a different computing device. Operations can then be performed using the file, such as resuming a previously performed activity that used the file. | 2022-05-05 |
20220138156 | METHOD AND APPARATUS PROVIDING A TIERED ELASTIC CLOUD STORAGE TO INCREASE DATA RESILIENCY - Methods, apparatus, systems, and articles of manufacture providing a tiered elastic cloud storage to increase data resiliency are disclosed. An example instructions cause one or more processors to at least execute the instructions to: generate a storage scheme for files based on a categorization of the files and resource capabilities of an edge-based device and a cloud-based device, the categorization including a first group of files to be stored locally at an end user computing device, a second group of files to be stored externally at the edge-based device, and a third group of files to be stored externally at the cloud-based device; in response to an acknowledgement from at least one of the edge-based device or the cloud-based device, generate a map corresponding to locations of the files; store the first group of files in local storage; and cause transmission of the second group of files to the edge-based device and the third group of files to the cloud-based device | 2022-05-05 |
20220138157 | DISTRIBUTED MEASUREMENT SYSTEM FOR SCANNING PROJECTS - A system and method for providing a distributed measurement system. The system performs operations that include receiving, via a user interface of a user device, a request from a requestor to access a data file of a project. The project includes a plurality of data files including the data file, and at least one of the one or more data files is generated based at least in part on measurement data output from a measurement device. Based on determining that the requestor has permission to access the data file, one or more editing options are provided for editing the data file. The one or more editing options vary based at least in part on one or both of a characteristic of the user device and a characteristic of the data file. The data file is edited in response to receiving an editing request. | 2022-05-05 |
20220138158 | RELIABLE DELIVERY OF EVENT NOTIFICATIONS FROM A DISTRIBUTED FILE SYSTEM - Embodiments include a method for fault tolerance in the delivery of event information within a file system cluster. One or more processors to determine event information associated with file system activity performed by a node of the cluster. The one or more processors add the event information to an event log buffer in memory. The one or more processors receive a first log sequence number (LSN) associated with flushing of recovery information from a recovery log buffer. The one or more processors determine the event information in the event log buffer having a log sequence number less than or equal to the first log sequence number, and determining the event information includes log sequence numbers less than or equal to the first log sequence number, the one or more processors flush the corresponding event information from the event log buffer to disk storage. | 2022-05-05 |
20220138159 | METHOD AND SYSTEM FOR DATA DEDUPLICATION AND COMPRESSION IN UNTRUSTED STORAGE SYSTEM - A method for data deduplication and compression in untrusted storage system is provided for storing large amount of data more efficiently and in a secure manner and by maintaining the integrity of the data. Such data deduplication and compression in untrusted storage system is achieved by utilizing by a system comprising a set of trusted servers, which are configured to trust each other and to share common encryption keys. | 2022-05-05 |
20220138160 | Clause-Level Permissions in an Online Document System - An online document system can allow users to participate in collaborative negotiation of documents stored with in the online document system. To facilitate negotiations between multiple entities (each potentially including multiple users with different roles in the negotiation), the online document system includes a permissions system that allows per-clause control over user's access to propose and approve changes to a negotiated document. Similarly, the user interfaces for viewing a negotiated document provided by the online document system to users can depend on the role of that user in editing the document and the current stage of the negotiation of the document. Finally, the online document system can track agreement between sides in a negotiation on a per-clause basis and can otherwise help facilitate the negotiation of the document. | 2022-05-05 |
20220138161 | Edit Interface in an Online Document System - An online document system can allow users to participate in collaborative negotiation of documents stored with in the online document system. To facilitate negotiations between multiple entities (each potentially including multiple users with different roles in the negotiation), the online document system includes a permissions system that allows per-clause control over user's access to propose and approve changes to a negotiated document. Similarly, the user interfaces for viewing a negotiated document provided by the online document system to users can depend on the role of that user in editing the document and the current stage of the negotiation of the document. Finally, the online document system can track agreement between sides in a negotiation on a per-clause basis and can otherwise help facilitate the negotiation of the document. | 2022-05-05 |
20220138162 | SYSTEM AND METHOD FOR IDENTIFYING, INVENTORYING, MANAGING, AND MONETIZING WATER ASSETS - Computer-implemented systems and methods for water asset management are disclosed. The systems include water data services components having computer implemented modules for generating a prompt for a user to input a water asset identification number, retrieving and returning water asset metadata in response to input of a valid water asset identification number, generating a prompt for user validation of the returned water asset metadata, storing validated water asset metadata;, communicating the stored and validated water asset metadata to an interplanetary file system (IPFS) for generation of a water asset metadata hash value, and storage of the water asset metadata hash value in a cloud table. The systems also include a cloud big table component comprising modules for storing and updating the cloud table. | 2022-05-05 |
20220138163 | INCREMENTAL VIRTUAL MACHINE METADATA EXTRACTION - A virtual machine container file is analyzed to determine which portion of the virtual machine container file corresponds to a virtual machine file system metadata of the virtual machine container file. One or more differences between a first version of a virtual machine container file and a second version of the virtual machine container file are determined at least in part by traversing a snapshot structure associated with the virtual machine container file. The determined one or more differences that corresponds to the virtual machine file system metadata portion of the virtual machine container file are identified based at least in part on the analysis of the virtual machine container file. The identified one or more differences corresponding to the virtual machine file system metadata portion of the virtual machine file are utilized to identify one or more changes from the content files included in the first version of the virtual machine container file to content files included in the second version of the virtual machine container file. | 2022-05-05 |
20220138164 | ADDRESS MIRRORING OF A FILE SYSTEM JOURNAL - Techniques for address mirroring of a file system journal are presented. A transactional file system update can correspond to a write operation to be performed at a first participant node of a data storage system. A journal transfer component can transfer the transactional file system update from an initiator node of the data storage system to a first journal associated with the first participant node and recovery information relating to the update to a second journal associated with a second participant node of the data storage system. The recovery information can be determined based on the update. To facilitate the update, a journal descriptor block can be generated and sent to the second participant node, such block comprising the recovery information, which can include transaction state, block addresses involved in the transaction, error correction-related information, or a mirror block address set for the block addresses where desired. | 2022-05-05 |
20220138165 | IDENTITY-LESS PERSONALIZED COMMUNICATION SERVICE - Data characterizing wireless emissions of a mobile device of a fuel dispenser user can be received. An identity-less parameter associated with the mobile device of the fuel dispenser user can be determined from the received data. A determination of whether the identity-less parameter is associated with a database record characterizing a profile and stored in a profile database can be made. The determination of whether the identity-less parameter is associated with the database record can be provided. | 2022-05-05 |
20220138166 | INTEGRATED TRANSITION CONTROL CENTER - Systems, methods, and machine-readable media to migrate data from source databases to target databases are disclosed. Data may be received, relating to the source databases and the target databases. For each source database, a migration assessment may be generated based on analyzing the data, and a migration method may be selected. A migration plan that specifies a parallel migration of a set of databases to the target databases may be created, with a first migration method to migrate a first subset of the set of databases and a second migration method to migrate a second subset of the set of databases. The parallel migration may be executed according to the migration plan may be caused so that the first subset of the set of databases is migrated with the first migration method while the second subset of the set of databases is migrated with the second migration method. | 2022-05-05 |
20220138167 | VIEW TABLES FRAMEWORK - In entity transition from legacy systems to a big data distributed data platform, numerous system-based architectural gaps have surfaced. There exists a need for a bridge component for each of the architectural gaps in order to support the entity transition to the big data distributed data platform. These bridge components include a variety of frameworks that are configured to automate certain processes that are needed for the transition. These processes have only become necessary as a result of the Hadoop platform. The automated processes include a snapshot load platform. The snapshot load platform enables the addition of a new view to the historical tables. The platform includes replacing the entire table in a truncated scenario. The platform includes replacing cases in a refresh or update scenario. | 2022-05-05 |
20220138168 | MAINTAINING ROW DURABILITY DATA IN DATABASE SYSTEMS - A database system operates by: receiving a plurality of row data associated with a first data source; identifying a subset of row data from the plurality of row data that includes only ones of the plurality of row data that compare favorably to maintained row durability data; generating at least one page from ones of the plurality of row data included in the subset of row data; storing the at least one page in long term storage; generating updated row durability data indicating a least favorably ordered row number of a plurality of row numbers corresponding to the subset of row data based on storing the at least one page in long term storage; and updating the maintained row durability data to indicate the least favorably ordered row number of the updated row durability data. | 2022-05-05 |
20220138169 | ON-DEMAND PARALLEL PROCESSING OF OBJECTS USING DATA CONNECTOR COMPONENTS - Techniques are provided for on-demand creation and/or utilization of containers and/or serverless threads for hosting data connector components. The data connector components can be used to perform integrity checking, anomaly detection, and file system metadata analysis associated with objects stored within an object store. The data connector components may be configured to execute machine learning functionality to perform operations and tasks. The data connector components can perform full scans or incremental scans. The data connector components may be stateless, and thus may be offlined, upgraded, onlined, and/or have tasks transferred between data connector components. Results of operations performed by the data connector components upon base objects may be stored within sibling objects. | 2022-05-05 |
20220138170 | VECTOR-BASED SEARCH RESULT GENERATION - A system and method to generate search results in response to a search query based on comparisons of embedding vectors. The system and method receive, from an end user system, a search query including a set of keywords associated with the entity. Using a neural network, an embedding vector is identified based on the set of keywords of the search query. The system and method compares the embedding vector associated with the search query to a set of embedding vectors associated with a set of structured data elements relating to the entity. Based on the comparison, a set of matching structured data elements is identified. The system and method generate a search result in response to the search query, wherein the search result includes at least a portion of the set of matching structured data elements. The search result is displayed via an interface of the end user system. | 2022-05-05 |
20220138171 | LOCATION-BASED RECOMMENDATIONS USING NEAREST NEIGHBORS IN A LOCALITY SENSITIVE HASHING (LSH) INDEX - Software for a website hosting short-text services creates an index of buckets for locality sensitive hashing (LSH). The software stores the index in an in-memory database of key-value pairs. The software creates, on a mobile device, a cache backed by the in-memory database. The software then uses a short text to create a query embedding. The software map the query embedding to corresponding buckets in the index and determines which of the corresponding buckets are nearest neighbors to the query embedding using a similarity measure. The software displays location types associated with each of the buckets that are nearest neighbors in a view in a graphical user interface (GUI) on the mobile device and receives a user selection as to one of the location types. Then the software displays the entities for the selected location type in a GUI view on the mobile device. | 2022-05-05 |
20220138172 | METHOD AND SYSTEM FOR DISTRIBUTED DATA STORAGE WITH ETERNAL INTEGRITY GUARANTEES - A method for generating a universal distributed data storage includes: receiving a plurality of data values; generating a key for each of the plurality of data values, wherein the respective key is generated via application of a hashing algorithm to the associated data value; storing, in a database, each of the plurality of data values and the associated generated key as a plurality of key-value pairs; receiving a plurality of additional key-value pairs, wherein each value of the plurality of additional key-value pairs is not included in the plurality of data values; and storing, in the database, each of the plurality of additional key-value pairs, wherein each key included in the plurality of additional key-value pairs is generated via application of the hashing algorithm to the associated value and is not included in the keys generated for each of the plurality of data values. | 2022-05-05 |
20220138173 | FASTER ACCESS FOR COMPRESSED TIME SERIES DATA: THE BLOCK INDEX - A system and method for faster access for compressed time series data. A set of blocks are generated based on a table stored in a database of the data platform. The table stores data associated with multiple sources of data provided as consecutive values, each block containing index vectors having a range of the consecutive values. A block index is generated for each block having a field start vector representing a starting position of the block relative to the range of consecutive values, and a starting value vector representing a value of the block at the starting position. The field start vector of the block index is accessed to obtain the starting position of a field corresponding to a first block and to the range of the consecutive values of the first block. The starting value vector is then determined from the block index to determine an end and a length of the field of the first block. | 2022-05-05 |
20220138174 | Weighted Event Forest - Embodiments of the present disclosure are directed to specific, networked, and technological processes and operations. For example, various embodiments are directed to a distributed and collaborative planning tool that allows users to create events based on a presently-approved production plan, enable/disable events submitted by other users, submit proposals, approve proposals, and integrate proposals to update the presently-approved production plan. An event published by a first user is communicated to other users using a single, universal framework that tracks and communicates proposed changes between remote users and their associated client devices during the planning cycle without the need to store multiple iterations of full-size production plans. | 2022-05-05 |
20220138175 | LOCK WAIT TRACING - Techniques are disclosed relating to lock wait tracing. A computer system may operate a database that includes a lockable object. The computer may maintain a lock wait queue that stores an indication of processes waiting to acquire a lock on the lockable object. The computer system may store trace records for those processes that, upon releasing a respective lock on the lockable object when another process is waiting in the lock wait queue, have been in contention for the respective lock for over a threshold amount of time. The computer system may present ones of the trace records that identify a timeline that is usable to determine a set of processes that contributed to a delay in a process acquiring a lock on the lockable object. | 2022-05-05 |
20220138176 | ANALYSIS INFORMATION MANAGEMENT DEVICE AND ANALYSIS INFORMATION MANAGEMENT METHOD - Selection of a batch file that causes an analysis device to analyze a sample successively is received by a receiver. Batch analysis data that represents an analysis result and corresponds to the batch file, selection of which is received, is acquired from a database device. Standard information, for verifying validity of an analysis performed by the analysis device, which corresponds to the batch file, selection of which is received, is acquired by a standard information acquirer from the database device. A report that describes an analysis result represented by the batch analysis data and an evaluation result in regard to validity of an analysis performed by the analysis device is created by a creator based on the acquired batch analysis data and the acquired standard information. | 2022-05-05 |
20220138177 | FAULT TOLERANCE FOR TRANSACTION MIRRORING - Systems and methods facilitating fault tolerance for transaction mirroring are described herein. A method as described herein can include receiving a commit command for a data transaction from an initiator node of the system, wherein the data transaction is associated with a first failure domain, and wherein the commit command is directed to a primary participant node and a secondary participant node of the system; determining whether a response to the commit command has been received at the primary participant node from the secondary participant node in response to the receiving; and, in response to determining that the response to the commit command was not received at the primary participant node, indicating that the secondary participant node is invalid in a data store associated with a second failure domain that is distinct from the first failure domain. | 2022-05-05 |
20220138179 | PRIVATE BLOCKCHAIN SYSTEM AND METHOD - A system, apparatus or method includes defining and creating a private blockchain that stores records or documents on a cloud storage by a predefined set of nodes, receiving a selection from a user node of a record or of a document for modification where the selection creates a flagged record or a flagged document, receiving a vote tally from among the predefined set of nodes, and modifying the record or document based on a consensus of the vote tally by adding an update block to the blockchain. The system, apparatus or method can further broadcast the update block to each node in the predefined set of nodes, add the update block to a local blockchain of each node, and present the flagged document or the flagged record as modified by the update block. | 2022-05-05 |
20220138180 | BLOCKCHAIN SERVICE BASED APPLICATION GENERATOR - Disclosed herein are various embodiments for blockchain service based application generator. An embodiment operates by determining a blockchain service configured to access, store, and receive updates to transactional data of the blockchain service. An enhanced data object including a wrapper with one or more additional properties corresponding to an original data object of the blockchain service is generated. The enhanced data object is transformed into a data protocol object. Metadata is generated based on the data protocol object. A data protocol service is generated based on the metadata. The application interface is configured based on the metadata, wherein the application interface is configured to communicate with both the data protocol service and the blockchain service. The application interface is provided to a user who is enabled to update the transactional data through the application interface. | 2022-05-05 |
20220138181 | SCHEMA-BASED PRUNING OF BLOCKCHAIN DATA - An example operation may include one or more of receiving, from a client, a pruned data structure that comprises a plurality of fields and a plurality of hash values, respectively, identifying a schema associated with the pruned data structure, determining whether the pruned data structure is a valid based on the plurality of fields in the data structure and the identified schema associated with the client, and in response to a determination that the pruned data structure is valid, committing the pruned data structure to a blockchain. | 2022-05-05 |
20220138182 | SYSTEMS AND METHODS OF TRANSACTION IDENTIFICATION GENERATION FOR TRANSACTION-BASED ENVIRONMENT - Described herein are systems and methods for transaction identification (ID) generation in transaction-based environments. The systems and methods provided generated transaction IDs which inherently define a range of values (a range of blockchain heights) within which the transaction is valid. This obviates problems associated with traditional transaction ID databases where a transaction ID only comprises a hashed value. That is, the presently disclosed systems and methods are an improvement over traditional hashing schemes as in traditional hashing schemes, a server must traverse an entire transaction ID database to determine if an incoming transaction is valid. | 2022-05-05 |
20220138183 | WEB SERVICES PLATFORM WITH INTEGRATION AND INTERFACE OF SMART ENTITIES WITH ENTERPRISE APPLICATIONS - One or more non-transitory computer readable media contain program instructions that, when executed by one or more processors, cause the one or more processors to perform operations including: creating and managing a plurality of smart entities, each of the smart entities including a plurality of attributes; receiving inbound data from one or more enterprise applications; translating the inbound data into values for one or more of the plurality of attributes; writing the plurality of attributes to the smart entities; reading the plurality of attributes from the smart entities; translating the plurality of attributes into outbound data; and providing the outbound data to the one or more enterprise applications. | 2022-05-05 |
20220138184 | OBJECT RESOLUTION AMONG ACCOUNT-LEVEL NAMESPACES FOR DATABASE PLATFORMS - A database platform receives an object identifier from a client in association with a database session. The client is associated with a customer account of the database platform, and the database session is associated with the client. The customer account includes multiple disjoint account-level namespaces, each of which represents a distinct context for resolution of object identifiers, such that matching object identifiers in different account-level namespaces in the customer account do not collide with respect to object-identifier resolution. The database platform determines that the object identifier does not specify an account-level namespace, and responsively resolves the object identifier with reference to a current account-level namespace of the database session by identifying an object corresponding to the object identifier in the customer account. | 2022-05-05 |
20220138185 | SCENE GRAPH MODIFICATION BASED ON NATURAL LANGUAGE COMMANDS - Systems and methods for natural language processing are described. Embodiments are configured to receive a structured representation of a search query, wherein the structured representation comprises a plurality of nodes and at least one edge connecting two of the nodes, receive a modification expression for the search query, wherein the modification expression comprises a natural language expression, generate a modified structured representation based on the structured representation and the modification expression using a neural network configured to combine structured representation features and natural language expression features, and perform a search based on the modified structured representation. | 2022-05-05 |
20220138186 | DATA SET ACQUISITION METHOD, TERMINAL DEVICE AND COMPUTER READABLE STORAGE MEDIUM - The present application is used in the technical field of data set acquisition, and provides a data set acquisition method, a terminal device, and a computer readable storage medium. One data set acquisition method comprises: when detecting a target command to access a target result set, on the basis of an access key word in the target command, determining a target cursor set from a cursor set of the target result set; and, on the basis of the access key word and the target cursor set, acquiring a target data set from the target result set, thereby implementing direct acquisition of a data set in a target result set, providing a basis for directly processing target data in a target result set, and increasing the efficiency of data set acquisition. | 2022-05-05 |
20220138187 | ANALYTIC SYSTEMS, METHODS, AND COMPUTER-READABLE MEDIA FOR STRUCTURED, SEMI-STRUCTURED, AND UNSTRUCTURED DOCUMENTS - A computer system extracts contender values as positively associated with a pre-defined value from a compilation of one or more electronically stored semi-structured document(s) and/or one or more electronically stored unstructured document(s). The computer system performs a multi-dimensional analysis to narrow the universe of contender values from all words on a page of the compilation to the contender value(s) with the highest likelihood of being associated with the pre-defined value. The system's platform allows every user of the system to customize the system according to the user's needs. Various aspects can enable users to mine document stores for information that can be charted, graphed, studied, and compared to help make better decisions. | 2022-05-05 |
20220138188 | GENERIC SCHEDULING - A system and method for customized scheduling of sources, including breaking down a source of content into at least two categories, including posts and engagements, and gathering content related to a specific source. A scheduler handles scheduling of posts and engagement for a single source and entities that are due to be crawled are sent to a scheduling queue, in which each content type for a source can have its own queue. A process points to the correct scheduler queue in order to request content to be crawled, attaches to the proper queue, processes requests, queries the social network for content, parses the response and sends any new data to be saved to the system. | 2022-05-05 |
20220138189 | QUERY EXECUTION DEBUGGER FOR USE WITH BUSINESS INTELLIGENCE AND DATA ANALYTICS ENVIRONMENTS - In accordance with an embodiment, described herein is a query execution debugger, for use with a computing environment such as, for example, a business intelligence environment, database, data warehouse, or other type of environment that supports data analytics. A query engine, for example a business intelligence server instance, serves analytics queries or requests from clients, directed to data stored at a database, in accordance with a query execution plan, wherein a logical query can include query language statements received from the clients; while a physical query includes database-specific statements that the query engine sends to the database to retrieve data when processing the logical query. The system can create a query execution debugger file that includes a record metadata portion or section, and a data portion or section, and which can be used to review, simulate, or debug the processing of queries against the database. | 2022-05-05 |
20220138190 | SURROGATE DATA GENERATION OF PRIVATE DATA - Features are disclosed for dynamically generating a proxy representation of characteristics associated with a private data set. A computing device can receive a private data set including private or proprietary information. The compute device can determine one or more characteristics that are associated with the private data set. The computing device can further receive a public data library that includes characteristics that are publicly available. The computing device may generate a proxy representation based on the public data library and the proxy representation may include one or more characteristics that represent the private data set. The proxy representation may be provided to one or more entities who are unauthorized to access the private data set. In some embodiments, the private data set may correspond to an exchange traded fund and the characteristics may correspond to risk factors associated with the exchange traded fund. | 2022-05-05 |
20220138191 | SYSTEMS AND METHODS FOR MATCHING ELECTRONIC ACTIVITIES WITH WHITESPACE DOMAINS TO RECORD OBJECTS IN A MULTI-TENANT SYSTEM - The present disclosure relates to linking record objects between systems of record based on a comparison of object field-value pairs to a ground truth. A domain name may be identified from an electronic activity. It may be determined that the electronic activity does not match with any first record objects. A second record object including the domain name as a value may be identified. Object field-value pairs of the second record object may be identified. It may be determined that a third record object matches with the second record object. The electronic activity may be matched to the third second record object or a fourth record object. An association between the electronic activity and the third record object or the fourth record object may be stored. | 2022-05-05 |
20220138192 | SYSTEMS AND METHODS FOR MANAGEMENT OF MULTI-TENANCY DATA ANALYTICS PLATFORMS - A data analytics system configured to perform operations is disclosed. The operations can include creating, in response to instructions received from a user, a first pipeline. This pipeline can be configured to extract data from an append-only first data store, extract identifying characteristics from the extracted data, provide the identifying characteristics to an identity service, and receive a tenancy identifier from the identity service. The pipeline can further be configured to create a data object in a second data store using the extracted data; create a tenancy object in a metadata store, the tenancy object associated with the data object, the metadata store implementing a hierarchical data object ownership graph; and associate the tenancy object with a parent object in the hierarchical data object ownership graph. The data analytics system can then tear down the first pipeline. | 2022-05-05 |
20220138193 | CONVERSION METHOD AND SYSTEMS FROM NATURAL LANGUAGE TO STRUCTURED QUERY LANGUAGE - The present application discloses a conversion method and system from natural language to structured query language. The method includes obtaining a natural language question text; converting from the natural language question text to the structured query language according to similarities between the natural language question text and natural language questions in a preset dataset; and when there is no target natural language question in the preset dataset, converting the natural language question text to the structured query language by a conversion algorithm model. | 2022-05-05 |
20220138194 | PARAMETER OPTIMIZATION APPARATUS, METHOD, AND SYSTEM - According to one embodiment, a parameter optimization apparatus stores data sets which each include a first parameter value of a first number of dimensions and an observed value of an objective function corresponding to the first parameter value. The apparatus determines a search space of a second number of dimensions smaller than the first number of dimensions. The apparatus acquires one or more data sets each having a first parameter value present within a predetermined distance from the search space. The apparatus searches the search space for a first parameter value that may optimize the objective function, using a surrogate model of an objective function based on one or more data sets acquired. | 2022-05-05 |
20220138195 | USER DEFINED FUNCTIONS FOR DATABASE QUERY LANGUAGES BASED ON CALL-BACK FUNCTIONS - A parallel database system processes database queries invoking a user defined function (UDF). The database query is specified in a database query language, for example, the structured query language (SQL) and the UDF is specified in a programming language different from the database query language, for example, C/C++. The UDF may include multiple phases. The parallel database system generates optimized code for the UDF. The parallel database system includes a leader node and a plurality of compute nodes. The database query processes one or more database tables such that each compute node processes a slice of each database table. The leader node sets up a global context structure and provides it to each compute node. The global context may be shared across multiple executions of the query. The UDF may be used for efficient execution of extraction, transformation, and loading of data from external systems. | 2022-05-05 |
20220138196 | AUTOMATIC PRUNING CUTOFF IN A DATABASE SYSTEM - During a query compilation process, a query is received that is directed to a set of source tables, each source table from the set of source tables being organized into at least one micro-partition and the query including at least one pruning operation. During the query compilation process, a modification of the query is performed for adjusting the at least one pruning operation, the modification being based on a set of statistics collected for previous pruning operations on at least a portion of the set of source tables and a set of heuristics, the set of statistics indicating at least an amount of execution time for each previous query associated with each of the previous pruning operations. The query is compiled including the modification of the query. The compiled query is provided to an execution node of a database system for execution. | 2022-05-05 |
20220138197 | DATA STORAGE APPARATUS, TRANSLATION APPARATUS, AND DATABASE ACCESS METHOD - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for accessing a relational database using requests that conform to a non-structure query language syntax. In one aspect, a method includes receiving, from a client, a first access request that conforms to a NoSQL syntax for accessing a wide column store, wherein the first access request comprises a first event feature and a first attribute feature that are related to the wide column store, and the first attribute feature comprises a column family feature of the wide column store; translating the first access request into a second access request that conforms to a SQL syntax, wherein the second access request comprises a second event feature corresponding to the first event feature and a second attribute feature corresponding to the first attribute feature; and forwarding the second access request to a relational database. | 2022-05-05 |
20220138198 | CONFIGURABLE ENTITY MATCHING SYSTEM - Systems and methods are provided for receiving an input comprising one or more attributes, selecting a subset of query options from a list of query options relevant to the attributes of the input, and based on query optimization results from an audit of previous queries, determining a priority order to execute each query in the set of queries based on the query optimization results, and executing each query in the priority order to generate a candidate list. For each candidate in the list of candidates, systems and methods are provided for selecting a subset of available workflows based on relevance to the candidate and based on workflow optimization results, determining an order in which the selected subset of workflows is to be executed, and executing the selected subset of workflows in the determined order to generate a match score indicating the probability that the candidate matches the input. | 2022-05-05 |
20220138199 | AUTOMATED PROVISIONING FOR DATABASE PERFORMANCE - Embodiments utilize trained query performance machine learning (QP-ML) models to predict an optimal compute node cluster size for a given in-memory workload. The QP-ML models include models that predict query task runtimes at various compute node cardinalities, and models that predict network communication time between nodes of the cluster. Embodiments also utilize an analytical model to predict overlap between predicted task runtimes and predicted network communication times. Based on this data, an optimal cluster size is selected for the workload. Embodiments further utilize trained data capacity machine learning (DC-ML) models to predict a minimum number of compute nodes needed to run a workload. The DC-ML models include models that predict the size of the workload dataset in a target data encoding, models that predict the amount of memory needed to run the queries in the workload, and models that predict the memory needed to accommodate changes to the dataset. | 2022-05-05 |
20220138200 | QUERY PROCESSING USING A PREDICATE-OBJECT NAME CACHE - In some examples, a database system includes a memory to store a predicate-object name cache, where the predicate-object name cache contains predicates mapped to respective object names. The database system further includes at least one processor to receive a query containing a given predicate, identify, based on accessing the predicate-object name cache, one or more object names indicated by the predicate-object name cache as being relevant for the given predicate, retrieve one or more objects identified by the one or more object names from a remote data store, and process the query with respect to data records of the one or more objects retrieved from the remote data store. | 2022-05-05 |
20220138201 | CO-APPLICANT CANDIDATE IDENTIFICATION BY WAY OF EDGE GRAPHS - A system and a method are disclosed for identifying a co-applicant based on proximity to an applicant. In an embodiment, a processor determines a location of the applicant, and identifies a plurality of potential co-applicants that are collocated with the location of the applicant. For each respective potential co-applicant of the plurality of potential co-applicants, the processor determines whether a respective edge exists on a graph that connects the applicant with the respective potential co-applicant, and, responsive to determining that the respective edge exists, identifies the respective potential co-applicant as a candidate co-applicant. The processor generates for display, on a device of the applicant, a selectable option that, when selected, indicates that the applicant would like to use the candidate co-applicant as a co-applicant for an application. Responsive to detecting a selection of the selectable option, the processor activates the application at a device of the candidate co-applicant. | 2022-05-05 |
20220138202 | PRUNING CUTOFFS FOR DATABASE SYSTEMS - The subject technology receives, during a query compilation process, a query directed to a set of source tables, each source table from the set of source tables being organized into at least one micro-partition and the query including at least one pruning operation. The subject technology performs, during the query compilation process, a modification of the query for adjusting the at least one pruning operation, the modification being based at least in part on a set of statistics collected for previous pruning operations on at least a portion of the set of source tables and a set of heuristics. The subject technology compiles the query including the modification of the query. The subject technology provides the compiled query to an execution node of a database system for execution. | 2022-05-05 |
20220138203 | METHOD AND SYSTEM FOR SEARCHING A KEY-VALUE STORAGE - The present teaching relates to a method, system and programming for recovering a data storage. In response to a failure of the data storage, a last checkpointed version is retrieved from a checkpoint file created previously for the failure of the data storage. A recovery table is updated to indicate the last checkpointed version and an incarnation number indicating a number of previous recovery of the data storage. The data storage is recovered based on the recovery table. A version number of the last checkpointed version is reset to zero upon a successful recovery of the data storage. The incarnation number is incremented. | 2022-05-05 |
20220138204 | ACCELERATING CONSTRAINED, FLEXIBLE, AND OPTIMIZABLE RULE LOOK-UPS IN HARDWARE - Encoding of domain logic rules in an analog content addressable memory (aCAM) is disclosed. By encoding domain logic in an aCAM, rapid and flexible search capabilities are enabled, including the capability to search ranges of analog values, fuzzy match capabilities, and optimized parameter search capabilities. This is achieved with low latency by using only a small number of clock cycles at low power. A domain logic ruleset may be represented using various data structures such as decision trees, directed graphs, or the like. These representations can be converted to a table of values, where each table column can be directly mapped to a corresponding row of the aCAM. | 2022-05-05 |
20220138205 | METHOD, ELECTRONIC DEVICE, AND COMPUTER PROGRAM PRODUCT FOR DATA STREAM PROCESSING - Data stream processing is performed. For instance, a method includes: in response to a query request on an input data stream, determining data labels for input data items in the input data stream, the data labels at least indicating a first matching relationship between the input data items and a first query condition of the query request; determining an output data stream corresponding to the input data stream, the output data stream including output data items corresponding to the input data items, and each output data item having a data label; and determining query information corresponding to the query request based on the output data stream. In this way, it is possible to respond to real-time query requests for data streams. | 2022-05-05 |
20220138206 | SYSTEM FOR IMPLEMENTING AN OBJECT TAGGING FRAMEWORK - A method of implementing object tagging framework starts with the processor receiving a tag creation command including a tag name. In response to the tag creation command, the processor creates a current tag. The processor then receives an association command, the tag name and a target object identifier. The processor determines a target object associated with the target object identifier. The target object includes a tag value. The processor associates the current tag with the target object. The processor identifies a first child object of the target object. The target object and the first child object are hierarchical objects. In response to determining that the first child object is tag-unassociated, the processor associates the current tag with the first child object. In response to receiving a query including the tag name, the processor generates an output based on the tag name. Other embodiments are also described herein. | 2022-05-05 |
20220138207 | DATA CONNECTOR COMPONENT FOR IMPLEMENTING INTEGRITY CHECKING, ANOMALY DETECTION, AND FILE SYSTEM METADATA ANALYSIS - Techniques are provided for on-demand creation and/or utilization of containers and/or serverless threads for hosting data connector components. The data connector components can be used to perform integrity checking, anomaly detection, and file system metadata analysis associated with objects stored within an object store. The data connector components may be configured to execute machine learning functionality to perform operations and tasks. The data connector components can perform full scans or incremental scans. The data connector components may be stateless, and thus may be offlined, upgraded, onlined, and/or have tasks transferred between data connector components. Results of operations performed by the data connector components upon base objects may be stored within sibling objects. | 2022-05-05 |
20220138208 | RANKING OF DOCUMENTS BELONGING TO DIFFERENT DOMAINS BASED ON COMPARISON OF DESCRIPTORS THEREOF - A solution is proposed for ranking documents belonging to two different domains. A corresponding method comprises generating a descriptor for each of the documents; the descriptor comprises corresponding values and confidence indexes of multiple properties (of the corresponding document); the documents of a domain are ranked with respect to a document of another domain according to a comparison of their descriptors. A computer program product for performing the method are also proposed. Moreover, a computing system for implementing the method is proposed. | 2022-05-05 |
20220138209 | USER CLICK MODELLING IN SEARCH QUERIES - A method for ranking documents in search results includes defining a first training data set, the first training data set including, for each of a plurality of user queries, information respective of a document selected by a user from results responsive to the query and information respective of one or more documents within an observation window after the selected document in the results, and defining a second training data set, the second training data set including, for each of the plurality of user queries, information respective of the selected document. The method further includes training a first machine learning model with the first training data set, training a second machine learning model with the second training data set, and ranking documents of a further search result set according to the output of the first machine learning model and the output of the second machine learning model. | 2022-05-05 |
20220138210 | SYSTEMS AND METHODS FOR SELECTION OF A FIRST RECORD OBJECT FOR ASSOCIATION WITH SECOND RECORD OBJECTS BASED ON CONNECTION PROFILES - The present disclosure relates to selection of a first record object for association with second record objects based on connection profiles. Member entities of a second group entity that are associated with second record objects associated with processes may be identified. A second record object having a first object field-value pair identifying the second group entity may be identified. A first member entity having a respective connection score exceeding a threshold may be selected. A notification comprising an identification of the selected first member entity may be transmitted to an electronic account of a node profile. | 2022-05-05 |
20220138211 | APPROXIMATE TEMPLATE MATCHING FOR NATURAL LANGUAGE QUERIES - Systems and methods provide a media guidance application that recognizes a plurality of natural language search queries for identifying a set of search results. For example, a user may want to determine when the Yankees are playing their next baseball game. The user may structure their query in multiple ways, such as, “When are the Yankees playing?” “What time is the Yankees game?” “When is the next Yankees baseball game?” The user would expect the same result, a description of when the Yankees are playing, regardless of how the query is structured. The systems and methods enable a user to use a plurality of search queries when searching for items or information to get desired results. | 2022-05-05 |
20220138212 | BLOCKCHAIN IMPLEMENTING RELIABILITY DATABASE - An example operation may include one or more of receiving a request to modify a reliability value of an off-chain data source to generate a modified reliability value, determining whether a consensus on the modified reliability value has been received among a plurality of peer nodes, and in response to a determination that the consensus has been received, updating a storage to reflect the modified reliability value associated with the off-chain data source, and storing an identification of the modified reliability value within a block among a hash-linked chain of blocks on a distributed ledger shared among the plurality of peer nodes. | 2022-05-05 |
20220138213 | OBJECT IDENTIFICATION BASED ON LONG-TERM USER BEHAVIOR AND SHORT-TERM INTEREST - The described implementations are operable to determine potential objects of interest to a user based on a blend of the user's long-term behavior and short-term interests. Long term user behavior may be determined for the user over a period of time and represented as continuous data. Short-term interest may be determined based on objects with which the user has recently interacted, and attributes of those objects may be represented together as continuous data corresponding to the short-term user interest. The continuous data of the short-term user interest and long-term user behavior may be blended to produce a user embedding. The user embedding may then be compared with objects to determine objects that are of potential interest to the user. | 2022-05-05 |
20220138214 | SYSTEMS AND METHODS FOR PROVIDING ANALYTICS REGARDING A PLURALITY OF OBJECT PROCESSING SYSTEMS - An analytics system is disclosed for providing real time analytical data regarding operational characteristics of a plurality of object processing systems that process objects. The analytics system includes a communication system for accessing the warehouse management system and for obtaining object specific data, a data collection system for receiving real time data regarding processing at each of the plurality of object processing systems, each of the plurality of object processing systems including a programmable motion device that is programmed to process objects independent of other of the plurality of processing systems, an integration system for integrating the real time data with the object assignment data, and a graphic display system for displaying the real time data as associated with the assignment data. | 2022-05-05 |
20220138215 | SYSTEMS AND METHODS FOR LOW LATENCY AGGREGATED DATA PROVISION - Systems and methods for low latency materialized information provision are disclosed. For example, a system may include at least one memory storing instructions and one or more processors configured to execute the instructions to perform operations. The operations may include receiving, via a materialization service, data from multiple sources related to an item associated with a webpage hosted by a server. The data may include first event data sourced from a real-time feed and second event data sourced from stored data. Operations may include generating synchronized data based on the first and second event data. Operations may include receiving a request from the web server for information related to the item, the request being associated with a user segment. Operations may include identifying data to aggregate to fulfill the request, generating a data structure gathering synchronized data using the data structure, and forwarding the gathered synchronized data to the server. | 2022-05-05 |
20220138216 | EXTRACT-TRANSFORM-LOAD SCRIPT GENERATION - One embodiment provides a computer implemented method, including: receiving, from a user, a natural language query for data contained within at least one data repository; identifying at least one concept from the natural language query, wherein the at least one concept includes an entity and an intent; identifying a plurality of datasets satisfying the natural language query by querying the at least one data repository utilizing the at least one concept; ranking the dataset based on relevance to the query; generating an extract-transform-load script that extracts, transforms, and loads a dataset selected by the user from the plurality of datasets; and retrieving data included in the dataset utilizing the extract-transform-load script, wherein the retrieving includes returning the data to the user. | 2022-05-05 |
20220138217 | DATA PROCESSING METHOD, ELECTRONIC EQUIPMENT AND STORAGE MEDIUM - A data processing method, an electronic equipment, and a storage medium. The method includes: acquiring target data; performing a data segmentation on the target data by using a first micro-service to obtain a plurality of types of sub-data; using a plurality of second micro-services to process the plurality of types of sub-data to obtain a plurality of data processing results respectively corresponding to the plurality of second micro-services, in which each second micro-service corresponds to one type of sub-data; combining the plurality of data processing results to obtain a target data processing result. | 2022-05-05 |
20220138218 | GENERATING OVERLAP ESTIMATIONS BETWEEN HIGH-VOLUME DIGITAL DATA SETS BASED ON MULTIPLE SKETCH VECTOR SIMILARITY ESTIMATORS - The present disclosure relates to systems, methods, and non-transitory computer-readable media that estimate the overlap between sets of data samples. In particular, in one or more embodiments, the disclosed systems utilize a sketch-based sampling routine and a flexible, accurate estimator to determine the overlap (e.g., the intersection) between sets of data samples. For example, in some implementations, the disclosed systems generate a sketch vector—such as a one permutation hashing vector—for each set of data samples. The disclosed systems further compare the sketch vectors to determine an equal bin similarity estimator, a lesser bin similarity estimator, and a greater bin similarity estimator. The disclosed systems utilize one or more of the determined similarity estimators in generating an overlap estimation for the sets of data samples. | 2022-05-05 |
20220138219 | METHOD AND DATA SERVICE FOR CONVERTING AND OUTPUTTING ANIMAL RELATED DATA - A system and computerized method for monitoring and analyzing animal related data. In one embodiment, the system includes a processor and memory operable to identify a parameter related to animal management for species in a biological environment, aggregate animal related data from different sources about the parameter of the species, identify a baseline for the parameter, correlate the animal related data against the baseline to obtain correlated data, and analyze said correlated data to assess said animal management. | 2022-05-05 |
20220138220 | DEDICATED REPLICATION CHANNELS FOR REPLICATING RECORDS BETWEEN REGIONS - A server can receive a request to subscribe to a data tenancy in an extended region. The server can determine a size of stored data records associated with the data tenancy in a home region to be replicated in the extended region. Based in part on the size of the stored data records, the server can open a new communication channel dedicated to replicating the stored data records from the first server in the home region to the second server in the extended region. The server can pull the stored data records from the first server in the home region, store the pulled data records on the second sever in the extended region. The server can receive updated data records over an established communication channel between the first server in the home region and the second server in the extended region and store the updated data records on the second server. | 2022-05-05 |
20220138221 | SEARCH AND ANALYTICS FOR STORAGE SYSTEMS - Application-level data in a storage system are evaluated. For example, a backup analysis tool retrieves a backup object stored in the storage system. The backup analysis tool reconstructs an application object from the backup object. The backup analysis tool accesses the first application object according to a native application format associated with the first object. | 2022-05-05 |
20220138222 | METHOD FOR CONTROLLING A BLOCK SIZE IN BLOCKCHAIN NETWORK AND BLOCKCHAIN NETWORK USING THE METHOD - Provided is a block size adjustment method in a blockchain network including: (a) setting the block size to an initial value; (b) waiting for a transaction request, and processing a transaction to be requested; (c) if the processing of the requested transaction is successful, generating a block according to the block size, and increasing the block size to increase the number of transactions that can be processed at one time; and (d) if the processing of the requested transaction fails, reducing the block size without block generation to reduce the number of transactions that can be processed at one time. By repeatedly performing steps (b), (c) and (d) using the block size adjusted by whether or not a transaction is processed, the block size is flexibly adjusted and a block according to the adjusted block size is generated. Therefore, the throughput of the blockchain network can be significantly improved. | 2022-05-05 |
20220138223 | Providing Quality Of Service (QoS) For Replicating Datasets - Providing Quality of Service (QoS) for replicating datasets including: receiving, by a target data repository from a source data repository, a checkpoint describing one or more updates to one or more datasets stored in the source data repository and the target data repository; adding, by the target data repository, the checkpoint to a first queue for checkpoints directed to one or more volumes in the target data repository, wherein the first queue is included in a plurality of queues for the target data repository; selecting, by the target data repository, one or more queues from the plurality of queues; and servicing an operation from each of the selected one or more queues. | 2022-05-05 |
20220138224 | QUERY PLANS FOR ANALYTIC SQL CONSTRUCTS - Embodiments of the present disclosure relate to systems and methods for executing queries on a database platform. A processing device may execute a first operator in a query plan to process a set of data and generate an intermediate result of a query. the intermediate result of the first operator may be pushed, during execution of the query plan, to a plurality of secondary operators as the intermediate result is generated. Each of the plurality of secondary operators may be initiated to concurrently process the intermediate result to generate a plurality of second results, and a timing of processing of the intermediate result by one or more of the plurality of secondary operators is adjusted to coordinate the generation of the plurality of second results. The processor may execute the final operation on the plurality of second results to generate a final result. | 2022-05-05 |
20220138225 | FASTER VIEW CHANGE FOR BLOCKCHAIN - An example operation includes one or more of receiving view change messages which request a view change from a previous primary peer of a blockchain to the primary peer, identifying that a change to a state of the blockchain is in process with the previous primary peer based on metadata of the received view change messages, verifying that the change to the state of the blockchain corresponds to a latest change to the blockchain based on a received view data message, and transmitting a new view message to following peers which includes the in-process change to the state of the blockchain. | 2022-05-05 |
20220138226 | SYSTEM AND METHOD FOR SANDBOXING SUPPORT IN A MULTIDIMENSIONAL DATABASE ENVIRONMENT - In accordance with an embodiment, described herein is a system and method for providing sandboxing support in a multidimensional database environment. A plurality of sandboxes and a baseline data can be provided in a multidimensional database server, with each sandbox created for a particular “what-if” analysis, and configured to store one or more changes to the baseline data. When a request is received for a report on a particular “what-if” analysis from a client/user, the multidimensional database server can split the request into a first query and the second query, with the first query directed to a sandbox associated with the client/user, and the second query directed to the baseline data. The multidimensional database server can merge results from the first query and the second query, and perform aggregations and calculations on the merged data, before sending the merged data to a client. | 2022-05-05 |
20220138227 | Anomaly Detection for Cloud Applications - Requests are received for handling by a cloud computing environment which are then executed by the cloud computing environment. While each request is executing, performance metrics associated with the request are monitored. A vector is subsequently generated that encapsulates information associated with the request including the text within the request and the corresponding monitored performance metrics. Each request is then assigned (after it has been executed) to either a normal request cluster or an abnormal request cluster based on which cluster has a nearest mean relative to the corresponding vector. In addition, data can be provided that characterizes requests assigned to the abnormal request cluster. Related apparatus, systems, techniques and articles are also described. | 2022-05-05 |
20220138228 | MESSAGING RELATIONSHIP UNIQUE IDENTIFIER SYSTEMS AND METHODS - A computer system that includes a database for storing a plurality of records, and an electronic message processing server. Each of the records corresponds to a respective message received by the server. The processor is programmed to store a first record of a first message in the database, the first record including a first message relationship unique identifier (MUI) as a tag. The first MUI corresponds to a first message family. The processor is also programmed to receive a second message, and execute a matching process. The processor is further programmed to store a second record of the second message, including, in response to a match of the second message to the first record, including the first MUI as a tag, and in response to the result indicating no match, generating a second MUI for the second message and including the second MUI as the tag on the second record. | 2022-05-05 |
20220138229 | TECHNOLOGIES FOR UNSUPERVISED DATA CLASSIFICATION WITH TOPOLOGICAL METHODS - Technologies for unsupervised data classification include a computing device that generates a high dimensional profile for each column of a data store that is indicative of topological features of the column. The computing device also analyzes each column using multiple predetermined profiling rules and generates an initial classification for the columns based on profiling rule results. The initial classification may be applied to related columns based on clustering of the columns using the high dimensional profile. The computing device may train a machine learning model based on the initial classification and the high dimensional profile. Input features for training may include the profiling rule results and the high dimensional profile. Classifications may be provided to client devices via a predetermined interface. Other embodiments are described and claimed. | 2022-05-05 |
20220138230 | SYSTEM AND METHOD FOR OPERATING A DIGITAL STORAGE SYSTEM - A system and method for managing a storage system may include generating, for a data block, a set of tags and a unique name. A set of tags may represent a context. A service related to the data block may be provided in response to receiving at least one of: a tag, a set of tags and a unique name. | 2022-05-05 |
20220138231 | MANAGEMENT AND OPTIMIZATION OF SEARCH TERM CLUSTERING - A system and method to generate and manage clusters of search terms. The system and method collect a set of search terms associated with multiple search queries relating to an entity. A neural network identifies a set of embedding vectors, wherein each of the set of embedding vectors represents a search term of the set of search terms. A cluster is generated including a portion of the set of search terms based on a comparison of embedding vectors associated with the portion of the set of search terms. A size of the cluster is compared to a cluster size threshold level to determine if a first condition is satisfied. In response to determining satisfaction of the first condition, the cluster is identified as a valid-sized cluster. A user interface is generated to display information related to the cluster and one or more cluster metrics. | 2022-05-05 |
20220138232 | VISUALIZATION METHOD, VISUALIZATION DEVICE AND COMPUTER-READABLE STORAGE MEDIUM - A visualization device visualizes plural clustering results. The clustering result ordering unit orders plural clustering results based on quality criteria. Each of the clustering results includes covariate clusters. The hierarchical arrangement unit creates hierarchical tree structure including the covariate clusters as nodes. The created hierarchical structure is displayed. | 2022-05-05 |
20220138233 | System and Method for Partial Name Matching Against Noisy Entities Using Discovered Relationships - A method, system and computer-usable medium are disclosed to identify a set of entity names based on a partial name of the entity utilizing discovered relationships. A partial name from a user is received as to the entity in order to retrieve a plurality of names of the entity in a corpus which can be a body or works, document, etc. References to the entries containing the partial name are retrieved from the corpus. A natural language processing is applied to content associated with references to identify candidate entities. A similarity is performed as to the identified candidate entities to form a similarity assessment, and from the candidate entities a selection is made based on a merging criteria. | 2022-05-05 |