Abstract: Described herein are systems and methods for providing context-sensitive data security, for business application performance optimization. In accordance with an embodiment, the system can be used together with a Role Based Access Control model. Data security predicates can be made context-sensitive, by taking into account the context in which an end-user is navigating an application. By providing context-sensitive data security in this manner, the complexity of database queries can be reduced, and the underlying relational database management system can create better-optimized execution plans.

Abstract: A system and method is provided which may comprise parsing an unstructured geographic web-search query into a field-based format, by utilizing conditional random fields, learned by semi-supervised automated learning, to parse structured information from the unstructured geographic web-search query. The system and method may also comprise establishing semi-supervised conditional random fields utilizing one of a rule-based finite state machine model and a statistics-based conditional random field model. Systematic geographic parsing may be used with the one of the rule-based finite state machine model and the statistics-based conditional random field model. Parsing an unstructured local geographical web-based query in local domain may be done by applying a learned model parser to the query, using at least one class-based query log from a form-based query system. The learned model parser may comprise at least one class-level n-gram language model-based feature harvested from a structured query log.

Abstract: In various example embodiments, systems and methods to mine product recommendations from query reformulation is provided. In example embodiments, a query that corresponds to a particular product is received. Transition data for the particular product is accessed. The transition data includes values indicating a number of search transitions based on a change in queries between the particular product and other products in previous session sets of queries. One or more recommendations based on the transition data is determined and provided to the user.

Abstract: A method and system for displaying comments associated with a query. The method includes receiving the query provided by a user, retrieving a set of comment clusters from a comment cluster database, selecting engaging comments from each comment cluster included in the set of comment clusters, aggregating the engaging comments that are obtained from each comment cluster, identifying a plurality of independent comments included in a list of aggregated comments and displaying a list of engaging comments to the user. The system includes an electronic device, a communication interface and a memory. The system also includes a processor to receive the query, retrieve a set of comment clusters, select engaging comments from each comment cluster, aggregate the engaging comments, identify a plurality of independent comments and display a list of engaging comments to the user.

Abstract: A method and apparatus are provided for processing a graphic in a document so that the graphic may be reused in a different application than the one it was originally used in. For a given document, a graphic may be identified from within the document and extracted from the document. The extracted graphic may be stored in a suitable storage medium, such as a reusable graphic repository. A structural feature associated with the extracted graphic may also be extracted. The extracted graphic may then be classified based on the extracted structural feature. Furthermore, a method and apparatus are provided for generating a reusable graphic from a document.

Abstract: Methods and systems for efficient query rewriting and the like are described here. One such described method comprises: offline mapping frequently-seen search queries to rewritten queries that may be better for searching; offline caching the mapping in a cache memory; and upon receiving a search query from a user similar to one of the mapped search queries, obtaining a corresponding rewritten query from the mapping in the cache memory based on predetermined conditions, and issuing a search of the rewritten query to the backend data system in order to avoid having to issue a search query to the backend data system twice while the user is online.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage media are disclosed that involve a server receiving a search query including a query term and a substitute term for the query term and data corresponding to a set of documents. The server accesses a value corresponding to a relevance of the search query to a selected document from the set of documents and determines that the value satisfies a predetermined threshold. The server then generates a score for the selected document according to a first scoring model, the first scoring model including a first increment value for the substitute term. The first scoring model is different than a second scoring model used to generate scores for one or more other documents from the set of documents.

Abstract: A method of managing an axiom includes determining if an H in an A?H axiom in existing axioms is a predetermined expression; and if the H is the predetermined expression, collecting, from the existing axioms, a B?I axiom in which the B includes the H, deleting the A?H axiom from the existing axioms, and generating a new B?I axiom from the collected B?I axiom by replacing the H in the B with the A.

Abstract: A system, method, and computer-readable medium, is described that implements a resource navigation links tool that receives one or more inputs, extracts information from the inputs into a submission string, submits the submission string to a resource navigation links tool, and receives resource navigation links based on the submission string. Inputs types may include images, audio clips, and metadata. The inputs sources may be processed to extract information related to the image source to build the submission string.

