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: 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: 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: 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: 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: Described are methods, systems and computer readable media for computer data distribution architecture connecting an update propagation graph through multiple remote query processors.

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: 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 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: 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: 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: 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: 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 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: 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: 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.

Abstract: Embodiments relate to cube construction. According to a method, a plurality of valid history queries that request to retrieve a cube comprising a first number of cuboids in an On-Line Analytical Processing (OLAP) system are collected. A plurality of dimension combinations is acquired from the plurality of valid history queries. A query frequency of each cuboid of a second number of cuboids with the plurality of dimension combinations is determined, the second number of cuboids being a subset of the first number of cuboids. A cuboid construction sequence for the second number of cuboids is determined based on the query frequency. The cube is constructed based on the cuboid construction sequence.

Abstract: Various embodiments describe techniques for retrieving query results for natural language procedural queries. A query answering (QA) system generates a structured semantic representation of a natural language query. The structured semantic representation includes terms in the natural language query and the relationship between the terms. The QA system retrieves a set of candidate query results for the natural language query from a repository, generates a structured semantic representation for each candidate query result, and determines a match score between the natural language query and each respective candidate query result based on the similarity between the structured semantic representations for the natural language query and each respective candidate query result. A candidate query result having the highest match score is selected as the query result for the natural language query. In some embodiments, paraphrasing rules are generated from user interaction data and are used to determine the match score.

Abstract: A management system of a storage system specifies a matching rate between an occurred fault and each of one or more registered faults on the basis of fault analysis information which is information indicating, for each fault, a relation between a fault in the storage system and a fault detail including knowledge base information. Each of the one or more registered faults is a fault in which the information is registered in the fault analysis information. The management system displays information related to the registered fault including the specified matching rate with respect to each of the one or more registered faults.

Abstract: An exemplary query parsing system accesses user input text representative of a search query. The system generates a plurality of candidate parses of the user input text. Each of the plurality of candidate parses includes a candidate what portion and a candidate where portion determined from the user input text. The system generates a score for each candidate parse in the plurality of candidate parses based on whether one or more of a plurality of predefined parsing features are found in the respective candidate parse and on a machine learning mode. The system selects, from the plurality of candidate parses based on the scores for the plurality of candidate parses, the candidate what portion and the candidate where portion of a particular candidate parse included in the plurality of candidate parses as search parameters for the search query. Corresponding methods and systems are also disclosed.

Abstract: Disclosed are systems, computer-readable mediums, and methods for managing input-output operations within a system including at least one client and a storage system. A processor receives information regarding allocated input-output operations (IOPS) associated with a client accessing a storage system storing client data. The information includes a number of allocated total IOPS, a number of allocated read IOPS, and a number of allocated write IOPS. The processor also receives a requested number of write IOPS associated with the at least one client's request to write to the storage system. The processor determines a target write IOPS based on the number of allocated total IOPS, the number of allocated write IOPS and the requested number of write IOPS, and executes the determined target write IOPS within the first time period.

Abstract: There is provided an information processing apparatus including an acquiring unit and a presenting unit. The acquiring unit acquires at least one character being input and user information. The presenting unit searches among pieces of suggest information for a keyword including the at least one character acquired by the acquiring unit, and the pieces of suggest information are generated or updated by using pieces of document information registered in advance for each operation. The presenting unit prioritizes a piece of suggest information including a keyword that relates to an operation associated in advance with the user information. The presenting unit presents the piece of suggest information thus prioritized.

Abstract: Methods and systems for identifying a meaning of an ambiguous term in a natural language query. The media guidance application isolates first and second terms from a query received from a user and identifies, in a knowledge graph, first and second pluralities of candidate components associated with the first and second terms. The first and second terms each having multiple candidate components indicates the first and second terms have ambiguous meanings. The media guidance application matches each candidate component of the first and second pluralities of candidate components to form a plurality of pairs and determines strength of association for each pair in the plurality of pairs. The media guidance application filters the plurality of pairs by strength of association for each pair and determines a plurality of possible meanings based on the filtered plurality of pairs. The media guidance application selects a meaning from the plurality of possible meanings.

