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: 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: 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: 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: 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 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: 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: 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: 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: A computer-implemented system and method for distributed activity detection is provided. Contextual data collected for a user performing an activity is processed on a mobile computing device. The mobile computing device extracts features from the contextual data and compares the features with a set of models. Each model represents an activity. A confidence score is assigned to each model based on the comparison with the features and the mobile computing device transmits the features to a server when the confidence scores for the models are low. The server trains a new model using the features and sends the new model to the mobile computing device.

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.

Abstract: Devices, methods and systems for processing database queries formatted differently than the database storage model being queried are disclosed. Processing database queries independent of the storage model of the queried database may be performed by receiving a query for one or more data items stored in a database, determining whether to use at least one query operator that uses data having a format different from the storage model format of at least one of one or more data items stored in the database and converting the format of the data used by the at least one query operator to a format that matches the storage model format of at least one of one or more data items stored in the database. Related systems, methods, and articles of manufacture are also described.

Abstract: Methods, systems, and computer storage media are provided for presenting a preview of a customized landing page at a search engine are provided. The search engine may provide search results that comprise a preview of the customized landing page, where a user may interact with the customized landing page while at the search engine. The user may select a landing-page link provided by the customized landing page using the preview at the search engine. Based on selecting the landing-page link, the user is navigated directly from the search engine to a webpage associated with the landing-page link. A customized landing page may be generated for display at the preview of the search engine, where the customized landing page includes a user-specific element, such as information specific to the user, which may be based on a user identifier communicated from the search engine to a customizable landing-page website.

Abstract: Systems, methods, and devices for querying over an external table are disclosed. A method includes connecting a database platform to an 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 receiving a query comprising a predicate, the query directed at least to data in the external table. The method includes determining, based on metadata, one or more partitions in the external table comprising data satisfying the predicate. The method includes pruning, based on the metadata, all partitions in the external table that do not comprise any data satisfying the predicate. The method includes generating a query plan comprising a plurality of discrete subtasks. The method includes assigning, based on the metadata, the plurality of discrete subtasks to one or more nodes in an execution platform.

Abstract: A device may determine that a user device, associated with a user, and a first object for comparison are within a threshold proximity of one another. The device may communicate with the user device to obtain a comparison profile, associated with the user, based on determining that the user device and the first object are within the threshold proximity of one another. The device may identify, based on the comparison profile, a set of desired attributes. The device may identify, based on the comparison profile, a set of attribute categories to be used to compare the first object and the set of desired attributes. The device may determine a first set of attributes of the first object for the set of attribute categories. The device may present, for display, information that identifies one or more attributes of the first set of attributes or the set of desired attributes.

Abstract: Using a blockchain transaction acceleration system, a first transaction generated by a first node is sent to an acceleration node in a blockchain, where the first transaction is sent to the acceleration node instead of being sent directly to a second node that is the intended recipient of the first transaction, and where the first node, the second node, and the acceleration node are different nodes. The blockchain transaction acceleration system forwards the transaction from the acceleration node to the second node. The blockchain transaction acceleration system executes the transaction by the second node.

Abstract: Described is an approach for performing an efficient processing of table functions/polymorphic table functions. The approach does not create additional cursors for processing a table or polymorphic table function invoked within a SQL statement. Instead, the approach handles the SQL statement that invokes the table/polymorphic table function as a single cursor.

Abstract: A method in one embodiment comprises receiving at least one query from a client device, and distributing the at least one query to a plurality of query engines, wherein each of the plurality of query engines processes the at least one query and generates a partial query result. The plurality of query engines correspond to respective unique identifiers, and the partial query results each include the unique identifier of the query engine that generated the partial query result. The method also comprises determining whether the unique identifier of a given query engine is included with more than one partial query result generated in response to the at least one query, and identifying an error in response to an affirmative determination.

Abstract: Search systems and methods for searching structured data and enhancing the relevancy of search results provided to a requesting user or application. Enhanced search results are provided by searching a cache of a user's most recently used items to eliminate or reduce search indexing latency. Also, more relevant search results are provided by re-ranking results based on use history, data security models and/or hierarchical user role models. Further, enhanced search results are provided by including user information in the search index.

