Abstract: Methods, systems, and computer program products for analyzing tickets using discourse cues in communication logs are provided herein. A computer-implemented method includes analyzing a plurality of communication logs associated with a query related to an information technology issue to determine one or more discourse relationships between the plurality of communication logs; generating a hierarchical structure representing the plurality of communication logs and the one or more determined discourse relationships; associating the query with one or more classified queries by (i) determining one or more patterns in the hierarchical structure and (ii) comparing the one or more determined patterns to patterns associated with multiple historical hierarchical structures associated with classified queries; and determining one or more information technology issue categories applicable to the query based on said associating.

Abstract: The disclosed subject matter provides methods and systems for presenting previously selected search results to a user. A first previously selected search result may be obtained from a first search provider. The first previously selected search result may be a first result, selected by a user, of a first prior search query executed by the first search provider. A second previously selected search result may be obtained from a second search provider, and the second previously selected search result may be a second result, selected by the user, of a second prior search query executed by the second search provider. Next, the first and second previously selected search results may be presented in an interface associated with a third search provider.

Abstract: Disclosed is a system for predicting an Elapsed Response Time (ERT) of a query to be executed in a production database. The system includes a database emulator module for creating an emulated database based on empty schema derived by extrapolating statistical information from the development environment. The system also includes an execution plan generation module for generating a query execution plan of the query. The system further includes a query classifying module for classifying each sub-query based on the operational parameters into at least one of a full table scan, a primary index scan, a fast index scan and a non-unique index scan. The system also includes a time determination module for executing each sub-query on the emulated database to determine an Input Output (IO) access time and an operator time.

Abstract: Embodiments of the preset disclosure include a method, a system, and a computer program product for rearranging a set of filters within a data streams environment. The method includes setting a first filter ordering of two or more filter processing elements. The method includes determining a filtering efficiency of the first filter ordering. The determining of the filtering efficiency includes monitoring a runtime, one or more tuples, and an amount of tuples retained after filtering of the first filter ordering. The method includes creating a second filter ordering of the two or more filter processing elements. The method includes comparing the filtering efficiency of the second filter ordering to the first filter ordering. The method includes selecting the second filter ordering in response to comparing the filtering efficiency of the second filter ordering to the filtering efficiency of the first filter ordering.

Abstract: A System Solution automatically generates a set of Native and Non-Native Application Clients which include updating functionality capable of generating update commands to instruct the System Solution to generate an updated set of Native and Non-Native Application Clients. Using the generated Application Clients, an employee of a Business Entity coupled with the System Solution instructs the System Solution to create a new updated set of Native and Non-Native Application Clients that are automatically downloaded to devices used by the customers of the Business Entity. The System Solution also automatically generates an Update Command Dictionary which, when downloaded to a Manager Client Device, allows an employee of the Business Entity to use a General Third Party Application, such as a SMS, email, or messaging application commonly available on a mobile device, to generate update commands to instruct the System Solution to generate an updated set of Native and Non-Native Application Clients.

Abstract: A method for processing services can include receiving a request for a service; sending the result of the service in which at least one data item is tagged; in response to a selection of the tagged data item, determining other services associated with the service based on a service template of the service; and providing the other services associated with the service as options, wherein the other services take the at least one data item as inputs to provide outputs thereof.

Abstract: Partitioning of source partitions of a table of a database to target partitions is initiated. Thereafter, a transition partition specification is specified that identifies the source partitions and the target partitions. Data is then moved (e.g., asynchronously moved, etc.) from the source partitions to the target partitions. Concurrently with the moving of the data, operates are handled using the transition partition specification. Subsequently, the source partitions are dropped when all of the data has been moved to the target partitions and there are no open transactions accessing the source partitions. Related apparatus, systems, techniques and articles are also described.

Abstract: A method for processing services can include receiving a request for a service; sending the result of the service in which at least one data item is tagged; in response to a selection of the tagged data item, determining other services associated with the service based on a service template of the service; and providing the other services associated with the service as options, wherein the other services take the at least one data item as inputs to provide outputs thereof.

