Abstract: There is provided an operation of a 2-wire interface including: performing, by a master device, at least one transaction with a slave device to compare a calculated expected value and a return value of a register to confirm whether an out-of-sync occurs, and resetting a state machine of the slave device to a reset_done state and receiving, by the maser device, an acknowledge byte from the slave device to recover a synchronization between the master device and the slave device when the out-of-sync occurs.

Abstract: Methods and apparatus for processing signals captured by one or more sensors are disclosed. An example method includes receiving a first signal from a control circuit, the first signal including control data associated with the one or more sensors, recovering a fixed frequency clock signal and a control signal from the first signal, generating a spread spectrum clock signal based on the fixed frequency clock signal, receiving a sensor data signal based at least in part on data captured by the one or more sensors, the spread spectrum clock signal, and the control signal, retiming the sensor data signal based at least in part on the spread spectrum clock signal and the fixed frequency clock signal, and generating an output signal based on the retimed sensor data signal.

Abstract: A method for providing a high-speed data communication between a host and field-programmable gate array (“FPGA”) is disclosed. The method, in one embodiment, is capable of identifying a data rate on a bus containing a P-channel and an N-channel operable to transmit signals in accordance with a high-speed Universal Serial Bus (“USB”) protocol. Upon sampling, by a first input deserializer, first two samples of data signals carried by the P-channel in accordance with a first clock signals clocking twice as fast as the data rate of the P-channel, a second input deserializer is used to sample the second two samples of data signals transmitted by the N-channel in accordance with a second clock signal running twice as fast as the data rate of the N-channel with a ninety (90) degree phase shift. The method subsequently forwards the data signals to one or more configurable logic blocks (“LBs”) in FPGA.

Abstract: This application provides a data switching apparatus and a data switching method. The data switching apparatus includes a plurality of dies, the plurality of dies include a plurality of die sets. Each die in the plurality of die sets is coupled to a die in a same die set and a die in a different die set through corresponding interfaces.

Abstract: A representative reconfigurable processing circuit and a reconfigurable arithmetic circuit are disclosed, each of which may include input reordering queues; a multiplier shifter and combiner network coupled to the input reordering queues; an accumulator circuit; and a control logic circuit, along with a processor and various interconnection networks. A representative reconfigurable arithmetic circuit has a plurality of operating modes, such as floating point and integer arithmetic modes, logical manipulation modes, Boolean logic, shift, rotate, conditional operations, and format conversion, and is configurable for a wide variety of multiplication modes. Dedicated routing connecting multiplier adder trees allows multiple reconfigurable arithmetic circuits to be reconfigurably combined, in pair or quad configurations, for larger adders, complex multiplies and general sum of products use, for example.

Abstract: Data storage management is carried out by an Internet of Things platform having access to operational and long-term databases carrying tables for storing device-related data emitted from connected devices. Device-related data is received and stored in operational database table entries. Tables are associated with devices. Table entries are associated with entry dates. A table in the operational database is monitored to obtain load statistics. Data from the operational database is offloaded by replication to the long-term database. Queries against operational database tables are tracked to obtain query statistics. Cleanup rules determining timeframes within which data stored in operational database table entries are to be deleted are set up, based on a date of data entry. Cleanup rules currently set up are carried out as a retention run, based on the load statistics and/or query statistics.

Abstract: Systems and methods are disclosed for processing data associated with isolated execution environments. A chunk of data associated with an isolated execution environment can include log data and non-log data. At least a portion of the log data can include log data generated by the isolated execution environment. The system can parse the chunk of data to identify the log data and the non-log data and extract at least a portion of the log data from the chunk of data. The extracted data can be further processed to generate one or more events.

Abstract: A client machine writes to and reads from a virtual disk on a remote storage platform. Metadata is generated and stored in replicas on different metadata nodes of the storage platform. A modified log-structured merge tree is used to store and compact string-sorted tables of metadata. During file storage and compaction, a consistent file identification scheme is used across all metadata nodes. A fingerprint file is calculated for each SST (metadata) file on disk that includes hash values corresponding to regions of the SST file. To synchronize, the fingerprint files of two SST files are compared, and if any hash values are missing from a fingerprint file, then the key-value-timestamp triples corresponding to these missing hash values are sent to the SST file that is missing them. The SST file is compacted with the missing triples to create a new version of the SST file. The synchronization is bi-directional.

