Abstract: Systems, devices, and methods include generating, for at least one search term of a query, a first expanded set of search terms based on at least one related term of the at least one search term obtained from a knowledge base, generating a second expanded set of search terms by applying a statistical model to the search terms of the first expanded set based on terms included in an electronic document corpus stored in an electronic data storage, and generating a third expanded set of search terms based on search terms in the first and second expanded sets. For each search term of the third expanded set, a term score is determined based on occurrence of the search term in the electronic document. The term scores are combined to create a document score for the electronic document.

Abstract: Embodiments for managing resources in a tiered data storage system, by a processor device. In response to differing business priorities for executing workloads by a workload manager, a resource plan is generated by an administrator of the workload manager. The resource plan defines what resources of the storage system are allocated to a particular group of tenants and at what time the workloads of the particular group are executed, thereby optimizing utilization of the resources of the storage system.

Abstract: A system and method are presented for detecting messages relevant to users in a collaborative environment. In a unified collaboration system, large volumes of messages between a plurality of users in a group may be monitored for relevance to a particular user. Analytics may be applied to the content of the messages to determine which of the plurality of users are relevant and should be alerted. Alerts may notify relevant users that there are messages which may require attention. Non-relevant information in messages may also be hidden or filtered for a user. In an embodiment, users and subject matters may be linked together. For example, words in a message may be related to specific sub-topics of a group and may be associated with a user over time based on when the word is used and which users respond.

Abstract: A fleet of query accelerator nodes is established for a data store. A particular node stores a binary encoding of a data item in a local data cache. The encoding identifies a metadata record indicating names of attributes of the data item. In response to receiving a particular query directed to the data item, an executable code component generated to produce a result for the query is cached in a local query code cache. When a second query which meets a matching criterion is received, the executable code component is re-used to obtain a result for the second query.

Abstract: A travel search engine enables a user to share his or her search results with one or more other users in real time. Each of the users has a common set of search results and any user can select share a specific result within the common set. The remaining results in the common set can be independently filtered and sorted. By selectively sharing various ones of the search results, while being able to separately manipulate the remaining search results, users have access to a common set of potentially mutually acceptable results, but can still individually explore the search results by filtering along different criteria.

Abstract: Natural language system question classifier, semantic representations, and logical form template techniques and systems are described. In one or more implementations, a natural language input is classified as corresponding to respective ones of a plurality of classes of questions. A semantic intent of the natural language input is extracted as a semantic entity and a semantic representation. Question classification labels that classify the question included in the natural language input is then used to select at least one of a plurality of logical form templates. The semantic intent that is extracted from the natural language input is then used to fill in the selected logical form templates, such as to fill in entity, subject, predicate, and object slots using the semantic entity and semantic representation. The filled-in logical form template is then mapped to form a database query that is then executed to query a database to answer the question.

Abstract: An approach for joining operations on document-oriented databases. The approach consists of receiving database identifiers, common attributes and results attributes for core and target databases being joined. Common attributes are searched for in the databases. The searches performed include string, expansive, character and nested. Common attribute join conflicts are identified and input is received to resolve attribute join conflicts. Resolved join conflicts are updated in a join substitution database for subsequent use and joined data results are output to virtual table(s).

Abstract: According to an example, database constraint generation may include receiving data related to a table in a database, analyzing the data to determine a row count for a column of the table, and analyzing the data to determine a number of distinct values for the column of the table. A comparison value may be determined by comparing the row count to the number of distinct values. The database constraint generation may further include determining if the comparison value is within a threshold. If the comparison value is within the threshold, an annotation may be added to the column of the table such that the column is considered unique during a cardinality estimation process involving the table.

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: Performance thresholds are defined for operators in a flow graph for a streaming application. A streams manager deploys the flow graph to one or more virtual machines (VMs). The performance of each portion of the flow graph on each VM is monitored. A VM is selected. When the performance of the portion of the flow graph in the selected VM does not satisfy the defined performance threshold(s), a determination is made regarding whether the portion of the flow graph is underperforming or overperforming. When the portion of the flow graph is underperforming, the portion of the flow graph is split into multiple portions that are implemented on multiple VMs. When the portion of the flow graph is overperforming, a determination is made of whether a neighbor VM is also overperforming. When a neighbor VM is also overperforming, the two VMs may be coalesced into a single VM.

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 plurality of histograms are maintained with respect to a dataset. The dataset includes a plurality of data segments. In response to a query that includes a plurality of conditions ordered in an initial sequence, a plurality of corresponding rejection rates is determined for the plurality of conditions based at least in part on the plurality of histograms. The plurality of conditions are re-ordered according to the plurality of corresponding rejection rates associated with the plurality of conditions to form a reordered sequence for the plurality of conditions. The query is executed according to the reordered sequence of the plurality of conditions.

