Abstract: Traversing data stored in a relational graph by utilization of probabilistic characteristics associated with the graph nodes is disclosed. When a user submits a request with a graph query, an initial node associated with the graph query is identified. Further, the edge type associated the node is extracted from the graph query. When traversing the graph by following relevant edges from the initial node to new nodes, each new node is queried with the extracted edge type. If the query for the node is negative, then the edges for the particular node are not enumerated. However, if the query for the node is positive, then the edges for the particular node are enumerated for expanding the subgraph. This process continues until the subgraph is expanded to include all relevant nodes. Thus, the computational efficiency is improved by reducing the number of edges that must be traversed when performing graph queries.

Abstract: A multi-tenant database may maintain a plurality of datasets on a memory device that is subject to degraded operation caused by a subset of possible state transitions within the device's memory cells. A storage engine may identify entropy characteristics of datasets, independently of other datasets hosted on the memory, and use the entropy to construct a symbol table that maps from data within the dataset to symbols that may be stored on the memory device with a minimized number of state transitions.

Abstract: Techniques are disclosed for retrieving both data stored in relational form and data stored in XML form responsive to a single XQuery query. The techniques allow applications to retrieve relational data residing in various relational database management systems by using XQuery and XQuery for Java. In one such embodiment, an embeddable serverless computer component implements the techniques, and includes a combination of one or more relational adaptors and a mediator to access relational data and transform it into appropriate XML. The techniques are embeddable, and can be standards-based, database-independent, and operating-system independent. Optimized performance and scalability from desktop to enterprise applications are enabled as the number of users and/or database size increases.

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

Abstract: [Object] To provide a device assisting a user to easily generate, in relation to an issue of interest to the user, a question sentence guaranteed to have an answer of a certain accuracy or higher in a question-answering system. [Solution] A question sentence generating device is used with a question-answering system, and it includes: word receiving means for receiving a word 480 as a source for generating a question sentence; and question sentence generating database 502 comprised of a plurality of entries for generating a question sentence. Each of the plurality of entries has a word as a key and includes an answer sentence pattern co-occurring with the word, used in the question-answering system.

Abstract: There is provided an identification apparatus. A storage unit stores an operation history as a history of an operation executed in at least one information processing apparatus. An acquisition unit acquires malware spread information including information indicating malware. An identification unit identifies, based on the operation history, an intrusion route of the malware indicated by the malware spread information acquired by the acquisition unit, generates at least one piece of malware spread information corresponding to at least one operation included in the intrusion route in the operation history, and identifies, in the operation history, for each of the at least one piece of malware spread information, at least one operation of spreading the malware by setting, as a direct or indirect start point, the malware indicated by the malware spread information.

Abstract: Techniques are described for maintaining an expression statistics store that stores and updates metadata values for query expressions based on the occurrence of those query expressions within queries. In an embodiment, a database server instance receives a database query. In response, the database server instance identifies expressions within the database queries. The database server instance then determines whether an expression statistics store includes an entry for the particular expression. Responsive to determining that the expression statistics store includes an entry for the particular expression, the database server instance updates at least one metadata value in the entry based on the occurrence of the particular expression. Responsive to determining that the expression statistics store does not include an entry for the particular expression, the database server instance adds an entry for the particular expression.

Abstract: An application complementation module may access application data from an application repository, the application data associated with a first application. The data collections of a data service provider (e.g., OData service) used in the first application and at least one navigation used in the first application to navigate between the data collections are determined based on the application data. Service metadata (e.g., Entity Data Model (EDM)) from the data service provider is searched for new navigations between the used data collections that are different from the navigations used in the first application. An application that is complementary (e.g., provides different or complementary navigations) to the first application may then be generated based on the data collections used in the first application and any new navigations between the data collections discovered from the service metadata. A recommendation regarding the generated application may be provided to a user of the first application.

Abstract: Aspects extend to methods, systems, and computer program products for optimally pipelining result sets with fault tolerance in distributed query execution. Distributed computing jobs are optimized by dividing the distributed computing jobs into one or more bubbles for execution. Each bubble can be independently executed, potentially in parallel with other bubbles, when resources to handle the bubble are available. Intra-bubble communication can be streamed between vertices within a bubble. Inter-bubble communication can be stored to durable storage. Bubbles provide a failure boundary for a job graph and re-executing a bubble along with storage of intermediate results in durable storage can be used to recover from failures. When a vertex inside a bubble fails, computation can resume by rescheduling the execution of the failed bubble from the durable inputs for that bubble. Durable storage provides a light-weight failover to handle non-deterministic behavior.

Abstract: A mechanism is provided in a question answering system for categorizing questions. The mechanism clusters documents from a corpus of documents to form a nested structure of clusters of documents. The mechanism records questions answered by question answering system in a database in association with answers returned and answer confidence values. The mechanism maps the questions to the nested structure of clusters of documents to form a nested structure of clusters of questions. The mechanism presents recommended questions based on the nested structure of clusters of questions in a user interface of the question answering system.

Abstract: A system and computer implemented method for execution of aggregation expressions on a distributed non-relational database system is provided. According to one aspect, an aggregation operation may be provided that permits more complex operations using separate collections. For instance, it may be desirable to create a report from one collection using information grouped according to information stored in another collection. Such a capability may be provided within other conventional database systems, however, in a non-relational database system such as NoSQL, the system is not capable of performing server-side joins, such a capability may not be performed without denormalizing the attributes into each object that references it, or by performing application-level joins which is not efficient and leads to unnecessarily complex code within the application that interfaces with the NoSQL database system.

