Abstract: A system includes reception of a query comprising one or more search terms, determination that one of the one or more search terms corresponds to a table column comprising Boolean operators, determination of a value of the table column corresponding to TRUE, and addition of a condition to the query, the condition specifying the value of the table column.

Abstract: The present invention is an apparatus and method for constructing a Constraint-Choice-Action Matrix for making decisions based on constraints. Columns (in one matrix orientation) state conditions. The column header presents a partial boolean expression. Such variable expression may be any object or type, e.g., a number, string, or list. An entry in a cell, selected using a GUI pick-list, combines with the column header, to complete the boolean expression. The set of boolean expressions in a row may be combined into an action boolean statement. If that statement evaluates to true, some action, represented as a row header, is recommended or executed. The matrix is applied to an instance of a context domain, for decision-making. The context domain may be represented in a model representing an instance of that domain (e.g., a product specification for configuration of a machine) in data and rules.

Abstract: In particular embodiments, a method includes receiving a query for data in data sets that are within a specified range, constructing a first binary decision diagram (BDD) representing the specified range, and constructing a third BDD representing the data in the specified range by performing an AND operation between the first BDD and a second BDD representing the data sets.

Abstract: A method and system for coping with slice and dice operations in data warehouses is disclosed. An external approach may be utilized, creating queries using structured query language on a computer. An algorithm may be used to rewrite the queries. The resulting predicates may be joined to dimension tables corresponding to fact tables. An internal approach may be utilized, using aggregation functions with early aggregation for creating the queries. The results of the slice and dice operations may be outputted to a user on a computer monitor.

Abstract: User data and a plurality of micro-segment definitions are received. Each micro-segment definition in the plurality of micro-segment definitions corresponds to one or more offers in an offer provider campaign. Further, a micro-segment parser parses each micro-segment definition from the plurality of micro-segment definitions into a plurality of parsed expression segments that indicate a plurality of micro-segment condition rules. In addition, a compiler compiles the plurality of parsed expression segments into an executable object that indicates a plurality of instructions to determine if the user data matches the plurality of micro-segment definitions. Each micro-segment definition is also serially processed, with a sequential evaluation engine, to apply the plurality of micro-segment condition rules to the user data to determine a match of a user belonging to a micro-segment. Further, the sequential evaluation engine assigns a score to indicate the strength of each match.

Abstract: To provide a technique for accurately and efficiently generating Boolean search formulas that serve as a basis of similarity search. A Boolean search formula generation apparatus according to the present invention establishes Boolean search formulas expressed in a standard sum of products form connecting products of search terms by a sum and evaluates the Boolean search formulas based on a recall and a precision. The Boolean search formula generation apparatus repeats connecting the products of the search terms with maximum evaluation values by a sum to establish a Boolean search formula.

Abstract: A technique utilizes a search query having a set of clauses. The technique involves displaying, by a processor, the set of clauses of the search query onto an electronic display. Each clause includes a selection cell describing a selectable operation. The technique further involves receiving, by the processor, a mouse click input from a mouse apparatus. The mouse click input includes coordinates identifying a location that resides within the selection cell of a particular clause. The technique further involves change, by the processor, the selectable operation described by the selection cell of the particular clause between an editing operation and a Boolean operation in response to the mouse click input. Such a technique minimizes user typing and navigation demands, and offers a compact format and considerable power and flexibility when constructing and/or editing a search query.

Abstract: Systems and methods are described for use in higher-order-knowledge-based searching of content available from a network of data-storage devices. In various embodiments, at least one computational expression representative of a relational framework for content is identified and provided to an information retrieval system for use in searching for content desired by a user. The relational framework for content may include rules, expressions, equations, and/or constraints, which bind, relate, or associate certain content with other content. A computational expression may be determined from processing structured data. The structured data may be identified during crawling of a network or may be expressly provided to an extractor. Use of a computational expression by an information retrieval system may more efficiently and accurately return desired content to a user than is possible with traditional information searching methods.

Abstract: A method for processing queries is provided. A database server receives and executes a query to generate a relation. The query comprises first one or more clauses and a model clause. The model clause comprises a rule that has a left-side expression and a right-side expression. In one embodiment, the right-side expression of the rule includes a window function, which specifies one or more partition columns. In an embodiment, the left-side expression comprises a for-loop predicate. The for-loop predicate is unfolded after the database server compiles the query. In one embodiment, the left-side expression of the rule comprises one or more existential predicates, where each existential predicate evaluates to a Boolean value.

