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.

Abstract: A class may be determined of a term from a database. The term may be blocked from being presented to a user, if the determined class does not include a permission for the user to view the term. The term may suggest a remainder of an incomplete query input by the user.

Abstract: Systems and methods are provided for parallel processing of datasets with dynamic skew compensation. The disclosed systems and methods may increase the efficiency of dataset processing by imposing maximum size limits on parallel processing environment tasks. The disclosed systems and methods may generate a target partition of a variable, a database storing data elements, a cluster that generates one or more output files based on the target partition and the data elements, and a display device that displays analysis results for the target partition using the one or more output files. Generation may comprise creating a calculation partition, mapping data elements according to the calculation partition, and generating the one or more output files based on the mapped data elements. The calculation partition may depend on a target partition and a uniform partition that partitions values based on one or more of statistical measures and pseudorandom functions.

Abstract: Techniques are provided for machine learning based query optimization for federated databases. An exemplary method comprises obtaining a query to be processed in a federated database; generating at least one predictive data movement instruction to move data to a target data source when the target data source satisfies one or more of a predefined efficiency criteria with respect to a query type of the query and a predefined capacity criteria at an expected execution time of the query; and generating a query execution plan for the query by calculating a cost of execution for a plurality of potential target data sources and selecting a target data source for the query based on the calculated cost of execution. The federated database optionally employs a dynamic federated query schema.

Abstract: A method of authenticating a user of a user device, the method includes receiving a user effort-based identity authentication token from a user device, generating a challenge request, receiving an effort validation response, generated by an effort validation server in response to a user performed requested effort, receiving the effort-based identity authentication token, and authenticating the user as a function of the received validation response and the user effort-based identity authentication token.

Abstract: A computer-implemented method includes identifying a primary database interaction statement and determining one or more intermediate database interaction statements based on the primary database interaction statement. The computer-implemented further includes determining, for each of the one or more intermediate database interaction statements, an intermediate statement transformation indicator. The computer-implemented method further includes determining one or more transformed database interaction statements based on each intermediate statement transformation indicator.

Abstract: The present disclosure is directed to methods, systems and programs for adjusting tagging of files. An illustrative method includes receiving a request to upload at least one document from a user via processor, assigning a first metadata tag via processor to at least one word contained within the at least one document, wherein the first metadata tag identifies the at least one word as an alias for a first unique entity, delivering the at least one document to the user including the first metadata tag via processor, receiving feedback via processor from the user relating to the assignment of the first metadata tag to the at least one word, determining at least one potential adjustment for the assignment of the first metadata tag via processor, sending information to the user proposing the at least one potential adjustment via processor, and receiving confirmation information from the user concerning the potential adjustment.

Abstract: A method is provided. The method comprises accessing (110) a target database (107) comprising at least one table associated with a first concept or property of a reference ontology (101), defining (120) a data source ontology (104) for a data source (102) comprising a dataset, said data source ontology (104) comprising a second concept or property, wherein said second concept or property is different from said first concept or property, and creating (140) a link between said second concept or property and said first concept or property, said link defining to which table of said target database data of said dataset, associated with said second concept or property, is related.

Abstract: A user is associated with the current and preceding query that is associated with a preceding intent. The method comprises: receiving the current query and preceding intent; determining a respective intent-association parameter for each one of the plurality of potential intents based on the current query; determining a respective intent-transition parameter for each one of the plurality of potential intents; determining a respective adjusted intent-association parameter for each one of the plurality of potential intents as a multiplication of the respective intent-association parameter and the respective intent-transition parameter; and selecting one of the plurality of potential intents as the current intent based on the adjusted intent-association parameters.

Abstract: An information processing device allocates each portion of a table used in query processing with respect to a database managed by the information processing device, as a portion under responsibility of each of a plurality of other information processing devices, and instructs the plurality of other information processing devices to perform processing with respect to the portion under responsibility by referring to another synchronized database managed by each of the plurality of other information processing devices.

Abstract: A method and system provides efficient data searches. The method and system include receiving search request data that requests a search to be made and identifying multiple search terms or clauses in the search request data. The method and system includes determining an expected cost in resources for searching each search term. The method and system then searches for each search term in order from least resource intensive to most resource intensive, with each search after the first search being performed only among the results of the previously searched term(s).

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 can include: generating a query execution plan for a query including a plurality of operations that operate on data from a relational database and data from a non-structured query language (NoSQL) database, the generating comprising optimizing the query by: identifying a first operation that operate on data from the relational database and an intermediate result output by a second operation, the second operation outputting the intermediate result by operating on the data from the NoSQL database; and determining a fixed datatype for the intermediate result, an indication of the fixed datatype being included in the query execution plan; and executing, based on the query execution plan, the query, the executing of the query comprising converting the intermediate result to the fixed datatype, the converting enabling the first operation to operate on the intermediate result output by the second operation along with the data from the relational database.

