Abstract: Creation, association, and/or placement of search forums for searches strings enable users to discuss aspects of both searches and elements associated with the searches, and further enable the users to view discussions from other users. The search forum may be generated from variations of the search string. In addition or alternatively, search strings may be associated with existing item forums, category forums, and tag forums. Search forums may be placed with, for example, search results or with items, categories, and/or tags, among other possibilities, to provide user access to the search forums.

Abstract: Performing location-aware search involves intercepting a network request targeted for an Internet-based search engine. The network request includes a location-dependent query containing a location term, and the location term cannot be used by the search engine to positively determine a target location. A location descriptor that can be used by the search engine to positively determine a target location is determined via a location database. The location database may include a location sensor such as GPS. The network request is modified to replace the location term with the location descriptor, and the modified network request is sent to the search engine.

Abstract: A method and apparatus for intelligent caching is provided. A thin layer of business logic on a web server receives URL requests sent to the web server from clients and resolves the URLs into URLs corresponding to component parts of the requested document according to the rules of a rule set. Thus only the component resources of a composite document are cached in the web server's caching layer. The rule set defines a format for the requests sent to the web server, the manner in which properly formatted requests should be resolved, and the manner in which the component resources should be assembled into the composite document.

Abstract: A system and method for accessing requested data in a database using result set objects. The invention also provides a set of enhancements to the EJB Query Language (“EJB QL”) for providing result sets using EJB QL and to efficiently access databases using select methods within Enterprise Java Beans. EJBQL language extensions allow for the selection and retrieval of result sets. Since the use of the invention is expressed in terms of object relational constructs defined in an EJB deployment, it allows for the retrieval of data from a database expressed in terms of the relationships defined in that EJB deployment.

Abstract: An improved system and method for identifying context-dependent term importance of queries is provided. A query term importance model is learned using supervised learning of context-dependent term importance for queries and is then applied for advertisement prediction using term importance weights of query terms as query features. For instance, a query term importance model for query rewriting may predict rewritten queries that match a query with term importance weights assigned as query features. Or a query term importance model for advertisement prediction may predict relevant advertisements for a query with term importance weights assigned as query features. In an embodiment, a sponsored advertisement selection engine selects sponsored advertisements scored by a query term importance engine that applies a query term importance model using term importance weights as query features and inverse document frequency weights as advertisement features to assign a relevance score.

Abstract: A system and method for abstracting objects in a virtual universe (VU) deployment is provided. The system and method abstracts VU objects for editing in a common abstraction utility and for deploying to one or more VU grids containing one or more VU architectures and/or platforms (servers). The method can be implemented in a computer infrastructure having programming instructions operable to: obtain an object associated with a first virtual universe server; translate the object with syntax specific to at least a second virtual universe server, the syntax being different than that used with the first virtual universe server; and deploy the translated object to the second virtual universe server.

Abstract: Methods and systems for extending keyword searching techniques to syntactically and semantically annotated data are provided. Example embodiments provide a Syntactic Query Engine (“SQE”) that parses, indexes, and stores a data set as an enhanced document index with document terms as well as information pertaining to the grammatical roles of the terms and ontological and other semantic information. In one embodiment, the enhanced document index is a form of term-clause index, that indexes terms and syntactic and semantic annotations at the clause level. The enhanced document index permits the use of a traditional keyword search engine to process relationship queries as well as to process standard document level keyword searches. In one embodiment, the SQE comprises a Query Processor, a Data Set Preprocessor, a Keyword Search Engine, a Data Set Indexer, an Enhanced Natural Language Parser (“ENLP”), a data set repository, and, in some embodiments, a user interface or an application programming interface.

Abstract: A computer system includes a user interface, which includes a display device for displaying a graphical program interface. The graphical program interface includes one or more controls for assigning at least one attribute value to an attribute of an object. The graphical program interface also includes a current attribute values interface in which attribute values assigned to the object are displayed and an assignable attribute values interface in which a limited set of possible values of at least one of the attributes are shown. At least one of the current attribute values interface and assignable attribute values interface includes a value select control for selecting at least one of the possible values and assigning this selected value to the object attribute.

Abstract: One embodiment is a method that stores user interface events and file system events to capture text snippets visible on an output device. Similar text snippets are merged into a context graph that is used to locate a document from a query.

Abstract: Provided is a system, method, and program for specifying multidimensional calculations. Selection of a subset of a cube model metadata object that is generated from a facts metadata object and one or more dimension metadata objects is received. The facts metadata object references one or more measure metadata objects. A statement is generated for retrieving multidimensional information using metadata in the cube model metadata object and the measure metadata objects, wherein each of the measure metadata objects specifies one or more aggregations.

