Abstract: One or more techniques and/or systems are provided for interactively associating a semantic concept with a unique term that is input by a user. As the user is creating a document and/or once the user has completed a draft of the document, the document is parsed to identify unique terms (e.g., persons, places, things, services, etc.) in the document. When a unique term is identified, a query is generated to locate one or more semantic concepts (e.g., URLs, URNs, or other identifiers, for example) that are associated with the identified unique term and a notification indicative of the results is generated. From this notification, the user can select whether to associate the unique term with any and/or all of the located semantic concepts. In this way, supplemental content may be added to a document that the user is creating, for example.

Abstract: A fuzzy, or ambiguous, keyword searching process and systems for implementing the fuzzy keyword searching process are provided. In general, one or more keyword search terms are first identified for a search. Next, a user is enabled to adjust a logical fuzziness, or logical ambiguity, for each of the one or more keyword search terms. As used herein, logical fuzziness of a keyword search term refers to the extent to which associated keywords are considered for the search. In one embodiment, the user may also be enabled to view and adjust keyword associations for each of the keyword search terms. A search is then performed based on the one or more keyword search terms and the logical fuzziness of the one or more keyword search terms, and results of the search are presented to the user.

Abstract: Monadic types are preserved for query operators to further query operator compositionality utilizing operators defined over a monad. Query operators that are defined over a monad and are suited to return non-monadic types are constructed or altered to return a monadic type. For instance, aggregate query operators defined over a local or remote sequence monad can be generated that return a monadic type.

Abstract: A method of transforming relational queries of a database into on a data processing system includes receiving a series of relational queries, transforming first parts of the queries into a continuous query embodied as a streaming application, sending parameters in second parts of the queries in the series to the streaming application as a data stream, and executing the continuous query based on the received data stream to generate query results for the series of relational queries. Each query in the series includes a first part and a second part. The first parts are a pattern common to all the queries in the series and the second parts each have one or more parameters that are not common to all of the queries in the series.

Abstract: A system may determine an extent to which a document is selected when the document is included in a set of search results, generate a score for the document based, at least in part, on the extent to which the document is selected when the document is included in a set of search results; and rank the document with regard to at least one other document based, at least in part, on the score.

Abstract: Systems and methods for identifying inadequate search content are provided. Inadequate search content, for example, can be identified based on statistics associated with the search queries related to the content.

Abstract: A system and method may include a processor that normalizes dynamic URLs by sorting URL parameters and removing duplicative URL parameters. The processor may additionally or alternatively provide redirects from one URL to another, where the two URLs are associated with duplicative content. The processor may additionally or alternatively insert a canonical tag into content associated with a URL, where the canonical tag points to another URL whose content is a near duplicate of the content associated with the first URL. The processor may additionally or alternatively apply transformation rules to content of a webpage based on the matching of portions of the URL of the webpage to various character strings.

Abstract: A system may determine an extent to which a document is selected when the document is included in a set of search results, generate a score for the document based, at least in part, on the extent to which the document is selected when the document is included in a set of search results; and rank the document with regard to at least one other document based, at least in part, on the score.

Abstract: A computer-implemented system for facilitating cross-subsystem queries of a plurality of building automation subsystems includes a first database storing a logical model for a building automation system. The system further includes a second database storing information for the plurality of building automation subsystems. The second database relates information for the plurality of building automation subsystems based on the logical model of the first database. The system also includes a query engine configured to decompose a cross-subsystem query received from an application into a plurality of subsystem queries using the information of the second database.

Abstract: A computer-implemented method of realizing an associative memory capable of storing a set of documents and retrieving one or more stored documents similar to an inputted query document, said method comprising: coding each document or a part of it through a corresponding feature vector consisting of a series of bits which respectively code for the presence or absence of certain features in said document; arranging the feature vectors in a matrix; generating a query feature vector based on the query document and, according to the rules used for generating the feature vectors corresponding to the stored documents such that the query vector corresponds in its length to the width of the matrix; storing the matrix column-wise; for those columns of the matrix where the query vector indicates the presence of a feature, bitwise performing one or more of preferably hardware supported logical operations between the columns of the matrix to obtain one or more, additional result columns coding for a similarity measure bet

