Abstract: A computer-implemented method to estimate an execution time for large query batches. The method includes identifying a batch of queries, where the batch of queries where each query is configured to retrieve data from a database. Selecting a first query and generating an access path for the first query including one or more mini plans. Building a learning model for the one or more mini plans. Estimating an estimated execution time for each of the one or more mini plans. Adding each of the estimated execution times for each of the one or more mini plans to determine a first total estimated time for the first query. Displaying the first total estimated time.

Abstract: A method and apparatus for creating a system disk snapshot of a virtual machine comprises: receiving an instruction for creating a snapshot of a virtual machine; determining existence of a power-on state; renaming a top file in a system disk in response to the received instruction if the power-on state exists; creating a new top file in response to renaming the top file, directing dependency of the new top file to the renamed top file and opening the new top file; determining whether a preceding snapshot is created successfully; using the renamed top file as a first snapshot file if the preceding snapshot is successful; and uploading the first snapshot file to a file management server. Accordingly, when a system disk snapshot is created in a power-on state, the snapshot may be created without stopping the virtual machine, thereby reducing requirements for data back up, storage space, and network bandwidth.

Abstract: Methods, systems, and media for presenting recommended content based on social cues are provided. In accordance with some embodiments, a method for presenting recommended content is provided comprising: receiving a query associated with a user; generating a list of relevant media content items based on the query; selecting items for presentation to the user based on social relevance scores based on social connections of the user that have consumed a relevant item and contextual relevance scores for each item; causing the selected items to be presented to the user; and indicating that a particular item was consumed by a particular social connection.

Abstract: A portable electronic device is disclosed comprising data processing means and a data repository containing: data records representative of locations relevant to or within a digital map; and data representative of an index associating words contained in the data records with the records in which those words appear. The device further comprises means for, in relation to a received search query including a search string, processing the search string to provide one or more search words; querying the index to identify data records containing the or each search word; and generating a rank for each of the one or more identified data records indicative of the relevance of each identified data record to the search query.

Abstract: Techniques for ordering predicates in column partitioned databases for query optimization. Predicates on a single CP table within a query are organized to predicate-CP nodes with various sets of column partitions. The predicates within each predicate-CP node and the predicate-CP nodes as a whole are ordered in ascending order of cost which is determined by CPU/IO cost and predicate selectivity. The reorganized query is then executed.

Abstract: Disclosed embodiments include apparatuses, methods and storage media associated with modifying a food record database. The method comprises receiving a plurality of food records from a plurality of sources, each of the plurality of food records comprising at least a food record description, the plurality of sources including (i) at least one non-user entity that is an owner of a third party food database and (ii) users of the food record database. The method further comprises receiving search requests from users, and returning one or more top search results from the food record database in response. The method also comprises determining a score for a particular food record identified by the top search results, wherein the score is calculated based at least in part on one of: a number of times the particular food record has been included in the top search results of the search requests or a number of times the particular food record has been logged.

Abstract: Heartbeat consensus forming for the state of a digital ledger built upon a blockchain to provide users with the ability to securely, accurately, and verifiably share state information between distrustful parties is provided herein. The digital ledger is hosted in a networked environment, accessible by multiple parties. Heartbeat transactions allow clients, who are not in direct communication with one another and may distrust one another, to verify the integrity of the digital ledger via consensus. The consensus is readily verifiable by each client on its own machine and allows the ledger to be recovered to an agreed-to state in the event of a fault initiated by a client or the host of the ledger, whether malicious or otherwise. The digital ledger is freely movable to different hosts in the event of a fault.

Abstract: In a system for efficiently organizing, storing, accessing, and analyzing project data and for visualizing project progress, for a specified project, a reference fractal-based structure is selected based on, at least in part, the type of the specified project and/or a mapping between project types and reference fractal-based structures. The project files are organized and stored in a file structure that corresponds to the selected reference fractal-based structure, so that the file structure can be transmogrified displayed as a viewable fractal-based structure, that can indicate process of different tasks and subtasks of the project based on, in part, the status of the tasks and subtasks that is derived from the project files.

Abstract: A system including one or more processors and one or more non-transitory computer-readable media storing computing instructions configured to run on the one or more processors and perform receiving from an item catalog database a respective item description and respective attribute values for each item of a set of items; generating text embeddings using a text embedding model to represent the respective item description and the respective attribute values; generating a graph of the set of items from the item catalog database connected by a set of edges; training the text embedding model and a machine learning model using a neural loss function based on the graph; and automatically determining, based on the machine learning model, as trained, a gender label for each first item in which the gender classification is unlabeled and in which a respective quantity of respective attribute values for the each first item is at least a predetermined threshold. Other embodiments are disclosed.

Abstract: Generating granular clusters for real-time processing is provided. The systems can identify tokens based on aggregating input from computing devices over a time interval. The systems can identify, based on metrics, a subset of tokens for cluster generation. The systems can generate, via a clustering technique, token clusters from the subset of the tokens, each of the token clusters comprising two or more tokens from the subset of the tokens. The systems can apply a de-duplication technique to each of the token clusters. The systems can apply a filtering technique to the token clusters to remove tokens erroneously grouped in a token cluster. The systems can assign, based on a selection process, a label for each of the token clusters. The systems can activate, based on a number of remaining tokens in each of the token clusters, a subset of the token clusters for real-time content selection.