Abstract: Aspects may include determination of a first security profile associated with a user and an information space, the information space comprising metadata indicating a plurality of objects mapped to logical entities of a hierarchical data structure, reception of a request from the user for an interface for creating queries to the hierarchical data structure, and determination, based on the first security profile, of a first subset of the plurality of objects based on which the user is allowed to create queries. A query is executed based on one or more of the first subset of objects, data of the hierarchical data structure is received in response to execution of the query, a second subset of the received data which the user is allowed to view is determined based on the first security profile, and the second subset of the received data is presented to the user.

Abstract: A computer-implemented method for providing a search result is disclosed. The method comprises, making a presentation of a dataset with structured data; and storing metadata items that define the dataset from a data superset that is stored in a first database with structured data. The method also comprises converting the metadata items to a search request, submitting the search request to a search engine to search for documents located in second database; capturing the search result; and making a presentation of the search result.

Abstract: A resource string associated with output text is identified. A regular expression pattern is generated from the resource string. The regular expression pattern is matched to the output text. A verification result based on the matching of the regular expression pattern to the output text is provided.

Abstract: A method, system, and article of manufacture to process database queries are disclosed. One embodiment comprises receiving an abstract query against a database having a multiplicity of data records. The abstract query identifies a model entity that defines a focus of the abstract query. The method further comprises receiving a limitation request configured to restrict a result set for the abstract query. The limitation request specifies a limitation on data records that are returned for one or more instances of the underlying model entity. From the abstract query, an executable query capable of being executed by a query engine is generated. The executable query is modified on the basis of the limitation request. The modified executable query is executed against the database to obtain the result set, whereby the result set is restricted as requested by the limitation request.

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: Systems and methods for processing an inverted index are described. Multiple queries against the same inverted index are merged into merged query of unique nodes. The unique nodes are used to create a unified document set from which query result iteration is performed to eliminate redundancies and/or inefficiencies in processing the multiple queries separately. The merged query result is separated into the results for each of the multiple queries and returned to the respective originators of the queries. The unified document set can be limited to postings lists found in a single pulse of the inverted index to improve performance. Index updates can be applied to the merged query result to provide efficient and up to date query results.

Abstract: A system and method of providing information to improve efficiency of human searchers obtaining information on behalf of users is described. A query is processed to improve its form prior to being presented to a human searcher. A type associated with a query is determined which may affect a probability that a human searcher will respond to the query. Actions of a human searcher may be used to modify automated processing and decision making for processing of a query.

Abstract: The subject invention pertains to the integration of an object model and a multidimensional database query language such as MDX. In particular, multidimensional declarative query language entities can be exposed through objects in an object model. The object model enables generation and employment of procedural language functions, routines, or procedures that interact with multidimensional database data. This effectively provides an extension for multidimensional query languages. For example, procedures can be stored and invoked from a declarative language query. Furthermore, the object model disclosed herein can expose a context object to enable conditional procedures based on the context of execution.

Abstract: A natural language based location query system and a method thereof. The system comprises a receiving device which receives a request for natural language query from a user terminal; an access device which accesses a location ontology base and a location query language base that are external to the system or internal in the system, wherein the location ontology base comprising knowledge descriptions about the field of a location service, and the location query language base comprising a language model for the location service query; a natural language query processing device which performs at least one of a fuzzy processing and an indirection processing on the received request for natural language query by searching the location ontology base and the location query language base with the access device, retrieves location information corresponding to the request from a location database; and a sending device which sends the location information to the user terminal.

Abstract: A bioinformatics method, software, database and system for compiling attribute combinations that co-associate with a query attribute (i.e., an attribute of interest) are presented in which expanded attribute profiles associated with a group of query-attribute-positive individuals and expanded attribute profiles associated with a group of query-attribute-negative individuals are accessed, and combinations of attributes having a higher frequency of occurrence in the set of expanded attribute profiles associated with the group of query-attribute-positive individuals are identified and stored to generate a compilation of attribute combinations that co-associate with the query attribute.

Abstract: Pursuant to receipt of a data modification command or statement, such as an Update command, it is determined which fields in a data structure, such as a UDT, computed column, indexed view, or index, for example, will be changed as a result of the command. Only those fields that are affected by the command will be changed. Thus, changes are propagated to only to those dependent data structures whose content is being modified. Tree representations are used to facilitate the determination as to whether a subfield in a hierarchy is changed.