Abstract: Selectively populating a cache preemptively based on data quality is provided. A set of fields corresponding to a request to analyze data for caching is obtained. A data quality measurement is calculated for fields in the set of fields corresponding to the request based on characteristics of the data in the set of fields. An aggregate data quality for a combination of fields in the set of fields is derived based on aggregation of the data quality measurement of each respective field in the combination. A result of data analysis of the combination of fields in the set of fields corresponding to the request is cached in a local cache based on the aggregate data quality for the combination of fields exceeding a minimum aggregate data quality threshold level.

Abstract: Computer systems, methods and computer readable media storing instructions, for providing news item recommendations are disclosed. An example system includes one or more digital memories having stored therein metadata for a plurality of news items and click data corresponding to user interactions with the plurality of news items, and a processor. The processor is configured to: determine a user profile for a user, the user profile including indications of news items previously clicked on by the user; select candidate news items for recommendation from (a) said news items based upon respective similarity distances to news items included in the user profile or (b) news items included in other user profiles that are identified based upon their respective similarity distances to the user profiles; and score the candidate news items using, at least in part, a temporal aspect of the candidate news items.

Abstract: A smart commenting platform that receives a plurality of content segments from users and extracts important attributes that among the plurality of content segments. The system presents to users multiple content segments and their respective attributes at the same time in a visually engaging manner. The attributes are dynamically weighed and displayed for users to easily review and efficiently provide commentary on. The system is capable of visually linking common attributes which promotes a better understanding of multiple concepts without having to navigate to multiple websites. The system allows users to easily add opinions, comments, and observations to topical matters. The system also allows users to customize the interface to their preference.

Abstract: A system and method for determining optimal query plans within a distributed processing system. The system includes a query optimizer for receiving a query and generating a query plan for execution by the distributed processing system; a repository including statistics related to prior executed query plans; a plan execution engine for receiving and executing the query plan, collecting statistics corresponding to the query plan, and storing the statistics and optimizer usage metadata corresponding to the query plan and prior executed query plans in the repository. The system further includes a statistics advisory tool for mining the metadata to generate a collection of histogram statistics and storing said histogram statistics in the repository. When generating a query plan, the query optimizer searches the statistics repository for statistics, including histogram statistics, useful to the generation of the current query plan and uses selected statistics from the repository to generate the query plan.

Abstract: The present disclosure provides logistic regression gradient calculation methods and apparatuses. One exemplary calculation method comprises: acquiring training data, the training data including X-row user data and Y-row click-through data corresponding to the X-row user data; converting the X-row user data into X-column data; segmenting the X-column data and a weight vector to form N X-column data segmentation blocks and N weight vector segmentation blocks; starting N threads respectively to generate N sub-logistic regression gradients according to the N X-column data segmentation blocks, the N weight vector segmentation blocks, and the corresponding Y-row click-through data; and splicing the N sub-logistic regression gradients to form a full logistic regression gradient.

Abstract: Creating and executing flow plans by performing at least the following: obtaining a run-time flow plan that comprises a trigger, a first operation, and a second operation, wherein the first operation precedes the second operation within the run-time flow plan and one or more input values of the second operation are linked to the first operation, determining whether one or more conditions of the trigger are met, execute the first operation based at least on the determination that the one or more conditions of the trigger are met, monitoring whether the second operation is ready for execution based at least on a determination that the one or more input values of a second action operation are ready, and executing the second action operation when the second action operation has been identified as ready for execution.

Abstract: A method and a system for generating fresh query suggestions includes receiving an indication of at least a portion of a given search query, selecting, based on the indication, a set of query suggestions, each of the query suggestion being associated with a frequency of use of a first scale, acquiring a set of fresh query suggestions, each of the fresh query suggestions being associated with a frequency of use of a second scale, scaling each frequency of use of the second scale to obtain a frequency of use of the first scale, merging the set of query suggestions and the set of fresh query suggestions to generate an amalgamated suggestions set, and generating a subset of ranked query suggestions for displaying on a device based on the amalgamated suggestions set, a given query suggestion of the subset being one of a fresh query suggestion and a query suggestion.

Abstract: Described herein is a top operator of a calculation scenario of a calculation engine that can process and rank data according to certain logical criterion requested in a query. Based on the ranked data, the top operator can provide the data results in response to the query. The top operator can provide additional useful data in the data results when certain conditions are met. The top operator can provide the data results in a useful and efficient manner.