Abstract: Embodiments of the preset disclosure include a method, a system, and a computer program product for rearranging a set of filters within a data streams environment. The method includes setting a first filter ordering of two or more filter processing elements. The method includes determining a filtering efficiency of the first filter ordering. The determining of the filtering efficiency includes monitoring a runtime, one or more tuples, and an amount of tuples retained after filtering of the first filter ordering. The method includes creating a second filter ordering of the two or more filter processing elements. The method includes comparing the filtering efficiency of the second filter ordering to the first filter ordering. The method includes selecting the second filter ordering in response to comparing the filtering efficiency of the second filter ordering to the filtering efficiency of the first filter ordering.

Abstract: Provided are methods and computer-readable media for providing recommended entities based on a user's external social graph, such as asymmetric social graph of a social networking service. In some embodiments, entities responsive to a search query or other request may be obtained. Each entity may be evaluated to determine if the entity is associated with a contact from a user's social graph. The association may include an evaluation (e.g., a rating, review, other evaluation or combination thereof) of the entity by the contact. Additionally, the contacts having associations with an entity may be ranked based on a relationship score with a user. The entities having associations with the contacts from a user's social graph may be provided as recommended entities to the user, and the association may be annotated to the recommended entity for viewing by the user.

Abstract: A method for recommending text information, a server, a browser, and a system thereof are provided. The method includes: a keyword is obtained by a server from a text index pool in response to a visiting request for a webpage from a browser; a recommended text information list is obtained from the text index pool according to the corresponding keyword; the recommended text information list is embedded into the webpage and the webpage is returned to the browser for displaying to a user; and the user may click the keyword to obtain the recommended text information list as required, thereby the keyword is set as the connection between the user and the webpage text information.

Abstract: Embodiments disclosed herein provide feature-level access control functionality useful for enforcing access controls to features and subfeatures on uncontrolled, third party Web Applications such as those associated with social networking sites. Specifically, pages of uncontrolled Web applications are programmatically inspected as they are accessed by users of an enterprise computing environment. Specific features on the pages are located and access to these features is enabled or disabled on a per user basis. A modified page is generated if feature(s) on a Web page is/are to be disabled. To block certain feature(s), content may be rewritten on-the-fly. Because embodiments disclosed herein can programmatically inspect a Web page and understand what is on the page at a much finer granularity, it is possible for enterprises to gain benefits that may come from embracing social networking sites without risking the downsides of allowing enterprise users access to uncontrolled Web applications.

Abstract: Prioritizing online comments on social network web page is disclosed. An activity of a user consuming a content presented on the social network web page is detected. Time spent by the user consuming the content is determined. Responsive to the user entering a comment on the content, a depth of consumption of the content by the user is determined based on the time spent by the user consuming the content. The comment entered by the user is ranked among a plurality of comments entered by one or more of the plurality of users based on the depth of consumption. The comment entered by the user is presented on the social network web page in the order of the ranking.

Abstract: Prioritizing online comments on social network web page is disclosed. An activity of a user consuming a content presented on the social network web page is detected. Time spent by the user consuming the content is determined. Responsive to the user entering a comment on the content, a depth of consumption of the content by the user is determined based on the time spent by the user consuming the content. The comment entered by the user is ranked among a plurality of comments entered by one or more of the plurality of users based on the depth of consumption. The comment entered by the user is presented on the social network web page in the order of the ranking.

Abstract: Technologies for establishing connections between or among people based at least in part on semantic distance and relational distance include one or more computing devices that analyze content created by computing device users, perform content clustering on the content, determine relational distances between connection candidates, and generate connection recommendations based at least in part on the content clustering and the relational distances.

Abstract: Techniques for machine-based identification of objects extracted from text documents in natural language are disclosed. Text documents with extracted objects are presented in a form of Resource Description Framework (RDF) graphs with the nodes correspondent to the objects and arcs correspondent to the relations between objects. Identification of objects is implemented using specific combinations of patterns which define features of the objects.

Abstract: A system for automatically updating saved query results for a graph responsive to a graph update is disclosed. The system may identify a target constraint responsive to an update to the data graph. The system may use an index of constraints organized by edge. The target constraint specifies a path in a data graph that includes an edge specified in the update. The system may determine a state for the target constraint by traversing the graph via the path and determine based on the state, whether a member node represents a change to the saved query result. The system may then update a saved query result for the query using the member node identified during the traversal in accordance with the change.