Abstract: A model management system provides a centralized repository for storing and accessing models. The model management system receives an input to store a model object in a first model state generated based on a first set of known variables. The model management system generates a first file including a first set of functions defining the first model state and associates the first file with a model key identifying the model object. The model management system receives an input to store the model object in a second model state having been generated based on the first model state and a second set of known variables. The model management system generates a second file including a second set of functions defining the second model state and associates the second file with the model key. The model management system identifies available versions of the model object based on the model key.

Abstract: A user interface may include one or more visualizations based on queries to a database using query model metadata. Updated metadata of columns of the database may be obtained which may be different from the query model metadata. A set of used columns and a set of unused columns may be determined based on the query model. One or more metadata mismatches may be determined based on a comparison of the query model metadata for the set of used columns and the updated metadata for the set of used columns. The one or more metadata mismatches may be presented in a user interface configured to enable a user to rectify each. One or more selections from the user may be obtained to rectify at least one of the one or more metadata mismatches. The corresponding columns may be deleted or replaced based on the one or more selections.

Abstract: Disclosed embodiments provide techniques for estimating imputation algorithm performance. Multiple imputer algorithms are selected, and an evaluation of how well each of the imputer algorithms can estimate the missing data is performed. Disclosed embodiments obtain an imputer candidate dataset (ICD). The imputer candidate dataset is compared to the incomplete data range, and a similarity metric is determined between the data range and the ICD. When the similarity metric exceeds a predetermined threshold, an imputer evaluation dataset (IED) is created from the ICD by removing one or more data points from the ICD. Each imputer algorithm is evaluated by applying the IED to it, and computing an imputer evaluation metric based on its performance. The multiple imputer algorithms are ranked based on the imputer evaluation metric. The best ranked imputer algorithm can then be selected for use on the incomplete data range within the measurement dataset.

Abstract: System and method for data cleaning and/or transformation according to certain embodiments. For example, a method includes: receiving a raw source dataset including one or more data types; matching the raw source dataset to a target schema corresponding to a domain, the target schema including one or more standardized variables; and transforming the one or more data types in the raw source dataset to the one or more standardized variables.

Abstract: The present disclosure relates to a method of metadata enrichment using an enrichment comprising multiple steps. The method comprises: determining for an input data asset a metadata value descriptive of the input data asset. Characteristics of the metadata value of the input data asset may be determined. At least one informativeness score of the metadata value of the input data asset may be computed using the determined characteristics. An execution of the enrichment step may be skipped in case an input characteristic of the enrichment step is not part of the determined characteristics. In case the input characteristic of the enrichment step is part of the determined characteristics, the enrichment step may be adapted and executed or the enrichment step may be executed without adaptation. Labels resulting from the executed enrichment steps may be combined for providing one or more labels of the data asset.

Abstract: Methods and systems are configured to determine a semantic meaning for data and generate data processing rules based on the semantic meaning of the data. The semantic meaning includes syntactical or contextual meaning for the data that is determined, for example, by profiling, by the data processing system, values stored in a field included in data records of one or more datasets; applying, by the data processing system, one or more classifiers to the profiled values; identifying, based on applying the one or more classifiers, one or more attributes indicative of a logical or syntactical characteristic for the values of the field, with each of the one or more attributes having a respective confidence level that is based on an output of each of the one or more classifiers. The attributes are associated with the fields and are used for generating data processing rules and processing the data.

Abstract: A system includes an interface, a processor, and a memory. The interface is configured to receive a version of a model from a model registry. The processor is configured to store the version of the model, start a process running the version of the model, and update a proxy with version information associated with the version of the model, wherein the updated proxy indicates to redirect an indication to invoke the version of the model to the process. The memory is coupled to the processor and configured to provide the processor with instructions.

Abstract: A method for writing data sets (DS) into a relational database (13), wherein each data set (DS) comprises at least two attributes (A), includes the steps of: determining at least one value for at least one of the attributes (A1) as criterion for filtering the data sets (DS) by the attribute value; computer implemented outputting data sets (DS) filtered by the attribute value in an output view (AS) and providing an input field (EF) in the output view (AS) for entering a value for another one of the attributes (A4); in response to entering a value in the input field (EF) of the output view (AS) computer implemented generating a complete data set (DS4) including the value set as filter criterion for the corresponding attribute (A1) and the entered value for the other attribute (A4); and storing the generated dataset (DS4) in the relational database (13).

