Abstract: Information describing a transaction is received and a set of hierarchical documents pertinent to the transaction are identified based at least in part on the received information. The set of hierarchical documents is pruned responsive to data describing documents that a user involved in the transaction has previously accepted. Information describing the pruned set of hierarchical documents is output for presenting the pruned set of hierarchical documents to the user involved in the transaction for acceptance as part of the transaction.

Abstract: Systems and methods for dynamically managed data retention are described. The system comprises a tiered framework having a plurality of namespaces. The namespaces are configured by a user to have selected data retention attributes. Data including a manifest may be received by the system, processed, and directed to a namespace based upon the manifest. Data storage partitions may be created automatically in association with a namespace, and the data partitions may be assigned partition attributes. Data in a storage partition may be migrated automatically to another namespace based on the partition attributes. Code necessary for creating storage partitions and migrating data is generated by the data management system.

Abstract: Upon receipt of a document request, a client assistant examines its cache for the document. If not successful, a server searches for the requested document in its cache. If the server copy is still not fresh or not found, the server seeks the document from its host. If the host cannot provide the copy, the server seeks it from a document repository. Certain documents are identified from the document repository as being fresh or stable. Information about each of these identified documents is transmitted to the server which inserts entries into an index if the index does not already contain an entry for the document. If and when this particular document is requested, the document will not be present in the server, however the server will contain an entry directing the server to obtain the document from the document repository rather than the document's web host.

Abstract: A system and method are described for progressively efficiently filtering and gathering netflow data. Flow records are analyzed to find out which keys (addresses, conversations, protocols etc) meet defined filter parameters. The netflow data is processed and a data structure of fixed size is continually maintained in order to facilitate efficient retrieval of the gathered netflow data.

Abstract: A method for providing per-user aggregation of content accessible via a personalized user site may generally include receiving a request for metadata and determining whether the requested metadata is expired. The method may further include returning at least a portion of queried metadata prior to verifying whether the metadata is expired. The method may then include querying a change log for metadata modifications. The method may further include, if metadata has been modified since a previous query, sending a query to a community site for metadata that meets change criteria. The method may also include receiving the changed metadata and returning the changed metadata to a content group container within the personalized user site.

Abstract: A distributed execution environment includes various resources, such as instances of computing resources, hardware resources, software resources, and others. A resource state viewing tool executing in conjunction with the distributed execution environment provides access to data regarding the state of each resource in the form of a resource page associated with the resource. The resource page for a resource might also include one or more annotations assigned to the resource by a user or by a component within the distributed execution environment. The annotations might have associated expiration data, such as an expiration time or event, which may be utilized to expire the annotations. The annotations might also have a namespace assigned thereto that is utilized when responding to requests to retrieve the annotations. The annotations might also have permissions assigned thereto that identify the rights of one or more users and/or components to read, modify, or delete the annotations.

Abstract: Systems and methods for data aggregation, targeting and acquisition are described. A method may receive data and storing the data in one or more source data tables and select one of the one or more source data tables. The selected source data table includes updated data fields. The method may also identify a plurality of destination data tables that need to be updated, in which each destination data table is linked to and contains an aggregation of a subset of data from the selected source data table, identify one or more data fields in the identified destination data tables that need to be updated with data from the updated data fields in the selected source data table, and determine using the processor, for each identified destination data table, a best aggregation source data table.

Abstract: Embodiments are directed towards a dynamic change evaluation mechanism, whereby items having a detected possible change are scheduled for re-evaluation for possible changes at a higher frequency than items detected to not have previously changed, while those items detected as not to have changed are dynamically scheduled for re-evaluation based on an evaluation backlog that may be in turn based, in part, on a time from when an item is assigned an expiration time to when the item is evaluated. In one embodiment, a possibly changed item may be assigned a new expiration time independent of the evaluation backlog. In another embodiment, if no change is detected, then the item may be assigned a new expiration time as a function of a previous expiration time and on the evaluation backlog.

Abstract: A system and method for data storage and removal includes providing databases and providing encryption keys. Each database is associated with a database time period and each encryption key is associated with an encryption time period. Data items are received and each data item is encrypted using the encryption key associated with the encryption time period that corresponds to a time associated with the data item. Each encrypted data item is stored in the database associated with the database time period that corresponds to the time associated with the data item. Each encryption key is deactivated at a predetermined time after the associated encryption time period ends. Each database is made irretrievable upon a determination that all of the encryption keys associated with the data items stored in that database have been deactivated.

