Abstract: Social grouping using a device may include determining, by the device, a set of attributes associated with interactions between a user and a set of contacts, wherein the set of attributes associated with the interactions is related to the device. The contacts may be organized into groups. The groups may be hierarchically ordered with at least one of the groups being a subgroup of another one of the groups.

Abstract: The present invention discusses a dashboard application that compiles values across a set of records, each of the records having fields which include data pertaining to user-defined criteria. The user enters a query into the system and the set of records is returns and analyzed according the criteria. The results are numerical and are displayed in components of the dashboard. The component is a graph, bar graph, pie chart, etc. that appears in a user interface of the dashboard. A user can customize the application and define its component. Multiple users can view and subscribe to the dashboard and can select specific components to follow. Some components can have user-defined threshold values and can provide graphics displaying breakpoints of those values. When the system refreshes, or the user manually refreshes the dashboard, an alert is generated if the threshold value is traversed. The alert, including the component graphic, is posted in the subscriber's feed and a feed of the dashboard.

Abstract: Disclosed are methods, apparatus, systems, and computer program products for provisioning log file data. To provision the log file data, a server can parse through log files by identifying particular log entries and data fields. Customer-facing log files can be generated based on the identified log entries and data fields. A customer-facing log file has log file data specific to a particular customer, which can be a tenant of a multi-tenant database system. A security mechanism can be configured to prevent one tenant from accessing the customer-facing log file of another tenant of the multi-tenant database system.

Abstract: Embodiments are directed towards a graphical user interface identify locations within event records with splittable timestamp information. A display of event records is provided using any of a variety of formats. A splittable timestamp selector allows a user to select one or more locations within event records as having time related information that may be split across the one or more locations, including, information based on date, time of day, day of the week, or other time information. Any of a plurality of mechanisms is used to associate the selected locations with the split timestamp information, including tags, labels, or header information within the event records. In other embodiments, a separate table, list, index, or the like may be generated that associates the selected locations with the split timestamp information. The split timestamp information may be used within extraction rules for selecting subsets or the event records.

Abstract: Various embodiments for indexing documents in a computing device are disclosed such that a search engine can perform queries to retrieve relevant portions of a document in a computationally-efficient manner. A document structure and a document layout are extracted from a document, where the document structure defines a logical structure of content of the document, and the document layout defines a visual layout of the content of the document. A search index can be populated using the document structure and the document layout. When a search query is performed, the search results can be ranked by relevance, for example, based on a role of a user account, such that more relevant documents can be presented before less relevant documents.

Abstract: A method and device relate to prioritizing content items stored on a device and, more particularly, relate to automatically ordering highest priority content items stored on a device according to multiple criteria. The method and device enabling presentation, on a display of the device, the high priority content items in order of their total priority.

Abstract: Changes to data in a column in an in memory array resulting from operations of a transaction thread can be written to a database object associated with the column. The database object can be marked for materialization upon completion of all of the plurality of operations of the transaction thread such that the column and the changes are materialized from the in-memory array to one or more pages stored on a persistent storage based on the marking.

Abstract: A data extraction and analysis system and tool is disclosed herein. The data extraction and analysis system and tool can include memory containing a comparison database, a factor database, and a model database that can include a multilevel model. The data extraction and analysis system and tool can include a content management server. The content management server can receive a request identifying a species and a variable and can retrieve data to generate a statistical model. Based on the statistical model, the content management server can identify and recommend an option to the requestor.

Abstract: The present subject matter relates to entity resolution, and in particular, relates to providing an entity resolution from documents. The method comprises obtaining the plurality of documents from at least one data source. The plurality of documents is blocked into at least one bucket based on textual similarity and inter-document references among the plurality of documents. Further, within each bucket, a merged document for each entity may be created based on an iterative match-merge technique. The iterative match-merge technique identifies, from the plurality of documents, at least one matching pair of documents and merges the at least one matching pair of documents to create the merged document for each entity. The merged documents may be merged to generate a resolved entity-document for each entity based on a graph clustering technique.

Abstract: In an example embodiment, a first data change and a second data change to data stored in a distributed database are received. The first data change and the second data change are batched in a communication to an index manager. The distributed database is reindexed based on the first data change and the second data change by creating a revised first shard index for a first shard in the distributed database and a revised second shard index for a second shard in the distributed database. The first shard and the second shard are instructed to update respective shard indexes. Confirmation that the first shard index has been updated is received. Then confirmation that the second shard index has been updated is received. In response to both of the confirmations, both the first shard and the second shard are instructed to commit their respective updates.