Abstract: The systems and methods described here can reduce the storage space required (memory and/or disk) to store certain types of data, provide efficient (fast) creation, modification and retrieval of such data, and support such data within the framework of a multi-version database. In some embodiments, the systems and methods can store each field of a set of records as a vector of values, e.g., a data vector. A set of records can be represented using a vector hash vector, or “vhash” vector, wherein each element of the vhash vector contains a unique identifier of a data vector, based on a cryptographic hash of the data vector. A header table can store associations between labels and “vhash” vectors that pertain to those labels. Identical data vectors can be re-used between different record sets or vhash vectors needing that vector, thus saving space.

Abstract: Provided is a system for analyzing features associated with entities using an embedding tree, the system including at least one processor programmed or configured to receive a dataset associated with a plurality of entities, wherein the dataset comprises a plurality of data instances for a plurality of entities. The processor may be programmed or configured to generate at least two embeddings based on the dataset and determine split criteria for partitioning an embedding space of at least one embedding tree associated with the dataset based on feature data associated with an entity and embedding data associated with the at least two embeddings. The processor may be programmed or configured to generate at least one embedding tree having a plurality of nodes based on the split criteria. Methods and computer program products are also provided.

Abstract: Various embodiments of the teachings herein include a graph transformation method of a function block chain. The method may include: extracting a plurality of function block pairs from a function block chain, wherein the function block chain comprises a plurality of function blocks connected in sequence; respectively transforming the function block pairs into nodes; transforming the nodes into directed acyclic graphs or undirected acyclic graphs; and building a graph of the function block chain based on the directed acyclic graphs/undirected acyclic graphs and a weight served by the count.

Abstract: Methods, apparatus, and processor-readable storage media for managing transaction consistency in distributed databases are provided herein. An example computer-implemented method includes determining a first one of a plurality of consistency levels to be applied for a transaction in a distributed database comprising a set of database nodes; and in response to determining that the first one of the plurality of consistency levels is to be applied: configuring at least two connections with the distributed database; releasing a first one of the at least two connections in response to detecting that the transaction completed on a first node in the set of database nodes; and in response to one or more of the other database nodes in the set of database nodes being updated to reflect changes on the first database node resulting from the transaction, releasing at least a second one of the at least two connections.

Abstract: In some implementations, a user device may transmit, to a first data source, a first message encoding a first query and may receive a first response to the first query from the first data source. The user device may transmit, to a second data source, a second message encoding a second query that duplicates the first query and may receive a second response to the second query from the second data source. The user device may transmit a first reverse query to the first data source based on the second response and/or a second reverse query to the second data source based on the first response. The user device may receive at least one reverse query response. Accordingly, the user device may determine whether an answer to the first query is valid, based on the first response, the second response, and the at least one reverse query response.

Abstract: Disclosed herein are an apparatus and method for retrieving on-chain data based on an index. The apparatus includes memory in which at least one program is recorded and a processor for executing the program. The program may include a blockchain connection manager for recording data in at least one node or retrieving data from at least one node and outputting the same by being connected to a blockchain network formed of multiple nodes, a blockchain index manager for creating and managing an index for data stored in at least one node, and a query engine for requesting storage of data resulting from a transaction in a corresponding node through the blockchain connection manager, creating an index on the stored data by interworking with the blockchain index manager, and acquiring and outputting data that is retrieved based on the index through the blockchain connection manger in response to a retrieval request.

Abstract: The present disclosure provides a data interaction method and apparatus and an electronic device. The method is applied to a cloud service end. A specific implementation of the method comprises: establishing a long-connection communication channel with a local service end, the local service end comprising a target transaction system to be integrated; receiving first target data sent by the local service end through the long-connection communication channel, the first target data being obtained based on updated first transaction data of the target transaction system; performing data update using the first target data. In the implementation, the target transaction system included by the local service end needn't to be exposed to an external network, thereby improving the security of data interaction, reducing the number of times of establishing the communication connection between the local service end and the cloud service end, and improving the efficiency of data interaction.

Abstract: In a data processing method, storage instance mapping information is obtained based on database configuration information of a blockchain node. The storage instance mapping information indicates data mapping relationships between a plurality of database instances and data types of the plurality of database instances. At least one candidate database instance is determined from the plurality of database instances when to-be-stored blockchain data is received. The data type of each of the at least one candidate database instances is matched with a data type of the blockchain data. The blockchain data is stored to a first database instance of the at least one candidate database instance based on a data sharding strategy in the database configuration information.