Abstract: Systems and techniques for leveraging query executions to improve index recommendations are described herein. In an example, a machine learning model is adapted to receive a first query plan and a second query plan for performing a query with a database, where the first query plan is different from the second query plan. The machine learning model may be further adapted to determine execution cost efficiency between the first query plan and the second query plan. The machine learning model is trained using relative execution cost comparisons between a set of pairs of query plans for the database. The machine learning model is further adapted to output a ranking of the first query plan and second query plan, where the first query plan and second query plan are ranked based on execution cost efficiency.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for selecting content items for presentation along with publisher resources. In one aspect, a method includes receiving a request for a content item for presentation at a user device with a publisher resource; receiving, from a content item provider a first selection value for each of a plurality of content items provided by the content item provider; determining, for each of the content items and using accessed distribution parameters, a second selection value distinct from the first selection value; and determining, for each of the content items and independent of a bid corresponding to the content item, a combined selection value based on the first selection value for the content item and the second selection value for the content item.

Abstract: In accordance with an embodiment, described herein is a system and method for mining playlist data, for use in providing advertisement-supported media content or targeted advertisements. A media server provides media content items as one or more media streams. Each of a plurality of playlists is associated with theme words provided by a title and/or description of the playlist. A playlist can also be associated with one or more theme words associated with the at least one media content item included in the playlist based on inclusion of the at least one media content item in the playlist. A dataset of media content item-theme word pairs provides an association of a particular media content item included in a particular playlist, with a theme word associated with that playlist. A score is assigned to each of the media content item-theme word pairs based on their appearances across several playlists.

Abstract: Described are methods, systems and computer readable media for computer data distribution architecture connecting an update propagation graph through multiple remote query processors.

Abstract: A query that requests a filter attribute is received by a database server from a remote application server that is associated with at least one calculation scenario that includes calculation nodes having relational operators and calculation nodes having non-relational operators. The calculation nodes having relational or non-relational operators are optimized by a calculation engine model optimizer and the calculation nodes having relational operators are further optimized by a relational database optimizer. Thereafter, the operations defined by the optimized calculation nodes can be executed to result in a responsive data set. Next, the data set is provided to the application server by the database server.

Abstract: According to one aspect, a distributed database system is configured to manage multi-writer operations on a distributed database by implementing one or more catamorphic database operators. Catamorphic operators can be architected on the system, and executed with little or no reconciliation logic. Catamorphic operators define sets of catamorphic operations and respective execution logic where the order of execution of catamorphic operations is not relevant to a final result.

Abstract: A computer-implemented method for automatically reviewing structured query language (SQL) statements comprises the steps of receiving SQL code from a user seeking to access a database, parsing the SQL code to retrieve SQL keywords, mathematical operators, and logical operators, applying a complexity score calculation algorithm to the parsed code, calculating a complexity score, and executing the SQL code on a computing system which stores the database if the complexity score is less than or equal to a threshold. On the other hand, if the complexity score is greater than the threshold, the SQL code may be flagged to be rewritten.

Abstract: The present disclosure relates to processing operations that assess the impact of data invalidations and manage remediation of the data invalidations based on results of an assessment of the impact of the data invalidation on operation of an application/service. Identified data invalidations may be aggregated and analyzed. In one non-limiting example, types of data invalidations are aggregated over a temporal count to identify recent data invalidations. Analysis of aggregated types of data invalidations comprises evaluating an intensity of the types of data invalidations identified within the temporal count. Identified data invalidations may be ranked based on intensity analysis identifying impact on presentation of content through an application/service during the temporal count. Remediation of data invalidations may be managed based on the ranking processing.

Abstract: Technologies are described for adaptive selection of user to database mapping. An impact to processing resources by a user of a database managed by the processing resources may be predicted using criteria based on user-database properties such as a number of rows in database, a number of rows in database for the user, a maximum depth of hierarchy for the user, a maximum breadth of hierarchy for the user, applications that have recently accessed the user's data, distribution of quota types in the user's data, a number of shared items in the user's hierarchy, a number of people who share in the user's shared item hierarchy, an application employed by the user to access the data currently, etc. Based on a model for the predicted impact, a behavior change (for any of the criteria) and/or a move of the user to another database may be suggested/automatically implemented.