Abstract: Systems, methods, and other embodiments associated with processing regular expressions are described. One example method includes analyzing a rule for a regular expression and deleting the regular expression.

Abstract: Disclosed is a system for, and method of, identifying an entity representation. In some embodiments, search criteria are used to identify an entity representation in a universal database, and this identification is then used to identify a corresponding entity representation in a foreign database. Certain embodiments provide assurance, with a know probability of error, that the entity representation identified in the universal database is correct.

Abstract: An apparatus and method for updating a named entity dictionary or a mining rule database using the named entity dictionary and a mining rule combined with an ontology schema is provided. The apparatus includes a named entity dictionary and mining rule database storage module storing the named entity dictionary and a mining rule database; a mining pattern generation module recognizing a terminology from a text and converting the terminology into the mining pattern; a named entity and mining rule search module searching for a corresponding named entity and a mining rule from the named entity dictionary and the mining rule database using the recognized terminology and the mining pattern; and a named entity dictionary update module estimating a named entity of the terminology using the mining rule and storing the estimated named entity of the terminology in the named entity dictionary depending on a user's selection.

Abstract: A structured query may specify attribute values for attributes. An estimate of the number of items that will match the structured query if it is applied to a structured database is determined. If the estimated number of items is below a threshold, the structured query may be relaxed to form new candidate structured queries. The number of candidate queries may be determined based on a desired running time. Each of the candidate structured queries may be determined by changing one or more attribute values of the attributes of the structured query. Estimates of the number of items each of the candidate structured queries will match is determined, and the candidate structured query that has the highest matching estimation is used to query the database. The matching results may be output.

Abstract: In one aspect of the present invention, a software component for conducting digital forensic searches is described. The software component has a header; one or more search markup language programs, and a data features section. The software component, also referred to as a search pack, enables a first entity, such as a federal investigation agency, to share its suspect and sensitive data with a second entity, such as another investigative agency in a manner that allows the second agency to utilize the suspect data while not revealing the actual content of the sensitive data to the second agency. The second agency can perform comparisons and other operations on the sensitive data without having to know the actual content of the data. The search pack allows an investigative agency to define an investigative strategy for a particular case via the search markup language programs and by the data features that it includes in the search pack.

Abstract: A technique is provided for processing search results. The technique includes executing a search based on a user input entered via a graphical user interface using a processor, identifying relevant documents based on the search, and obtaining a standard classification for each relevant document. The standard classification is a classification within a standard classification system. The technique also includes reclassifying each relevant document, based on the relevant document's standard classification, into an interpretive classification within an interpretive classification system. The interpretive classification comprises at least a primary class and a secondary class. The technique further includes grouping the relevant documents into each relevant document's primary class and secondary class, and displaying the primary classes of the relevant documents and a number of relevant documents grouped in each displayed primary class via the graphical user interface on a display device.

Abstract: Disclosed is a method of querying a collection of electronic documents, comprising defining a query for retrieving a numerical answer, said query comprising one or more search terms and a tolerance for said numerical answer; defining a set of document portions from said collection, each document portion in said set being extracted from an electronic document and comprising at least one term relevant to at least one of the one or more search terms and a numerical value associated with the at least one term; ordering the associated numerical values contained in said set; defining a plurality of results groups, each results group comprising an interval of ordered numerical values, each interval having a range not exceeding the tolerance; ranking the results groups; and returning at least the interval of the highest ranked results group as a response to said query A computer program product for executing this method on a computer processor and a server are also disclosed.

Abstract: Systems and methods that for searching and displaying ontology-based data structures so that the essential and relevant qualities of searched subject matters may be categorized by subject indices.