Abstract: Methods, systems, and apparatus for receiving a request that includes a user identifier of a user that submitted a search query and an entity identifier of an entity that is referenced by the search query, identifying a plurality of knowledge elements that are related to the entity, identifying, in a consumption database, one or more items that have been indicated as consumed by the user and that are associated with the entity that is referenced by the search query, assigning rank scores to the plurality of knowledge elements, based at least on identifying the one or more items, selecting one or more of the knowledge elements from among the knowledge elements based at least on the rank scores assigned to the knowledge elements, and providing, in response to the request, information associated with the entity and the one or more selected knowledge elements.

Abstract: Systems, methods, and computer storage media having computer-executable instructions embodied thereon that return query completions are provided. A user of a computing device like a mobile phone may enter a prefix. In turn, the prefix and location information associated with the device are transmitted to a server device. The server device receives the prefix and location information. The prefix and the location information are matched with names and locations of entities stored in a database connected to the server device. The server device transmits query completion data to the mobile device. The query completion data includes one or more names that complete the received prefix. The names provided by the server device may be associated with entities that are within a threshold radius of the location information.

Abstract: An online booking system allows users to search and book listings of goods or services. When a user searches for listings, the listings are ranked and scored based on a number of factors including the location and the price of the listing, the number and quality of reviews and the number of successful prior bookings. In some situations, the listing scores overly skew the top ranking results to a particular region. The listing scores may be modified to address this skewing of results. When diversity in search results is desired, the listing scores are modified such that the top ranking results that are located in a diverse set of regions. When granular relevance of search results is desired, the listing scores are modified such that the top ranking results are located in regions that are more relevant to the search than the region to which the results are skewed.

Abstract: According to one exemplary embodiment, a method for finding an answer to a query from a table is provided. The method may include receiving the query and the table. The method may also include generating a hierarchical representation based on the received table, whereby the hierarchical representation comprises a primary tree and a secondary tree. The method may then include mapping the primary tree to the secondary tree. The method may further include generating a plurality of predicate triples in a semantic relationship form based on the primary tree and the secondary tree. The method may also include determining if a predicate triple within the plurality of predicate triples matches the query using query-side and table-side context and semantics. The method may then include adding the predicate triple within the plurality of predicate triples to a plurality of candidate answers based on determining that the predicate triple matches the query.

Abstract: Systems and methods described herein generally relate to storing and verifying data. In some embodiments, reference levels are generated according to time intervals, where the first reference level comprises a predetermined number of the time intervals, and where each of the time intervals of the remaining reference levels is comprised of a predetermined number of the time intervals of a previous reference level. Hashes of data can be created at the first reference level by performing a hashing function on the data in a time-sequenced manner. First reference level time interval hashes may be generated by performing the hashing function on the hashes of the data at each of the time intervals of the first reference level. Hashes for remaining reference level time intervals can be generated by performing the hashing function on the hashes of each of the time intervals of the previous reference level.

Abstract: Unit conversion methods and systems that use an auto-scaling algorithm to sort conversion results. A plurality of unit conversion results, which represent a conversion of an input value in an input unit, are sorted into a sorted list based on the scale of the values in the results and the sorted list is presented (e.g. displayed) to a user. In one embodiment, the sorting is done without regard to the units in the conversion results and values between zero and one are transformed before sorting.

Abstract: A method for implementing continuous data replication in a distributed computer system. The method includes receiving a forwarded data object write I/O from a data server. The method further includes examining attribute information of the data object to determine a consistency group for the data object. A replication policy is examined in view of the consistency group of the data object to determine a destination redundancy server. The data object write I/O is forwarded to the destination redundancy server for storage. An acknowledgment is then sent to the data server upon storage of the data object in the destination redundancy server.

Abstract: A graph representation is described that may be used for data extraction for a data repository. In one example, the graph representation defines an extraction dataset from an object. A selection from a user for a root node is received. Additional are presented for selection by the user based on fields and properties of the selected root node. The root node and selected additional objects are presented as a data graph. The selected objects are joined and presented in the data graph. Finally a dataset is extracted from the object-oriented database based on the data graph.

Abstract: A computer-implemented method includes receiving a search request at a central information provider, generating a query containing media-related terms relating to the search request, and submitting the query to a search engine having access to media-related search results, wherein the query is broader than the received search request, and transmitting media-related search results generated in response to the query by the search engine, to a remote device.

Abstract: A method of preserving file metadata associated with an edited file, performed on a client device, includes storing in a log information denoting a plurality of create, delete, and rename operations on one or more files in a file system, and determining when two or more operations denoted in the log, including an operation involving a first file and another operation involving a second file, comprise an atomic save of a respective file, the first file comprising a first version of the respective file, and the second file comprising a second version of the respective file, the first file and second file each having associated metadata. The method further includes associating a subset of the metadata of the first file with the second file, such that at least one of a globally unique file identifier and file access permissions associated with the first file become associated with the second file.