Abstract: Data indicates characteristics of a user's multiple media files. The multiple media files are associated with a media library. At least one of the multiple media files matches content in a master media file. The content in the matching media file is of a quality that is lower than the quality of the master media file. The user can provide payment for access to the master media file and, if the user does so, the master media file is associated with the media library and the user is provided with access to the master media file.

Abstract: Systems and methods for dynamically managed data retention are described. The system comprises a tiered framework having a plurality of namespaces. The namespaces are configured by a user to have selected data retention attributes. Data including a manifest may be received by the system, processed, and directed to a namespace based upon the manifest. Data storage partitions may be created automatically in association with a namespace, and the data partitions may be assigned partition attributes. Data in a storage partition may be migrated automatically to another namespace based on the partition attributes. Code necessary for creating storage partitions and migrating data is generated by the data management system.

Abstract: Expired files in the deduplicating virtual media are selectively erased using a backup application for notifying a backup repository of which expired files are no longer required. The space of the expired files is reclaimed for reuse. Virtual space of the expired files is reserved for allowing the backup application to seek past the reclaimed space to subsequent data in the deduplicating virtual media.

Abstract: A first server identifies a second server connecting to a cluster of servers in a file system. The first server examines a file in a replication directory hierarchy in the second server. The file has not been accessed by a client application. The first server determines, prior to the file being accessed by the client application that the file on the second server has stale data and overwrites the stale data in the file on the second server with current data.

Abstract: A first storage server identifies a second storage server connecting to a cluster of storage servers in a file system. The first storage server locates a file in a replication directory hierarchy in the second storage server. The file has not been accessed by a client application. The first storage server determines, prior to the file being accessed by the client application, that the file on the second storage server has stale data and overwrites the stale data in the file on the second storage server with current data.

Abstract: A system, method and article of manufacture for managing, e.g., extracting and displaying, search condition result data, which has been modified since a previous search. Embodiments of the present invention associate search conditions and modification programs with unique identifiers (e.g., a keyword) and log every use of thereof. Thereafter, contextual relationships (e.g., where a search conditions and a modification program are linked to the same unique identifier) between the data modifications and search conditions are identified using search condition and modification program usage logs, and based on the contextual relationships, embodiments of the present invention extracts and displays the result data that has been modified since the search condition was last executed.

Abstract: A SEQUENCED request a) to apply a temporal Source table to a temporal Target table under a predicate is received. The Source table includes a plurality of rows that qualify to apply to a single Target table row under the predicate. The predicate specifies a Source table join column. Each of the plurality of Source table rows and the single Target table row include a ValidTime dimension. The plurality of Source table rows is b) ordered by the Source table join column and a period-to-be-modified. The next of the ordered plurality of Source table rows is c) applied by determining that the Target table row has a TransactionTime and, in response, closing out the TransactionTime of the Target table row. Applying the next of the ordered plurality of Source table rows includes identifying an RDIFF range as the period-to-be-modified of the Source table row being applied that is later than the ValidTime range of the single Target table row.

Abstract: Apparatuses, computer readable media, methods, and systems are described for provisioning of databases, which may include processing a request to generate a database, wherein the request comprises a database parameter; determining a lease term for the database; generating the database based on the database parameter; and communicating a notification containing information regarding the database and the lease term.

Abstract: A disclosed method for implementing time decay in the analysis of streaming data objects is based on the age, referred to herein as the forward age, of a data object measured from a landmark time in the past to a time associated with the occurrence of the data object, e.g., an object's timestamp. A forward time decay function is parameterized on the forward age. Because a data object's forward age does not depend on the current time, a value of the forward time decay function is determined just once for each data object. A scaling factor or weight associated with a data object may be weighted according to its decay function value. Forward time decay functions are beneficial in determining decayed aggregates, including decayed counts, sums, and averages, decayed minimums and maximums, and for drawing decay-influenced samples.

Abstract: According to one embodiment of the present invention, a system, method and computer program product is provided for integrating an external workload manager with a database system. The method according to one embodiment includes a method comprises: receiving a request in a database component, the request including a cross component token; starting a new unit of work in workload management software in the database component, in response to the request; determining, from a cross component workload management unit, a transaction class and a synchronization code using the database component; finding an internal workload in the workload management software that matches the transaction class and the synchronization code of the cross component workload management unit; and using the matching internal workload for the new unit of work.

