Abstract: The present disclosure relates to a document comparison system (100) for comparing a first document (D1) with a second document (D2). The first document (D1) includes at least a first section having at least one first section entity (CEn), and the second document (D2) includes at least one second document entity (CEn). The document comparison system includes a processor (110) and a memory device (120). The processor is configured to identify the at least one first section entity (CEn) in the first section of the first document (D1). The processor conducts a search of the second document (D2) to identify the presence or absence of one or more second document entity (CEn) corresponding to or equivalent to each first section entity (CEn) identified in the first section. The present disclosure also relates to a dictionary generating system; a document comparison method; a dictionary populating method; and non-transitory computer-readable medium.

Abstract: Techniques for processing top-K queries are provided. In one technique, a database statement is received that requests top-K results related to a database object and that indicates two columns thereof: a first column by which to partition a result set and a second column by which to order the result set. A buffer is generated. For each of multiple rows in the database object: a first key value that associated with a first value in the first column of said each row is identified; a second key value that associated with a second value in the second column of said each entry is identified; a slot in the buffer is identified based on the first key value and the second key value; and the slot in the buffer may be updated based on the second key value. A response to the database statement is generated based on the buffer.

Abstract: A method includes receiving a request to perform a shuffle operation on a data stream; receiving at least a portion of the data stream including a plurality of records, each including a key; storing each of the plurality of records in a persistent storage location assigned to a key range corresponding to keys included in the plurality of records; receiving a request from a consumer for a subset of the plurality of records including a range of keys; and upon receiving the request from the consumer, providing the subset of the plurality of records including the range of keys from the one or more persistent storage locations.

Abstract: Methods and computer systems for storing a query plan in a cache are provided. The method can include: determining a use frequency of the query plan; determining a target storage layer for storing the query plan based on the determined use frequency, wherein the cache includes at least two storage layers and each of the storage layers is associated with a compression level of query plans; processing the query plan according to the compression level of the target storage layer; and storing the processed query plan in the target storage layer.

Abstract: A process flow for model-based applications, including: receiving data from one or more data sources; applying at least one first transformation on at least a portion of the data to generate transformed input data encoded according to a predefined format; providing the transformed input data to an executed instance of a model facilitating a prediction associated with the data; and exposing access to application data based on an output associated with the model.

Abstract: The purpose of the present invention is to provide a suitable user-friendliness to a user regarding a recommendation of application software on a portable information terminal. In order to accomplish the purpose, this portable information terminal is configured to set an application as a recommendation candidate when the status of the portable information terminal matches a condition corresponding to the application, and recommend the application when the application further matches a pre-set recommendation permitting condition. Hence, the portable information terminal and the application recommending method thereof capable of providing a preferable user-friendliness to the user can be provided.

Abstract: Dynamic partitioning of a search space of queries is implemented for flexible, heuristic database querying. Search space partitioning refers to dividing the search space for a submitted query into smaller parts by augmenting the queries to append thereto an additional predicate comprising a dynamic partition key and a value(s) selected based on heuristics (e.g., recency and/or relevancy of the value(s)). A plurality of candidate augmentations of the query and corresponding query plans are generated and evaluated based on additional heuristics to determine which can be executed to yield the best results in terms of result quality and latency. This query plan is selected and executed for retrieval of results that satisfy the query, with pagination utilized for presentation of the results. The procedure of generating candidate query plans, selecting one of the candidates for execution, and paginating results is repeated until a search termination criterion is satisfied.

Abstract: A processor receives a search query for graph data representing a graph including nodes and edges, the search query specifying a search criterion. The processor determines whether a value of a first property associated with a first node matches the search criterion. The processor predicts whether a value of a second property associated with a second node matches the search criterion, in accordance with a result of the determining and a constraint rule between the first node and the second node. The processor generates a search result for the search query in accordance with the result of the determining and a result of the predicting.

Abstract: A computer-implemented method is disclosed that includes operations of parsing a query comprised of a sequence of operators to detect each operator of the sequence of operators, where the sequence of operators includes a machine learning (ML) operator representing a trained ML model. Additionally, a schema of the ML operator is determined through metadata. A filter or a projection is generated based on the schema of the ML operator, where the filter or projection is configured to reduce an amount of data retrieved upon application of the filter of the projection to an operator of the sequence of operators comprising the query. The schema of the ML operator indicates a schema of input data to be provided to the ML operator and a schema of output data to be provided by the ML operator following processing.

Abstract: In accordance with an embodiment, described herein is a system and method for dependency analysis for a calculation script in a multidimensional database computing environment. A multidimensional database cube aggregation can be represented as a lattice of blocks or cube, arranged according to a database outline (e.g., intra-dimensional or member hierarchy). When the multidimensional database system performs computations in parallel for a given calculation script, portions of the cube that can be computed concurrently are identified.

