Abstract: A large highly parallel database management system includes thousands of nodes storing huge volume of data. The database management system includes multiple query optimizers for determining low cost execution plans for queries. The database management system is adapted to receive a data query. An execution plan generator component of the database management system generates an initial execution plan for the query. The initial execution plan is fed as input to more than one query optimizers. Each optimizer starts with the initial execution plan, generates alternative execution plans, and determines a satisfactory execution plan that incurs the lowest cost. The database management system compares the selected execution plans by the optimizers and selects one with the lowest cost. The multiple query optimizers run in parallel.

Abstract: Systems and methods provide techniques for reviewing content, such as reviewing video on a mobile device. A computing device with a touch screen interface, e.g., a tablet computer, executes a reviewing tool, e.g., a computer program, that causes the device to display video content and information about the video content. The tool provides an interface for selecting video, images, and information, for review and for annotation. The tool uses remote and/or local data to display video, images, and information for review.

Abstract: A method and system is disclosed that generates a dictionary of terms comprising terms associated with games of a collaboration platform. The method further identifies search terms associated with previous search queries. The method compares the search terms with the terms of the dictionary to determine whether the search terms associated with the previous search queries are in the dictionary of terms. The method identifies a first set of the search terms that are candidates to receive search suggestions and a second set of the search terms that are to be the search suggestions based on the comparison. The method also generates a record that associates candidate search terms of the first set of the search terms with respective search suggestions of the second set of the search terms. The record is used to provide a search suggestion for a search term of a new search query.

Abstract: Techniques for processing queries are provided. In one approach, an execution plan for a query includes multiple sub-plans, one or more of which are selected at runtime while one or more other sub-plans are not executed during execution of the execution plan. In another approach, data about misestimate is generated and stored persistently for subsequent queries. In another approach, statistics for a database object are generated automatically and efficiently while the database object is created or data items are added thereto. In another approach, a hybrid histogram is created that includes a feature of frequency histograms and a feature of height-balanced histograms. In another approach, computer jobs are executed in such a way to avoid deadlock. In another approach, changes to a database object trigger a hard parse of a query even though an execution plan already exists for the query.

Abstract: The disclosed embodiments provide a system for processing a query for a ranking of candidates for an opportunity. During operation, the system obtains parameters associated with a query for a ranking of candidates for an opportunity, wherein the parameters include a candidate and the opportunity. Next, the system matches one or more of the parameters to a fixed number of quantile thresholds calculated from a distribution of scores for the candidates. The system then estimates, based on the fixed number of quantile thresholds, a quantile for a score of the candidate. Finally, the system outputs a position of the candidate within the ranking based on the estimated quantile.

Abstract: A computer-implemented method of evaluating a set of filter parameters being represented by a filter tree comprising a plurality of nodes. The method can include identifying whether a node is a root of a sub-tree comprising other nodes of the filter tree; generating a cost for said node by processing a sample input comprising a plurality of data items of a data source using the filter parameter and measuring the time taken for the plurality of data items to be processed; and determining a selectivity of said node based on an output of its filter parameter as a result of processing the sample input using the filter parameter; then ordering at least some of the plurality of nodes of the filter tree having the same parent node based on their relative costs and selectivities, for use in generating an ordered filter tree.

Abstract: An embodiment may involve: (i) obtaining a set of data records that include respective pluralities of tuples characterizing operation of communication sessions in a network and that identify hardware or software components related to the network that were involved in the communication sessions, (ii) determining degrees to which signatures in the pluralities of tuples are associated with communication problems in the network; (iii) identifying, from the degrees, a subset of the signatures most associated with the communication problems; (iv) grouping specific pairs from the subset of the signatures into equivalence classes based on co-occurrence of signatures of the specific pairs within the data records; (v) generating and pruning a dependency graph between the equivalence classes; (vi) from the equivalence classes remaining in the dependency graph, selecting a subset of the hardware or software components related to the network that are candidates for involvement with the communication problems.