Abstract: Solutions for identifying and optimizing batch processes are provided herein. A task monitor identifies a plurality of processes in an event log. The processes identified by the task monitor are used by a batch processing engine to identify batches from the processes. The batch processing engine compares each of the identified batches to a set of policies or with other identified batches. The batch processing engine provides a recommendation to user to optimize a particular batch, for example, based on the comparing. Identifying batches and providing recommendations to optimize the batches enables processes associated with the batches to be optimized upon implementation of the recommendation.

Abstract: A schema-free static query template improves schema-free graph query performance and runtime stability. A user can customize a generated graph query while detecting a query tampering state. Schema-free query templates, which have been compile-time type/syntax/semantic checked by a dummy schema, are installed. The templates are called as if they are functions with their selected graph schema vertex types and edge types. The invocation generates a static query which uses input metadata to instantiate a static query, and goes through type/syntax/semantic checks to capture any input errors at compile time. If there is no error found during compile time, a query binary is generated only containing the metadata related to the parameters and sent to a query engine for execution. If a user later invokes the same query with the same metadata, the compiler matches the generated previous query, bypasses compilation, and goes directly to the existing binary code.

Abstract: A system displays a tree of class icons in a model region. While displaying the tree, the system detects a first portion of an input to place a candidate class icon in the model region. In response, the system (i) identifies a neighboring class icon, in the tree of class icons, that is nearest to the candidate class icon, where the neighboring class icon is circumscribed by a revealer region, and (ii) when the location of the candidate class icon is outside the revealer region, displaying a tentative connector, between the candidate class icon and the neighboring class icon. The system detects a second portion of the user input. In response to the detection, the system presents options for user selection of JOIN fields, including displaying a first data field selection list for the candidate class icon and a second data field selection list for the neighboring class icon.

Abstract: Solutions for enforcing both syntactic and semantic correctness of domain-specific data queries include: receiving a data query; constraining an operation of the data query to enforce semantic correctness, wherein enforcing semantic correctness comprises: determining semantic information associated with each of a plurality of data entities; based on at least the semantic information, determining whether combining the two data entities of the plurality of data entities is allowed or is not allowed; based on at least determining that combining the two data entities is allowed, permitting combining the two data entities in the data query; and based on at least determining that combining the two data entities is not allowed, preventing combining the two data entities in the data query; and executing the data query. Some examples further include basing the permission on (at least) an ontology between the semantic information of the two data entities and a set of axioms.

Abstract: Representations of sets of descriptors of reference objects are stored in a repository, with individual descriptors including information about entities identified in the reference objects. In response to a request to extract content from a particular data object, a reference object which satisfies a similarity criterion with respect to the particular data object is identified from the repository using the descriptors. A structural comparison of the particular data object and the reference object is performed to determine an entity related to another entity identified in the particular data object.

Abstract: Aspects of the disclosure relate to transliteration of machine interpretable languages. A computing platform may generate a plurality of query keys, configured for use in translating queries from a first format to a second format, which may include, for each input query corresponding to the plurality of query keys: selecting, based on features of the input query, a compaction method, and applying the selected compaction method to the input query to produce a corresponding query key. The computing platform may store the plurality of query keys in a lookup table. The computing platform may receive a first query, corresponding to the input queries, formatted in the first format. The computing platform may translate, by identifying a query key corresponding to the first query in the lookup table, the first query to produce a second query, formatted in the second format. The computing platform may execute the second query.

Abstract: Methods and systems described herein may improve search results for items newly added to a database by using machine learning to map historical items in the database to the newly added items. For example, non-conventional methods and systems described herein may use machine learning generated embeddings (e.g., vector representations of items) to determine the extent to which two items are similar to each other. The computing system may assign engagement data associated with a first item to a second item that lacks engagement data. By doing so, the computing system may enable improved search results because the position of items that lack engagement data (e.g., newly added items) may be adjusted based on engagement data associated with similar items.