Abstract: Method and systems for performing high volume searches are described. In one example a method includes receiving a query directed to a database, the database including a plurality of items, determining whether the query complies with one of a plurality of search criteria, each of the plurality of search criteria corresponding to a predefined index of the database, selecting a predefined index of the database corresponding to one of the plurality of search criteria if the query complies with said search criterion, the index containing entries that comply with the corresponding search criterion, applying the query to the selected index to find database items referenced in the index, selecting items based on applying the query to the selected index, building a report for the query, the report including only items of the selected index.

Abstract: The invention relates to a method, a system (101) and a computer program product to identify a particular data object of a data type in a database (104) that comprises data objects of the data type. The system (101) comprises a query composition unit (102) to compose a search query to identify a candidate data object being a candidate for the particular data object. A search unit (103) identifies the candidate data object in the database (104) based on the search query. A presentation unit (105) presents the candidate data object to the user. A feedback receiving unit (106) receives user feedback on the relevance or irrelevance of a segment of the candidate data object. The search unit (103) further identifies an improved candidate data object in response to the received user feedback. The improved candidate data object is an improved candidate for the particular data object.

Abstract: A social networking system facilitates a user's creation of a group of other users from among the user's connections in the user's social network. The created groups may be used, for example, to publish information to certain user-defined groups or to define privacy settings or other access rights to the user's content according to such user-defined groups. When a user adds connections to a group, the social networking system determines suggested connections that have not been added to the group, based on a similarity of the suggested connections with one or more of the connections who have been added to the group. These suggested connections are then presented to the user to facilitate the creation of the group. Both positive and negative feedback may be used to generate a useful set of suggestions, which may be updated as the user further defines the group.

Abstract: A data search device to extract relevant data matching a specified requirement from multiple pieces of data to be searched stored in a database. The data search device includes a specified requirement data acquisition unit to acquire specified requirement data including the specified requirement, a data extraction unit to extract the relevant data based on the specified requirement data, an extracted data counter to count a number of pieces of the relevant data for each piece of classification data provided for the data to be searched, a display data generation unit to generate data to display the number of pieces of the relevant data counted for each piece of classification data on a coordinate space based on the classification data, and a positional data storage unit to store positional data including coordinates for specifying a position in the coordinate space and the classification data associated with the coordinates.

Abstract: The present invention is related to the task of retrieving numeric information in response to a textual keyword-based query by automatically associating a unit to the type of data being retrieved. An information retrieval system is presented which suggests a unit for data exploration by leveraging the local environment of numeric data across the corpus. This local environment is parsed, including through natural language processing and proximity-based techniques, to determine units relevant to particular keyword phrases. The system also relies on knowledge of semantically and scientifically related units to optimize their binning for suggested unit scoring.

Abstract: The present invention relates to the identification, extraction, linking, storage and provisioning of data that constitute the captioned components of published or “print ready” literature for computerized information discovery activities including search, browse and data mining. These components, or objects, include the tabular presentation of data (“tables”) and graphics such as “figures”, “images” and “illustrations” typically used to supplement the textual narrative of the publication.

Abstract: Using a processor, receiving, a query including a query image. A database is searched for a set of images similar to the query image, using a two-pass search. The results of the searching are then provided, the results including image members of the set of images similar to the query image. The first pass may be performed using a TF-IDF algorithm and the second pass ranks a predetermined number of results from the first pass by a best match algorithm or other type of algorithm. The type of second pass algorithm may be selectable by a user. If an end signal is not detected, a further two-pass search may be made based on a subsequent query having a subsequent query image. The subsequent query image may one of the results of the previous two pass search. A subsequent query image may change from an image of a product of a first product category to an image of a product of a second product category.