Abstract: The embodiments described in this disclosure comprise improved systems, methods and computer readable media for preconfiguring measures and dimensions in a database analytics application. In one embodiment, the solution described herein can be configured to activate only a subset of the measures from a catalog of measures supported by the database analytics application based on the data the user currently has stored in their database systems. Certain embodiments may be configured to determine (1) when a measure is selectable (i.e., activated) by users based on relevant base information contained in the user data, and (2) when to automatically activate inputs to a measure that has been previously selected.

Abstract: Methods and systems for displaying query status information on a graphical user interface. One system includes an electronic computing device that includes one or more electronic processors communicatively coupled to a touch sensitive display. The one or more electronic processors are configured to read a gesture made on the touch sensitive display, generate a query based on the gesture, and display a displayed gesture on the touch sensitive display. The displayed gesture substantially encloses an area of the touch sensitive display. The one or more electronic processors are further configured to generate a response to the query, configure the area on the touch sensitive display substantially enclosed by the displayed gesture to be a button, receive an input indicating that the button has been touched, and output the response to the query.

Abstract: This disclosure provides a window controller that includes a command-voltage generator that generates a command voltage signal, and a pulse-width-modulated-signal generator that generates a pulse-width-modulated signal based on the command voltage signal. The pulse-width-modulated signal drives an optically-switchable device. The pulse-width-modulated signal comprises a first power component having a first duty cycle and a second power component having a second duty cycle. The first component delivers a first pulse during each active portion of the first duty cycle, and the second component delivers a second pulse during each active portion of the second duty cycle. The first pulses are applied to a first conductive layer and the second pulses are applied to a second conductive layer. The relative durations of the active portions and the relative durations of the first and second pulses are adjusted to result in a change in an effective DC voltage applied across the optically-switchable device.

Abstract: A system for a metadata driven catalog definition includes an interface and a processor. The interface is configured to receive an indication to generate a catalog. The processor is configured to traverse a set of data to generate a set of metadata tags, determine a set of sub-categories, wherein a sub-category of the set of subcategories comprises a group of metadata tags associated with the sub-category, and determine a set of categories. A category of the set of categories comprises a group of sub-categories associated with the category. The processor is also configured to provide the catalog comprising a set of filters for filtering data according to the set of categories and the set of sub-categories.

Abstract: An event historian system receives event data from a client system via a network connection and stores the event data in a block data storage system. An event data block in which to store the received event data is selected based on the time range of the occurrence of the received event data. The received event data is stored in a snapshot within the event data block. Event property data is extracted from the received event data and used to build a plurality of event property index files.

Abstract: In an embodiment, a data storage and retrieval system includes a computing device that configures the computer memory according to an RTree (a type of logic tree) representing a structure of a spreadsheet. The computer memory may be internal to or external to the computing device. In an embodiment, the RTree has a plurality of nodes, at least some of which contain one or more minimum bounding rectangles. Each minimum bounding rectangle (“MBR”) encompasses cells of the spreadsheet from a different one of a plurality of columns of the spreadsheet, but does not encompass cells of any of the other columns of the plurality of columns. A node of the RTree may hold multiple MBRs or a single MBR.

Abstract: A computer-implemented method includes identifying a primary database interaction statement and determining one or more intermediate database interaction statements based on the primary database interaction statement. The computer-implemented further includes determining, for each of the one or more intermediate database interaction statements, an intermediate statement transformation indicator. The computer-implemented method further includes determining one or more transformed database interaction statements based on each intermediate statement transformation indicator. A corresponding computer program product and computer system are also disclosed.

Abstract: Disclosed herein are improved systems, methods, and machine readable media for implementing a service for enriching patient documents using natural language processing and a semantic health taxonomy, among other types of information. Enriched documents may be mined for improved diagnostic coding and health services documentation purposes, for example to identify missed and/or inaccurately coded diagnosis codes and quality gaps.

Abstract: An information processing system includes a processing device communication with an information terminal. The system includes an input unit receiving user input, a display unit, a screen transition unit which decides a screen to be displayed and performs a screen transition based on the input of the input unit and the display unit, a screen transition score calculation unit which calculates a screen transition score for each screen transition, an item database which associates and stores an item name and attribute, an attribute score database which associates and stores the item attribute and an attribute score, an item search unit which searches the item database based on the user's input, and extracts the item attribute, and a score addition unit which adds the screen transition score calculated by the score calculation unit to the attribute score associated with the item attribute extracted by the item search unit.