Abstract: To improve the user experience, browse nodes for popular combinations of categories and aspects are desirable. When a particular combination of category and aspects is found to have been requested at a frequency that exceeds a threshold, the existence of a browse node for that combination is checked and, if the browse node is missing, a request to create the browse node is generated. In some example embodiments, an entire set of missing browse nodes is generated based on recognition of a pattern of category and aspect combinations being requested.

Abstract: Example implementations relate to optimized queries based on unique attributes. For example, a computing device may include a processor. The processor may receive a query and identify at least one unique attribute based on at least one operation specified in the query or based on an attribute property associated with at least one relational table relevant to the query, the attribute property indicating uniqueness. The processor may modify a data structure representing the query, the data structure having nodes each associated with a respective relational table and the data structure modified to specify a subset of the nodes that are associated with the at least one unique attribute. The processor may optimize the query based on the data structure modified to specify the subset.

Abstract: A knowledge graph virtualization system (KGVS) implements data virtualization techniques using semantic knowledge when parsing a knowledge graph to return results to a query. The data virtualization using semantic knowledge enable end users and applications to describe desired output without detailed knowledge of underlying data storage, schema, and relationships.

Abstract: A method for unsupervised transformation of denormalized data into RDF data includes summarizing an existing resource description framework (RDF) file wherein a data summary file is produced, wherein said RDF file includes a plurality of nodes, property labels, and literals and is represented as a directed graph, and said data summary file is a graph that includes a single instance of each node-property-literal triple in the RDF file; analyzing a plurality of denormalized records wherein a record summary is produced, wherein said record summary is represented as a directed graph with a root node corresponding to each record connected to a node for each field in the record; determining one or more transformation patterns that match elements of the record summary to elements of the data summary; and transforming the plurality of denormalized records into a new RDF file by executing one of the one or more transformation patterns.

Abstract: Disclosed are various embodiments for optimizing automated data entry by recognizing invalid data items and providing alternatives. An electronic form that requests a plurality of data items is received. The data items are automatically provided to the electronic form using stored data and/or automatically generated data. It is automatically detected that a particular data item is deemed invalid for the electronic form. In various embodiments, a suggestion for providing a valid data item may be extracted from the electronic form. An alternative data item is then automatically provided to the electronic form in place of the particular data item based at least in part on the suggestion.

Abstract: Techniques are provided for implementing a file system format for persistent memory. A node, with persistent memory, receives an operation associated with a file identifier and file system instance information. A list of file system info objects are evaluated to identify a file system info object matching the file system instance information. An inofile, identified by the file system info object as being associated with inodes of files within an instance of the file system targeted by the operation, is traversed to identify an inode matching the file identifier. If the inode has an indicator that the file is tiered into the persistent memory, then the inode it utilized to facilitate execution of the operation upon the persistent memory. Otherwise, the operation is routed to a storage file system tier for execution by a storage file system upon storage associated with the node.

Abstract: Embodiments relate to an eigenvalue-based data query. An aspect includes receiving a query request that includes a query statement. Another aspect includes calculating eigenvalues of key component elements in the query statement. Another aspect includes matching eigenvalues of nodes in an execution plan of a historical query statement to the eigenvalues of the key component elements. Yet another aspect includes based on determining success of matching the eigenvalues of the key component elements to the eigenvalues of the nodes in an execution plan of the historical query statement, generating an execution plan of the query statement.

Abstract: Methods and apparatuses are described for system for identifying and mitigating high-risk database queries through ranked variance analysis. A server identifies database queries executed against databases in a production computing environment within a predetermined time period, each database query associated with execution plans and each execution plan having corresponding plan data elements. For each database query: the server generates execution variance data for the execution plans for a database query based upon the corresponding plan data elements, comprising: determining an execution time variance between the execution plans; and determining a buffer gets variance between the execution plans. The server ranks the database queries according to (i) the execution time variance, and (ii) the buffer gets variance.

Abstract: In a blockchain transaction acceleration system, access is provided to a multiple blockchain acceleration network accessible to a plurality of blockchains, where the multiple blockchain acceleration network includes a plurality of acceleration nodes, each acceleration node accessible to at least one node in at least one blockchain of the plurality of blockchains. A transaction to be forwarded is received at a first acceleration node from a first node in a first blockchain of the plurality of blockchains. The transaction is forwarded by the first acceleration node to a second node.