Abstract: Extending a plurality of manageability capabilities of manageable information technology (IT) resources utilize an “aspect of” association for describing a relationship between a first object representing a manageable resource playing a role of a subject and one or more additional objects each playing a role of an aspect. The “aspect of” association establishes an overall manageability function for the first object representing a manageable resource and the one or more additional objects as a logical composition of a plurality of manageability capabilities. The manageability capabilities are provided using distinct implementation classes for supporting a specific role, and for supporting management-discipline related aspects and behaviors needed by each of a plurality of resource management applications for managing the manageable resource. The one or more additional objects have an aspect life cycle that is bounded maximally by a subject lifecycle of the first manageable resource.

Abstract: Apparatuses, systems, and methods are disclosed for data expiry. A method includes examining metadata associated with data in a non-volatile recording medium. A method includes expiring data from a non-volatile recording medium in response to metadata indicating that an expiration period for the data has been satisfied.

Abstract: Indexes for predefined search orders of items in a database are generated and stored. When a client issues a database query a responsive pre-generated index list is retrieved and provided to the client for use in, e.g., populating a U/I view for a user. Only those items that a client needs, e.g., for populating a current U/I view, are retrieved from the database and output to the client. When a change is rendered to the database, e.g., an item is added or deleted or an existing item is altered, only the change is output to the client, rather than the entire modified index or altered item. In this manner clients can more quickly and efficiently respond to user data query requests by performing some processing upfront and by limiting communications traffic to communications relevant to the client's current processing.

Abstract: The present disclosure describes systems and methods for managing and implementing an asset license reclamation program across a network. The status of an asset, such as computer software, is automatically determined and if the asset does not meet particular use criteria, the asset may be flagged for reclamation and/or redeployment, either within the same network segment or in a separate network segment.

Abstract: Embodiments are directed towards a dynamic change evaluation mechanism, whereby items having a detected possible change are scheduled for re-evaluation for possible changes at a higher frequency than items detected to not have previously changed, while those items detected as not to have changed are dynamically scheduled for re-evaluation based on an evaluation backlog that may be in turn based, in part, on a time from when an item is assigned an expiration time to when the item is evaluated. In one embodiment, a possibly changed item may be assigned a new expiration time independent of the evaluation backlog. In another embodiment, if no change is detected, then the item may be assigned a new expiration time as a function of a previous expiration time and on the evaluation backlog.

Abstract: Roughly described, a database accelerator is installed in a network having client systems which makes database queries to a particular IP address and port, and database servers which accept queries received at an IP address and port. The accelerator includes a cache, and is arranged to receive, through a network port, a database query made by a client system and directed to the particular IP address and port, return response data from the cache if available there, and if not, then forward the query through a network port to the database servers. Upon receipt of response data from the servers, the accelerator can retain it in its cache in addition to forwarding it back to the client. By installing the accelerator transparently in the network, no changes are required to either the client or server software in order to add query caching functionality to an existing client/server database arrangement.

Abstract: A method for deleting data sets contained in a data list from a table system comprises the following steps, said steps being carried out for all data sets of said data list: reading one data set; checking whether said read data set has a specified property; if said data set has said specified property: deleting said data set in said first table; and substituting the contents of said data set in said second table by a blank data set. Furthermore, there is provided a computer program product and a device.

Abstract: Writing data in a distributed database having a plurality of nodes is disclosed. Writing includes receiving a write request at a node, wherein the write request is associated with one or more operations to define an atomic transaction and performing the atomic transaction based on the request. The atomic transaction includes writing to a first version of the database in the node and writing to an entity representative of a state of the first version of the database.

Abstract: Methods and systems for seamless context transfers include receiving a context object from one or more applications, where the context object including updated context information for a user having an associated timestamp; entering the updated context information into a context information database; determining entries of the context information database for the user having a timestamp older than a predetermined threshold using a processor; purging the determined entries from the context information database; and sending an updated context object to one or more applications that reflects a current state of the context information for the user.

Abstract: A server arrangement for facilitating the exchange of content between a plurality of user system associated with a common group is provided by employing a centralized server for directing publishing and extracting of content and a plurality of associated servers for facilitating the transmission of content between the user systems. A publisher is directed by the central server to a specific data server where content is to be provided. A consumer is directed by the central server to a specific data server from which content is to be extracted. The system is particularly adept for facilitating the exchange of video data between members of a common group coupled to the Internet.