Abstract: An apparatus and techniques for constructing and utilizing a “dynamic dictionary” that is not a compiled dictionary, and therefore does not need to be recompiled in order to be updated. The dynamic dictionary includes respective data structures that represent (i) a management automaton that includes a plurality of management nodes, and (ii) a runtime automaton that is derived from the management automaton and includes a plurality of runtime nodes. The runtime automaton may be used to search input data, such as communication traffic over a network, for keywords of interest, while the management automaton manages the addition of keywords to the dynamic dictionary. Typically, at least two (e.g., exactly two) such dynamic dictionaries are used in combination with a static dictionary.

Abstract: The present disclosure provides a shopping recommendation method, a client, and a server. The method includes: acquiring voice information of a user, and performing voice recognition and keyword extraction on the voice information, to obtain shopping keyword information; transmitting the shopping keyword information to a server, so that the server performs interest prediction according to the shopping keyword information and shopping related information of the user, to generate recommendation information; and receiving the recommendation information, and generating shopping recommendation content according to the recommendation information to be displayed by a display.

Abstract: A data providing apparatus includes circuitry configured to store a query as a candidate query in a first memory in association with an execution plan and store data in a second memory when receiving the execution plan and the data from a database server in response to transmitting the query to the database server, perform searching the first memory for a first candidate query having content corresponding to content of a first query in response to receiving the first query from a first request source, when the first candidate query is detected by the searching, select a first execution plan associated with the first candidate query by referring to the first memory, extract specific data from the second memory on the basis of the selected first execution plan, and transmit the specific data to the first request source.

Abstract: Disclosed aspects relate to transforming a user-defined table function (UDTF) to a derived table in a database management system (DBMS). It may be detected by the DBMS that a query indicates the UDTF. A derived table may be constructed from the UDTF. The derived table may be derived from a set of statements of the UDTF. The derived table may be introduced to the query to fulfill the UDTF. A query plan may be generated for the query by the DBMS. The query plan may be generated in response to introducing the derived table in the query.

Abstract: A word extraction method according to at least one embodiment of the present disclosure includes: converting, with at least one processor operating with a memory device in a device, received speech information into text data; converting the text data into a string of words including a plurality of words; extracting, with the at least one processor operating with the memory device in the device, a keyword included in a keyword database from the plurality of words; and calculating, with the at least one processor operating with the memory device in the device, importance levels of the plurality of words based on timing of utterance of the keyword and timing of utterance of each of the plurality of words.

Abstract: A system comprises at least one hardware processor and a memory storing instructions. When executed, the instructions cause the at least one hardware processor to perform operations comprising receiving, in a computing process, a Java user-defined table function (Java UDTF), the Java UDTF including code related to a process method to be performed that includes receiving one or more input tables and transforming the one or more input tables to an output table; determining, using at least a security policy, whether performing one or more portions of the process method are permitted; and performing portions of the process method determined to be permitted.

Abstract: A method, system, apparatus, and a computer program product are provided for optimizing database query plans generated from a received database query at a database management system by monitoring a global cost estimation function for one or more steps of the received database query to identify a first low-performing cost metric and collaboratively optimizing a query plan for the database query by comparing differences between the first low-performing cost metric and a second cost metric at an additional database management system, thereby generating an optimized query plan for the database management system that may be stored at the database management system along with corresponding information identifying a reason for rewriting the optimized query plan.

Abstract: A system extracts data from one or more sources of data and displays information regarding the data using interactive visualizations that allow a user to interact directly with the visualizations of the data, without necessarily requiring the user to utilize a menu-driven interface.

Abstract: Methods for cardinality estimation feedback loops in query processing are performed by systems and devices. A query host executes queries against data sources via an engine based on estimated cardinalities, and query monitors generate event signals during and at completion of execution. Event signals include indicia of actual data cardinality, runtime statistics, and query parameters in query plans, and are routed to analyzers of a feedback optimizer where event signal information is analyzed. The feedback optimizer utilizes analysis results to generate change recommendations as feedback for later executions of the queries, or similar queries, performed by a query optimizer of the query host. The query host stores change recommendations, and subsequent queries are monitored for the same or similar queries to which change recommendations are applied to query plans for execution and observance by the query monitors. Change recommendations are optionally viewed and selected via a user interface.