Abstract: Methods, systems, apparatus, including computer programs encoded on a computer storage medium, for determining whether to execute a query based on a predicted computerized rendering period The method may include actions of receiving a query, determining a set of one or more features based on the query, generating a query vector, providing the query vector to a machine learning model, receiving first data, based on the output of the machine learning model, that is indicative of whether the computerized rendering period associated with the query is likely to satisfy the predetermined threshold, determining based on the first data that the computerized rendering period available for displaying a set of one or more candidate content items that are responsive to the query is not likely to satisfy the predetermined threshold, and determining to not use a search engine to execute the received query.

Abstract: A multi-layer storage class placement stack may generate a token containing storage class placement prescriptions for controlling the placement of stored items within a selection of classes for storage. An input layer of the storage class placement stack may generate time-collated activity data based on historical access data, volume metric data, and/or tagging data. The time-collated activity data may include data groupings using timestamps or other timing indicators. A transformation layer may further process the time-collated activity data to generate defined-period summation data that provides summary detail for defined durations across a period of analysis. The defined-period summation data may be used by a prescriptive engine layer to generate prescriptions for placement of individual stored items by associating the prescriptions with storage identifiers for the individual items.

Abstract: Methods, systems, and computer program products for log-aided automatic query expansion based on model mapping are provided herein. A computer-implemented method includes generating a vector representation for each of multiple words derived from historical user queries, wherein each of said vector representations is based on one or more system logs; generating a vector representation for each of multiple documents in a corpus of documents related to solutions to one or more hardware problems and/or one or more software problems; generating a vector representation for a user query based on the generated vector representation for each of the multiple words derived from the historical user queries; comparing the vector representation for the user query to the vector representation for each of multiple documents in the corpus; and determining one or more documents from the corpus to output in response to the user query based on said comparing.

Abstract: A method may include obtaining, from a user, an initial expression including an operator and an input extracted from a data source. The operator may be applied to the input. The method may further include obtaining, using a contextual mapping data structure, a contextualized expression including the input and the data source. The contextual mapping data structure may include a context corresponding to the user. The method may further include generating a result by evaluating the contextualized expression, obtaining, using a rule table, a validation rule corresponding to the contextualized expression, and triggering an alert in response to applying the validation rule to the result.

Abstract: A system for indexing and searching includes an input interface and a processor. The interface is to receive a request to search for a term. The processor is to determine a search response based at least in part on a security associated with an index field and the term.

Abstract: A method, apparatus, and stored instructions are provided for transforming a query representation by unnesting a predicate condition that is based on whether or not a result exists for a subquery of the predicate condition. An initial query representation is received. The initial query representation represents an initial query that includes an EXISTS-equivalent predicate or a NOT-EXISTS-equivalent predicate and at least one other predicate in a disjunction. The initial query representation is transformed into a semantically equivalent transformed query representation that represents a transformed query. The transformed query includes, instead of the EXISTS-equivalent predicate or a NOT-EXISTS-equivalent predicate, a join operator that references the data object.

Abstract: Recovery support techniques for storage virtualization environments are described. In one embodiment, for example, a method may be performed that comprises defining, by processing circuitry, a storage container comprising one or more logical storage volumes of a logical storage array of a storage system, associating the storage container with a virtual volume (vvol) datastore, identifying metadata for a vvol of the vvol datastore, and writing the metadata for the vvol to the storage system. Other embodiments are described and claimed.

Abstract: One method includes receiving aggregated free-form query information comprising a first section and a second section for requesting data pertaining to a computing system and converting the first section and the second section of the aggregated free-form query information into an original query portion and a contingency query portion for accessing at least one data set. The method further includes accessing, using the original query portion, the at least one data set to obtain result information pertaining to an initial element included in the computing system. The method also includes accessing, using the contingency query portion and the result information returned in response to the original query portion, the at least one data set to obtain information for at least one descendant element or ancestor element related to the initial element included in the result information.

Abstract: The present invention discloses a method and apparatus for querying a nondeterministic graph, which are used to implement quick query of a nondeterministic graph, reduce query complexity, and improve query efficiency. The method comprises receiving a query instruction, where the query instruction is used to query a nondeterministic graph for data that satisfies a query condition; determining two vertices in the nondeterministic graph according to the query instruction; determining all possible paths that use one vertex in the two vertices as a start point and the other vertex as an end point; calculate a probability of a first event or a second event corresponding to each of the paths; and obtaining, according to the probability of the first event or the probability of the second event, a query result corresponding to the query instruction.

