Entries |
Document | Title | Date |
20100076991 | APPARATUS AND METHOD PRODUCT FOR PRESENTING RECOMMENDED INFORMATION - A recommended information presentation apparatus, including a display unit which displays text data, an extraction unit which extracts keyword candidates from the text data, a storage unit which stores semantic attributes of the keyword candidates, semantic attribute rules which contain scoring criteria for semantic attributes, descriptive phrases describing the keyword candidates and descriptive phrase rules which contain scoring criteria for descriptive phrases. The scores of the keyword candidates are calculated by a selection unit based on the semantic attribute rules and descriptive phrase rules and the highest scoring keyword candidates are selected as keywords. The selected keyword is used to search an information database by a search unit which also receives the search results which are displayed on the display unit by a control unit as recommended information with regards to the text information. | 03-25-2010 |
20100076992 | Methods and Systems for Data Integration - 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. | 03-25-2010 |
20100082653 | EVENT MEDIA SEARCH - In response to a request to search for media items, one or more gather terms and one or more filter terms are determined. Based on the one or more gather terms, a first set of media items is identified. A set of metadata associated with media items that belong to the first set of media items is identified. Based on the one or more filter terms, a set of qualifying metadata and a set of disqualifying metadata are established from the set of metadata. A second set of media items that are associated with metadata that include terms that satisfy matching criteria for one or more metadata from the set of qualifying metadata and do not satisfy matching criteria for any metadata from the set of disqualifying metadata is determined. The request is responded to with search results based on the second set of media items. | 04-01-2010 |
20100082654 | Methods And Apparatus Using Range Queries For Multi-dimensional Data In A Database - Embodiments include methods, apparatus, and systems for using range queries in multidimensional data in a database. One embodiment is a method that defines a query box from a search for multidimensional data in a database. The method examines an intersection between a Z-interval and the query box by decomposing the Z-interval into hyper-boxes that are also Z-intervals in Z space. Items in the query box that match the search are discovered. | 04-01-2010 |
20100082655 | PARALLEL EXECUTION OF RANGE QUERY - A method comprises receiving a range query from a requestor. The range query requests a range of sequential items in a database that is distributed among a plurality of storage devices or partitions. The range query is divided into R sub-range queries, where R is an integer. Each sub-range query corresponds to a respective portion of the range of sequential items stored in a respective storage device or partition. The sub-range queries are issued to respective ones of up to K storage servers, where K is an integer less than or equal to R. Each of the K storage servers is configured with read access to the respective storage device or partition storing the respective portion of the range of sequential items in the respective sub-range query issued to that storage server. | 04-01-2010 |
20100088331 | Domain Expertise Determination - A user's domain expertise may be estimated through several factors by monitoring different aspects of a user's interaction with a web browser. Based on the user's domain expertise, search results may be presented to the user that is commensurate with their expertise, resulting in a more efficient and productive on line session. A user's expertise in a knowledge domain may be determined from the user's behavior, including analyzing search queries, monitoring how the user navigates between and through websites, and analyzing the specific cites visited. As a user interacts with a browser, the user's estimated domain expertise may be updated and used to provide appropriate and useful search results. In many embodiments, a user may have different expertise levels for different technical domains. | 04-08-2010 |
20100088332 | INTERACTIVE SYSTEM FOR INTERNET INFORMATION RETRIEVAL AND EXPLORATION - A system and method for bringing potentially interesting web content to a user's attention in a faster and more interesting way. Embodiments are directed towards selecting for display at a client device news or facts that are relevant to a user's categorization of topics of interest or historical topics of interest. Topics maybe classified by a topic classifier and placed into different categories. Actions of the user on the client device are used to drive the interest content. | 04-08-2010 |
20100094890 | URL VIRTUAL NAMING AND METADATA MAPPING - Mapping of a universal resource locator (URL) to a virtual world location may include receiving a URL for access to an entity, accessing a mapping of the URL to coordinates of a location of the entity in a virtual world, and providing access to the entity in the virtual world. A device that may include a network interface, the network interface being configured to receive a URL and provide access to a virtual world, and a memory, the memory containing at least one mapping of a URL to coordinates in the virtual world. | 04-15-2010 |
20100094891 | Client-Server System for Multi-Resource Searching - Systems and methods for searching multiple resources via a communications network, such as the Internet, are disclosed. The systems use a client-server approach in which search clients formulate search requests for a plurality of resources in a generalized format. The search requests are sent to a server, and specific uniform resource locators (URLs) for the desired resources and search terms are returned to the clients. The clients display the search results grouped by category and by resource, for example, with two sets of tabs. Each set of results is rendered using a browser engine, and the set is generally presented in its entirety. The server may define the resources available to the clients for search, and may also provide promotional information with the search results. Particular resources and features may be made available to particular groups and users. | 04-15-2010 |
20100114924 | Searching The Internet For Common Elements In A Document In Order To Detect Plagiarism - A method and system for detecting plagiarism of software source code is disclosed. In one embodiment, a database exists of program elements that have previously been found to be matching within the source code for two different programs. This embodiment searches the Internet for occurrences of these matching program elements to determine how many times they appear and thus whether they are commonly used or not. The elements and their associated number of hits are placed in a spreadsheet for further observation and manipulation. One of skill in the art will see that this invention also applies to other kinds of text documents. | 05-06-2010 |
20100114925 | CUSTOMIZED SEARCH - Techniques are disclosed herein for providing a custom search engine. In one aspect, a first search query is received from a requestor. First search results contain search result items that match the first search query are obtained. A least one sub-query is generated from the first search results. The generating is based on rules for a particular custom search engine. Second search results that match the sub-query are then obtained. A search result set is formed from a corpus that includes the first search results and the second search results. The generating of the search result set is based on the rules for the particular custom search engine. The search result set is provided to the requester. In one aspect an interface for designing a custom search engine is provided. The interface allows the designer to specify the layout of a search results page. | 05-06-2010 |
20100114926 | METHOD, SYSTEM, AND COMPUTER PROGRAM PRODUCT FOR IMPLEMENTING AUTOMATED WORKLISTS - A method, system, and computer program product for implementing automated worklists are provided. The method includes generating a worklist, which further includes retrieving a worklist template corresponding to the worklist and, via a first query, selecting a listing of members and attributes to be populated in the worklist, the attributes include a status indicator of an action item specified for each of the members of the worklist. The worklist generation also includes building a worklist member table with results of the first query and, via a second query, and using attributes of the worklist member table, identifying up-to-date values of one or more worklist member attributes, and outputting results of the second query to the worklist. The method also includes presenting the worklist to a corresponding assignee. For each of the members in the worklist, the status indicator is editable to update a status of the member. | 05-06-2010 |
20100114927 | REPORT GENERATION SYSTEM AND METHOD - A method, computer program product, and system for receiving a natural language query. The natural language query is parsed into a plurality of base concepts. One or more base concepts chosen from the plurality of base concepts is processed to define a selected report template. The selected report template is selected from a plurality of default report templates. At least one of the base concepts chosen from the plurality of base concepts is mapped to a data field within data via a mapping dictionary. The data includes a plurality of records. A query is executed on at least a portion of the data to identify a result record set. The result record set defines at least a portion of the plurality of records. | 05-06-2010 |
20100114928 | DIVERSE QUERY RECOMMENDATIONS USING WEIGHTED SET COVER METHODOLOGY - A computer-implemented method is such that suggested search queries are provided based on an input search query. The search query is received (such as from a user providing the search query to a search engine service) and a first list of documents is determined that correspond to processing the query by a search engine. A list of result queries is determined, wherein executing the list of result queries would correspond to a second list of documents, that result from presenting the result queries to the search engine, and the documents of the second list of documents cover the documents of the first list of documents. The list of result queries is returned as the suggested queries. Determining a list of result queries may include, for example, determining a list of potential queries, wherein each potential query, when executed by the search engine, results in at least one document in the first list of documents; and processing the potential queries to determine which of the potential queries to include in the list of result queries. | 05-06-2010 |
20100114929 | DIVERSE QUERY RECOMMENDATIONS USING CLUSTERING-BASED METHODOLOGY - A computer-implemented method provides suggested search queries based on an input search query. The input search query is received. A first list of documents is determined that correspond to processing the query by a search engine determining the list of result queries, including processing the first list of documents to determine clusters of documents and determining potential queries that correspond to the determined clusters by comparing results of the potential queries with documents in the determined clusters. A list of result queries is determined, wherein executing the list of result queries would correspond to a second list of documents, that result from presenting the result queries to the search engine; and the documents of the second list of documents cover the documents of the first list of documents. The list of result queries based on the potential queries determined to correspond to the determined clusters. | 05-06-2010 |
20100114930 | SITUATION-AWARE, INTEREST BASED SEARCH QUERY GENERATION - A method for generating a portion of a query for a user is provided, the method comprising: retrieving information regarding the user's interests; and generating a portion of a query by analyzing the user's interests and the current situation of a user device operated by the user to determine at least one keyword. | 05-06-2010 |
20100114931 | FACET, LOGIC AND TEXTUAL-BASED QUERY COMPOSER - Described is a technology for composing queries by user interaction with objects and facets. A facet-based user interface allows users to select facets for use as filtering criteria, and a logic-based user interface allows users to logically combine object data. Query logic that processes the filtering criteria and/or logically combines the object data into a query. The facet-based user interface and logic-based user interface may be accessed via a unified user interface. The unified user interface may also provide a text editor for composing a text-based query. | 05-06-2010 |
20100121868 | CONVERTING A DATABASE QUERY TO A MULTI-DIMENSIONAL EXPRESSION QUERY - Disclosed is a method and system for receiving a query in a first format, parsing the query to determine a result object, a data source and a filter condition in the query. The filter condition is converted to a normalized filter condition by analyzing a semantic context of one or more member sets in the filter condition, converting the one or more member sets into a normal form and replacing logical operators between the one or more member sets with normalized operators. The normalized filter condition along with the result object and the data source is then translated to a multi-dimensional database query in a second format. | 05-13-2010 |
20100121869 | NORMALIZING A FILTER CONDITION OF A DATABASE QUERY - Disclosed is a method and system for receiving a query in a first format, parsing the query to determine a result object, a data source and a filter condition in the query. The filter condition is converted to a normalized filter condition by analyzing a semantic context of one or more member sets in the filter condition, converting the one or more member sets into a normal form and replacing logical operators between the one or more member sets with normalized operators. The normalized filter condition along with the result object and the data source is then translated to a multi-dimensional database query in a second format. | 05-13-2010 |
20100131537 | METHOD AND SYSTEM FOR INTERACTIVELY EXPLORING DATA OBJECTS - A method and system for interactively exploring data objects is provided. A user action selecting a portion of a first one of the data objects. The selected portion of the first one of the data objects comprising at least one attribute correspondingly mapped to a meaning. At least one query is retrieved, the at least one query comprising at least one input parameter correspondingly mapped to the meaning associated with the at least one attribute of the selected portion. In response to a user selection of the retrieved query, a value of the at least one attribute of the selected portion is passed as input to the retrieved query. A search request is generated based on the retrieved query with the passed value as the input parameter to obtain at least a second data object representing supplementary data related to the first one of the data objects. | 05-27-2010 |
20100131538 | IDENTIFYING AND EXPANDING IMPLICITLY TEMPORALLY QUALIFIED QUERIES - Methods and apparatus are described for identifying implicitly temporally qualified queries, i.e., queries for which a time period is implied but not explicitly stated, and for expanding such queries to include one or more temporal references. | 05-27-2010 |
20100138436 | METHOD AND SYSTEM OF SUGGESTING INFORMATION USED WITH ITEMS OFFERED FOR SALE IN A NETWORK-BASED MARKETPLACE - Methods and systems to suggest information to be used with an item being listed for sale may include analyzing stored search queries and identifying co-occurring terms or terms based on their desirability scores (or desirable terms). The co-occurring terms and the desirable terms may be identified based on their frequency of use in the search queries and/or in the title information or other information associated with items offered for sale. | 06-03-2010 |
20100138437 | USER TRACKING FOR BROWSER ACTIVITIES - A method and a system to track a user's browser activity may include retrieving a stored navigation string for cached webpages from a user device, the stored navigation string including one or more past tracking combinations associated with the cached webpages on the user device. The stored navigation string may be analyzed to detect user requests for the cached webpages. The user requests may be stored in a user activity database on a provider device and webpages may be modified stored on the provider device based on the user requests stored in the user activity database. | 06-03-2010 |
20100138438 | Stream data processing control method, stream data processing apparatus, and stream data processing control program - Provided is a stream data processing control method of controlling a stream data processing apparatus for receiving data added with time information in time series, and processing the data with a registered query therein, the stream data processing apparatus including the query for processing the data, a window in which the received data is stored, and control management information including a control code for identifying the content of the controlling, the method including the steps of: creating data including the control code based on the control management information; determining whether or not the data stored in the window includes the control code in a case where the received data is stored in the window; and controlling the stream data processing apparatus based on the control code included in the data if the data stored in the window includes the control code. | 06-03-2010 |
20100138439 | DISPLAY APPARATUS AND DISPLAY METHOD - A display apparatus includes: a first communication unit which conducts communication with an external device connected to the first communication unit; a second communication unit which conducts communication with a contents provider server; a display unit which displays contents being reproduced by the external device and contents related information; and a controller which controls the first communication unit to acquire contents reference information from the external device and controls the second communication unit to retrieve the contents related information using the contents reference information. | 06-03-2010 |
20100145970 | Textual Search for Numerical Properties - A textual search index is used to identify data objects that have numerical properties that satisfy search queries. As described herein, a search index contains search index entries, each of which specifies a reference string and a set of data object identifiers. When an original search query is received, the search query is transformed into a transformed search query such that numerical comparison query elements in the original search query are transformed into equivalent textual comparison query elements. The search index is then used to identify ones of the data objects that satisfy the transformed search query. A list of the identified data objects may then be provided in response to the original search query. | 06-10-2010 |
20100145971 | METHOD AND APPARATUS FOR GENERATING A MULTIMEDIA-BASED QUERY - A method and apparatus for generating a query from multimedia content is provided herein. During operation a query generator ( | 06-10-2010 |
20100145972 | METHOD FOR VOCABULARY AMPLIFICATION - A method for finding similar search terms (word matching) is provided. The method receives a query of at least a first word and automatically applies the first word to a vocabulary amplifier. The vocabulary amplifier retrieves an associated word for the first word and accesses one or more database sources to retrieve an associated word. Each associated word is presented to an output interface. The amplifier then receives information from an input interface for the associated word and classifies the associated word based upon the received characterizing information. | 06-10-2010 |
20100145973 | SYSTEM, DEVICE AND METHOD FOR MANAGING INTERACTIVE CONTENT ON A COMPUTING DEVICE - A system, device and method for managing interactive content on a computing device are provided. In an embodiment, a computing device in the form of a portable computing device is configured to execute a web-browser application and a parser application. The web-browser application is configured to obtain and display a web page. The parser application is configured to detect an interactive element in the web page, the interactive element initiating execution of an application when activated. The parser application is further configured to populate the web page with a visual identifier indicating the application initiated by activation of the interactive element. | 06-10-2010 |
20100145974 | SYSTEM AND METHOD FOR MANAGING RECIPES USING AN ELECTRONIC DEVICE - A method for managing recipes using an electronic device controls a camera unit to capture a label image of a food source, converts a description in the label image into text. The method further searches a storage in the electronic device for the recipes containing the text of the food source, displays the found recipes containing the text corresponding the food source on the user interface of the electronic device. | 06-10-2010 |
20100153423 | BATCH DATA SYNCHRONIZATION WITH FOREIGN KEY CONSTRAINTS - Data in tables with foreign key relationship is synchronized in batches employing a two-pass process during playback based on whether the foreign key constraint is a linear dependency, self-referencing, or cyclic. A separate table containing a primary key of records and database timestamp columns for change operations may also be used for batch synchronization in addition to or instead of adding database timestamp columns to existing tables. | 06-17-2010 |
20100153424 | SEARCH ENGINE METHOD AND APPARATUS - A method is provided for use with a search engine, the search engine being adapted to determine a set of search results relevant to one or more search terms input to it. The method comprises: receiving (S | 06-17-2010 |
20100161638 | System and method for using symbol command language within a communications network - A system and method for generating actions utilizing predefined commands within a communications network comprises predefined commands called symbol commands. These are character strings entered into an internet platform during an internet protocol session. The method and system can be used via the internet and is well-suited for mobile use. In addition, utilization of keywords and alpha-numeric or other character symbols to form symbol commands allows for complex command structuring. A search process is used in combination with a symbol command and a symbol command directory to identify specific goods and services, or related symbol commands. In addition, a platform performs specific predetermined actions in response to the symbol command such as making product purchases or providing services such as location-based services, coupon delivery or travel ticketing. The symbol command structure and internet platform will also utilize identification information associated with an individual user. Furthermore, the platform may implement a response using location information associated with the user from the country code, area code or prefix code of a user's telephone number, or use GPS location information associated with the user's internet device. The symbol command system and method provide an improved form of access to products and services via the internet. | 06-24-2010 |
20100161639 | Complex Queries for Corpus Indexing and Search - Computer methods, apparatus and articles of manufacture therefor, are disclosed for developing a complex-query pattern that is transformed into a region-matching transducer. A corpus-level transducer and the region matching transducer are combined. The combined transducer is applied to a corpus to identify strings therein that satisfy patterns defined in the corpus-level transducer, including the complex-query pattern, with each identified pattern being recorded in a corpus index. The corpus and the corpus index are made available for receiving a query with the query tag for querying the corpus and applying the query using the corpus index to identify locations in the corpus that satisfy the query. | 06-24-2010 |
20100161640 | SYSTEM AND METHOD FOR COMPUTERIZED SEARCHING WITH A COMMUNITY PERSPECTIVE - A system and method for conducting a computerized search, including: receiving a user query, a perspective, and a term associated with the perspective; conducting a first search based on the user query; expanding the term to a list; analyzing the first search results based on the list; modifying the user query based on the analysis of the first search results; and conducting a second search based on the modified user query. Alternatively, a system and method for conducting a computerized search, including: receiving a user query; conducting a computerized search based on the user query to obtain first results; analyzing a knowledge base; generating a weighted context term vector based on the knowledge base, wherein the weighted context term vector includes context words; matching the first results with the weighted context term vector; and listing second results based on the match. | 06-24-2010 |
20100161641 | SYSTEM AND METHOD FOR COMPUTERIZED SEARCHING WITH A COMMUNITY PERSPECTIVE - A system and method for conducting a computerized search, including: receiving a user query, a perspective, and a term associated with the perspective; conducting a first search based on the user query; expanding the term to a list; analyzing the first search results based on the list; modifying the user query based on the analysis of the first search results; and conducting a second search based on the modified user query. Alternatively, a system and method for conducting a computerized search, including: receiving a user query; conducting a computerized search based on the user query to obtain first results; analyzing a knowledge base; generating a weighted context term vector based on the knowledge base, wherein the weighted context term vector includes context words; matching the first results with the weighted context term vector; and listing second results based on the match. | 06-24-2010 |
20100161642 | MINING TRANSLATIONS OF WEB QUERIES FROM WEB CLICK-THROUGH DATA - Methods and technologies providing translations of web queries based on an analysis of user behavior in click-through data. These methods and technologies generates large-scale and timely query translation pairs guided by a small set of seed word pairs from a dictionary, without relying on additional knowledge or complex models. | 06-24-2010 |
20100169351 | UNIFYING HETROGENOUS DATA - Techniques for unifying data are provided. The techniques include transforming a query into one or more sub-queries that can be answered by one or more types of data services, and wherein the query touches one or more joins across data residing in one or more enterprise systems, querying one or more target data services for each of the one or more sub-queries, aggregating one or more sets of results based on the one or more target data services, and unifying the one or more sets of aggregated results. | 07-01-2010 |
20100169352 | NOVEL SYSTEMS AND METHODS FOR TRANSMITTING SYNTACTICALLY ACCURATE MESSAGES OVER A NETWORK - The present invention is directed to systems and methods for encoding and retrieving information from a variety of sources using novel search techniques. The systems and methods of the invention are capable of extracting all types of structural and relational information from a query or a source data allowing for the recognition of subtle differences in meaning. The capability of discerning subtle differences in meaning that are beyond the search systems and methods presently available, the invention described herein is capable of repeatedly providing accurate and meaningful responses to a diverse set of queries. | 07-01-2010 |
20100169353 | SYSTEM AND METHODS FOR UNIT OF MEASUREMENT CONVERSION AND SEARCH QUERY EXPANSION - A system and methods for unit of measurement conversion and search query expansion are described. The search query expansion may include identifying an initial unit of measurement associated with a property and an initial numeric value for the initial unit of measurement within a search query, automatically forming an expanded search query by expanding the search query to include at least one related unit of measurement associated with the property, and sending the expanded search query to a search engine to search a database. Other embodiments are described and claimed. | 07-01-2010 |
20100185643 | TECHNIQUES FOR AUTOMATED GENERATION OF QUERIES FOR QUERYING ONTOLOGIES - Techniques for simplifying querying of ontologies. In one embodiment, one or more queries for querying an ontology are automatically generated in a language suitable for querying the ontology. A user may enter a query in a simple language such as a natural language query. In response, one or more queries capable of querying the ontology are automatically generated in a second language. The automatically generated queries may, for example, be in SPARQL or PL/SQL. The one or more automatically generated queries may then be used to query one or more ontologies. | 07-22-2010 |
20100185644 | AUTOMATIC SEARCH SUGGESTIONS FROM CLIENT-SIDE, BROWSER, HISTORY CACHE - An embodiment of the current invention is directed to using a script embedded in a web page and executed in a web browser environment to store user search history information in a persistent, browser-supplied, script accessible, history cache and employ the user search history information to provide suggested search queries. A number of input characters of a search query are received by the script. The persistent, browser-supplied, script accessible, history cache is retrieved. A list of suggested search queries is determined from the history cache by the script. The list of suggested search queries is presented. | 07-22-2010 |
20100191758 | SYSTEM AND METHOD FOR IMPROVED SEARCH RELEVANCE USING PROXIMITY BOOSTING - A system and method for improved search relevance using proximity boosting. A query for a web search is received from a user, via a network, wherein the query comprises a plurality of query tokens. One or more concepts are identified in the query wherein each of concepts comprises at least two query tokens. A relative concept strength is determined for each of the identified concepts. The query is then rewritten for submission to a search engine wherein for each of the one or more concepts, a syntax rule associated with the respective relative concept strength of the concept is applied to the query tokens comprising the concept such that the rewritten query represents the one or more concepts whereby the proximity of the one or more concepts in a search result returned by the search engine to the user in response to the rewritten query is boosted. | 07-29-2010 |
20100191759 | METHODS AND APPARATUS FOR COMMUNICATING IN A WIRELESS SYSTEM - Methods and apparatus for communicating information, e.g., queries and query responses, in a peer to peer communications network are described. Queries include, e.g., queries for a product, service, activity or activity partner. In some embodiments, a query channel is implemented and utilized. The implemented query channel structure is such that multiple query responses may be communicated corresponding to a single transmitted query. Various embodiments employ randomization in transmission segment selection by an individual communications device within a transmission block to decrease the likelihood of collisions. A communication device's access to the query channel is determined by the communications device itself. A communications device's decision as to whether or not to transmit and/or re-transmit a query is based on one or more of: its query transmission statistics, historical query channel loading information, and priority level information corresponding to the communications device. | 07-29-2010 |
20100205198 | SEARCH QUERY DISAMBIGUATION - Disclosed herein is a system and method of query disambiguation. At least one model is generated using training data, which model can be used to score, or rank, possible interpretations identified for a query, which can be used to select an interpretation from a number of possible interpretations. A selected interpretation can be used to process a web search request, e.g., to generate search results that relate to the selected query interpretation, rank or order the items in the search result based on relevance to the selected query interpretation, and/or identify a presentation to be used to display the search results based on the selected query interpretation. | 08-12-2010 |
20100228760 | CORRELATED QUERY PROCESS (CQP) AND PEER-TO-PEER (P2P) EXECUTION - Methods, systems, and computer program products are provided for processing correlated queries in a collaborative, role-based, peer-to-peer (P2P) execution system. A correlated query is configured in accordance to a collaborative correlated query process (CQP) template. The collaborative CQP template defines roles and steps, each step being executable by one of the roles. A role is assigned to each peer node of the P2P system. A peer node having a designated role executes a step that is executable by the designated role. A message is communicated to other P2P nodes to indicate completion of the step. Another peer node having a matching role to a next step in the correlated query executes the next step in response to the message. | 09-09-2010 |
20100250572 | DATA CONTINUOUS SQL PROCESS - One embodiment is a method that repeatedly triggers a User Defined Function (UDF) that generates a data stream. A data continuous Structured Query Language (SQL) query is applied to the data stream to construct a data continuous SQL process (DCSP) which executes in a database. | 09-30-2010 |
20100250573 | SEARCH TERM MANAGEMENT IN AN ELECTRONIC DISCOVERY SYSTEM - Embodiments of the invention relate to systems, methods, and computer program products for improved electronic discovery. More specifically, embodiments relate to managing the process for creating search term sets to be applied to electronic data sets associated with a case in an electronic discovery system. A search term management application is provided that allows for multiple users to work collaboratively to define the final search term set that is subsequently applied to the corpus of electronic data for the case. In addition, the application provides for tracking the overall search term creation process. In addition, embodiments provide for a search term hit count engine that is configured to determine search term hit counts for data as a means of predicting the volume of data needed to review. | 09-30-2010 |
20100268722 | Access control for graph data - Systems, methods, and other embodiments associated with access control for graph data at the instance-level are described. One example method includes accepting data access constraints that are expressed as match and apply pattern pairs to enforce security policies. A user query on graph data with a security policy restricts the returned data to data that the user is authorized to access. For this purpose, a user query that includes query selection criteria corresponding to one or more match pattern criteria based on the resource referenced in the query is rewritten to include security conditions specified in the associated apply pattern to restrict access to the graph data. | 10-21-2010 |
20100268723 | METHOD OF PARTITIONING A SEARCH QUERY TO GATHER RESULTS BEYOND A SEARCH LIMIT - In one embodiment the invention includes a method to gather search results beyond a search result limit. In one embodiment, the method includes the steps of receiving a desired search term, creating a partitioning set that includes at least one partitioning term, forming a plurality of partitioned queries that include the desired search term and the partitioning set, submitting the plurality of partitioned queries to a query service, and collecting results from the submitted plurality of partitioned queries. | 10-21-2010 |
20100268724 | METHOD AND SYSTEM FOR APPROXIMATE STRING MATCHING - Approximate string matching of a target string to a trie data structure in which the trie data structure has a root node and generations of child nodes, each node representing at least one character in an alphabet to provide a lexicon of words and word fragments. Traversing the trie data structure includes starting from the root node by comparing each node of a branch of the trie data structure to characters in the target string and adding characters traversed in a branch of the trie data structure to a gathered string to provide suggestions of approximate matches. If a node is reached that is flagged as a node for a word or a word fragment and, and if the target string is longer than the gathered string, the method loops back to the root node, and continues the traverse from the root node. At each node, the system determines if there is a correction rule for one or more characters in the remainder of the target string from the current node, and if so, applies the correction rule to the target string to obtain a modified target string. | 10-21-2010 |
20100287170 | INSTANT ANSWERS AND INTEGRATED RESULTS OF A BROWSER - A method, system, and medium are provided for searching multiple search services in parallel and utilizing multiple search providers in a computer system. Multiple search providers are installed onto a browser application of a user computer system. Upon receipt of a user search query and a user designated search provider, an instant answer is automatically displayed without any user interaction. Other aggregated results are displayed together in a combined window pane. One section displays results of any recent searches that match the search query entry. Another section displays search suggestions provided by the designated search provider. Another section displays results of any previously visited sites in which results of the previously visited site match the search entry. Additional searches of different designated search providers can also be made. These multiple searches of multiple search providers are conducted from the same browser window as the initial search. | 11-11-2010 |
20100287171 | Federated Indexing from Hashed Primary Key Slices - A method and system stores and retrieves data items associated with a primary key, using search indices at multiple storage locations. A server receives a primary key, identifies one or more segments of the primary key, and hashes each segment with one or more hash functions to obtain a sequence of hash values. The hash values are used as keys to index a chain of search indices that are stored in multiple storage locations. One or more of the hash values in the sequence are used to form a host name, and the host name is mapped to an address of a server that stores a first search index in the chain. The last search index in the chain contains the data items associated with the primary key, or provides a reference to one or more locations at which the data items can be found. | 11-11-2010 |
20100287172 | Federated Document Search by Keywords - A method and system stores search indices across multiple storage locations, and uses the search indices to conduct a document search. In one embodiment, a server receives a search request that includes a keyword. The server hashes the keyword with multiple hash functions to obtain a sequence of hash values, which are used to index a chain of search indices. Each hash value points to an entry of a corresponding search index in the chain. If a search index is not the last index in the chain, the entry provides a reference to the location at which a next search index in the chain can be found. If a search index is the last index in the chain, the entry includes or points to identifiers of documents that contain the keyword in the search request. The documents can be retrieved from document repositories using the identifiers. | 11-11-2010 |
20100287173 | Searching Documents for Successive Hashed Keywords - A method and system searches documents that contain an ordered pair of keywords using search indices stored in multiple storage locations. In one embodiment, a server receives the search request that includes an ordered pair of keywords. The server hashes each keyword with multiple hash functions to obtain a hash vector pair, which are used to index a chain of search indices. Hash values in the hash vector pair are used to locate the chain of search indices that are stored across multiple storage locations. The last search index in the chain provides identifiers of documents containing the ordered pair of keywords, with a distance between the keywords in the documents below a predetermined limit. The documents can be retrieved from document repositories using the identifiers. | 11-11-2010 |
20100287174 | IDENTIFYING A LEVEL OF DESIRABILITY OF HYPERLINKED INFORMATION OR OTHER USER SELECTABLE INFORMATION - Embodiments of methods, apparatuses, or systems relating to identifying a level of desirability of a hyperlink or search query using experience score. | 11-11-2010 |
20100287175 | MODEL-BASED SEARCHING - Computer-readable media and methods for model-based searching to provide search results of relevance to a search topic are provided. A model describing a search framework for generating a plurality of search queries is provided. A number of search topics are identified and attributes are assigned to each search topic. Attribute data elements and values are provided to describe each to the assigned attributes for each search topic. The attributes inform the search framework in order to compile a plurality of search queries for the search topic. A search term is received from a user and a corresponding search topic is identified. The plurality of search queries are executed to obtain search results for the corresponding search topic. The search queries may be pre-executed and the search results cached in a computer memory for later retrieval. The search results are organized based on the model and are presented to the user. | 11-11-2010 |
20100293173 | System and method of searching based on orientation - A system and method is provided whereby, in one aspect, advertisements are displayed based on search terms that were selected based on the angle at which a user is viewing a street level image. | 11-18-2010 |
20100293174 | QUERY CLASSIFICATION - Techniques and systems are disclosed that provide for constructing a query classification index that can be used to classify a query into relevant categories. Where documents in an index are classified into one or more category predictions for a category hierarchy, classification metadata is generated for categories to which a document in the index has been classified. Further, the classification metadata is associated to the corresponding documents in the index. Additionally, a query of the index can be classified using the metadata associated to the documents in the index, and query results can be provided that are classified by the one or more categories identified by the classification of the query. | 11-18-2010 |
20100293175 | FEATURE NORMALIZATION AND ADAPTATION TO BUILD A UNIVERSAL RANKING FUNCTION - To increase the amount of training data available to train a machine learning ranking function, data from multiple markets are normalized in such a manner as to optimize a measurement of quality of the ranking function trained on the various sets of normalized training data. Furthermore, the feature scores of training data from individual markets are adapted to conform to the distributions of feature scores from a base market. Such adapted training data from the various markets may be used to train a single, robust ranking function. Adaptation of feature scores in a particular training data set involves mapping feature scores of the particular training data set to feature scores of a base training data set to conform the distributions of the feature scores in the particular training data set to the distributions of the feature scores in the base training data set. | 11-18-2010 |
20100293176 | RANGE INCLUSIVE PROBE ALGORITHM - A range inclusive probe algorithm for searching sorted, partially sorted, or unsorted data arrays is provided. The range inclusive probe algorithm begins like a binary array searching for a value with interactive range reduction. The search is continued even if the value is not found during the initial pass applying the same technique to the remaining ranges if the array is unsorted. Every element of the array may be checked once if the sought value is not in the array, but due to the binary approach at the beginning, search speed is higher than a linear search. | 11-18-2010 |
20100293177 | Vector Extensions to an Interpreted General Expression Evaluator in a Database System - Described is a technology by which an expression in a database engine is executed against stacks of data. Each instruction of the expression is evaluated against the data stacks until completed against each data stack, such as by iterating to execute an instruction through the data stacks before executing the next instruction. The data may be arranged in the data stacks (in memory) in various ways, such as to have each data stack contain the data of one database row, (e.g., with the data stack elements comprising column data. Data may be grouped, such as to put the data from different rows into the same data stack. | 11-18-2010 |
20100293178 | PROVIDING TOOLS FOR NAVIGATIONAL SEARCH QUERY RESULTS - Methods and computer-readable media are provided for displaying a target search result and relevant information on a search results page in response to a user-inputted query on a search page. The target search result and relevant information are identified in a database as having been previously determined to be most relevant to the query, and may be based on past user behavior, for example. The relevant information may include functional tools that include input boxes allowing for the user to interact with a webpage associated with the target search result via the search results page. Once the target search result and relevant information have been determined, the search results page is displayed. | 11-18-2010 |
20100293179 | IDENTIFYING SYNONYMS OF ENTITIES USING WEB SEARCH - Identifying synonyms of entities using web search results is disclosed herein. In some aspects, a candidate string of tokens of an entity name is selected as a search term. The search term is transmitted by a server to a search engine, which in turn, transmits search results back to the server after performing a search. The server analyzes the search results, generates a score based on the search results, and then determines a status (synonym or not a synonym) of the candidate string based on the score. In further aspects, additional candidate strings are designated as synonyms or not synonyms based on status of the searched candidate string by using relationships of a lattice formed from all possible candidate strings of the entity name. | 11-18-2010 |
20100293180 | IDENTIFYING CONCEPTUALLY RELATED TERMS IN SEARCH QUERY RESULTS - Conceptually related term identification technique embodiments are presented that involve identifying in the results of a search query, terms that are conceptually related to the search query terms. In one general embodiment, this is accomplished by first inputting the terms employed in a search query and the results of the search. Word tokens found in the search query terms are then identified, as are potential phrases that can be made from the identified word tokens. Conceptually related words and phrases are then identified in the search query results. These words and phrases correspond to the previously identified word tokens and potential phrases. The search query results are presented to a user on a display device in such a manner as to visually distinguish the conceptually related words and phrases from other words and phrases in the search query results. | 11-18-2010 |
20100293181 | VALUEpilot - METHOD AND APPARATUS FOR ESTIMATING A VALUE OF A VEHICLE - The present invention relates to a method for generating an estimated value of a car, comprising the steps of receiving a user query specifying at least the type of a car; providing a database which comprises datasets having a car specification dataset specifying at least the type of the car and a car value field assigned to the respective car specification dataset representing the reference value of the car specified in the car specification dataset; searching in the database to find one or more datasets matching the user query; and calculating the estimated value of the car using the car value fields of the found datasets. | 11-18-2010 |
20100293182 | METHOD AND APPARATUS FOR VIEWING DOCUMENTS IN A DATABASE - An approach is provided for determining documents to display and includes extracting, from metadata in a first document, data that indicates a function and a filter for determining which documents in a database may be viewed to perform the function. It is determined whether the function is to be performed. If it is determined that the function is to be performed, then display of an icon representing a second document from the database is initiated based on the filter. In some embodiments, a document is transmitted, which includes metadata that comprises data that indicates a function and a filter for determining which documents in a database may be viewed to perform the function. A message is also transmitted comprising data that indicates a recipient has permission to perform the function. | 11-18-2010 |
20100299336 | DISAMBIGUATING A SEARCH QUERY - Methods, systems, and computer-readable media for disambiguating a search query are provided. A query may be ambiguous when the domain-confidence factors indicate a high likelihood that the search query may belong to two or more domains. A domain is a subject matter category such as shopping, sports, entertainment, music, or politics. A domain-confidence factor indicates the likelihood that a search query is related to a particular domain. Upon determining that a search query is ambiguous, embodiments of the present invention may present an interface that allows the user to place the search query into one or more domains. Updated search results, or other objects, may be returned based on the selection of a domain by the user. | 11-25-2010 |
20100299337 | Computer System for Processing a Query - The invention relates to a computer system comprising: a database having a database table for storing records comprising data values, the database table having first columns for storing the data values, each one of the first columns being assigned to a data field of a set of predefined data fields, and at least one second column for storing keys, each key identifying one of the records stored in the database, and a set of index tables, each index table being assigned to one of the data fields and having assigned thereto an index table identifier, means for receiving a query, the query specifying the subset of the set of data fields and a search range for each specified data field, means for storing a predefined ordered sequence of index table identifiers, means for processing the query by checking each one of the index tables for being relevant for the execution of the query, one of the index tables being relevant if the one of the index tables is assigned to one of the specified data fields, storing the index table identifier for each relevant index table in a query execution table, sorting the query execution table in accordance with the predefined ordered sequence, executing the query using the index tables identified in the query execution table in the order given by the sorting of the query execution table. | 11-25-2010 |
20100299338 | METHOD AND APPARATUS FOR PROVIDING DEVICE COMPATIBILITY SERVICE - Techniques for a device compatibility service include receiving a first query from a service indicating first device identification data related to a mobile communication device. A second query is initiated into multiple sources for the mobile communication device based on the received device identification data. In response to the received first query, the method further comprises causing to be sent to the service a response that indicates different data associated with the device identification data based on a database of device characteristics, wherein the service is adapted based on the device identification data. For example, in some embodiments the device identification data indicates a specific mobile communication device and the different data indicates characteristics of the specific device. In some embodiments, the device identification data indicates a specific device characteristic and the different data indicates devices associated with the specific device characteristic in the database. | 11-25-2010 |
20100299339 | INDEXING PROVENANCE DATA AND EVALUATING PROVENANCE DATA QUERIES IN DATA PROCESSING SYSTEMS - Techniques for indexing provenance data and evaluating provenance data queries are disclosed. For example, a method for processing one or more queries directed toward data associated with a data processing system comprises the following steps. One or more data items of a first data set associated with the data processing system are mapped to a first representation type and one or more data items of a second data set associated with the data processing system are mapped to a second representation type. A bi-directional index of a data provenance relation existing between the data items of the first data set and the data items of the second data set is computed. The bi-directional index is computed in terms of the first representation type and the second representation type. A query evaluation is performed using the bi-directional index, in response to receipt of a provenance query. The bi-directional index is used for query evaluation whether the received provenance query is a backward provenance query or a forward provenance query. A response is generated for the received provenance query based on a result of the query evaluation. In one further example, the provenance query evaluation step may be performed by using only the bi-directional index and does not require access to base data or maintaining stored provenance data. | 11-25-2010 |
20100299340 | DISTRIBUTED CONTACT INFORMATION DISCOVERY AND SHARING - A contact sharing system is described herein that allows multiple people to share their address books of contact information so that a person can search for contact information among the address books of the person's existing contacts in addition to any publicly available searchable sources of contact information. Because at least one of a person's contacts is likely to have contact information for the person or business that the person is trying to reach, searching the contacts of contacts is more likely to produce relevant search results than searching anonymous or public sources of contact information alone. Thus, the contact sharing system makes it easier for people to find contact information for people and businesses that they are trying to reach. | 11-25-2010 |
20100299341 | Storage System Database of Attributes - A method, a system and a computer program product for storing one or more volume attributes in a database. The system receives one or more volume attributes which are associated with one or more volumes within a storage system. One or more search terms are assigned to the volume attributes. The one or more volumes and one or more volume attributes are dynamically associated with a location of the one or more volumes. The system assigns the one or more search terms, the one or more volume attributes, and the location of the one or more volumes to the database. The database is stored at a local database and/or an external database. When one or more of the volume attributes are identified during an inquisition for the one or more volumes, the volumes are dynamically retrieved from one or more of the local database and/or an external database. | 11-25-2010 |
20100299342 | SYSTEM AND METHOD FOR MODIFICATION IN COMPUTERIZED SEARCHING - A system and method for conducting a computerized search, including: receiving a query from a user; classifying the query; augmenting the query based on the classification; issuing the query to a search engine; and conducting a search based on the augmented query. Alternatively, a system and method for conducting a computerized search, including: receiving a search query; analyzing a knowledge base; modifying the search query based on the analysis of the knowledge base; issuing the modified search query to a search engine; and conducting a search via the search engine based on the modified search query to generate search results. | 11-25-2010 |
20100299343 | Identifying Task Groups for Organizing Search Results - Computer-readable media and computerized methods for automatically organizing search results according to task groups are provided. The methods involve aggregating a gallery of entities (e.g., search queries that share a common categorization) into a query class and assigning a dictionary (e.g., list of terms that are drawn from various sources) to the query class. The task groups are identified from the list of terms within the dictionary. The process of identification includes analyzing patterns of user search behavior to select terms from the list of terms, which reflect popular user search intents, and ranking the selected terms based on predetermined parameters to produce an ordering. Based on the ordering, a set of the selected terms that are highest ranked are declared the task groups. The task groups are employed to arrange the search results on a UI display and to provide a consistent and intuitive format for refining a search. | 11-25-2010 |
20100306210 | CLUSTERING IDENTICAL OR DISJOINT KEYWORD SETS FOR USE WITH AUCTIONS FOR ONLINE ADVERTISING SPACE - Embodiments of methods, apparatuses, or systems relating to clustering identical or disjoint keyword sets for use with auctions for online advertising space. | 12-02-2010 |
20100306211 | METHOD AND APPARATUS FOR AUTOMATIC GEO-LOCATION SEARCH LEARNING - An approach is provided for automatic geo-location search learning. A geo-location search learning platform receives a query specifying words, and initiates a point-of-interest search on the query, an address search on the query, and a partial search on some of the words. The geo-location search learning platform then combines results of the point-of-interest search, the address search, and the partial search, determines context information for a user; and sorts the combined results based on the context information thereby recommending the researched results to the user in a priority list as sorted. | 12-02-2010 |
20100306212 | Fetching Optimization in Multi-way Pipelined Database Joins - A method of performing a multi-way join of a plurality of database relations includes executing a plurality of pipelined two-way joins with the database relations. Each two-way join has two sequential phases. In the first phase, missing attributes of the input relations that are required to evaluate a joining criterion specific to said two-way join are fetched from a non-volatile memory device, and the input relations are joined according to the criterion. In the second phase, any additional missing attributes of the input relations are fetched from the non-volatile memory device as assigned by an optimization process executed prior to commencing the multi-way join. | 12-02-2010 |
20100306213 | Merging Search Results - Merging search results is required, for example, where an information retrieval system issues a query to multiple sources and obtains multiple results lists. In an embodiment a search engine at an Enterprise domain sends a query to the Enterprise search engine and also to a public Internet search engine. In embodiments, results lists obtained from different sources are merged using a merging model which is learnt using a machine learning process and updates when click-through data is observed for example. In examples, user information available in the Enterprise domain is used to influence the merging process to improve the relevance of results. In some examples, the user information is used for query modification. In an embodiment a user is able to impersonate a user of a specified group in order to promote particular results. | 12-02-2010 |
20100306214 | IDENTIFYING MODIFIERS IN WEB QUERIES OVER STRUCTURED DATA - Described is using modifiers in online search queries for queries that map to a database table. A modifier (e.g., an adjective or a preposition) specifies the intended meaning of a target, in which the target maps to a column in that table. The modifier thus corresponds to one or more functions that determine which rows of data in the column match the query, e.g., “cameras under $400” maps to a camera (or product) table, and “under” is the modifier that represents a function (less than) that is used to evaluate a “price” target/data column. Also described are different classes of modifiers, and generating the dictionaries for a domain (corresponding to a table) via query log mining. | 12-02-2010 |
20100306215 | Ranking Results of Multiple Intent Queries - Techniques and systems are disclosed providing improved ranking of results to an online search-based query. One or more user types are identified for a search-based query, which may correspond to a number of user relevant results and which ones are selected. A user profile can be determined for the respective user types for the search-based query, which may identify a proportion of the users that belong to that type, and how many results are relevant to that type. A set of relevant results can be identified for the respective user types for the query, based on a number of results used by the user type. An improved ranking of the results can be determined for the query, from the one or more sets of relevant results, based on the user profiles and a desired user satisfaction metric for a desired number of users. | 12-02-2010 |
20100306216 | SHORT PATHS IN WEB GRAPHS WITH SMALL QUERY TIME - Short paths are found with a small query time in scale-free directed graphs using a two-phase process by which data structures comprising shortest path trees are first pre-computed for a group of central vertices called “hubs” that have short paths to most other vertices in the graph. In a query time phase, a short path between two vertices of interest in the graph is found by looking up the path to the root in each of the shortest path trees. | 12-02-2010 |
20100306217 | Mechanism for Separating Content from Noisy Context in Template-Based Documents for Search Indexing - In one embodiment, a mechanism for separating content from noisy context in template-based documents for search indexing is disclosed. In one embodiment, a method includes selecting a plurality of documents for index comparison, identifying one or more identical elements found in each of the plurality of documents, and removing the one or more identical elements from consideration in an indexing process of the plurality of documents. | 12-02-2010 |
20100306218 | SYSTEMS AND METHODS FOR INTERFACING WITH HEALTHCARE ORGANIZATION CODING SYSTEM - Systems and methods for interfacing with a healthcare organization's coding system. | 12-02-2010 |
20100306219 | Cache-Based Predicate Handling For Queries On XML Data Using Uncorrelated Path-Based Row Sources - The approaches described herein provide an efficient way to process certain kinds of queries that retrieve XML data stored in an object-relational database. An XML query may include a predicate condition that joins two row sources. One or both of the row sources required for predicate evaluation may be path-based; that is, consume and produce rows of XMLType data. Such a path-based row source may be modified to use the predicate condition to filter the rows it generates so that only rows satisfying the predicate condition need to be further processed. A small cache structure introduced into the path-based row source may be used to optimize the evaluation of the predicate row. Once populated with row data, the cache structure may be reorganized to optimize the performance of predicate evaluation. | 12-02-2010 |
20100306220 | Efficient Way To Evaluate Aggregations On XML Data Using Path-Based Row Sources - The approaches described herein provide an efficient way for a database server to process certain kinds of queries that require the evaluation of an aggregation function over XML data stored in an object-relational database. An aggregation function takes multiple inputs and generates a single output. A database server first determines whether the query qualifies for this particular kind of optimization, then creates a query execution plan that specifies the use of an enhanced path-based row source, eliminating the need for a second path-based row source for computing the aggregation function. The enhanced path-based row source specified in the query execution plan computes an aggregation function and stores the result of that function computation in a column of each row. The XPath evaluation results that are the individual inputs to the aggregation function are only stored temporarily until they are used to compute the aggregation function. | 12-02-2010 |
20100306221 | EXTENDING RANDOM NUMBER SUMMATION AS AN ORDER-PRESERVING ENCRYPTION SCHEME - A method and system for cryptographically indexing, searching for, and retrieving documents is provided. In some embodiments, an encryption system is provided that generates a document index that allows users to retrieve documents by performing encrypted queries for keywords associated with the documents. In some embodiments, each keyword maps to the same number of encrypted document identifiers. In some embodiments, an extractor graph is employed to map an indication of each keyword to a number of buckets storing encrypted document identifiers. In some embodiments, an order-preserving encryption system is provided. The encryption system uses an ordered index that maps encrypted instances of ordered attribute values to documents that are associated with those values. The ordered index enables queries containing query operators that rely on order, such as less than (“<”) or greater than (“>”), to be successfully performed on encrypted attribute values. | 12-02-2010 |
20100306222 | CACHE-FRIENDLY B-TREE ACCELERATOR - A system and method for accelerating searches of B-trees. An auxiliary index that is optimized for use with a cache is used in conjunction with a B-tree. A hash type of auxiliary index maintains pointers to key entries in the B-tree leaf nodes. The hash type of index may be searched, and a resulting pointer is used to locate records of the B-tree, bypassing a search of the B-tree. A top level type of auxiliary index maintains pointers to leaf nodes or internal nodes of the B-tree. A top level index may be searched, and a search of the B-tree is performed beginning with the node found by using the top level index. A monitoring mechanism may automatically start, change, or discard the auxiliary index based on an amount of cache memory, types of searches, or other factors. The auxiliary index may be optimized for high performance in read only searches, while the B-tree provides transaction durability. | 12-02-2010 |
20100306223 | Rankings in Search Results with User Corrections - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for improving search with user corrections. In one aspect, a methods performed by a data processing apparatus include the actions of receiving a value result set, accessing historical records of user corrections stored at one or more data storage devices, the historical records describing user corrections of the characterization of instance attributes by values, determining that the historical records of user corrections describe a first user correction involving a first value in the value result set, and changing a confidence parameter embodying a confidence that the first value correctly characterizes the attribute of the instance. The value result set comprises a collection of one or more values. The values are candidates for characterizing an attribute of an instance. The first value is involved in the correction as either a corrected value or an uncorrected value. | 12-02-2010 |
20100306224 | Online Measurement of User Satisfaction Using Long Duration Clicks - Determine a plurality of first dwell durations for a plurality of first web pages, each first dwell duration indicating a time period a user has spent with a first web page. Access a plurality of first quality ratings for the first web pages, each first quality rating indicating a quality of a first web page as a part of a search result generated for a first search query. Access a predefined quality rating threshold. Correlate the first dwell durations and the first quality ratings. And, determine a dwell duration threshold, such that a second user spending a second dwell duration greater than or equal to the dwell duration threshold with a second web page indicates that the second user is satisfied with the second web page identified in a second search result generated by a search engine in response to a second search query requested by the second user. | 12-02-2010 |
20100306225 | Identifying Terms To Include In Content - A term to be included in an item is identified. A value of a first parameter of online activity associated with the term is determined. A determination that the value of the first parameter satisfies a first threshold is made and an item that includes the term is generated. The item is forwarded for placement in a medium. After the item has been placed in the medium, one or more search queries including the term are received over a predetermined time period. A value for a second parameter of online activity associated with the one or more search queries is determined. Based on the determined value of the second parameter, a determination that the placement of the item in the medium was effective is made. | 12-02-2010 |
20100306226 | Electronic Advertisement System - A keyword, first online query volume information for the keyword in a first geographic region, and second online query volume information for the keyword in a second geographic region are received. A first parameter is calculated based on the first online query volume information and the second online query volume information, and the first parameter is determined to satisfy a threshold. In response to the determination that the first parameter satisfies the threshold, a first medium distributed in the first geographic region is identified and an item including the keyword is forwarded for placement in the first medium. Revenue generated by placement of the item in the first medium is determined. | 12-02-2010 |
20100312773 | OPEN SEARCH ASSIST - Embodiments provide improved search assist functionality. The search assist functionality assists with a search by providing more than simply suggestions for searches as the user is typing, and allows a user more direct and rapid access to the desired information. This is especially useful in mobile computing devices such as handsets. It also allows for greater realization of associated advertising revenue. | 12-09-2010 |
20100312774 | Graph-Based Seed Selection Algorithm For Web Crawlers - A method for selecting one or more search seeds for Web crawling operations is provided. In a directed graph with Web pages represented by vertices and links represented by edges, characteristics of vertices connected to potential seed vertices are considered in making a seed selection. | 12-09-2010 |
20100312777 | PARTIAL-MATCHING FOR WEB SEARCHES - An efficient manner of performing an M-out-of-N partial matching search of indexed documents (e.g., web pages) is provided herein. More particularly, indexed words are arranged into a global location space (GLS), providing for respective occurrences of words in indexed documents being searched to have continuous locations on a one-dimensional GLS. Documents within the GLS are separated by end of document word marking boundaries between consecutive documents. The query words are then separated into an active set, comprising the left-most query words, and a non-active set. A partial matching operator transverses the GLS, applying active geometric constraints, in a sequential manner, to words in the active set. This causes shifting of the active set along the GLS to comprise M left-most query words. If a document satisfies constraints associated with M words in an active set, the document comprises at least M-out-of-N words. | 12-09-2010 |
20100312778 | PREDICTIVE PERSON NAME VARIANTS FOR WEB SEARCH - Techniques for determining when and which name variant candidates to use to re-write a search query that includes a person's name in order to provide the most relevant search results are provided. A determination is made whether a person name is present in a search query request entered by a user. Name variant candidates are generated for each person name. Then, the name variant candidates are ranked for each person name based upon one or more models that calculate a probability value for each name variant candidate. Based upon these rankings, the query may be re-written to include the original person name and a specified number of top ranked name variant candidates to present the user with the most relevant search results. | 12-09-2010 |
20100312779 | ONTOLOGY-BASED SEARCHING IN DATABASE SYSTEMS - A method, information processing system, and computer program storage product retrieve data from a database. A search request is received from a user for a set of data in at least one database. An ontology query over is performed over at least one ontology associated with at least one database resulting in an ontological dataset associated with the search request in response to receiving the search request from the user. The ontological dataset includes at least one of a set of synonyms, a set of hypernyms, and a set of hyponyms, associated with the search request. A data query is performed over data in the at least one database using the ontological dataset in response to performing the ontology query. The set of data is returned to the user based on the data query that has been performed. | 12-09-2010 |
20100312780 | SYSTEM AND METHOD FOR DELIVERING PUBLICATION CONTENT TO READER DEVICES USING MIXED MODE TRANSMISSION - A system for and method of delivering publication content to one or more reader devices using mixed mode transmission is presented. The system and method may include segmenting, using a computing apparatus, the publication content into a plurality of publication content components. The system and method may also include generating, using a computing apparatus, master publication content that comprises a reference to each publication content component and indicates a structure of the publication content. The system and method may further include multi-casting, to the one or more reader devices, the master publication content and the plurality of publication content components via a network. | 12-09-2010 |
20100318531 | SMOOTHING CLICKTHROUGH DATA FOR WEB SEARCH RANKING - Described is a technology for using clickthrough data (e.g., based on data of a query log) in learning a ranking model that may be used in online ranking of search results. Clickthrough data, which is typically sparse (because many documents are often not clicked or rarely clicked), is processed/smoothed into smoothed clickthrough streams. The processing includes determining similar queries for a document with incomplete (insufficient) clickthrough data to provide expanded clickthrough data for that document, and/or by estimating at least one clickthrough feature for a document when that document has missing (e.g., no) clickthrough data. Similar queries may be determined by random walk clustering and/or session-based query analysis. Features extracted from the clickthrough streams may be used to provide a ranking model which may then be used in online ranking of documents that are located with respect to a query. | 12-16-2010 |
20100318532 | UNIFIED INVERTED INDEX FOR VIDEO PASSAGE RETRIEVAL - A method for information retrieval includes extracting from a video document visual data items and textual data items that occur in the document at respective occurrence times. Indexing records, which index both the visual and the textual data items by their respective occurrence times, are constructed and stored in a memory. | 12-16-2010 |
20100318533 | ENRICHED DOCUMENT REPRESENTATIONS USING AGGREGATED ANCHOR TEXT - A system and method for aggregating anchor text over the web graph and using the aggregated anchor text to enrich document representations. For a target page, its internal inlinks, which point to the target page and are within the site containing the target page, are identified first. Then external anchors that point to the internal inlinks from pages outside of the site are identified. Anchor text of the external anchors are collected, weighted, stored, and used to enrich document presentations. The method not only reduces the number of pages with no anchor text, but also adds lines of anchor text to URLs. | 12-16-2010 |
20100318534 | INTELLIGENT RETRIEVAL OF DIGITAL ASSETS - A technique enables intelligent retrieval of digital assets. The technique involves gathering metadata based on a scan of the digital assets. The gathered metadata includes metadata entries, each metadata entry identifying a particular digital asset and a particular set of digital asset properties of that particular digital asset. The technique further involves storing the digital assets in encrypted form within a digital asset repository of the electronic system after gathering the metadata, and updating a metadata database of the electronic system based on the metadata entries, the metadata database being distinct from the digital asset repository. Accordingly, while the digital assets are stored in the digital asset repository in encrypted form, specific digital assets within the digital asset repository are identifiable in response to a database search of the metadata database since the database search is able to use digital asset properties as searching criteria. | 12-16-2010 |
20100318535 | PROVIDING SEARCH RESULTS TO A COMPUTING DEVICE - Systems and methods for providing search results to a mobile computing device are provided herein. One exemplary method includes receiving a search request from the mobile computing device, where the search request includes location data identifying a location of the mobile computing device. If the search request includes an explicit search query, the method includes associating candidate search information derived from the explicit search query with the location identified by the location data of the search request. If the search request includes an explicit search query, the method also includes sending query-based search results to the mobile computing device. If the search request includes an implicit search query, the method includes sending location-based search results to the mobile computing device. The location-based search results are derived from candidate search information associated with the location identified by the location data. | 12-16-2010 |
20100318536 | QUERY TREE NAVIGATION - System, computer implemented method and computer program product for preparing and navigating a query tree including a plurality of query nodes and informational nodes. Each query node is associated with a prompt, branching criteria and keywords. A current query node provides a prompt to a user and a user response is received and analyzed to identify branching criteria and keywords from the user response. The method navigates to another node in the query tree in consideration of the branching criteria received in the user response and a comparison between the keywords received in the user response and the keywords associated with the query nodes. The comparison may validate navigation to a destination node corresponding to the branching criteria or the comparison may indicate incorrect navigation of the query tree. Corrective navigation can be implemented in various ways based upon the keywords received in the user response. | 12-16-2010 |
20100318537 | PROVIDING KNOWLEDGE CONTENT TO USERS - Systems, methods, and computer-storage media for generating and providing knowledge content to users utilizing a web architecture that integrates information across data silos through a common, flexible data storage schema, such as a star or snowflake schema, are provided. Data from a content graph, a user activity graph, a social graph, and temporal data as it relates to each of the content graph, the social graph and the user activity graph, is stored in a knowledge content database utilizing the star schema. In this way, data from each of these formerly disparate sources may be accessed from a common, extensible application platform utilizing ontologies and pivot table functionality, thus providing smarter, more comprehensive knowledge in response to received user queries. | 12-16-2010 |
20100318538 | PREDICTIVE SEARCHING AND ASSOCIATED CACHE MANAGEMENT - A computer system including instructions stored on a computer-readable medium, may include a query manager configured to manage a query corpus including at least one predictive query, and a document manager configured to receive a plurality of documents from at least one document source, and configured to manage a document corpus including at least one document obtained from the at least one document source. The computer system also may include a predictive result manager configured to associate the at least one document with the at least one predictive query to obtain a predictive search result, and configured to update a predictive cache using the predictive search result, and may include a search engine configured to access the predictive cache to associate a received query with the predictive search result, and configured to provide the predictive search result as a search result of the received query, the search result including the at least one document. | 12-16-2010 |
20100318539 | LABELING DATA SAMPLES USING OBJECTIVE QUESTIONS - Described is a technology for obtaining labeled sample data. Labeling guidelines are converted into binary yes/no questions regarding data samples. The questions and data samples are provided to judges who then answer the questions for each sample. The answers are input to a label assignment algorithm that associates a label with each sample based upon the answers. If the guidelines are modified and previous answers to the binary questions are maintained, at least some of the previous answers may be used in re-labeling the samples in view of the modification. | 12-16-2010 |
20100318540 | IDENTIFICATION OF SAMPLE DATA ITEMS FOR RE-JUDGING - Described is a technology for identifying sample data items (e.g., documents corresponding to query-URL pairs) having the greatest likelihood of being mislabeled when previously judged, and selecting those data items for re-judging. In one aspect, lambda gradient scores (information associated with ranked sample data items that indicates a relative direction and how “strongly” to move each data item for lowering a ranking cost) are summed for pairs of sample data items to compute re-judgment scores for each of those sample data items. The re-judgment scores indicate a relative likelihood of mislabeling. Once the selected sample data items are re-judged, a new training set is available, whereby a new ranker may be trained. | 12-16-2010 |
20100318541 | Filter Range Bound Paged Search - A filter range based search control to request a range of data from one or more directory servers. A directory server receives a search request from a client application comprising a search filter control defining a set of requested data, a sort control defining a sorting order of the set of requested data, and a range filter control defining a range of entries in the requested data. Data entries matching a search value defined in the search filter control and sorted according to sort attributes defined in the sort control are obtained from a set of directories associated with the directory server to form a sorted list of matching entries. A subset of data entries in the sorted list that match a range value defined in the range filter control are collected, and a response comprising the collected subset of data entries is then sent to the client application. | 12-16-2010 |
20100318542 | METHOD AND APPARATUS FOR CLASSIFYING CONTENT - Natural-language words are associated with content. The natural-language words are identified from, for example, metadata and/or the actual content itself. Each word identified for the content is associated with the identified genre of the content (from, for example, its tagged metadata). A database is then maintained having a number of occurrences of each word from the multiple content items for each genre. Once the word/genre database is created, subgenres for a particular program/content can be created by once again using statistics from the words identified for that program to rank the most appropriate genres for the words and produce sets of the highest ranked genres. | 12-16-2010 |
20100318543 | INTERACTIVE PHYSICAL DESIGN TUNING - An architecture for providing interactive sessions for physical database design is described, allowing users to readily try different options, identify problems, and obtain physical designs in a flexible way. Embodiments based on a .NET assembly and modifications to a database management system (DBMS) are also described. | 12-16-2010 |
20100318544 | DEVICE AND METHOD FOR SELECTING AT LEAST ONE MEDIA FOR RECOMMENDATION TO A USER - The invention relates to a method and device for selecting at least one media for recommendation to a user. The device comprises an interface to a users database comprising data relative to users medias consumption and data relative to connections between users. The device further comprises a statistical analyzer receiving data relative to users medias consumption and connections between users in inputs and generating a first list of at least one media for output. The device comprises an interface to a medias library comprising parameters indicative of medias content. The device also comprises an analytical analyzer receiving data relative to users medias consumption and parameters indicative of medias content in inputs and generating a second list of at least one media for output. The device also comprises a recommendation engine receiving the first and second lists of media and selecting at least one media for recommendation to the user. | 12-16-2010 |
20100318545 | PERIOD TO DATE FUNCTIONS FOR TIME INTELLIGENCE FUNCTIONALITY - A system for extending a Time Intelligence language to provide support for period-to-date functions and for generating member sets in response to data queries is provided. The system may apply member aggregation functions and queries across a plurality of heterogeneous data sources. Each data source is aligned to a reference dimension and is said to organize data according to at least one level of granularity. In some embodiments, a member aggregation function specifies a period (e.g., year, quarter, month) and retrieves data from a data source starting with the current specified period and ending with the most recently completed period equal to the granularity of the data source. The system may allow a user to further customize a member aggregation function by specifying a granularity, a period offset, or a granularity end offset. Additionally, the system may generate a caption to display in association with the retrieved data. | 12-16-2010 |
20100318546 | SYNOPSIS OF A SEARCH LOG THAT RESPECTS USER PRIVACY - Described is releasing output data representing a search log, in which the data is suitable for most data mining/analysis applications, but is safe to publish by preserving user privacy. The search log is processed such that a query is only included if a sufficient count of that query is present; noise may be added. User contributions that are considered may be limited to a maximum number of queries. The output may indicate how often (possibly plus noise) that each query appeared. Other output may comprise a query-action graph, a query-inaction graph and/or a query-reformulation graph, with nodes representing queries and nodes representing actions, inactions or reformulations (e.g., clicked URLs, skipped URLs, or selected related queries), and edges between nodes representing action, skip or selection counts (possibly plus noise). The output may correspond to the top results/related queries returned from a search. | 12-16-2010 |
20100318547 | PRESERVATION OF DIGITAL CONTENT - Methods for generating a characterizing summary and generating a collection of relevant preservation objects in a preservation system are provided. A characterizing summary is generated by collecting first information about a preservation object; collecting second information about other preservation objects or other metadata; generating a characterizing summary according to the first information and the second information; and adding the characterizing summary to the preservation object. A collection of relevant preservation objects is generated by accessing one or more preservation objects by way of one or more metadata included in a target preservation object constructed for content data; determining whether each of the accessed preservation objects is relevant to the target preservation object; adding each relevant preservation object to a list of relevant preservation objects; and generating the collection of relevant preservation objects according to the list of relevant preservation objects. | 12-16-2010 |
20100318548 | Querying by Concept Classifications in an Electronic Data Record System - Embodiments of the present invention enable processing of concept-based query requests submitted to a query service within a healthcare transaction framework. In embodiments, a terminology service within the healthcare transaction framework manages terminology content (concepts represented by a set of terminologies). In embodiments, search criteria from a data access query request are submitted to the terminology service to extract a set of concepts from the terminology content that are associated with the search criteria. In embodiments, equivalence search criteria include a seed concept, and the terminology service returns a set of equivalent concepts comprising the seed concept. In embodiments, classification search criteria include a classification identifier, and the terminology service returns a set of concepts associated with the classification identifier. In embodiments, the query service generates and submits a data access query comprising predicates associated with the returned set of concepts. | 12-16-2010 |
20100318549 | Querying by Semantically Equivalent Concepts in an Electronic Data Record System - Embodiments of the present invention enable processing of concept-based query requests submitted to a query service within a healthcare transaction framework. In embodiments, a terminology service within the healthcare transaction framework manages terminology content (concepts represented by a set of terminologies). In embodiments, search criteria from a data access query request are submitted to the terminology service to extract a set of concepts from the terminology content that are associated with the search criteria. In embodiments, equivalence search criteria include a seed concept, and the terminology service returns a set of equivalent concepts comprising the seed concept. In embodiments, classification search criteria include a classification identifier, and the terminology service returns a set of concepts associated with the classification identifier. In embodiments, the query service generates and submits a data access query comprising predicates associated with the returned set of concepts. | 12-16-2010 |
20100325120 | Bookmark-guided, taxonomy-based, user-specific display of syndication feed entries using natural language descriptions in foreground and background corpora - A method for user-specific display of syndication feed entries uses a taxonomy, a user-specific foreground corpus of bookmarks, and a background corpus of feed entries. User-specific book-marks are received. Each bookmark provides a natural-language description characterizing a bookmark resource. The natural-language descriptions are classified to determine one or more bookmark topics for each bookmark. The topics are maintained in the taxonomy. The bookmark topics are each associated with accumulators in the user-specific foreground corpus. Each book-mark is accumulated to the accumulators corresponding to each of its topics. Feed syndication entries are received and similarly classified according to associated natural-language descriptions. Entry topics are associated with accumulators in the background corpus. A user-specific weight is determined for each entry by aggregating the accumulators corresponding to the entry topics for the foreground and background corpora. The entries are displayed for a specific user in order of declining user-specific weight. | 12-23-2010 |
20100325121 | METHODS AND SYSTEM FOR DISTRIBUTING DATA TO TECHNICAL COMPUTING WORKERS - A method and system is disclosed for providing a distributed technical computing environment for distributing technical computing tasks from a technical computing client to technical computing workers for execution of the tasks on one or more computers systems. Tasks can be defined on a technical computing client, and the tasks organized into jobs. The technical computing client can directly distribute tasks to one or more technical computing workers. Furthermore, the technical computing client can submit tasks, or jobs comprising tasks, to an automatic task distribution mechanism that distributes the tasks automatically to one or more technical computing workers providing technical computing services. The technical computing worker performs technical computing of tasks and the results of the execution of tasks may be provided to the technical computing client. Data associated with the tasks is managed by a programmable interface associated with a data storage repository. The interface allows the various entities of the distributed technical computing environment to access data services performable by the interface or by a file system or a database and database management system associated with the data. | 12-23-2010 |
20100325122 | APPARATUS AND METHOD FOR INTEGRATING APPLICATIONS INTO A COMPUTERIZED ENVIRONMENT - A method and apparatus for automatically suggesting further applications to a user using an executed application in a computerized environment, comprising receiving metadata provided by the executed application; searching an index for suggested applications which receive as input the data provided by the executed application; assigning a priority for each of the suggested applications: sorting the suggested applications according to the priority; and displaying to the user a list comprising the applications that received the highest priorities. | 12-23-2010 |
20100325123 | Media Seed Suggestion - Media recommendation techniques are described. In an implementation, a similarity value is calculated for a plurality of media using a plurality of similarity functions. A vote is assigned for each similarity value that is above a threshold that is assigned for a respective similarity function and the plurality of media is ranked based at least in part on the assigned votes. A playlist is then created based at least in part on the ranking. Media seed techniques are also described. In an implementation, a set of dissimilar candidates are calculated for a plurality of media using a similarity function in which the set of dissimilar candidates describes the media that is dissimilar in comparison with other media included in the plurality of media. A seed is selected using the set of the dissimilar candidates to create a playlist that includes at least some of the plurality of media. | 12-23-2010 |
20100325124 | TUNING QUERY EXECUTION PERFORMANCE OF A DATABASE SYSTEM - Methods, systems, and computer program products for tuning query execution performance in a database management system are described. In an embodiment, query performance issues of chosen database operational logic in a database management system are identified with an external utility provided for use on top of the database management system. The identified query performance issues are resolved selectively in the database management system without modifying the chosen database operational logic. | 12-23-2010 |
20100325125 | MEDIA RECOMMENDATIONS - Media recommendation techniques are described. In an implementation, a similarity value is calculated for a plurality of media using a plurality of similarity functions. A vote is assigned for each similarity value that is above a threshold that is assigned for a respective similarity function and the plurality of media is ranked based at least in part on the assigned votes. A playlist is then created based at least in part on the ranking. Media seed techniques are also described. In an implementation, a set of dissimilar candidates are calculated for a plurality of media using a similarity function in which the set of dissimilar candidates describes the media that is dissimilar in comparison with other media included in the plurality of media. A seed is selected using the set of the dissimilar candidates to create a playlist that includes at least some of the plurality of media. | 12-23-2010 |
20100325126 | RECOMMENDATION BASED ON LOW-RANK APPROXIMATION - A system and method for providing personalized recommendations are disclosed herein. A system includes a processor and a software system executed by the processor. The software system provides a recommendation for an item. The recommendation is based on a comparison of a low-rank approximation of a domain matrix to a user profile. The user profile is based, in part, on the low-rank approximation of the domain matrix. | 12-23-2010 |
20100325127 | METHOD AND APPARATUS FOR AUTOMATIC GEO-LOCATION AND SOCIAL GROUP INDEXING - An approach is provided for automatic geo-location and social group indexing thereby search geo-locations. A geo-location search learning platform receives a query specifying words, and retrieves context information of a user based upon a criterion. The geo-location search learning platform then assigns to the user a social group identifier identifying a social group based on the context information, retrieves one or more social group indexes based upon the social group identifier, retrieves one or more geo-location indexes based upon the one or more social group indexes, and generates a search result using, in response to the query, the one or more geo-location indexes and the words. | 12-23-2010 |
20100325128 | GENERATING AND REGISTERING DOMAIN NAME-BASED SCREEN NAMES - Methods of the present inventions allow for generating and registering domain name-based screen names. An exemplary method may comprise the steps of registering a domain name to a registrant, generating a screen name for a software application that may be based upon the domain name, and registering the screen name to the registrant. | 12-23-2010 |
20100325129 | DETERMINING THE GEOGRAPHIC SCOPE OF WEB RESOURCES USING USER CLICK DATA - A geographic region is automatically determined for an Internet resource based on information that has been gathered over time through the automatic monitoring of certain “click” activities of Internet search engine-using users. Over time, the search engine collects information for each click. Using this click-related data, the search engine estimates the geographic region with which the resource ought to be associated. The fact that a significant proportion of clicks on a resource's hyperlink are clicks that “came through” a search engine portal that is associated with a geographic region tends to suggest that the resource ought to be associated with that geographic region. Similarly, the fact that a significant proportion of clicks on a resource's hyperlink are clicks that were made by users whose computers have IP addresses that are associated with a geographic region tends to suggest that the resource ought to be associated with that geographic region. | 12-23-2010 |
20100325130 | MEDIA ASSET INTERACTIVE SEARCH - Media asset interactive search is described. In embodiments, successive keypad number inputs are received that each correlate to multiple characters of one or more different languages. The successive keypad number inputs form an accumulating search key as they are received. A database is searched for a sequence of characters that correlate to the accumulating search key after each successive keypad number input is received. A list of matching terms can then be generated where the matching terms include the sequence of characters, and the list of matching terms narrows with each successive keypad number input. Additionally, the list of the matching terms can be ordered based on a scoring system. | 12-23-2010 |
20100325131 | ASSIGNING RELEVANCE WEIGHTS BASED ON TEMPORAL DYNAMICS - A system described herein includes a receiver component that receives a first dataset, wherein the first dataset comprises temporal dynamics pertaining to a document that is accessible by a search engine, wherein the temporal dynamics comprise an identity of a term corresponding to the document and an indication that the term has been subject to change over time. The system also includes a weight assignor component that assigns a relevance weight to the document based at least in part upon the temporal dynamics pertaining to the document, wherein the relevance weight is utilized by the search engine to assign a ranking to the document with respect to at least one other document when the search engine retrieves the document. | 12-23-2010 |
20100325132 | QUERYING COMPRESSED TIME-SERIES SIGNALS - A system described herein includes a receiver component that receives a query that pertains to a raw time-series signal. A query executor component selectively executes the query over at least one of multiple available compressed representations of the raw time-series signal, wherein the query pertains to at least one of one of determining a trend pertaining to the raw time-series signal, generating a histogram pertaining to the raw time-series signal, or determining a correlation pertaining to the raw time-series signal. | 12-23-2010 |
20100325133 | DETERMINING A SIMILARITY MEASURE BETWEEN QUERIES - A system described herein includes a receiver component that receives a dataset that is stored in a computer-readable medium of a computing device, wherein the dataset includes a plurality of queries issued by users to a search engine and a plurality of search results selected by the users upon issuing the plurality of queries. A distribution determiner component determines click distributions over the search results selected by the users with respect to the plurality of queries. A labeler component labels at least two queries in the plurality of queries as being substantially similar to one another based at least in part upon the click distributions over the search results selected by the users with respect to the plurality of queries. | 12-23-2010 |
20100325134 | ACCURACY MEASUREMENT OF DATABASE SEARCH ALGORITHMS - A system, method and program product for evaluating search algorithms. A method is provided that includes: defining a population of searches and database records from a search history database; applying a sampling method and direct sampling rates to each search/record pair in the population using a computing system, wherein search/record pairs having a higher variability relative to the population are assigned a relatively higher probability; randomly sampling a direct sample of search/record pairs with the computing system using the direct sampling rates to increase a likelihood of obtaining search/record pairs having the higher variability; running a search algorithm and measuring errors for the direct sample and/or for an associated indirect sample; and calculating an estimated error rate for the search algorithm using inverse probability weighting. | 12-23-2010 |
20100325135 | METHODS AND APPARATUS FOR DETERMINING A MOOD PROFILE ASSOCIATED WITH MEDIA DATA - In an embodiment, a method is provided for determining a mood profile of media data. In this method, mood is determined across multiple elements of mood for the media data to create a mood profile associated with the media data. In some embodiments, the mood profile is then used to determine congruencies between one or more pieces of media data. | 12-23-2010 |
20100325136 | ERROR TOLERANT AUTOCOMPLETION - Techniques for error-tolerant autocompletion are described. While displaying characters of an input string as they are inputted by a user, when a character is added to the input string by the user, matching strings may be selected from among a set of candidate strings by determining which of the candidate strings have a prefix whose characters match the characters of the input string within a given edit distance of the input string. | 12-23-2010 |
20100325137 | Method and system for musical multimedia content classification, creation and combination of musical multimedia play lists based on user contextual preferences - A method for creating, sharing, combining, and analyzing musical multimedia play lists based on a user contextual classification. Musical multimedia is media that utilizes a combination of different content forms such as music songs, movies, pictures, and sounds. This contextual classification is defined by relationships among key elements of the multimedia content. For example, the relationships for music songs are defined among musical genre, singer/player, or a specific music song with an activity list, places or locations, and states of feeling (i.e., mood or temper) defined by the user when he usually listens to music frequently. | 12-23-2010 |
20100325138 | SYSTEM AND METHOD FOR PERFORMING VIDEO SEARCH ON WEB - A video searching method downloads video files from websites by detecting name extensions of files on the websites, and classifies the video files according to specific information of each of the video files. The specific information is obtained by detecting an image of each of the video files. The image of each of the video files is compressed to obtain a thumbnail of the image of each of the video files. A database which stores the thumbnails of the images and the specific information of the video files is provided. The thumbnails of the images of video files relative to a topic of a search request in the database can be listed in sequence according to corresponding specific information of the relative video files, as a search result. | 12-23-2010 |
20100332488 | REFERRAL-BASED SPONSORSHIP OF ACCESS TO CONTENT ITEM SETS - A content provider may provide public access to a content item set, but may be unable to achieve sufficient revenue to sustain the administrative costs and ongoing development of the content item set. Instead, the content provider may develop relationships with one or more referrers (e.g., search engines.) When a user requests a content item, the content provider may determine whether the request results from a referral by a sponsoring referrer, and based on this determination may provide either a full version or a limited version of the content item. The referrer benefits by providing its users with free access to the content item set, which may be unavailable from non-sponsoring competitors, and in exchange may share advertising revenue with the content provider. This arrangement achieves sustaining sponsorship of the content provider while extending full and free access to the content item set to users of sponsoring referrers. | 12-30-2010 |
20100332489 | INTERACTIVE SEARCH MONITORING IN A VIRTUAL MACHINE ENVIRONMENT - A method and system for providing up-to-date monitoring results in a virtual machine environment are described. In one embodiment, a control server executes a query pertaining to one or more objects in a virtual machine system, and provides a result of the query to a client for presentation to a user in a graphical user interface (GUI). The control server then periodically re-executes the query to obtain up-to-date information for the objects in the virtual machine system. Upon each re-execution of the query, the control server compares a new result of the query with a previous result of the query to determine whether the up-to-date information for the objects in the virtual machine system has changed. If so, the control server provides the new result of the query to the client. If not, the control server refrains from providing the new result of the query to the client. | 12-30-2010 |
20100332490 | Expressing Manageable Resource Topology Graphs as Dynamic Stateful Resources - A system for managing topologies includes a topology data datastore that stores topology information. A topology computer element interfaces with the topology data datastore to create and update a topology of resources. A subscription computer element generates notifications to a user based on at least one of the creating and the updating of the topology of resources and further based on subscription data. | 12-30-2010 |
20100332491 | METHOD AND SYSTEM FOR UTILIZING USER SELECTION DATA TO DETERMINE RELEVANCE OF A WEB DOCUMENT FOR A SEARCH QUERY - Methods and systems are provided that may be used to utilize user selection data on web documents in a list of search results to provide relevant search results in response to a search query. | 12-30-2010 |
20100332492 | RETRIEVAL OF RELEVANT OBJECTS IN A SIMILARITY - Techniques for retrieval of one or more relevant multi-attribute structured objects with respect to a query are provided. The techniques include receiving a query, grouping one or more attributes of one or more objects in a database into one or more groups according to how each bears a relation to the query, and using the one or more attribute groups to produce an output of one or more relevant multi-attribute structured objects in response to the query. | 12-30-2010 |
20100332493 | SEMANTIC SEARCH EXTENSIONS FOR WEB SEARCH ENGINES - Techniques are described herein that are capable of taking into consideration the intent of a user with respect to a search query received from the user. A Web server determines that the search query matches a reference query pattern. The Web server executes a semantic search extension application in response to the search query matching the reference query pattern. For example, values of respective parameters may be determined based on the search query matching the reference query pattern. In this example, semantic application results may be generated for presentation to the user based on the values of the respective parameters. | 12-30-2010 |
20100332494 | HISTOGRAM PROCESSING BY TREND AND PATTERN REMOVAL - A data processing system compress a histogram with less information loss than simply reducing the number of steps (or intervals) in the histogram. The data processing system uses a very detailed histogram as a starting point and comprises histogram compression logic that compresses a detailed histogram by detecting trends and periodic patterns in the detailed histogram. The histogram compression logic extracts the detected trends and periodic patterns from the detailed histogram, and forms a compressed histogram as a distribution of data remaining after extraction of the trends and periodic patterns. | 12-30-2010 |
20100332495 | METHOD, ARTICLE AND SYSTEM FOR TIME DEPENDENT SEARCH - A method and system for time dependent search is described. A search manager may receive a query for time dependent information relating to a base object and a time period. The search manager may search a search optimized storage system of technical objects for a technical object that matches the query. Each technical object may include a reference to time dependent information stored by a base object and a validity period. The validity period for each technical object is chosen by time stretching logic such that valid time dependent information is available for all time periods. | 12-30-2010 |
20100332496 | IMPLICIT PRODUCT PLACEMENT LEVERAGING IDENTIFIED USER AMBITIONS - The claimed subject matter provides a system and/or a method that facilitates accessing information content based at least in part on relevancy to a user by leveraging user ambitions. User ambitions can take the form of to-do lists, calendar items, goals, or interests. These can be leveraged with or without contextual information, historical data, user profiles, and the like to determine the relevancy of content to a specific user. This can facilitate determining what content is accessible to a user based on relevance. A threshold relevance level can be dynamically adjusted. | 12-30-2010 |
20100332497 | PRESENTING AN ASSEMBLED SEQUENCE OF PREVIEW VIDEOS - Methods and computer-readable media are provided for presenting on a website a single video stream that includes a plurality of preview videos directed toward a particular category of interest to a user. Informational items, such as news stories, that have associated preview videos are selected from a database. A preview video for each of the informational items is then algorithmically determined using, for instance, a ranking system. The ranking system may be based on a variety of heuristics, which may indicate popularity, importance, reliability, or relevance of the specific preview video. The single video stream is presented on the website such that the preview videos can be viewed as an assembled sequence of videos. Once an indication has been received to initiate play of the video stream, the preview videos play without requiring any user interaction. | 12-30-2010 |
20100332498 | PRESENTING MULTIPLE DOCUMENT SUMMARIZATION WITH SEARCH RESULTS - Methods and computer-readable media are provided for summarizing the content of a plurality of documents and presenting the results of such multiple-document summarization to a user in such a way that the user is able to quickly and easily discern what, if any, unique information each document contains. Each sentence of each document is assigned a score based upon the perceived importance of the information contained therein. The sentences receiving the highest scores are then compared with one another to identify and remove any duplicate sentences. The remaining high-scoring sentences are extracted from the corresponding documents and presented to the user, for instance, in a bulleted list format. The user can then simply scan the list and can quickly and easily discern the unique information contained in each document. | 12-30-2010 |
20100332499 | METHOD AND SYSTEM FOR DETERMINING CONFIDENCE IN ANSWER FOR SEARCH - In a method for a direct answer for search, a search query is received over a network, one or more answer candidate snippets for the search query are received, with an answer candidate snippet having at least a portion of content available over the network for an answer candidate, one or more answer entities are determined within a selected answer candidate snippet, a frequency of the one or more answer entities found within the one or more answer candidate snippets for the search query is determined, a confidence score is adjusted for the selected answer candidate in accordance with the frequency of the one or more answer entities found within the one or more answer candidate snippets, and at least one answer candidate snippet is sent for a response to the search query. | 12-30-2010 |
20100332500 | METHOD AND SYSTEM FOR DETERMINING A RELEVANT CONTENT IDENTIFIER FOR A SEARCH - In a method for a direct answer for search, a search query is received over a network, one or more answer entities are determined from one or more answer candidate snippets, with an answer candidate snippet having at least a portion of content available over the network for an answer candidate, a content identifier is determined for an answer candidate, a title is tokenized for the content identifier, a comparison is performed between a vector of tokens for the title and a vector of the one or more answer entities, an indicator of the relevance is adjusted for the content identifier in accordance with the comparison, and at least one answer candidate snippet is sent for a response to the search query. | 12-30-2010 |
20100332501 | SYSTEM AND METHOD FOR ON-DEMAND INDEXING - A system and method for on-demand indexing in a data management system is described. An index is generated when it is requested, such as when a database operation requires access to the index. If the index is loaded in memory, the index is retrieved from memory. Otherwise, the index is generated on-demand. A priority configuration identifies at least one priority index which is generated and loaded in memory. The priority configuration can identify priority indexes either directly or indirectly, such as by a threshold parameter. | 12-30-2010 |
20100332502 | METHOD AND SYSTEM FOR SEARCHING NUMERICAL TERMS - A method and system for searching numerical terms are provided. The method includes processing a numerical term to a stem, the stem being in the form of a number, and a distance measurement of the numerical term to the stem, wherein a numerical term is a string of characters identified as a number by a numeric parser, and indexing the numerical term in a search index by the stem for search retrieval. The method includes receiving a query and processing the query to divide it into terms, including a numerical term. The numerical terms of the query are also processed to a stem and a distance measurement and document results are retrieved for the stem from an index. | 12-30-2010 |
20100332503 | System and Method for Using an Exemplar Document to Retrieve Relevant Documents from an Inverted Index of a Large Corpus - A system and method for using an exemplar document or search query to retrieve relevant documents from an inverted index of a large corpus of documents. The system and method groups words by synonym and calculates term frequency (TF) and inverse document frequency (IDF) scores for the respective word groups. A composite term frequency-inverse document frequency (TF-IDF) score is calculated for each word group and the documents of the corpus are ranked based on the TF-IDF scores, utilizing a vector space model incorporating a cosine similarity function. | 12-30-2010 |
20100332504 | System and Method for Providing Delegation Assistance - The embodiments described herein provide various techniques for providing delegation assistance. Upon a request for delegation assistance, data from information sources are retrieved. Relationships are automatically identified relative to a requesting user based on the data from the information sources. The relationships are automatically ranked, and results of the ranking are provided to the requesting user. The user may then trigger delegation resolution based in part on the results of the ranking. | 12-30-2010 |
20100332505 | Handling Data Access Requests in Computer Program Updates - In an embodiment, a method is provided for updating a computer program. In this method, a record related to a data structure being effected in the updating of the computer program is identified. Here, the data structure is accessible by the computer program. Additionally, a request is received during the update of the computer program to access a further record related to the data structure. The further record in the request is identified to match the record effected in the updating of the computer program. The request is thereby prevented from accessing the further record related to the data structure based on the further record matching the record related to the data structure | 12-30-2010 |
20100332506 | MARKING SOUGHT AFTER CONTENT ITEMS ON NETWORK MEDIA DEVICES - According to embodiments of the invention, a system, method and computer program product for a computer program product for marking and acquiring sought after content are provided. Embodiments include a method comprising inserting a first desired content ID for a desired content item in a content directory for a first device in a network of media devices. The content directories of the devices in the network include content IDs of content present in the device, and also content IDs of content desired for the devices. Content directories of the other devices in the network are compared to determine if any of the other devices have a content directory containing the first desired content ID. For devices having the first desired content ID in its content directory, a determination is made of whether the desired content is present in the other device, and if the desired content is present in the other device, a copy of the desired content is transferred to the first device. | 12-30-2010 |
20100332507 | METHOD AND APPARATUS FOR CONTENT FILTERING - An approach is provided for optimizing a sequence of content filters or data screening tasks. A determination is made of filters for filtering content. For each of the filters, cost data for executing the filtering of the content is computed. A sequence of the filters is determined based on the computed cost data and the elimination rates for minimizing a total execution cost of the sequenced filters. | 12-30-2010 |
20100332508 | METHODS AND SYSTEMS FOR EXTRACTING AND ANALYZING ONLINE DISCUSSIONS - Extracting and analyzing online discussions to identify prospects of a subject is provided. The method has steps including initializing queries related to the subject and a set of data sources utilizing subject information and one or more data source names, extracting the discussions from the set of data sources by employing the queries, extracting significant discussions from the extracted discussions by applying discussions quality methods, identifying websites corresponding to the significant discussions; extracting significant websites by applying websites quality methods to the identified websites, determining a website influence of each of the significant websites by determining their corresponding attributes, identifying a discussion influence of each of the significant discussions based on the website influence of each of the corresponding significant websites, and weighting the significant discussions and the significant websites utilizing the discussion influence and the website influence of each of the significant discussions and the significant websites, respectively. | 12-30-2010 |
20100332509 | SYSTEMS AND METHODS FOR INTEGRATED MANAGEMENT OF GOVERNMENTAL PROJECTS - A program management (PM) application can provide a universal and secure interface for users to enter data for governmental projects, manage and consolidate the data according to governmental contacting rules, and generate a variety of reports as required by the governmental contracting rules. The PM application can utilize customized and customizable forms that allow the user to enter data for governmental projects. The forms can be generated as graphical user interfaces (GUIs) that allow the user to select different types of data to enter into the PM application. The PM application can classify and store the received data in a program management (PM) database. The PM application can classify the data in a hierarchical structure as required by the rules of governmental contracting. | 12-30-2010 |
20100332510 | SYSTEM AND METHOD FOR SEMANTIC EXPOSURE OF DATA STORED IN A DYNAMIC SCHEMA - A system and method for providing semantic access of data in a master data management system. Data stored in a dynamic repository schema is exposed in a semantically accurate format. The schema is determined from information received from the master data management system describing the schema. A set of database views is generated based on said schema. A query from an external application in a standard query language is received and the query is performed using at least one database view. The database views are updated when a schema change is detected. | 12-30-2010 |
20100332511 | System and Methods for Units-Based Numeric Information Retrieval - An information retrieval and analysis system for numeric data which provides high precision and recall for numeric search and uses a methodology for determining contextualization of the extracted data. The capabilities include extracting, parsing, and contextualizing numeric data including both a numeric value and an accompanying unit. This system facilitates the organization of largely unstructured numeric data into an inverted index and other database formats. An information retrieval system which enables the exploration and refinement of an extracted numeric data set defined by a search input that may be precise or initially vague. This system also facilitates analyzing and portraying numeric data graphically, creating knowledge by combining data from multiple sources, extracting correlations between seemingly disparate variables, and recognizing numeric data trends. This system uses local natural language processing, mathematical analysis, and expert-based scientific heuristics to score the numeric and contextual relevancy of the data to the query parameters. | 12-30-2010 |
20100332512 | SYSTEM AND METHOD FOR CREATING AND MANIPULATING THUMBNAIL WALLS - A system and method for creating and manipulating thumbnail walls, comprising a client computer, a connection to the Internet, a content server, and a mail server, which enable generation of an Internet wall with thumbnail images by performing an initial information search of a plurality of electronic data sources, displaying the results of said initial search, refining or modifying the search to produce new results, displaying the results of the refined search, and saving or sending the results of the refined search. | 12-30-2010 |
20110004606 | Method and system for determining relevance of terms in text documents - The present invention provides a corpus-independent method for determining relevancy of terms to content of text appearing in a document by analyzing the document itself. Conventional information extraction, or other methods, may be applied to a document to generate a list of terms. The invention analyzes the document using relevancy scoring algorithms to determine a term relevancy score representing the term's relevance to the text contained in the document. The scores, including an aggregate score, may be normalized in the process. Based on relevancy scoring, terms are then ranked and further processed. In this manner relevancy is determined based on the subject document itself and by analyzing the occurrences and locations of the terms within the document. Additional techniques may be applied to relate the relevancy scores generated by the present invention to a corpus or collection of documents. | 01-06-2011 |
20110004607 | TECHNIQUES FOR REPRESENTING KEYWORDS IN AN ENCRYPTED SEARCH INDEX TO PREVENT HISTOGRAM-BASED ATTACKS - A method and system for cryptographically indexing, searching for, and retrieving documents is provided. In some embodiments, an encryption system is provided that generates a document index that allows users to retrieve documents by performing encrypted queries for keywords associated with the documents. In some embodiments, each keyword maps to the same number of encrypted document identifiers. In some embodiments, an extractor graph is employed to map an indication of each keyword to a number of buckets storing encrypted document identifiers. In some embodiments, an order-preserving encryption system is provided. The encryption system uses an ordered index that maps encrypted instances of ordered attribute values to documents that are associated with those values. The ordered index enables queries containing query operators that rely on order, such as less than (“<”) or greater than (“>”), to be successfully performed on encrypted attribute values. | 01-06-2011 |
20110004608 | COMBINING AND RE-RANKING SEARCH RESULTS FROM MULTIPLE SOURCES - Embodiments are presented for combining and re-ranking results of the same search performed by multiple search sources. This is generally accomplished by first inputting the results of the search from the multiple sources. Typically the results produced by the sources and their rankings will vary from one source to another. A ranking standard is established based on the differences in rank between consecutively ranked search results items in the results input from one of the search sources that is designated as the primary search source. The search result items from each secondary search source are then re-ranked based on this ranking standard to create a common ranking scheme for all the search result items input from the primary and secondary search sources. In addition, duplicate search result items are eliminated. The remaining primary and secondary search result items are then provided to the user in a single results set. | 01-06-2011 |
20110004609 | GENERATING SEARCH RESULTS BASED ON USER FEEDBACK - Systems, methods and articles of manufacture are disclosed for generating search results based on user feedback. A request may be received to generate search results retrieved using a search string. The request may include user feedback for one or more selected documents of the search results. Improved search results may be generated based on the search results and the feedback for one or more selected documents of the search results. The improved search results may be output to a graphical display device. | 01-06-2011 |
20110004610 | Automatic Generation of Stop Word Lists for Information Retrieval and Analysis - Methods and systems for automatically generating lists of stop words for information retrieval and analysis. Generation of the stop words can include providing a corpus of documents and a plurality of keywords. From the corpus of documents, a term list of all terms is constructed and both a keyword adjacency frequency and a keyword frequency are determined. If a ratio of the keyword adjacency frequency to the keyword frequency for a particular term on the term list is less than a predetermined value, then that term is excluded from the term list. The resulting term list is truncated based on predetermined criteria to form a stop word list. | 01-06-2011 |
20110010378 | TREND CHARTING SYSTEM AND METHOD - A trend charting system includes one or more participant terminals operable to act as a client on a network and a computer operable to act as a server on the network and to communicate with each of the participant terminals over the network. The computer includes a memory configured to store a set of instructions and a processor configured to execute the set of instructions. The set of instructions cause the processor to: receive one or more search terms; search one or more databases for each search term; create a search result, wherein the search result includes the number of instances each search term has been found in each database and a date associated with each of said instances; and generate a search result chart based on the search result. A system, method and device are disclosed. | 01-13-2011 |
20110010379 | DATABASE SYSTEM WITH QUERY INTERCEPTION AND REDIRECTION - A database system includes: a first database having back-end functionality for data storage and database query execution, a database front-end and an interception unit. The database front-end is configured for processing user queries directed to a back-end of a second database, and lacks the capabilities for directly accessing the first database. The interception unit is networked with the first database over a data network, and is configured for monitoring user queries under processing by the front-end to identify queries pertaining to data stored in the first database, and redirecting the identified queries to the first database for execution. Thereby the functionality of the database front-end is provided for data stored in the first database. | 01-13-2011 |
20110029551 | SYSTEM AND METHOD FOR GENERATING A USER-DEFINED FUNCTION USING A SHELL - 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. | 02-03-2011 |
20110035396 | RUNTIME-DEFINED DYNAMIC QUERIES - 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. | 02-10-2011 |
20110035397 | DISCOVERING QUERY INTENT FROM SEARCH QUERIES AND CONCEPT NETWORKS - 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. | 02-10-2011 |
20110055237 | Symbolic Query Exploration - 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). | 03-03-2011 |
20110055238 | METHODS AND SYSTEMS FOR GENERATING NON-OVERLAPPING FACETS FOR A QUERY - Methods and systems are disclosed for generating non-overlapping facets for an original query that is submitted for a search. | 03-03-2011 |
20110055239 | RUNTIME QUERY MODIFICATION IN DATA STREAM MANAGEMENT - 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. | 03-03-2011 |
20110055240 | METHOD AND SYSTEM FOR DATABASE-BASED SEMANTIC QUERY ANSWERING - 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. | 03-03-2011 |
20110072030 | ACTIVE AUDITING IN A DATABASE SYSTEM - 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. | 03-24-2011 |
20110072031 | Method for modifying a query by use of an external system for managing assignment of user and data classifications - 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. The data processing-implemented method includes determining available information from parameters for locating a classification of the requested element and a classification associated with the query, the requested data classification controlling access to the requested element according to the query associated classification, requesting a suggested action from an external system for obtaining a comparison of the requested data classification and the query associated classification based on the available information, receiving the suggested action from the external system responsive to the sent request, and incorporating the suggested action into the query, the suggested action effecting comparison of the requested data classification with the query associated classification. | 03-24-2011 |
20110093485 | LEVERAGING STRUCTURED XML INDEX DATA FOR EVALUATING DATABASE QUERIES - 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. | 04-21-2011 |
20110113052 | QUERY RESULT ITERATION FOR MULTIPLE QUERIES - 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. | 05-12-2011 |
20110125772 | QUERY-TIME AND VIEW-TIME SECURITY FOR SEMANTIC LAYER - 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. | 05-26-2011 |
20110131226 | SYSTEM AND METHOD FOR ABSTRACTION OF OBJECTS FOR CROSS VIRTUAL UNIVERSE DEPOLYMENT - 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. | 06-02-2011 |
20110161339 | PENDING STATE MANAGEMENT FOR MOBILE BUSINESS OBJECTS - A system, method, and computer program product are provided for invoking an operation to change a current data row of a table in a local database. As a result, a pending change data row is inserted in the table, distinguished by a primary key comprising a common key value and a pending change indicator. The pending change is then submitted for synchronization. | 06-30-2011 |
20110208766 | SYSTEM AND METHOD FOR MANAGING PERSONAL INFORMATION - The system includes a computing device, a receiving module, a storage device, a build-out module and a leveraging module. The computing device includes a processor. The receiving module is communicably connected to the processor and is configured to receive personal information. The storage device is communicably connected to the processor and is configured to store the received personal information. The build out module is communicably connected to the processor and is configured to automatically retrieve additional personal information based on the received personal information. The leverage module is communicably connected to the processor and is configured to utilize the stored information to automatically perform an organizational task historically performed by a person. | 08-25-2011 |
20110264678 | USER MODIFICATION OF A MODEL APPLIED TO SEARCH RESULTS - A data search and retrieval system that, in response to a search query, applies a model to search results to generate information to be returned to a user. A user may modify the model via a set of controls displayed to the user. The modified model may then be applied to search results to generate information in compliance with the modified model. Modified models may be stored locally on a client system or stored in the search system and made available to other users so that the modified models can be applied to subsequent requests for information. The modified models and the results of a search may be stored on a client machine such that, as the model is modified, new information may be generated based on the original search, reducing communication bandwidth, which can improve the speed and cost of providing user interaction with data in a mobile environment. | 10-27-2011 |
20110270861 | GRAPH QUERY ADAPTATION - Systems, methods, and other embodiments associated with graph query adaptation are described. One example method includes generating an adapted topological query from a base topological query. The adapted topological query may be generated upon detecting a pre-specified sub-graph in the base topological query. The example method may also include executing the adapted topological query on a stored graph to generate a query result. | 11-03-2011 |
20110270862 | INFORMATION PROCESSING APPARATUS AND INFORMATION PROCESSING METHOD - This invention is directed at providing a technique for implementing higher-speed search processing for a binary structured document. A search query conversion means converts a search query for a structured document by converting each node building the search query into a corresponding index by using a vocabulary list. A document analysis means specifies an index corresponding to each node building the structured document by using the vocabulary list. A search query evaluation means searches for part of the structured document that corresponds to the converted search query, by using each index described in the converted search query and the index corresponding to each node that is specified by the document analysis means. | 11-03-2011 |
20110270863 | QUERY REWRITING WITH ENTITY DETECTION - A system determines whether a received search query includes an entity name, determines whether to rewrite the received search query based on information relating to prior searches involving the entity name, and rewrites the received search query when it is determined that the received search query should be rewritten. The system further determines whether to provide a suggestion of rewriting the received search query, as a rewriting suggestion, based on information relating to prior searches involving the entity name when it is determined that the received search query should not be rewritten. The system also generates the rewriting suggestion when it is determined that the rewriting suggestion should be provided. The system performs a search based on one of the received search query and the rewritten search query to obtain search results, presents the search results, and presents the rewriting suggestion when it is determined that the rewriting suggestion should be provided. | 11-03-2011 |
20110276580 | SYNONYM SUPPORTED SEARCHES - 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. | 11-10-2011 |
20120016897 | SYSTEM AND METHOD FOR IMPROVING WEBPAGE INDEXING AND OPTIMIZATION - 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. | 01-19-2012 |
20120047158 | METHOD AND SYSTEM FOR PERFORMING QUERY OPTIMIZATION USING A HYBRID EXECUTION PLAN - An improved method, system, and computer program product is disclosed that provides a hybrid approach to optimization which allows different subsets of data accessed by a query to be optimized with different access paths and execution approaches. Transformations may be performed to re-write the query, which restructures the query in a way that facilitates the hybrid optimization process. Multiple transformations may be interleaved to produce an efficient re-written query. | 02-23-2012 |
20120059838 | PROVIDING ENTITY-SPECIFIC CONTENT IN RESPONSE TO A SEARCH QUERY - Computer-readable media, computer systems, and computing devices facilitate providing entity-specific content to a user in response to a search request. A search request is received from a user and determined to be related to an entity. Domains associated with the entity are also identified. The search service identifies a set of potential answers and uses the potential answers to generate a set of reformulation queries, which are used to query answer services. Answers returned by the answer services are ranked and bound to an entity card, which is subjected to a quorum checking process that facilitates optimization of the use of allocated screen real estate associated with the entity card. A representation of the entity card is presented on a search-results page. | 03-08-2012 |
20120066243 | MINING PRODUCT RECOMMENDATION FROM QUERY REFORMULATIONS - In various example embodiments, systems and methods to mine product recommendations from query reformulation is provided. In example embodiments, a search query is mapped to a particular product. Transition data for the particular product is accessed. The transition data includes values reflecting a number of search transitions between the particular product and other products in session sets of previous queries. One or more recommendations based on the transition data is determined and provided to the user. | 03-15-2012 |
20120089627 | SYSTEM AND METHODS FOR PERFORMING MACHINE-IMPLEMENTED TASKS - A task management system may be configured to select and/or perform one or more tasks. The task management system may be configured to create weighted groups of tasks to be performed in response to various triggering conditions. The task management system may include a value generation module, which may be configured to generate values used to select tasks from two or more of the weighted groups of tasks. | 04-12-2012 |
20120089628 | SEARCH EXPRESSION GENERATION SYSTEM - A search expression is automatically generated for designating a target element for a Web page whose contents change according to a system state or the number of elements to be displayed. The search expression generation device comprises the model sentence accumulation unit which accumulates a plurality of model sentences of structured documents to be searched on a kind basis, the element designation unit which designates an element to be searched in a model sentence designated from the plurality of model sentences of the structured documents, the structured document analysis unit which analyzes a structure of a model sentence designated to select an element to be added to a search expression as a condition and an element to be deleted from the search expression as a condition based on a search target element designated, and the search expression structuring unit which adds or deletes the element selected to or from a search expression, wherein the structured document analysis unit analyzes a structure of a model sentence designated by the element designation unit to generate a search expression with a condition added which is common to a plurality of model sentences of the same kind. | 04-12-2012 |
20120102058 | DETERMINING RELATED KEYWORDS BASED ON LIFESTREAM FEEDS - Embodiments are directed towards providing related keywords determined to be relevant to a search term using life-streaming data to identify the related keywords. Relevancy is determined by performing the related keyword analysis when life-stream services have been updated. Related keywords may be identified for a given search term using a combination of an aggregated life-stream analysis, a user profile based analysis, and/or a community based life-stream analysis. Each of these mechanisms identify a subset of updated life-streams or profiles to be analyzed to identify keywords that co-occur within each life-steam along with the given search term. The resulting co-occurring keywords may then be ordered based on a frequency of occurrence for the subset of life-streams. A weighted combination of the identified related keywords may be used to display related keywords to a user for use in modifying a search query. | 04-26-2012 |
20120117100 | MULTIMEDIA OBJECT RETRIEVAL FROM NATURAL LANGUAGE QUERIES - A method for identifying multi-media assets from a multi-media collection, and the method implemented at least in part by a data processing system and comprising the steps of: receiving a search query, the search query, or a derivative thereof, including a possessive phrase, wherein the possessive phrase includes a possessor and a possession category; identifying a denoted object referred to by the possessive phrase using a predefined relationship database that establishes social relationships between objects; identifying one or more additional possessors of the denoted object using the predefined relationship database; generating one or more additional possessive phrases for the denoted objects relating the identified additional possessors to the denoted object; and identifying one or more multi-media assets from the multi-media collection containing the denoted object responsive to the one or more additional possessive phrases. | 05-10-2012 |
20120158762 | METHODS, APPARATUSES AND COMPUTER PROGRAM PRODUCTS FOR CONVERTING A GEOGRAPHICAL DATABASE INTO A MAP TILE DATABASE - An apparatus for converting geographical geometrical content of a geographical database to map tiles may include a processor and a memory storing executable computer code that cause the apparatus to at least perform operations including modifying a geographical database based in part on adding items of data arranged in fields based on analyzing values corresponding to geometry information. The geometry information is associated with records of the geographical database. The computer program code may further cause the apparatus to determine a set of tiles at a predetermined zoom level including geographical information of respective records and may update the records to include data associated with minimum and maximum x and y values of the tiles. The computer program code may further cause the apparatus to determine minimum and maximum x and y values that define a rectangular block(s) of map tiles. Corresponding computer program products and methods are also provided. | 06-21-2012 |
20120233195 | Web Service Discovery Via Data Abstraction Model - A method includes querying a discovery registry associated with a data abstraction model of a database to discover one or more web services that are resolvable based on a particular logical field selected via a database query interface. The data abstraction model includes a plurality of logical fields that each correspond to a particular data structure of the database. A web service input of a discovered web service is associated with a first logical field of the data abstraction model via the discovery registry, and a web service output of the discovered web service is associated with a second logical field of the data abstraction model via the discovery registry. A modified database query interface includes a text entry element to receive a text search term and a first selectable input associated with the first discovered web service. | 09-13-2012 |
20120239677 | COLLABORATIVE KNOWLEDGE MANAGEMENT - A computer-implemented method for collaborative knowledge management, the method comprises the steps of: (a) providing an interface for users to create or edit pages of a collaborative knowledge base, to add semantic annotations to the pages, and to define dynamic data on the pages; wherein ontological statements are created for the semantic annotations to form part of an ontology; and the dynamic data is defined using a query against the ontology and a mathematical operation on a result of the query; and (h) when a page with dynamic data is accessed, dynamically performing the query and the mathematical operation, and presenting the page with a result of the query or a result of the mathematical operation, or both, in graphical form. | 09-20-2012 |
20120323946 | DATA FRAMEWORK TO ENABLE RICH PROCESSING OF DATA FROM ANY ARBITRARY DATA SOURCE - Data is accessed and updated in a data store at a field granularity. A user query specifies one or more non-unique fields of a record. The query is sent to a data store to retrieve the fields of the record at a field granularity, in satisfaction of the query. The fields of the record can also be modified by transmitting a record ID along with original content, while omitting some of the record data, and by also including the modification to be made. | 12-20-2012 |
20120330988 | Systems And Methods For Performing Index Joins Using Auto Generative Queries - In accordance with the teachings described herein, systems and methods are provided for performing index joins. A database management application may receive an instruction to perform an index join operation between columns in a first table and a second table, wherein the database management application does not have direct access to an index of the first table or the second table for performing the index join operation. A query may be automatically generated by the database management application, wherein the query includes a where clause equality expression that equates an indexed column of the second table with a parameter or updatable constant. The database management application may substitute a value from a row of the first table may for the parameter or updatable constant, and cause the query to be executed on the index of the second table to fetch any one or more rows of the second table that satisfy the where clause by having an index value that matches the substituted value. The database management application may then repeat the substituting and executing operations for each row of the first table, and perform the index join operation using the fetched one or more rows. | 12-27-2012 |
20130007032 | SYSTEMS AND METHODS FOR DISTRIBUTING MEDIA ASSETS BASED ON IMAGES - Systems and methods are provided for providing a user with efficient and effective intelligent control of media assets distributed to the user's media devices. The user may control distributed media assets by sending captured images to the media delivery system. Features identified in the captured images are used to select media assets that are likely to be of interest to the user. The selected relevant media assets are distributed to one or more media devices for presentation to the user. The distributed media assets may be intelligently selected from the media assets available through the user's primary media delivery system, or may be supplementary media assets not available through the user's primary media delivery system. | 01-03-2013 |
20130073579 | SOURCING TERMS INTO A SEARCH ENGINE - Information may be presented to a user by receiving a selection of one or more terms passively displayed in a document, loading the terms to a search configuration, generating first results responsive to a user's predicted interest as expressed in the search configuration, and enabling display of the first results. | 03-21-2013 |
20130080459 | DATABASE-BASED SEMANTIC QUERY ANSWERING - 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. | 03-28-2013 |
20130086097 | QUERY LANGUAGE BASED ON BUSINESS OBJECT MODEL - Methods and apparatus, including computer program products, are provided for providing a query language based on a model. In one aspect, there is provided a computer-implemented method. The method may include receiving a first query; generating, based on a model including metadata representing a data structure, a second query specific to the data structure stored in a database; and sending the second query to the database. Related apparatus, systems, methods, and articles are also described. | 04-04-2013 |
20130086098 | IDENTIFIER VOCABULARY DATA ACCESS METHOD AND SYSTEM - A method of organizing, managing, and providing interactive access to data in a database is disclosed, along with a program and a system for implementing the method. Associations between each data Item and at least one ItemSelector are established and stored. A predefined (but modifiable) Vocabulary of ItemSelectors sufficient to describe each Item of the database is created. Presently selected Items are described by a combination of associations defined by an appropriate Boolean combination of each ItemSelector in a presently selected set of ItemSelectors. A user controls the presently selected set by adding an ItemSelector from a presented group, or by removing a previously selected ItemSelector. The system ideally makes available to the user all relevant ItemSelectors—those which, if added to the presently selected set, would result in a set that describes at least one extant data Item. The system ideally makes all presently selected Items available to the user. | 04-04-2013 |
20130124552 | LOCATING RELEVANT CONTENT ITEMS ACROSS MULTIPLE DISPARATE CONTENT SOURCES - Technologies are described herein for locating relevant content items across multiple disparate content sources. Query parameters are received from a user interface for defining a query for searching a number of content sources located on multiple, disparate content servers. A native search is executed on each of the content servers based on the received query parameters, and query statistics and other data regarding content items in the content sources matching the query parameters are received. The query statistics are aggregated across the content servers and presented in the user interface. The presentation of the query statistics may be broken out by each content source, by each query phrase segmented from the query, and the like. In addition, a preview of a number of content items matching the query parameters is presented based on the data received. | 05-16-2013 |
20130124553 | FLEXIBLE INTERFACE MODULE - An interface module for a local application provides a user interface to solicit user input for an configuring invocation. The user input solicited by the user interface includes a name of an external query to be executed and an input variable name for the external query. The interface module receives the user input for the configuring invocation; stores the invocation; and receives a trigger, with an input value for the external query, to launch the invocation. In response to receiving the trigger, the interface module executes the invocation to provide, to another interface module for a remote application, a request to execute the external query. The interface module receives, from the other interface module, an output value for the external query and process the output value. | 05-16-2013 |
20130132418 | SYSTEMS, METHODS AND COMPUTER PROGRAM PRODUCTS FOR DISCOVERING A TEXT QUERY FROM EXAMPLE DOCUMENTS - Discovering a keyword query corresponding to an input collection of documents taken from a candidate pool includes selecting a document from a working set as the input set, and extracting a list of snippets in the selected document. For each snippet, executing a set of proximity queries based on selected terms in that snippet, and finding all possible proximity queries that return less than N query results from the candidate pool. A query is selected from said proximity queries, based on the selected query returning the greatest number of working set documents, and returning the smallest number of documents not in the working set. Documents returned by the selected query are removed from the working set, and the above steps are repeated until no documents remain in the working set. The disjunction of selected queries is returned as the discovered query. | 05-23-2013 |
20130144899 | Ambiguous Structured Search Queries on Online Social Networks - In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving an unstructured text query comprising an ambiguous n-gram, identifying nodes and edges that correspond to the ambiguous n-gram, generating a first set of structured queries corresponding to the identified second nodes and edges, receiving from the first user a selection of a first structured query form the first set, and generating a second set of structured queries based on the selected first structured query. | 06-06-2013 |
20130151545 | AUTOMATIC ASSOCIATION OF REFERENCE DATA WITH PRIMARY PROCESS DATA BASED ON TIME AND SHARED IDENTIFIER - A method and system for automatically associating primary process data with reference data. The primary process data may include image, video, audio, text, search data, and the like. The reference data may include location, temperature, pressure, and the like. A primary process data processor device, such as a digital camera, is used to acquire the primary process data with time information, but without any reference data. A reference data collector device, such as a cellular telephone, is used to acquire the reference data with time information. The primary process data and the reference data are uploaded to a server and each are associated with a shared identifier, such as a user ID. Of the content and reference data associated with the shared ID, the server determines which primary process data and reference data were acquired near the same time, and automatically associates the reference data with the primary process data. | 06-13-2013 |
20130166584 | SYSTEMS AND METHODS FOR EXTRACTING BUSINESS PROCESS METRICS FROM A UML MODEL - The invention relates to a system and method for extracting business process metrics from a Unified Modeling Language (UML) model. This invention involves the use of Object Constraint Language (OCL) and custom stereotypes to extract the design metrics from a UML model. The business process parameters to be measured are defined and custom stereotypes for each design element present in the business process parameters are also defined. A UML diagram is generated to represent the steps required to complete the business process. The UML diagrams are based on UML 2.0 or its higher version. The queries are written in OCL and run on the activity or sequence diagram to extract the desired metrics. | 06-27-2013 |
20130185321 | APPARATUS AND METHOD FOR SCHEDULING USER DEFINED OPERATOR (UDO) IN DATA STREAM MANAGEMENT SYSTEM (DSMS) - 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. | 07-18-2013 |
20130198217 | TECHNIQUES FOR TESTING RULE-BASED QUERY TRANSFORMATION AND GENERATION - Techniques for testing rule-based query transformation and generation are described. An apparatus may comprise: a context component operative to receive a search query and determine a query execution context; a rules component operative to receive the determined query execution context and the search query and to determine a set of fired rules; a transformation component operative to receive the set of fired rules, the search query, and the query execution context and determine one or more transformed queries; and a results component operative to determine a search query analysis based on the one or more transformed queries, wherein the search query analysis does not depend on performing a search using the search query. Other embodiments are described and claimed. | 08-01-2013 |
20130232163 | FAULT-TOLERANT SEARCH - 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. | 09-05-2013 |
20130325890 | LEVERAGING PERSISTED DATA QUERIES IN STREAM-BASED COMPLEX EVENT PROCESSING - Persisted data queries are leveraged to generate complex event processing rules for application to a real-time data stream. The method generates a persisted data query based on defined criteria; validates the persisted data query using stored persisted data; and converts the validated persisted data query to a CEP rule. The method may utilize common database querying tools such as XQuery to generate the persisted data query. The persisted data query is executed against historical unprocessed event data stored as persisted data. The results of the persisted data query are analyzed to determine if the persisted data query produces the desired results. The persisted data query is converted to a CEP rule when the desired results are produced. | 12-05-2013 |
20130346434 | METHOD OF SPELL-CHECKING SEARCH QUERIES - A computer-implemented method for determining whether a target text-string is correctly spelled is provided. The target text-string is compared to a corpus to determine a set of contexts which each include an occurrence of the target text-string. Using heuristics, each context of the set is characterized based on occurrences in the corpus of the target text-string and a reference text-string. Contexts are characterized as including a correct spelling of the target text-string, an incorrect spelling of the reference text-string, or including an indeterminate usage of the target text-string. A likelihood that the target text-string is a misspelling of the reference text-string is computed as a function of the quantity of contexts including a correct spelling of the target text-string and the quantity of contexts including an incorrect spelling of a reference text-string. In one application, the target text-string is received in a search query, the search executed following a spell-check. | 12-26-2013 |
20140019471 | METHOD AND SYSTEM FOR MANAGING MULTIPLE SUPPLY CHAINS - The present disclosure discloses a supply chain management system that can estimate manufactured item delivery times at a facility, manufactured item costs or prices, and dynamically control supply chain performance. | 01-16-2014 |
20140032587 | Generating Logical Expressions for Search Queries - 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. | 01-30-2014 |
20140052749 | FINE-GRAINED RELATIONAL DATABASE ACCESS-CONTROL POLICY ENFORCEMENT USING REVERSE QUERIES - A method of providing access control to a relational database accessible from a user interface is implemented at a policy enforcement point, which is located between the database and the user interface and includes the steps of: (i) intercepting a database query from a user; (ii) assigning attribute values on the basis of a target table or target column in the query, a construct type in the query, or the user or environment; (iii) partially evaluating an access-control policy defined in terms of said attributes, by constructing a partial policy decision request containing the attribute values assigned in step ii) and evaluating the AC policy for this, whereby a simplified policy is obtained; (iv) deriving an access condition, for which the simplified policy permit access; and (v) amending the database query by imposing said access condition and transmitting the amended query to the database. | 02-20-2014 |
20140074875 | DEVICE AND METHOD FOR MANAGING STRUCTURED DOCUMENT, AND COMPUTER PROGRAM PRODUCT - According to an embodiment, a structured document management device includes a query data receiving unit; a structural condition dividing unit; a structural condition rewriting unit; and a query execution unit. The query data receiving unit is configured to receive query data for searching a structured document. The structural condition dividing unit is configured to divide the query data into elements including a structural condition. The structural condition rewriting unit is configured to rewrite the structural condition into a rewritten query when a type of the structural condition is other than a descendant structural condition. The rewritten query is predetermined to include a joining process with a descendant structural condition so as not to affect structural conditions appearing before and after the structural condition. The query execution unit is configured to output a search result in response to query data that includes the structural condition and the rewritten query. | 03-13-2014 |
20140074876 | Distribution Cache for Graph Data - In one embodiment, a system includes a database; and a cache layer comprising one or more cache nodes, the one or more cache nodes operative to: maintain in a memory one or more data structures storing association information describing associations between nodes in a graph a plurality of distributed cache clusters for storing information in the form of a graph, the graph comprising a plurality of nodes, each uniquely identified by a node identifier, and edge information indicating associations between nodes; respond to queries for associations between nodes in the graph by accessing the memory; and forward other queries to the database for processing. | 03-13-2014 |
20140095524 | MANAGING ITEM QUERIES - A network-based service may be provided for facilitating queries for a number of items, such as travel services. A user may submit a query including criteria for determining one or more relevant items. Based on the submitted query, the network-based service may present the user with information regarding the actions of other similar users of the network-based service, such as searches performed by the other users. Based on this information, the user may elect to supplement the current query to conform to the actions for other users. In some embodiments, actions by other users may be based at least in part on a category of the querying user. By presenting actions of similar users, a current user may be enabled to select the most relevant query terms for identifying a desired item. | 04-03-2014 |
20140095525 | TACTICAL QUERY TO CONTINUOUS QUERY CONVERSION - Techniques for managing tactical query to continuous query conversion are provided. In some examples, a tactical query configured to enable the pulling of business event data from a database to a query engine may be determined. For example, a query engine may be configured with the tactical query. The configuration may be based at least in part on an indication of the business event data to be displayed. Further, in some examples, a conversion of the tactical query to a continuous query may be enabled. The conversion or enablement of the conversion may be based at least in part on a request. | 04-03-2014 |
20140115000 | BOOLEAN CONTENT SEARCH - 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. | 04-24-2014 |
20140129581 | User Intention Data Searching - A search method for improving a user's search intention is disclosed. The search method includes a user interface for receiving a search request, input terms connected by input operators, and means for a user to visually associate input terms with an order of query operations. | 05-08-2014 |
20140129582 | Modifying Structured Query Language Statements - An approach is provided to modifying structured query language (SQL) statements to more efficient forms. In the approach, an SQL statement is received and compared to a number of predefined malformation rules with at least one of the predefined malformation rules includes a syntactical pattern. If the comparison reveals that the received SQL statement includes a malformed expression that would be inefficiently processed by a database engine, the malformed expression is modified to an efficient SQL expression form and the efficient SQL expression form is executed by the database engine. | 05-08-2014 |
20140172898 | DISTRIBUTED SQL QUERY PROCESSING USING KEY-VALUE STORAGE SYSTEM - Distributed storage systems support SQL while also providing scalability and fault tolerance by utilizing an SQL library (the SQL execution component) layered on top of a transactional key-value system (the storage component). The SQL library comprises a parser and an execution engine running at the client, while the storage component comprises a key-value system for storing the data. The SQL library parses SQL queries received from client applications and maps them to transactions on the key-value system. The key-value system stores data items identified by key and provides concurrency control mechanisms to handle concurrent transactions. The key-value system may be a distributed system with several storage servers, each attached to one or more storage devices. | 06-19-2014 |
20140172899 | PROBABILITY-BASED STATE MODIFICATION FOR QUERY DIALOGUES - A device may facilitate a query dialog involving queries that successively modify a query state. However, fulfilling such queries in the context of possible query domains, query intents, and contextual meanings of query terms may be difficult. Presented herein are techniques for modifying a query state in view of a query by utilizing a set of query state modifications, each representing a modification of the query state possibly intended by the user while formulating the query (e.g., adding, substituting, or removing query terms; changing the query domain or query intent; and navigating within a hierarchy of saved query states). Upon receiving a query, an embodiment may calculate the probability of the query connoting each query state modification (e.g., using a Bayesian classifier), and parsing the query according to a query state modification having a high probability (e.g., mapping respective query terms to query slots within the current query intent). | 06-19-2014 |
20140181134 | PUSH-DOWN OF AUTHORITY CHECK WITHIN QUERY ENGINE - A query engine for integrating authorization conditions within a database query statement. The query engine may include an authorization handler configured to receive authorization parameters related to one or more authorization objects for data relevant to a query for performing an authority check, and obtain at least one user authorization profile for a current user based on the authorization parameters. The at least one user authorization profile may include an activity value and one or more authorization conditions associated with the activity value. The query engine may further include a query generator configured to receive query parameters related to the query and integrate the query parameters with the one or more authorization conditions to obtain a database query statement, and a database selector configured to obtain authorized data from an in-memory database based on the database query statement. | 06-26-2014 |
20140201228 | SYSTEMS AND METHODS FOR MANAGING OFFLINE DATABASE ACCESS - A computer-implemented method for managing access to data stored in a database is provided. The method includes storing in the database a switch parameter having a first value, storing in the database at least two instances of a data object wherein each of the instances includes a unique identifier, receiving a client query from a requestor, determining by the computing device an active instance from the at least two instances based at least in part on comparing the first value of the switch parameter to the unique identifier of each instance, modifying by the computing device the client query at least in part based on the determined active instance to create a resultant query, executing the resultant query against the active instance to generate a resultant data, and providing the resultant data to the requestor. | 07-17-2014 |
20140250141 | Location Based Full Text Search - A method and system for a location based full text search is disclosed. The system generates interwoven bit vectors for documents that are stored in a database. The system may determine a location value based on a portion of a map that a user is viewing. The system may also receive at least one search term inputted by a user. Based on the location value and the search term, the system may generate one or more interwoven bit vectors, which may be used to query an index that identifies responsive documents stored in the database. | 09-04-2014 |
20140280279 | MINIMIZING RESULT SET SIZE WHEN CONVERTING FROM ASYMMETRIC TO SYMMETRIC REQUESTS - 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. | 09-18-2014 |
20140280280 | ESTIMATING ERROR PROPAGATION FOR DATABASE OPTIMIZERS - Techniques are disclosed to determine error propagation for a query optimizer component of a database management system for a database. A database query is received that specifies one or more query conditions. Measures of actual and estimated selectivity of the one or more query conditions are determined. A measure of estimated deviation between the measures of actual and estimated selectivity is determined. A query execution plan is generated or selected based on the measure of estimated deviation. | 09-18-2014 |
20140280281 | Formatting in a Database - A system and method for formatting in a database are disclosed. A request for data in a database is received from an application. The request includes one or more formatting functions to be performed on the data to display a result of the request in a graphical user interface generated by the application. The formatting functions are executed at the database to restructure the request. A query of the data in the database is then generated based on the restructured request, the query including only data to display in the graphical user interface according to the request. Then, a result of the query is returned from the database to the application for display in the graphical user interface. | 09-18-2014 |
20140330855 | Modifying and Searching Metadata Associated with Electronic Medical Images - A method of searching electronic medical images according to one example embodiment includes receiving a search request for one or more electronic medical images. The received search request is modified to conform to a metadata system of an electronic database to be searched. The electronic database is searched for electronic medical images according to the modified search request. If a search result is obtained upon searching the electronic database, metadata of the search result is modified to conform to a metadata system of an entity requesting the search. | 11-06-2014 |
20140330856 | FINE-GRAINED RELATIONAL DATABASE ACCESS-CONTROL POLICY ENFORCEMENT USING REVERSE QUERIES - A method of providing access control to a relational database accessible from a user interface is implemented at a policy enforcement point, which is located between the database and the user interface and includes the steps of: (i) intercepting a database query from a user; (ii) assigning attribute values on the basis of a target table or target column in the query, a construct type in the query, or the user or environment; (iii) partially evaluating an access-control policy defined in terms of said attributes, by constructing a partial policy decision request containing the attribute values assigned in step ii) and evaluating the AC policy for this, whereby a simplified policy is obtained; (iv) deriving an access condition, for which the simplified policy permit access; and (v) amending the database query by imposing said access condition and transmitting the amended query to the database. | 11-06-2014 |
20140337370 | METHOD OF AND SYSTEM FOR REAL TIME FEEDBACK IN AN INCREMENTAL SPEECH INPUT INTERFACE - The present disclosure provides systems and methods for selecting and presenting content items based on user input. The method includes receiving first input intended to identify a desired content item among content items associated with metadata, determining that an input portion has an importance measure exceeding a threshold, and providing feedback identifying the input portion. The method further includes receiving second input, and inferring user intent to alter or supplement the first input with the second input. The method further includes, upon inferring intent to alter the first input, determining an alternative query by modifying the first input based on the second input, and, upon inferring intent to supplement the first input, determining an alternative query by combining the first input and the second input. The method further includes selecting and presenting a subset of content items based on comparing the alternative query and metadata associated with the subset. | 11-13-2014 |
20140365515 | EVALUATION OF SUBSTITUTION CONTEXTS - Methods, systems, and apparatus, including computer programs encoded on computer storage media, for evaluating substitute terms. One of the methods includes receiving a query and identifying an original term occurring in the query. One or more substitution contexts are determined for the original term, wherein a substitution context includes one or more context terms and an indication of a position in the query of the original term and the one or more context terms. A score is determined for each substitution context of the one or more substitution contexts. One or more substitution contexts are selected based on the score of each substitution context. One or more substitute terms for the original term in the context of the one or more selected substitution contexts are determined. | 12-11-2014 |
20140365516 | OPTIMIZATION OF JOIN QUERIES FOR RELATED DATA - Embodiments of the present invention disclose a method, computer program product, and system for optimizing execution of a query that includes a JOIN against a system utilizing data relationship concepts. A computer determines whether one or more data structures in JOIN include a parent/child relationship. The one or more data structures can be one or more tables. Responsive to determining that the one or more data structures in JOIN include a parent/child relationship, the computer determines whether the query that includes the JOIN includes a filter applied on one or more data structures in the JOIN with an OR condition between filters. Responsive to determining that the query that includes the JOIN does not include the filter applied on one or more data structures in JOIN with an OR condition between filters, the computer modifies the query that includes the JOIN into a query utilizing relationship constructs. | 12-11-2014 |
20150012557 | MINIMIZING RESULT SET SIZE WHEN CONVERTING FROM ASYMMETRIC TO SYMMETRIC REQUESTS - 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. | 01-08-2015 |
20150074134 | BOOLEAN TERM CONVERSION FOR NULL-TOLERANT DISJUNCTIVE PREDICATES - 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. | 03-12-2015 |
20150074135 | BOOLEAN TERM CONVERSION FOR NULL-TOLERANT DISJUNCTIVE PREDICATES - 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. | 03-12-2015 |
20150088919 | TRANSFORMING A QUERY TO REUSE STORED DATA - 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. | 03-26-2015 |
20150142843 | FAULT-TOLERANT SEARCH - 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. | 05-21-2015 |
20150324425 | INTERPRETING USER QUERIES BASED ON NEARBY LOCATIONS - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving a query provided from a user device, and determining that the query is implicitly about some entity, and in response: obtaining an approximate location of the user device when the user device provided the query, obtaining a set of entities including one or more entities, each entity in the set of entities being associated with the approximate location, and determining that the query is implicitly about an entity in the set of entities, and in response: providing a revised query based on the query and the entity, the revised query explicitly referencing the entity. | 11-12-2015 |
20150339345 | Editing of Volume of Data - At least one hit in a large volume of data is found using a graphical search pattern. The graphical search pattern is created afresh or modified by a user using a graphical interface. The user may implement complex searches and use a graphical representation of properties and/or correlations for the search in a directed manner. The method may be used, for example, in data mining, in the monitoring of states, or in automated alerting. | 11-26-2015 |
20150347528 | PIXEL-AWARE QUERY REWRITING - A query rewriter associated with a database management system or visualization client rewrites a database query based on properties, characteristics, etc. of the visualization to be rendered by the visualization client. For example, the query rewriter receives an initial query and one or more visualization parameters (such as width, height and/or type of visualization) for the visualization client. The query rewriter rewrites the initial query based on the visualization parameter(s), so as to produce a data-reducing query, and then outputs the data-reducing query for execution. The query rewriter can selectively rewrite the initial query depending on size of query results of the initial query. In some example implementations, the query rewriting models a process of rasterization of geometric primitives by the visualization client, so as to facilitate error-free visualization. In many cases, the query rewriter significantly reduces the volume of query results while facilitating fast interaction with the visualization. | 12-03-2015 |
20160063017 | ACCESS CONTROL FOR UNPROTECTED DATA STORAGE SYSTEM ENDPOINTS - Various embodiments provide access control to unprotected data storage system endpoints. In one embodiment, an authenticated query request is received. The request includes a query associated with an unprotected data storage system endpoint configured to execute queries anonymously. The query is written in a Resource Description Framework (RDF) query language and requests one or more datasets stored in a relational data storage system. A user parameter within the query is identified. The user parameter uniquely identifies a user requesting the query. The query is automatically rewritten to include a set of access control list properties for one or more subject variables in the query. Each of the set of access control list properties configures the query to return data from the one or more datasets for which the user is authorized to access. | 03-03-2016 |
20160098411 | QUERYING INPUT DATA - A hardware accelerator | 04-07-2016 |
20160117363 | DISTRIBUTED SQL QUERY PROCESSING USING KEY-VALUE STORAGE SYSTEM - Distributed storage systems support SQL while also providing scalability and fault tolerance by utilizing an SQL library (the SQL execution component) layered on top of a transactional key-value system (the storage component). The SQL library comprises a parser and an execution engine running at the client, while the storage component comprises a key-value system for storing the data. The SQL library parses SQL queries received from client applications and maps them to transactions on the key-value system. The key-value system stores data items identified by key and provides concurrency control mechanisms to handle concurrent transactions. The key-value system may be a distributed system with several storage servers, each attached to one or more storage devices. | 04-28-2016 |
20160154855 | TACTICAL QUERY TO CONTINUOUS QUERY CONVERSION | 06-02-2016 |
20220138197 | DATA STORAGE APPARATUS, TRANSLATION APPARATUS, AND DATABASE ACCESS METHOD - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for accessing a relational database using requests that conform to a non-structure query language syntax. In one aspect, a method includes receiving, from a client, a first access request that conforms to a NoSQL syntax for accessing a wide column store, wherein the first access request comprises a first event feature and a first attribute feature that are related to the wide column store, and the first attribute feature comprises a column family feature of the wide column store; translating the first access request into a second access request that conforms to a SQL syntax, wherein the second access request comprises a second event feature corresponding to the first event feature and a second attribute feature corresponding to the first attribute feature; and forwarding the second access request to a relational database. | 05-05-2022 |