Abstract: Associative memory systems, methods and computer program products are provided. An associative memory system includes a distributed associative memory base including a network of networks of associative memory networks. A respective associative memory network includes associations among a respective observer memories and a plurality of observed memories that are observed by the respective observer memory. Ones of the associative memory networks are physically and/or logically independent from other ones of the associative memory networks. A processing system is configured to observe associations into and imagine associations from, the distributed associative memory base using multiple streaming queues that correspond to respective ones of multiple rows in the associative memory networks. The processing system is further configured to determine a cognitive distance between a term and a class of terms, the cognitive distance being returned responsive to a query of the distributed associative memory base.

Abstract: In an embodiment, a method comprises performing a first search based on a first text string; based on the first search, identifying one or more search results; after identifying the one or more search results, causing the one or more search results to be displayed; while the one or more search results are displayed: receiving input that changes the first text string to a modified text string; in response to receiving the input: performing a second search based, at least in part, on a portion of the modified text string, and determining that no search results are identified based on the second search; after determining that no search results are identified based on the second search, continuing to display the one or more search results; wherein the method is performed by one or more computing devices.

Abstract: Methods and apparatus, including computer program products, are provided for group-by access of a database. In one aspect there is provided a method. The method may include receiving from a user interface information defining a database and a database table; converting the received information into at least one instruction for performing the group-by and the sum at the database table included in the database; sending the at least one instruction to the database; receiving, in response to the at least one instruction sent, a result-set from the database, the result-set representative of the group-by and the sum of the database table; and providing the result-set to an interface. Related systems and articles of manufacture are also discloses.

Abstract: In an embodiment, a method comprises performing a first search based on a first text string; based on the first search, identifying one or more search results; after identifying the one or more search results, causing the one or more search results to be displayed; while the one or more search results are displayed: receiving input that changes the first text string to a modified text string; in response to receiving the input: performing a second search based, at least in part, on a portion of the modified text string, and determining that no search results are identified based on the second search; after determining that no search results are identified based on the second search, continuing to display the one or more search results; wherein the method is performed by one or more computing devices.

Abstract: Techniques for configuring validation rules in a client-server architecture, and for enforcing such validation rules are provided. A developer is enabled to configure a display screen for an application to enable a user at a client to input data. The developer is further enabled to input a validation rule that is configured to be applied to validate the data at the client and/or at a server. The validation rule is integrated into code of the application. During execution of the application, a client-side rules engine may be present to evaluate the validation rule at the client, and a server-side rules engine may be present to evaluate the validation rule at the server. The client-side rules engine and server-side rules engine may be configured to evaluate validation rules in an asynchronous manner.

Abstract: A method, system and apparatus are shown for identifying non-language speech sounds in a speech or audio signal. An audio signal is segmented and feature vectors are extracted from the segments of the audio signal. The segment is classified using a hidden Markov model (HMM) that has been trained on sequences of these feature vectors. Post-processing components can be utilized to enhance classification. An embodiment is described in which the hidden Markov model is used to classify a segment as a language speech sound or one of a variety of non-language speech sounds. Another embodiment is described in which the hidden Markov model is trained using discriminative learning.

Abstract: Various embodiments of systems and methods for tracking queries and retrieved results are described herein. In one aspect, a first query is associated with a first result set in a first tuple and a second query is associated with a second result set in a second tuple. The first result set is retrieved based on the execution of the first query and the second result set is retrieved based on the execution of the second query. The first and the second tuples are retained in a data structure in the order of execution of the respective queries. The retrieved result sets may be accessed forwards or backwards along the data structure without re-execution of the queries.

Abstract: A social networking system allows a user to create an event in the social networking system while viewing a web page from a third-party website from a domain different than the social networking system. A widget or other social plug-in is included in the web page, and user interaction with the widget communicates information from the web page to the social networking system. An event object is created in the social networking system from the information from the web page. The social networking system may perform various actions to increase user interaction with the created event object, such as identifying additional users to invite the event or identifying users attending the event to other users.

