Abstract: A classifier classifies data to identify a class of the data. Based on the identified class, at least one action to apply to the given data item is determined according to the data management policy, where the data management policy specifies a plurality of actions to apply for different classes of data items.

Abstract: A computer system for generating a user data store and analyzing the user data store comprises a memory and a processing circuit. The memory is configured to store a user data store comprising a plurality of graphs, each graph having a user identity node. The processing circuit is configured to, for each of the plurality of graphs: receive asset data representing an asset that a user has interacted with on a website; generate a first node representing the asset data and a first link coupling the first node to the user identity node of the graph; store the first node and first link as part of the graph; receive usage data representing user interaction with a website; generate a second node representing the usage data and a second link coupling the second node to the user identity node of the graph, wherein at least one of the first node and second node further represents opinion data for a product or evaluation data for a product; and store the second node and second link as part of the graph.

Abstract: A classifier classifies data to identify a class of the data. Based on the identified class, at least one action to apply to the given data item is determined according to the data management policy, where the data management policy specifies a plurality of actions to apply for different classes of data items.

Abstract: A computer system for generating a user data store and analyzing the user data store comprises a memory and a processing circuit. The memory is configured to store a user data store comprising a plurality of graphs, each graph having a user identity node. The processing circuit is configured to, for each of the plurality of graphs: receive asset data representing an asset that a user has interacted with on a website; generate a first node representing the asset data and a first link coupling the first node to the user identity node of the graph; store the first node and first link as part of the graph; receive usage data representing user interaction with a website; generate a second node representing the usage data and a second link coupling the second node to the user identity node of the graph, wherein at least one of the first node and second node further represents opinion data for a product or evaluation data for a product; and store the second node and second link as part of the graph.

Abstract: A technique enables intelligent retrieval of digital assets. The technique involves gathering metadata based on a scan of the digital assets. The gathered metadata includes metadata entries, each metadata entry identifying a particular digital asset and a particular set of digital asset properties of that particular digital asset. The technique further involves storing the digital assets in encrypted form within a digital asset repository of the electronic system after gathering the metadata, and updating a metadata database of the electronic system based on the metadata entries, the metadata database being distinct from the digital asset repository. Accordingly, while the digital assets are stored in the digital asset repository in encrypted form, specific digital assets within the digital asset repository are identifiable in response to a database search of the metadata database since the database search is able to use digital asset properties as searching criteria.

Abstract: A technique enables intelligent retrieval of digital assets. The technique involves gathering metadata based on a scan of the digital assets. The gathered metadata includes metadata entries, each metadata entry identifying a particular digital asset and a particular set of digital asset properties of that particular digital asset. The technique further involves storing the digital assets in encrypted form within a digital asset repository of the electronic system after gathering the metadata, and updating a metadata database of the electronic system based on the metadata entries, the metadata database being distinct from the digital asset repository. Accordingly, while the digital assets are stored in the digital asset repository in encrypted form, specific digital assets within the digital asset repository are identifiable in response to a database search of the metadata database since the database search is able to use digital asset properties as searching criteria.

Abstract: A digital data processing apparatus configured to selectively transfer data between a primary data storage element and an associated data file on a secondary data storage element. The apparatus includes a primary data storage element that stores data for access by one or more processes, as well as a non-volatile secondary data storage element. A directory stores attributes reflecting a state of one or more subsets of data in respective sets. During transfer of data between the primary data storage element and the secondary data storage element, the apparatus stores data corresponding to the attribute in a second file on the second storage element, in response to detecting the transfer and detecting the attribute indicates an atomic state corresponding to the first data.

Abstract: A digital data processing apparatus has a primary data storage element that stores data for access by one or more processes, as well as a secondary data storage element, e.g., a disk drive, for non-volatile data storage. A paging mechanism selectively transfers sets of data between the primary data storage element and an associated data file on the secondary data storage element. A directory stores “atomic” signals, or bits, each reflecting a state of one or more subsets of data in respective sets. The paging mechanism includes a page-out element that stores data from a subset of a set to the associated data file. During paging, the page-out element responds to data in the subset which are associated with the atomic state (as indicated by the atomic bit) for storing to an associated status file on the secondary data storage element attributes of the paged data. Those signals can be, for example, the atomic bits themselves.

Abstract: A digital data processing apparatus has a memory element that stores data for access by one or more processes, as well as a secondary storage element, e.g., a disk drive, for non-volatile data storage. A paging mechanism selectively transfers sets of data between the memory and an associated data file on the disk. A directory stores signals reflecting an attribute of one or more data in the set. The paging mechanism includes a page-out element that stores data from a subset of the set to the associated data file. During paging, that element responds to data in the subset which are associated with the attribute—as reflected by the directory—for storing to an associated status file on the disk that attribute.

Abstract: A digital data processing system and method with shared, distributed memory transfers data between corresponding data sets within memory. The digital data processing system includes a plurality of processing cells interconnected by a hierarchical network, at least some of the processing cells including a processor and a memory. Each memory provides storage space which is arranged in sets, with each set being capable of holding a plurality of data pages. At least one of the processing cells, as a first processing cell, includes a page distributor for determining when at least a first set in the associated memory has reached a predetermined storage commitment condition (for example, a filled condition). Under such a condition, the page distributor invokes a page-transfer element that selects a candidate processing cell from among the other processing cells and transfers one or more pages from the first set to a corresponding set in the candidate processing cell.

Abstract: A digital data processing apparatus includes a processing element that executes a process for generating requests for access to mapped data in a memory element. The apparatus also includes a fork/checkpoint-signalling element that generates "new-process signals" which delineate new time intervals. The apparatus responds to data requests generated by the process before the first new-process signal by accessing a requested datum as stored in a first set in memory. An address space manager responds to certain requests, e.g., for write access, in subsequent intervals for copying the requested datum from the most recent set in which it is stored to the current interval and, thereafter, accessing that copy. The manager responds to other requests, e.g., those for read-type access, by accessing the requested datum in the most recent set in which it is stored.