Abstract: A frequency of occurrence for each term in a training data set is determined in relation to the entire training data set. A relational data structure is generated that associates each term in the training data with its respective frequency. Any term that has a frequency below a threshold frequency is then added to a list of relevant words. When a natural language search query is received, a plurality of terms in the natural language search query are identified and compared with the list of relevant words. If any term of the natural language search query is included in the relevant words list, that term is identified as a keyword. The natural language search query is then interpreted based on any identified keywords.

Abstract: Embodiments are for generating a digital signature of a query execution plan using similarity hashing. A technique includes generating a node digital signature for nodes in a query and generating an edge digital signature for edges in the query, the edges connecting the nodes. The technique includes selecting at least one previously executed query based on the node digital signature and the edge digital signature for the query and causing the query to be processed according to an assignment associated with the at least one previously executed query.

Abstract: Systems and methods are provided in order to avoid ingesting the entire contents of one or more data sources. An object may be associated with one or more pieces/fragments of data that can be stored in different data sources. When a request for the object is initiated, a search for those pieces/fragments of data can be performed. Nodes associated with each data source may generate data queries appropriate for its corresponding data source, retrieve, and if needed transform the data into an object-based data structure. Any pieces/fragments of data that have been discovered and retrieved can be joined, e.g., by an application programming interface server, and forwarded to a requesting client or application. In this way, only data relevant to the object is obtained. Moreover, object versioning can be employed so that the most up-to-date data is obtained.

Abstract: Methods and apparatus are disclosed for staged query compilation. One or more intermediate plans between a query and its execution plan are stored according to a common specification for plan data structures. Data sources, a plan flow, and annotations can be stored in respective fields of the plan data structure, which can be extended with a field for a serialized execution plan. Plan data structures provide a stable interface for integration of local and external software modules, and decouple plan representation from plan optimization. Use cases are disclosed for integrating offline optimization with inline software modules, for integrating local query handling with external services, for caching intermediate plans, and for archiving plans across version changes of optimizers. A hub architecture flexibly supports numerous compilation workflows. Disclosed technologies are suitable for cloud deployments and for migration of databases into the cloud.

Abstract: The described technology is generally directed towards coordinating the generation, validation and enabling of content selection graphs in an in-memory content selection graph data store. When a set of content selection graphs is requested, a coordinator starts the generation of the relevant graphs. Upon successful generation, the coordinator starts a validation of the generated graphs against rules for the nodes/response data in the graphs. If the generated graphs pass validation, the coordinator enables the graph set for use in an in-memory cache, whereby when a request to return content selection data is received, an active graph that corresponds to the request and the current time is accessed to obtain and return the response data as the requested content selection data.

Abstract: A two phase move technique for moving groups of tables may reduce cross-host communication and length of table locks. A group including a first table and a second table may be moved to the destination host system. This is done by creating a third table replicating the first table and creating a fourth table replicating the second table on the destination host, and replicas of other tables in the group. The tables in the group are not locked against modifications during the creation of the replica tables. After the creation of the replicas, roles of the original tables and the created tables are switched such that the original tables are set to the replica role and the created tables stored on the destination are set to the source role. The original tables are dropped after the switching of the roles.

Abstract: Embodiments are provided for querying a media server for media content based on user-selected metadata associated with first media while the first media is being experienced by a user. In one embodiment, at least one metadata associated with the first media may be displayed for the user to review while the first media is being experienced by the user. The user may then select a displayed metadata to initiate a search for media content based on the selected metadata. The search for media content may be performed by querying a media server associated with a selection of media content services. The user may then review the results of the media query, select media content from the results, and initiate further action, such as adding the media content to a digital repository, or purchasing the media content.

Abstract: A computing or storage system constructs a table in memory, and constructs a summary table that summarizes the table. The summary table is for determining whether there is likely an entry for a value in the table. The summary table has buckets pointed to by address fields of values. The first bucket in the summary table is split into a second bucket and a third bucket. Prior to the split, the first bucket is pointed to by a first address field of a first value. After the split, the second bucket and the third bucket are pointed to by the first address field plus one extra bit derived from a remainder of the first value.

Abstract: A system comprises an interface, a processor, and a memory. The interface is configured to receive a query. The processor is configured to: determine a set of nodes for the query; determine whether a node of the set of nodes comprises a first engine node type or a second engine node type, wherein determining whether the node of the set of nodes comprises the first engine node type or the second engine node type is based at least in part on determining whether the node is able to be executed in a second engine; and generate a plan based at least in part on the set of nodes. The memory is coupled to the processor and is configured to provide the processor with instructions.

Abstract: A system for and method of generating an API or an API template for use with a map service. The API, e.g., URL when invoked in a WMS server or WMTS server, causes generating a metadata for a set of one or more areas of interest (AOIs) and one or more date ranges. The metadata provides access to a dataset of surveys via getmap or gettile requests. The API is dynamic in that the effect of the API (the metadata generated) is automatically updated whenever there has been a new survey added in the set of AOIs and date ranges. The API template is for a TMS service, and when populated, provides for causing any tiled map in the set of AOIs and date ranges to be displayed.