Abstract: One or more techniques and/or systems are provided for query suggestion formulation for multi-source queries, for ranking multi-source search results, and/or for exposing contextual launch functionality through multi-source search results of a multi-source search interface. In an example, a query suggestion may be provided for a partial search query based upon an implied content source that corresponds to a search intent of a user (e.g., an intent to view videos, as opposed to images, of houses). In another example, relevancy ranks may be assigned to content sources based upon a content type preference of a user, and search results may be provided from content sources having relevancy rankings above a relevancy threshold. In another example, links to applications and/or execution contexts may be embedded within search results so that applications may be launched into contextually aware states from the search results.

Abstract: A method, apparatus and computer program product are therefore provided for implementing requests for data using independent data objects. In this regard, the method, apparatus and computer program may receive a request for set of data. The request may include an identifier for the particular set of data. The method may further determine a structure of the set of data using an attribute table associated with one or more data objects, and generate a query using the determined structure of the set of data. The generated query may be executed to retrieve a set of data responsive to the request. The retrieved data may be used along with the determined structure to provide a response to the request.

Abstract: An apparatus and method for storing data traffic on a flow basis. The apparatus for storing data traffic on a flow basis includes a packet storage unit, a flow generation unit, and a metadata generation unit. The packet storage unit receives packets corresponding to data traffic, and temporarily stores the packets using queues. The flow generation unit generates flows by grouping the packets by means of a hash function using information about each of the packets as input, and to store the flows. The metadata generation unit generates metadata and index data corresponding to each of the flows, and stores the metadata and the index data.

Abstract: A computer-implemented method includes receiving an artifact and a problem pattern, transforming the artifact into an abstracted artifact structure, and transforming the problem pattern into a query. The query is matched against the abstracted artifact structure. Any matched portions of the abstracted artifact structure are related back to corresponding result portions of the artifact. The corresponding result portions of the artifact are returned. The method may be embodied in a corresponding computer system or computer program product.

Abstract: A computer-implemented method includes receiving an artifact and a problem pattern, transforming the artifact into an abstracted artifact structure, and transforming the problem pattern into a query. The query is matched against the abstracted artifact structure. Any matched portions of the abstracted artifact structure are related back to corresponding result portions of the artifact. The corresponding result portions of the artifact are returned. The method may be embodied in a corresponding computer system or computer program product.

Abstract: A computer maps a literal in a database query to a digital representation, wherein the database query comprises a predicate, the literal is a part of the predicate, and the digital representation is predetermined based at least in part on external statistical data. The computer estimates a filter factor for the predicate based at least in part on the digital representation and compressed statistical data, wherein the compressed statistical data are prepared at least in part from the external statistical data.

Abstract: A computer maps a literal in a database query to a digital representation, wherein the database query comprises a predicate, the literal is a part of the predicate, and the digital representation is predetermined based at least in part on external statistical data. The computer estimates a filter factor for the predicate based at least in part on the digital representation and compressed statistical data, wherein the compressed statistical data are prepared at least in part from the external statistical data.

Abstract: Methods, apparatus, and computer-readable media are provided for generating and applying data extraction templates. In various implementations, a corpus of structured communications such as emails may be grouped into clusters based on one or more similarities between the structured communications. A set of structural paths may be identified from structured communications of a particular cluster. One or more structural paths of the set may be classified as transient wherein a count of occurrences of one or more associated segments of text across the particular cluster satisfies a criterion. One or more transient paths may be assigned a semantic data type and/or a confidentiality designation based on various signals. A data extraction template may be generated to extract, from subsequent structured communications, segments of text associated with transient (and in some cases, non-confidential) structural paths.

Abstract: Techniques herein optimize subgraph pattern matching. A computer receives a graph vertex array and a graph edge array. Each vertex and each edge has labels. The computer stores an array of index entries and an array of edge label sets. Each index entry corresponds to a respective vertex originating an edge and associates an offset of the edge with an offset of the respective vertex. Each edge label set contains labels of a respective edge. The computer selects a candidate subset of edges originating at a current vertex. The edge labels of each candidate edge of the candidate subset include a same particular query edge labels. The computer selects the candidate subset based on the index array and afterwards selects a result subset of vertices from among the terminating vertices of the candidate edges. The labels of each vertex of the result subset include a same particular query vertex labels.

