Abstract: A method, computer system, and/or computer program product shares state scope data among client devices in a cloud-based file synchronization service, where the client devices are intermittently connected to the cloud-based file synchronization service. In response to a first client device requesting a current version of shared state scope data from a second client device, the cloud-based file synchronization service transmits a request to the second client device for the updated shared state scope data. The updated shared state scope data is stored in the cloud-based file synchronization service, and then transmitted to the first client device.

Abstract: A method is provided in one example and includes generating a query for a database for information stored in the database. The information relates to data discovered through a capture system. The method further includes generating an Online Analytical Processing (OLAP) element to represent information received from the query. A rule based on the OLAP element is generated and the rule affects data management for one or more documents that satisfy the rule. In more specific embodiments, the method further includes generating a capture rule that defines items the capture system should capture. The method also includes generating a discovery rule that defines objects the capture system should register. In still other embodiments, the method includes developing a policy based on the rule, where the policy identifies how one or more documents are permitted to traverse a network.

Abstract: Systems and methods for the categorization of websites are presented. A website is categorized using one or a combination of its domain name and its web page content. The domain name is tokenized, and the tokens compared to categories in a category structure to determine probabilities that the token belongs to each category. Combinations of tokens are similarly compared to the categories. A category may be determined with reference to a vector space in which a training set of websites having known categories is converted according to a methodology into reference vectors containing keyword frequencies. A target website is converted to a target vector using the same methodology, and a distance score of the target vector to each reference vector is calculated. The website represented by the target vector is assigned the category of the reference vector having the lowest distance score.

Abstract: A relational database replication system includes a client, at least one primary database, a plurality of secondary databases and replication agents which coordinate database transactions. The system provides a high level of performance, reliability, and scalability with an end result of efficient and accurate duplication of transactions between the primary and secondary databases. In one implementation, the client transmits sets of database update statements to the primary database and primary agent in parallel; the primary agent replicates the statements to at least one secondary agent. A transaction prepare and commit process is coordinated between the primary database and the primary agent, which in turn coordinates with the at least one secondary agent.

Abstract: A method and system for automatically defining and applying an exception rule to reports created from at least one multi-dimensional database, comprising: defining global exception parameters, displaying at least one report created from a multi-dimensional database, receiving a user command to detect exceptional cells in the displayed report, locating the most relevant time dimension in the semantics of the source database of the report, detecting exceptional cells in the displayed report according to the exception parameters and the most relevant time dimension, calculating an exception quality for each detected exceptional cell, and indicating on the displayed report the exceptional cells, the indication comprising differentiating between different exception qualities, wherein the exception rule is independent of data granularity in the time dimension in the report.

Abstract: A method and system for index serialization are described. A data structure containing objects using globally unique identifier (GUID) strings for their identification is indexed by creating a unique key object for each GUID. A master lookup table from GUID to key object is created along with a master table for each element type and a number of non-master tables for the other element type attributes. These element type tables are accessed using the key objects. The tables may then be serialized and deserialized.

Abstract: Various embodiments provide a Web browser that employs a relevancy algorithm to make an educated guess as to the likelihood of a user's intended destination when the user begins to enter text into a browser's address bar. In one or more embodiments, the relevancy algorithm employs various parameters and assigns weights to the parameters to arrive at a collection of suggestions to provide to the user. By using various rules, associated weightings, and the relevancy algorithm, relevant suggestions can be provided to a user to facilitate their navigation activities.

Abstract: Techniques are described for identifying conflicts between an index of temporal keys and a prospective temporal key. The prospective temporal key specifies a prospective range of time. Embodiments scan the index to identify a first temporal key that potentially conflicts with the prospective temporal key. The first temporal key specifies a first range of time and is identified based on a comparison between the first range of time and the prospective range of time. Embodiments determine whether the prospective temporal key conflicts with any temporal keys in the index, where the prospective temporal key conflicts with the first temporal key if the first range of time overlaps with the prospective range of time and the first temporal key is not a pseudo-deleted key, and such that the prospective temporal key does not conflict with any temporal keys if the temporal key does not conflict with the first temporal key.

Abstract: An “operate with missing region” feature allows a cluster to continue servicing reads for available regions even when some regions are missing. Upon a given node failure condition, the cluster is placed in an effective read-only mode for all regions. The node failure condition typically is one where there has been a failure of an authoritative region copy and no backup copy is then available. Typically, “read-only” means no client write or update requests succeed while the cluster is in this state. Those requests should fail with an error message that indicates failure because of the read-only status. Preferably, such requests are re-tried. In this mode, regions are only allowed to perform read operations but the cluster continues to operate with missing regions, and missing regions are entered on a region map. The cluster then automatically recovers returning missing regions, after which it leaves the read-only state.