Abstract: Included are a vector estimation means that estimates, in response to receiving input of a plurality of pieces of relational data each including a plurality of objects and a relationship between the objects, for each piece of relational data, a latent vector for characterizing a structure of the relational data by using the objects and the relationship included in the relational data; and a matching means that matches, for each set of first relational data and second relational data different from each other of the received pieces of relational data, a first object and a second object by using a first latent vector corresponding to the first object included in the first relational data and a second latent vector corresponding to the second object included in the second relational data.

Abstract: Query content-based data generation includes obtaining a query having an outer query and one or more subqueries, performing subquery transformation on each subquery, which converts predicates of the subqueries to be predicates of the outer query, and thereby obtain a transformed query, generate from the transformed query block(s) each having a list of predicates selected from the transformed query, processing each query block for column information, including column range information and column relationship information, and generating data and populating a dataset having table(s) and respective column(s) for each of the table(s). Generating the data uses the column range information and the column relationship information to select data for the dataset such that data records from the dataset are produced as results to executing the obtained query against the dataset.

Abstract: The subject technology receives a first query plan corresponding to a first query, the first query plan comprising a new query plan different than a previous query plan for the first query. The subject technology determines a value indicating an estimated improvement in execution time of the first query plan in comparison to a previous execution time of the previous query plan. The subject technology determines that the value is greater than a threshold value. The subject technology, in response to the value being greater than the threshold value, executes the first query using the first query plan.

Abstract: A method includes determining, by an electronic device, a skill from a first natural language (NL) input. Upon successful determination of the skill, the first NL input is transmitted to a custom skill parser for determination of a skill intent. The custom skill parser is trained based on data including at least a custom training data set. Upon unsuccessful determination of the skill, the first NL input is transmitted to a generic parser for determination of a general intent of the first NL input.

Abstract: A system for adaptively adjusting related search words are provided. The system includes an input device, a search log collection module, a threshold setting module and a process evolution module. The input device receives a search word. The search log collection module determines whether the cumulative search count of the search word is greater than a first threshold or less than a second threshold. The threshold setting module sets the first threshold and the second threshold in terms of the number of search logs. When the cumulative search count of the search word is between the first threshold and the second threshold, the process evolution module optimizes the middle search process to find out at least one related word and/or at least one historical search word most related to the attributes or content of the search word from the indexed text and the historical search log.

Abstract: A method for accessing a web-based repository service from a cloud platform is provided. The method may include receiving, at a gateway controller, a first request from an endpoint to access the web-based repository service. Upon successfully verifying the first request, a redirect request to a reverse proxy at the gateway controller may be returned to the endpoint. The redirect request may include a cryptographic signature and the first request. The reverse proxy may respond to the redirect request from the endpoint by accessing, on behalf of the endpoint, the web-based repository service to store and/or retrieve data. The web-based repository service may be accessed by sending, to the web-based repository service, an encrypted second request corresponding to the first request. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: A method and a system for determining an importance score associated with a digital news item, the importance score for determining push notifications to be provided to a user of an electronic device. The method comprises accessing a digital news item, the digital news item having been electronically published at a news item publication time by a digital news source, the digital news source being accessible via a communication network; determining a source weight of the digital news source; determining the importance score of the digital news item based on the news item publication time and the source weight of the corresponding digital news source; in response to the importance score of the digital news item being above an importance score threshold, generating a push notification based on the digital news item; and transmitting the push notification by the server to the electronic device.

Abstract: Passenger information messages (“PIMs”) are generated using table-driven segment systems and methods. Message segments may be paired with token names. Passenger information associated with an airline flight are substituted for the token names. The passenger information and message segments are arranged to generate a PIM for the airline flight.