Abstract: A system and method for processing a group and aggregate query on a relation are disclosed. A database system determines whether assistance of a heterogeneous system (HS) of compute nodes is beneficial in performing the query. Assuming that the relation has been partitioned and loaded into the HS, the database system determines, in a compile phase, whether the HS has the functional capabilities to assist, and whether the cost and benefit favor performing the operation with the assistance of the HS. If the cost and benefit favor using the assistance of the HS, then the system enters the execution phase. The database system starts, in the execution phase, an optimal number of parallel processes to produce and consume the results from the compute nodes of the HS. After any needed transaction consistency checks, the results of the query are returned by the database system.

Abstract: A query that requests a filter attribute is received by a database server from a remote application server that is associated with a calculation scenario that defines a data flow model including one or more calculation nodes. Subsequently, the database server instantiates the calculation scenario. As part of the instantiation, the calculation scenario is optimized by (i) pushing down a filter attribute from a first node to a lowest available child node, (ii) removing the filter attribute from the first node, and (iii) removing non-required join-attributes from the instantiated calculation scenarios. Thereafter, the operations defined by the calculation nodes of the instantiated calculation scenario 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: Structures and protocols are presented for facilitating a search partly based on a movement status of a search-capable device or on a position of a person's limb or on an association with another search-capable device.

Abstract: The present disclosure provides systems and methods that enable an autonomous vehicle motion planning system to learn to generate motion plans that mimic human driving behavior. In particular, the present disclosure provides a framework that enables automatic tuning of cost function gains included in one or more cost functions employed by the autonomous vehicle motion planning system.

Abstract: Various embodiments can include systems, methods, and non-transitory computer readable media configured to receive at least one operation to be performed using (i) first data that is managed by a first computing system and (ii) second data that is managed by a second computing system, the operation being received through an interface provided by the computing system, and wherein the operation is based at least in part on a Structured Query Language (SQL). At least one optimization can be performed based at least in part on the operation. The operation can be executed using at least the first data and the second data. A result generated can be provided upon executing the operation through the interface provided by the computing system. The computing system, the first computing system, and the second computing system are each able to concurrently process, access, and create at least a portion of the generated result.

Abstract: A computer-implemented method of estimating selectivity of a query may include generating, for data stored in a database in a memory, a one-dimensional value distribution for each of a plurality of attributes of the data. A multidimensional histogram may be generated, wherein the multidimensional histogram includes the one-dimensional value distributions for the plurality of attributes of the data. The multidimensional histogram may be converted to a one-dimensional histogram by assigning each bucket of the multidimensional histogram to corresponding buckets of the one-dimensional histogram and ordering the corresponding buckets according to a space-filling curve. One or more bucket ranges of the one-dimensional histogram may be determined by mapping the query conditions on the one-dimensional histogram. The selectivity of the query may be estimated by estimating how many data values in the one or more bucket ranges will meet the query conditions.

Abstract: A computer-implemented method of estimating selectivity of a query may include generating, for data stored in a database in a memory, a one-dimensional value distribution for each of a plurality of attributes of the data. A multidimensional histogram may be generated, wherein the multidimensional histogram includes the one-dimensional value distributions for the plurality of attributes of the data. The multidimensional histogram may be converted to a one-dimensional histogram by assigning each bucket of the multidimensional histogram to corresponding buckets of the one-dimensional histogram and ordering the corresponding buckets according to a space-filling curve. One or more bucket ranges of the one-dimensional histogram may be determined by mapping the query conditions on the one-dimensional histogram. The selectivity of the query may be estimated by estimating how many data values in the one or more bucket ranges will meet the query conditions.

Abstract: A technique relates to flash-optimized data layout of a dataset for queries. Selection columns are stored in flash memory according to a selection optimized layout, where the selection optimized layout is configured to optimize predicate matching and data skipping. The selection optimized layout, for each selection column, is formed by storing a selection column dictionary filled with unique data values in a given selection column, where the unique data values are stored in sorted order in the selection column dictionary. Row position designations are stored corresponding to each row position that the unique data values are present within the given selection column, without duplicating storage of any of the unique data values that occur more than once in the given selection column.

