Abstract: A database system receives a database language query specifying a grouping clause and one or more aggregate result values. The database system generates a pre-aggregation table based on the query. The database system generates an ingest query configured to generate data for populating the pre-aggregation table and a completion query configured to processes data stored in the pre-aggregation table. The database system periodically receives a set of input records and executes the ingest query to generate a set of pre-aggregation records. The set of pre-aggregation records are combined with the pre-aggregation table. The database system executes the completion query on the data stored in the pre-aggregation table to generate a result set and sends the generated result set to the requestor of the results.

Abstract: A real-time analytical database system allows queries on data obtained from a transactional system that is frequently updated by the transactional system. The real-time analytical database system receives change logs from the transactional system. The change logs describe operations performed by the transactional system. The real-time analytical database system stores a plurality of indexes in a key-value store, each index comprising key-value pairs. A key of a key-value pair is obtained by combining field data describing a field of a document. The real-time analytical database system determines modifications to the key-value pairs of the key-value store corresponding to the operations of the transactional system as represented by the received change logs. The real-time analytical database system receives and processes queries using the plurality of indexes.

Abstract: A search system processes queries for accessing information stored in documents. A document comprises fields. The search system stores a plurality of indexes in a key-value store. Each index comprises key-value pairs. A key of a key-value pair is obtained by combining field data describing a field of a document. The value of each field is stored as an individual key-value in the key-value store. The search system receives a query requesting information stored in documents and specifying a search criteria. The search system builds a key-expression based on the search criteria and uses one or more indexes to find key-value pairs matching the key-expression. The search system finds the requested information based on the matching key-value pairs and provides the requested information to the query source.

Abstract: In one embodiment, a server receives a search query; determines search terms based on the received search query, each search term including a prefix and a suffix, both of which correspond to elements of a social graph; and sends search results matching the prefix and suffix of a search term.

Abstract: In one embodiment, a method includes receiving a search query by one or more computing devices. A set of data objects to search are identified, and then an operation is executed. The operation involves stepping through the set of data objects with a step size of N, and at each step determining whether the object is responsive to the query. If the end of the set is reached before Y data objects are determined to be responsive, and X or more data objects are determined to be responsive, then an estimate of the number of responsive data objects in the set is provided. Otherwise, N is modified and the operation is re-executed.

Abstract: This application is directed to an indexing system for graph data. In particular implementations, the indexing system uses a database index infrastructure that provides for flexible search capability to data objects and associations between data objects. Particular embodiments relate to an indexing system for storing and serving information modeled as a graph that includes nodes and edges that define associations or relationships between nodes that the edges connect in the graph.

Abstract: This application is directed to an indexing system for graph data. In particular implementations, the indexing system uses a database index infrastructure that provides for flexible search capability to data objects and associations between data objects. Particular embodiments relate to an indexing system for storing and serving information modeled as a graph that includes nodes and edges that define associations or relationships between nodes that the edges connect in the graph.

Abstract: This application is directed to an indexing system for graph data. In particular implementations, the indexing system uses a database index infrastructure that provides for flexible search capability to data objects and associations between data objects. Particular embodiments relate to an indexing system for storing and serving information modeled as a graph that includes nodes and edges that define associations or relationships between nodes that the edges connect in the graph.

Abstract: This application is directed to an indexing system for graph data. In particular implementations, the indexing system uses a database index infrastructure that provides for flexible search capability to data objects and associations between data objects. Particular embodiments relate to an indexing system for storing and serving information modeled as a graph that includes nodes and edges that define associations or relationships between nodes that the edges connect in the graph.

Abstract: In one embodiment, a server receives a search query; determines search terms based on the received search query, each search term including a prefix and a suffix, both of which correspond to elements of a social graph; and sends search results matching the prefix and suffix of a search term.

Abstract: An indexing system for graph data. In particular implementations, the indexing system provides for denormalization and replica index functionality to improve query performance.

Abstract: In one embodiment, a server receives a search query; the server determines search terms based on the received search query, each search term including a prefix and a suffix; for each of the search term, the server generates a first binary number based on the each search term's prefix and suffix, and accesses and retrieves search results of the each search term from data stores by hashing the first binary number; the server also aggregates search results of the respective search terms.

Abstract: In one embodiment, a server receives a search query; the server determines search terms based on the received search query, each search term including a prefix and a suffix; for each of the search term, the server generates a first binary number based on the each search term's prefix and suffix, and accesses and retrieves search results of the each search term from data stores by hashing the first binary number; the server also aggregates search results of the respective search terms.

Abstract: In one embodiment, a method includes receiving a search query by one or more computing devices. A set of data objects to search are identified, and then an operation is executed. The operation involves stepping through the set of data objects with a step size of N, and at each step determining whether the object is responsive to the query. If the end of the set is reached before Y data objects are determined to be responsive, and X or more data objects are determined to be responsive, then an estimate of the number of responsive data objects in the set is provided. Otherwise, N is modified and the operation is re-executed.

Abstract: A method and apparatus for maintaining an item-to-node mapping among nodes in a distributed cluster is provided. Each node maintains locally-stored system-state information indicating that node's understanding of which master nodes are alive and dead. Instead of employing a global item-to-node mapping, each node acts upon a locally determined mapping based on its locally-stored system-state information. For any two nodes with the same locally-stored system-state information, the locally determined mapping is the same. A node updates its locally-stored system-state information upon detecting a node failure or receiving a message from another node indicating different locally-stored system-state information. The new locally-stored system-state information is transmitted on a need-to-know basis, and consequently nodes with different item-to-node mappings may operate concurrently.

Abstract: An indexing system for graph data. In particular implementations, the indexing system provides for denormalization and replica index functionality to improve query performance.

Abstract: An indexing system for graph data. In particular implementations, the indexing system provides for denormalization and replica index functionality to improve query performance.

Abstract: An indexing system for graph data. In particular implementations, the indexing system provides for denormalization and replica index functionality to improve query performance.

Abstract: A method and apparatus for maintaining an item-to-node mapping among nodes in a distributed cluster is provided. Each node maintains locally-stored system-state information indicating that node's understanding of which master nodes are alive and dead. Instead of employing a global item-to-node mapping, each node acts upon a locally determined mapping based on its locally-stored system-state information. For any two nodes with the same locally-stored system-state information, the locally determined mapping is the same. A node updates its locally-stored system-state information upon detecting a node failure or receiving a message from another node indicating different locally-stored system-state information. The new locally-stored system-state information is transmitted on a need-to-know basis, and consequently nodes with different item-to-node mappings may operate concurrently.

Abstract: A computer-implemented method of generating a list of K most frequently accessed ones of a plurality of data blocks in a database may include steps of selecting the number K; building the list of K blocks by storing an identification of and maintaining a running count for up to selected K ones of the data blocks by iteratively carrying out a single step for each of the plurality of data blocks, the single step being selected from an incrementing step to increment the count, a decrementing step to decrement the count, an adding step to add a data block to the list and to set a count of the added data block and a replacing step to replace an existing data block of the list with a new data block and to set a count of the new data block, and providing the list of K most frequently accessed blocks.