Abstract: Social data is used to extract actions that end users perform in order to provide deeplinks for search results. Social data from social networking services may be accessed and analyzed to identify actions performed by end users. Additionally, the social data may be analyzed to identify URLs of web pages at which the actions may be performed. Information regarding the actions and corresponding URLs is stored for use by a search engine service to provide deeplinks for search results returned in response to user search queries.

Abstract: A method, and associated system, for archiving to a single database table information located across multiple database tables. A threshold number of times specified by the end user and a period of time specified by the end user are received. At least one archival data value is identified. Each archival data value corresponds to a unique data value of at least one data value residing in a table of the multiple database tables. A determination is made that the specified threshold number of times has not been exceeded, within the specified period of time, by a number of times each archival data value has been moved within the multiple database tables. At least one archive file in the single database table is stored. Each archive file of the at least one archive file includes the at least one archive data value.

Abstract: Systems and method of the present invention provide for one or more server computers configured to identify, within a database transaction log, a dynamic website content in a database and a command modifying the dynamic website content, write the dynamic website content and the command modifying the dynamic website content to a website repository as a delta, receive a request to reverse the command modifying the dynamic website content, identify, within the delta, the command modifying the dynamic website content, and generate and execute a database query configured to reverse the command modifying the dynamic website content.

Abstract: A datastore that includes property listings (e.g., for rental properties) may be accessed by a computing resource configured to execute a thumb printing algorithm to generate summary data values (e.g., thumbprint values, hash values) of digital data included one or more images of a property listing. The summary data values along with listing attributes (e.g., address, zip code, geolocation, brand, number of bedrooms/bathrooms/sleeps, amenities) of the property listing may be compared with summary data values and listing attributes of other property listings to determine if the summary data values of one or more images match and if one or more listing attributes match. A threshold number of image matches and listing attribute matches may indicate that the property listings are duplicate property listings, which may be merged, removed or replaced with links/pointers by the computer resource to increase data storage space and/or reduce data search latency times of the datastore.

Abstract: A method is disclosed for generating event trees. The method includes receiving one or more events occurring within a networked computing environment. The method includes generating an event tree including the received one or more events. The method includes comparing the generated event tree with a plurality of event trees stored in a database. The method then includes assigning, based, at least in part, on the comparing, a probability to the generated event tree.

Abstract: A computing system for representing information, the computing system including at least one processor configured to process information. The processing includes defining a data structure representing a hierarchy of at least one programming attribute for developing an application. The data structure is stored in a file to allow the data structure to be used by other data structures stored in other files. The processing also includes producing a visual diagram including a graphical representation of the data structure and a graphical representation of the file storing the data structure. The visual diagram also includes a graphical representation of a relationship between the data structure and another data structure and a graphical representation of a relationship between the file storing the data structure and another file storing the other data structure.

Abstract: In an index-only multi-index access in a database, when a query to be executed requires multiple indexes, a query optimizer determines whether columns are needed for a query result, subquery, or inner join result. If not, then the query result is resolved using qualified record identifiers (RIDs) from the multiple indexes without accessing the data pages. When the columns are needed and can be resolved using input values of the query, then the query result is resolved using the qualified RIDs from the multiple indexes and substituting column values with the input values of the query. When the columns are needed and cannot be resolved using the input values of the query, the query optimizer may store one or more index keys with its corresponding qualified RIDs from the multiple indexes and may resolve the query result using the stored index keys without accessing the data pages of the database.

Abstract: Embodiments relate to generating database sequences in a replicated database environment. An aspect includes providing a group of nodes each hosting an instance of a replicated database, with one node in the group elected as a master node responsible for generating and distributing values for auto-generated values in a column or row of the replicated database. Another aspect includes dividing, by the master node, a sequence space of possible auto-generated values for the column or row into sub-ranges and assigning a sub-range to a particular node in the group of nodes. Another aspect includes distributing, by the master node, values of the assigned sub-range to a particular node of the group of nodes.

Abstract: In general, the subject matter described in this specification can be embodied in methods, systems, and program products. A score for each of a plurality of authors of posts submitted to a server system is determined. The score for each individual author in the plurality is based on a score of one or more authors in the plurality that have requested to subscribe to a stream of posts that the individual author submits to the server system. A particular post submitted by a particular author in the plurality is received at the server system and from a computing device. A score is assigned to the particular post based on a score of the particular author. The particular post is transmitted from the server system to computing devices that are associated with authors who have requested to subscribe to posts by the particular author.

Abstract: A join operation between split data tables includes providing value IDs. For each of the value IDs, a unique global ID may be associated with the value ID when the actual value represented by the value ID occurs among actual values comprising the second attribute of the second partition. For each identified unique global ID, the identified unique global ID may be paired with a document ID of a data record contained in a second partition stored at the second server in which the actual value in the data record is represented by the value ID associated with the identified unique global ID.

Abstract: Tools and techniques for collecting data from target systems without the need for installation of expensive and high-maintenance software agents on the target systems. In some cases, these tools can be used to collect performance data from collection targets while still allowing the operator(s) of the collection targets to govern the access of the tools, alleviating security concerns. Merely by way of example, certain tools employ data collection scripts, which may be analyzed by the collection target against security policies of that collection target, to ensure that the scripts will not take any actions that might violate such security policies. Other tools may be used to collect data in real time by transmitting a script for immediate execution by the host system, which could then return the data produced by the script immediately upon completion (and/or as part of execution of the script).