Abstract: A query may be rewritten to leverage information stored in a structured XML index. An operator in the query may be analyzed to determine an input source database object for the operator by traversing an operator tree rooted at the operator. The path expressions associated with the operator tree may be fused together to form an effective path expression for the operator. If the effective path expression directly matches a path expression derived from the index, the query may be rewritten using references to the index. Operators in a query that have effective paths that refer to data in the same index table may be grouped together. A single subquery may be written for a group of operators. Also, a structured XML index may be used as an implied schema for indexed XML data. This implied schema may be used to optimize queries that refer to the indexed XML data.

Abstract: In one aspect, the invention comprises a computer system for searching databases and displaying search results, comprising databases storing information regarding publications and authors comprising author, title, date of publication, cited references, and citing references data; and Internet servers in communication with those databases; wherein at least one of those Internet servers is in communication with and operable to transmit data to a Web browser resident on a user's computer, and wherein the data is sufficient to enable the browser to display a citation overview page comprising: (a) a list of one or more titles of publications or names of authors, and (b) one or more displayed numerals representing how many publications in one or more specified categories cite to each of the publications, or, for author names, how many publications in one or more specified categories cite to publications on which those names are listed as authors.

Abstract: A method, system, and computer program product are disclosed for merging search results. In one embodiment, the method comprises identifying a query, splitting the query into sub-queries, and calculating information content for each of the sub-queries. This method also comprises executing each of the sub-queries to obtain a plurality of search results, and combining the search results based on the information content calculated for the sub-queries. In an embodiment, the execution of each of the sub-queries includes identifying a multitude of search results for at least one of the sub-queries; and the combining includes grouping said multitude of search results into a plurality of clusters, and computing a relevance score for each of said clusters. In the embodiment the combining further includes merging the clusters based on the relevance scores computed for the clusters as well as the information content calculated for the sub-queries.

Abstract: The present invention enables customized technical computing within a database. The present invention provides a method and system to insert a software function implemented in a technical computing environment into a database to manipulate data and use the software function as a database procedure. Once the software function is generated, in response to a single action being performed, two components are generated and stored in the database. The two components working together allow the software function to be invoked as a database procedure. The present invention offloads a user's burden to learn the often complicated database query language and decreases the amount of network traffic between a client computer and a database.

Abstract: At least one implementation described herein relates to evaluating queries structured according to a first format against one or more objects structured according to a second, different format without serializing the object. Typically, evaluating an XML (eXtensible Markup Language) query against a CLR (Common Language Runtime) object required serializing the CLR object and deriving an XML construct from the serialized data. The query is then be evaluated against the XML construct. In the described implementations, significant system resources are realized by creating an infoset model that maps properties of an object to an object infoset. The query is then evaluated using the infoset to locate object values and, thus, no serialization is required. Dynamically generated IL is used and re-used to efficiently perform subsequent evaluation steps on similar queries.

Abstract: An approach is provided for creating and utilizing information representation of queries. A query application receives a query. The query application expresses the query as a resource description framework graph. The query application causes at least in part storage of the query resource description framework graph.

Abstract: A computer implemented method for executing an ANSI SQL expression belonging to the SELECT-WHERE-equi-JOIN class on data residing in a distributed file system, said method comprising the steps of entering the ANSI SQL expression into a user interface; converting the ANSI SQL expression into a map-reduce program; running the map-reduce program on the distributed file system; storing the result set of the program in the distributed file system; and presenting the result set through a user interface.

Abstract: An index update component updates an index of a database in response to a query to the database referencing the index. An index control record tracks the last time the index was referenced and state of the index compared to the state of the database. An index deletion component deletes indexes in the database that have not been referenced for a period of time.

Abstract: An auditing system receives a set of audit rules from a database administrator, which define a search criteria used to identify a database object that is desired to be audited. The auditing system uses the audit rules to search through a database to identify a corresponding set of database objects that satisfy at least one of the set of audit rules. Then, the system generates audit commands that configure a database management system to audit the identified set of database objects.

Abstract: Disclosed is a data processing-implemented method, a data processing system, and an article of manufacture for modifying a query during compilation of the query. The query includes a request for an element of data from a table in a database and parameters identifying the requested element.