Abstract: Disclosed aspects relate to query hint learning in a database management system. A hint in a first query is detected by the database management system. The first query has a first signature. A second query is received by the database management system. The second query has a second signature. A determination is made by the database management system that the second signature correlates with the first signature. A query plan is established by the database management system. The query plan is based on the second query and uses the hint in the first query. In response to receiving the second query, the database management system processes the query plan.

Abstract: Disclosed aspects relate to query hint learning in a database management system. A hint in a first query is detected by the database management system. The first query has a first signature. A second query is received by the database management system. The second query has a second signature. A determination is made by the database management system that the second signature correlates with the first signature. A query plan is established by the database management system. The query plan is based on the second query and uses the hint in the first query. In response to receiving the second query, the database management system processes the query plan.

Abstract: A dynamic split node defined within a calculation model can receive data being operated on by a calculation plan generated based on the calculation model. A partition specification can be applied to one or more reference columns in a table containing at least some of the received data. The applying can cause the table to be split such that a plurality of records in the table are partitioned according to the partition specification. A separate processing path can be set for each partition, and execution of the calculation plan can continue using the separate processing paths, each of which can be assigned to a processing node of a plurality of available processing nodes.

Abstract: A music playlist may be generated based on images selected by a user on a computing device. For example, by using image classification and machine learning, image descriptors may automatically be associated with an image and the assigned image descriptors mapped to music descriptors associated with songs. Songs associated with the mapped music descriptors are identified and assembled in a playlist sent to the user's device. Additional images may be identified, for example based on the image descriptors of the selected images and the music descriptors, to identify images to display during playback of the playlist.

Abstract: Embodiments described herein provide approaches for presenting browser content to a user. Specifically, a way for customizing content having an informational topic provided in a web browsing experience is provided. Content having the informational topic to be displayed to a user in a web browsing experience is analyzed, with the user being a member of the online community. The web browsing experience is customized based on extracted browsing behaviors of an online community. Content is displayed to the user at a level of detail and technological depth that is commensurate with a knowledge level of one or more members of the online community while hiding other content.

Abstract: Systems, methods, and apparatuses for tracking trends at an online presence are described. In some embodiments, an interactivity data structure and a tenured interactivity data structure are utilized in determining trends quickly.

Abstract: A stream computing application may be configured to manage the flow of tuples through a section of an operator graph. A window may be generated over one or more stream operators. The window may include breakpoint thresholds that set the maximum flow of tuples within the window. The stream operators within the window may be monitored to determine the flow of tuples occurring within the window using tuple flow counts. The tuple flow counts may be compared to the breakpoint thresholds to determine whether a breakpoint condition has occurred. If a breakpoint condition has occurred, a tuple flow change may be implemented to reduce the flow of tuples within the window.

Abstract: A method, apparatus, and stored instructions are provided for transforming an initial query by eliminating a subquery nested within the initial query. The initial query may include an outer query that references a first instance of a particular data object. The initial query may also include set operator(s). At least a particular set operator may include a particular subquery that references a different instance of the particular data object. A query processor may transform the initial query to a transformed query that excludes the particular set operator and the particular subquery. The transformed query may instead include an added predicate that is based at least in part on the particular subquery. The added predicate may reference the first instance of the particular data object without referencing the different instance of the particular data object. The transformed query may be used for query execution instead of the initial query.

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: A method for encoding and decoding a javascript object notation (JSON) document utilizing a statistical tree representing a JSON Schema. The encoded statistical tree may be optimized.

Abstract: Dynamically generating a model for a report includes presenting a user with source data by a source application, wherein the source data is available for producing a report. Selections are received from the user indicating portions of the source data to potentially include in the report. In response to receiving the user selections, a computer system builder module generates an analytic processing model for the user selected portions of the source data.

Abstract: A cache arranged between client terminals and at least one server, said cache being configured to receive, from client terminals, requests for at least a first representation of a segment of a multimedia content available in a plurality of representations, comprising: a communication module configured to receiving, in a first period of time, a plurality of requests for a given segment from the client terminals, each request specifying one first representation and at least one alternative representation of said given segment; a module of relevancy configured to determining at least one main relevant requested representation amongst the representations of the requests received during the first period of time; and wherein the communication module is further configured to request said main relevant representation from a remote server.

