Query Expansion Or Refinement Patents (Class 707/765)
  • Patent number: 8631028
    Abstract: A method for processing an inputted XPath query against an inputted XML document is provided. The method generates a summary index, an ancestor-descendant path index, and a value index from one or more inputted XML documents. The summary index and the ancestor-descendant path index and the value index have at least one path defined. XPath queries at articulation points are parsed into multiple partial queries. The cursor type index access methods are determined. Partial queries are executed against the SUM-Index to generate a list of path identifiers (PID) satisfies the partial query segments. A set of ancestor-descendant PID identifiers list is generated to provide a result sequence. The result sequence of nodes is filtered producing one or more outputted XML documents from the final result sequence of nodes. A related system and computer medium is also provided.
    Type: Grant
    Filed: October 29, 2010
    Date of Patent: January 14, 2014
    Inventor: Primo M. Pettovello
  • Patent number: 8631025
    Abstract: The invention relates to a system (100) for identifying a certain data-object of a set of data-objects, wherein each data-object of the set of data-objects is described by a plurality of discriminating characteristics, the system comprising: a composition unit (110) for composing a query for identifying the certain data-object; an identification unit (120) for identifying a candidate data-object of the set of data-objects, based on the query; a presentation unit (130) for presenting a description of the candidate data-object to a user; a feedback unit (140) for receiving user feedback on a discriminating characteristic of the plurality of discriminating characteristics, the discriminating characteristic describing the candidate data-object; and an update unit (150) for updating the query for identifying the certain data-object, based on the user feedback on the discriminating characteristic describing the candidate data-object.
    Type: Grant
    Filed: November 26, 2007
    Date of Patent: January 14, 2014
    Assignee: Koninklijke Philips N.V.
    Inventors: Raymond Joseph Elisabeth Habets, Rutger Nijlunsing
  • Patent number: 8631027
    Abstract: An information retrieval system uses phrases to index, retrieve, organize and describe documents, analyzing documents and storing the results of the analysis as phrase data. Phrases are identified that predict the presence of other phrases in documents. Documents are the indexed according to their included phrases. Related phrases and phrase extensions are also identified. Changes to existing phrase data about a document collection submitted by a user is captured and analyzed, and the existing phrase data is updated to reflect the additional knowledge gained through the analysis.
    Type: Grant
    Filed: January 10, 2012
    Date of Patent: January 14, 2014
    Assignee: Google Inc.
    Inventor: Anna L. Patterson
  • Patent number: 8627222
    Abstract: A search and find user interface is provided that is integrated with a data indexing engine to allow efficient and high-speed data search and retrieval across data storage folders associated with a given software module or associated with a number of disparate software modules. An expanded form of the search and find user interface is provided for advanced searching. Where searching is required beyond a present search scope, an automatic “upscoping” mechanism is provided for expanding a search to data storage folders outside a current data storage folder on which an initial search is executed.
    Type: Grant
    Filed: May 9, 2006
    Date of Patent: January 7, 2014
    Assignee: Microsoft Corporation
    Inventors: Aaron Hartwell, Mike Pell
  • Patent number: 8626786
    Abstract: Dynamic language checking includes identifying questionable language usage; creating a query in dependence upon the questionable language usage; querying a search engine with the query; receiving from the search engine search result statistics describing the search results for the query; and determining, in dependence upon search results statistics returned by the search engine, whether the questionable language usage is proper language usage.
    Type: Grant
    Filed: January 30, 2012
    Date of Patent: January 7, 2014
    Assignee: International Business Machines Corporation
    Inventors: Michael A. Halcrow, Dustin Kirkland
  • Patent number: 8626781
    Abstract: A priority hash index provides efficient lookup of posting lists for search query terms. The priority hash index is a data structure in which hash values for terms are distributed across multiple storage devices based on importance of the terms and access speeds of the storage devices. Terms are grouped into search lists with each search list including a storage location on each storage device. When a search query is received, a term is identified and hashed to a location on the first storage device and to generate a unique hash value for the term. The locations on the storage device for the term's search list are sequentially read until the hash value for the term is located to access the posting list for the term.
    Type: Grant
    Filed: December 29, 2010
    Date of Patent: January 7, 2014
    Assignee: Microsoft Corporation
    Inventors: Knut Magne Risvik, Michael Hopcroft, John G. Bennett, Karthik Kalyanaraman, Trishul Chilimbi, Hui Shen
  • Patent number: 8626734
    Abstract: Application launching on a computer via indexed data. Based on a search term entered by a user, the computer searches an index containing metadata representative of one or more applications installed on the computer. A user interface on the computer's display has a window for displaying the results of searching the index. In addition, the user interface receives user input to select an application from the search results to be initiated. The computer is responsive to the user input via the user interface for initiating the selected application installed on the computer. A computer-readable medium including a persistent component, an index component, a query component, and an execution component embodies further aspects of the invention.
    Type: Grant
    Filed: April 29, 2010
    Date of Patent: January 7, 2014
    Assignee: Microsoft Corporation
    Inventors: Hyder Ali, Dane Alexander Glasgow, David Anton Walters, David Dawson, Marek Gorecki, Neel I. Murarka
  • Publication number: 20140006371
    Abstract: A system for guiding a search for information is presented. The system comprises a user interface that accepts a phrase and receives at least one suggestion based at least in part on the phrase. The system also includes a phrase suggestion engine that matches the phrase with the at least one suggestion. Methods of using the system are also provided.
    Type: Application
    Filed: September 3, 2013
    Publication date: January 2, 2014
    Applicant: Microsoft Corporation
    Inventors: Matthew R. Richardson, Robert J. Ragno
  • Patent number: 8615524
    Abstract: 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.
    Type: Grant
    Filed: January 26, 2012
    Date of Patent: December 24, 2013
    Assignee: Piksel, Inc.
    Inventors: Issar Amit Kanigsberg, Daniel Marc Veidlinger, Tamer El Shazli, Myer Joshua Mozersky
  • Patent number: 8612469
    Abstract: A network-accessible toolbox permits collaborative annotation, facilitating interaction and communication among users. In an implementation, content on a Web page, or other page or document accessible through a network or the Internet, can be annotated. A user can view the page and with the toolbox, select content on the page and make an annotation or suggestion. Multiple users can view and make annotations to the same page at the same time. After annotations are made, users can view the page with annotations made by other users. The author or owner of the page can accept or reject the annotations or suggestions made to the page. If the owner accepts a particular suggestion, the selected content is replaced with the suggestion.
    Type: Grant
    Filed: April 26, 2010
    Date of Patent: December 17, 2013
    Assignee: GlobalEnglish Corporation
    Inventors: Sam Neff, Raymond Galang, Sundararajan Parasuraman
  • Patent number: 8606807
    Abstract: Techniques for integrating triple tags into a tagging tool are described herein. According to one embodiment, tags used to tag document pages and associated with one or more communities are stored in a storage as a triple store, where each tag is stored in a format having a subject, a predicate, and an object fields representing a relationship among each tag, an associated document page, and associated communities. A tag input field is displayed in a sidebar window communicatively coupled to a main window of a browser to allow a user to enter a type of tag and an identifier of the tag in the tag search field, such that the entered tag can be stored within the triple store in view of the tag type and tag identifier. Other methods and apparatuses are also described.
    Type: Grant
    Filed: February 28, 2008
    Date of Patent: December 10, 2013
    Assignee: Red Hat, Inc.
    Inventor: Christoph Drieschner
  • Patent number: 8606808
    Abstract: An embodiment includes a computer-implemented method. For one embodiment, the computer-implemented method includes displaying a plurality of first groups of words in a browser for display to a user, constructing a new combination of search terms using more than one user-selected word groups, wherein the user-selected word groups are selected by the user from the plurality of first groups of words displayed to the user; invoking a search service with the new combination of search terms, displaying results of the search service using the new combination of search terms in the browser, and storing the results in memory coupled to a processor.
    Type: Grant
    Filed: September 30, 2012
    Date of Patent: December 10, 2013
    Assignee: Python4Fun, Inc.
    Inventors: Devabhaktuni Srikrishna, Marc Coram
  • Patent number: 8601017
    Abstract: A system and method for serving reliable content in search, the method comprising: receiving at a server computer from a user, a request to search a network for certain information; searching the network for the information requested and obtaining a set of results including user-generated content; searching the user's list of social connections; determining whether any of the search results related to a person in the user's list of social connections/contacts; and providing an indication of greater reliability for the search results that correspond to persons from the user's list of social connections.
    Type: Grant
    Filed: December 23, 2010
    Date of Patent: December 3, 2013
    Assignee: Yahoo! Inc.
    Inventor: Chetan Subhash Deshmukh
  • Patent number: 8600343
    Abstract: Among other disclosures, a method may include collecting historical communication data and personal data relating to a portion of a plurality of communications, a sender of one or more of the communications or one or more recipients of the communications. The method may include depositing the collected data into a repository of historical communication data and personal data. The method may include presenting one or more items in the repository on a mobile device, in response to user behavior.
    Type: Grant
    Filed: July 25, 2008
    Date of Patent: December 3, 2013
    Assignee: Yahoo! Inc.
    Inventors: Matthew Brezina, Adam Smith, Jeffrey Bonforte
  • Patent number: 8595207
    Abstract: In accordance with embodiments, there are provided mechanisms and methods for dynamically suggesting answers to questions submitted to a portal of an online service. These mechanisms and methods for dynamically suggesting answers to questions submitted to a portal of an online service can enable embodiments to provide help document suggestions with limited user input. The ability of embodiments to provide help document search term suggestions with limited user input can enable users to quickly and efficiently find useful help documents.
    Type: Grant
    Filed: May 19, 2011
    Date of Patent: November 26, 2013
    Assignee: Salesforce.com
    Inventors: Patrick R. McFarlane, Ganesh Mathrubootham, Suchun Yang
  • Patent number: 8595219
    Abstract: A system and method for the matching addresses is provided. Addresses may be received from a search engine or other source for purposes of matching. Address parts in the addresses may be contextually identified. Identified address parts, including their associated data, that have address part types that are alike may be compared to one another and a contextual matching score may be calculated and assigned. A free format token analysis of the addresses may also be performed in parallel with, before, or after, the contextual identification, and a free format matching score may be calculated. An address likeness score may be calculated and assigned based on the contextual matching score and the free format matching score.
    Type: Grant
    Filed: June 29, 2012
    Date of Patent: November 26, 2013
    Assignee: Trans Union, LLC
    Inventor: Douglas Thompson
  • Patent number: 8595253
    Abstract: Embodiments of the present disclosure provide a unique and novel archiving system that includes two or more network storage systems, each network storage system including removable hard disk drives embedded in removable disk cartridges, referred to simply as removable disk drives. The removable disk drives allow for expandability and replacement such that the archiving system need not be duplicated to add new or more storage capacity. In embodiments, the archiving system accesses, writes, reads, or performs functions on data from one network storage system to another remote network storage system.
    Type: Grant
    Filed: August 15, 2012
    Date of Patent: November 26, 2013
    Assignee: Imation Corp.
    Inventors: Matthew D. Bondurant, S. Christopher Alaimo
  • Patent number: 8595252
    Abstract: Methods, systems, and apparatus, including computer program products, for suggesting alternative queries based on original query search results. In one aspect, a method includes receiving search results for a first query, where each search result refers to a respective resource and includes a snippet of content from the respective resource, receiving one or more suggested second queries, for each of the suggested second queries: selecting a set of words in one of the snippets to represent the suggested second query, associating the suggested second query with the set so that a user can interact with a word in the set to invoke the suggested second query, and marking the set so as to indicate that the user can interact with a word in the set to invoke the suggested second query, and transmitting the search results including each marked set to a client device for presentation to the user.
    Type: Grant
    Filed: September 12, 2008
    Date of Patent: November 26, 2013
    Assignee: Google Inc.
    Inventors: Jun Wu, Tiejun Wang, Hayden Shaw
  • Publication number: 20130311504
    Abstract: 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.
    Type: Application
    Filed: July 29, 2013
    Publication date: November 21, 2013
    Applicant: Microsoft Corporation
    Inventors: Shasha Xie, Xiaodong He, Jianfeng Gao
  • Patent number: 8583672
    Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for presenting spelling suggestions. In one aspect, a method includes receiving first search results for a first search query and a plurality of spelling suggestions for a first term in the first search query, wherein the first search results are provided by a search engine as a response to the first search query; displaying the plurality of spelling suggestions and the first search results in a user interface; receiving a user input selecting one of the plurality of spelling suggestions; transmitting data identifying the selected spelling suggestion to request second search results for a second search query comprising the selected spelling suggestion from the search engine; and displaying the second search results in place of the first search results in the user interface.
    Type: Grant
    Filed: April 14, 2011
    Date of Patent: November 12, 2013
    Assignee: Google Inc.
    Inventors: Mark A. Paskin, Kelly Poon, Yew Jin Lim, Jon M. Wiley, Jonathan J. Effrat
  • Patent number: 8583670
    Abstract: Presenting one or more suggested search-engine queries based on an initial search-engine query is described herein. Once the initial query is received, a search engine determines whether any web content is relevant thereto. If not, a query-suggestion service determines whether any suggested queries can be substituted for the initial query. If not, the query is spell-corrected, if necessary, and parsed into individual terms. Each parsed term is then checked to see whether it can be associated with alternative search terms. Terms than can are combined and their combination is also checked for alternative search terms. All of the alternative search terms are scored and then assembled into a list of suggested search terms that is presented to the user.
    Type: Grant
    Filed: October 4, 2007
    Date of Patent: November 12, 2013
    Assignee: Microsoft Corporation
    Inventors: Michael Cameron, Hugh Williams
  • Patent number: 8583671
    Abstract: Disclosed are various embodiments of systems and methods for generating composite mediasets from mediasets, each comprising media items, associated with a plurality of users. In some embodiments, individual and/or group recommendations are provided for creating a group playlist by aggregating user taste data for a plurality of users in a group. In other embodiments, systems and methods are provided which allow for sharing and playing of a group playlist by users in a group, each of which has a media playback device. Each media item, such as a song, is played from one of the individual user devices for the benefit of all users in the vicinity at the time. Music thus can be “shared” without transferring files potentially in violation of copyrights.
    Type: Grant
    Filed: April 29, 2009
    Date of Patent: November 12, 2013
    Assignee: Apple Inc.
    Inventors: Francisco Martin, Marc Torrens, Rick Hangartner, Guillermo Caudevilla-Laliena, David del ser Bartolome, Craig Rowley
  • Patent number: 8577911
    Abstract: Systems, software, and computer-implemented methods can be used to present search results and search refinement suggestions identified in response to a search query using a search refinement wheel. In response to receiving a search query, a set of suggested query refinements are obtained. A spoke graph structure processable to present a visual representation of the search query and at least a portion of the set of the at least one search query refinements is generated, where the search query is represented by a first node in the visual representation and each of the portion of the set of the search query refinements is represented by an individual spoke in the visual representation that can be activated to generate a corresponding new search query. The generated graph can be provided in response to the search query, e.g., to a client device from which the search query is received.
    Type: Grant
    Filed: March 23, 2011
    Date of Patent: November 5, 2013
    Assignee: Google Inc.
    Inventors: Adam Stepinski, Margaret Stewart
  • Patent number: 8577912
    Abstract: A method includes analyzing a plurality of electronic documents available via a network service, selecting content of the documents encountered during the analysis to generate signatures for the documents based on the content of the documents, generating an index comprising the signatures, and updating the index by performing additional analysis. The index is updated to include documents having the same signatures.
    Type: Grant
    Filed: May 29, 2012
    Date of Patent: November 5, 2013
    Assignee: A9.com, Inc.
    Inventor: James E. Beach
  • Patent number: 8577880
    Abstract: A system provides a user interface through which users can flexibly tag individual items represented in an electronic catalog with user-defined tags, such as text strings, and obtain recommendations that are specific to particular tags. The tags and tag-item assignments created by each user are stored persistently in association with the user, and may be kept private to the user or exposed to others. Once a user has assigned a tag to a number of items, the user (or another user in some embodiments) can request and obtain recommendations that are specific to this tag. These recommendations may be generated in real time by a recommendation service that identifies items that are collectively similar or related to the items associated with the tag.
    Type: Grant
    Filed: February 21, 2012
    Date of Patent: November 5, 2013
    Assignee: Amazon Technologies, Inc.
    Inventors: Aaron Donsbach, Andrej Gregov, Jeffrey D. Few, Jeffrey D. Lehman, Jeffrey T. Brownell
  • Patent number: 8572110
    Abstract: A textual search index is used to identify data objects that have numerical properties that satisfy search queries. As described herein, a search index contains search index entries, each of which specifies a reference string and a set of data object identifiers. When an original search query is received, the search query is transformed into a transformed search query such that numerical comparison query elements in the original search query are transformed into equivalent textual comparison query elements. The search index is then used to identify ones of the data objects that satisfy the transformed search query. A list of the identified data objects may then be provided in response to the original search query.
    Type: Grant
    Filed: December 4, 2008
    Date of Patent: October 29, 2013
    Assignee: Microsoft Corporation
    Inventors: Suryanarayana M. Gorti, Ashish Consul, Graham Smith, Pingjun Hu
  • Patent number: 8566338
    Abstract: A content management system provides a way to detect a change to one part of a document, and to generate a corresponding change in a different part of the same document. Dynamic inclusion rules define conditions that, when satisfied, allow automatically changing a link in a document to a new link when corresponding data in the document is added or changed. If a change corresponds to a defined dynamic inclusion rule, a corresponding query in the rule is evaluated according to the changes in the document. When there is enough information to run the query, the query is automatically executed in a background process. If there is a single link that satisfies the query, the document may be updated with the new link. If multiple links satisfy the query, the top ranked query result may be automatically selected, or the user may select which link should be included in the document.
    Type: Grant
    Filed: September 21, 2007
    Date of Patent: October 22, 2013
    Assignee: International Business Machines Corporation
    Inventors: Brian John Cragun, John Edward Petri
  • Patent number: 8566789
    Abstract: A powerful set of features can assist software developers in searching source code. Source code can be queried to find occurrences of source code elements mapped to domain concepts appearing in an ontology. Queries can specify a search for occurrences of particular operations performed on domain concepts within the source code. Query expansion can be used to locate related domain concepts as indicated in the ontology. Query keyword weighting can be used to emphasize one domain concept over another. Tools can be provided to create the ontology and associate the ontology with the elements appearing in the source code. Results can include user interface features assisting in navigation to a location within the source code associated with the query results.
    Type: Grant
    Filed: August 23, 2006
    Date of Patent: October 22, 2013
    Assignee: Infosys Limited
    Inventors: Nagaraja Nanjegowda Siddaramappa, Renuka Sindhgatta, Santonu Sarkar, Srinivas Thonse, Krishnakumar Pooloth
  • Patent number: 8566351
    Abstract: To provide a technique for accurately and efficiently generating Boolean search formulas that serve as a basis of similarity search. A Boolean search formula generation apparatus according to the present invention establishes Boolean search formulas expressed in a standard sum of products form connecting products of search terms by a sum and evaluates the Boolean search formulas based on a recall and a precision. The Boolean search formula generation apparatus repeats connecting the products of the search terms with maximum evaluation values by a sum to establish a Boolean search formula.
    Type: Grant
    Filed: September 7, 2011
    Date of Patent: October 22, 2013
    Assignee: Hitachi, Ltd.
    Inventor: Makoto Iwayama
  • Publication number: 20130268548
    Abstract: 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.
    Type: Application
    Filed: March 11, 2013
    Publication date: October 10, 2013
    Applicant: AOL Inc.
    Inventors: Sean Christopher TIMM, Sudhir ACHUTHAN
  • Patent number: 8554783
    Abstract: Methods for classifying computer objects. The methods may comprise receiving a tag for a first computer object. The tag may comprise at least two nested categories describing the first computer object. The methods may also comprise updating a hierarchy of categories for computer objects to include the at least two nested categories describing the computer object. In addition, the methods may comprise displaying a graphical representation of the hierarchy of categories, and displaying an indication of computer objects having tags comprising a first category when an indication of the first category is received.
    Type: Grant
    Filed: September 17, 2007
    Date of Patent: October 8, 2013
    Assignee: Morgan Stanley
    Inventors: Edward Safo, Alka Ladha, Joseph Bravate, Dov B. Katz, Shafik Yaghmour
  • Patent number: 8555182
    Abstract: A graphical user interface is disclosed for management and easy reorganization of graphical objects displayed over the graphical user interface. The graphical user interface may relate to prioritizing and organizing the results of a database search. The graphical user interface may alternatively relate to prioritizing and organizing graphic objects such as personalized topics on a homepage and formatting icons in a productivity application program, such as a word processing application program, a spreadsheet application program, a presentation application program and a drawing application program.
    Type: Grant
    Filed: June 7, 2006
    Date of Patent: October 8, 2013
    Assignee: Microsoft Corporation
    Inventors: Robert S. Dietz, Douglas W. Herman
  • Publication number: 20130262454
    Abstract: Methods and systems for providing related web pages are disclosed. One method includes identifying a plurality of web pages, wherein the plurality of web pages each have a relationship with the first file, wherein the world wide web provides a platform for sharing web pages, and wherein each web page includes a document or information resource that is suitable for the world wide web and is accessible through a web browser. The method further includes generating a list of inquiries based on the plurality of web pages, providing, the list of inquiries to at least one author of the first file, receiving from the at least one author at least one response to the list of inquiries, selecting a subset of the plurality of web pages based on the at least one response, and storing information related to the selected subset of the plurality of web pages.
    Type: Application
    Filed: April 3, 2012
    Publication date: October 3, 2013
    Applicant: PYTHON4FUN
    Inventors: Devabhaktuni Srikrishna, Marc A. Coram, Christopher Hogan
  • Publication number: 20130262498
    Abstract: 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 (?Ti) for each of the complex predicates. The method also calculates an overall execution structure cost corresponding to each of the complex predicates, the complex predicates being arranged according to result of the query and the execution structure costs (?Ti); and optimizes a database query by selecting the arrangement of complex predicates having a lowest overall execution structure cost.
    Type: Application
    Filed: March 18, 2013
    Publication date: October 3, 2013
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Dong Sheng Chen, Shu Hua Liu, Xin Ying Yang, Miao Zheng
  • Publication number: 20130254220
    Abstract: 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.
    Type: Application
    Filed: May 17, 2013
    Publication date: September 26, 2013
    Applicant: LEXISNEXIS
    Inventors: Donald LORITZ, Shian-jung CHEN, Narasimha EDALA, Harry SILVER
  • Publication number: 20130246450
    Abstract: 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.
    Type: Application
    Filed: April 29, 2013
    Publication date: September 19, 2013
    Applicant: salesforce.com, inc
    Inventors: Craig Weissman, Dave Moellenhoff, Simon Wong
  • Patent number: 8538915
    Abstract: A system and method for responding to a query. An original query is received. A first semantic query and a second semantic query are extracted from the information of the original query. The first semantic query is transformed, based upon semantic analysis, into a numeric model query. The second semantic query is submitted to a semantic analyzer and the numeric model query is submitted to a numeric model analyzer. A response for the second semantic query and a response for the numeric model query are integrated into an answer for the original query.
    Type: Grant
    Filed: July 12, 2010
    Date of Patent: September 17, 2013
    Assignee: International Business Machines Corporation
    Inventors: Youssef Drissi, Tyrone W. Grandison, Colin G. Harrison, Kaan K. Katircioglu, Jurij R. Paraszczak
  • Patent number: 8533223
    Abstract: Tagging of content items and entities identified therein may include a matching process, a classification process and a disambiguation process. Matching may include the identification of potential matching candidate entities in a content item whereas the classification process may categorize or group identified candidate entities according to known entities to which they are likely a match. In some instances, a candidate entity may be categorized with multiple known entities. Accordingly, a disambiguation process may be used to reduce the potential matches to a single known entity. In one example, the disambiguation process may include ranking potentially matching known entities according to a hierarchy of criteria.
    Type: Grant
    Filed: May 12, 2009
    Date of Patent: September 10, 2013
    Assignee: Comcast Interactive Media, LLC.
    Inventor: David F. Houghton
  • Patent number: 8527533
    Abstract: A system and method for enabling information providers using a computer network such as the Internet to influence a position for a search listing within a search result list generated by an Internet search engine. The system and method of the present invention provides a database having accounts for the network information providers. Each account contains at least one search listing having at least three components: a description, a search term comprising one or more keywords, and a bid amount. The network information provider may add, delete, or modify a search listing after logging into his or her account via an authentication process. The network information provider influences the position for a search listing through a continuous online competitive bidding process. The bidding process occurs when the network information provider enters a new bid amount, which is preferably a money amount, for a search listing.
    Type: Grant
    Filed: July 23, 2010
    Date of Patent: September 3, 2013
    Assignee: Yahoo! Inc.
    Inventors: Darren J. Davis, Matthew Derer, Johann Garcia, Larry Greco, Tod E. Kurt, Thomas Kwong, Jonathan C. Lee, Ka Luk Lee, Preston Pfarner, Steve Skovran
  • Publication number: 20130226951
    Abstract: 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.
    Type: Application
    Filed: April 9, 2013
    Publication date: August 29, 2013
    Applicant: International Business Machines Corporation
    Inventor: International Business Machines Corporation
  • Publication number: 20130226950
    Abstract: 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.
    Type: Application
    Filed: April 3, 2013
    Publication date: August 29, 2013
    Inventors: Massimiliano Ciaramita, Amac Herdagdelen, Daniel Mahler
  • Patent number: 8521721
    Abstract: Embodiments are directed to implementing custom operators in a query for a parallel query engine and to generating a partitioned representation of a sequence of query operators in a parallel query engine. A computer system receives a portion of partitioned input data at a parallel query engine, where the parallel query engine is configured to process data queries in parallel, and where the queries include a sequence of built-in operators. The computer system incorporates a custom operator into the sequence of built-in operators for a query and accesses the sequence of operators to determine how the partitioned input data is to be processed. The custom operator is accessed in the same manner as the built-in operators. The computer system also processes the sequence of operators including both the built-in operators and at least one custom operator according to the determination indicating how the data is to be processed.
    Type: Grant
    Filed: September 14, 2010
    Date of Patent: August 27, 2013
    Assignee: Microsoft Corporation
    Inventors: Stephen Harris Toub, Igor Ostrovsky, Mike Liddell
  • Patent number: 8521762
    Abstract: In a method for generating a business process model project, a computer receives a data file comprising text, descriptive of a business process. The computer searches a sentence in the text for a keyword indicative of existence of a corresponding business artifact stated elsewhere in the sentence. In response, the computer identifies an indicator in the sentence, the indicator designating a name of the corresponding business artifact. The computer identifies a business artifact based on the keyword and the indicator. The computer generates a business process model project based in part on the business artifact.
    Type: Grant
    Filed: May 31, 2011
    Date of Patent: August 27, 2013
    Assignee: International Business Machines Corporation
    Inventors: Andrew David Humphreys, John James Peter McNamara, John Donald Taylor
  • Patent number: 8515931
    Abstract: Techniques for optimizing a search are disclosed. In one embodiment, a method for optimizing search on a Web site comprises: retrieving first search results corresponding to a first search request from a remote data store, causing the first search results to be stored in a local data store, receiving an indication that a portion of the second search results that are to be returned in response to a second search request overlaps with the first search results, causing an overlapped portion of the second search results to be retrieved from the local data store, and retrieving a remaining portion of the second search results from the remote data store. The local data store comprises a database associated with a browser, a trusted frame associated with the Web site, or a trusted script associated with the site and configured to determine the overlap of the first and second search results.
    Type: Grant
    Filed: September 21, 2010
    Date of Patent: August 20, 2013
    Assignee: A9.com, Inc.
    Inventor: Matthew Amacker
  • Patent number: 8515984
    Abstract: A search term suggestion engine of a computing device receives characters of user data as the characters are input. The user data is at least part of a search term to be provided to one of multiple applications to search for the search term. An indication of multiple suggestion sources is received from the one application, and one or more suggested search terms are obtained, from the multiple suggestion sources, based on the received characters. One or more suggested search terms can also be obtained from the multiple suggestion sources based on one or more linguistic alternatives for the received characters. The one or more suggested search terms are combined into a combined set of suggested search terms, and the combined set of suggested search terms is returned to a search user interface for presentation to the user.
    Type: Grant
    Filed: November 16, 2010
    Date of Patent: August 20, 2013
    Assignee: Microsoft Corporation
    Inventors: Derek S. Gebhard, Marc Wautier, Manav Mishra, Edward Boyle Averett, Brendan D. Elliott, David J. G. Wood, Philip P. Fortier, Andrei T. Aron, Vivekanandan Elangovan, Kwong K. Leung, Arun Gurunathan, Octavio Alfredo Cruz Sanchez, Priya Vaidyanathan
  • Patent number: 8510323
    Abstract: Provided is a method for grouping identity records to generate candidate lists to use in an entity and relationship resolution process. A plurality of identity records provide attributes of entities. The received identity records are grouped into a group of identity records. A composite query on values for selected attributes of the identity records in the group is generated and applied to an entity database to obtain composite results of entity records in the entity database matching the attribute values of the composite query. For the identity records in the group, an individual query on attributes of one of the identity records is performed against the composite results of the entity records to determine a candidate list of entity records from the entity database for the identity record.
    Type: Grant
    Filed: April 19, 2012
    Date of Patent: August 13, 2013
    Assignee: International Business Machines Corporation
    Inventors: Bhavani K. Eshwar, Rajeshwar Kalakuntla, Vaishnavi Nori, Nithinkrishna P. Shenoy
  • Patent number: 8510321
    Abstract: In the realm of managing relational databases, a system that uses both the data in a relational database and domain knowledge in ontologies to return semantically relevant results to a user's query. Broadly contemplated herein, in essence, is a system that bridges a semantic gap between queries users want to express and queries that can be answered by the database using domain knowledge contained in ontologies. In accordance with a preferred embodiment of the present invention, such a system extends relational databases with the ability to answer semantic queries that are represented in SPARQL, an emerging Semantic Web query language. Particularly, users may express their queries in SPARQL, based on a semantic model of the data, and they get back semantically relevant results. Also broadly contemplated herein is the definition of different categories of results that are semantically relevant to a user's query and an effective retrieval of such results.
    Type: Grant
    Filed: August 3, 2006
    Date of Patent: August 13, 2013
    Assignee: International Business Machines Corporation
    Inventors: Anand Ranganathan, Zhen Liu
  • Patent number: 8510322
    Abstract: A search environment of an embodiment includes name mining and matching features used in part to identify people-centric queries and provide an enriched search experience, but is not so limited. A method of an embodiment operates to provide an expanded query based in part on a geometric similarity measure, an edit distance measure, a string similarity measure, and a cumulative similarity measure. A search system of an embodiment includes a mined candidate generator component and a name matcher component used in part to identify name queries and provide an expanded query that includes original query terms and one or more valid mined names. Other embodiments are also disclosed.
    Type: Grant
    Filed: June 17, 2011
    Date of Patent: August 13, 2013
    Assignee: Microsoft Corporation
    Inventors: Aninda Ray, Dmitriy Meyerzon, Uppinakuduru Raghavendra Udupa
  • Patent number: 8504582
    Abstract: A system and methods for unit of measurement conversion and search query expansion are described. The search query expansion may include identifying an initial unit of measurement associated with a property and an initial numeric value for the initial unit of measurement within a search query, automatically forming an expanded search query by expanding the search query to include at least one related unit of measurement associated with the property, and sending the expanded search query to a search engine to search a database. Other embodiments are described and claimed.
    Type: Grant
    Filed: December 31, 2008
    Date of Patent: August 6, 2013
    Assignee: eBay, Inc.
    Inventor: Benny Soetarman
  • Publication number: 20130198158
    Abstract: Methods and systems are disclosed that allow a linked-to web page to be provided using information about a linked-from web page. The linked-to web page, for example, may be provided with enhanced content, additional content, suggestion features, or searching features. Certain of the methods are useful in the context of a user using a search engine web page to search for and link to other web pages. An exemplary method can be performed by a server that provides such a linked-to web page. The server receives a request to provide the linked-to web page and parses the request to identify information, such as, search terms that were entered on the search engine web page. The server can use the search terms or other information associated with the linked-from web page to determine what content should be provided or how it should be provided for the linked-to web page.
    Type: Application
    Filed: April 29, 2010
    Publication date: August 1, 2013
    Applicant: Adobe Systems Incorporated
    Inventors: Remon Tijssen, Tim Kukulski