Abstract: A database system optimizes database queries that comprise subqueries. The database system factors out computation from two or more subqueries to a reusable subquery. The reusable subquery returns a result set. The subqueries are rewritten to use the result set and the database query modified to use the rewritten subqueries. The modified database query performs efficiently since the result set is computed only once for each subquery that uses the reusable query. The database system also composes nested subqueries that compute aggregate values. The database system identifies an inner subquery nested within an outer subquery, each subquery computing an aggregate value. The database system determines a new aggregate function corresponding to a composition of aggregate functions of the inner and the outer queries. The database system determines a composed query using the inner query with the outer query. The composed query uses the new aggregate function.

Abstract: A computer-implemented system and method for extracting Human Generated Lists from an electronic database is described. The system searches for objects of the same class within a context window to identify Human Generated Lists and stores them to an archive, The archive may be used to generate a relationship network. The system generates variable length data vectors to represent the relationships between the objects within each Human Generated List. This relationship network can then be queried to discover relationships between the objects in the Human Generated Lists and to provide related objects as recommendations.

Abstract: The saving device for image sharing includes an image acquiring unit configured to acquire the images offered by a sharer of the images, a sharee information storing unit configured to store sharee information with respect to at least one sharee, a subject assessing unit configured to assess whether or not a person subject is included in the acquired images, an image associating unit configured to associate the images assessed as not including a person subject with the images assessed as including a person subject, based on the sharee information, and a shared image determining unit configured to determine the images to be shared with the sharee or sharees from among the associated images and the images assessed as including a person subject, based on the sharee information. The image sharing system and an image sharing method use such a device.

Abstract: Embodiments are directed towards managing within a cluster environment having a plurality of indexers for data storage using redundancy the data being managed using a generation identifier, such that a primary indexer is designated for a given generation of data. When a master device for the cluster fails, data may continue to be stored using redundancy, and data searches performed may still be performed.

Abstract: Architecture that monitors interaction data (e.g., search queries, query results and click-through rates), and provides users with links to other users that fall into similar categories with respect to the foregoing monitored activities (e.g., providing links to individuals and groups that share common interests and/or profiles). A search engine can be interactively coupled with one or more social networks, and that maps individuals and/or groups within respective social networks to subsets of categories associated with searches. A database stores mapped information which can be continuously updated and reorganized as links within the system mapping become stronger or weaker. The architecture can comprise a social network system that includes a database for mapping search-related information to an entity of a social network, and a search component for processing a search query for search results and returning a link to an entity of a social network based on the search query.

Abstract: Delivering a search result is disclosed. A query is received. A term in the query that is a first portion of an abbreviation pair is identified. A second portion of the abbreviation pair is determined. A search result for the query is determined based at least in part on the second portion of the abbreviation pair and the search result is returned.

Abstract: According to various embodiments, techniques are described for managing data within a multi-site clustered data intake and query system. A data intake and query system as described herein generally refers to a system for collecting, retrieving, and analyzing data. In this context, a clustered data intake and query system generally refers to a system environment that is configured to provide data redundancy and other features that improve the availability of data stored by the system. For example, a clustered data intake and query system may be configured to store multiple copies of data stored by the system across multiple components such that recovery from a failure of one or more of the components is possible by using copies of the data stored elsewhere in the cluster.

Abstract: According to various embodiments, techniques are described for managing data within a multi-site clustered data intake and query system. A data intake and query system as described herein generally refers to a system for collecting, retrieving, and analyzing data. In this context, a clustered data intake and query system generally refers to a system environment that is configured to provide data redundancy and other features that improve the availability of data stored by the system. For example, a clustered data intake and query system may be configured to store multiple copies of data stored by the system across multiple components such that recovery from a failure of one or more of the components is possible by using copies of the data stored elsewhere in the cluster.

Abstract: A method, computer program product, and computing system for includes processing a log file to determine the location of one or more data files within a data environment. The log file indicates the occurrence of a data operation event within the data environment. A data operation is performed on at least a portion of the one or more data files located via the log file.

Abstract: A converged personal area network service system uses information provided by personal network elements (PNEs) to generate an event report file to store along with a data file to commemorate an event. When the data file is created, such as taking a picture, an event recording device sends requests to PNEs, sensors and other devices within the network to provide information corresponding to a timestamp based on the event. The information, if available, is sent to the event recording device, where it is aggregated. The event recording device generates an event report file that includes fields storing the information pertaining to the data file. The event report file is stored along with the data file for retrieval or use at a later time.

Abstract: Systems and methods for iteratively generating a partial column schema indicative of semantic relationships in a corpus of key-value data are disclosed. A set of textual values is extracted from a pre-existing corpus of key-value data and potential column names are generated. Value reassignment and potential column pruning proceeds based on semantic fit quality, potential column utilization and random factors influenced by a decreasing system temperature.