Abstract: The present disclosure relates to processing read requests to retrieve data from a plurality of data sources. According to one embodiment, an example method includes determining a navigable path of nodes accessed to satisfy a read request based on a graph projection of an application programming interface (API). An API service generates a plurality of subqueries, each subqueries being associated with a node in the navigable path. While traversing the navigable path to satisfy the read request, the API service identifies data associated with lower level nodes that is cached at a data source associated with a current node, replaces subqueries directed to data stored at the current node and the identified data with a single subquery executed against the data source associated with the current node, and executes the single subquery at the current node. The API service returns data accessed during traversal of the navigable path.

Abstract: A method for optimizing an area of a ternary FPRM circuit using population migration algorithm, the method including: 1) establishing an area estimation model of the ternary FPRM circuit; 2) establishing a corresponding relationship between the ternary FPRM circuit and population migration algorithm; 3) setting an attraction function for calculating the attraction of the population location in population migration algorithm; 4) setting relevant parameters of population migration algorithm; and 5) employing population migration algorithm to calculate and obtain the greatest attractive site and the greatest attraction.

Abstract: An input method editor (IME) described herein couples scenarios of the input of the user with specific network services to offer more relevant and richer candidates for higher input productivity. Data relating to a computer application in which the input candidates are to be input and/or context relating to a user-submitted query is collected and analyzed to determine a scenario. The input candidates may include text candidates and rich candidates. The IME may select a scenario-tuned and type specific engine to identify the text candidates and/or rich candidates. The scenario-tuned text candidate engines leverage scenario-tuned language models and lexicons, and the scenario-tuned rich candidate engines leverage scenario-relevant web services, such as image, mapping, and video search, when available and appropriate.

Abstract: Techniques for efficient cursor sharing to enforce fine-grained access control are provided. In one technique, the authorization context of a database statement is stored in (or in association with) a corresponding cursor. The authorization context indicates multiple authorization results, each of which indicates whether a user (or role) associated with the database statement is allowed to access a different data set of multiple data sets that the database statement targets. An authorization context of an incoming database statement may be compared to the authorization context of a cursor in a single comparison to determine whether the authorization contexts match. If so, then the cursor may be shared. In another technique, one or more normalizations are applied to a cursor predicate that is generated based on the authorization context of a database statement. The one or more normalizations may result in removing one or more predicates from the cursor predicate.

Abstract: Disclosed is an exemplary computer program application, system and method for a unified approach to managing data from heterogeneous sources. The system includes a central, semantic data storage basing on a directed labeled graph model, a module for accessing data sources by drawing access and mapping configuration from the data storage and loading the resulting data into the data storage and a unified user interface that treats each graph node in the data storage as a separate term, visualizes and modified the term's context in the data graph using configurable user interface widgets.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media are provided. An example method includes receiving user input in a control, for example, one associated with a search engine. The user input includes a series of input characters that when completed would form a completed user request. The method further includes, while receiving the user input, evaluating the characters to identify completions for the completed request. The method further includes identifying, by one or more processors, a content item associated with the one or more completions and identifying display data associated with the content item for transmission to the user along with one or more completions in response to receiving the user input.

Abstract: When an online system receives a request to present content items to a user, a content selection system included in the online system selects content items for presentation to the user during a latency period from the time the request was received until the time when the content items are sent. A feedback control mechanism communicates with each computing device of the content selection system to determine the latency period of each computing device. The feedback control mechanism also determines a target latency period in which content items are selected. By comparing the latency period of each computing device to the target latency period, an amount of information to be evaluated by each computing device is determined based on whether a computing device's latency period is greater than or less than the target latency period.

Abstract: In a method for determining appropriate runtime environments for execution of a process model, a computer receives a process model. The process model includes a plurality of activities, wherein two activities are linked by a relationship. The computer determines that the two activities linked by a relationship match a process pattern. The computer determines one or more runtime environments for execution of the process model, wherein each of the one or more runtime environments is capable of executing the process pattern.

Abstract: There is disclosed a method and a system for generating a search query completion suggestion. The method comprises receiving at least a portion of a search query and determining a first query component therein. A suggested second query component related to the first query component is generated, the search query completion suggestion containing the first query component and the suggested second query component. A list of potentially banned words is accessed to determine if the first query component matches any of the potentially banned words maintained therein. It is then determined if the potentially banned word is associated with a ban marker or an unban marker. A list of ban or unban markers respectively is accessed to determine if the suggested second query component matches any of the ban or unban markers maintained therein, the search query completion suggestion being generated or not generated accordingly.