Abstract: A diagnostic system includes one or more processors for executing machine-executable instructions and one or more machine-readable storage media for storing the machine-executable instructions. The instructions include a plurality of traces. Each trace is a trace of events executing on a computing system. The system also includes processing logic configured to partition data in the trace into a first trace independent component which includes trace-independent information and a second trace dependent component which includes trace instance information. The system further includes a memory for storing the first trace independent component in a first data structure and the second trace dependent component in a second data structure.

Abstract: Content items are revealed to a user based on whether they have been previously reviewed by the user. A number of content items are thus received over time. The content items may be discrete content items, or may be portions of a content stream, and may be received over different media. For each content item, it is determined whether the content item was previously reviewed by a user. Where the content item was not previously reviewed, the item is revealed to the user, such as by being displayed or announced to the user. Where the content item was previously reviewed, the item is hidden from the user, such as by being deleted, by being replaced with an alternative content item, and so on.

Abstract: A method of controlling the retention of publications in a publish/subscribe system, the method comprising receiving, at a message broker, a first publication from a publisher on a topic; receiving, at the message broker, a second publication from the publisher on the topic; identifying, at the message broker, whether the first publication should be overwritten with the second publication and, if not, retaining at least payload data from both the first and second publications on the topic; and storing, for the second publication, if retained, data indicating when the second publication was published to the broker. Other methods, apparatus, and computer readable media are also provided.

Abstract: The present invention provides a method and apparatus for obtaining address update information, comprising: obtaining webpage information related to an address update of a named entity; extracting keywords representing an address update clue of the named entity from the webpage information; determining the time and confidence of the address update clue; determining the address update information based on the time and confidence. Using the solution of the present invention can determine address update information through obtained website information.

Abstract: A first node apparatus included in a distributed data store acquires first operation information and a first timestamp corresponding to target data. The first operation information specifies a first operation to be executed on the target data. The first timestamp indicates a first receipt time of the first operation information. The first node apparatus determines whether the first receipt time is earlier than some of second receipt times on the basis of second timestamps and the acquired first timestamp. The second timestamp indicates the second receipt time of second operation information. The second operation information specifies a second operation executed on the target data. The first node apparatus re-executes the second operations together with the first operation on the target data in the order of the receipt time when it is determined that the first receipt time is earlier than some of the second receipt times.

Abstract: The present disclosure relates to occasions when a sender wishes to submit a file to a web server or the like with assurance the file will be temporarily posted and then systematically deleted in a secure manner, where it would not be possible for others to recover the file or data associated with the file, such as information that can be used to identify the sender. The disclosure includes, for example, a computerized system for temporarily storing files, including at least one computer. The computer may be configured to receive a file, store the file, allow the file to be accessed over a network, and securely delete the file when a rule defining when the file is to be securely deleted has been satisfied.

Abstract: A system and method for determining an age of an object is provided. A first index for a timestamp entry in a sequence of timestamps corresponding to a time at which an object was created is identified. At least one subsequence of timestamps from the sequence of timestamps having indexes for entries in the sequence of timestamps that are between the first index in the sequence of timestamps and a last index for a last timestamp entry in the sequence of timestamps is identified, wherein the at least one subsequence of timestamps conforms to a function of a time interval between storage of consecutive current timestamps reported by clock of the computer system. Timestamps from the sequence of timestamps that are not included in the at least one subsequence of timestamps are removed. An age of the object is determined based on the at least one subsequence of timestamps.

Abstract: Embodiments of the invention provide a method of managing aliases on a server, including deleting unused aliases, while minimizing required administrator interaction. The server may include expirable alias records, containing an expiration value and an inactivity timer. An alias manager component may process the expirable records. If the alias manager component determines a particular record has expired, the alias manager component may delete that record.

Abstract: A data profile request is handles by utilizing data in a distributed file system. Tabular data is extracted from a data source and stored in a distributed file system. Each table in the tabular data is split by columns, which are each stored in separate files in a set of physical nodes of the distributed file system. In response to a data profiling request, a master node determines, based on the profiling request, which groups of files are needed to be on a same physical node in order to perform the profiling analysis. The master node creates jobs using physical nodes that contain the requisite files needed for each job.

Abstract: A method can include determining metadata for a file responsive to initiating an operation on the file stored within a client system and determining a storage location within a file repository of a master version of the file from the metadata. The method also can include determining, from the storage location, whether the master version of the file is more recent than the file stored within the client system using a processor of the client system.