Abstract: Query utilization in which a rate of a plurality of queries to a data source may be determined for a plurality of time periods. A cost may be associated with a query state transition. A query state may be assigned to a particular query on a particular time period of the plurality of time periods based on the rate of queries for the particular time period and the cost of the query state transition. A query burst may be identified during the plurality of time periods based on assignment of a query state to the plurality of queries. The query may exhibit a normal query state, a normal-to-deviated query state transition, and a deviated query state. A query burst identification module may identify a query burst during the plurality of time periods, a burst conversion module may convert the query burst to a wavelet using a wavelet transform, a clustering module may apply a clustering technique to the wavelet, and a query classification module may classify the query burst based on applying the clustering technique.

Abstract: A method includes generating, electronically, one or more matching patterns for one or more pairs of attribute values. Each pair includes two attribute values. The two attribute values include a first attribute value from a first record and a second attribute value from a second record. The first attribute value and the second attribute value satisfy a first criterion. Further, the method includes identifying, electronically, matching segment between the first attribute value and the second attribute value of a first pair. The method also includes repeating identifying for each pair. Moreover, the method includes computing a similarity score for the first pair using one of the first pair and the matching segment based on the one or more matching patterns and matching segments of the one or more pairs satisfying a second criterion. The method also includes repeating computing for each pair.

Abstract: The present disclosure provides an information search method and system applicable in an information search system wherein each document has corresponding forward index data to address the issue of low search efficiency suffered by existing information search techniques. In one aspect, the method may include: receiving an inquiry word and obtaining one or more keywords contained in the inquiry word by segmentation; searching one or more documents matching the one or more keywords and forward index data corresponding to the one or more documents through the information search system's inverted index data; and determining an abstract of each of the one or more documents according to a corresponding document's forward index data, and outputting the abstract and information of the one or more documents as a search result. The proposed techniques can increase efficiency of information search and, at the meantime, guarantee accuracy of the search to a certain extent.

Abstract: Provided are a search method using an extended keyword pool and a system for performing the method.

Abstract: The present invention relates to a method and apparatus for extracting the semantic relations of context and a recording medium storing the program source thereof. The present invention is intended to detect technical terms by parsing full text of documents and recommend research topics using the relations therebetween using a method of searching for a first concept connected to a specific vocabulary word through a casual relationship and a second concept connected to the first concept through a causal relationship, determining the relation therebetween and performing recommendation as research topics. The present invention has the industrial utilization advantage of improving the overall search efficiency and utility of massive databases.

Abstract: An XML wrapper queries an XML document in an on-the-fly manner so that only parent nodes in the document that satisfy the query are extracted and then unnested. The parent nodes and associated descendent nodes are located using XPath expressions contained as options in data definition language (DDL) statements. The parent nodes satisfying the query and associated descendent nodes are extracted and stored outside of a database according to a relational schema. The wrapper facilitates applications that use convention SQL queries and views to operate on that information stored according to the relational schema. The wrapper also responds to query optimizer requests for costs associated with queries against external data sources associated with the wrapper.

Abstract: A method for providing a viewable search results log to allow determination of the effectiveness of search strategies and sharing results of searches with others. The search results log reveals search strategies utilized by a human searcher with which the search results log is associated. The search results produced by at least one human searcher are stored in the search results log and presented according to a view format selected by a viewer. The search results log can be interrelated to other systems such as a blog or a search engine.

Abstract: Techniques for loading Java classes referenced in a continuous query. In one set of embodiments, the Java classes can be loaded based on a class space defined for an application considered to be in scope for the query. In another set of embodiments, the Java classes can be loaded based on a server class space that includes all exported classes visible to the event processing system executing the query.

Abstract: A system, method and computer program product for identifying near and exact-duplicate documents in a document collection, including for each document in the collection, reading textual content from the document; filtering the textual content based on user settings; determining N most frequent words from the filtered textual content of the document; performing a quorum search of the N most frequent words in the document with a threshold M; and sorting results from the quorum search based on relevancy. Based on the values of N and M near and exact-duplicate documents are identified in the document collection.

