Patent classifications
G06F40/12
Translation of tenant identifiers
Systems, devices, and techniques are disclosed for translation of tenant identifiers. A record may be received. A value of a tenant identifier for the record may be determined from a key for the record or a scan descriptor. The value of the tenant identifier in the key for the record may be replaced with a new value for the tenant identifier. A bitmap stored in a record header of the record may be used to identify columns of the record that stored an encoded value of the tenant identifier. An encoded new value of the tenant identifier may be stored in columns identified by the bitmap stored in the record header that include an attribute indicating that tenant identifier translation is enabled.
AUTOMATIC TWO-WAY GENERATION AND SYNCHRONIZATION OF NOTEBOOK AND PIPELINE
Systems, methods, and other embodiments associated with associated with automatic two-way generation and synchronization of notebook and pipeline are described. In one embodiment, a computer-implemented method includes: identifying a difference between pipeline and notebook representations of application logic, wherein the difference is one of (i) a notebook paragraph without a corresponding pipeline node and (ii) a pipeline node without a corresponding notebook paragraph; synchronizing the pipeline representation and notebook representation by, for the notebook paragraph that does not have a corresponding pipeline node, automatically generating a new pipeline node in the pipeline representation, and for the pipeline node that does not have a corresponding notebook paragraph, automatically generating a new notebook paragraph in the notebook representation; and updating either a pipeline user interface to show the new pipeline node or a notebook user interface to show the new notebook paragraph.
AUTOMATIC TWO-WAY GENERATION AND SYNCHRONIZATION OF NOTEBOOK AND PIPELINE
Systems, methods, and other embodiments associated with associated with automatic two-way generation and synchronization of notebook and pipeline are described. In one embodiment, a computer-implemented method includes: identifying a difference between pipeline and notebook representations of application logic, wherein the difference is one of (i) a notebook paragraph without a corresponding pipeline node and (ii) a pipeline node without a corresponding notebook paragraph; synchronizing the pipeline representation and notebook representation by, for the notebook paragraph that does not have a corresponding pipeline node, automatically generating a new pipeline node in the pipeline representation, and for the pipeline node that does not have a corresponding notebook paragraph, automatically generating a new notebook paragraph in the notebook representation; and updating either a pipeline user interface to show the new pipeline node or a notebook user interface to show the new notebook paragraph.
MULTI-STRATEGY COMPRESSION SCHEME
A system includes a memory and a processor, where the processor is in communication with the memory. The processor is configured to receive a request to compress a schema. The schema is analyzed to determine whether to apply a first type of compression or a second type of compression, where analyzing the schema includes determining whether the schema exceeds a threshold level. Upon determining that the schema exceed the threshold level, a compressed schema is generated by performing the second type of compression. Next, the processor responds to the request with the compressed schema.
MULTI-STRATEGY COMPRESSION SCHEME
A system includes a memory and a processor, where the processor is in communication with the memory. The processor is configured to receive a request to compress a schema. The schema is analyzed to determine whether to apply a first type of compression or a second type of compression, where analyzing the schema includes determining whether the schema exceeds a threshold level. Upon determining that the schema exceed the threshold level, a compressed schema is generated by performing the second type of compression. Next, the processor responds to the request with the compressed schema.
Reduction of edges in a knowledge graph for entity linking
An apparatus links an entity in a first knowledge-graph with a word in a text. The apparatus, based on a number of first-edges coupled to each of first-nodes serving as a transition-source and a number of second-edges coupled to each of second-nodes serving as a transition-destination in the first knowledge-graph, identifies a third-edge to be deleted from edges coupled to a third-node among the second-nodes which has a preset input-order indicating a number of edges that transition to the third-node, and generates a second knowledge-graph by deleting the third-edge from the first knowledge-graph. The apparatus couples first and second nodes which have been coupled to each other by the third-edge in the first knowledge-graph, via a fourth-node to which the first and second nodes are coupled by edges in the second knowledge-graph, and provides the word in the text and the entity linked with the word to a user.
Reduction of edges in a knowledge graph for entity linking
An apparatus links an entity in a first knowledge-graph with a word in a text. The apparatus, based on a number of first-edges coupled to each of first-nodes serving as a transition-source and a number of second-edges coupled to each of second-nodes serving as a transition-destination in the first knowledge-graph, identifies a third-edge to be deleted from edges coupled to a third-node among the second-nodes which has a preset input-order indicating a number of edges that transition to the third-node, and generates a second knowledge-graph by deleting the third-edge from the first knowledge-graph. The apparatus couples first and second nodes which have been coupled to each other by the third-edge in the first knowledge-graph, via a fourth-node to which the first and second nodes are coupled by edges in the second knowledge-graph, and provides the word in the text and the entity linked with the word to a user.
Methods and devices for terminal control
The present disclosure discloses methods and devices for terminal control. The method comprises: sending a request from a first terminal to a server to obtain information about a multimedia application currently running on a second terminal, the information comprising application identification and one or more playback attributes of the multimedia application; displaying on the first terminal the information about the multimedia application currently running on the second terminal; generating by the first terminal one or more new playback attributes of the currently running multimedia application, and sending from the first terminal to the second terminal via the server a synchronization control request comprising the one or more new playback attributes, thereby allowing the second terminal to control the multimedia playback of the multimedia application based on the one or more new playback attributes in the synchronization control request. The present disclosure can allow one to use one terminal in the Internet to control the multimedia playback on another terminal. This can accomplish the combination of hardware advantages of both terminals and can increase the efficiency of playback control.
COMPUTER READABLE RECORDING MEDIUM, EXTRACTION APPARATUS, AND EXTRACTION METHOD
An extraction apparatus includes an input-data analysis unit that, when an extraction process is performed on input data containing a plurality of XBRL files using a combination of a plurality of extraction criteria, each of the extraction criteria directly specifying an element and an aspect of each of the plurality of XBRL files, calculates, from the input data, distribution information containing distribution of values of individual aspects of a plurality of elements that are individually provided by the plurality of XBRL files, and an application-sequence determining unit that determines an application sequence of the plurality of extraction criteria by referring to the calculated distribution information. Hence, the extraction apparatus can extract XBRL data pieces containing data items to be validated against a validation rule from the input data rapidly.
Systems and Methods for Hosted Applications
In one embodiment, a computing device configured to execute a hosted application includes a processor and storage, where an operating system is installed on the computing device, an application platform application including a rendering engine process including a virtual machine and an integration process, at least one hosted application comprising a background page file, wherein the virtual machine is configured to parse instructions in the background page file to download at least one remotely hosted file for rendering a web page, build a document object model (DOM), and modify the DOM in accordance with a predetermined DOM modification rule to create a modified DOM based on the computing environment, and wherein the rendering engine process is configured to render a user interface page integrated into the computing environment of the operating system of the computing device based on the DOM generated by the execution of the background page.