Abstract: Computer systems and methods allow users to annotate content items found in a corpus such as the World Wide Web Annotations, which can include any descriptive and/or evaluative metadata related to a document, are collected from a user and stored in association with that user. Users are able to annotate and view their annotations for any document they encounter while interacting with the corpus, including hits returned in a search of the corpus. Users are also able to search their annotations or to limit searches to documents they have annotated. Metadata from annotations can also be aggregated across users and aggregated metadata applied in generating search results.

Abstract: Computer-implemented pet adoption systems, methods and computer program products improve the process of matching up prospective adopters with available animals by optimizing the number of pet profiles displayed to prospective adopters per page, providing authorized personal with different selectable rules for setting the order in which the animal profiles are displayed to the prospective adopter in order to work toward specific adoption goals of the animal shelter, and using historical usage and user-profile data to gauge the probability of adoption between a prospective adopter and the available animals. The probabilistic analysis is used for the purpose of ranking or filtering the pool of pet profiles in order to remove pets of lower adoption-probability from consideration or present them lower down in the displayed order of the profiles.

Abstract: Methods and systems are provided herein to enable secure proxying of network traffic between trusted and untrusted environments. In particular, a secure proxy may be provided that includes a set of policies. The policies may be applicable to various network protocol layers (e.g., an application layer), network traffic types, and/or endpoint resolution. The set of policies may be used to inspect, restrict and/or modify traffic between the trusted and untrusted environment to ensure data and network security. A proxy device may use the set of policies, for example, to obtain current service-related information (such as the list of IP addresses) currently associated with a computing resource requested by an application. Such endpoint information may be used, in turn, to update a white list.

Abstract: Systems and methods of this disclosure are directed to optimizing a content selector executing on content selection infrastructure. An entity engine retrieves a search query report with queries corresponding to selected content items of a content campaign and a performance metric for each query. The entity engine determines an entity for each of the queries. A cluster engine generates a first subset of the queries and a second subset of the queries based on the entity for each query. The cluster engine generates a first performance metric for the first subset and a second performance metric for the second subset. An interface displays the first performance metric and the second performance metric. A campaign generator receives a selection of a semantic criterion based on the first subset and updates the content campaign to include the semantic criterion.

Abstract: To perform a join operation on database objects, data structures contained in a first database object are distributed across database partitions in accordance with a partitioning scheme. Data structures of the first database object are associated with respective indices computed complementarily to the partitioning scheme. Other indices are computed from the respective data structures of a second database object. The join operation is performed at each of the database partitions on the data structures in the respective first and second database objects having the indices and the other indices in common.

Abstract: Embodiments relate to methods (900) and apparatuses (800) transferring a first event detector process of a first node (704-1) of a distributed computing system (300; 700) to a second event detector process of a second node (704-2) of the distributed computing system (300; 700), the second node (704-2) being different from the first node (704-1). The apparatus (800) comprises means (802) for copying a process content of the first event detector process to the second event detector process, means (804) for coordinating input events of the first event detector process such that the input events of the first event detector process are processed in parallel at both the first and the second event detector processes, and means (806) for verifying whether the input events of the first event detector process, which are processed in parallel at both the first and the second event detector process, lead to identical output events at both the first and the second event detector processes.

Abstract: A database system identifies missing statistics that is not available for processing database queries and determines the missing statistics. The database system generates execution plans for database queries. The database system requests certain statistical information for generating a database query. If the database system determines that the requested statistical information is not available, the database system stores information describing the requested statistical information as missing statistics. The missing statistics may identify one or more columns associated with tables processed by the database query. The database system performs statistical analysis of database tables to generate the missing statistics so that the statistical information is available for generating execution plans for subsequent queries. The database system may rank the missing statistics based on the number of times the missing statistics was identified by the database system while processing database queries.

Abstract: A system, computer-implemented method, and computer-readable storage medium for generating a block-based index, are provided. A block index is generated where the block index comprises a plurality of blocks and a block corresponds to a section of a graph column that stores a value. A block range vector is also generated for the index where the block range vector includes range information for the block that corresponds to the section of the graph and where the block-based index facilitates traversal of the graph column that searches for the value by constraining the traversal to the section of the graph.

