Google Inc.

Alon Yitzchak Halevy

Jayant Madhavan

Fei Wu

David H Ko

Hector Gonzalez

Anno Langen

Steven Euijong Whang

Eldar Sadikov

Sreeram Viswanath Balakrishnan

Rahul Gupta

Hazem Elmeleegy

Andrin Von Richenberg

Nitin Kumar Gupta

Cong Yu

Christopher Olston

Philip Korn

Sudip Roy

Andrin Von Rechenberg

Tuan Anh Cao

Neoklis Polyzotis

Petros Venetis

Christian S Jensen

Xiao Ling

Natalya Fridman Noy

Mohamed Yahya

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating a catalog for multiple datasets, the method comprising accessing multiple extant data sets, the extant data sets including data sets that are independently generated and structurally dissimilar; organizing the data sets into collections, each data set in each collection belonging to the collection based on collection data associated with the data set; for each collection of data sets: determining, from a subset of the data sets that belong to the collection, metadata that describe the data sets that belong to the collection, wherein the metadata does not include the collection data, and attributing, to other data sets in the collection, the metadata determined from the subset of data sets; and generating, from the collections of data sets and the determined metadata, a catalog for the multiple datasets.

Post-hoc management of datasets

Systems, methods, and computer-readable media are provided for searching a tabular database. According to certain embodiments, search parameters for searching a tabular database are received from a user device and a row of a tabular database that corresponds to the search parameters is determined. In certain embodiments, the row may be determined by comparing the search parameters with a plurality of stored exemplar search queries, each of the plurality of stored exemplar search queries comprising a search query associated with a row and a column of the tabular database. A column of the tabular database that corresponds to the search parameters is determined by comparing the search parameters with the plurality of stored exemplar search queries. In certain embodiments, at least one cell of the tabular database is determined. The determined cell may be located at the intersection of the determined row and the determined column. A data element associated with the at least one cell is sent to the user device for display.

Systems, methods, and computer-readable media for searching tabular data

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating an ontology of entity attributes. One of the methods includes extracting a plurality of attributes based upon a plurality of queries; and constructing an ontology based upon the plurality of attributes and a plurality of entity classes.

Identifying entity attributes

Systems and techniques are provided for generating a union table with from stitchable tables. Tables may be extracted from web pages to obtain extracted tables. Stitchable tables may be determined from the extracted tables. Hidden attributes for the stitchable tables may be extracted from the web pages from which the stitchable tables were extracted using segmentation of text for contextual data from the web pages into segment sequences, and alignment of the segment sequences. Iterative pairwise alignment may be used to align the segment sequences and obtain aligned segments. The stitchable tables may be joined into a union table. Hidden attributes from the aligned segments may be added to the union table. Headers for the hidden attributes in the union table may be labeled using a database of entities and class labels.

Synthesizing union tables from the web

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for extracting facts from a collection of documents. One of the methods includes obtaining a plurality of seed facts; generating a plurality of patterns from the seed facts, wherein each of the plurality of patterns is a dependency pattern generated from a dependency parse; applying the patterns to documents in a collection of documents to extract a plurality of candidate additional facts from the collection of documents; and selecting one or more additional facts from the plurality of candidate additional facts.

Extracting facts from documents

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for clustering query refinements. One method includes building a representation of a graph for a first query, wherein the graph has a node for the first query, a node for each of a plurality of refinements for the first query, and a node for each document in the document sets of the refinements, and wherein the graph has edges from the first query node to each of the refinement nodes, edges from the first query to each document in the respective document set of the first query, edges from each refinement to each document in the respective document set of the refinement, and edges from each refinement to each co-occurring query of the refinement. The method further includes clustering the refinements into refinement clusters by partitioning the refinement nodes in the graph into proper subsets.

Clustering query refinements by inferred user intent

Methods, systems, and apparatus, including computer program products, for generating aspects associated with entities. In some implementations, a method includes receiving data identifying an entity; generating a group of candidate aspects for the entity; modifying the group of candidate aspects to generate a group of modified candidate aspects comprising combining similar candidate aspects and grouping candidate aspects using one or more aspect classes each associated with one or more candidate aspects; ranking one or more modified candidate aspects in the group of modified candidate aspects based on a diversity score and a popularity score; and storing an association between one or more highest ranked modified candidate aspects and the entity. The aspects can be used to organize and present search results in response to queries for the entity.

Identifying query aspects

Systems and techniques are provided for receiving an input column and a search keyword and providing one or more suggested columns with which to merge the input column. A coverage score and a refinity score are calculated for potential columns based on the input column as well as a search score based on the search keyword. The one or more suggested columns may be determined based on the coverage score, refinity score, and/or the search score. The input column and/or a potential column may be modified based on a function and the modification may result in a plurality of modified input and/or potential columns. Coverage, refinity, and search scores may be calculated based on the modified columns.

Searching for join candidates

Aspects of the invention provide a service for data management and integration across a wide range of applications. Clustered computers may be arranged in a cloud-type configuration for storing and handling large amounts of user data under the control of a front-end management server. Communities of distributed users may collaborate on the data across multiple enterprises. Very large tabular data files are uploaded to the storage facilities. The data files are maintained as tables, and a composite table of related information is created and maintained in response to user queries. Different ways of visualizing the data are provided. Depending on the amount of information that can be displayed, features in a spatial index may the thinned for presentation. Spatial and structured queries are processing and results are intersected to obtain information for display.

Scalable rendering of large spatial databases

List information can be extracted into database tables. A number of fields are independently determined for items in list. A number of database table columns are determined from most common number of list item fields. New fields are determined for items with more fields than database columns. Null fields are inserted into items with fewer fields than database columns. Information from items having the same number of fields as database columns is written to database table rows. Information from each field is written to a corresponding database table column. Streaks of poorly matching cells in a database table row are determined. Streak cells are merged and new cells are determined. Null cells are inserted if number of new cells is less than number of cells in the streak. Information from the new cells is written to the table row and columns that define the streak.

Harvesting relational tables from lists on the web

A system and a method for ranking search results of local search queries. A local search query and a current location of a user are received. Next, two or more places that satisfy the local search query are identified, and for each respective place a corresponding distance from the current location of the user to the respective place is also identified. The two or more places are then ranked in accordance with scores that are based, at least in part, on popularity of the two or more places and the corresponding distances from the current location of the user, to produce a set of ranked places. The ranked set of places is then provided to the user.

Directions-based ranking of places returned by local search queries

Among other disclosure, a computer-implemented method of analyzing a form page for indexing includes identifying a form page that is configured for use in requesting any of multiple target pages. The form page includes multiple input controls. The method includes identifying at least one of the multiple input controls as being informative with regard to requesting the multiple target pages. The method includes updating an indexing record associated with the form page to reflect the identification.

Analyzing a form page for indexing

One embodiment of the present invention provides a system that facilitates searching through content which is accessible though web-based forms. During operation, the system receives a query containing keywords. Next, the system analyzes the query to create a structured query. The system then performs a lookup based on the structured query in a database containing entries describing the web-based forms. Next, the system ranks forms returned by the lookup, and uses the rankings and associated database entries to facilitate a search through content which is accessible through the forms.

Growing community of inventors

Los Altos, CA, United States of America

Alon Yitzchak Halevy