Abstract: Systems and methods to provide filter hints for a result set are provided. In example embodiments, a search request is received and a search is initiated. Documents retrieved from the search are analyzed to determine filters, which may be organized into filter groups. A filter count for each filter is determined. The filter count indicates how many documents match the filter within a current result set or how many additional documents match the filter if selected. The current result set is a set of remaining documents based on any number of previously selected filters from any one or more filter groups being applied thereto. In example embodiments, the filters include enabled filters and any disabled filters, whereby the disabled filters have a zero filter count in the current result set. A visual indicator may also be provided to indicate at least one filter being selected within a collapsed filter group.

Abstract: A computer implemented method of indexing a plurality of responses for later retrieval and presentation to a user in response to queries, includes, for each of the plurality of responses, receiving at least one representative query for that response. The representative query(s) represent text (e.g. natural language) query(s) to be input by an end user searching for information addressed by that response. Each representative query is parsed into terms. The terms are analyzed to determine which of these terms are more likely to uniquely identify queries for the particular response among terms in representative queries for all indexed responses. Boolean expression(s) satisfied by a text query containing one of the terms determined to more likely uniquely identify that response, and another one of the parsed terms are formed.

Abstract: A process is disclosed for retrieving information in large heterogeneous data bases, wherein information retrieval through visual querying/browsing is supported by dynamic taxonomies; the process comprises the steps of: initially showing (F1) a complete taxonomy for the retrieval; refining (F2) the retrieval through a selection of subsets of interest, where the refining is performed by selecting concepts in the taxonomy and combining them through boolean operations; showing (F3) a reduced taxonomy for the selected set; and further refining (F4) the retrieval through an iterative execution of the refining and showing steps.

Abstract: Techniques for searching and presenting search results to a user are provided. A search is decomposed into sub search combinations. Logical operator ordering is maintained within each sub search combination and each sub search combination is processed to acquire a waterfall count for the resulting answer set associated with processing that sub search combination. The sub search combinations and their waterfall counts are then presented to the user for visual inspection and analysis.

Abstract: A Scalable NonZero Indicator (SNZI) object in a concurrent computing application may include a shared data portion (e.g., a counter portion) and a shared nonzero indicator portion, and/or may be an element in a hierarchy of SNZI objects that filters changes in non-root nodes to a root node. SNZI objects may be accessed by software applications through an API that includes a query operation to return the value of the nonzero indicator, and arrive (increment) and depart (decrement) operations. Modifications of the data portion and/or the indicator portion may be performed using atomic read-modify-write type operations. Some SNZI objects may support a reset operation. A shared data object may be set to an intermediate value, or an announce bit may be set, to indicate that a modification is in progress that affects its corresponding indicator value. Another process or thread seeing this indication may “help” complete the modification before proceeding.

Abstract: Techniques for object relational mapping in database technologies are described herein. According to one embodiment, in response to a query statement for accessing a relational database, a syntax tree is generated to represent semantic information of the query statement, where the query statement includes a wildcard parameter and is implemented as an object of a SQL. A data type of the wildcard parameter is predicted based on the semantic information obtained from the syntax tree in view of a structure representing the syntax tree. The predicted data type of the wildcard parameter is used to access the corresponding entry of the relational database. Other methods and apparatuses are also described.

Abstract: A computer assisted method of searching at least one corpus of information based on at least one query. The method includes creating a generative index based on the corpus and a mapping of terms of the query to terms of the corpus. The method also includes searching the generative index and the corpus with the query to create a result comprising a portion of the corpus, wherein the result satisfies the query.

Abstract: A web application and a method for creating complex query strings for conducting searches in through at least one database comprising structured documents that are structured in content-fields. The application comprises a GUI with an interactive table enabling users to insert search words, where the user can define the relations between at least some of the search words by the words in the interactive table. The searches through the structured documents' database may be conducted according to the search words and he relations between them. Additionally, the application may allow the user to associate content-fields with at least some of the search words and conduct the searches in the content-fields defined for each search word.