Abstract: A product placement engine and method for automatically identifying products for association with a document, the engine including a parser, an analysis module adapted to determine word scores and to adjust the word scores of the words by predetermined weightings, a keyword constructor module adapted to construct a keyword query search string using words having the highest word scores, a search engine adapted to search a products database having product records to identify products satisfying the keyword query search string and assign product scores, and a post processing module adapted to identify word matches in each of the product records and the document and update the product score.

Abstract: Methods, software and devices for responding to a user query are disclosed. A user query received from a user is matched to stored responses to obtain initial matched responses. A confidence metric indicating the likelihood of the initial matched responses satisfying the user query is calculated. Upon determining the confidence metric to be below a specified threshold, the user query is supplemented with contextual data. The user query, supplemented by contextual data, is further matched to stored responses by applying disparate matching techniques to obtain further matched responses, where at least one of the disparate matching techniques differs from techniques used to obtain the initial matched responses. Degree-of-match metrics are calculated taking into account the contextual data, where each degree-of-match metric indicates a quality of match between the user query and a matched response. At least one of the matched responses is presented to the user.

Abstract: In one embodiment the present invention includes a computer-implemented method comprising receiving a first query in a local computer system to access data stored on a remote computer system the local computer system. Data elements of the remote data are associated with data elements of the local data. The query is transformed into multiple queries. A second query is sent to the remote computer system to retrieve remote data. A first data result is received and stored on the local computer system and incorporated into a third query. The third query is executed against the local data and the first data result to produce a result. Sensitive data may be stored locally in a dimension table of a star schema and non-sensitive data may be stored remotely in a fact table and another dimension table of the star schema, for example.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media for determining a weighted overall quality of result statistic for a document. One method includes receiving quality of result data for a query and a plurality of versions of a document, determining a weighted overall quality of result statistic for the document with respect to the query including weighting each version specific quality of result statistic and combining the weighted version-specific quality of result statistics, wherein each quality of result statistic is weighted by a weight determined from at least a difference between content of a reference version of the document and content of the version of the document corresponding to the version specific quality of result statistic, and storing the weighted overall quality of result statistic and data associating the query and the document with the weighted overall quality of result statistic.

Abstract: A framework is provided for composing texts about objects with structured information about these objects, and thus disclosed are methodologies for linking information from at least two data sources—one comprising a plurality of documents comprising text pertaining to at least one object, and one comprising a plurality of structured records comprising at least one characteristic of the at least one object, each characteristic comprising one property name and an associated property value corresponding to the property name for the at least one object—by determining one or more instance-based traits for each object in both data sources and associating at least one record with at least one document that refers to each object, each trait comprising one or more characteristics that identifiably distinguish each object from all other objects.

Abstract: Methods, computer systems, and stored instructions are described herein for transforming a query or execution plan to re-use stored data. A query processor stores a query or a representation thereof. Before executing the query, the query processor analyzes the query or representation to determine whether the query or representation could cause at least part of a data structure to be generated at least twice. Based at least in part on determining that the at least part of the data structure could be generated at least twice by the query or representation, the query processor transforms the query or representation. The transformed query or representation includes a first transformed sub-query or sub-operation that generates and stores the at least part of the data structure, and a second transformed sub-query or sub-operation uses the at least part of the data structure that was stored by the first transformed sub-query or sub-operation.

Abstract: When a one or more identifiers and a plurality of data request types is received, a first data request from the one or more identifiers and from a first data request type can be generated and performed. When at least one first result from the first data request can be received, a second data request from the one or more identifiers and from a second data request type can be generated and performed at any time after receiving the one or more identifiers and the plurality of data request types, and then the at least one second result from the second data request can be retrieved either one of a before, during, and after the at least one first result from the first data request is presented. The correspondence between identifiers and request types may be one-to-one, one-to-many, many-to-one, or many-to-many relationship. A response type may employ a plurality of response methods to access multiple network resources corresponding to any generated and/or selected identifiers and/or request types.