Abstract: The present disclosure involves systems, software, and computer implemented methods for processing correlated calculated fields in correlated subqueries. One example method includes receiving a request to process a database query that includes at least one subquery and processing each subquery. A determination is made as to whether each subquery includes a correlated calculated field that is a calculated field that is not included in a first datasource queried by the subquery but is included in a second datasource queried by an outer query that includes the subquery. If the subquery does not include a correlated calculated field, the subquery is processed without modification. If the subquery includes a correlated calculated field, metadata is retrieved for the outer query of the subquery that queries the second datasource and includes the correlated calculated field. The subquery is rewritten using the metadata and the rewritten subquery is processed.

Abstract: The techniques disclosed herein enhance the efficiency and functionality of directory systems. This is accomplished by augmenting a primary table with an extended table for storing properties of an associated entity (e.g., a user, a company). A table serves to organize directory data and comprises rows and columns. Each row of the primary table stores an entity with each column storing an associated property. In contrast, the primary table is configured with an extended table in which each row of the extended table stores a property for an associated entity while each column stores additional information for the property such as timestamps and metadata. Storing specific properties in the extended table eliminates empty spaces in the primary table thereby reducing the volume of stored data. Moreover, by including additional data for properties, the extended table enables property-specific features such as search, synchronization, extensibility, and lifecycle management.

Abstract: In some examples, a system receives an input graph representation of one or more query plans for one or more database queries, and generates, by an embedding machine learning model based on the input graph representation, a feature vector that provides a distributed representation of the one or more query plans. The system determines, using the feature vector, one or more user behaviors and/or workload characteristics of one or more workloads in one or more database systems.

Abstract: The invention relates to a method and an apparatus for executing Structural Query Language (SQL) instructions in a Solid-state Storage Device (SSD). The apparatus includes: a processing unit; and a database accelerator. The processing unit is arranged operably to obtain an SQL query from a host side. The database accelerator is arranged operably to parse the SQL query according an SQL syntax tree to generate a series of table tasks to execute; and during the execution of the table tasks, read tables from a flash module through the processing unit, generate intermediate tables and sub-tables based on the read tables, and perform an arithmetic computation, a logical computation or both on a specific field in one intermediate table to generate a final dataset. The processing unit is arranged operably to reply to the host side with the final dataset.

Abstract: Disclosed are a method, apparatus, electronic device, and storage medium. The method includes: determining a target undirected weighted graph corresponding to a target area from a start point to a target point, which includes a plurality of nodes, edges connected between the nodes, and cost weights respectively corresponding to the edges; performing a forward search from a start node corresponding to the start point and a reverse search from a target node corresponding to the target point based on the cost weights respectively corresponding to the edges of each node, to determine an initial encounter node for the forward and reverse searches; and determining a target shortest path from the start point to the target point based on the initial encounter node. Thus, exponential growth of expansion nodes in a middle part can be avoided, reducing spatiotemporal complexity of the search and improving efficiency of determining a shortest path.

Abstract: The disclosed technology is generally directed to graph queries with reduced latencies. In one example of the technology, there is a cross-tenancy collaboration between two different tenancies: a first tenancy that is homed in a first geographical region and a second tenancy that is homed in a second geographical region. In the first geographical region, a first set of graph data is stored. The first set of the graph data is associated with the first tenancy. A portion of the first set of the graph data to be copied from the first geographical region to the second geographical region is determined. In response to determining the portion of the first set of the graph data, a copy of the portion of the first set of the graph data is stored in the second geographical region.

Abstract: An example system includes a processor to receive a value formatted using a composite subtraction format. The processor can determine an interval of a number of intervals that corresponds to the received value using minuend rank. The processor can then calculate rank of the value based on the position of the value within the determined interval.

Abstract: Relation network data query includes receiving a query request for an edge using a first node as a starting node, where the edge satisfies a specified filter condition comprising that the edge has a first edge data item and a corresponding first data value. Multiple index blocks associated with the first node are obtained from a non-volatile storage storing a relation network. A first index block corresponding to the first edge data item is determined from the multiple index blocks based on a correspondence between an index block and an edge data item, where the first index block comprises multiple data values of the first edge data item and location information of edges having the multiple data values and using the first node as starting nodes. Location information of an edge having the corresponding first data value is determined from the first index block and the edge obtained.

Abstract: A query may be determined based on data retrieval parameter values. The data retrieval parameter values may include a data type parameter identifying a designated data type of a plurality of data types corresponding with database observability data generated during operation of a database system. The of data retrieval parameter values may also include a designated time period during which to retrieve data associated with the designated data type. A query may be determined based on the plurality of data retrieval parameter values via a collection manager in a database application layer associated with the database system. The query may be executed to retrieve a designated dataset of database observability data corresponding with the designated data type and generated by the database system during the designated time period.

