Entries |
Document | Title | Date |
20100049770 | INTERACTIONS AMONG ONLINE DIGITAL IDENTITIES - A computer-implemented method is provided, which includes constructing first and second user profiles for respective first and second users, by observing respective online behaviors of the first and second users. The first and second user profiles are projected onto an N-dimensional vector space as respective first and second vectors. An interaction between the first and second vectors in the vector space is modeled. Responsively to the modeled interaction, at least one entity is modified, the entity selected from the group consisting of: the first user profile, and the first vector. Content is presented to the first user responsively to the modified entity. Other embodiments are also described. | 02-25-2010 |
20100057811 | CONTEXT-SENSITIVE TERM EXPANSION WITH MULTIPLE LEVELS OF EXPANSION - Articles of manufacture and systems for searching collections of data using context sensitive expanded term searching are provided. The collection of data may be a relational database, text document, or any other type of searchable collection of data. In either case, a query including a search condition based on a specified search term may be modified to include additional conditions based on a set of expanded (e.g., conceptually-related) search terms. For some embodiments, a user may be given the ability to control the level of expansion and the context in which the terms may be expanded. | 03-04-2010 |
20100063975 | SCALABLE SYSTEM AND METHOD FOR PREDICTING HIT MUSIC PREFERENCES FOR AN INDIVIDUAL - A system and method for creating and storing a user's hit-music preference list by receiving the user's biographical information, profiling the user based on the biographical information to determine music data that may be of interest to the user, receiving a rating from the user for a plurality of genres, wherein the music data is a member of one or more of the plurality of genres, and retrieving music data based on the user's rating for the plurality of genres. The system has a memory for storing the user's biographical information, a processor configured to profile the user based on the biographical information and to retrieve music data that may be of interest to the user, and a display unit for displaying the music data retrieved. | 03-11-2010 |
20100088333 | COMPUTER-READABLE MEDIA, COMMUNICATION APPARATUS, AND COMMUNICATION SYSTEM - A computer-readable medium stores computer-readable instructions that control a communication on a communication apparatus that obtains a content summary information having at least content location information from a server. The instructions cause the communication apparatus to perform steps. The steps include receiving a delivery source information inputted through a user operation, determining whether the delivery source information includes a predetermined character string. Content summary information corresponding to the inputted delivery source information is obtained when the determining step determines that the predetermined character string is not included in the delivery source information. Content summary information corresponding to a predetermined alternative delivery source information is obtained when the determining step determines that the predetermined character string is included in the delivery source information. | 04-08-2010 |
20100094895 | Method and Apparatus for Providing a Media Object - In accordance with an example embodiment of the invention, an apparatus comprising a processor configured to receive information related to a media object, and automatically select at least one supplemental media object based at least in part on a competency of a user related to the media object is disclosed. | 04-15-2010 |
20100114933 | METHODS FOR IMPROVING THE DIVERSITY OF IMAGE SEARCH RESULTS - Techniques are described to increase the diversity or focus of image search results. A user submits an original query to search for images. A server generates a first results set by executing the original query using metadata associated with each image. The server selects, from the first results set, a specified number of results ranked highest and generates a list of terms from the metadata of each of the results selected. The terms may be only the tags of the results. The server generates an updated query using terms in the list that may be weighted based on the frequency of the term in the list or include only a specified number of the highest occurring terms in the list. The server generates a second results set by executing the updated query using metadata associated with each image. The second results set is then stored and displayed to the user. | 05-06-2010 |
20100125597 | SYSTEM AND METHOD FOR DETERMINING SEARCH TERMS FOR USE IN SPONSORED SEARCHES - Systems and methods for determining search terms for sponsored Internet searches are disclosed. A digital Internet ad is served to a plurality of Internet users. Search terms used by the plurality of Internet users served the digital Internet ad may be determined. A number of times each of the plurality of Internet users served the digital Internet ad selects the digital Internet ad is determined. A search term recommendation module determines a correlation level between each search term and the digital Internet ad. At least one of the search terms is recommended for a sponsored Internet search based on the determined correlation levels. | 05-20-2010 |
20100131541 | SIMULTANEOUS SEARCHING USING MULTIPLE SEARCH ENGINES VIA CLIENT APPLICATION - A method for facilitating the simultaneous initiation of a search on a plurality of search engines available over a network can be provided. The method can include receiving from a server a first program logic configured for providing an interface and executing the first program logic. The method can further include reading from the interface a search parameter for conducting a search on a plurality of search engines and generating a data construct including a second program logic. The method can further include executing the second program logic, sending a separate request to each of the plurality of search engines to conduct a search and sending the search parameter to an ad server. The method can further include receiving search results from the search engines and at least one ad from the ad server. The method can further include displaying the search results and the at least one ad. | 05-27-2010 |
20100131542 | SUGGESTED WEBSITES - An apparatus and a method for suggesting a web site is described. In one embodiment, a user at a client enters a web address. A suggestion server receives the web address and generates one or more suggested web addresses for the user based on an analysis of captured aggregate online users behavior in relation to the web address. The suggestion server stores and organizes results of the analysis of the captured aggregate online users behavior. The results includes a list of two or more substantially related and relevant web addresses. The suggestion server compares the web address with the results of the analysis to generate the one or more suggested web addresses. The one or more suggested web addresses are sent to the client. | 05-27-2010 |
20100131543 | IMPLEMENTATION OF STREAM ALGEBRA OVER CLASS INSTANCES - Creating and executing a distributed stream processing operator graph based on a query. The operator graph includes movable stream algebra operators for processing events received from high volume data streams. The operators are partially compiled and distributed to computing devices for completion of the compilation and subsequent execution. During execution, the operators maintain minimal state information associated with received events via an expiration time assigned to each of the event instances. Additional events are generated and aggregated by the operators for communication to a service responsible for the query. | 05-27-2010 |
20100138440 | Extend Crud To Support Lifecyle Management And Business Continuity - The subject matter disclosed herein provides methods and apparatus, including computer program products, for providing software updates. In one aspect there is provided a method. The method may include receiving a command for execution at a database. Moreover, a determination may be made as to whether the received command is one of a set of extended commands. The set of extended commands includes lock read, lock write, migrate, copy, and log changes. The received command is executed at the database. Related systems, apparatus, methods, and/or articles are also described | 06-03-2010 |
20100145975 | Expansion of Search Queries Using Information Categorization - A computerized system and method of constructing and expanding search queries for conducting searches through information sources. The system enables retrieving a category options tree, allowing a user to define a category route by selecting a category-node, which defines a search-category. The system may further enable retrieving a query scenario tree, having a hierarchal structure comprising query nodes, where the retrieved query scenario tree is associated with an initial input query, inputted by a user. Each query node defines a query route enabling to construct the content and structure of an expanded search query. The system enables selecting a query node of the retrieved query scenario tree, according to an online decision making process, which analyses the search-category in relation to available query routes in to allow selecting a query node from the retrieved scenario tree that is most compatible with the search-category. | 06-10-2010 |
20100145976 | SYSTEM AND METHOD FOR CONTEXT BASED QUERY AUGMENTATION - A system and method for context based query augmentation. A question is received over a network from a questioning user comprising an identification of a user and at least one question criteria. A first query is formulated so as to search, via the network, for user profile data, social network data, spatial data, temporal data and topical data so as to identify user context data relevant to question criteria. The question is modified using the user context data to create at least one modified question having at least one additional criteria based on the user context data. A second query is formulated so as to search, via the network, for knowledge data, user profile data, social network data, spatial data, temporal data and topical data so as to identify knowledge data relevant to the identified user and the modified question criteria. The knowledge data is transmitted, over the network, to the questioning user. | 06-10-2010 |
20100153425 | Method for Counting Syllables in Readability Software - A software-implemented method is disclosed that can provide an accurate count of the number of syllables in each word of a body of text to be analyzed by readability software. If the software finds the word in a database, the syllable count is obtained from the database. If the software does not find the word in the database, the software asks a user to specify the number of syllables in the word. In preferred embodiments, the user can direct the software to add the target word and the associated syllable count to the database for future reference. As the software is used, the dictionary thereby grows and adapts to a specific user environment without need for a programmer to customize the software. | 06-17-2010 |
20100153426 | SEMANTIC SERVICE DISCOVERY APPARATUS AND METHOD - A semantic service discovery technology is provided. A semantic service discovery method includes: receiving a query for a service discovery from a user equipment (UE); analyzing the received query; conducting an ontology-based analysis of semantic information of the analyzed query; and generating a query for the service discovery by putting the analyzed semantic information together, converting the generated query into an ontology query, and discovering services using the ontology query. Therefore, a service desired by a user can be discovered through a semantic approach. | 06-17-2010 |
20100161643 | SEGMENTATION OF INTERLEAVED QUERY MISSIONS INTO QUERY CHAINS - The subject matter disclosed herein relates to segmentation of interleaved query missions into a plurality of query chains. | 06-24-2010 |
20100169354 | Indexing Mechanism for Efficient Node-Aware Full-Text Search Over XML - Techniques are provided for searching within a collection of XML documents. A relational table in an XML index stores an entry for each node of a set of nodes in the collection. Each entry of the relational table stores an order key and a path identifier along with the atomized value of the node. An index on the atomized value provides a mechanism to perform a node-aware full-text search. Instead of storing the atomized value in the table, a virtual column may be created to represent, for each node, the atomized value of the node. Alternately, each entry of the relational table stores an order key and a path identifier along with, for simple nodes, the atomized value, and for complex nodes, a null value. For a complex node with a descendant text node, a separate entry is stored for the descendant text node in the relational table. | 07-01-2010 |
20100185646 | METHOD AND APPARATUS FOR SEARCHING MEDIA PROGRAM DATABASES - A method, apparatus, article of manufacture for providing list of a plurality of media programs responsive to a user search query is disclosed. In one embodiment, the method comprises the steps of accepting an general search query from a user computer, identifying a synonym for the general search query, identifying a category for the general search query according to the identified synonym, performing a categorical search of a media program database using the identified synonym and the identified category to obtain a search result, and transmitting the search result to the user computer for presentation on a display communicatively coupled to the user computer. | 07-22-2010 |
20100198856 | METHOD TO ASSIST USER IN CREATION OF HIGHLY INTER-RELATED MODELS IN COMPLEX DATABASES - A computer-implemented method is provided to facilitate creation of linked inter-related models in a database. The method comprises obtaining a search text and match criteria from a user, and determining whether a prequery exists. If not, a list of all destination items is obtained. If yes, a determination is made whether the prequery is enabled. If not, a list of all destination items is obtained. If enabled, a list of all destination items limited by the prequery is obtained. A determination is then made whether all match criteria is selected. If yes, all items in the destination list are returned to the user. If not, a word list is generated by parsing all words from the search text. All valid synonyms are added for each word in the word list. The items in the destination list are reduced to items that match at least one word in the word list. A determination is made whether one or more additional filters exist. If not, a reduced list filtered by the match criteria is returned to the user. If the additional filters exist, the filters are presented to the user. The matched item list is then reduced based on criteria of the filters. The reduced matched item list is then returned to the user. | 08-05-2010 |
20100205199 | INTENT DRIVEN SEARCH RESULT RICH ABSTRACTS - Techniques for providing useful information to a user in response to a search query are provided. Based on the search query, one or more potential intents of the user are identified and a plurality of matching resources are identified. For at least one matching resource, a particular abstract template is selected based on the one or more potential intents. Each abstract (a) corresponds to a different intent than any other intent to which any other abstract template of the plurality of abstract templates corresponds, and (b) dictates a different manner of displaying information about a matching resource than any other manner of displaying dictated by any other abstract template of the plurality of abstract templates. A search results page is generated and sent to the user. The search results page includes an abstract for the at least one matching resource. The abstract is displayed based on the particular abstract template. | 08-12-2010 |
20100205200 | METHOD AND SYSTEM FOR INSTANTLY EXPANDING A KEYTERM AND COMPUTER READABLE AND WRITABLE RECORDING MEDIUM FOR STORING PROGRAM FOR INSTANTLY EXPANDING KEYTERM - A method for instantly expanding a keyterm is provided. According to the query term, a data search process is performed by several search engines. Several document snippets related to the query term are obtained from the search engines. A related term table containing several keyterms corresponding to each snippet is built up by analyzing each of the document snippet. According to a position relationship between the each keyterm and the query term in each snippet, a correlation calculation is performed for giving each keyterm a correlation value. A semantic merging process is performed to merge the correlation values of the keyterms with the same semantic meaning to be a correlation indicator. Some of the keyterms are determined to form a keyterm set of the query term. | 08-12-2010 |
20100235375 | TEMPORAL SEARCH QUERY PERSONALIZATION - A user is made able to configure a search query to be responsive to temporal factors in order to adjust the search query to more accurately reflect the user's true information need. By adjusting the search query in this way, the user is more likely to receive satisfactory search results. | 09-16-2010 |
20100241647 | Context-Aware Query Recommendations - Described is a search-related technology in which context information regarding a user's prior search actions is used in making query recommendations for a current user action, such as a query or click. To determine whether each set or subset of context information is relevant to the user action, data obtained from a query log is evaluated. More particularly, a query transition (query-query) graph and a query click (query-URL) graph are extracted from the query log; vectors are computed for the current action and each context/sub-context and evaluated against vectors in the graphs to determine current action-to-context similarity. Also described is using similar context to provide the query recommendations, using parameters to control the similarity strictness, and/or whether more recent context information is more relevant than less recent context information, and using context information to distinguish between user sessions. | 09-23-2010 |
20100241648 | IMAGE PROCESSING APPARATUS - An image processing apparatus which executes a predetermined image processing using a data file stored in a data storage device. The image processing apparatus includes: an external interface unit that detachably connects with the data storage device; an input unit that accepts a setting input for a setup item relating to the predetermined image processing; a setting input detection unit that detects the setting input inputted through the input unit; a search condition generating unit that generates a search condition based on a setting value that is set for the setup item relating to the predetermined image processing, when the setting input detection unit has detected the setting input; an execution instructing unit that instructs a search unit to execute a data file search when the setting input detection unit has detected the setting input; the search unit that, in accordance with the instructions from the execution instructing unit, executes a data file search for a data file stored in the data storage device to output a search result based on the search condition that is generated by the search condition generating unit; and a display unit that displays the search result of the data file search. | 09-23-2010 |
20100250578 | SYSTEM AND METHOD FOR CONDUCTING A PROFILE BASED SEARCH - The present invention provides a method and system for conducting a profile based search. The method and system includes receiving a search request including one or more search terms from a user, parsing the search request into categorical verticals, determining search refinement data relative to the categorical verticals, the search refinement data including at least one of: profile information, environmental data relative to the search request and historical behavior data relating to the search request or the user and accessing a database of aggregated search data based on the search refinement data. The method and system includes using the aggregated search data, determining a most relevant search query and a most relevant user profile, refining the search request based on the most relevant search query and most relevant user profile and generating an output display of a search result set based on the refined search request. | 09-30-2010 |
20100268725 | ACQUISITION OF SEMANTIC CLASS LEXICONS FOR QUERY TAGGING - A user's search experience may be enhanced by providing additional content based upon an understanding of the user's intent. Query tagging, the assigning of semantic labels to terms within a query, is one technique that may be utilized to determine the context of a user's search query. Accordingly, as provided herein, a query tagging model may be updated using one or more stratified lexicons. A list data structure (e.g., lists of phrases obtained from web pages) and seed distribution data (e.g., pre-labeled probability data) may be used by a graph learning technique to obtain an expanded set of phrases and their respective probabilities of corresponding with particular lexicons (e.g., semantic class lexicons). The expanded set of phrases may be used to group phrases into stratified lexicons. The stratified lexicons may be used as features for updating and/or executing the query tagging model. | 10-21-2010 |
20100268726 | COMPUTERIZED SYSTEM AND METHOD FOR ADVANCED ADVERTISING - The invention provides an improved algorithm for selecting paid advertisements for inclusion with search engine results or with any resource retrieved from the Internet. The algorithm collects personalized data of each user and feeds the collected personalized data into search queries of search engines, to retrieve paid advertisements. The advertisements are retrieved based not only on search keywords input by the user, but also based on personal preferences, interests and demographics of the user, as well as the location of the user and the time when the search is performed. In other words, the inventive technology enables each user to receive very targeted, localized and personalized advertising materials. | 10-21-2010 |
20100281044 | METHOD AND SYSTEM FOR CREATING A PROFILED SOCIAL NETWORK - Presented is a computer implemented method and system for creating a profiled social network. The method includes mapping at least one identity to each node in the plurality of nodes, defining a profile for each node in the plurality of nodes, identifying a relationship between the at least two nodes in the plurality of nodes, defining a profile for the relationship between the at least two nodes in the plurality of nodes, and forming a collection of profiles defined for all relationships between the plurality of nodes. | 11-04-2010 |
20100287176 | PROVIDING ANALYTICAL VIEW OF EMAIL INFORMATION - Described are methods and systems related to providing an analytical view of information present in one or more emails. Metadata of all the emails present in a mailbox is configured. The metadata includes an attribute of a corresponding email. Based upon the attributes of the emails, a relationship map is created. The relationship map is a multidimensional structure having multiple axes, with each axis describing an attribute of the emails. A query is received to query the mailbox. The query received is parsed to identify attributes of one or more relevant emails that are associated with the received query. A value is computed for each attribute of the relevant emails. Based upon the values computed for each attribute present in the relationship map, a resulting report having analytical view of information present in the relevant emails is rendered. | 11-11-2010 |
20100287177 | Method, System, and Apparatus for Searching an Electronic Document Collection - A method, system, and article are provided for efficiently and effectively searching an electronic document collection. Each of the documents in the collection is pre-divided into sub-sections. One or more profiles are created, with each profile including a selection of one or more of the sections of the documents in the collection. In addition, a weight is assigned to each of the selected sections in the profile. Based upon the parameters of a query and selection of a profile, select sub-sections of each document are employed in a comparison of query data to the underlying document collection. A compilation of documents is created based upon all documents with data matching the query data within the sections of the document as identified in the submitted profile. | 11-11-2010 |
20100287178 | REFINING LOCATION ESTIMATES AND REVERSE GEOCODING BASED ON A USER PROFILE - The present invention pertains to enhancement or refinement of estimated locations based upon user-specific information. Upon user authorization, geographical information is extracted from a number of user-related sources, including the web browser history, search history, maps history, address book, e-mail archives and calendar entries. Such information is used to build a spatial index of specific physical locations for a geocoded result set. From this, heat maps identifying particular locations from the user-related sources are created for different periods of time. The heat maps may be used to refine an initial location estimate of the user. This may be done by determining whether one or more positions in a given heat map provide a more accurate position of the user than the initial estimate. If so, a best position is selected. This can be used to provide enhanced driving directions to the user. | 11-11-2010 |
20100306228 | DYNAMIC MENUS FOR MULTI-PREFIX INTERACTIVE MOBILE SEARCHES USING PREDICTIVE TEXT TO YIELD TARGETED ADVERTISEMENTS - The present invention includes systems and methods for retrieving information via a flexible and consistent targeted search model that employs interactive multi-prefix, multi-tier and dynamic menu information retrieval techniques (including predictive text techniques to facilitate the generation of targeted ads) that provide context-specific functionality tailored to particular information channels, as well as to records within or across such channels, and other known state information. Users are presented with a consistent search interface among multiple tiers across and within a large domain of information sources, and need not learn different or special search syntax. A thin-client server-controlled architecture enables users of resource-constrained mobile communications devices to locate targeted information more quickly by entering fewer keystrokes and performing fewer query iterations and web page refreshes, which in turn reduces required network bandwidth. | 12-02-2010 |
20100318550 | IMAGE SEARCHING SYSTEM, IMAGE SEARCHING APPARATUS, AND MEDIUM STORING IMAGE SEARCHING PROGRAM - An image searching system is characterized by including a display unit capable of displaying a plurality of images arranged two-dimensionally, a range determining unit performing a determination of a search target range from an arrangement area of the plurality of images displayed on the display unit using a selected range set in advance, an image refining unit refining search target images by performing the determination of the search target range by the range determining unit a plurality of times until the selected range becomes a minimum selected range while gradually reducing the selected range, an image selecting unit selecting any of images included in the selected range when the selected range becomes the minimum selected range by performing the refining of the search target images by the image refining unit, and a display control unit causing the display unit to display, while maintaining a state of arrangement, images included in the search target range being determined each time the search target range is determined by the range determining unit when refining the search target images by the image refining unit, and causing the display unit to display a selected image when any of the images included in the selected range is selected by the image selecting unit. | 12-16-2010 |
20100318551 | METHOD AND SYSTEM FOR SEARCH STRING ENTRY AND REFINEMENT ON A MOBILE DEVICE - A hardware and/or software facility facilitates search string entry and refinement on a mobile device. A user enters a search string on a mobile device via one or more input methods. The facility searches the user's device and/or one or more remote data areas and returns search results that match the entered search string. Search results include, for example, information, links, files, and other results that correspond to the search string. Before and/or after the search is performed, the facility applies one or more filters that produce refined search results. Filters may relate to location, category, synonyms, data type, social-network, and other groupings—including user-defined groupings—that may refine the search results. Filters may be applied automatically and/or in response to user selection of a filter. | 12-16-2010 |
20110040774 | Searching Spoken Media According to Phonemes Derived From Expanded Concepts Expressed As Text - According to one embodiment, searching media includes receiving a search query comprising search terms. At least one search term is expanded to yield a set of conceptually equivalent terms. The set of conceptually equivalent terms is converted to a set of search phonemes. Files that record phonemes are searched according to the set of search phonemes. A file that includes a phoneme that matches at least one search phoneme is selected and output to a client. | 02-17-2011 |
20110066629 | TECHNIQUE FOR PROVIDING SUPPLEMENTAL INTERNET SEARCH CRITERIA - Disclosed is a system for, and method of, supplementing an interne search. The disclosed techniques may be used to receive an initial internet search criteria entered by a user at an interface (such as a web site) to the internet search engine, identify an entity representation in a database that corresponds to the internet search criteria, and produce an enhanced internet search criteria that may incorporate both the initial internet search criteria and field values from the identified entity representation. The enhanced internet search criteria may be passed to the internet search engine in a manner that is transparent to a user. | 03-17-2011 |
20110078167 | SYSTEM AND METHOD FOR TOPIC EXTRACTION AND OPINION MINING - Methods, apparatus, and systems to determine a niche market of items or services, the first phase of which identifies a gap between demand and supply for a set of items. Session logs may be evaluated to compare transactions involving a specific item to those of a larger group of items. The resultant information identifies areas of high demand, but with low availability. The niche market information may be provided as direct merchandising items for sellers. In one example, the method generates niche market item web pages in specific categories. Additional methods, apparatus, and systems are disclosed. | 03-31-2011 |
20110078168 | Compiling Co-associating Bioattributes Using Expanded Bioattribute Profiles - A bioinformatics method, software, database and system for compiling attribute combinations that co-associate with a query attribute (i.e., an attribute of interest) are presented in which expanded attribute profiles associated with a group of query-attribute-positive individuals and expanded attribute profiles associated with a group of query-attribute-negative individuals are accessed, and combinations of attributes having a higher frequency of occurrence in the set of expanded attribute profiles associated with the group of query-attribute-positive individuals are identified and stored to generate a compilation of attribute combinations that co-associate with the query attribute. | 03-31-2011 |
20110082873 | Mutual Search and Alert Between Structured and Unstructured Data Stores - An approach is provided that search unstructured data sources with a search engine using initial search terms. Search hits received from the search engine are gathered and possible search terms are retrieved from the search hits. Entities are extracted from the search hits where the entities correspond to the extracted terms. The extracted entities and terms that are extracted are used to query structured data sources, such as tables in a relational database. Query results are then received from the queries performed on the structured data sources. These query results are used to further search the unstructured data sources to again receive search hits from which terms and entities are extracted. Search hits and the extracted entities are stored in a results data store for analysis. | 04-07-2011 |
20110087685 | LOCATION-BASED SERVICE MIDDLEWARE - A middleware system is provided that is situated between the user applications and the various content databases that are to be searched in order to simplify the creation of user applications for mobile devices that use location-based services that employ ontology-based search systems. The middleware system exposes one or more services to the user application. For example, a service exposes a service that allows the user to annotate and/or tag known semantic locations. As another example, a service provides a list of suggested semantic POIs to user applications in response to user queries. The suggested semantic POIs are selected based on a user's location and possibly context-dependent information. The suggested semantic POIs also may be based on user-dependent information obtained from a user-profile or the like and the suggested semantic locations that are provided to the user applications may be ranked and presented in an order beginning with those semantic locations that may be of greatest interest. | 04-14-2011 |
20110093487 | DATA PROVIDER WITH TRANSIENT UNIVERSE - A computer-implemented system to receive an instruction to initialize a data provider associated with an analysis cube and a dataset, and, in response to the instruction, acquire first metadata associated with the analysis cube and generate, based on the first metadata, second metadata of an abstraction layer comprising a plurality of objects. A query comprising a first plurality of objects of the abstraction layer is received, the query is transformed to a query state based on the second metadata of the abstraction layer, and a result set is acquired from the dataset using the query state and the analysis cube. | 04-21-2011 |
20110106828 | POPULATION OF SETS USING ADVANCED QUERIES - A method and a system are described for generation of sets of alternative terms based on queries received from users. For example, a query module may receive a query comprising syntax indicating alternative terms and may parse the alternative terms from the query. A frequency module forms groups of alternative terms from the parsed alternative terms and determines a first number of occurrences corresponding to each of the groups based on the received query and previous queries. For a first pair of the groups comprising a first alternative term and a second alternative term, a threshold module adds the first alternative term to an existing set of terms that already includes the second alternative term. The addition is based on a second number of occurrences of the first alternative and at least one other member of the existing set of terms. | 05-05-2011 |
20110106829 | PERSONALIZATION ENGINE FOR BUILDING A USER PROFILE - User profiles are created based on taxonomic nouns related to documents accessed by the user. The profiles can be leveraged to create lists, such as mailing lists and lead lists, to target content, such as offers, to persons most likely to be interested in the content. A database of the profiles is queried based on nouns describing content to be promoted. The profiles that satisfy the query are used to generate a list. The invention can be used to create any type of list, such as mailing lists, lead lists, lists of related content, lists of related users, lists of categorized content, and the like. | 05-05-2011 |
20110106830 | GENERATING SEARCH RESULTS BASED ON DETERMINED RELATIONSHIPS BETWEEN DATA OBJECTS AND USER CONNECTIONS TO IDENTIFIED DESTINATIONS - A search system generates an ordered list of destination targets including identified individuals and data objects, based on applying a user context to an information context and to a connection context. The user context identifies a search context (i.e., the information the user is seeking) relative to an identity of the user, and the information context identifies destinations accessible by the user, including data objects and communications-based actions (e.g., voice over IP telephony calls, instant messaging session transcripts, etc.). The connection context identifies relationships between chosen destinations throughout the system, and the strength of those relationships determined from artifacts of the chosen destinations: the connection context is updated based on artifact detection. The portion of the connection context that is relevant to the user context is used to order the portion of the information context that is relevant to the user context, resulting in the ordered list of destination targets. | 05-05-2011 |
20110131229 | QUERY GENERATING APPARATUS,QUERY GENERATING METHOD AND DATABASE SEARCH SYSTEM - According to one embodiment, a query generating apparatus includes a query storing unit, a detecting unit, and a query generating unit. The query storing unit stores, in association with query identification information for identifying a database query, a query character string in which a portion of a parameter as a data retrieval condition for the database query specified by the query identification information is described as an arbitrary variable identifier. When the query identification information specifying the database query and a parameter necessary for retrieval of data are received from a client, the detecting unit detects the query character string associated with the received query identification information from the query storing unit. The query generating unit replaces the variable identifier described in the query character string detected from the query storing unit with the parameter received from the client and generates a database query. | 06-02-2011 |
20110145268 | SYSTEMS AND METHODS TO GENERATE AND UTILIZE A SYNONYM DICTIONARY - Systems and methods to identify synonyms are described. The system generates demand information based on a first plurality of queries. Further, the system identifies a second plurality of queries as a first cluster of queries from the first plurality of queries based on the demand information, and identifies a first synonym set based on an association map that comprises a first plurality of constraints identified from the second plurality of queries. Finally, the system stores the first synonym set in a synonym dictionary. | 06-16-2011 |
20110161340 | LONG-TERM QUERY REFINEMENT SYSTEM - A system for providing long term query refinement. Low level information may be stored based on user feedback. There may be equivalence classes in an archive or memory which contain items from a query search which are labeled positive or negative by a user. Labels may be stored in class pairs over previously run queries. There may be propagation of labels to other items in the same or other classes. There may be a refinement which aids in changing the query to one that indicates more accurately what the user wants. A result set of items may be formulated from which a user may select a new query. | 06-30-2011 |
20110173216 | DYNAMIC AGGREGATION AND DISPLAY OF CONTEXTUALLY RELEVANT CONTENT - A web-based system scans content for specific terms, and transforms occurrences of the terms into hypertext links. Each hypertext link provides access to a dynamically generated web page which contains aggregated content related to the respective term. The aggregated content may be gathered through a distributed keyword search of various content sources, including web sites and other sources on a wide area network. The results of the keyword search are aggregated into a single page or document, preferably with filtering to remove page elements not well suited for display on a mobile device. Occurrences of specific terms on this dynamically generated page may similarly be transformed into links, such that the user can browse content from various sources within a confined environment. | 07-14-2011 |
20110191362 | COMPOSING VIEWS WITH AUTOMATIC CREATION OF LINKS - The present invention extends to methods, systems, and computer program products for composing views with automatic creation of links. Generally, views receive data through a query. Views also can have bindings to variables, for example, to represent what is selected in the view. Analyzing these queries can be used to determine whether a composition is valid, and how to compute a new query for a composed second view. In a composite view, a selection variable is utilized, and is bound to the selection parameter of the new first view. The data query for the second new view is re-written to refer to the selection variable in the composite. | 08-04-2011 |
20110208767 | SEMANTIC DOMAIN NAME SPINNING - Systems and methods of the present invention provide for the spinning and appraisal of a domain name. A list of keywords may be extracted from a domain name entered into a user interface on a client. These keywords may be compared to potential matches in a database and a result set may be compiled and displayed to the user. The client may also display a certified domain name appraisal using a plurality of logical groupings within a domain name appraisal process. This appraisal process may also include a multiplier derived from comparisons of registration statistics for various top level domains. | 08-25-2011 |
20110238684 | Method and Apparatus for Enhancing Electronic Reading by Identifying Relationships Between Sections of Electronic Text - An apparatus, method and article of manufacture of the present invention detects the presence of references to the same concept in separate sections of text, and, with no input required from the reader, presents the reader with information concerning the detected references to the concept. The information provided may comprise information related to the location of the reference to the concept in other sections of text, and the reader also is provided the ability to move from one reference to a concept directly to another reference to the same concept. | 09-29-2011 |
20110258213 | METHOD AND SYSTEM FOR PERSONAL INFORMATION EXTRACTION AND MODELING WITH FULLY GENERALIZED EXTRACTION CONTEXTS - Systems and methods for modeling information from a set of documents are disclosed. A tool allows a user to model concepts of interest and extract information from a set of documents in an editable format. The extracted information includes a list of instances of a document from the set of documents that contains the selected concept. The user may modify the extracted information to create subsets of information, add new concepts to the model, and share the model with others. | 10-20-2011 |
20110264679 | PEER TO PEER (P2P) MISSING FIELDS AND FIELD VALUATION FEEDBACK - Methods, systems, and apparatus for processing data, and more specifically to retrieving results for a query from one or more devices coupled to a network. A first device may receive an abstract query including logical fields defined by a first data abstraction model and retrieve query results stored in the first device. The query may be sent to one or more other devices via the network. The one or more other devices may be configured to convert the abstract query to local abstract queries including logical fields defined in local data abstraction models. The local queries may be issued against local databases to retrieve additional results for the query. The local queries may not include all the fields of the abstract query. | 10-27-2011 |
20110282891 | Methods And Apparatuses For Providing A Search Crowd Capability - Exemplary methods and apparatuses are provided which may be implemented using one or more computing devices within a networked computing environment to identify certain shared search interests and to provide additional search capabilities based thereon to a plurality of users in a social search manner. For example, a “search crowd” capability and information may be provided based on a plurality of related search queries received from two or more users. A number of determining factors may be considered to identify, establish, maintain, and/or otherwise manage a search crowd and related information. | 11-17-2011 |
20110295870 | SYSTEMS AND METHODS FOR PROVIDING CUSTOM OR CALCULATED DATA MEMBERS IN QUERIES OF A BUSINESS INTELLIGENCE SERVER - A business intelligence (BI) server and repository are described which support a set of customized and/or calculated data members. In accordance with an embodiment, the BI server maintains a connection to a plurality of data sources which may store a set of dimension members. The data source can be relational, file storage based, multidimensional and other types. In accordance with an embodiment, the BI server can accept queries from the user that contain calculated members as a parameter. The calculated member is defined by an expression including multiple dimension members and one or more arithmetic operators. The BI server can parse and validate the query and rewrite the query for the data source. After the query is rewritten and optimized, it is executed against the data source and a set of results is received. | 12-01-2011 |
20110302186 | Method and Apparatus for Query Reformulation with Latency Preservation - A data scheme and protocol (DSP) adapter which translates communications received from one or more application servers (FEs) into corresponding communications understandable by one or more repositories (BEs). The DSP adapter comprises an interface unit which receives a FE query from a FE. The DSP adapter comprises a processing unit which determines an FE query pattern fulfilled by the FE query and checks whether the FE query pattern exists for the FE query in an accessible memory. Where the FE query pattern does not exist in the accessible memory, the processing unit transforms the FE query pattern into a corresponding BE query pattern. Where the FE query pattern exists in the accessible memory, the processing unit obtains the corresponding BE query pattern from the accessible memory. A method for translating at a data scheme and protocol (DSP) adapter communications received from one or more application servers (FEs) into corresponding communications understandable by one or more repositories (BEs). | 12-08-2011 |
20120047159 | SPECULATIVE QUERY EXPANSION FOR RELEVANCE FEEDBACK - Speculative query expansion is a way to increase the effectiveness of relevance feedback. Instead of picking the best expansion query beforehand, multiple queries are executed and the best expansion query is selected afterward, but with no additional effort (or information) required from the user. From the best expansion query, search results and expanded queries more pertinent to the user can therefore be provided. | 02-23-2012 |
20120066244 | NAME RETRIEVAL METHOD AND NAME RETRIEVAL APPARATUS - Name retrieval methods and name retrieval apparatuses that detect retrieval-target names that are representable as character strings including a ligature taking arbitrary property of a ligature into consideration in both a case where the ligature is input, and a case where the series of characters corresponding to the ligature is input, are provided so that convenience and reliability of name retrieval are improved. When a specific ligature is input, the specific ligature is converted into the series of characters corresponding to the specific ligature in accordance with the corresponding relationship TB stored in a storage device M, and specific retrieval-target names that include the series of characters obtained by the conversion in an input position of the specific ligature and an arrangement position of the series of characters corresponding to the number of coupled characters are retrieved from a database DB by character-string matching. | 03-15-2012 |
20120072439 | QUERY AND RESULT REBINDING - The metadata-based intermediation between two data sources. A computing system accesses a query message (e.g., a query or a query response). The query message is structured to be compatible with the first data source. The computing system uses metadata either directly, or indirectly through the execution of code referenced by the metadata to convert the query message into a semantically equivalent query message that is compatible with the second data source. If the query message were a query, then a query response may be acquired and the metadata may perhaps be used again to convert the query response into a form that is compatible with the first data source. In one embodiment, the conversion using the metadata is performed with the assistance of a framework, making changes to the conversion process as simple as perhaps just editing the metadata itself. | 03-22-2012 |
20120078934 | METHOD FOR AUTOMATICALLY INDEXING DOCUMENTS - A method for retrieving based on a search term together with its corresponding meaning from a set of base documents those documents which contain the search term and in which the certain search term has the certain meaning to enable the building of an index on the retrieved documents. The method includes searching for those base documents among the set of base documents which contain the certain search term and evaluating the found base documents as to whether the search term contained in the found base documents, respectively, has a certain meaning. Evaluation includes generating a text document to represent elements surrounding the search term and their corresponding absolute or relative position with respect to the search term; inputting the text document into a trainable classifying apparatus; classifying the inputted text document to judge whether the search term has the inputted meaning. | 03-29-2012 |
20120078935 | IDENTIFYING SUPERPHRASES OF TEXT STRINGS - Methods and apparatus are described by which “superphrases” of “seed phrases” representing basic concepts may be identified without having to compare all possible pairs of seed and candidate phrases. According to one class of embodiments, a data structure similar to an inverted index is used for indexing phrases. The elimination of seed and candidate phrase pairs is enabled by building and traversing the index in a particular manner. | 03-29-2012 |
20120089630 | System and Method For Querying Heterogeneous Data Sources - A system and method for querying heterogeneous data sources is disclosed. In some embodiments, the system comprises a plurality of heterogeneously structured data sources, a plurality of query objects that represent queries to the data sources and that are independent of the structure of the data sources, and a user interface configured to query the plurality of query objects. | 04-12-2012 |
20120102059 | OPTICAL FIBER OPTIMIZATION SYSTEM - A computing-device implemented method may include performing one or more measurements for a number of optical fiber components. The one or more measurements may be stored. A performance matrix may be generated by at least one processor, based on the one or more measurements, wherein the performance matrix includes measured and estimated performance metrics for combinations of the number of optical fiber components. Suitability of a planned fiber optic installation that includes a number of components may be determined based on the performance matrix. One or more recommended fiber optic components may be determined based on the performance matrix. | 04-26-2012 |
20120109993 | Performing Visual Search in a Network - In general, techniques are described for performing a visual search in a network. A client device comprising an interface, a feature extraction unit and a feature compression unit may implement various aspects of the techniques. The feature extraction unit extracts feature descriptors from an image. The feature compression unit quantizes the image feature descriptors at a first quantization level. The interface that transmits the first query data to the visual search device via the network. The feature compression unit determines second query data that augments the first query data such that when the first query data is updated with the second query data the updated first query data is representative of the image feature descriptors quantized at a second quantization level. The interface transmits the second query data to the visual search device via the network to successively refine the first query data. | 05-03-2012 |
20120117101 | TEXT ENTRY WITH WORD PREDICTION, COMPLETION, OR CORRECTION SUPPLEMENTED BY SEARCH OF SHARED CORPUS - Searching a shared corpus is used to supplement word prediction, completion, and/or correction of text entry. A user input device at a client device receives user entry of text input comprising a string of symbols. The client device wirelessly transmits instructions to a remote site to conduct a search of a corpus using the string as a contiguous search term. From the remote site, the client device receives results of the search, including multiple sets of one or more words, each set occurring in the corpus immediately after the search term. The client device uses the received sets in word prediction, completion, and/or correction. | 05-10-2012 |
20120131031 | DEPENDENCY-BASED QUERY EXPANSION ALTERATION CANDIDATE SCORING - An alteration candidate for a query can be scored. The scoring may include computing one or more query-dependent feature scores and/or one or more intra-candidate dependent feature scores. The computation of the query-dependent feature score(s) can be based on dependencies to multiple query terms from each of one or more alteration terms (i.e., for each of the one or more alteration terms, there can be dependencies to multiple query terms that form at least a portion of the basis for the query-dependent feature score(s)). The computation of the intra-candidate dependent feature score(s) can be based on dependencies between different terms in the alteration candidate. A candidate score can be computed using the query dependent feature score(s) and/or the intra-candidate dependent feature score(s). Additionally, the candidate score can be used in determining whether to select the candidate to expand the query. If selected, the candidate can be used to expand the query. | 05-24-2012 |
20120136885 | QUERY REWRITING WITH ENTITY DETECTION - A system receives a search query, determines whether the received search query includes an entity name, and determines whether the entity name is associated with a common word or phrase. When the entity name is associated with a common word or phrase, the system generates a link to a rewritten query, performs a search based on the received search query to obtain first search results, and provides the first search results and the link to the rewritten query. When the entity name is not associated with a common word or phrase, the system rewrites the received search query to include a restrict identifier associated with the entity name, generates a link to the received search query, performs a search based on the rewritten search query to obtain second search results, and provides the second search results and the link to the received search query. | 05-31-2012 |
20120166465 | QUERY TRANSFORMATION - Methods and apparatus, including computer program products, are provided for providing value help. In one aspect, there is provided a computer-implemented method. The method may include receiving at least one field of a row of a list presented at a user interface; transforming, at a service component rather than the user interface, the at least one field into a query; and sending the transformed query to a database. Related apparatus, systems, methods, and articles are also described. | 06-28-2012 |
20120179703 | RECEIVING APPARATUS - According to an embodiment, a receiving apparatus includes a memory, a first generator, a second generator, a transmitter, a receiver. The memory stores service information including search criteria set in a memory device and a connection method for connecting with the memory device. The first generator generates a common search query that is a search query expressing search conditions used in searching contents and that includes at least a pair of a common search condition attribute and a common search condition attribute value. The second generator generates a search query according to the search criteria specified in the service information with the use of the generated common search query. The transmitter transmits the generated search query to the memory device based on the connection method specified in the service information. The receiver receives, from the memory device, the attribute information obtained as a result of executing the search query. | 07-12-2012 |
20120185497 | Techniques for Personalized and Adaptive Search Services - Techniques are presented that include defining one or more personalized categories, wherein each personalized category comprises one or more terms, identifying one or more of said personalized categories that are associated with a user query, identifying one or more terms that are associated with said user query and with said personalized category, and adding said identified one or more terms to said user query. | 07-19-2012 |
20120254217 | Enhanced Query Rewriting Through Click Log Analysis - Systems, methods, and computer media for identifying related strings for search query rewriting are provided. Session data for a user search query session in an accessed click log data is identified. It is determined whether a first additional search query in the session data is related to a first user search query based on at least one of: dwell time; a number of search result links clicked on; and similarity between web page titles or uniform resource locators (URLs). When related, the first additional search query is incorporated into a list of strings related to the first user search query. One or more supplemental strings that are related to the first user search query are also identified. The identified supplemental strings are also included in the list of strings related to the first user search query. | 10-04-2012 |
20120254218 | Enhanced Query Rewriting Through Statistical Machine Translation - Systems, methods, and computer media for identifying query rewriting replacement terms are provided. A list of related string pairs each comprising a first string and second string is received. The first string of each related string pair is a user search query extracted from user click log data. For one or more of the related string pairs, the string pair is provided as inputs to a statistical machine translation model. The model identifies one or more pairs of corresponding terms, each pair of corresponding terms including a first term from the first string and a second term from the second string. The model also calculates a probability of relatedness for each of the one or more pairs of corresponding terms. Term pairs whose calculated probability of relatedness exceeds a threshold are characterized as query term replacements and incorporated, along with the probability of relatedness, into a query rewriting candidate database. | 10-04-2012 |
20120259881 | PEER TO PEER (P2P) MISSING FIELDS AND FIELD VALUATION FEEDBACK - Methods, systems, and apparatus for processing data, and more specifically to retrieving results for a query from one or more devices coupled to a network. A first device may receive an abstract query including logical fields defined by a first data abstraction model and retrieve query results stored in the first device. The query may be sent to one or more other devices via the network. The one or more other devices may be configured to convert the abstract query to local abstract queries including logical fields defined in local data abstraction models. The local queries may be issued against local databases to retrieve additional results for the query. The local queries may not include all the fields of the abstract query. | 10-11-2012 |
20120265778 | FUZZY SEARCHING IN A GEOCODING APPLICATION - Various embodiments of systems and methods for fuzzy searching in a geocoding application are described herein. A lexical analysis is performed on an input address whose geocoding information is to be obtained to obtain portions of the input address. In one aspect, the lexical analysis may include at least one of a parsing operation, an abstraction operation, and a stretch operation. Next, a fuzzy searching is performed on a knot-sequence tree, using the portions of the input address, to identify a plurality of partial addresses which match with the input address. Next, a transposition and matching score is computed for each of the identified plurality of partial address to determine the best matching candidate for the input address. Finally, the geocoding database is queried with the best matching candidate to obtain the geocoding information of the input address. | 10-18-2012 |
20120271842 | LEARNING RETRIEVAL FUNCTIONS INCORPORATING QUERY DIFFERENTIATION FOR INFORMATION RETRIEVAL - The system and method of the present invention allows for the determination of the relevance of a content item to a query through the use of a machine learned relevance function that incorporate query differentiation. A method for selecting a relevance function to determine a relevance of a query-content item pair comprises generating a training set comprising one or more content item-query pairs. Content item-query pairs in the training set are collectively used to determine the relevance function by minimizing a loss function according to a relevance score adjustment function that accounts for query differentiation. The monotocity of relevance score adjustment function allows the trained relevance function to be directly applied to new queries. | 10-25-2012 |
20120296926 | SYSTEMS AND METHODS FOR GUIDED CONSTRUCTION OF A SEARCH QUERY IN AN ELECTRONIC COMMERCE ENVIRONMENT - A computer-implemented method includes receiving a search query from a user through a user interface of a user computing device, identifying a search term within the search query, the search term including at least a portion of the search query, generating, based at least in part on the search term, one or more alternative search terms that are each different from the search term, and sending, over the communication network, the one or more alternative search terms to the user computing device. | 11-22-2012 |
20120323948 | DIALOG-ENHANCED CONTEXTUAL SEARCH QUERY ANALYSIS - Embodiments of the present invention relate to systems, methods, and computer-storage media for a method of contextually analyzing terms within a search query. In one embodiment, a received search query is classified into a domain category. Additionally, information is assigned to a schema associated with the domain by analyzing the search query. Further, at least one search result that helps a user complete a task within the domain is provided based on the information in the schema. | 12-20-2012 |
20120323949 | AUTOMATED DATA CONVERSION AND ROUTE TRACKING IN DISTRIBUTED DATABASES - A determination is made as to whether a data type associated with a received logical table definition associated with a database query within a distributed database system differs from a data type associated with a local logical table definition. A data conversion is performed on data retrieved from a locally-stored physical table referenced by the local logical table definition in response to determining that the data types differ. Local data conversion information is created identifying the data conversion performed on the retrieved data in response to performing the data conversion. At least one of the retrieved data and the converted data with the created local data conversion information is forwarded to at least one of a distributed database node and an application-level module. | 12-20-2012 |
20120330991 | Context- And Version-Aware Facade For Database Queries - A method, computer program product, and system for accessing versioned data objects within a database, comprising creating a first new connection to a database stored in a memory, receiving a first query from a first client that requests access to a versioned data object stored in the database, and modifying the received first query to add contextual information configured on the first new connection, so that the modified first query is able to retrieve a first version of the versioned data object that corresponds to the contextual information. | 12-27-2012 |
20120330992 | Recommendation Systems And Methods Using Interest Correlation - A search technology generates recommendations with minimal user data and participation, and provides better interpretation of user data, such as popularity, thus obtaining breadth and quality in recommendations. It is sensitive to the semantic content of natural language terms and lets users briefly describe the intended recipient (i.e., interests, eccentricities, previously successful gifts). Based on that input, the recommendation software system and method determines the meaning of the entered terms and creatively discover connections to gift recommendations from the vast array of possibilities. The user may then make a selection from these recommendations. The search/recommendation engine allows the user to find gifts through connections that are not limited to previously available information on the Internet. Thus, interests can be connected to buying behavior by relating terms to respective items. | 12-27-2012 |
20130110861 | Facilitating Extraction and Discovery of Enterprise Services | 05-02-2013 |
20130138679 | Database query optimization and cost estimation - Described are systems and methods relating to database query optimization and query cost estimation. The approach is described in the context of searching balanced and semi-balanced tree indexes such as B-trees, B+ trees, and R-B trees. The described approach may be used for both simple and composite queries, and the described approach may be used for relational queries, i.e., where a variable is less than or greater than a certain value and the database is being used to find the set of records that satisfy the relation. Further, the described approach may be used for generalized N-ary tree queries and cost estimations. | 05-30-2013 |
20130138680 | Intelligent results related to a portion of a search query - Information may be presented to a user by using a first application to receive a character stream of one or more noncompletion characters. The noncompletion characters indicate that additional characters may be received. The character stream is exchanged with a host that analyzes the character stream to generate results that are responsive to the user's predicted interest. Results are received and displayed so that the user may select one of the results to launch a code segment related to the selected result. | 05-30-2013 |
20130159338 | SYSTEM AND METHOD FOR PROVIDING A USER INTERFACE WITH SEARCH QUERY BROADENING - A system and method for providing a user interface with search query broadening is described. A query defining a search executable on potentially retrievable information is accepted. The query is parsed. A broadened query is provided. At least one of the broadened query and results of a search executed on the broadened query is presented. | 06-20-2013 |
20130173649 | ADAPTIVE CUSTOMIZED PRESENTATION OF BUSINESS INTELLIGENCE INFORMATION - In one example, a method includes receiving information on a user role of a user account associated with a business intelligence system. The method further includes gathering information on interactions of the user account with the business intelligence system. The method further includes generating an initial business intelligence output based on data from one or more data sources. The method further includes generating a customized business intelligence output for the user account based on the initial business intelligence output, the user role, and the interactions of the user account with the business intelligence system. The method further includes providing the customized business intelligence output to the user account. | 07-04-2013 |
20130226950 | GENERALIZED EDIT DISTANCE FOR QUERIES - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining a generalized edit distance for queries. In one aspect, a method includes selecting query pairs of consecutive queries, each query pair being a first query and a second query consecutively submitted as separate queries, each first and second query including at least one term. For each query pair, the method includes selecting term pairs from the query pair, each term pair being a first term in the first query and a second term in the second query; and determining a co-occurrence value for each term pair. The method also includes determining transition costs based on the co-occurrence values for term pairs, each transition cost indicative of a cost of transitioning from a first term in a first query to a second term in a second query consecutive to the first query. | 08-29-2013 |
20130226951 | Interactive Visualization Of Sender and Recipient Information In Electronic Communications - An approach is provided that visually distinguishes between entity types in a communication system. A Data store with entities is queried, with entities connected to one another as senders and receivers, resulting in a query result. A node data structure corresponding to each of the entities is created and an edge data structure corresponding to each of the connections between the entities is also created. Nodes corresponding to the node data structures are displayed, along with edges (e.g., connection lines) corresponding to the edge data structures. A user selects one of the nodes that is displayed, and the selected node is visually highlighted. Different types of non-selected nodes are identified based on the selected node. Types of nodes may include sender type nodes, receiver type nodes, and sender/receiver type nodes. The types of identified nodes are highlighted in a manner that visually distinguishes each type from the other types. | 08-29-2013 |
20130246450 | SYSTEM AND METHODS OF IMPROVING A MULTI-TENANT DATABASE QUERY USING CONTEXTUAL KNOWLEDGE ABOUT NON-HOMOGENEOUSLY DISTRIBUTED TENANT DATA - In embodiments, methods and systems for improving a query in a database system are provided. These method and system embodiments can enable greater contextual knowledge about the types and use of data in tables underlying a relational database to be employed to improve query efficiency. By employing contextual information, embodiments can provide improved queries and/or make recommendations to a query optimizer of a database system to improve its operation based upon knowledge of the data and/or application gathered. Embodiments can be useful in improving query performance in multi-tenant database systems. | 09-19-2013 |
20130254220 | METHODS AND SYSTEMS FOR CREATING AND USING AN ADAPTIVE THESAURUS - Methods and systems are provided for creating an adaptive thesaurus. A term pair including an index term and an expansion term is received. A recall gain, an expansion independence, and a semantic similarity of the term pair are calculated using a processor. Whether to store the term pair is determined based on the recall gain, the expansion independence, and the semantic similarity. The term pair is stored based on the determination. Methods and systems are provided for searching using an adaptive thesaurus. A search query including a query term is received. An expansion term stored in association with an index term matching the query term in the adaptive thesaurus is retrieved. Using a processor, the search query is expanded using the expansion term based on a recall gain, an expansion independence, and a semantic similarity. | 09-26-2013 |
20130262498 | DATABASE QUERY OPTIMIZATION - Embodiments relate to a system, computer program product and method for database query optimization. An aspect includes a method that extracts complex predicates from a query statement, the query statement having at least two complex predicates. The method then executes a query associated with the query statement and obtains at least a respective execution structure cost (ΔT | 10-03-2013 |
20130268548 | SYSTEMS AND METHODS FOR IMPROVED WEB SEARCHING - Systems and methods are provided for improved web searching. In one implementation, suggested search queries are provided based on previous search queries and click data. A weighted bi-partite graph or index may be used to identify related search queries based on overlapping clicked URLs. According to a method, query-click log data of a search engine is processed to generate sets of suggested search queries, data corresponding to each suggested search query, and a set of clicked URLs related to each suggested search query. Additionally, or independently, methods may be provided for contextually correcting spelling errors within sets of suggested search queries using a contextual algorithm, and/or identifying and discarding sets of suggested search queries and URLs that lead to restricted material, such as restricted content and related URLs. | 10-10-2013 |
20130311504 | DEPENDENCY-BASED QUERY EXPANSION ALTERATION CANDIDATE SCORING - An alteration candidate for a query can be scored. The scoring may include computing one or more query-dependent feature scores and/or one or more intra-candidate dependent feature scores. The computation of the query-dependent feature score(s) can be based on dependencies to multiple query terms from each of one or more alteration terms (i.e., for each of the one or more alteration terms, there can be dependencies to multiple query terms that form at least a portion of the basis for the query-dependent feature score(s)). The computation of the intra-candidate dependent feature score(s) can be based on dependencies between different terms in the alteration candidate. A candidate score can be computed using the query dependent feature score(s) and/or the intra-candidate dependent feature score(s). Additionally, the candidate score can be used in determining whether to select the candidate to expand the query. If selected, the candidate can be used to expand the query. | 11-21-2013 |
20140025701 | QUERY EXPANSION - The present disclosure provides example query expansion methods and systems. A query input by a user is received. A normalized query of the query is determined according to the query. The normalized query is used as an expansion term of the query to implement query expansion. For example, session information in a search log of the user is obtained. All queries appearing in a single session are obtained and a number of votes for each query is calculated or counted. A vote similarity between a single query and a target query is determined and a correlation degree between the single query and the target query is determined according to the vote similarity. A normalized query of the target query is determined according to the correlation degree. The present techniques accurately expand queries and reduce query times, thereby improving system response speed and processing efficiency. | 01-23-2014 |
20140040301 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 02-06-2014 |
20140059069 | Parallel Filter Method and User Interface for Student Database Searching - What is provided is a system, user interface and computer implemented method of building a customized query for a student database. The query is built using filtering criteria and parameters associated thereto, which may be in natural language, yet capable of implementing BOOLEAN or set theory searching functionality without requiring user knowledge of such functionality. Query results may be modified without rebuilding the query, by adding a further filtering criteria and/or parameter, or removing a filter and/or parameter. | 02-27-2014 |
20140067846 | APPLICATION QUERY CONVERSION - A set of potential search-query terms can be identified based on empirical queries for apps. For each potential search-query term, a subset of documents within a set of documents can be identified based on apps that users were likely to click on or download following entry of a search query with a comparable or same term. One or more other indicator terms can be identified as being related to the potential search-query term based on the one or more second indicator terms being prevalent within the subset of documents. Upon receipt of a subsequent search query, a search can then be performed using both a term within the search query and one or more related other indicator terms. | 03-06-2014 |
20140067847 | GENERATING A QUERY - A system for generating a query comprises a term unit ( | 03-06-2014 |
20140082011 | SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR ADJUSTING A DATA QUERY - In accordance with embodiments, there are provided mechanisms and methods for adjusting a data query. These mechanisms and methods for adjusting a data query can enable more relevant query results, increased efficiency and revenue, optimized customer interaction, etc. | 03-20-2014 |
20140129585 | INFORMATION MANAGEMENT SYSTEMS AND METHODS - An information management system comprising a data comparison module, a local data storage, a remote data storage, a user interface for requesting information, optionally a communications module and optionally a criterion analyser to analyse one or more criteria and thereby enable creation of one or more suitable templates wherein: the data comparison module enables re-finement of information queries without the need to undertake one or more of rebuilding, re-categorizing or re-indexing the information; the communications module facilitates communication between participants in the system; one or more methodologies may be used to access the information depending on the context; and transfer of information between the remote data storage and local data storage is proactively managed according to one or more criteria. | 05-08-2014 |
20140172900 | AUTOMATIC GENERATION OF SEMANTICALLY SIMILAR QUERIES - Query suggestions are generated based on a Breadth-First-Search having a configurable decaying radius. A computer system receives an initial set of semantically similar queries. The computer system expands the set to include related terms. The set of related terms is included in the initial set. The expansion process is repeated for each query or related term in the set. The radius may be reduced for each subsequent related term added to the query. The process may stop when the radius reaches a specified threshold, e.g., a predetermined number of queries or terms for the set is reached. The set includes the related terms and search queries. The set may be used for, among other things, suggesting related terms to a researcher, improving search engine performance, or selecting appropriate advertisements. | 06-19-2014 |
20140172901 | QUERY EXPANSION USING ADD-ON TERMS WITH ASSIGNED CLASSIFICATIONS - In various embodiments, systems and methods are provided for query expansion using add-on terms with classifications. A query is received. An add-on term is identified for the query. A classification is determined for the add-on term. The classification is a designation associated with the add-on term that is used to distinguish the add-on term from the query. An appended query is generated based on the add-on term. The appended query is generated by concatenating the query with the add-on term. The appended query is executed on a resource stack as a single reformulated query to identify one or more resources. Upon execution, the classification of the add-on term distinguishes the one or more resources identified for the add-on term based on tagging the one or more resources with the classification of the add-on term. The appended query is used to generate content items. | 06-19-2014 |
20140172902 | SYSTEMS AND METHODS TO GENERATE AND UTILIZE A SYNONYM DICTIONARY - Systems and methods to identify synonyms are described. The system generates demand information based on a first plurality of queries, identifies a first synonym set based on an association map that comprises a first plurality of constraints identified from the first cluster of queries, stores the first synonym set in a synonym dictionary, receives a query, over a network, from a client machine, retrieves the first synonym from the synonym dictionary, and expands a constraint in the query received from the client machine based on the first synonym. | 06-19-2014 |
20140188924 | TECHNIQUES FOR ORDERING PREDICATES IN COLUMN PARTITIONED DATABASES FOR QUERY OPTIMIZATION - Techniques for ordering predicates in column partitioned databases for query optimization. Predicates on a single CP table within a query are organized to predicate-CP nodes with various sets of column partitions. The predicates within each predicate-CP node and the predicate-CP nodes as a whole are ordered in ascending order of cost which is determined by CPU/IO cost and predicate selectivity. The reorganized query is then executed. | 07-03-2014 |
20140188925 | USING CONTENT IDENTIFICATION AS CONTEXT FOR SEARCH - Techniques for using contextual information relating to content presented by a television as part of a search query for an information search are presented. A search management component, at a given moment in time during presentation of television-related content by a communication device in or associated with a television, identifies contextual information associated with a section of the television-related content and generates a content identifier timestamp associated with the contextual information and the section of television-related content. A search component augments a search query using the contextual information to facilitate customization of a subset of search results based on the contextual information. The contextual information in the search query can facilitate disambiguating the search query or promoting a search result over another search result in the subset of search results, based on the contextual information, to facilitate customization of the subset of search results. | 07-03-2014 |
20140244681 | 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. | 08-28-2014 |
20140250142 | DISK-BASED HASH JOIN PROCESS - A database system performs hash join process for processing queries that join an inner and an outer database table. The hash join processes builds a hash table in memory for the inner table. The database system receives a limit on the memory for storing the hash table. The database system maximizes the number of partitions stored in memory for the hash table. If the hash table exceeds the limit of the memory while adding rows from the inner table, the database system selects a partition for spilling to a persistent storage. The partition selected for spilling to may be the largest partition or a partition larger than most of the partitions. The database system initializes the hash table to a number of partitions that is substantially equal to half of the total number of blocks that can be stored within the specified limit of memory for the hash table. | 09-04-2014 |
20140258322 | SEMANTIC-BASED SEARCH SYSTEM AND SEARCH METHOD THEREOF - A semantic-based search system includes a log generating unit configured to generate a common log storing knowledge corresponding to general knowledge and a user log stored by reflecting user preference, an instance analyzing unit configured to analyze vector characteristics corresponding to an instance among interpretation alternatives according to a keyword input by a user, a weighted value calculating unit configured to calculate weighted values of confidence values and cosine similarity values of interpretation alternatives including vector characteristics of the instance with respect to at least an one of the common log and the user log, and an aligning unit configured to align rankings of the interpretation alternatives according to the keyword input on the basis of the calculated weight values of the confidence values and the cosine similarity values. | 09-11-2014 |
20140289268 | SYSTEMS AND METHODS OF RATIONING DATA ASSEMBLY RESOURCES - The technology disclosed relates to identifying unmet demands of users within the context of contact data search. In particular, it relates to identifying those search criteria that, upon being executed on an on-demand system, generate an overall number of search results below a threshold value. The threshold value can represent the real-world based expected value for the number of search results that should have been returned. The expected value can be a relative numerical estimate of the statistical likelihood of certain attributes within population sizes of contacts responsive to the search criteria. Operators of the on-demand system can be alerted to secure additional contacts that meet the search criteria and fulfill the demand for search results. | 09-25-2014 |
20140351282 | Methods and Systems for Data Packet Routing - Optimizing a bitmap data tree and a corresponding lookup operation in the bit map data tree may be provided. A number of branches for each search node of a data tree may be counted. The data tree may comprise a plurality of search nodes. Then an optimum depth for the plurality of search nodes may be identified based on the number of branches in the data tree. Next, a hash node may be added to replace a search node of the data tree when a number of branches for the search node is greater than the identified optimum depth. | 11-27-2014 |
20150012558 | USING MODELS TO ANNOTATE SEARCH QUERIES - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving a search query from a user, accessing a user model that is specific to the user and that includes one or more n-grams, one or more terms of the n-grams being associated with one or more annotations, the annotations indicating at least one context in which each of the one or more terms have been used, annotating one or more terms in the search query to provide an annotated search query, annotations being provided from user model, and receiving search results that are responsive to the annotated search query. | 01-08-2015 |
20150012559 | Search System Using Search Subdomain And Hints To Subdomains In Search Query Statements And Sponsored Results On A Subdomain-By-Subdomain Basis - A method and apparatus for generating search results including searching by subdomain and providing sponsored results by subdomain is provided. A search system according to embodiments of the present invention analyzes search queries to determine if they are to be routed to subdomains and presents results include sponsored hits sponsored on a subdomain by subdomain basis. | 01-08-2015 |
20150019583 | INTELLIGENTLY UTILIZING NON-MATCHING WEIGHTED INDEXES - System, method, and computer program product to intelligently utilize non-matching weighted objects, by determining that a sort sequence of a query does not match a sort sequence of a shared weight object of a database, modifying the query based on the sort sequence of the query, and executing the modified query to obtain a result set, wherein the result set does not include a set of rows that would have been returned using the shared weight object to process the unmodified query. | 01-15-2015 |
20150032767 | QUERY EXPANSION AND QUERY-DOCUMENT MATCHING USING PATH-CONSTRAINED RANDOM WALKS - Various technologies described herein pertain to use of path-constrained random walks for query expansion and/or query document matching. Clickthrough data from search logs is represented as a labeled and directed graph. Path-constrained random walks are executed over the graph based upon an input query. The graph includes a first set of nodes that represent queries included in the clickthrough data from search logs, a second set of nodes that represent documents included in the clickthrough data from the search logs, a third set of nodes that represent words from the queries and the documents, and edges between nodes that represent relationships between queries, documents, and words. The path-constrained random walks include traversals over edges of the graph between nodes. Further, a score for a relationship between a target node and a source node representative of the input query is computed based at least in part upon the path-constrained random walks. | 01-29-2015 |
20150046486 | ACCELERATING MULTIPLE QUERY PROCESSING OPERATIONS - Embodiments include methods, systems and computer program products a for offloading multiple processing operations to an accelerator includes receiving, by a processing device, a database query from an application. The method also includes performing analysis on the database query and selecting an accelerator template from a plurality of accelerator templates based on the analysis of the database query. The method further includes transmitting an indication of the accelerator template to the accelerator and executing at least a portion of the database query on the accelerator. | 02-12-2015 |
20150066972 | Mechanism for Optimizing Parallel Execution of Queries on Symmetric Resources - A method that comprises receiving a logical execution plan for a database query corresponding to a plurality of tables of the database, wherein the logical execution plan comprises one or more operators, receiving an operator cost for each of the operators in the logical execution plan, computing a first accumulated processing cost for a first of the tables based on the logical execution plan, operator selectivity, and operator costs corresponding to the first table, computing a second accumulated processing cost for a second of the tables based on the logical execution plan, operator selectivity, and operator costs corresponding to the second table, comparing the first accumulated processing cost and the second accumulated processing cost to determine a table with the highest accumulated processing cost, and responsive to comparing the accumulated processing costs, computing a physical execution plan that requires partitioning the table with the highest accumulated processing cost. | 03-05-2015 |
20150127675 | DISPLAY APPARATUS AND METHOD OF CONTROLLING THE SAME - A display apparatus for and a method of providing to users additional information associated with a broadcasting signal that is being output via the display apparatus are provided. The display apparatus includes a communication unit configured to perform data communication, and a control unit configured to acquire a keyword from content being reproduced by the display apparatus, to acquire user preference information corresponding to a mobile terminal, to acquire a search result corresponding to the acquired keyword, to produce additional information based on the acquired search result and the acquired user preference information, and to provide the additional information to the mobile terminal via the communication unit. | 05-07-2015 |
20150149497 | DETERMINING PROBLEM RESOLUTIONS WITHIN A NETWORKED COMPUTING ENVIRONMENT - A method is provided for determining problem resolutions within a networked computing environment. The method includes retrieving, by one or more computer processors, event data from within a networked computing environment. The method includes determining, by the one or more computer processors, a characteristic of a database within the networked computing environment, the database storing a plurality of problem resolutions. The method includes determining, by the one or more computer processors, a search query corresponding to the event data and to the characteristic of the database. The method includes performing, by the one or more computer processors, a first search of the database using the search query and then refining, by the one or more computer processors, the search query. The method then includes performing, by the one or more computer processors, at least one additional search of the database using the refined search query. | 05-28-2015 |
20150149498 | Method and System for Performing an Operation Using Map Reduce - The present invention provides a computer implemented method for performing an application specific operation on a dataset over a distributed computing system. The computer implemented method includes collecting a set of application specific refining data present in a data stream of the dataset in a first map phase by the distributed computing system, resetting the data stream of the dataset to a beginning position by the distributed computing system, and generating one or more resultant data elements using the set of application specific refining data in a second map phase, by the distributed computing system. | 05-28-2015 |
20150302050 | GENERATION OF REQUESTS TO A DATA PROCESSING SYSTEM - The present invention relates to a method for an at least semiautomatic generation of a request to a data processing system with a data pool, wherein a data model, which is usable for the selection of data from the data pool using a query language, forms the basis of the data pool, wherein a user's request made in natural language, which takes place by a user input of terms (user terms) captured as a series of characters (character string), wherein the terms semantically describe the user intended results of the answer of the data processing system on the request that has to be carried out by the data processing system, is analyzed and/or interpreted, and converted into a request in the query language. | 10-22-2015 |
20150331908 | VISUAL INTERACTIVE SEARCH - Roughly described, a system and method for user identification of a desired document, in which a database is provided which identifies a collection of documents in an embedding space, the database identifying a distance between each pair of the documents in the embedding space corresponding to a predetermined measure of dissimilarity between the pair of documents. In dependence upon a user query, the system constrains the embedding space geometrically to develop a first candidate space, and identifies toward the user a first set of N1>1 candidate documents from the first candidate space, the first set of candidate documents being more discriminative than the average discriminativeness of set size N1 documents in the first candidate space. Preferably the placement of the documents as presented to the user is indicative of the placement of the documents in the embedding space, either in distance or in collinearity or both. | 11-19-2015 |
20150347525 | Context-Based Object Retrieval In A Social Networking System - Embodiments improve the ability of users of a social networking system to search for information that is likely to be relevant to them by learning and/or applying a search context associated with selector components used to search for objects of the social networking system. The search context is specific to the use of an individual selector and thus need not be as general as the context of an entire page or set of pages in which selectors can be embedded. The social networking system may learn the context of a selector by monitoring user selections from prior search results performed using the selector. | 12-03-2015 |
20150356140 | ADAPTING A RELATIONAL QUERY TO ACCOMMODATE HIERARCHICAL DATA - A method, system and computer program product for processing hierarchical data is provided. A method for processing hierarchical data in a relational database includes receiving an input parameter in an initial query for querying an array in a hierarchical data object stored in a table of a relational database, and transforming the initial query into a transformed query configured to place all elements of the array into a different table and to apply a sub-query against the table for the input parameter. Once transformed, predicate evaluation logic of a relational engine of the relational database is applied to the transformed query that is then mapped to the initial query. Finally, responsive to receiving a subsequent instance of the initial query, the mapping is referred to in order to replace the initial query with the transformed query and to subsequently apply the predicate evaluation logic to the transformed query. | 12-10-2015 |
20150363464 | CUSTOM PARTITIONING OF A DATA STREAM - Techniques for partitioning data streams are provided. In some examples, a query for processing at least a portion of a data stream may be identified. The data stream may be associated with a user. Additionally, in some examples, code identifying an attribute of the identified stream may be received. The code may be capable of configuring the query based at least in part on the attribute. Further, in some aspects, the code may be configured to partition the data stream into at least a sub-stream based at least in part on the attribute. | 12-17-2015 |
20160055218 | INTERPRETING USER QUERIES BASED ON DEVICE ORIENTATION - 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 implicitly references some entity, and in response: obtaining an approximate location and an approximate orientation of the user device, obtaining a set of entities including one or more entities, each entity in the set of entities being at least partially within a range that is based on the approximate location and that includes an extended portion based on the approximate orientation, selecting an entity from the set of entities, and providing a revised query based on the query and the entity, the revised query explicitly referencing the entity. | 02-25-2016 |
20160078085 | METHOD AND SYSTEM FOR ADAPTIVELY BUILDING AND UPDATING A COLUMN STORE DATABASE FROM A ROW STORE DATABASE BASED ON QUERY DEMANDS - A method for adaptively building and updating a column store database from a row store database using queries. The method includes establishing the row store database for storing data, wherein at least one row of the row store includes attributes. The method includes establishing the column store including data structured to satisfy received analytic queries, wherein the column store includes attribute vectors corresponding to attributes in the row store, wherein at least one of the attribute vectors includes data used to satisfy previously received analytic queries. The method includes receiving change transactions directed to the row store, wherein the change transactions are ordered. The method includes when a first referenced attribute referenced by an analytic query corresponds to an attribute vector in the column store, updating the attribute vector based on log information corresponding to change transactions directed to the referenced attribute to satisfy the analytic query. | 03-17-2016 |
20160085800 | SYSTEMS AND METHODS FOR IDENTIFYING AN INTENT OF A USER QUERY - Systems and methods are described herein for identifying an intent of a user query. A media guidance application may receive a query from a user using any suitable method, including text input and voice/speech recognition software. The media guidance application may extract a plurality of n-grams from the query. The media guidance application may calculate, for each of the plurality of n-grams, a mutual information value with each of a plurality of potential intents. The mutual information value may indicate a measure of dependence between one of the plurality of n-grams and one of the plurality of potential intents. The media guidance application may select a subset of the plurality of n-grams based on the calculated mutual information values and input the subset of the plurality of n-grams into a probabilistic classifier, such as a Naïve Bayes Classifier, in order to identify the intent of the query. | 03-24-2016 |
20160085803 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085804 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085805 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085806 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085826 | REAL-TIME AND ADAPTIVE DATA MINING - A method of analyzing data is presented. The method includes generating a query based on a topic of interest, expanding search terms of the query, executing the query on one or more data sources, monitoring a specific data source selected from the one or more data sources. The monitoring is performed to monitor for matches to the query. | 03-24-2016 |
20160085853 | SEMANTIC TEXT SEARCH - A system for performing semantic search receives an electronic text corpus and separates the text corpus into a plurality of sentences. The system parses and converts each sentence into a sentence tree. The system receives a search query and matches the search query with one or more of the sentence trees. | 03-24-2016 |
20160092447 | SYSTEMS AND METHODS FOR SEARCHING FOR A MEDIA ASSET - Systems and methods for searching for a media asset are described. In some aspects, the system includes control circuitry that receives a first search query from a user. The control circuitry identifies media assets related to the first search query from a content database. The control circuitry receives a second search query following the first search query. The control circuitry determines whether a media asset from the media assets is related to the second search query. In response to determining that less than a threshold number of media assets from the media assets are related to the second search query, the control circuitry transmits an instruction requesting the user to repeat the second search query. The control circuitry receives a third search query related to the first search query. The control circuitry determines a media asset from the media assets that is related to the third search query. | 03-31-2016 |
20160147876 | SYSTEMS AND METHODS FOR CUSTOMIZED MUSIC SELECTION AND DISTRIBUTION - Improved systems and methods for customized selection and distribution of music are described herein. In one embodiment, a system for selecting music is provided that includes a plurality of profiles stored in a digital data store that correlate a group of users to a plurality of music tracks. The system further includes a user interface configured to receive input data including at least one characteristic of a user and at least one of (i) a purpose for playing music and (ii) a characteristic of an environment in which music is played. The system also includes a digital data processor configured to search the plurality of profiles for at least one match to the input data and select at least one music track from the plurality of music tracks that is correlated with the at least one match to the input data. | 05-26-2016 |
20160162545 | EXPANSION OF DATABASE SEARCH QUERIES - Systems and methods are provided for expanding database search queries. In one embodiment, a method comprises receiving a token that is usable in search queries for data in a database, the database including items of data stored in a tree hierarchy of categories. The method further comprises determining a synonym candidate for the token, and identifying the synonym candidate as a synonym for the token in response to a determination that the token and the synonym candidate are in a same category for a level of the tree hierarchy. | 06-09-2016 |
20160171013 | IMAGE SEARCH WITH HISTORICAL USER ACTIVITY METADATA | 06-16-2016 |
20160171051 | SYNCHRONIZATION SYSTEM FOR TRANSFORMING DATABASE AND METHOD THEREOF | 06-16-2016 |
20160203181 | Distributed Storage and Distributed Processing Policy Enforcement Utilizing Virtual Identifiers | 07-14-2016 |
20170235733 | BLENDED POLYGON SEARCH | 08-17-2017 |
20220138189 | QUERY EXECUTION DEBUGGER FOR USE WITH BUSINESS INTELLIGENCE AND DATA ANALYTICS ENVIRONMENTS - In accordance with an embodiment, described herein is a query execution debugger, for use with a computing environment such as, for example, a business intelligence environment, database, data warehouse, or other type of environment that supports data analytics. A query engine, for example a business intelligence server instance, serves analytics queries or requests from clients, directed to data stored at a database, in accordance with a query execution plan, wherein a logical query can include query language statements received from the clients; while a physical query includes database-specific statements that the query engine sends to the database to retrieve data when processing the logical query. The system can create a query execution debugger file that includes a record metadata portion or section, and a data portion or section, and which can be used to review, simulate, or debug the processing of queries against the database. | 05-05-2022 |