Abstract: A system and method of sensing and responding to service discoveries on a consumer's machine and, more particularly, to a system and method of sensing (discovering) service needs on a consumer's machine using a resident Daemon, and responding to the service discoveries using an extension of UDDI. The method comprises receiving a keyword from a local machine, locating a service associated with the keyword, and notifying the local machine about the service that matches the keyword.

Abstract: An apparatus for conducting a hierarchical join on a hierarchically clustered data stream is disclosed. The apparatus may include a memory storing query conditions that each determine whether a Structured Query Language query is suitable for performing a non-buffering read operation on a hierarchical data storage. A processor in communication with the memory may be configured to receive a Structured Query Language (“SQL”) query from a client device and evaluate the SQL query for one or more of the query conditions stored in the memory. When the processor determines that the SQL query satisfies one or more of the query conditions, the processor may then perform a non-buffering read operation on the hierarchical data storage to obtain a hierarchically clustered data stream. The hierarchically clustered data stream may be evaluated to obtain a plurality of record results, which may be transmitted to the client device.

Abstract: Some embodiments relate to performing a search for content via the Internet, wherein user input specifying a search query is supplied to a mobile communications device, such as, for example, a smartphone. The mobile communications device separately issues the search query to a plurality of search engines and can receive the results from each search engine and display the results to the user. Thus, the user does not have to separately issue the query to each of the plurality of search engines.

Abstract: A system and method for automatically providing content associated with captured information is described. In some examples, the system receives input by a user, and automatically provides content or links to content associated with the input. In some examples, the system receives input via text entry or by capturing text from a rendered document, such as a printed document, an object, an audio stream, and so on.

Abstract: A system, computer program product and a system for analysis of data, the method includes: extracting a concise representation of a content a sample of a first dataset, wherein the extracting is executed without being mainly based on a-priory knowledge of a content of the sample of the first dataset; querying a queried dataset using at least a portion of the concise representation of the content of the sample of the first dataset, to provide query results; and generating a concise representation of a content of the query results.

Abstract: A method of performing a graph query issued by a user is provided. The method includes performing on a processor, receiving a user graph query. The method includes rewriting the user graph query as a new query based on a query policy expressed in a graph query language. The method includes performing the new query on graph data to obtain a result.

Abstract: Access to a data element stored within a database object is controlled. A request is received from a user to perform an operation in relation to the database object, the operation including retrieval of information from the data element of the database object. Prior to retrieving information from the data element, a determination is made whether at least a portion of the information from the data element is subject to masking in accordance with an access policy. In response to determining that information from the data element is subject to masking, the request is modified to require that information from the data element be retrieved in a masked condition.

Abstract: A technique for efficiently factoring a matrix in a recommendation system. Usage data for a large set of users relative to a set of items is provided in a usage matrix R. To reduce computational requirements, the usage matrix is sampled to provide a reduced matrix R?. R? is factored into a user matrix U? and an item matrix V. User vectors in U? and V are initialized and then iteratively updated to arrive at an optimal solution. The reduced matrix can be factored using the computational resources of a single computing device, for instance. Subsequently, the full user matrix U is obtained by fixing V and analytically minimizing an error in UV=R+error. The computations of this analytic solution can be divided among a set of computing devices, such as by using a map and reduce technique. Each computing device solves the equation for different respective subset of users.

Abstract: Systems, methods, and computer-storage media for generating contextual queries are provided. The system includes a search engine to receive user queries and contexts, a query understanding component to generate a semantic representation of the query, and a data source command generator to transform the semantic representation into commands for multiple data sources. The data source command generator is connected to the query understanding component. The data source command generator selects data source commands based on lexical information associated with each data source.

Abstract: In one embodiment, a method comprises, by a computer system, receiving a search term, determining a search constraint for a search query, and generating a search query. The search query includes the search term and the search constraint. The search query requires that at least a first number of search results that are returned in response to the search query match both the search term and the search constraint. The search query permits at least a second number of the search results to match only the search term. The computer system provides the search query for a search against a store of data.

