Abstract: A method and system for restoring a database are described. An identification of a restoration point of the database is received. Using a processor, metadata of a plurality of backups are analyzed to identify from the plurality of backups a reduced dataset required to restore the database to the restoration point. The reduced dataset is provided for use in restoring the database to the restoration point.

Abstract: Systems and method of the present invention are directed to data transfer systems and methods. Embodiments enable a user to access an electronic file to ascertain certain attribute data associated with one or more files, and allow the user to modify certain elements of the subject attributes file during the course of transferring the one or more files from a source location to a target or destination location.

Abstract: Methods, computer systems, computer-storage media, and graphical user interfaces are provided for facilitating data transformations, according to embodiments of the present invention. In one embodiment, a set of example values including example input values that indicate data values to be transformed and example output values that indicate a desired form in which to transform data. Based on the set of example values, a data transformation function that is relevant to the set of example values is identified. The data transformation function is used to generate a transformation program to transform the example input values to the desired form in which to transform data. A suggestion of the transformation program can be provided to a user device, wherein selection of the transformation program suggestion results in a data transformation.

Abstract: A system and method are disclosed for the collection and aggregation of data from contributing members of a community, such as health-related, personal, genomic, medical, and other data of interest for individuals and populations. Contributors become members of a community upon creation of an account and providing of data or files. The data is received and processed, such as to analyze, structure, perform quality control, and curate the data. Value or shares in one or more community databases are computed and attributed to each contributing member. The data is controlled to avoid identification or personalization. Steps are taken to determine incompleteness and incorrectness of the data, and the data may be improved or completed automatically, based upon interaction with members, additional contributions of data, and so forth.

Abstract: Disclosed in some examples are methods, systems, devices, and machine readable mediums for calculating an entity potential score for an entity that meets a defined entity selection criteria. The entity potential score quantifies an estimated likelihood that the entity will be successful in a predetermined timeframe by meeting predefined entity success criteria. Information on the entity may be determined (e.g., employee information, industry, financial information), various component subscores may be calculated and an entity potential score may be calculated for the entity. This entity potential score may be presented to one or more members of the network accessible computer-based service. For example, the entity potential score may be displayed along with a web-page describing the entity. The entity potential score may be searchable such that a user may specify a maximum, minimum, or range of entity potential scores as a search criteria for a search for entities.

Abstract: Techniques to store graph information in a database are disclosed. In various embodiments, each node in a graph may be modeled as a micro b-tree. Node identity, attribute, edge, and edge attribute data may be stored in one or more pages modeled on page formats typically used to store index data for a relational database index. Data associated with a plurality of nodes and edges, each of said edges representing a relationship between two or more of said nodes, may be received. For each node, one or more pages of data may be created, each corresponding to a prescribed page size associated with a storage device in which said one or more pages are to be stored, and each page having a data structure that includes a variable-sized set of fixed length data slots and a variable-sized variable length data region.

Abstract: Systems for database query processors. In a method embodiment, processing commences upon receiving a first set of a plurality of database language queries that reference a normalized column in an RDF table and that also includes a JOIN clause that references both the normalized column in the RDF table and a corresponding lookup table (e.g., a denormalization dictionary) that contains both normalized RDF data and denormalized RDF data. An in-memory table is allocated and formatted to comprise virtual columns that correspond to denormalized RDF data. Virtual columns of the in-memory table are populated with denormalized RDF data. In case of receipt of a SPARQL query, the incoming query is first translated into non-SPARQL database statements which are in turn recoded into database language statements that use lookup functions to lookup the denormalized RDF data from the virtual columns of the in-memory table rather than by incurring expensive disk I/O operations.

Abstract: A data block may be received. Hash values correspond to portions of the data block may be generated. A determination that none of the plurality of hash values matches with another hash value associated with a previously received data block may be made. In response to determining that none of the plurality of hash values match with the other hash value associated with the previously received data block, a subset of the plurality of hash values may be stored based on a first alignment and a second alignment.

Abstract: The present teaching relates to committing transactions over a database in a semi-distributed manner. In one example, a transaction is executed to access a plurality of keys stored in the database. A request is transmitted to a transaction management engine to commit the transaction. The transaction management engine performs a conflict check between the transaction and one or more transactions running concurrently with the transaction, and generates an instruction based on the conflict check. The instruction is received from the transaction management engine. Based on the instruction, one or more of the plurality of keys are updated in the database or data added by the transaction to the database are erased.

Abstract: An online system ranks topic-groups for users and presents content items in topic-based feeds. A topic group corresponds to one or more topic(s) and can be used to generate a feed for presenting the content items related to the topic(s). For a particular user, the topic groups are ranked according to the likelihood of the user interacting with content items included in the topic groups. The topic groups are ranked using information of the users and/or users' historical interaction data such as click-based interaction data, post-based interaction data, or engagement-based interaction data. The online system generates and provides a user interface for presenting the topic groups to the client device. Content items that are related to the topic(s) corresponding to the topic group are presented in each topic-based feed such that the user can switch between different topic-based feeds.

