Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving an unstructured text query, identifying nodes and edges that correspond to n-grams of the text query, accessing a context-free grammar model, identifying grammars having query tokens that correspond to the identified nodes and edges, determining a score for each identified grammar, and then generating structured queries based on the identified grammars based on strings generated by the grammars.

Abstract: Systems and methods are disclosed for providing an explanation of an estimate for information missing from a data graph. An example method may include receiving a query that requests information for a first entity and receiving an estimate for the information, the estimate being based on a plurality of features of a joint distribution model. The method may include determining respective contribution scores for the plurality of features, selecting a quantity of the features with highest contribution scores, generating, using the selected quantity of features, an explanation for the estimate; and providing the explanation and the estimate as part of a search result for the query.

Abstract: One or more systems, devices, methods, and/or processes described can apply searches and/or filters to data of social networks with respect to one or more geographical locations, geospatial references, location-based contexts, and/or map-based references. One or more social networks can be queried with search and/or filter parameters and one or more geographic locations, and results received from the social network(s) can be based on the search and/or filter parameter(s) and the geographic location(s) and presented to a user on a map or other user interface. Location-based information (e.g., in advertisement, a promotion, a coupon, etc.) can be provided to corresponding computing devices that correspond to one or more results of the one or more queries of the social network media data sources associated with the search region.

Abstract: A method for retrieving information may include receiving, in a non-World Wide Web (WWW) corpus, a search query for a media author. Search results for the search query may be identified within the non-WWW corpus. A score for each of a plurality of media authors identified in the search results may be generated. The score for a corresponding one of the plurality of media authors may be based on a combined media popularity score for a plurality of media items authored by the corresponding one of the plurality of media authors. The search results may be ranked based on the generated score for each of the plurality of media authors.

Abstract: A social networking system generates a location store based on information received from its users. The location store includes entries having a physical location description and one or more terms associated with the physical location description. One or more entries associated with physical location descriptions within an area are identified. A local frequency of occurrence of each term in the identified entry is determined, and a global frequency of occurrence of each term in the identified entries within the location store is determined. Trending terms in the identified entries are determined based on the local frequencies and the global frequencies. Identified entries are compared to each other, with a score based on differing terms in compared entries and whether the differing terms are trending terms is generated. If a score is less than a threshold value, a combined entry is generated from the compared entries.

Abstract: A record within a destination virtual file is generated on a destination node of a distributed data storage system. The record comprises (i) a link directed to a partition of a source virtual file stored on a source node and (ii) partition criteria characterizing the partition. The source virtual file is mapped to a chain of linked pages stored in a page buffer of the distributed data storage system and the partitioning criteria is used by at least one of the source node and the destination node to identify data associated with the partition. A request is later received at the destination node to access data defined by the destination virtual file. Data is provided, in response to the request, from the partition of the source virtual file stored on the source node using the link and the partitioning criteria. Related apparatus, systems, techniques and articles are also described.

Abstract: A set expansion system is described herein that improves precision, recall, and performance of prior set expansion methods for large sets of data. The system maintains high precision and recall by 1) identifying the qualify of particular lists and applying that quality through a weight, 2) allowing for the specification or negative examples in a set of seeds to reduce the introduction of bad entities into the set, and 3) applying a cutoff to eliminate lists that include a low number of positive matches. The system may perform multiple passes to first generate a good candidate result set and then refine the set to find a set with highest quality. The system may also apply Map Reduce or other distributed processing techniques to allow calculation in parallel. Thus, the system efficiently expands large concept sets from a potentially small set of initial seeds from readily available web data.

Abstract: A system for reviewing role definitions includes a database that stores a plurality of roles. Each of the plurality of roles associates an identifier with at least one entitlement. The system also includes a second database that stores role review definitions. The review definitions define role review processes for the plurality of roles. The system further includes a processor that is in communication with the role database and the review definition database. The processor executes the role review processes defined by the review definitions at the appropriate times.

Abstract: Systems and methods for cladistics-based content searching, analysis, and/or diagrammatic representation of results in graphical user interface format for viewing by at least one user on a computer-type device or network, in particular for technology and patent-related content stored in at least one database.

Abstract: A server system having memory and one or more processors analyzes a first data request associated with a first application, where the analyzing includes determining whether the first data request is associated with a constraint-restricted portion of a schemaless datastore in which data operations are subject to a set of predefined constraints. In accordance with a determination that the first data request is associated with the constraint-restricted portion, the server system retrieves constraint information corresponding to the set of predefined constraints and processes the first data request in accordance with the constraint information, where the constraint information enables the set of predefined constraints to be applied to the first data request prior to execution of the first data request.