Abstract: A preferred method embodiment of the subject invention comprises a method for dynamically creating hierarchies to be used in database searches, comprising the steps of: (a) defining a data network; (b) receiving a query regarding data stored in one or more databases; and (c) based at least in part on said query and on said data network, dynamically building a hierarchy. A preferred system embodiment of the subject invention comprises a system for dynamically creating hierarchies to be used in database searches, comprising: (a) means for defining a data network; (b) means for receiving a query regarding data stored in one or more databases; and (c) means for, based at least in part on said query, dynamically building a hierarchy from said data network.

Abstract: An apparatus, program product and method dynamically optimize prepared statements resident in a statement pool to permit subsequent reuses of such statements to utilize the optimized representations of such statements. The optimization of pooled statements may be performed responsive to the tracked usage of the statements in a statement pool, to direct the overhead associated with such optimization to those statements that are more likely to be utilized in the future. Among a multitude of possible optimizations, a pooled statement that requests data in a format other than that utilized by the database being accessed may be modified to request the data in the format used by the database, thereby decreasing the overhead in the database associated with format conversions.

Abstract: An XQuery access API is described, for providing access to XML data from a data source, using the XQuery language. A requestor can request, from a server, performance of an operation on XML data, wherein request messages and response messages conform to the Simple Object Access Protocol (SOAP). Request and response messages can be transmitted using Hypertext Transfer Protocol (HTTP) or Hypertext Transfer Protocol over Secure Socket Layer (HTTPS). The format of the request and response messages is specified in a definition of a Web service, where the definition conforms to the Web Service Description Language (WSDL).

Abstract: A context aware, shortcut enabled system of presenting information through a user interface, implementing memory prostheses and context-oriented changes in meanings of shortcuts. Embodiments include selecting a context, receiving a shortcut entered through the user interface, the shortcut having a associated with it a shortcut field name set comprising one or more shortcut field names, and associating at least one context value to the context. Embodiments also include inferring, in dependence upon the context, a context table name and a context field name for a query, creating the query, selecting records from an information database by use of the query, whereby selected records are selected, and downloading the selected records to the client device for display.

Abstract: Methods and systems are disclosed for generating non-overlapping facets for an original query that is submitted for a search.

Abstract: A symbolic query exploration (QEX) module automatically produces output information that can be used to evaluate a database. The QEX module operates by converting an input query into a formula for processing by a satisfiability module theories (SMT) solver module. The SMT solver module generates a model that satisfies the formula. The model yields table information that is used to populate the database and, optionally, parameter information that is used to instantiate the query. A query evaluation module then submits the instantiated query to the populated database and evaluates whether an evaluation result produced thereby agrees with pre-specified condition information. The QEX module can preprocess the formula using either (or both) an eager expansion approach (in which the formula is expanded in an upfront manner) or a lazy expansion approach (in which axioms are identified for later possible expansion by the SMT solver module).

Abstract: Systems, methods and articles of manufacture are disclosed for generating a relational database query from an online analytical processing (OLAP) query against a cube. The cube may have dimensions, each dimension having a hierarchy of members. A level of the hierarchy of a dimension of the cube may be identified from which the OLAP query accesses a number of members exceeding a predefined threshold count of members. A relational database query may be generated that includes a predicate for at least one member from at least one level above the identified level in the hierarchy, instead of a plurality of predicates for members from the identified level. The relational database query may be generated from the OLAP query, from a definition for the hierarchy, and from the accessed members from the identified level. As a result, the relational database query may include fewer predicates and may be executed more efficiently.

Abstract: A computer-implemented method, computer-implemented system, and a computer program product for answering a database-based query of a computerized database system. The method includes: generating a canonical individual ind? with respect to a role and a concept, for an existential restriction in an ontology used in the computerized database system; converting implicit data in original data into explicit data using the canonical individual ind? and the ontology; and retrieving an answer meeting all query conditions in a query from the original data and the converted explicit data. The computer-implemented system includes: a canonical individual generation unit; a data conversion engine; and a query unit.

Abstract: A query may execute on stored original stream data obtained from stream data received from at least one data source. The original stream data may be deleted in association with new stream data being received. At least one operator of the query may be duplicated to obtain at least one duplicated operator, and the stored original stream data may be duplicated to obtain duplicated stream data. The at least one duplicated operator may be modified to obtain at least one modified operator and, thereby, a modified query. Original results may be determined based on execution of the at least one operator, and modified results may be determined based on execution of the at least one modified operator. The at least one operator and the original stream data may be replaced with the at least one duplicated operator and the duplicated stream data, to thereby obtain an integrated query for execution.

