Abstract: Efficient data deduplication is described herein. A deduplication bit array partition can be created that corresponds to a number of data items in an expected dataset. The deduplication bit array partition can track whether the data items have been received. When a data item in the expected dataset is received, a bit in the deduplication bit array partition corresponding to the received data item can be accessed to determine, based on the value of the bit, if the received data item has already been received. When the value of the bit indicates that the received data item has not already been received, the value can be changed to indicate that the data item has now been received. When the value of the bit indicates that the received data item has already been received, the data item can be deleted or ignored.

Abstract: Scrolling of a large number of list items can be supported without degradation in performance. Instead of continually moving list items into an actively laid out representation of the list items, list items can be moved in and out of the actively laid out representation as scrolling progresses. Management of the actively laid out representation can be performed transparently to a user to maintain the impression that the total list is present. List items can be grouped into page units, which can be managed to keep a constant number of page units present in the actively laid out representation. Further enhancements can be accomplished by storing some list items remotely.

Abstract: Techniques for analyzing user engagement are provided. The techniques can include obtaining event records for one or more user activities, aggregating the event records to a temporal resolution, accumulating computed counts for each quantized time, and computing percentiles for the accumulated counts for each quantized time. The aggregating can include quantizing time to the temporal resolution; and computing counts for the event records for each quantized time. The one or more activities can be defined for one or more behavior classes.

Abstract: Disclosed herein is technology for providing sentiment analysis of content items. The technology involves labeling one or more portions of a content item and having the content item analyzed for sentiment. A graphical user interface may accept inputs from a user that indicate a portion of the content item should be labeled and the use may provide an associated sentiment for the item, e.g., positive, negative, or neutral. When a user has labeled a portion of a content item and provided an associated sentiment, the label and the sentiment are stored in a data store and the content items in the data store may be re-analyzed the content item to reflect the user's labeling and the changes are displayed in near real-time in the user interface.

Abstract: Techniques and tools are described for matching documents against monitors. An index can be generated from a plurality of monitors, where the index represents the query logic of the plurality of monitors. The index can be searched using the documents as search queries. The searching can comprise matching the documents against the monitors using the query logic represented in the index. An index can be distributed to a plurality of computing devices to be searched at the plurality of computing devices, where each computing device searches a subset of a plurality of documents against the full index. Searching at the plurality of computing devices can be performed in parallel, and results can be aggregated at a central location.

Abstract: Techniques and tools are described for performing distributed authentication using persistent stateless credentials. Distributed authentication can be performed during egress by obtaining a principal identifier, generating an expiration time, obtaining a secret key identifier that identifies a secret key, generating an initialization vector, encrypting the principal identifier and the expiration time to produce a ciphertext, creating a credential, and providing the credential for persistence at a client device. The credential comprises the ciphertext, the initialization vector, the secret key identifier.

Abstract: Entitlements to resources can be determined by using access rules that are organized as respective ranges in an entitlement space. An access rule can represent a range between two rational numbers in the entitlement space; the range can be represented by a single rational number. Due to the way the rational numbers are chosen, a child rule is completely covered by its parent, and a parent has remaining room in the entitlement space for unlimited additional children. Entitlement checking for a large batch of resources can be performed quickly based on reusing calculated permitted ranges in the entitlement space. Implied permissions can be supported. Content can easily be added, and the access rules can be modified without unduly impacting the underlying tree structure, if at all.

Abstract: Techniques and tools are described for augmenting search using association information. Searches can be performed using a combination of index information and association information. In some examples, index information is stored in a first data store and association information is stored in a second data store. Search queries can be received and modified using association information. Modified search queries can be executed using a combination of index information and association information. Index information can be generated by indexing a set of documents. Association information can be generated by monitoring user activity occurring between users and a set of documents.

Abstract: Entitlements to resources can be determined by using access rules that are organized as respective ranges in an entitlement space. An access rule can represent a range between two rational numbers in the entitlement space; the range can be represented by a single rational number. Due to the way the rational numbers are chosen, a child rule is completely covered by its parent, and a parent has remaining room in the entitlement space for unlimited additional children. Entitlement checking for a large batch of resources can be performed quickly based on reusing calculated permitted ranges in the entitlement space. Implied permissions can be supported. Content can easily be added, and the access rules can be modified without unduly impacting the underlying tree structure, if at all.

Abstract: Techniques and tools are described for producing time-series data using faceted search based on document creation time. For example, index information can be created from events (e.g., by adding meta-data and indexing the events as documents). In addition, index information can be created that maps document creation time to time ranges. Search queries can then be executed (e.g., comprising ad-hoc filters to filter on the meta-data), and search results can be faceted on the time ranges to produce time-series data. The time-series data can be graphed to display trends of activity (e.g., trends of events based on user activity).

Abstract: Techniques and tools are described for performing distributed authentication using persistent stateless credentials. Distributed authentication can be performed during egress by obtaining a principal identifier, generating an expiration time, obtaining a secret key identifier that identifies a secret key, generating an initialization vector, encrypting the principal identifier and the expiration time to produce a ciphertext, creating a credential, and providing the credential for persistence at a client device. The credential comprises the ciphertext, the initialization vector, the secret key identifier.

Abstract: Techniques and tools are described for matching documents against monitors. An index can be generated from a plurality of monitors, where the index represents the query logic of the plurality of monitors. The index can be searched using the documents as search queries. The searching can comprise matching the documents against the monitors using the query logic represented in the index. An index can be distributed to a plurality of computing devices to be searched at the plurality of computing devices, where each computing device searches a subset of a plurality of documents against the full index. Searching at the plurality of computing devices can be performed in parallel, and results can be aggregated at a central location.

Abstract: Techniques and tools are described for augmenting search using association information. Searches can be performed using a combination of index information and association information. In some examples, index information is stored in a first data store and association information is stored in a second data store. Search queries can be received and modified using association information. Modified search queries can be executed using a combination of index information and association information. Index information can be generated by indexing a set of documents. Association information can be generated by monitoring user activity occurring between users and a set of documents.