Abstract: A methodology for selecting a part of a group of many similar units (i.e. workers as part of a team, retail store locations as part of a store chain, bolts as part of a bolts lot of many similar bolts, etc.), based on the combination of multiple performance and/or characteristics criteria, which includes the following steps: identification of the source group out of which some will be selected, (i.e. team of 25 welders), specification of the exact number of selectees needed (i.e. 12 welders to be laid off), identification and definition of performance criteria to be considered (i.e. productivity, quality, tenure, attendance) and their weights, ranking the entire team by order of each separate criterion and assigning an individual ranking score (i.e.

Abstract: A method of extracting publications relevant to a reference entity, comprising the steps of generating an initial set of publications; associating the initial set with a database to generate a user-engageable display of at least one element relating to the at least one publication such that the at least one element is a required characteristic of the at least one publication in accordance with a predetermined standard of analysis; selecting at least a first element from the at least one element that represents a characteristic not present in the reference entity; yielding a result including publications in the initial set and excluding publications relating to the selected at least a first element in accordance with the predetermined standard of analysis.

Abstract: In an embodiment of the invention, analytical data may be extracted from a business intelligence (BI) system on criteria specified in metadata of a business intelligence query. Once the data is extracted from the BI system, the extracted content may be provided in the context of semantic identifiers. In an embodiment, the semantic identifiers may provide a description of the extracted content associated with the identifier. In one embodiment, the semantic identifiers may be obtained from the criteria specified in the query. In another embodiment, the semantic identifiers may be defined in and obtained from a separate enterprise service repository. In an embodiment, a proposed mapping between query elements and semantic identifiers may be suggested by a processor.

Abstract: A system that can analyze a multi-dimensional input thereafter establishing a search query based upon extracted features from the input. In a particular example, an image can be used as an input to a search mechanism. Pattern recognition and image analysis can be applied to the image thereafter establishing a search query that corresponds to features extracted from the image input. The system can also facilitate indexing multi-dimensional searchable items thereby making them available to be retrieved as results to a search query. More particularly, the system can employ text analysis, pattern and/or speech recognition mechanisms to extract features from searchable items. These extracted features can be employed to index the searchable items.

Abstract: A framework for extending the capabilities of an event processing system using one or more plug-in components referred to herein as data cartridges. In one set of embodiments, the data cartridge framework described herein can enable an event processing system to support one or more extension languages that are distinct from the native event processing language supported by the system. For example, certain “extension language” data cartridges can be provided that enable an event processing system to support complex data types and associated methods/operations that are common in object-oriented languages, but are not common in event processing languages. In these embodiments, an event processing system can access an extension language data cartridge to compile and execute queries that are written using a combination of the system's native event processing language and the extension language.

Abstract: An illustrative embodiment provides a computer-implemented process for semantic verification of multidimensional data sources that receives a trusted output from a trusted multidimensional expression engine, receives an un-trusted output from an un-trusted data source and determines whether a query produces a correct semantic result, wherein the correct semantic result is within a predetermined tolerance. Responsive to a determination that the query does not produce a semantically correct result, identifies queries having semantically incorrect results to form a local subset, notifies a query planner of semantically incorrect queries and determines whether to process queries locally. Responsive to a determination to not process queries locally, creates a set of simplified multidimensional expression queries for remote execution.

Abstract: According to an aspect of the invention, a computer readable medium stores a program causing a computer to execute a process for retrieving information. The process includes an extracting process, an executing process, a first creating process, a second creating process, a determining process. The extracting process extracts, from a first composition that is an object to be searched for and that includes first sentence elements and a second composition that indicates a retrieval condition and that includes second sentence elements, the first sentence elements, the second sentence elements, and sentence element relations indicating relations between the first sentence elements and relations between the second sentence elements.

Abstract: An apparatus and method for processing a data stream using a cluster query, are provided. Collected queries are clustered into a predetermined vector space based on a feature vector of the collected queries. In response to a query received from a user, the received query is classified to a cluster and may be replaced with a centroid query of the cluster to which the received query belongs. The data stream processing apparatus processes the centroid query and provides an approximate result to the user.

Abstract: A method and system for storing information on a search result selected by a user with respect to a predetermined query, reflecting the user's preference by utilizing the information when the user inputs an identical query and requests a search, and providing a personalized search result in which user preferences are reflected. More particularly, a personalized search method and system utilizing favorites of a web browser in which a personalized search result is provided to each user by utilizing information on a website that the user bookmarked as the user's favorites is provided. According to the present invention, there is provided a personalized search service method and system which can provide a user with a personalized search service, even when user information is not stored in a search server and also, even when the user does not log in.

Abstract: A machine based tool and associated logic and methodology are used in converting data from an input form to a target form using context dependent conversion rules, and in efficiency generating an index that may be utilized to access the converted data in a database. Once the data has been converted, an index data structure for each data object may be automatically generated that encodes one or more characteristics or attributes of the converted data so that an entity may access the data using the index structure. As an example, the one or more characteristics may include categories, subcategories, or other attributes of the data.

Abstract: In embodiments, the number of references to an object which is deployed into an application server framework may be determined by examining metadata extracted from configuration data sources within a multi-tier application framework. In embodiments, an object relevance value based on the extracted number of references to an object may be associated with the object. In embodiments, the number of references extracted from a data source may be weighted using a weight factor that is associated with the data source. In embodiments, the number of references to a source object may be extracted by traversing a source inheritance hierarchy and parsing the objects within the hierarchy. In embodiments, an object relevance display of a set of objects may be generated based in part on object relevance values of the set of objects. In embodiments, an object relevance display may be a molecular display, a flash tag cloud, and/or a source tree hierarchy.

Abstract: XPath evaluation in an XML data repository includes parsing an input XPath query using a simple path file to generate an execution tree about the XPath query, where the simple path file includes an XML file that is generated based on the hierarchical architecture of a plurality of XML files in the data repository, and the names of the nodes in the generated XML file are generated by recording the tag information of respective nodes in the plurality of XML files in the data repository. Execution of an execution tree for the data repository generates a final evaluation result.

Abstract: A method and system for an internet-based online research solution through the comparison and contrasting of a potentially infinite number of subjects having defined attributes within predefined as well as dynamic subject contexts; a method and system for searching a potentially infinite number of subjects against a customized set of attribute-value configurations to arrive at an appropriate set of subjects for further research; a method and system for an online research solution by which the user efficiently researches online using a highly customized search, collation, and compilation of comparison-contrast information; a Universal Research Framework that may be embedded within any externally managed information system and which enables the above three methods to be performed within the specific system for research.

Abstract: A computationally implemented method includes, but is not limited to: determining whether a plurality of end users deviated from compliantly executing a template designed to facilitate the plurality of end users in achieving one or more target outcomes when one or more emulatable aspects included in the template are emulated by the plurality of end users, the one or more emulatable aspects being based on one or more relevant reported aspects of one or more source users that were deemed to have been relevant to achieving the one or more target outcomes; and modifying the template based, at least in part, on determining that the plurality of end users deviated from compliantly executing the template In addition to the foregoing, other method aspects are described in the claims, drawings, and text forming a part of the present disclosure.

Abstract: An information retrieval system and method, and more particularly, a query/document topic category transition analysis system and method in which a query topic category of a query input from a user as an information retrieval keyword and a document topic category of a document which a user regards as relevant and selects from information retrieval results are classified to analyze transition between the query topic category and the document topic category, and a query expansion-based information retrieval system and method using query/document topic category transition analysis in which a query input from a user is expanded using a topic category transition analysis result, and corresponding information or documents are retrieved using the expanded query are provided.

Abstract: A method and system for identifying commonality among pattern definitions among multiple database storage systems. The method creates pattern definition files for all pattern definitions stored in multiple databases. The name of a pattern definition file includes a group name, a pattern number, and a database associated with the pattern definition. A set of pattern definition files with same group name and pattern number are compared with each other to classify the set into exactly matching or partially matching.