Abstract: System, method, and computer program product to modify a received query, the received query including a first predicate specifying a comparison operator and a second predicate specifying an IS NULL operator, by replacing the comparison operator of the first predicate with an extended comparison operator, and removing the IS NULL operator from the received query, the extended comparison operator configured to support searching of NULL values in a database management system (DBMS), wherein the extended comparison operator is configured to return rows having column data matching a value predefined to represent NULL values.

Abstract: System, method, and computer program product to modify a received query, the received query including a first predicate specifying a comparison operator and a second predicate specifying an IS NULL operator, by replacing the comparison operator of the first predicate with an extended comparison operator, and removing the IS NULL operator from the received query, the extended comparison operator configured to support searching of NULL values in a database management system (DBMS), wherein the extended comparison operator is configured to return rows having column data matching a value predefined to represent NULL values.

Abstract: A server system receives a visual query and identifies an entity in the visual query. The server system further identifies a client-side action corresponding to the identified entity and creates an actionable search result element configured to launch the client-side action. Examples of actionable search result elements are buttons to initiate a telephone call, to initiate email message, to map an address, to make a restaurant reservation, and to provide an option to purchase a product. The entity identified in the visual query may be indirectly associated with a client-side action whose contact address or appropriate link is found in a search result associated with the identified entity. The client system receives and displays the actionable search result element, and upon a user selection of the actionable search result element, launches the client-side action in an application distinct from the visual query client application.

Abstract: Systems and methods for performing a data search through a search query is disclosed. The method includes receiving the search query and parsing the search query to retrieve a search term. The search term includes a plurality of words. In the search term, a first combination of two or more of the plurality of words and a second combination of two or more of the plurality of words are indentified. The first combination and the second combination include a common term. The first combination ends with the common term and the second combination begins with the common term. The method further includes retrieving synonyms for the first combination and the second combination exist in a synonym storage and the search query is then modified to include the first combination in a logical OR relationship with the synonyms of the first combination and the second combination in a logical OR relationship with the synonyms of the second combination. The modified search query is executed against a data store.

Abstract: A method is disclosed, and a corresponding data carrier and policy converter, for producing at least one Security Descriptor Definition Language, SDDL, rule from an eXtensible Access Control Markup Language, XACML, policy (P), wherein said at least one SDDL rule is enforceable for controlling access to one or more resources in a computer network. A reverse query is produced indicating a given decision (d), which is one of permit access and deny access, and a set (R) of admissible access requests. Based on the reverse query, the XACML policy (P) and the given decision (d) are translated into a satisfiable logic proposition in Boolean variables (vi, i=1, 2, . . . ) From said ROBDD, variable assignments (RCj=[ARCj1: v1=xj1, ARCj2: v2=xj2, . . . ], j=1, 2, . . . ) satisfying the logic proposition are derived and at least one SDDL rule is created based on said variable assignments (RCj=[ARCj1: v1=xj1, ARCj2: v2=xj2, . . . ], j=1, 2, . . . ) satisfying the logic proposition.

Abstract: A system for integrating databases comprises a first virtual table, a second virtual table, a common table, a list, a generating section, and a selecting section. The first virtual table corresponds to a first data. The second virtual table corresponds to a second data. The common table is associated with the first and second virtual tables. The list indicates information about associations between the first and second virtual tables and the common table. The generating section generates two or more access plans from a database query on the common table. The two or more access plans involve at least one of the first and second virtual tables in accordance with the list. The selecting section selects one of the two or more access plans generated by the generating section to be used to execute the database query.

Abstract: The invention, in general, comprises systems and methods for finding information relevant to a user on the World Wide Web. In various embodiments, the invention comprises using one or more of the following: ready-made English-language queries; an ISO Technical Standards Specification Terminology database; an economic activities database based on North American Industry Classification (NAICS); a language interface configured to enable a user to use his native language for constructing an initial query sentence based on subject structure and to obtain a corresponding English language query; an automated method of extracting site (URL) information on products, services and economic activities on the Web; and providing records showing search histories (with URLs), user names, and time data for marketing or research purposes.