Abstract: Aspects extend to methods, systems, and computer program products for clustering streamed or batch data. Aspects of the invention include dynamic clustering and labeling of streamed data and/or batch data, including failures and error logs (user, platform, etc.), latency logs, warning logs, information logs, Virtual Machine (VM) creation data logs, template logs, etc., for use in analysis (e.g., error log analysis). A clustering system can learn from previously identified patterns and use that information to group newer information dynamically as it gets generated. The clustering system can leverage streamed data and/or batch data domain knowledge for preprocessing. In one aspect, a clustering system uses a similarity measure. Based on (e.g., users' configuration of) a similarity threshold, the cluster system (e.g., automatically) assigns/clusters streamed data and/or batch data into groups.

Abstract: Methods, systems, and computer program products are provided for presenting a user interface on a display of a computer system. A presence of a second person in a proximity of a computer system other than a first person using the computer system is determined. A user interface is automatically selected based on the determined presence of the second person. In an absence of the second person, a voice interface is selected. When the second person is present, a text entry interface is selected. The selected user interface is presented to the first person on a display of the computer system.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining query refinements using search data. In one aspect, a method includes receiving a first query and a second query each comprising one or more n-grams for a user session, determining a first set of query refinements for the first query, determining a second set of query refinements from the first set of query refinements, each query refinement in the second set of query refinements including at least one n-gram that is similar to an n-gram from the first query and at least on n-gram that is similar to an n-gram from the second query, scoring each query refinement in the second set of query refinements, selecting a third query from a group consisting of the second set of query refinements and the second query, and providing the third query as input to a search operation.

Abstract: Data, such as product data or airline flight data, is represented using structured data tuples, tables, or as data with related metadata and tags, and stored by a search engine. Partial queries are received by the search engine from a user and are used to generate a dialog between the search engine and the user. The dialog may include suggested query completions for the partial queries that correspond to a schema associated with the data tuples. The suggested query completions may be determined using attribute combinations of attributes and attribute values, or metadata and tags associated with the data tuples, including known synonyms and misspellings. The user may interact with the query completions in the dialog, and the search engine may revise the dialog and the query completions according to the interactions. A user may query data tuples without knowing the schema used by the underlying data structures.

Abstract: New methods of relational database management are described, for example, to enable completion and checking of data in relational databases, including completion of missing foreign key values, to facilitate understanding of data in relational databases, to highlight data that it would be useful to add to a relational database and for other applications. In various embodiments, the schema of a relational database is used to automatically create a probabilistic graphical model that has a structure related to the schema. For example, nodes representing individual rows are linked to rows of other tables according to the database schema. In examples, data in the relational database is used to carry out inference using inference algorithms derived from the probabilistic graphical model. In various examples, inference results, comprising probability distributions each for an individual table cell, are used to fill missing data, highlight errors, and for other purposes.

Abstract: Computer-implemented curriculum creation can include determining, using a processor, inquiries for educational content from data aggregated from a plurality of different users over time, determining, using the processor, topics of the inquiries, and categorizing, using the processor, the inquiries into groups based upon the topics. Computer-implemented curriculum creation may include searching, using the processor, for educational content for a subset of the topics, wherein the topics of the subset are selected based upon a ranking of the topics, and determining, using the processor, whether educational content is available for the topics of the subset based upon results of the searching.

Abstract: Methods and apparatus related to adjusting the ranking of a suggestion for a geographic location based on determining how many of one or more users visited the geographic location after receiving the suggestion. In some implementations the one or more users may belong to first grouping of users and the ranking may be adjusted only for suggestions to the first grouping of users. In some implementations it may be determined if a second grouping of users visited the geographic location after receiving the suggestion. In some implementations a property of the given geographic location may be determined based on a comparison of how many of the second grouping of users visited the given geographic location after receiving the suggestion and how many of the one or more users visited the given geographic location after receiving the suggestion.

Abstract: Systems and methods are disclosed for identifying and managing topical content for websites. In accordance with one implementation, a method is provided for identifying and managing topical content for a website. The method may include determining a set of topics at a first level of popularity, determining a set of topics at a second level of popularity, and discounting the set of topics at the second level of popularity based on the set of topics at the first level of popularity to determine a revised set of topics for the second level of popularity. The method may also include managing the topical content based on the revised set of topics for the second level of popularity.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for disaggregating latent causes for computer system optimization. In one aspect, a method includes accessing a data stream for data values resulting from operations performed by a computer system; providing the data values as input to a data disaggregation machine learning model that generates descriptors of latent causes of the data values; providing the data values and the descriptors of the latent causes of the data values as inputs to a control system model that generates embedded representations of commands to modify the operations performed by the computer system; determining commands to modify the operations performed by the computer system based on the embedded representations of commands to modify the operations performed by the computer system; and providing the commands to the computer system.

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: Selecting a join plan for a query containing a join and a union block includes determining whether to propose a join plan with the join pushed across the union block. A selection is made between a join plan in which the join is not pushed across the union block and any proposed join plan in which the join is pushed across the union block.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for dynamically suggesting answers to questions submitted to a portal of an online service. These mechanisms and methods for dynamically suggesting answers to questions submitted to a portal of an online service can enable embodiments to provide help document suggestions with limited user input. The ability of embodiments to provide help document search term suggestions with limited user input can enable users to quickly and efficiently find useful help documents.

Abstract: Embodiments of the present disclosure are directed to methods, computer program products, computer systems for providing a computing search platform for conducting opinion searches over the Internet concerning aggregated social media electronic messages about public opinions and public sentiments for a wide variety of matrices, such as social media posting of a particular industry over a specified time period, electronic social media posting on the public sentiments, public buzz, and public mood. Methods and systems of the present disclosure are directed to collecting and analyzing unstructured social media messages and correlating with structured entity representations in order to discern amount of interest in (buzz) and feelings about (mood) the real world organizations, people, products, and locations described by those entity representations transforming the data into a readily understandable visual display of the aggregated results on a computer display.

Abstract: Techniques are described for providing a simultaneous, multi-device user experience for one or more users, on computing devices that include different capabilities for data input and/or data output. A user may register multiple devices with a service, and the service may determine capabilities of the devices for data input and data output. During a communication session involving the user and another user, such as a service representative, the service may receive input data collected through one or more devices and/or provide output data to be presented on one or more devices, where such data input and data output is received and provided according to the various input/output capabilities of the various devices. The data input and/or data output may switch from device to device during a session. In some instances, data may be replicated for presentation through multiple devices simultaneously.

Abstract: A method for pushing information includes obtaining information of first commodity including the predetermined characteristic information selected by customers on an e-commerce website; obtaining information of second commodities with the same predetermined characteristic information as that of the first commodity; extracting at least two kinds of predetermined attribute information from each of the second commodities; pushing the information of second commodities with the same predetermined characteristic information as that of the first commodity according to the at least two kinds of predetermined attribute information, to make sure that the pushed information meets customers' requirements.

Abstract: A database is configured to analyze user queries to dynamically partition the database according to a partition scheme. User queries can be rewritten based on the partition scheme so that, in response to queries, partitions including relevant data are read while partitions including irrelevant data can be skipped, reducing latency. Files can be named according to the partition scheme and stored on respective partitions so that low partition management can be implemented by underlying systems. Blocks within files can be sorted and statistics can be determined. The statistics can be used to find and read relevant blocks and skip irrelevant blocks.

Abstract: Embodiments of the present disclosure relate generally to index trimming to improve search results of a large corpus. Some embodiments, prior to receiving, from a user device, a search query of one or more keywords searching for a relevant set of publications in a publication corpus, trim candidate publications from a plurality of candidate publications to generate a trimmed plurality of candidate publications.

Abstract: Techniques are provided for sharing expression evaluation across a database management system and a storage layer. In an embodiment, a computer identifies, in a query execution plan compiled for a query, a plurality of target operators that includes an expression that computes a common value. A storage layer evaluates the expression that computes the common value during a table scan of stored data indicated by the expression. For at least one target operator of the plurality of target operators, the computer modifies a row input of the at least one target operator to add a column to receive an evaluation result comprising the common value from the storage layer. The query execution plan is performed by a database management system and the storage layer.

Abstract: An online system identifies and ranks records using multiple machine learning models in response to a search query. Therefore, the online system can provide selected records that are of the most relevance to a user of a client device that provided the search query. More specifically, the online system applies a first machine learning model that is of low complexity, such as a regression model. Therefore, the first machine learning model can quickly narrow down the large number of records of the online system to a first set of candidate records. The online system analyzes candidate records in the first set by applying a more complex, second machine learning model that more accurately determines records of interest for the user. In various embodiments, the online system can apply subsequent machine learning models of higher complexity for selecting and ranking records for provision to the client device.