Abstract: Techniques are described herein for grouping of operations in local memory of a processing unit. The techniques involve adding a first operation for a first leaf operator of a query execution plan to a first pipelined group. The query execution plan includes a set of leaf operators and a set of non-leaf operators. Each leaf operator of the set of one or more leaf operators has a respective parent non-leaf operator and each non-leaf operator has one or more child operators from among the set of leaf operators or others of the set of non-leaf operators. The techniques further involve determining a memory requirement of executing the first operation for the first leaf operator and executing a second operation for the respective parent non-leaf operator of the first leaf operator. The output of the first operation is input to the second operation. The techniques further involve determining whether the memory requirement is satisfied by an amount of local memory.

Abstract: System and method for computing critical data of multiple entities is provided. Elements, from a set of predetermined elements, are assigned to sentences of a first dataset associated with an entity of an industry type. Predetermined elements characterize reputation of entities of various industries. Features determined from sentences of first dataset are categorized into groups. Features of a new dataset of a different entity of said industry type are matched with grouped features and same groups are allotted thereto. Classification rules are applied on matched features. Elements are assigned to sentences of new dataset based on allotted groups, which elements are same as those assigned to first dataset. Reputation scores are generated for said entities by determining positive and negative sentiments from the first and new dataset. Steps of assigning elements and grouping are repeated for datasets associated with entities of different industry types for creating a taxonomy for them.

Abstract: One or more systems and/or methods for determining a query date range and/or searching a content corpus are provided. A set of content items (e.g., digital images, videos, etc.), associated with an event, may be identified from a content corpus. The set of content items may be evaluated to identify temporal features (e.g., digital time stamps) for the set of content items. A query date range for the event may be determined based upon the temporal features (e.g., users may capture photos that are related to Christmas from December 4th to December 27th). In an example, responsive to receiving a search query, associated with the event, the search query may be adjusted based upon the query date range to create an adjusted search query. The content corpus may be searched using the adjusted search query to create search query results for the search query.

Abstract: A social network post subject area of a social network post is identified using text analysis. A longevity of social network posts related to the social network post subject area on each of multiple hosting platforms is determined using monitored multi-platform post-longevity information. A hosting platform with a determined highest longevity of the related social network posts is recommended from among the multiple hosting platforms. Responsive to user approval of the recommended hosting platform, the social network post is posted to the recommended hosting platform with the determined highest longevity of the related social network posts.

Abstract: Methods and systems of providing metadata association with videos on a video hosting system on a computer network are provided. Search records associated with search queries directed to the video hosting system are received. Each search record identifies videos that are search results for a search query and indicates view durations that the videos were viewed responsive to the search query. First and second videos competing for views of users are identified from the received search records. The first and second videos each have metadata respectively describing the first and second videos. Search queries directed to the first video are identified from the search records. Search terms associated with the search queries are further identified and compared to the metadata of the second video. Search terms that are not included in the metadata of the second video are identified as metadata improvements to the second video.

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: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for allocating computing resources. In one aspect, a method includes receiving intent data specifying one or more computing services to be hosted by a computing network, requested characteristics of computing resources for use in hosting the computing service, and a priority value for each requested characteristic. A budget constraint is identified for each computing service. Available resources data is identified that specifies a set of available computing resources. A resource allocation problem for allocating computing resources for the one or more computing resources is generated based on the intent data, each budget constraint, and the available resources data. At least a portion of the set of computing resources is allocated for the one or more computing services based on results of evaluating the resource allocation problem to meet a particular resource allocation objective.

Abstract: A system includes determination of a match between a first table column of a plurality of table columns of database tables and a second table column of the plurality of table columns, determination, based on stored metadata, of a first data dictionary associated with the first table column and a second data dictionary associated with the second table column, merging of the first data dictionary and the second data dictionary to generate a merged data dictionary, and modification of the stored metadata to associate the first data dictionary with the merged data dictionary and to associate the second data dictionary with the merged data dictionary.

Abstract: A computer-implemented method and system for querying a database that comprises 3D modeled objects that represent mechanical parts. The method or system provides a query that includes a likeness criterion relative to the value of a predetermined shape descriptor for an input 3D modeled object. A next step returns, as results of the query, respective 3D modeled objects of the database based on an extent to which the value of the predetermined shape descriptor for the respective 3D modeled object respects the likeness criterion. The value of the predetermined shape descriptor for a respective 3D modeled object includes a set of axis systems that are trihedral. The likeness increasingly depends on an extent to which sets of axis systems match each other modulo a same similarity transformation. Such a method and system improves the querying of a database that comprises 3D modeled objects that represent mechanical parts.

Abstract: According to an aspect, a system for moving a filter in a query model to ensure query semantics includes a query engine configured to obtain a query model for a query to be executed on a database. The query engine includes a query optimizer configured to instantiate the query model by merging the query with the query model. The query optimizer includes a filter mover configured to move a filter to a point within the instantiated query model such that semantics for the query within the instantiated query model is ensured.

Abstract: A distributed database system can include a plurality of nodes. In order to execute a query at the distributed database system, one or more of the plurality of nodes can perform operations included in an execution plan for the query. A first node of the plurality of nodes can group the plurality of nodes into at least a first cluster. The first node can further select a second node to act as a gateway node for the first cluster. The first node can determine that at least one recipient node of a message is included in the first cluster and route the message to the recipient node by at least sending the message to the second node. Related methods and articles of manufacture are also disclosed.

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: According to some embodiments, a database, containing entries, may be stored across first and second storage medium, entries in the second storage medium being default invisible for online transactional processing. A central software layer processor between the database and an application may identify a subset of the entries stored in the first storage medium as being default visible for online transactional processing, wherein entries stored in the first storage medium that are not within the subset are default invisible for online transactional processing. Note that entries in the first storage medium may be accessible by the application more quickly as compared to entries in the second storage medium.

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