Abstract: A cloud-based service records time-series data of a plurality of metrics from a plurality of tenants. The time-series data comprises a series of measures of a metric at sequential points in time. The time-series data is recorded in database tables in a manner that consumes more resources when the cardinality of the time-series data is high. When the cardinality of the data for the tenant is too high, the tenant is blacklisted and further data for the tenant is not stored. In addition to identifying incoming time-series data by the tenant that produced it, the data may also identify its type. In this case, the cardinality of each type of data may be determined and the types of data may be individually allowed or blacklisted for the tenant.

Abstract: Methods and systems for client side search ranking improvements are disclosed. In one example, a search query is received from a user on a client device. The local search results are filtered based on the received search query and one or more local ranking rules. Features for each filtered local search result are computed. The computed features of each filtered local search result are input to one or more machine learning (ML) models. Each ML model can generate a score for each filtered local search result. The filtered local search results are ranked based on the generated score within a category. In one example, local search results and remote server search results are obtained. The local search results and remote server search results are ranked using at least one machine learning (ML) ranking model. The ranked local search results and remote server search results are displayed on the client device by category.

Abstract: In an example there is provided a computer-implemented method comprising generating an execution plan for a received user query in a structured query language, the execution plan having a number of operators for operating on data from a content database; compiling the operators into corresponding byte code and machine code; executing the operators by first interpreting the corresponding byte code; switching to executing the operators by executing the corresponding machine code when compiled.

Abstract: Embodiments for identifying entities relevant to queries are provided. At least one query is received from a user. The at least one query is associated with at least one entity. Results of the at least one query are analyzed to identify related entities. The related entities are analyzed based on a relevancy score and an information enhancement score for each of the related entities to generate a ranking of the related entities. At least one of the related entities is provided to the user based on the ranking of the related entities.

Abstract: In some examples, a method includes receiving, from one or more client devices, a stream of messages composed by one or more users of the one or more client devices, wherein each of the messages includes a particular hashtag, determining, using a set of metrics that are based at least in part on the messages, a trending score that represents a magnitude of a trend for the particular hashtag, in response to determining that the trending score satisfies a threshold, sending, to a content provider system, a set of demographic data that describes one or more of the users who associated with the particular hashtag, and, in response to receiving, from the content provider system, targeted content that is based at least in part on the particular hashtag and the set of demographic data, sending, for display at the one or more of the one or more client devices, the targeted content.

Abstract: A method includes determining, by an electronic device, a skill from a first natural language (NL) input. Upon successful determination of the skill, the first NL input is transmitted to a custom skill parser for determination of a skill intent. The custom skill parser is trained based on data including at least a custom training data set. Upon unsuccessful determination of the skill, the first NL input is transmitted to a generic parser for determination of a general intent of the first NL input.

Abstract: An AI routing framework for a multi-domain chatbot is provided. According to one set of embodiments, a computer system implementing the AI routing framework can receive a user query/request submitted to the multi-domain chatbot, determine an input statement corresponding to the user query/request, and calculate an embedding of the input statement reflecting the input statement's semantic content. The computer system can further identify, from among a plurality of statement embeddings maintained in a repository, a statement embedding that most closely matches the embedding of the input statement, and determine a domain associated with the identified statement embedding in the repository. The computer system can then forward the input statement to a handler of a back-end software system configured to process user queries/requests belonging to the determined domain.

Abstract: A non-transitory computer-readable recording medium having stored therein a program for causing a computer to execute a processing, the processing includes allocating a plurality of records to a page in shared memory that is able to be accessed simultaneously by a plurality of processings; receiving the plurality of records; writing, based on the plurality of records, information of writing region to the page for each of the plurality of records, and generating a writing processing corresponding to record for the plurality of records; generating, based on written the record to the writing region indicated by the information on the page by the writing processing executed, the page with at least of one of the record written; and loading the page generated to the database.

Abstract: Systems and methods for implementing sequenced filter templates to intelligently reduce a dataset to find useful patterns and source data are disclosed. An expert investigative user may configure a filter template comprising a series of filters organized in a sequence desired by the expert user. The filter template can be customized by an end user to reduce a dataset and perform guide investigation of the reduced dataset.