Abstract: A computer readable storage medium includes executable instructions to extract data model object information and report data values from data model objects in at least one semantic abstraction to define indexed fields. A search query is received. The search query is applied against the indexed fields to define matching data model objects and matching report data values. A proposed abstract query with at least one matching data model object and a corresponding semantic abstraction is generated.

Abstract: Techniques for determining whether an XML query may be written are provided. In one scenario, an XML query includes an expandable path, which is a path expression that includes a wildcard character (*) or a descendant axis (//). An XML schema is used to generate multiple expanded paths (each of which is a simple path expression) from the expandable path. The XML schema is used to compare each expanded path to another expanded path and to determine whether the nodes identified by the respective expanded paths are guaranteed to occur in a particular order in XML documents that conform to the XML schema. In another scenario, an XML query includes an order operator that takes two paths as input. Similarly, an XML schema is used to compare the two paths and to determine whether the nodes identified by the two paths are guaranteed to occur in a particular order in XML documents that conform to the XML schema.

Abstract: Methods, systems, and articles of manufacture that allow saved abstract queries to be referenced from within query statements constructed using standard query languages, such as Structured Query Language (SQL), are provided.

Abstract: Technologies for search-based filtering of a property grid. Such filtering allows a user to enter a search term into an easily recognized search text box, or apply a user or pre-defined term to a property grid, thus reducing the set of properties visible so that the user has a smaller list to search to find the one on which they desire to operate. The search term is typically applied to all properties shown in the property grid. Elements that match the search term are made visible in an updated property grid while those that do not match are not presented. Also, the search term may be applied to more than just the name of the property. It may be applied to a category within which the property appears, the type of the property, or any of a number of attributes or tags that may be applied to the property.

Abstract: A programming model for a query service (e.g., web) that supports defining query builders which are bound dynamically at runtime to parameter values. Moreover, the programming model can be used to customize the query execution, for example, by adding pre-processing, post-processing, or dynamic binding to queries (e.g., selecting the query to be executed dynamically at runtime). As a consequence, generalized and parameterized queries can be used (with different runtime values for parameters) in different scenarios.

Abstract: A system is described for discovering query intent based on search queries and concept networks. The system may construct frequency vectors from log data corresponding to a submitted query and at least one related query submitted to one or more search engines. The system may also construct a query intent vector based on the frequency vectors. The query intent vector may include frequency scores that represent the intent of the query.

Abstract: A method is provided for generating a user-defined function (UDF) on a database engine of a database server. A user-function is sent to the database engine. The user-function includes a relational declaration with application and query logic. When the database engine receives the user-function, the database engine generates a function shell. The UDF processes the relational declaration of the user-defined function. The UDF includes the user-function and the function shell. The function shell returns a final data result of the user-defined function through the shell from the database engine.

Abstract: An apparatus for processing an integrated query from various sensor networks and a method thereof are provided. The apparatus includes an integrated query parser for parsing an integrated query and analyzing a syntax of the parsed integrated query; an integrated query execution plan generator for analyzing meaning of the parsed integrated query and generating an integrated query execution query for processing an integrated query; an integrated query optimizer for optimizing a process time for the generated execution plan based on query information stored in the query information storage and sensor network information stored in the sensor network information storage; and an integrated query executer for detailing the integrated query execution plan by controlling an execution order according to the optimized integrated query and transferring the detailed integrated query execution plan to an event data process executer, a temporal data process executer, and a continuous data process executer.

Abstract: A query generation using cardinality constraints process including choosing a first set of parameters for a query, calculating an additional set of parameters based on the first set of parameters, executing the query using additional set of parameters, evaluating the cardinality error the additional set of parameters, and refining the additional set of parameters to meet the desired cardinality constraint. Creating a query and selecting parameters for the query to meet a desired cardinality constraint or set of cardinality constraints when the query is executed against a database may be difficult. A query generation using cardinality constraints process may create a set of parameters for a query which satisfies a desired cardinality constraint or set of cardinality constraints. An application of such a query generation using cardinality constraints process may be database component and code testing.

Abstract: A method and apparatus for automatically detecting and extracting information from dynamically generated web pages are disclosed. For example, the present method stores user provided information that is entered into a form interface of a web page for a first query. Responsive to the first query, a first response web page is received and stored. The present method then automatically generates a second query to acquire a second response web page that is responsive to the second query. Finally, the present method compares the first response web page and the second response web page. In one embodiment, the present invention extracts information that is dissimilar between the first response web page and the second response web page. This extracted information is deemed to be the pertinent information requested by the user.