Abstract: Methods and Apparatus, including computer program products, for maintaining indexes in a database management system. The database management system includes a table having table entries and an index data structure having index data structure entries, the index data structure relating to the table. The index data structure is updated synchronously with an insertion of table entries. The index data structure is maintained unchanged when the table entries are deleted. It is verified by an index-scan on the index data structure that a valid criterion is fulfilled for index data structure entries, and those index data structure entries that pass the valid criterion from the index-scan are returned.

Abstract: An apparatus and a method of optimizing queries through scheduling User Defined Operators (UDOs) in a Data Stream Management System (DSMS), are provided. The apparatus includes a query optimizer configured to receive queries, each of the queries including the UDOs and data streams subject to respective operations of the UDOs, and group the data streams and UDOs into scheduling units, each of the scheduling units including one of the data streams and one of the UDOs. The apparatus further includes a scheduler configured to schedule an execution order in which the scheduling units are executed.

Abstract: Systems, methods, and computer-readable media are provided for ranking documents. An exemplary method includes receiving a plurality of queries from a user that are related to a search topic. The queries are compared to a plurality of documents stored in a database to identify candidate documents that match one or more of the queries. The number of matching queries is determined for the candidate documents. The candidate documents are ranked, using a computer processor, for relevance to the search topic based at least on the number of matching queries for each respective candidate document.

Abstract: A system and method for mobile based advising is provided. The system and method involve the user with his mobile terminal formulating a query based on his own input and external sensor input and then sending the query to a remote server, which sends it to an expert group who devise an expert advice, which is then sent back to the user.

Abstract: A multidimensional operation provider is provided for processing a multidimensional query against a relational datasource. The multidimensional operation provider comprises a query interceptor, a query decomposer and a query replacer. The query interceptor detects and intercepts a multidimensional query that is issued against one or more relational data sources. The query decomposer decomposes expressions of the multidimensional query into one multidimensional expression and/or one or more relational expressions. The query replacer replaces the multidimensional query with a stack of operations expressed by the decomposed multidimensional expressions and/or the relational expressions.

Abstract: In one embodiment, a social-networking system accesses a social graph with a plurality of user nodes and a plurality of location nodes, receives a search query with location parameters, identifies a set of location nodes based on the search query, and determines a value for each location nodes in the set based on the edges connected to the location nodes in the social graph.

Abstract: A method, system, and a computer program product for converting asymmetric requests into symmetric requests are disclosed. In a first aspect, the method comprises a computer partitioning a query into a set of partitions along a dimension of a multi-dimensional data source, wherein each partition of the set of partitions comprises more than one member and the query has a query result count. The method includes the computer creating a candidate query for each partition of the set of partitions, wherein each candidate query has a candidate query result count. Responsive to a determination that the query result count is greater than a sum of the candidate query result counts, the method includes the computer substituting the query with the candidate queries.

Abstract: A location associated with a user of a computing device and a prefix portion of an input string may be received as one or more successive characters of the input string are provided by the user via the computing device. A list of suggested items may be obtained based on a function of respective recommendation indicators and proximities of the items to the location in response to receiving the prefix portion, and based on partially traversing a character string search structure having a plurality of non-terminal nodes augmented with bound indicators associated with spatial regions. The list of suggested items and descriptive information associated with each suggested item may be returned to the user, in response to receiving the prefix portion, for rendering an image illustrating indicators associated with the list in a manner relative to the location, as the user provides each successive character of the input string.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining word boundary likelihoods in potentially incomplete text. In one aspect, a method includes selecting query sequences from the query, each query sequence being at least a portion of a word n-gram, the word n-gram being a subsequence of up to n words selected from the second sequence of words of the query, and for each query sequence: determining one or more query sequence keys for the query sequence; determining at least one of a word boundary count and a non-word boundary count for each query sequence key, each word-boundary count and non-word boundary count being dependent on the context of the query sequence; and associating, in a data storage device, the at least one word boundary count and non-word boundary counts with each query sequence key.