Abstract: In various example embodiments, a system and method for versioning data in an unstructured data store are presented. The method includes generating a first record in the unstructured data store based on a version of a second record in the unstructured data store. The method further includes initializing a parent version identifier of the first record based on the version of the second record. The method further includes comparing the parent version identifier of the first record to a version identifier of the second record. The method further includes determining whether the first record is consistent based on the comparison.

Abstract: Methods and systems to build and utilize a search infrastructure are described. The system generates, by a first indexing subsystem, full indexes of data and sends the full indexes to a plurality of query node servers via a distribution system. The system generates, mini-indexes associated with the full indexes and sends the mini-indexes to the plurality of query node servers. The system causes the plurality of query nodes to update indexing information based on the full indexes and the mini-indexes.

Abstract: Methods and systems to build and utilize a search infrastructure are described. The system generates index information components in real-time based on a database that is time-stamped. The system updates index information at a plurality of query node servers based on the index information components. A query engine receives a search query from a client machine and identifies search results based on the query and the index information. The system communicates the search results, over the network, to the client machine.

Abstract: In various example embodiments, a system and method for versioning data in an unstructured data store are presented. The method includes generating a first record in the unstructured data store based on a version of a second record in the unstructured data store. The method further includes initializing a parent version identifier of the first record based on the version of the second record. The method further includes comparing the parent version identifier of the first record to a version identifier of the second record. The method further includes determining whether the first record is consistent based on the comparison.

Abstract: Methods and systems to build and utilize a search infrastructure are described. The system generates, by a first indexing subsystem, full indexes of data and sends the full indexes to a plurality of query node servers via a distribution system. The system generates, mini-indexes associated with the full indexes and sends the mini-indexes to the plurality of query node servers. The system causes the plurality of query nodes to update indexing information based on the full indexes and the mini-indexes.

Abstract: A method to monetize multimedia queries is provided. The method includes receiving a multimedia query from a client device. In response, to the multimedia query a collection of thumbnails representing multimedia files is created. Position information for advertisement information is generated based on multimedia content included in the multimedia files. The position information specifies where the advertisement information should be displayed. Accordingly, advertisement information associated with advertisers that pay above a specified threshold is displayed with thumbnails of the multimedia content or with the actual multimedia content.

Abstract: Methods and systems to build and utilize a search infrastructure are described. The system generates index information, including document updates and indexes. The system receives event notifications as the document updates are received and accumulates the index information until published. A query engine receives a search query from a client machine and identifies search results based on the query and the index information. The system communicates the search results, over the network, to the client machine.

Abstract: Methods and systems to build and utilize a search infrastructure are described. The system generates index information components in real-time based on a database that is time-stamped. The system updates index information at a plurality of query node servers based on the index information components. A query engine receives a search query from a client machine and identifies search results based on the query and the index information. The system communicates the search results, over the network, to the client machine.

Abstract: Methods and systems to build and utilize a search infrastructure are described. The system generates index information components in real-time based on a database that is time-stamped. The system updates index information at a plurality of query node servers based on the index information components. A query engine receives a search query from a client machine and identifies search results based on the query and the index information. The system communicates the search results, over the network, to the client machine.

Abstract: Systems and methods to configure a query language using an operator dictionary are described. The system receives, from a first user, a search query to search for document information in a database. The system determines that terms of the search query from the first user are in accordance with dictionary information that corresponds to the first user. The dictionary information includes a first list of compatible query operators. The system applies the search query to the index data structure in the database to identify the document information. The system sends an electronic interface to the first user that includes the document information.

Abstract: Systems and methods to configure a query language using an operator dictionary are described. The system receives, from a first user, a search query to search for document information in a database. The system determines that terms of the search query from the first user are in accordance with dictionary information that corresponds to the first user. The dictionary information includes a first list of compatible query operators. The system applies the search query to the index data structure in the database to identify the document information. The system sends an electronic interface to the first user that includes the document information.