Abstract: A stream application receives a stream of tuples to be processed by a plurality of processing elements operating on one or more compute nodes. Each processing element has one or more stream operators. The stream application assigns one or more processing cycles to one or more segments of software code. The segments of software code are embedded in one or more tuples of the stream of tuples. The stream application determines that a condition is met based on the processing cycles. The stream application performs an operation based on the processing cycles.

Abstract: A method for receiving a first user query from a user for searching an item, forming a first filter based on the first user query, and forming a first filtered item collection is provided. The method includes predicting a new query based on the first user query and a historical query log, forming a second filter for the new query, and applying the second filter to the first filtered item collection to form a second filtered item collection. Further, associating an item score to each of a plurality of items in the first and second filtered item collections, sorting the plurality of items in the first and second filtered item collections according to the item score associated to each of the plurality of items, and providing, to a user display, an item in the plurality of items in the first or second filtered item collections according to a sorting order.

Abstract: A system includes a server device including a processor and a memory, the memory including instructions executable by the processor to: receive an indicator comprising an aggregation operation and an indicator criterion, wherein the indicator is included in the set of indicators; generate an indicator value associated with the indicator by applying the aggregation operation to a subset of the set of records identified using the indicator criterion; associate the subset of the set of records with the indicator value; apply a weight associated with the indicator to provide record weights associated with records of the subset of the set of records, wherein at least some of the provided record weights incorporate record weights provided based on other indicators of the set of indicators; and generate a priority list of records based on the record weights.

Abstract: A method executed by a computing device includes receiving a search criteria and location data from a user device in communication with the computing device, determining a user location based on the location data, and determining a geographical density of entities about the user location. The method optionally includes selecting one or more access mechanisms based on the search criteria and the geographical density. Each access mechanism, when executed by the user device, causes the user device to access a resource identified by the access mechanism. The method also optionally includes transmitting search results containing the one or more selected access mechanisms from the computing device to the user device.

Abstract: Various aspects of the subject technology relate to systems, methods, and machine-readable media for composition aware image querying. A system may receive user input identifying a search query for content from a client device, where the user input indicates one or more queries assigned to one or more regions of a search input page. The system may generate a query vector for each query using a computer-operated neural language model. The system may compare the query vector to an indexed vector for each region of an image. The system may determine a listing of composition-specific images from a collection of images based on the comparison. The system may determine a ranking for each image in the listing of composition-specific images, and provide search results responsive to the search query to the client device. The search results may include a prioritized listing of the composition-specific images based on the determined ranking.

Abstract: Examples disclosed herein relate to parallel transfers of electronic data. Some examples disclosed herein may include executing, by a processing node of a computation engine, a computation task among a plurality of computation tasks generated by the computation engine for transferring an electronic data table to a target table. The computation task, when executed by the processing node, may cause the processing node to transfer a segment of the electronic data table to a staging table, update a task status table upon completing the transfer of the segment to the staging table, in response to determining that the plurality of computation tasks have completed, update a last committer table with a task identifier associated with the computation task, and in response to determining that the last committer table includes the task identifier associated with the computation task, transfer the staging table to the target table.

Abstract: A query is received from a client that specifies at least one database operation implicating data within a first database and within a second database. The second database includes a document store storing a collection of documents. Thereafter, a plurality of transactions responsive to the query are initiated to access the data within the first database and the second database. Execution of the plurality of transactions are coordinated between the first database and the second database. All changes specified by the at least one database operation are persisted in the first database including changes implicating data stored within the second database. Data responsive to the query can then be provided to the client.

Abstract: Techniques for searching for generating and using an online activity index for users of an online service are disclosed herein. In some example embodiments, for each one of a plurality of dimensions of online activity for an online service, the system determines a corresponding value for each one of a set of one or more activities corresponding to the dimension for a user of the online service, with the value representing a level of engagement by the user in the corresponding activity via the online service. The system generates a corresponding activity index for each one of the dimensions based on the corresponding value for each one of the set of one or more activities corresponding to the dimension. The system generates content based on the corresponding activity index of at least one of the dimensions, and causes the content to be displayed on a device associated with the user.

Abstract: A scoped search engine is disclosed. The scoped search engine includes a memory unit storing reference data records. The scoped search engine also includes a data comparison unit that searches the reference data records using different searches. The scoped search engine further includes a match analysis unit that combines result data from the different searches and determines a scope for a subsequent search based on the combined result data.

Abstract: A distributed file system includes metadata servers and data servers. The metadata server includes a selecting unit to select a data server from the data servers, a chunk allocation requesting unit to request that the selected data server perform chunk allocation, a chunk list managing unit to insert a list of chunks transmitted from the data server into a chunk list pool and determine an arrangement method of the chunk list pool, and a chunk fetching unit to fetch available chunk information from the chunk list pool. The data server includes a receiving unit to receive request for chunk allocation from the metadata server, a chunk allocating unit to allocate chunks in response to the request for chunk allocation and write a list of chunks based on information about the allocated chunk, and a transmitting unit to transmit the list of chunks to the metadata server.