Patents by Inventor Luis Gravano
Luis Gravano has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20140081994Abstract: A method of retrieving content from one or more media content sites may include identifying one or more event features corresponding to an event, automatically generating, by a computing device, a first set of one or more queries based on the identified event features, running, by the computing device, at least a portion of the first set of queries against one or more media content sites to generate a first content dataset comprising one or more media documents that satisfy the queries, creating a query model for each query based on one or more results retrieved for the query in the first content dataset, evaluating each query model against one or more of the identified event features to identify a match, and performing one or more of the following: filtering the queries based on their associated match, and ranking the queries based on their associated match.Type: ApplicationFiled: August 9, 2013Publication date: March 20, 2014Applicant: THE TRUSTEES OF COLUMBIA UNIVERSITY IN THE CITY OF NEW YORKInventors: Hila Becker, Mor Naaman, Luis Gravano
-
Patent number: 8631010Abstract: A method may include obtaining, based on a content of a search query, one or more documents in a first language; identifying one or more documents in a second language that contain an anchor that links to the one or more documents in the first language, the second language being different than the first language; and translating one or more terms of the search query into the second language using content included in the one or more documents in the second language.Type: GrantFiled: May 18, 2012Date of Patent: January 14, 2014Assignee: Google Inc.Inventors: Luis Gravano, Monika H. Henzinger
-
Patent number: 8190608Abstract: A system performs cross-language query translations. The system receives a search query that includes terms in a first language and determines possible translations of the terms of the search query into a second language. The system also locates documents for use as parallel corpora to aid in the translation by: (1) locating documents in the first language that contain references that match the terms of the search query and identify documents in the second language; (2) locating documents in the first language that contain references that match the terms of the query and refer to other documents in the first language and identify documents in the second language that contain references to the other documents; or (3) locating documents in the first language that match the terms of the query and identify documents in the second language that contain references to the documents in the first language.Type: GrantFiled: June 30, 2011Date of Patent: May 29, 2012Assignee: Google Inc.Inventors: Luis Gravano, Monika H. Henzinger
-
Patent number: 7996402Abstract: A system performs cross-language query translations. The system receives a search query that includes terms in a first language and determines possible translations of the terms of the search query into a second language. The system also locates documents for use as parallel corpora to aid in the translation by: (1) locating documents in the first language that contain references that match the terms of the search query and identify documents in the second language; (2) locating documents in the first language that contain references that match the terms of the query and refer to other documents in the first language and identify documents in the second language that contain references to the other documents; or (3) locating documents in the first language that match the terms of the query and identify documents in the second language that contain references to the documents in the first language.Type: GrantFiled: August 31, 2010Date of Patent: August 9, 2011Assignee: Google Inc.Inventors: Luis Gravano, Monika H. Henzinger
-
Patent number: 7814103Abstract: A system performs cross-language query translations. The system receives a search query that includes terms in a first language and determines possible translations of the terms of the search query into a second language. The system also locates documents for use as parallel corpora to aid in the translation by: (1) locating documents in the first language that contain references that match the terms of the search query and identify documents in the second language; (2) locating documents in the first language that contain references that match the terms of the query and refer to other documents in the first language and identify documents in the second language that contain references to the other documents; or (3) locating documents in the first language that match the terms of the query and identify documents in the second language that contain references to the documents in the first language.Type: GrantFiled: August 30, 2006Date of Patent: October 12, 2010Assignee: Google Inc.Inventors: Luis Gravano, Monika H. Henzinger
-
Patent number: 7149735Abstract: A method of estimating selectivity of a given string predicate in a database query. In the method selectivities of substrings of various substring lengths are estimated. For example, the selectivity of substrings between length l (or some constant q) to the length of the given string predicate may be estimated. The method then selects a candidate sub string for each sub string length based on estimated selectivities of the substrings. The estimated selectivities of the candidate substrings are combined. The combined estimated selectivity of the candidate substrings is returned as the estimated selectivity of the given string predicate.Type: GrantFiled: June 24, 2003Date of Patent: December 12, 2006Assignee: Microsoft CorporationInventors: Surajit Chaudhuri, Venkatesh Ganti, Luis Gravano
-
Patent number: 7146358Abstract: A system performs cross-language query translations. The system receives a search query that includes terms in a first language and determines possible translations of the terms of the search query into a second language. The system also locates documents for use as parallel corpora to aid in the translation by: (1) locating documents in the first language that contain references that match the terms of the search query and identify documents in the second language; (2) locating documents in the first language that contain references that match the terms of the query and refer to other documents in the first language and identify documents in the second language that contain references to the other documents; or (3) locating documents in the first language that match the terms of the query and identify documents in the second language that contain references to the documents in the first language.Type: GrantFiled: August 28, 2001Date of Patent: December 5, 2006Assignee: Google Inc.Inventors: Luis Gravano, Monika H. Henzinger
-
Patent number: 7007039Abstract: In a database system, a method of maintaining a self-tuning histogram having a plurality of existing rectangular shaped buckets arranged in a hierarchical manner and defined by at least two bucket boundaries, a bucket volume, and a bucket frequency. At least one new bucket is created in response to a query on the database. Each new bucket is contained within at least one existing bucket and the new bucket becomes a child bucket and the existing bucket containing it becomes a parent bucket. The boundaries of each new bucket correspond to a region of the database accessed by the query and the frequency of the new bucket is a number of data records returned by the query. Buckets may be merged based on a merge criterion such as similar bucket density when the total number of buckets exceeds the predetermined budget.Type: GrantFiled: June 14, 2001Date of Patent: February 28, 2006Assignee: Microsoft CorporationInventors: Surajit Chaudhuri, Nicolas Bruno, Luis Gravano
-
Publication number: 20050027717Abstract: An organization's data records are often noisy: because of transcription errors, incomplete information, and lack of standard formats for textual data. A fundamental task during data cleansing and integration is matching strings—perhaps across multiple relations—that refer to the same entity (e.g., organization name or address). Furthermore, it is desirable to perform this matching within an RDBMS, which is where the data is likely to reside. In this paper, We adapt the widely used and established cosine similarity metric from the information retrieval field to the relational database context in order to identify potential string matches across relations. We then use this similarity metric to characterize this key aspect of data cleansing and integration as a join between relations on textual attributes, where the similarity of matches exceeds a specified threshold. Computing an exact answer to the text join can be expensive.Type: ApplicationFiled: April 21, 2004Publication date: February 3, 2005Inventors: Nikolaos Koudas, Divesh Srivastava, Luis Gravano, Panagiotis Ipeirotis
-
Publication number: 20040267713Abstract: A method of estimating selectivity of a given string predicate in a database query. In the method selectivities of substrings of various substring lengths are estimated. For example, the selectivity of substrings between length l (or some constant q) to the length of the given string predicate may be estimated. The method then selects a candidate sub string for each sub string length based on estimated selectivities of the substrings. The estimated selectivities of the candidate substrings are combined. The combined estimated selectivity of the candidate substrings is returned as the estimated selectivity of the given string predicate.Type: ApplicationFiled: June 24, 2003Publication date: December 30, 2004Applicant: Microsoft CorporationInventors: Surajit Chaudhuri, Venkatesh Ganti, Luis Gravano
-
Publication number: 20020198896Abstract: In a database system, a method of maintaining a self-tuning histogram having a plurality of existing rectangular shaped buckets arranged in a hierarchical manner and defined by at least two bucket boundaries, a bucket volume, and a bucket frequency. At least one new bucket is created in response to a query on the database. Each new bucket is contained within at least one existing bucket and the new bucket becomes a child bucket and the existing bucket containing it becomes a parent bucket. The boundaries of each new bucket correspond to a region of the database accessed by the query and the frequency of the new bucket is a number of data records returned by the query. Buckets may be merged based on a merge criterion such as similar bucket density when the total number of buckets exceeds the predetermined budget. The boundaries of a new bucket may be shrunk if the boundaries of the new bucket intersect any existing bucket boundaries.Type: ApplicationFiled: June 14, 2001Publication date: December 26, 2002Applicant: Microsoft CorporationInventors: Surajit Chaudhuri, Nicolas Bruno, Luis Gravano
-
Patent number: 5806061Abstract: A method for optimizing the cost of searches through a multimedia repository is disclosed where the repository contains a plurality of objects having at least two different attributes such as color in a newspaper photograph and text in the subtitle. The method comprises selecting a ranking expression, translating the ranking expression into resulting filter conditions and then optimizing the resulting filter conditions to perform the search. A database look-up step is included which determines the cost of performing searches over the various subconditions of the filter condition. The least costly subcondition is searched first to retrieve objects from the multimedia repository. The remaining subconditions are then evaluated on the retrieved objects using either a search step or probe step depending upon the determined cost to perform each. A further database look-up step predicts a grade of match necessary in the translated ranking expression to retrieve at least the number of objects requested in the search.Type: GrantFiled: May 20, 1997Date of Patent: September 8, 1998Assignee: Hewlett-Packard CompanyInventors: Surajit Chaudhuri, Luis Gravano
-
Patent number: 5444701Abstract: A method is for routing packets in parallel computers with torus interconnection networks of arbitrary size and dimension having a plurality of nodes, each of which contains at least 2 buffers per edge incident to the node. For each packet which is being routed or which is being injected into the communication network, a waiting set is specified which consists of those buffers to which the packet can be transferred. The packet can be transferred to any buffer in its waiting set which has enough storage available to hold the packet. This waiting set is specified by first defining a set of nodes to which the packet is allowed to move and then defining a candidate set of buffers within the defined set of nodes. Then, defining an ordering of the nodes across the network from smallest to largest. The buffers in each node are then classified into four classes.Type: GrantFiled: October 29, 1992Date of Patent: August 22, 1995Assignee: International Business Machines CorporationInventors: Robert E. Cypher, Luis Gravano