Abstract: A method and a system to configure a query language using an operator dictionary are provided. Dictionary information that corresponds to a first user is generated. The dictionary information includes a first list of compatible query operators and a description of compatible data types that correspond to each operator in the first list of query operators. A search query to search for document information in a database is received from a first user. The database includes an inverted index. Terms of the search query from the first user are determined to be in accordance with the dictionary information that corresponds to the first user. The search query is applied to the inverted index in the database to identify the document information. The document information is sent to the first user.

Abstract: An input query can be spell checked by first parsing the input query into one or more tokens. The one or more tokens are then compared against spell storage tables to derive alternative tokens. A spell cursor is launched, with the spell cursor calculating scores for permutations of the tokens and alternative tokens, and the scores representing a likelihood that a user intended to use the permutation as the input query. A memory table may then be formed including the permutations and scores. The memory table can then be passed to a column cursor, the column cursor designed to form an output table of results based on queries to a database using the permutations.

Abstract: A method and a system to configure a query language using an operator dictionary are provided. Dictionary information that corresponds to a first user is generated. The dictionary information includes a first list of compatible query operators and a description of compatible data types that correspond to each operator in the first list of query operators. A search query to search for document information in a database is received from a first user. The database includes an inverted index. Terms of the search query from the first user are determined to be in accordance with the dictionary information that corresponds to the first user. The search query is applied to the inverted index in the database to identify the document information. The document information is sent to the first user.

Abstract: Methods and systems to build and utilize a search infrastructure are described. The system generates index information, including document updates and indexes. The system receives event notifications as the document updates are received and accumulates the index information until published. A query engine receives a search query from a client machine and identifies search results based on the query and the index information. The system communicates the search results, over the network, to the client machine.

Abstract: A method and system to configure a profile to rank search results are provided. A profile that includes behavior information organized as a plurality of components is generated. Additional behavior information is received from a user. At least one component of the plurality of components is updated using the additional behavior information received from the user. A search query is received and search results are generated based on the search query. Search results are ranked based on the updated profile.

Abstract: Methods and systems to build and utilize a search infrastructure are described. The system generates index information components in real-time based on a database that is time-stamped. The system updates index information at a plurality of query node servers based on the index information components. A query engine receives a search query from a client machine and identifies search results based on the query and the index information. The system communicates the search results, over the network, to the client machine.

Abstract: An input query can be spell checked by first parsing the input query into one or more tokens. The one or more tokens are then compared against spell storage tables to derive alternative tokens. A spell cursor is launched, with the spell cursor calculating scores for permutations of the tokens and alternative tokens, and the scores representing a likelihood that a user intended to use the permutation as the input query. A memory table may then be formed including the permutations and scores. The memory table can then be passed to a column cursor, the column cursor designed to form an output table of results based on queries to a database using the permutations.

Abstract: Systems and methods to process a query with a unified storage interface are described. The system receives a query from a client machine and generates a query expression tree based on the query expression. The system generates a cursor expression tree based on the query expression tree. The system executes a plurality of software components in the cursor expression tree to retrieve data from a first storage device. The plurality of software components comprise a first software component that is utilized to retrieve data irrespective of a plurality of storage devices and a second software component that is utilized to retrieve data from a first storage device. Finally, the system communicates search results to the client machine, the search results include at least a portion of the data.

Abstract: A unique object navigation system, user interface, and method that facilitate faster and smoother navigation of objects are provided. For example, the system can generate a plurality of objects that can be rendered on a display space that spans a single page in length, thereby mitigating the need to navigate through multiple pages. The system can determine the length of the page according to the number of objects generated. To view off-screen objects, an infinite scroll component can be employed. The amount of scroll space needed to view the plurality of objects can be determined in part by the length of the page and/or by the number of objects. The objects can also be viewed in a film strip format that is infinitely scrollable. The film strip view allows a view of the objects to be maintained while also viewing a selected object in greater detail at the same time.