Abstract: A system and method for generating training sets for training neural networks. The method includes determining a segmentation based on a column from a columnar database table; generating a group-by query based on the segmentation; generating a plurality of reduced queries based on the group-by query; executing the group-by query on a table of a database to obtain a result table, wherein the result table includes a plurality of results, wherein each result corresponds to a respective reduced query of the plurality of reduced queries; and generating a plurality of training query pairs by pairing each reduced query with its corresponding reduced result.

Abstract: One embodiment of the invention is directed to a method for performing efficient data searches in a distributed computing system. The method may comprise, receiving a search request including a key. The key may be provided to a block-based table manager via a programming interface external to a virtual machine executing on a computer system. The programming interface may provide a translation between a first programming framework of the virtual machine and a second programming framework of the block-based table manager. Providing the key may cause the block-based table manager to conduct a search for a value corresponding to the key. The value may be provided in response to the search request. Utilizing such block-based tables may enable a data search to be performed using on-board memory of computing node operating within a distributed computing system.

Abstract: A system and method for receiving a query of a partitioned table, the query including a first index predicate associated with a first partition key column; determining that one or more of the query is missing a second index predicate and the first index predicate is unusable for index probing; responsive to determining that one or more of the query is missing the second index predicate and the first index predicate is unusable for index probing, generating one or more synthesized predicates used to process the query using an index scan.

Abstract: Balancing resource usage for client applications workload and data merge optimization of the backend for both a local merge within one server and a merge across multiple servers is determined based on previous resource usage pattern in a distributed storage system.

Abstract: Apparatuses, systems, and methods for high data mode operation in cellular networks. A UE may determine, for an interface to a high-speed cellular network, a categorization from a plurality of categorizations, determine availability of the high-speed cellular network, and select, based at least in part on the categorization and availability of the high-speed cellular network, the interface for a data connection to the high-speed cellular network. The categorization may be one of expensive or not expensive and/or one of a first level associated with a higher compression codec rate or a second level associated with a lower compression codec rate. The UE may receive, from one of the a low-speed cellular network or the high-speed cellular network, carrier plan information for a cellular data service carrier and analyze the carrier plan information to determine desirability of a switch, e.g., from the low-speed cellular network to the high-speed cellular network.

Abstract: Techniques for optimizing result presentation for a database query. A database query is received. The database query is performed with a clause indicating one or more offset values to be used in displaying results from the database query. The one or more offset values indicate a subset within the results from the database query to be presented. An order is imposed on the results from the database query. The subset is presented as determined by the one or more offset values.

Abstract: Aspects of the disclosure generally relate to computing devices and may be generally directed to devices, systems, methods, and/or applications for learning the operation of a computing device or software application, storing this knowledge in a knowledgebase, neural network, or other repository, and enabling autonomous operation of the computing device or software application with partial, minimal, or no user input.

Abstract: Systems and methods are directed to managing access to a shared memory. A request received at a memory controller, for access to the shared memory from a client of one or more clients configured to access the shared memory, is placed in at least one queue in the memory controller. A series of one or more timeout values is assigned to the request, based, at least in part on a priority associated with the client which generated the request. The priority may be fixed or based on a Quality-of-Service (QoS) class of the client. A timer is incremented while the request remains in the first queue. As the timer traverses each one of the one or more timeout values in the series, a criticality level of the request is incremented. A request with a higher criticality level may be prioritized for servicing over a request with a lower criticality level.

Abstract: Systems and methods for providing online content include evaluating a custom selection rule specified by a content provider. The custom selection rule may be used to control whether content from the provider is eligible for selection by a content selection service. The content selection rule may include one or more logical operators, a selected interest category and/or a selected list of one or more client identifiers.

Abstract: A graph data processing that loads subgraph data including a predetermined number of source vertices on the basis of a memory requirement among graph data including multiple vertices and edges stored in a storage and edge list based on the source vertices, performing a first level process to identify a first arrival vertex connected to each of the source vertices, loading the edge list on the basis of a source vertex of which the first arrival vertex is identified, performing a second level process to identify a second arrival vertex connected to the source vertex of which the first arrival vertex is identified, and processing a query on the basis of the source vertex, the first arrival vertex, and the second arrival vertex.