Abstract: Methods and apparatus are disclosed for facilitating online storage of files (e.g., audio tracks, video, etc.) for playback/access or sale/exchange by the owners of the files without violating copyrights that copyright holders have in the files. For example, by providing a playback service that does not store additional versions of an audio file when the file is transmitted to, and immediately played on, a user device without buffering, the present invention avoids violating copyright laws by not making copies of the file. Numerous other aspects are disclosed.

Abstract: Embodiments may include a consistency measurement component that utilizes memory-efficient sets (e.g., Bloom filters) to generate consistency metrics for read operations performed on different replicated data objects of distributed storage system. Based on the consistency metrics, the consistency measurement component may identify a subset of replicated data objects associated with low levels of consistency. The consistency measurement component may target this subset for consistency improvement by generating instructions to improve the consistency of the subset. In other cases, the consistency measurement component may notify a consistency improvement component about the targeted subset. In response, the consistency improvement component may generate instructions to improve the consistency of the targeted subset.

Abstract: Information describing a transaction is received and a set of hierarchical documents pertinent to the transaction are identified based at least in part on the received information. The set of hierarchical documents is pruned responsive to data describing documents that a user involved in the transaction has previously accepted. Information describing the pruned set of hierarchical documents is output for presenting the pruned set of hierarchical documents to the user involved in the transaction for acceptance as part of the transaction.

Abstract: When requested content is available at a data center, the data center returns the requested content to the data center. When the requested content is locally unavailable at the data center, the requested content is retrieved from an origin server. The retrieval of the content from the origin server may be delayed based on the processing load at the origin server. When retrieval of the content is delayed, the request is prioritized and placed in a queue for handling by the origin server based on the priority of the request. Also, when retrieval of the content is delayed, a status page may be communicated to the browser to inform a user of the delay and provide alternate content and status information related to the request determined as a function of the request or the current state of the origin server.

Abstract: A retention schedule is assigned to a record based on classification information associated with the record, wherein the retention schedule is linked to a plurality of jurisdiction triggers. Expiration dates for those jurisdiction triggers that correspond to jurisdiction information associated with the record are determined. A record expiration date for the record is selected from the determined expiration dates.

Abstract: The present invention provides a processing procedure management device which can determine a process procedure by adapting to a performance change of a function engine used for information processing at a high speed.

Abstract: A coordinator manages a two-phase commit distributed transaction. The coordinator uses a probabilistic data structure to record whether the two-phase commit distributed transaction was successfully completed. A participant of the two-phase commit distributed transaction is directed to commit to the transaction or to roll back the transaction based on contents of the probabilistic data structure.

Abstract: A method and system for managing the lifetime of semantically-identified data is provided. A graph data structure is maintained in storage of a computing device. The graph data structure has data items and relationships therebetween that are semantically identified. Lifetime information is stored in the storage. The lifetime information describes the period during which at least one of the data items in the graph data structure is valid.

Abstract: There is provided, in a computer processing system, an apparatus for storage lifecycle management for a plurality of managed objects. The apparatus includes a policy decision manager for creating and managing a policy decision stash. The policy decision stash is associated with predictive policy decisions for the plurality of managed objects and is configured to allow the predictive policy decisions for the plurality of managed objects to be incrementally updated and accessed in the policy decision stash by a policy identifier and an effective timestamp.

Abstract: The present disclosure provides a method of statistical application in an OLTP environment to reduce the intensive computational load of invoking SQL statements for statistical calculations. The method introduces a time element into statistical records, and use the time element to determine the time status of previously computed statistical records. Upon receiving a query for a statistical record, the system first searches for an existing copy of the statistical record, and checks the time status of the statistical record if found. The system sends the statistical record to the inquirer if the record exists and is unexpired, and invokes an SQL statement to compute the statistical record only if the record does not exist or has expired. The statistical records may be placed in statistical table in a database and/or a cache of an application server. The disclosed strategy may also increase attack resistance of the system.

Abstract: A method of controlling the retention of publications in a publish/subscribe system, the method comprising receiving, at a message broker, a first publication from a publisher on a topic; receiving, at the message broker, a second publication from the publisher on the topic; identifying, at the message broker, whether the first publication should be overwritten with the second publication and, if not, retaining at least payload data from both the first and second publications on the topic; and storing, for the second publication, if retained, data indicating when the second publication was published to the broker. Other methods, apparatus, and computer readable media are also provided.