Abstract: Methods, systems, and apparatus, including computer program products, for generating or using augmentation queries. In one aspect, a first query stored in a query log is identified and a quality signal related to the performance of the first query is compared to a performance threshold. The first query is stored in an augmentation query data store if the quality signal indicates that the first query exceeds a performance threshold.

Abstract: A computer system to optimize a database is provided. A processor determines a frequency of search for a plurality of columns in a table. A processor determines a length of the plurality of columns. A processor determines a rank for the plurality of columns based, at least in part, on both the frequency of search and the length of the plurality of columns. A processor generates a first set of combinations of the plurality of columns. A processor determines an optimization of the first set of combinations of the plurality of columns. A processor selects an optimal combination of the first set of combinations, wherein the optimization of the optimal combination is greater than the optimization for all other combinations in the first set of combinations. A processor moves the plurality of columns excluded from the optimal combination.

Abstract: A machine implemented method for accelerating access to business intelligence data including providing a master database table on a computer readable medium and accessible by an analytics server, accessing rows in the master database table by the analytics server, with each row in the master database table containing at least a partial set of measures for a plurality of dimensions, identifying by the analytics server a set of one or more dimensions from the plurality of dimensions subject to a query by one or more computing devices in communication with the analytics server, extracting the set of one or more dimensions and associated measures for each of the one or more dimensions from the master database table, and forming a baby fact table such that each row in the baby fact table contains the set of one or more dimensions subject to the query and the associated measures derived from the extracting step.

Abstract: Intelligent adjustment of compression levels of messages being brokered or otherwise handled by message service providers in a cloud-computing environment to strike a balance between the reduction in network usage and storage requirement resources owing to message compression on one hand and the increase in CPU resource usage owing to message compression on the other hand for reducing usage-based charges from the cloud customer's point of view and reducing the equipment and operational cost from the cloud provider's point of view (resulting in the ability of the provider to take on and/or retain customers). Determination of an “optimal” compression level that strikes an appropriate balance among resource usage may include consideration of a current messaging load (e.g., bytes of data per unit time), a current compression level, and current usage levels of one or more of the various resources.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for selecting an audience for content are disclosed. In one aspect, a method includes receiving, from a content item provider, a request to distribute content items to users that have been deemed interested in a particular entity. First users that have expressed an interest in the particular entity are identified. Expansion entities for the particular entity are identified in a knowledge graph. At least one of the expansion entities can be connected to the particular entity by a relationship path. Second users are identified. The second users are deemed interested in the particular entity based on the second users having expressed an interest in an expansion entity. The content items are provided to at least a portion of the first users and at least a portion of the second users.

Abstract: Methods, systems, and computer program products for processing multi-way theta join queries involving arithmetic operators on MapReduce are provided herein. A method includes converting (i) a multi-way theta join query into a multi-way interval join query, and (ii) one or more items of data associated with the multi-way theta join query to one or more items of interval data; executing the multi-way interval join query on the one or more items of interval data via MapReduce to generate an output, wherein the output comprises a set of multiple responses to the multi-way interval join query; and processing the output to generate a solution to the multi-way theta join query, wherein said processing comprises discarding each response from the set that does not satisfy the multi-way theta join query.

Abstract: A speech recognition method, a speech recognition device, and an electronic device. In this method, first determining is performed by using a sample environment corresponding to a detection speech and a previous environment type, so as to output a corresponding speech correction instruction to a speech engine; then, a to-be-recognized speech is input to the speech engine and a noise type detection engine at the same time, and the speech engine corrects the to-be-recognized speech by using the speech correction instruction, so that quality of an original speech is not impaired by noise processing, and a corresponding initial recognition result is output; the noise type detection engine determines a current environment type by using the to-be-recognized speech and a speech training sample under a different environment; finally, confidence of the initial recognition result is adjusted by using the current environment type.

Abstract: Sensor data from multiple sensors associated with a user is received. The sensors may include sensors of a smart phone, and sensors associated with other devices such as fitness trackers, video game consoles, and cameras. The sensor data is processed to identify entities such as persons, locations, and objects that may be of interest to the user. A personal digital assistant application can present information related to the identified entities to the user, and can allow the user to perform various queries with respect to the identified entities, and previously identified entities. In addition, the identified entities can be used to trigger one or more rules including recording when and where a particular entity is identified, and generating an alert when a particular entity is identified.