Abstract: A database query to be run against a database is received by a processor. The query includes a query predicate. The query predicate includes a condition. The condition applies to a single database table. The condition is parsed to create an input vector. The input vector is submitted to a neural network. The neural network is trained to calculate the selectivity, a number of unique values (NUV) of results of applying predicates to the single database table, and a high mode frequency (HMF) of results of applying predicates to the single database table. The neural network determines the selectivity of the query predicate, an NUV for each column in the result of applying the query predicate to the single database table, and an HMF for each column in the result of applying the query predicate to the single database table.

Abstract: A query system identifies a collection of discovered entity bins each comprising unstructured documents with mentions of a name element from a name query and each identified with a particular named entity identifiable from the name element. The query system identifies, from a knowledge base of structured documents, based on identifier components with the name element, candidate records identifying the respective identifier components with the name element, the one or more identifier components identified among the discovery entity bins. For each respective selection of candidate records associated with each bin, the query system applies one or more alignment threshold rules to rank the likelihood that each candidate record within each respective selection matches one or more characteristics of the respective discovery entity bin.

Abstract: An exemplary computer implemented method for processing data in a database management system implemented on a network of two or more nodes is disclosed. The method includes receiving a query referencing first and second user-defined table functions and a table distributed across the two or more nodes. The first user-defined table function is executed on each of the two or more nodes by processing records of the table residing on the respective nodes. A data sample is generated per node as a result of executing the first user-defined table function on each of the two or more nodes. The generated data samples are stored in a selected set of nodes. The second user-defined table function is executed on each of the selected set of nodes by processing records of the data samples residing on the respective nodes of the selected set of nodes to compute a user-defined aggregate.

Abstract: A system, medium, and method including modifying a graphical view representation of a first table of a set of data, the first table having at least a first column subject to changes in value; modifying a graphical view representation of a second table of a second set of data; determining a query operation of the view representations of the first table and second table; aggregating values of the view representation of the result of the query operation having a same key; determining, based on the aggregated values, values for the first column of the view representation of the first table; and providing an output of the values for the first column of the view representation of the first table, the output values including changed values.

Abstract: Database queries may be performed using resources based on a determined size of the database query. Database query size may be dynamically determined for a database query when the query is received. The database query may be assigned to resources used for database queries of the determined size. In some embodiments, timeouts may be applied to reassign database queries to different resources if the performance of the database query exceeds a timeout threshold.

Abstract: Provided are techniques for supporting a join operation against multiple NoSQL databases. A search request with a field and a value for the field is received, wherein the search request is to be issued against a plurality of database divisions formed from NoSQL databases. A simple database search is performed against a structured index to generate a first result set. An extended database search is performed against a linear database division index to generate a second result set by: identifying a relationship for the field that identifies related fields and identifying documents for the field and the related fields using a linear database division index. The first result set and the second result set are merged to form a merged result set of documents. The documents from the merged result set are displayed in response to the search request.

Abstract: A method and system provide an algebraic database management system (ADBMS) that maintains ADBMS type system. The type system includes an ADBMS type database (ATD) and provides a collection of rules that assign a type to constructs. The ATD is a catalog with each record holding typing information. An interpreter dynamically processes, at execution time, a query (that is syntactically modeled on relational algebra). The interpreter: determines inputs of the query; searches the ATD for a data type of each of the inputs, determines compatibility between each of data types of the inputs based on an operator of the query, determines a resultant of the query and a data type of the resultant (based on the operator of the query), and saves the resultant of the query by adding a new record in the catalog.

Abstract: Embodiments relate to an intelligent computer platform to receive a request for processing against a corpus. The request is analyzed and a lexical answer type (LAT), a first concept relevant to the received request and a second concept related to the identified first concept, are each identified. The LAT, together with the first and second concepts are utilized to create a first cluster and a second cluster. Documents are selectively populated into the clusters based on the respective LAT and concept qualifiers. The clusters are subject to sorting based on relevancy to the received request.

Abstract: Techniques and structures for tuning database queries. Actual statistics associated with data stored are retrieved from at least one memory device. The data is associated with one or more tenants of the multi-tenant database system. The actual statistics include at least one type of statistic maintained for the data. A subset of the actual statistics is selected based on a data trait targeted for optimization. A statistical value is calculated for each actual statistic from the subset of actual statistics across one or more tenants having the data trait targeted for optimization. An optimal query plan is determined based on the original query and the calculated statistical values.