Abstract: Disclosed is a system for, and method of, supplementing an internet search. The disclosed techniques may be used to receive an initial internet search criteria entered by a user at an interface (such as a web site) to the internet search engine, identify an entity representation in a database that corresponds to the internet search criteria, and produce an enhanced internet search criteria that may incorporate both the initial internet search criteria and field values from the identified entity representation. The enhanced internet search criteria may be passed to the internet search engine in a manner that is transparent to a user.

Abstract: Systems and methods for providing relevant content may include applying a clustering algorithm to posts associated with a device identifier and labeled documents to cluster the unlabeled posts with the labeled documents to determine interests. Content related to the interests may be selected and provided to an electronic device associated with the device identifier.

Abstract: To inform a user that image data including an image of the user or the like is posted on a network, an information providing apparatus includes an acquisition unit for acquiring an action log including a history of a set of a user's positions and dates and times when the user was at the positions. The apparatus further includes a search unit for searching for image data that has been captured at a location and a date and time corresponding to a position of the user and a date and time included in the action log from image data posted on a network. The apparatus also includes a matching unit for detecting image data that includes an image relating to the user from pieces of image data found by the search unit.

Abstract: Technologies are generally described for providing a context-based content list for an electronic device. In some examples, a method performed under control of an electronic device may include gathering first information on or from one or more devices nearby the electronic device in response to a content file creation event on the electronic device; gathering second information on or from one or more devices nearby the electronic device in response to a content list creation event on the electronic device; calculating a similarity between the first information and the second information; and generating a content list based at least in part on the similarity between the first information and the second information.

Abstract: In one general aspect, a computer system can include instructions stored on a non-transitory computer-readable storage medium. The computer system can include a logging table generator configured to generate a logging table corresponding with an original table targeted for an upgrade, and a control table generator configured to generate a control table configured to store a version identifier for changes logged in the logging table. The computer system can include a change recorder configured to receive an indicator of a change to a record of the original table during execution of at least a portion of the upgrade of the original table, and a key recorder configured to store in the logging table a primary key identifying the record of the original table and the version identifier stored in the control table.

Abstract: A system gathers information on important and influential people and builds a social graph. The social graph can be processed to determine a likelihood that two persons know each other. The system takes into consideration a variety of factors when determining the likelihood two persons know each other. For example, it is more likely that two people who work at a small company know each other better than two people at a big company.

Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving an unstructured text query, identifying nodes and edges that correspond to n-grams of the text query, accessing a context-free grammar model, identifying grammars having query tokens that correspond to the identified nodes and edges, determining a score for each identified grammar, and then generating structured queries based on the identified grammars based on strings generated by the grammars.

Abstract: Systems, methods and computer program products for statement categorization and normalization are described herein. An embodiment includes a statement categorizer and a statement normalizer. The statement categorizer categorizes statements to reduce or even eliminate inconsistencies that may arise between primary and replicate databases as a result of executing certain statements. Categorized statements are normalized by the statement normalizer to generate normalized statements, which are provided to a replication server. Normalized statements assist replication server to regenerate a statement to be executed on a replicate database.

Abstract: A specific item within an item class is identified by defining sets of descriptor data from a training library. The collected descriptor data is grouped and organized into a hierarchical tree, where each leaf node is defined by relations between corresponding parts of the descriptor data. Registrable sets of descriptor data are then identified from a collection of registrable samples. The registrable sets of descriptors are sorted into the hierarchical tree. When an input sample to be identified is received, a test set of descriptor data is generated from the input sample. The test set is then sorted into the hierarchical tree. Each leaf node that receives a part of the test set provides a vote for the registered samples it contains. The registered sample with the most votes is deemed a match for the input sample.

Abstract: Disclosed herein are systems, methods, and non-transitory computer-readable storage media for a delayed secure deletion of files from a copy-on-write file system. A system configured to practice the method receives a change to a file, writes a copy of the file in a first block of a storage device, the copy including the change, determines whether the change meets a predetermined condition, adds an entry into a delayed secure deletion list when the change triggers the predetermined condition, the entry storing an address associated with the first block, and deletes the first block when another change to the file is received, wherein the another change triggers another predetermined event.