Abstract: In an index-only multi-index access in a database, when a query to be executed requires multiple indexes, a query optimizer determines whether columns are needed for a query result, subquery, or inner join result. If not, then the query result is resolved using qualified record identifiers (RIDs) from the multiple indexes without accessing the data pages. When the columns are needed and can be resolved using input values of the query, then the query result is resolved using the qualified RIDs from the multiple indexes and substituting column values with the input values of the query. When the columns are needed and cannot be resolved using the input values of the query, the query optimizer may store one or more index keys with its corresponding qualified RIDs from the multiple indexes and may resolve the query result using the stored index keys without accessing the data pages of the database.

Abstract: A computer-implemented method for adding active volumes to existing replication configurations may include (1) identifying a new volume to be added to an existing replication configuration that replicates a plurality of volumes to a remote storage device, (2) using interchangeable bitmaps to perform an initial synchronization of the new volume with the remote storage device before replicating the new volume to the remote storage device as part of the existing replication configuration, (3) determining that a replication log associated with the replication configuration is capable of flagging future writes by the application to the new volume without overflowing, and, upon making that determination, (4) replicating the new volume to the remote storage device as part of the existing replication configuration. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Aspects and implementations of the present disclosure are directed to methods of and systems for search lift remarketing. In general, in some implementations, a first content item is distributed to client devices and search lift attributable to the first content item is measured by examining subsequent requests received from client devices to which the first content item has been distributed as compared to requests received from similar client devices to which the first content item has not been distributed. Keywords benefiting from search-lift attributable to the first content item are used to determine when to send a second content item in response to requests from client devices in a select audience. In some implementations, requests are compared to identify a set of keywords invoked more frequently after presentation of the first content item where an increase in usage exceeds a threshold or otherwise indicates a statistical significance.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for performing transparent object migration across storage tiers. In an embodiment and by way of example, a method for appending data to large data volumes is provided. The method embodiment includes a) setting a CustomEntityOption bit that determines (at object creation time) where the object is stored, either in the relational or the non-relational data store portion, b) loading the CustomEntityOption bit in a cached CustomEntityDefinition, c) showing the CustomEntityOption bit as EntityInfo, and d) allowing custom object definition and Metadata API functionality when the bit is shown.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing a representation based on structured data in resources. The methods, systems, and apparatus include actions of obtaining search results for a search query. Each search result references a respective resource, the respective resources including a first resource and a second resource. Additional actions include determining a consistent value, that is consistent with both a value for a particular property as indicated by structured data in the first resource and a value for the particular property as indicated by structured data in the second resource. Further actions include in response to determining a consistent value, providing (i) a representation of the consistent value as a possible answer to the search query, and (ii) the search results.

Abstract: Transactional log data for a distributed database may be archived by a number of computing nodes scalable to a specified concurrency parameter. A log record may be mapped to a computing node for performance of an archiving operation. The log record may be stored with information indicative of a position, in a hierarchy of shards, of the shard from which the log record originated. The log record may be replayed in an order, relative to other records, that is based on the shard's position in the shard hierarchy. The log record may be replayed on a shard identified based on a time-invariant and idempotent hash function.

Abstract: Managing application interaction on a device using dynamic containers. A method includes, for a set of applications on a device, based on certain conditions, determining a plurality of container groups. Each container group defines a set of applications and a set of interactions parameters defining boundaries of interactions between the applications for the applications in the container group. The method further includes identifying one or more changes in the certain conditions. As a result of identifying one or more changes in the certain conditions, the method includes changing membership in the container groups.

Abstract: A social trust network is implemented in combination with a communication network capable of monitoring one or more parameters of communications. The social trust network includes a database containing trust data and possibly profiles of respective entities can be searched to return identities of entities such as subject matter experts with whom a user such as a decision-maker may wish to communicate; which communication may be facilitated by communication contact information corresponding to entities returned by the search. A plurality of trust metrics are computed from the trust data and search results are ordered based on a weighted sum of trust metrics, possibly including ratings of entities, where the relative weights may be manipulated at the will of the user. The monitored parameters of such communications are represented in data stored as trust data in a database which is thus adaptively developed through use of the social trust network.

Abstract: Disclosed embodiments relate to storing and accessing files. In an embodiment, a method includes writing a file to a writing a file to a storage device having a file system having a file allocation table (FAT). Writing the file includes allocating a plurality of clusters of the file system to the file, wherein at least a portion of the allocated clusters is contiguous. The FAT includes a plurality of cluster addresses corresponding to the allocated clusters. A signature value is stored in a cluster address corresponding to a first cluster of the contiguous clusters to indicate the presence of the contiguous clusters. In each of a set of consecutive cluster addresses succeeding the cluster address corresponding to the first cluster, a value that partially represents the number of the contiguous clusters is stored. The number of contiguous clusters is determinable by combining the values stored in the consecutive cluster addresses.