Abstract: Embodiments of the system in include a method of clustering data sets based on the data set characteristics. A data repository stores a plurality of heterogeneous data sets. For a selected group of data sets (i) obtaining metadata; (ii) identifying upstream data sets; and (iii) extracting semantic features. The method further comprises clustering the plurality of data sets into one or more clusters based on similarity, wherein the similarity is determined based on a combination of the metadata, the upstream data sets, and the semantic features of the selected data sets. In one embodiment, the data sets are ranked within each cluster based on data set quality. The method enables the presenting of at least one cluster including one or more ranked data sets in response to a search query.

Abstract: Various embodiments of the present disclosure include systems and methods for analyzing patents and prior art in a patent management system. In an example embodiment, a computer-implemented method of determining a potential point of novelty for an identified patent comprises retrieving at least one independent claim of the patent in the claim form as issued: retrieving at least one independent claim of the patent in the claim form as published; and automatically comparing the issued claim to the published claim by identifying unique keywords present in the issued claim but not present in the published claim and flagging the unique keywords to a user.

Abstract: Methods, systems, and computer programs for generating a playlist of media content items for a group of users. Media content items listened to by the selected users are compared to an average user taste profile to select media content items for playback to the group of users.

Abstract: Systems and methods that are adapted for automatic curation of query responses are disclosed herein. An example method includes obtaining user action metrics corresponding to responses provided in reply to a query for a target resource, the query having a search term, determining a portion of the responses having user action metrics with statistical significance, generating a list of curated responses based on the portion of the responses, and providing the curated responses in reply queries having the search term.

Abstract: A system includes a communications interface configured to receive a plurality of data series captured by a plurality of sensors. A first database includes at least a first data series of the plurality of data series. A second database includes metadata related to the first data series. One or more processors are configured to receive an instruction including an indication of a computation to perform and metadata filter criteria, query the second database to determine at least a portion of the first data series that satisfies the metadata filter criteria by reference to at least the metadata related to the first data series, access, from the first database and based on results of the query of the second database, the portion of the first data series, and perform the computation on the portion of first data series accessed from the first database.

Abstract: In some embodiments, in connection with a user input of a user, a set of selective parameters to be configured by the user for a structured data query may be determined. As an example, the set of selective parameters may be a first set of selective parameters for the structured data query in response to the set of permissions being a first set of permissions. As another example, the set of selective parameters may be a second set of selective parameters different from the first set of selective parameters in response to the set of permissions being a second set of permissions. One or more input fields for configuring one or more selective parameters of the set of selective parameters may be generated for display, and an executable data query may be generated based on configuration information (related to the selective parameters) that is obtained via the input fields.

Abstract: The present disclosure relates to utilizing a distributed data management system to provide improved data management, redundancy, and reliability in distributed directory systems. To illustrate, a distributed data management system improves existing distributed directory systems by relocating and distributing the management of data records from a centralized cache device to the backend storage partition devices. In this manner, the backend storage partition devices become responsible for automatically pushing data record metadata and changes to the centralized cache device, which only passively redirects the incoming requests to the proper backend storage partition devices. Additionally, the backend storage partition devices automatically resolve conflicts and restore lost data if the centralized cache device or a backend storage partition device suffers from faults or device failures.

Abstract: An orchestration cluster node system may include a plurality of local orchestration cluster nodes. Each local cluster node may include a service request executor, coordination function, and a resource manager. Each local cluster node may operate in a geography and the coordination functions of local cluster codes may communicate to coordinate execution of services across geographies.

Abstract: For a given cross-data-store transaction request at a storage service, a coordinator transmits respective voting transition requests to a plurality of log-based transaction managers (LTMs) configured for the respective data stores to which writes are directed in the transaction. The LTMs transmit responses to the coordinator based on data-store-specific conflict detection performed using contents of the voting transition requests and respective data-store-specific state transition logs. The coordinator determines a termination status of the cross-data-store transaction based on the LTMs' responses, and provides an indication of the termination status to the LTMs.

Abstract: The present disclosure proposes method and apparatus for query-based table visualization. A query may be obtained. At least one search result for the query may be obtained. A table may be extracted from the at least one search result. At least one chart corresponding to the table may be generated based on the query and the table.