Abstract: Disclosed are various embodiments for classifying search queries. A computing device identifies a user account associated with a submission of a search query to an electronic commerce application. The computing device then identifies a network page provided by the electronic commerce application, wherein the network page is requested with the user account. Subsequently, the computing device classifies the search query based at least in part on the requested network page.

Abstract: A computer-implemented method, system, and/or computer program product optimizes an order of execution of column join operations. A first partitioning of the first data column splits the first data column into first subsets of rows. A second partitioning of the second data column splits the second data column into a second subsets of rows. A first value frequency information indicates a frequency of attribute values within a subset of rows of the first data column processed. A second value frequency information indicates a frequency of attribute values within a subset of rows of the second data column. Cardinalities of sub-tables derived by a respective joining of the subsets of rows of the first and second data columns are estimated, based on the first and second value frequency information. An order of execution of multiple join operations is then optimized based on the estimated cardinalities of the sub-tables.

Abstract: A table is processed to determine an approximate NDV for a plurality of groups. For each row, a group based is identified based on one or more group-by columns. A hashed valued is generated by applying a uniform hash function to a value in an NDV column. The hashed value is assigned to a particular bucket based on the values at a first set of bit positions in a binary representation of the hashed value. A bit position value is determined based on for a remaining portion of the binary representation of the hashed value. The bit position value is based on a number of ordered bits in the hashed value that match a particular bit pattern. For each group identified, a maximum bit position (MBP) table is generated. The MBP table stores, for one or more buckets, the maximum bit position value determined for hashed values assigned to a particular bucket.

Abstract: Mechanisms are provided that: identify topics associated with a plurality of pieces of media content presented in a session; calculate a distance metric for pairs of topics, wherein each of the pairs of topics includes a first topic associated with a first piece of media content and a second topic associated with a second piece of media content, and wherein the second piece of media content was presented within a given span of the presentation of the first piece of media content; for each first topic of the pairs of topics, generate a rank-ordered list for all corresponding second topics; for each of the plurality of pieces of media content, generate a single rank-ordered list of all second topics; and for each of the plurality of pieces of media content, identify one or more other pieces of media content as recommended media content based on the single rank-ordered list.

Abstract: In an index-only multi-index access in a database, when a query to be executed requires multiple indexes, a query optimizer determines whether columns are needed for a query result, subquery, or inner join result. If not, then the query result is resolved using qualified record identifiers (RIDs) from the multiple indexes without accessing the data pages. When the columns are needed and can be resolved using input values of the query, then the query result is resolved using the qualified RIDs from the multiple indexes and substituting column values with the input values of the query. When the columns are needed and cannot be resolved using the input values of the query, the query optimizer may store one or more index keys with its corresponding qualified RIDs from the multiple indexes and may resolve the query result using the stored index keys without accessing the data pages of the database.

Abstract: Searching information includes: receiving current query data from a client; extracting generic attribute features of the current query data, wherein the generic attribute features are used for calculating a plurality of confidence degrees of the current query data that correspond to a plurality of categories, each of the confidence degrees indicating a degree of confidence that the current query data belongs to a respective one of the plurality of categories; determining the plurality of confidence degrees of the current query data based at least in part on the generic attribute features; selecting a category based at least in part on the plurality of confidence degrees, the selected category being one of the plurality of categories and having a confidence degree higher than a confidence degree of another category; searching in the selected category for a search result that corresponds to the current query data; and returning the search result.

Abstract: In an index-only multi-index access in a database, when a query to be executed requires multiple indexes, a query optimizer determines whether columns are needed for a query result, subquery, or inner join result. If not, then the query result is resolved using qualified record identifiers (RIDs) from the multiple indexes without accessing the data pages. When the columns are needed and can be resolved using input values of the query, then the query result is resolved using the qualified RIDs from the multiple indexes and substituting column values with the input values of the query. When the columns are needed and cannot be resolved using the input values of the query, the query optimizer may store one or more index keys with its corresponding qualified RIDs from the multiple indexes and may resolve the query result using the stored index keys without accessing the data pages of the database.