Abstract: A query is for retrieving a data item of a data graph. The data graph stores representations of the data item. Each representation stores information represented by the data item in a different manner or way. Sub-queries for the query each correspond to a different representation in which the data graph stores the data item. The sub-queries are evaluated to determine an appropriate representation of the data item in satisfaction or fulfillment of the query.

Abstract: Aspects of the invention include receiving an error code describing a computer hardware or firmware error. A list of data items to be collected to assist in correcting the error is received. The contents of the list are selected based at least in part on the error code and are in priority order. The data items in the list are collected and a buffer to store the collected data items is selected. At least a subset of the collected data items to be written is transmitted to the buffer. All of the collected data items are transmitted to the buffer when the buffer is large enough to hold all of the data items in the list. A subset of the collected data items are transmitted to the buffer in priority order when the buffer is not large enough to hold all of the data in the list.

Abstract: Systems, methods, and devices for automated maintenance of external tables in database systems are disclosed. A method includes receiving, by a database platform, read access to content in an external data storage platform that is separate from the database platform. The method includes defining an external table based on the content in the external data storage platform. The method includes connecting the database platform to the external table such that the database platform has read access for the external table and does not have write access for the external table. The method includes generating metadata for the external table, the metadata comprising information about data stored in the external table. The method includes receiving a notification that a modification has been made to the content in the external data storage platform, the modification comprising one or more of an addition of a file, a deletion of a file, or an update to a file in a source location for the external table.

Abstract: Methods and systems of determining competition for search queries on a video hosting system on a computer network are provided. Search records associated with search queries directed to the video hosting system are received. Each search record identifies videos available on the video hosting system that are search results for a corresponding search query and indicates associated view durations that the videos were viewed responsive to the search query. Search queries directed to a first and second videos and associated view durations that the first video was watched in response to the queries are identified from the received search records. A competition score indicating an amount of competition between the first and second videos for views of users of the video hosting system is calculated based on the identified search queries and associated view durations.

Abstract: Systems, methods, and computer-executable instructions for reorganizing a physical layout of data of a database a database. A workload is selected from previously executed database operations. A total resource consumption of the previously executed database operations and of the workload is determined. The total resource consumption of the workload is more than a predetermined threshold of the total resource consumption of the previously executed database operations. Optimization operations for the database are determined using the workload. A cloned database of the database is created. The optimization operations are executed on the cloned database. A database operation is received for the database. The database operation is executed on the database and the cloned database. The performance of the cloned database is verified as being improved compared to the performance of the database based on the executing of the database operation on the database and the cloned database.

Abstract: The present disclosure is directed to techniques to facilitate online commerce by leveraging user activity, specifically search activity for goods/services on an online platform. As described herein, the online platform refers to a turnkey e-commerce solution that enterprises use to manage electronic transactions involving their goods/services. Some techniques are directed to an improved online platform operative to predict a user's intention behind a search query and after a consider number of search queries, to have that search query as a dynamic search filter for the online platform. Other embodiments are described and claimed.

Abstract: Described are novel targeting ligands that may be linked to compounds, such therapeutic compounds that are useful in directing the compounds to the in vivo target. The targeting ligands disclosed herein can serve to target expression-inhibiting oligomeric compounds, such as RNAi agents, to liver cells to modulate gene expression. The targeting ligands disclosed herein, when conjugated to a therapeutic compound, may be used in a variety of applications, including use in therapeutic, diagnostic, target validation, and genomic discovery applications. Compositions including the targeting ligands disclosed herein when linked to expression-inhibiting oligomeric compounds are capable of mediating expression of target nucleic acid sequences in liver cells, such as hepatocytes, which may be useful in the treatment of diseases or conditions that respond to inhibition of gene expression or activity in a cell, tissue, or organism.