Query Mapping Patents (Class 707/763)
  • Patent number: 8140504
    Abstract: A method, computer program product, and system for receiving a natural language query. The natural language query is parsed into a plurality of base concepts. One or more base concepts chosen from the plurality of base concepts is processed to define a selected report template. The selected report template is selected from a plurality of default report templates. At least one of the base concepts chosen from the plurality of base concepts is mapped to a data field within data via a mapping dictionary. The data includes a plurality of records. A query is executed on at least a portion of the data to identify a result record set. The result record set defines at least a portion of the plurality of records.
    Type: Grant
    Filed: October 31, 2008
    Date of Patent: March 20, 2012
    Assignee: International Business Machines Corporation
    Inventors: Jennifer G. Becker, Kenneth Lee McClamroch, Peter Sun
  • Patent number: 8140558
    Abstract: A mechanism is provided for generating Structured Query Language/Extensible Markup Language (SQL/XML) statements. An SQL/XML generation module receives an SQL statement that is expressed in terms of logical data items. The SQL/XML generation module parses and analyzes the SQL statement and generates a set of XMLQUERY functions, a set of XMLTABLE functions, and a set of XMLEXISTS predicates to retrieve, filter, or update at least one of XML documents or relational data based on a main mapping table and a namespace mapping table. The SQL/XML generation module generates at least one SQL/XML statement from parts of the SQL statement and the generated set of XMLQUERY functions, the set of XMLTABLE functions, and the set of XMLEXISTS predicates. The at least one SQL/XML statement is substantially equivalent in functionality to the SQL statement. The SQL/XML generation module sends the at least one SQL/XML statement to a database engine for execution.
    Type: Grant
    Filed: May 22, 2009
    Date of Patent: March 20, 2012
    Assignee: International Business Machines Corporation
    Inventors: Tim Kiefer, Matthias M. Nicola
  • Patent number: 8135716
    Abstract: According to some embodiments, a programming language in an application server may include access to different database server implementations, wherein the programming language accesses content of database tables via work areas derived from the database tables. A database table, having columns to store content, each column being associated with a column type, may be mapped to a work area such that, at a database server, each column in the database table is mapped to a corresponding component of the work area, the corresponding component having a default component type based on the column type of the associated column in the database table. It may be determined that a particular column in the database table is to store large object data content, and, in response to the determination, a new mapping to a work area may be defined such that the particular column maps to a corresponding component having a component type other than the default component type.
    Type: Grant
    Filed: December 10, 2008
    Date of Patent: March 13, 2012
    Assignee: SAP AG
    Inventors: Christian Stork, Andreas Blumenthal, Tobias Wenner, Dirk Debertin
  • Publication number: 20120059840
    Abstract: A computer implemented system and method that combines data from multiple sources to provide a unified view of data using multi-layered conceptual modeling framework. The invention provides means to model conceptual data models at multiple levels of abstraction and a means to map them with each other and with physical models. A query rewriting approach adopted in the present invention is capable of translating queries down multiple levels of conceptual models into physical models and Conceptual modeling framework provide a means to capture and process semantic intent of data more accurately thereby reducing data integration errors significantly.
    Type: Application
    Filed: August 29, 2011
    Publication date: March 8, 2012
    Applicant: TATA CONSULTANCY SERVICES LIMITED
    Inventors: Sreedhar Sannareddy REDDY, Prasenjit DAS, Raghavendra Reddy YEDDULA
  • Patent number: 8122045
    Abstract: The invention relates to a method for mapping at least one data column from a database source to at least one data column of a data target, the method comprising: defining at least one reference column of the data target and at least one database source column; performing a comparison of data contained in the data column(s) with the reference column(s); and determining mapping candidates between the data column(s) and the reference column(s).
    Type: Grant
    Filed: January 9, 2008
    Date of Patent: February 21, 2012
    Assignee: International Business Machines Corporation
    Inventors: Christoph Lingenfelder, Stefan Raspl, Yannick Saillet
  • Patent number: 8122017
    Abstract: Methods, systems, and apparatus, including computer program products are provided for indexing tags in source code. Implementations provide an enhanced retrieval of source code, in which a score for each of a plurality of files is derived based on a quantity of references to each file in source code of the remaining plurality of files. A query is received identifying a source code tag. Matching files of the plurality of files that satisfy the query are identified, a ranking of the matching files is generated based on the derived scores, and the ranking is provided.
    Type: Grant
    Filed: September 18, 2008
    Date of Patent: February 21, 2012
    Assignee: Google Inc.
    Inventors: Phil Sung, Piaw Na
  • Patent number: 8122031
    Abstract: Methods, program products, and systems for classifying feeds are described. A system acquires user created labels and user subscribed data feeds from a group of users. The system generates a topic-feed association rule by generating a topic-feed mapping that contains topic-feed pairs, calculating a weight for each topic-feed pair, and selecting topic-feed pairs whose weight reaches a threshold. The data feeds are classified into topics according to the topic-feed association rules. The system obtains user categories from a group of users. Using a probability model, the system matches the user subscribed data feeds with the user categories. The system further generates a topic classification, associating topics with user categories. Using the topic classification, topic-feed association rules, and a user's specific data, the system predicts a user's feeds of interest and recommends data feeds to the user accordingly.
    Type: Grant
    Filed: June 11, 2009
    Date of Patent: February 21, 2012
    Assignee: Google Inc.
    Inventors: Derek Mauro, Beverly Yang
  • Patent number: 8117215
    Abstract: A query-centric system and process for distributing reverse indices for a distributed content system. Relevance ranking techniques in organizing distributed system indices. Query-centric configuration subprocesses (1) analyze query data, partitioning terms for reverse index server(s) (RIS), (2) distribute each partitioned data set by generally localizing search terms for the RIS that have some query-centric correlation, and (3) generate and maintain a map for the partitioned reverse index system terms by mapping the terms for the reverse index to a plurality of different index server nodes. Indexing subprocess element builds distributed reverse indices from content host indices. Routines of the query execution use the map derived in the configuration to more efficiently return more relevant search results to the searcher.
    Type: Grant
    Filed: September 24, 2010
    Date of Patent: February 14, 2012
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: George H. Forman, Zhichen Xu
  • Patent number: 8108416
    Abstract: The present invention is directed towards systems and methods for updating a search results page in response to user interaction with a map resource. The method of the present invention comprises receiving a first search results page in response to a search query comprising at least a first map resource. The method monitors a change in position of a map resource in response to a user interaction and calculates a location corresponding to a map position. The method then re-executes at least one search query based upon said calculated location and displays a second search results page comprising a plurality of updated search results.
    Type: Grant
    Filed: October 31, 2007
    Date of Patent: January 31, 2012
    Assignee: Yahoo! Inc.
    Inventor: Keith A. Marlow
  • Publication number: 20120022867
    Abstract: Methods, computer program products and systems are described for speech-to-text conversion. A voice input is received from a user of an electronic device and contextual metadata is received that describes a context of the electronic device at a time when the voice input is received. Multiple base language models are identified, where each base language model corresponds to a distinct textual corpus of content. Using the contextual metadata, an interpolated language model is generated based on contributions from the base language models. The contributions are weighted according to a weighting for each of the base language models. The interpolated language model is used to convert the received voice input to a textual output. The voice input is received at a computer server system that is remote to the electronic device. The textual output is transmitted to the electronic device.
    Type: Application
    Filed: September 29, 2011
    Publication date: January 26, 2012
    Inventors: Brandon M. Ballinger, Johan Schalkwyk, Michael H. Cohen, Cyril Georges Luc Allauzen, Michael D. Riley
  • Patent number: 8095553
    Abstract: The present invention generally provides methods, systems and articles of manufacture that provide a database query application that allows user to compose an abstract query that includes a sequence operator. In one embodiment, sequence operators are used to specify which data elements, from a sequence of data elements, should be retrieved for an abstract query. In another embodiment, a sequence operator may be used to specify that a condition included in an abstract query should be evaluated against particular data elements of the sequence.
    Type: Grant
    Filed: March 17, 2005
    Date of Patent: January 10, 2012
    Assignee: International Business Machines Corporation
    Inventors: Richard D. Dettinger, Daniel P. Kolz
  • Patent number: 8090737
    Abstract: Techniques are disclosed for processing an abstract query which includes a dictionary term criteria condition. The dictionary term criteria condition is used to specify a set of one or more keywords, each of which should appear in a distinct document (of a defined set of documents) in order for the condition to be satisfied. In one embodiment, a user defines an abstract query by specifying a model entity (a logical focus for a query used to identify a set of documents associated with the model entity), logical fields (specifying query conditions and information to be returned), and a set of terms for a dictionary term criteria condition.
    Type: Grant
    Filed: March 26, 2009
    Date of Patent: January 3, 2012
    Assignee: International Business Machines Corporation
    Inventors: Richard D. Dettinger, Frederick A. Kulack, Brian R. Muras
  • Patent number: 8078635
    Abstract: An information processing apparatus includes a communication connection section that is communicably connected to an external apparatus; a first storage section that stores a predetermined program to be executed by the external apparatus, and for which read/write operation from the external apparatus is inhibited; a second storage section to which read/write operation from the external apparatus is inhibited; and a write section that reads out the predetermined program stored in the first storage section when the information processing apparatus is communicably connected to the external apparatus by the communication connection section and writes the read out program in the second storage section.
    Type: Grant
    Filed: July 15, 2008
    Date of Patent: December 13, 2011
    Assignee: Sony Corporation
    Inventors: Yoshinari Higuchi, Masaki Mikamo
  • Patent number: 8073818
    Abstract: Described is a technology in which image near-duplicate retrieval is performed using similarities between patterns of query image words and patterns of database image words. In general, the image retrieval problems resulting from visual polysemy are reduced by using such visual patterns. Visual word vectors and visual pattern vectors are determined for the query image and a database image. These four vectors are used to determine similarity between the database image and the query image. The similarity scores may be used for ranking and/or re-ranking the database image similarity to the query image relative to other database images' similarity scores. Also described is expanding a query visual word of the query image to a set of visual words that are visual synonyms with the query visual word, to help reduce image retrieval problems resulting from visual synonymy.
    Type: Grant
    Filed: October 3, 2008
    Date of Patent: December 6, 2011
    Assignee: Microsoft Corporation
    Inventors: Manni Duan, Xing Xie
  • Patent number: 8060502
    Abstract: The disclosed methods, systems, and computer-program products allow a business to generate data quality indicators for relationships in a database. In an embodiment, one or more relationships linked to a customer are retrieved from a database to form a set of relationships. A match confidence code is generated for each relationship based on a score generated by the comparison of customer data associated with the respective relationship and corresponding customer data obtained from an external industry database. A link confidence code is subsequently determined for the customer based on a score generated by the scores used to define the match confidence code for each relationship in the set of relationships and on internal data associated with each relationship in the set of relationships.
    Type: Grant
    Filed: October 4, 2007
    Date of Patent: November 15, 2011
    Assignee: American Express Travel Related Services Company, Inc.
    Inventors: Prashant Sharad Churi, German Gonzalo Creamer, Sara Tresch, Mary Weissman
  • Patent number: 8060524
    Abstract: A system, method, and medium are provided for providing a personalized answer to a user-defined search query by utilizing the user's search history. A search session is instantiated, and search queries, search results, user selections of search results, and other information is recorded. A search query is received and analyzed to determine whether the query reflects user intent to re-find a search result that the user previously was presented in response to a previously issued search query. Search results pages provided to the user in response to queries include a personalized history answer that represents a previously viewed search result that the user may be attempting to re-find.
    Type: Grant
    Filed: December 11, 2008
    Date of Patent: November 15, 2011
    Assignee: Microsoft Corporation
    Inventors: Michael Austin Schechter, Ramez Naam
  • Patent number: 8051060
    Abstract: A method that accepts a data file, iteratively tests different information units as record delimiters and field delimiters, and chooses as the data files record delimiter, R, and field delimiter, F, the information units that result in the lowest generalized entropy that is computed on fields created by use of the chosen delimiter pair R,F.
    Type: Grant
    Filed: February 13, 2009
    Date of Patent: November 1, 2011
    Inventors: Kiem-Phong Vo, Subhabrata Sen
  • Patent number: 8041733
    Abstract: A system and method is provided for recognizing a pattern in queries and using the recognized pattern to categorize queries under existing query categories. An entity text that represents a real-world object is detected in a query. The entity text is categorized into an entity category. The query is then rewritten as an annotated query by replacing the entity text with a placeholder for any entity matching the entity category. The annotated query is compared to other queries that are associated with query categories to find a query category that is frequently associated with the annotated query. The query category frequently associated with the annotated query is used to generate a rule. The rule indicates that any query matching the annotated query is likely to fit into the query category. The rule can be used to assign categories to queries or correct incorrectly categorized queries.
    Type: Grant
    Filed: February 9, 2009
    Date of Patent: October 18, 2011
    Assignee: Yahoo! Inc.
    Inventor: Omid Rouhani-Kalleh
  • Patent number: 8041728
    Abstract: Methods, systems, and articles of manufacture for applying query-level and parameter-level display profiles to abstract queries are provided. Display profiles allow users to utilize existing abstract queries for purposes of data analysis. In one embodiment, display profiles are used to change the scope of an existing abstract query or incorporate existing data processing functions into the abstract query.
    Type: Grant
    Filed: September 30, 2004
    Date of Patent: October 18, 2011
    Assignee: International Business Machines Corporation
    Inventors: Richard D. Dettinger, Daniel P. Kolz, Richard J. Stevens, Shannon E. Wenzel
  • Patent number: 8024314
    Abstract: A method and system for generating a hybrid index for indexing objects based on location and keyword attributes and performing location-based searching is provided. A search system performs a location-based search using a hybrid index that indexes both location and keyword attributes of objects. The search system generates the hybrid index either using the location attribute as the primary index or the keyword attribute as the primary index. When the location attribute is the primary index, the keyword attribute is the secondary index, and vice versa. To generate the hybrid index, the search system identifies the values for the keyword and location attributes of each object. The search system generates the primary index to map each value of a first attribute to a secondary index. The search system thus generates, for each value of the first attribute, a secondary index to map values of a second attribute to objects that have the associated values of the first and second attributes.
    Type: Grant
    Filed: September 19, 2008
    Date of Patent: September 20, 2011
    Assignee: Microsoft Corporation
    Inventors: Chuang Wang, Wei-Ying Ma, Xing Xie, Yinghua Zhou
  • Patent number: 7996416
    Abstract: Techniques for object relational mapping in database technologies are described herein. According to one embodiment, in response to a query statement for accessing a relational database, a syntax tree is generated to represent semantic information of the query statement, where the query statement includes a wildcard parameter and is implemented as an object of a SQL. A data type of the wildcard parameter is predicted based on the semantic information obtained from the syntax tree in view of a structure representing the syntax tree. The predicted data type of the wildcard parameter is used to access the corresponding entry of the relational database. Other methods and apparatuses are also described.
    Type: Grant
    Filed: August 31, 2007
    Date of Patent: August 9, 2011
    Assignee: Red Hat, Inc.
    Inventor: Steven Ebersole
  • Publication number: 20110191361
    Abstract: Embodiments of the invention provide data management solutions that go beyond the traditional warehousing system to support advanced analytics. Furthermore, embodiments of the invention relate to systems and methods for extracting data from an existing data warehouse, storing the extracted data in a reusable (intermediate) form using data parallel and compute parallel techniques over cloud, query processing over the data with/without compute parallel techniques, and providing querying using high level querying languages.
    Type: Application
    Filed: January 30, 2010
    Publication date: August 4, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Himanshu Gupta, Rajeev Gupta, Laurent S. Mignet, Mukesh K. Mohania, Ullas B. Nambiar
  • Publication number: 20110191312
    Abstract: A server a server receives a search request in a third format. The third format is a search request format. A first search query in a first format is generated. The first format is a first search query format. A second search query is generated in a second format. The second format is compatible with a format used by a second search engine. The second format is a second search query format. The search request is in the third format. The first format and the second format are different from one another. First result data comprising a plurality of first result data items, and second result data comprising a plurality of second result data items are received. A search result is generated. The generating the search result includes consolidating the plurality of the first result data items and the plurality of the second result data items.
    Type: Application
    Filed: January 29, 2010
    Publication date: August 4, 2011
    Applicant: Oracle International Corporation
    Inventors: Hari Krishna Gutlapalli, Ashish Joshi, Hema Bharadwaj
  • Patent number: 7991784
    Abstract: A method, performed in a character entry system involves computing contextual associations between multiple character strings based upon occurrence of character strings relative to each other in documents present in the system, wherein the computing contextual associations involves i) identifying pertinent documents present in the system, ii) creating a list of character strings contained within documents in the system; and iii) creating an interrelationship between the character strings to contents of the system; in response to the user inputting a specified threshold of individual characters, identifying at least one selectable character string from among the character strings used in creating the computed contextual associations that can complete the incomplete input character string in context; providing the identified at least one selectable character string to a user for selection; and receiving, in the system, the user's selection and completing the incomplete input character string based upon the sele
    Type: Grant
    Filed: November 20, 2009
    Date of Patent: August 2, 2011
    Inventor: Prashant Parikh
  • Patent number: 7979412
    Abstract: A method, apparatus and program product is provided for querying an object database. In response to performing a first query, a first set of query results is generated from an object database. Metadata associated with and describing the first set of query results is generated. The first query results and the associated metadata are mapped to a results entity. A second set of query results is generated by querying the results entity using query terms from the metadata in response to performing a second query.
    Type: Grant
    Filed: December 26, 2007
    Date of Patent: July 12, 2011
    Assignee: International Business Machines Corporation
    Inventors: Chris D. Johnson, William Thomas Newport
  • Patent number: 7979474
    Abstract: A mechanism for dynamically configuring searchable fields of interest within a search center is provided. A field mappings file is used to define relationships between searchable fields of interest in searchable objects and fields within a search index accessible to an enterprise-wide search center. The field mappings file can provide the defined relationships between searchable object fields and search index fields at runtime of a user session, thus avoiding a rigid configuration at the time of search center initialization.
    Type: Grant
    Filed: October 19, 2007
    Date of Patent: July 12, 2011
    Assignee: Oracle International Corporation
    Inventors: Hari K. Gutlapalli, Shirish K. Kothari, Suhas R. Mehta, Wai Pak
  • Patent number: 7979455
    Abstract: RDF store database designs and efficient techniques for converting SPARQL queries to SQL queries are described that provide faster triplet access, and which can reduce the computational overhead and cost associated with storing large volumes of RDF metadata. In various embodiments RDF data can be stored in de-normalized tables tailored to provide efficient query and storage performance. The provided query conversion techniques provide reliable and efficient query performance.
    Type: Grant
    Filed: November 26, 2007
    Date of Patent: July 12, 2011
    Assignee: Microsoft Corporation
    Inventors: Karthick Krishnamoorthy, Raman Kumar, Rajdeep S. Dua
  • Patent number: 7958137
    Abstract: 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.
    Type: Grant
    Filed: February 3, 2009
    Date of Patent: June 7, 2011
    Assignee: Honeywell International Inc.
    Inventors: Jeff Vanderzweep, Tim Felke, Kang Zhang
  • Patent number: 7953722
    Abstract: Methods and apparatus, including computer program products, for a query response service for business objects. In general, data characterizing a request to perform a query on multiple instances of a business object may be received, where the query includes selection criteria for multiple attributes across multiple nodes for each of the instances of the business object. The query may be initiated on the instances of the business object. Results including values from the attributes across the nodes of the business objects may be returned. The query may be assigned to a node of the business object, which may be a query response transformation node. The node may include a combination of attributes associated with the attributes across the nodes of the business object. Results may be sorted on a server, sent as pages to a client, or both.
    Type: Grant
    Filed: December 21, 2007
    Date of Patent: May 31, 2011
    Assignee: SAP AG
    Inventors: Steffen Tatzel, Maic Wintel, Ye Jin, Martin Hartig
  • Patent number: 7925604
    Abstract: The embodiments of the invention provide a method of ordering an intersecting of a group of lists into a left-deep AND-tree. The method begins by performing a first selecting process including selecting a top list, corresponding to a top leaf of the left-deep AND-tree, from the group of lists to leave remaining lists of the group of lists. The top list can be the smallest list of the group of lists. The method can also select a pair of lists from the group of lists, such that the pair of lists has the smallest intersection size relative to other pairs of lists of the group of lists. Next, the method estimates intersections of the remaining lists with the top list by estimating an amount of intersection between the remaining lists and the top list. This involves sampling a portion of the remaining lists. The method also includes identifying larger list pairs having smaller intersections sizes when compared to smaller list pairs having larger intersections sizes.
    Type: Grant
    Filed: October 25, 2007
    Date of Patent: April 12, 2011
    Assignee: International Business Machines Corporation
    Inventors: Robert Krauthgamer, Aranyak Mehta, Vijayshankar Raman, Atri Rudra
  • Patent number: 7925982
    Abstract: The present invention embodiments include a geographic overlay system including an information system, a mapping system interface to communicate with a mapping system and a database system including National Census geographic boundaries and data files. The geographic overlay system utilizes a client/server model that streams geographic data from a server system to dynamically render vector-based map layers inside a client browser. The geographic overlay system employs a Nationwide database of Census geographies that may be rendered as interactive point, line or polygon objects over a National base map provided by the mapping system. A database builder interface enables users to build the database and server pages. The present invention embodiments overlay translucent, interactive dynamically generated vector-based polygonal Census boundary map layers over geographical maps from the mapping system.
    Type: Grant
    Filed: August 29, 2007
    Date of Patent: April 12, 2011
    Inventors: Cheryl Parker, Yosri Diab
  • Patent number: 7921130
    Abstract: A system and method from processing database queries allows for cost and locale based distribution for execution of database queries. The database queries are executed on execution engines that provide flexible configuration and overlapping functionality. The system reduces various costs, including elapsed time, required to perform database queries. The method provides processing of a database query using a database catalog comprising database table locality information, record locality information and execution engine information. A query optimizer receives the query and accesses the catalog to create a query execution plan comprising locality-based database operations. A central database operation processor providing a first execution engine executes the query execution plan by performing at least a portion of the locality-based database operations and distributing at least a portion of the locality-based database operations as a subplan.
    Type: Grant
    Filed: October 15, 2008
    Date of Patent: April 5, 2011
    Assignee: Netezza Corporation
    Inventors: Foster D. Hinshaw, John K. Metzger, Barry M. Zane
  • Patent number: 7912864
    Abstract: A method includes defining a plurality of terms for use in conjunction with a study where the terms are stored according to a series of relations and the relations corresponding to the terms indicate an association from a term to at least one other of the plurality of terms, defining at least one group of terms taken from the plurality of terms and storing at least one group of terms, including the relations corresponding to each term, defining a further level of relations to be applied to the group of terms, the further level of relations defining inclusion and exclusion criteria, and providing a match term defined by the group of terms and querying a memory of data from the study to find occurrences of the match term as defined by the further level of relations.
    Type: Grant
    Filed: September 25, 2007
    Date of Patent: March 22, 2011
    Assignee: Oracle International Corp.
    Inventor: Kim Rejndrup
  • Patent number: 7904468
    Abstract: Software executable by a wireless communication device may include instructions for receiving at least one markup language document containing a markup language definition defining a query of a notional database table. The notional database table may be characterized by a set of notional fields, each corresponding to a field of a data record within an information category maintained by each of a plurality of wireless communication device-executable personal information manager (PIM) software applications. The software may further include instructions for instantiating, based on the markup language definition, an instance of at least one object-oriented class containing code for effecting the query through interaction with one PIM software application, executable at said wireless communication device, of the plurality. Software for defining the query in markup language may also be provided.
    Type: Grant
    Filed: February 27, 2008
    Date of Patent: March 8, 2011
    Assignee: Research In Motion Limited
    Inventors: Tim Neil, Paul Chalmers
  • Patent number: 7895206
    Abstract: The likelihood that a query belongs to a vertical is determined. The query is assigned to a vertical based on that likelihood. A query submitted to a main search box is assigned to verticals and processed using indices specific to those verticals. The query is assigned to verticals based on coverage adjusted log likelihood per unit (CALL) values for that query in those verticals. An offline learning component computes UNITS dictionaries and learns the distributions of query units in the main search and each of the vertical searches using query logs. An online scoring and ranking component uses the query distributions and UNITS dictionaries to determine the CALL values and a likelihood of the query belonging to any vertical. The search query is then assigned to verticals based on the likelihoods. The search query is then processed by all the verticals the query is assigned to.
    Type: Grant
    Filed: March 5, 2008
    Date of Patent: February 22, 2011
    Assignee: Yahoo! Inc.
    Inventors: Vijay K. Narayanan, Jiangyi Pan
  • Patent number: 7895226
    Abstract: Methods and systems for converting standardized, structured update requests into native business object commands are provided. The structured update requests may be defined in a business object-specific structured query language (BQL). A BQL engine may translate the structured update request into a command formatted for use by the appropriate business object or a programming interface in communication with the business object.
    Type: Grant
    Filed: November 30, 2007
    Date of Patent: February 22, 2011
    Assignee: SAP AG
    Inventors: Wolfgang M Koch, Rainer Brendle, Jan Karstens, Gunther Albert Liebich, Andreas Wildhagen
  • Patent number: 7890516
    Abstract: A query including one or more current search terms is received from a user and executed against a target database. When the query yields a number of results less than a defined search threshold (a.k.a. an “unsuccessful” search), the current search terms are compared with an associations database. The associations database includes associations between search terms in previously-executed queries that yielded less than a threshold number of results and replacement search terms that were substituted to generate a successful query yielding at least the threshold number of results. Upon finding a match between one or more of the search terms and the current search terms, the associations between the search terms and the replacement search terms are used to identify suggested replacement search terms and present them to the user.
    Type: Grant
    Filed: May 30, 2008
    Date of Patent: February 15, 2011
    Assignee: Microsoft Corporation
    Inventors: Daniel G. Zarzar Charur, Mark D. Huentelman, Noaa Avital, Jun Ge, Joel W. Varland
  • Patent number: 7890525
    Abstract: A system for automatically providing foreign language abbreviation translation in an instant messaging system that identifies a foreign language abbreviation translation database based on a user indicated source culture. The foreign abbreviation translation database stores abbreviation translations for foreign language abbreviations frequently used by people from the user indicated source culture. The system locates a candidate term in an instant message and compares the candidate term to the foreign language abbreviations in the foreign language abbreviation translation database. In the event that the candidate term matches one of the foreign language abbreviations in the identified foreign language abbreviation translation database, the corresponding translation is retrieved and displayed. The comparison of the candidate term with the foreign language abbreviations may include automatically obtaining a transliteration of the candidate term.
    Type: Grant
    Filed: November 14, 2007
    Date of Patent: February 15, 2011
    Assignee: International Business Machines Corporation
    Inventors: Fang Lu, Corey S. McCaffrey, Elaine I. Kuo
  • Patent number: 7873611
    Abstract: Techniques for object relational mapping in database technologies are described herein. According to one embodiment, in response to a query statement for accessing a relational database, a syntax tree is generated to represent semantic information of the query statement, where the query statement has a boolean parameter and is implemented as an SQL object. A data type of the boolean parameter is predicted based on the semantic information obtained from the syntax tree in view of a structure representing the syntax tree. The boolean parameter is configured to be either a numeric value or a string dependent upon metadata used to map the SQL object to the relational database. Other methods and apparatuses are also described.
    Type: Grant
    Filed: August 31, 2007
    Date of Patent: January 18, 2011
    Assignee: Red Hat, Inc.
    Inventor: Steven Ebersole
  • Patent number: 7870146
    Abstract: A system, method and program product that maps between an application program interface of a data source and a persistent multidimensional object, and vice versa. The system, method and program product map in a single step that reduces computational requirements. In one embodiment, the invention is JAVA-based to provide an easy to understand framework for Java developers to utilize when supporting integration with non-relational back end systems. The system, method and program product are instance based and, hence, are scalable vertically and horizontally.
    Type: Grant
    Filed: January 8, 2002
    Date of Patent: January 11, 2011
    Assignee: International Business Machines Corporation
    Inventors: Kenneth Alan Babb, Brian T. Paulsen
  • Patent number: 7853605
    Abstract: An exemplary software architecture allows for defining and accessing data and auxiliary data for an item in a navigable namespace. For example, such an exemplary architecture can include a provider engine operable to access data for an item in a navigable namespace, an auxiliary provider engine operable to access auxiliary data for the item and an auxiliary provider class for use in defining the auxiliary data for the item and accessing the auxiliary data for the item. Various other exemplary technologies are also disclosed.
    Type: Grant
    Filed: July 29, 2005
    Date of Patent: December 14, 2010
    Assignee: Microsoft Corporation
    Inventors: Jeffrey D. Jones, Jeffrey P. Snover
  • Publication number: 20100306227
    Abstract: Systems, methods and computer program products are provided for a distributed associative memory base. Such methods may include providing a distributed memory base that includes a network of networks of associative memory networks. The memory base may include a network of associative memory networks, a respective associative memory network comprising associations among a respective observer entity and a plurality of observed entities that are observed by the respective observer entity. Ones of the associative memory networks are physically and/or logically independent from other ones of the associative memory networks. Methods include imagining associations from the associative memory base using a plurality of streaming queues that correspond to ones of a plurality of rows of ones of the associative memory networks.
    Type: Application
    Filed: May 7, 2010
    Publication date: December 2, 2010
    Inventors: James S. Fleming, Yen-min Huang
  • Patent number: 7840584
    Abstract: The present invention is generally directed to a system, method and article of manufacture for accessing data represented abstractly through an abstraction model. In one embodiment, a data repository abstraction layer provides a logical view of an underlying data repository that is independent of the particular manner of data representation. For each successive query, the data repository abstraction layer is replaced or redefined to provide a restricted logical view of the underlying data repository.
    Type: Grant
    Filed: November 21, 2007
    Date of Patent: November 23, 2010
    Assignee: International Business Machines Corporation
    Inventors: Richard D. Dettinger, Richard J. Stevens
  • Patent number: 7840895
    Abstract: In one embodiment of the invention, a system for data manipulation includes a mapper module operable to receive a first data format of a source file, receive a second data format of a target file, and automatically generate a script to represent a movement of data from the source file to the target file. A server is operable to execute the script, a first interface module is coupled to the source file and is operable to load the data in accordance with the script, and a second interface module is coupled to the target file and is operable to store the data in accordance with the script.
    Type: Grant
    Filed: May 23, 2005
    Date of Patent: November 23, 2010
    Assignee: Computer Associates Think, Inc.
    Inventors: Rishi Bhatia, Matthew J. Schulze, John M. Tomaszewski, Robert B. Kittredge, Davanum Srinivas
  • Patent number: 7840081
    Abstract: A method of representing at least one image comprises deriving at least one descriptor based on color information and color interrelation information for at least one region of the image, the descriptor having at least one descriptor element, derived using values of pixels in said region, wherein at least one descriptor element for a region is derived using a non-wavelet transform. The representations may be used for image comparisons.
    Type: Grant
    Filed: September 22, 2005
    Date of Patent: November 23, 2010
    Assignee: Mitsubishi Denki Kabushiki Kaisha
    Inventors: Stavros Paschalakis, Miroslaw Bober
  • Patent number: 7818333
    Abstract: A method and system for parsing of input addresses for further automated processing. A relevant locale for an input address is determined. Based on the locale, an applicable parsing tree is provided so that different address formats can be tested against the input address. The parsing tree is generated from a local address format specification that defines permissible formats for the locale. The local address format specification and the local address component rules are provided to a parsing engine to determine one or more potential parsed addresses based on compliance with specifications. The local address component rules specification is applied to the input address to determine one or more branches of the parsing tree for which the input address matches criteria of the component rules specification. Penalties may be assigned to branches of the tree when disfavored matches occur.
    Type: Grant
    Filed: June 6, 2007
    Date of Patent: October 19, 2010
    Assignee: Pitney Bowes Software Inc.
    Inventors: John R. Biard, Freddie J. Bourland, II
  • Publication number: 20100241645
    Abstract: A system for integrating personal information search and interaction on web and desktop applications comprises enabling a user-interface (UI) component of an application for the entry of a query the UI component associated with context information. Entry of the query based on a natural language grammar is parsed to determine at least one natural language element. Element types associated with each natural language element are generated. A query command from a command list based on the natural language elements, the element types and the context information is interpreted. The query with arguments based on the natural language elements of the natural language query are executed to determine a result. The transformed result is output through said UI component by replacing said result for said query wherein outputting said transformed result comprises automatically adding email addresses, attachments and maps to said UI component.
    Type: Application
    Filed: March 18, 2009
    Publication date: September 23, 2010
    Applicant: International Business Machines Corporation
    Inventors: Eser Kandogan, Seonho Kim
  • Patent number: 7801908
    Abstract: A data mapping tool facilitates database engineer interaction with a data mapping document design system that facilitates creating the technical specification for migrating legacy databases. The data mapping tool provides a flexible selection of mapping modes, including a fully automated mode that resolves conflicts that may occur during the creation of the technical specification. The available modes also allow the database engineer to fully specify the intermediate staging tables used in the technical specification, and to request an partially automatic and partially interactive role over the execution of the data mapping document design system.
    Type: Grant
    Filed: December 31, 2007
    Date of Patent: September 21, 2010
    Assignee: Accenture Global Services GmbH
    Inventor: Alex George Zachariah
  • Patent number: 7797330
    Abstract: The present invention is provided with a text string/material correspondence table in which material data for creating computer graphics is associated with a set of the material names of material data, and a hierarchical structural description which describes a feature of material data in a hierarchical structure. Material data corresponding to the feature is searched using the hierarchical structural description when a feature is input, searched material data is stored, and searched material data and the material name of material data are registered with the text string/material correspondence table. Material data corresponding to the material name is acquired using the text string/material correspondence table when a material name is input, and computer graphics are created using acquired material data.
    Type: Grant
    Filed: January 26, 2005
    Date of Patent: September 14, 2010
    Assignee: Panasonic Corporation
    Inventors: Koichi Emura, Toshiyuki Tanaka, Yuji Okada, Katsunao Takahashi
  • Patent number: 7788275
    Abstract: An object-relational mapping mechanism facilitates customized relationship traversal. The mechanism can override default loading behavior with custom functionality (e.g., eager loading, lazy loading . . . ) specified by a programmer, for example. In other words, the object-relational mapping mechanism includes an extensibility point or hook for customization.
    Type: Grant
    Filed: September 18, 2007
    Date of Patent: August 31, 2010
    Assignee: Microsoft Corporation
    Inventors: Matthew J. Warren, Dinesh C. Kulkarni, Anders Hejlsberg, Henricus Johannes Maria Meijer