Abstract: Performing index search optimization by receiving a search query for a search of an index, wherein the index has been partitioned across a plurality of nodes. This search index optimization may be performed for deterministic as well as non-deterministic queries. In both cases, a local partition is searched and analyzed and a corresponding execution path is selected for optimization. Different optimization strategies are chosen for the two types of queries. For the cases when the partition or the set of partitions containing the required matches can be determined, the request is routed directly to that partition or set of partitions without interrogating other partitions.

Abstract: Methods and systems for searching over a large corpus of data to discover relevant information artifacts based on similar content and/or relationships are disclosed. Improvements over simple keyword and phrase based searching over Internet scale data are shown. A search query may be modified or relaxed based on the search terms and a contextual relationship therebetween. The search results may be ranked based on both a data ranking corresponding to the data entries in the corpus and a query ranking corresponding to the search query and/or the modified or relaxed search query. In this manner, the accuracy and relevance of the search results is improved.

Abstract: Hash based data processing generates an output dataset based on combining a plurality of input datasets. Input datasets may be divided into a plurality of portions using a hashing algorithm that hashes based on a data attribute of at least one of the input datasets. Pairs of the portions may then be combined through join operations that may be performed at least partly in parallel, based on the data attribute used in the hashing algorithm. The combined dataset portions resulting from the join operations may then be combined to generate an output dataset to be stored in a location that is accessible to user devices. In some cases, one or more step datasets may be generated and stored prior to the output dataset, the step dataset(s) including subset(s) of the data in the output dataset.

Abstract: The disclosed embodiments relate to a computer system that facilitates the providing of an answer to a question. During operation, the computer system receives the question from a user, where the question is related to income taxes. Then, the computer system performs content-dependent processing of the question based on a tax-information data structure to produce the answer to the question. Note that the tax-information data structure includes: tax phrases, context information associated with the tax phrases, tax concepts that encompass multiple tax phrases, and/or statistical association metrics between the tax phrases and the tax concepts. Next, the computer system provides the answer to the user.

Abstract: In one embodiment, a computing device may access a search query provided by a user; identify a set of search results in response to the search query, wherein one or more search results in the set are associated with a feature of a social-networking system; rank the set of search results based on one or more factors; boost one or more ranks of the one or more search results associated with the feature to bring the feature to the user's attention; and present the set of search results to the user in order of its ranking.

Abstract: Disclosed are various embodiments of systems, methods, and computer programs that can facilitate processing of large data sets from data sources. Examples of the disclosure can allow a client to perform data processing tasks in computing resources that are external to a data source from which the data is retrieved rather than relying upon the computing resources of the data source.

Abstract: The invention pertains to a method and Information Handling System (IHS) for performing delta compression on probabilistically clustered chunks of data. From a source of chunks a corresponding sketch to represent each chunk is generated. Then, from the generated sketches a subset of similar sketches is determined using a probabilistic based algorithm. Finally, delta compression is performed on the chunks which are represented by the similar sketches in the determined subset.

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: A method of mapping a collection of images, or other higher dimensional items including text documents, and three-and-higher dimensional objects, onto a navigable grid for browsing via a user interface comprises obtaining for each of the images a list of nearest neighbor images and similarity scores for each nearest neighbor; placing a first image on a cell within a grid; from a respective list of nearest neighbors of said first image, finding images that maximize a compatibility score with images already placed on the grid and placing resulting images on neighboring cells; and continuing to place further images on the grid until all cells visible to a user are filled with images. As the user pans or zooms the grid, more cells move into the visible area of the screen and are filled with images in the same way.

Abstract: An information retrieval system and method are presented. A template is retrieved from a template repository. The template repository stores a plurality of templates. Each of the plurality of templates includes a concept and a relationship from a knowledge model. The knowledge model defines a plurality of entities and interrelationships between one or more of the plurality of entities. The plurality of entities include concepts and instances. The template is transmitted to a client computer, and a statement is received from the client computer. The statement includes an instantiation of the template. A knowledge base is queried using the statement to generate a result listing identifying an item in the knowledge base. The knowledge base identifies a plurality of items. Each of the plurality of items is associated with at least one annotation identifying at one of the entities in the knowledge model.