Abstract: An inline tree data structure and one or more auxiliary data structure encode a multitude of data records of a dataset; data fields of the dataset define a tree hierarchy. The inline tree comprises one binary string for each data record that are all the same length, are arranged in an ordered sequence that corresponds to the tree hierarchy, and include an indicator string indicating position in the tree hierarchy of each data record relative to an immediately adjacent data record. A search program is guided through the dataset by interrogating each indicator string in the inline tree data structure so as to reduce unnecessary interrogation of data field values.

Abstract: Crowdsourced solutions are provided that can prevent and/or reduce dissemination of selected digital content in a social media platform. In one embodiment, a system can include at least one memory device having computer-executable components stored therein, and at least one processor configured to execute the computer-executable components. Such computer-executable components can include a selection component that identifies multiple reviewer accounts using a selection criterion corresponding to a user account in the social media platform. The multiple reviewer accounts can evaluate presence of particular digital content in the social media platform directed to the user account. The computer-executable components also can include a routing component that can provide portions of digital content directed to the user account to respective reviewer accounts.

Abstract: Operational historian system retrieving summary data values and source data values based on alignment between a summarization cycle duration and a query cycle duration. A retrieval service process executing on a historian device utilizes a summarization cycle duration, including start and/or end times thereof, and a query cycle duration, including start and/or end times thereof, to determine whether to retrieve, via a communications network, source tag data and/or summary tag data from memory storage devices.

Abstract: Provided is a method, apparatus, device and storage medium for determining a center vertex in a social network. The method includes steps described below. Multiple first vertices with a target attribute in the social network are determined; multiple sub-social sets are determined, where each sub-social set comprises one first vertex; a connected branch set corresponding to the each sub-social set is determined, where the connected branch set corresponding to the each sub-social set is a set of connected branches in a graph formed by vertices associated with the each sub-social set and lacking the target attribute; centrality of the first vertex comprised in the each sub-social set is obtained according to the each sub-social set and the connected branch set corresponding to the each sub-social set; and a first vertex with centrality satisfying a preset centrality requirement from the multiple first vertices is selected as the center vertex.

Abstract: A memory system may include a plurality of dies; and a controller coupled to the plurality of dies through a plurality of data paths, the controller being suitable for transmitting first data received from a host and second data obtained through an internal operation in parallel through the plurality of data paths.

Abstract: Techniques for determining replication modes may include: issuing, while unsolicited data transfer mode is enabled for a first link, first write operations over the first link; issuing, while unsolicited data transfer mode is disabled for the first link, second write operations over the first link; determining a first performance metric for the first link in accordance with the first write operations; determining a second performance metric for the first link in accordance with the second write operations; and determining, in accordance with the first and second performance metrics whether to enable or disable unsolicited data transfer mode for the first link for a first time period. The first and second performance metrics may be response times. Unsolicited data transfer mode, when enabled, allows write data payload to be sent to a target without receiving an acknowledgement regarding receipt of a write command block for the write operation from the target.

Abstract: Methods, systems, and computer program products for generating an executable code based on a document are disclosed. Rules are identified in a document, the identified rules are translated into encoded rules, and an executable code is generated from the encoded rules. Identification of rules includes splitting a text of the document into a plurality of sentences; and for each sentence of the plurality of sentences, determining whether the sentence corresponds to a rule. Translation of an identified rule into an encoded rule includes extracting, from the identified rule, elements corresponding to predefined categories; determining one or more relationships between the extracted elements; and translating the one or more determined relationships into a structured expression. Generating the executable code from the encoded rules includes translating the structured expression associated with the identified rule into a programming language query.

Abstract: In a multitenant data platform architecture, one or more supporting data tables are used to write and store tenant data responsive to data write requests. Based on the contextual data returning an indication of a data corruption in one or more supporting data structures, an action associated with the data transaction thread is performed. A log of data corruptions and corresponding call stack trace data may be generated. The data transaction thread may be allowed to continue to execute statements that modify data tables, or the data transaction thread may be terminated. Data corruptions may be compensated for by nullifying data changes caused by corruption causing call sites. Verification methods may be used to ensure correctness of data within a transaction thread.

Abstract: In various embodiments, a natural language (NL) application receives a first incomplete natural language (NL) request, and generates one or more request completion recommendations based on at least the first incomplete NL request and a first recommendation model, where the first recommendation model is generated via a machine learning algorithm applied to a first data dependency model and a first request completion model. The NL application receives a selection of a first request completion recommendation included in the one or more request completion recommendations, generates a complete request based on the first incomplete NL request and the first request completion recommendation, and causes the complete request to be applied to the data storage system.

Abstract: A method can include, in response to receiving sharing input from a local user into a local computing device, sending a file from the local computing device to a recipient, in response to sending the file, storing a sharing record on the local computing device, the sharing record identifying the file and the recipient, in response to receiving modification input from the local user into the local computing device to modify the file, determining that the sharing record identifies the file and the recipient, and based on determining that the sharing record identifies the file and the recipient, initiating sending at least a portion of the file to the recipient.