Abstract: A system, method, and computer-accessible medium are disclosed for maintaining data at a plurality of summary levels in a single table. Data may be summarized into a plurality of summary levels. Each of the summary levels may comprise summarized data over a respective one of a plurality of intervals of time. The plurality of summary levels may vary in granularity of the summarized data. The summarized data in the plurality of summary levels may be stored in a single table in a database.

Abstract: In order to manage stale data on a network of computer systems, a file harvester agent may be configured with a list of stale data files to be deleted. The file harvester agent may be deployed to the computer systems of a network. When executed in a computer system, the file harvester agent searches the file system of the computer system to locate any files or data indicated in the file list. Any located data files are deleted. Once the agent has finished processing the file list on a computer system, the agent can copy or replicate itself to other computer systems of the network in accordance with a pre-configured itinerary.

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: The present invention claims and discloses an electronic equipment capable of executing a processing executing program that performs a predetermined processing. The electronic equipment comprises a memory; a setting unit that sets an allocation time for a memory region in the memory that the processing executing program is to use; and a memory leak detecting unit that detects when the memory region has not been deallocated within the allocation time.

Abstract: Various systems and methods for performing archive operations are disclosed. One method involves receiving a request to perform an archive operation on a number of data storage containers. The request is received by an archive computer system. A determination is made whether to exclude a given storage container from the archive operation based on information stored in a profile.

Abstract: A method begins by a processing module determining a state of a dispersed storage network (DSN) local directory to be an unknown staleness state. When in the unknown staleness state, the method continues with the processing module comparing a local revision level of one of one or more local DSN directory files with a global revision level of a corresponding global DSN directory file. When the local revision level compares unfavorably to the global revision level, the method continues with the processing module updating the state of the DSN local directory to a stale state. When the local revision level compares favorably to the global revision level, the method continues with the processing module updating the state of the DSN local directory to a not-stale state.

Abstract: A method and system for performing at least one transaction on at least one column of a table in a database system is disclosed. The method includes determining whether a first transaction of the at least one transaction fulfills all of at least one criteria. The method further includes ensuring that the at least one column is in a shared numeric lock if the first transaction fulfills all of the at least one criteria, wherein the shared numeric lock is a lock that allows at least a second transaction fulfilling all of the at least one criteria to access the same column concurrently with the first transaction without releasing the shared numeric lock between transactions, and wherein the shared numeric lock is released only after all of the transactions fulfilling all of the criteria have completed processing. The method further includes processing the first transaction.

Abstract: An apparatus includes: a storage unit storing page information located at a root, a node, and a leaf in a tree structure, and storing the plurality of page information including an expiration date of a record that is included in any page information; a search unit searching a record that has passed its expiration date; a determination unit determining whether or not the expiration date included in the page information has come; a first control unit configured to make the determination unit determine whether the expiration date included in predetermined page information stored as the tree structure has come; and a second control unit configured to make the search unit end the search of the record that has passed its expiration date, and configured to make the determination unit determine whether the expiration date included in page information located at a child of the predetermined page information has come.

Abstract: A system and method is disclosed which enables network administrators and the like to quickly analyze the data produced by log-producing devices such as network firewalls and routers. Unlike systems of the prior art, the system disclosed herein automatically parses and summarizes log data before inserting it into one or more databases. This greatly reduces the volume of data stored in the database and permits database queries to be run and reports generated while many types of attempted breaches of network security are still in progress. Database maintenance may also be accomplished automatically by the system to delete or archive old log data.

Abstract: A clustered storage system includes a machine arranged to check, using its own clock as a current time reference, for expiry of a retention period set for a dataset stored in the system. In order to monitor for any interference with its clock, the expiry-checking machine obtains from other machines of the system, the current times of their clocks, and then derives a value from these times which it compares with a current time value from its own clock; where the difference between these values exceeds a predetermined amount, the expiry-checking machine generates an alert. This monitoring process is carried out repeatedly.

Abstract: A system and method are provided to examine a changeable monitored document and to provide alerts relating to changes of interest. The logical entities of a monitored document are compared, when changed, to the logical entities of an updatable reference of the monitored document which comprises material from the monitored document at a given time. The system distinguishes between logical entities which have moved within a document and logical entities which have been changed in a document. A user or users are alerted to any change in the monitored document according to the user's preferences. The system also allows the user to specify one or more search terms, thereby allowing a user to receive alerts only when a specified search term or terms appear in a newly changed portion of the monitored document. After examination, an extracted copy of the monitored document is retained as the editable reference.

Abstract: Systems and methods for decomposing and decaying data over time by decomposing a type of data item into constituent units of the data item, establishing relationship factors between data items to other data items and between constituent units, creating a shelf-life criterion for the constituent units priority dimensions, calculating or updating a decomposability index for each constituent unit as a function of the priority dimensions while also applying a relationship factor and optionally incrementing for another dimension, and then decaying over time the data items by deleting all constituent units which have decomposability indices exceeding a configured threshold.

Abstract: This application describes tools for online tracking of life-limited parts. These tools may support methods that include receiving queries, and searching databases in response to the queries. These methods may integrate results of the searches into reports that provide comprehensive histories of life-limited parts for installation within vehicles, and may report these integrated results. To build these databases, other methods may receive information relating to the life-limited parts from a variety of sources, load the information into suitable databases, and integrate this information as provided by the various sources. Other methods may also evaluate whether the parts have any permitted life remaining. These tools may also provide databases that store serial numbers associated with the parts, store physical locations of the parts at various times, indicate who owned the parts at different times, and include remaining life records that indicate any permitted life remaining for the parts.

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: A technique for optimizing grace period detection in a uniprocessor environment. An update operation is performed on a data element that is shared with non-preemptible readers of the data element. A call is issued to a synchronous grace period detection method. The synchronous grace period detection method performs synchronous grace period detection and returns from the call if the data processing system implements a multi-processor environment at the time of the call. The synchronous grace period detection determines the end of a grace period in which the readers have passed through a quiescent state and cannot be maintaining references to the pre-update view of the shared data. The synchronous grace period detection method returns from the call without performing grace period detection if the data processing system implements a uniprocessor environment at the time of the call.

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: A system for ensuring data integrity, comprising a plurality of data servers configured in a GPFS configuration, the plurality of data servers comprising an application server comprising a application server fileset, a home server comprising a home server fileset and a gateway server comprising a gateway fileset, a connection monitor node (CMN) coupled to gateway server; and logic, executed by the CMN, for monitoring a connection between the home server and the application server; and if the connection is disconnected, executing logic for comparing a duration of the connection disconnect to a expiration timeout attribute corresponding to the application server fileset and if the duration exceeds the expiration timeout attribute, notifying the application server to set an expiration status attribute in the application fileset.

Abstract: A device is configured to receive a request for particular content metadata; determine, in response to the request, whether information associated with the particular content metadata is stored in a local memory; present the particular content metadata for display without contacting a server when the information has been stored in the memory for less than a first amount of time; present the particular content metadata for display and contact a server to obtain new content metadata when the information has been stored in the memory for at least the first amount of time and less than a second amount of time; and contact a server to obtain new content metadata, relating to the particular content metadata, and present the new content metadata for display when the information has been stored in the memory for at least the second amount of time.

Abstract: A cache server is provided in a network for storing Java objects for retrieval by one or multiple application servers. Application server(s) are configured to request an object from the cache server, rather than requesting the Java object directly from a database, so as to reduce processing load on the database and free up database resources. Responsive to a request for a Java object from an application server, e.g., in an HTTP request, the cache server determines if the object is stored in memory and if so, serializes the requested object and sends the serialized object to the requesting server, e.g., in an HTTP response. The requesting server then deserializes the Java object. If the object is not stored in memory, the cache server instantiates the object (typically by requesting the object from the database), serializes the instantiated object and sends it to the requesting server. Cache coherency methods are also provided.

Abstract: Methods, systems, and products are disclosed for dynamically updating web content using W3C standards. One such method sends a request to a web server for a web page. A web browser receives and renders a static HTML web page. The web browser periodically sends a query to the web server and, in response, receives a latest date and time stamp indicating the latest update to the web page. The web browser compares the latest date and time stamp to a previously stored date and time stamp representing a previous update. If the latest date and time stamp matches the previously stored date and time stamp, then no update has occurred and no update is required. If, however, the date and time stamps do not match, then the web page has changed since the previous update and the web browser retrieves the latest update to the web page.

Abstract: A system and method are provided that utilize a mechanism for electronic communication group deletion based on the detection of the completion of the purpose of an event as specified upon creation of the electronic communication group. By specifying the expiry date of a group at the time of creation and notifying members of the expiry date, complete deletion of the group can be performed on the server side to conserve memory, while enabling group members to save content locally before the group is deleted. Upon creating a group, an expiry date can be set for the group and this expiry date and a purpose therefor notified to the members that join the group, and users are then able to join the group. Upon detecting the expiry date, the group members can be notified and permitted to perform a local save, extend the expiry date, etc. The server may then delete its copy of the data and the client devices enable or enforce deletion locally to recapture storage space.

Abstract: A system for efficiently storing application data which allows a practically infinite number of physically separate storage devices to be used as archival storage means by one or more application programs. Application data is organized among the devices such that files with a similar expiry date (that is the date beyond which the files are no longer required to be archived) are grouped together on the same physical device, such that after the expiry date the device used for such files may be erased and re-used. Optionally, files with particular content-types may be grouped on the same physical device, or among physical devices of the same type.

Abstract: A method by which a disk-based distributed data storage system is organized for protecting historical records of stored data entities. The method comprises recording distinct states of an entity, corresponding to different moments of time, as separate entity versions coexisting within the distributed data storage system, and assigning expiration times to the entity versions independently within each of a plurality of storage sites according to a shared set of rules, before which times deletion is prohibited.

Abstract: Techniques are provided for lock management. The techniques are based on an enhanced lock management system that generates a semantic response in response to lock requests for a resource. The semantic response communicates both the underlying cause blocking the request, and information that may be used by the requester to obtain notification of when the underlying cause should no longer lead to denial of the lock request. The semantic response may be generated by the master of the resource, who provides the semantic response to the local lock manager of the lock requester. The semantic response may be retained by the local lock manager so that the semantic response can be provided to subsequent lock requesters, without need for interacting with another lock manager on another node.

Abstract: Provided is a system for generating an on-demand, custom runtime solution to a user or business's computing needs. A library of software components corresponding to different computing tasks of a business situation is created. Each software component is associated with one or more meta descriptors. The software components and related meta descriptors are managed by means of a software component meta management system (SCMMS). Meta descriptors are self adaptive in a manner that reflects real use scenarios. Meta descriptors describe both static and dynamic attributes of components.

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: A method for automating the redirection of references that can include downloading an original document using an original uniform resource identifier (URI), storing the original document in a repository, parsing the original document to determine the existence of one or more dependent documents referred to in the original document and executing an automated redirection subprocess. The method can include parsing each dependent document to determine one or more dependent documents, and responsive to determining the existence of one or more dependent documents, conducting the automated redirection subprocess for each dependent document and further dependent document and repeating the parsing of dependent documents and conducting the automated redirection subprocess steps until all further dependent documents have been redirected.

Abstract: Methods, systems and computer program products are provided for managing at least one cache for a database. In one method, an operation record is inserted in an operations log for each write operation to the database. The operation record includes a Log Sequence Number (LSN). At least one cache is updated using operation records in the operations log. To update a cache, unapplied operations in the operations log for the cache are identified using an applied LSN associated with the cache. The applied LSN denotes an LSN of a last operation applied to the cache. The unapplied operations are then applied to the cache and the applied LSN is updated with an LSN corresponding to the last unapplied operation of the unapplied operations that were applied to the cache during updating the cache.

Abstract: An electronic music apparatus has a sound generator for generating a music sound signal according to music data. A storage medium stores music data files, each written with music data for generating the sound signal. An information retention section retains file information for displaying a name or an icon of the respective music data. A reading command section issues a command of reading a target music data file from the storage medium. A display control section controls a display device to display, when the target music data file is successfully read out, the name and the icon of the music data written in the read target music data file, and when the target music data file is not read, to display the name and the icon of the music data in a state different from the name and the icon displayed when the target music data file is successfully read.

Abstract: Disclosed is a technique for maintaining statistics. A query is received. Column group generation is performed to form one or more column groups. Column group refinement is performed based on statistics data generated for a previously received query. A statistics check is automatically performed. A statistics collection command is generated to obtain statistics.

Abstract: The present invention relates to a method for encryption of the content in a database, for accomplishing increased protection against unauthorised access to the data. The method assures that every row and item is re-encrypted with a valid key. More specifically this process, the so-called KeyLife process, is executed every time a row is inserted, updated or retrieved after a scanning operation. The key life value, defining the number of days a key is valid for each item, could differ for the items, and could typically be between 30 and 90 days. The scanning operation, checking the validity of the presently used keys, the so-called KeyLife checking, is executed each time a new key generation is created.

Abstract: Techniques provide a file plan including a plurality of containers, wherein each container is capable of providing management information for record information objects assigned to the container, wherein the record information objects represent documents, wherein one of the containers points to a physical record. An electronic record associated with the physical record is stored. The physical record is automatically associated with the electronic record by updating the file plan.

Abstract: A system and method for managing data during consistency points in a storage system is provided. A buffer data control structure is modified to include a flags array that tracks various status flags for both a current and a next consistency point (CP). By utilizing multiple pointers within a buffer control structure, the storage system may permit write operations to continue to a data container undergoing write allocation. Received writes during a write allocation procedure are stored in raw data buffers and the buffer control structure is marked as being dirty for a next CP.

Abstract: A method and system for clearing log files of a service system are disclosed in the present invention. The method includes the following steps: configuring a log processing task item for each service of multiple services respectively; adding a log management task to a task list of an operating system; and the log management task clears a log file of each service in turn according to the log processing task item. According to the present invention, each time when a new service is added to a service system, or new log files are added to a current service, there is no need to develop a log processing module specially and modify the existing content about log processing, and test the log management module. Therefore, efficiency of development and testing can be improved effectively, and system update and maintenance be facilitated.

Abstract: A device, system, and method is disclosed. The device may be a photographic asset that may include one or more functional features configured to enable the photographic asset to perform one or more functions. The device may have a memory configured to hold a photographic asset identifier. The device may include a communication mechanism which may be configured to couple with a data handler and to provide the asset identifier to the data handler, and to receive a licensure status from the data handler, the licensure status obtained from a cross referencing of the asset identifier against a license flag in a database. The database may include a copy of the asset identifier and the license flag, the license flag may include the licensure status.

Abstract: Techniques introduced herein allow writeable PPIs to be analyzed prior to deletion to determine whether or not the writeable PPIs have reached the end of their life cycle. Prior to deletion a writeable PPI manager can inspect the writeable PPI to determine whether or not the writeable PPI has reached the end of the writeable PPI life cycle. If various criteria are not met, then the writeable PPI can be determined to have not yet reached the end of its life cycle and the deletion can be prevented.

Abstract: Retention and disposition of stored content associated with multiple stored objects is disclosed. An indication is received that a first stored object associated with an item of content comprising a body of managed content is no longer subject to retention under a retention policy applicable to the first stored object. The item of content is deleted or otherwise disposed of only if the item of content is not associated with a second stored object that is still required or desired to be retained.

Abstract: User productivity can be facilitated by providing an interface between a high-level intent and low-level settings that should be configured to achieve the intent. The intent can be expressed in declarative language. The intent can be verified to determine if it conforms to a target, a policy, or both. Policy binding can provide a relationship between the target and the policy. An application view can be provided that allows the user to view a server having one or more databases.

Abstract: A kiosk system facilitates compliance with FCC-mandated Public File requirements for licensed media outlets such as radio and television stations. The system intelligently routes Public File documents to the appropriate field entity (kiosk) without human intervention. These documents are categorized, tagged and made available to the public satisfying the federal requirements. The kiosks can operate in an offline mode with a synchronization system from the parent server to update the kiosks with documents and system data. An alerting system can generate push-email reminders and notifications for key media outlet staff. Additionally, the present invention can provide a virtual workstation kiosk to embed into a media outlet's public-facing websites, providing virtual kiosk access to remote members of the public.

Abstract: A technique for optimizing grace period detection following a data element update operation that affects preemptible data readers. A determination is made whether the data processing system is a uniprocessor system or a multiprocessor system. Grace period detection processing is performed using a first grace period detection technique if the data processing system is a multiprocessor system. Grace period detection processing is performed using a second grace period detection technique if the data processing system is a uniprocessor system. The grace period detection processing according to either technique determines the end of a grace period in which readers that are subject to preemption have passed through a quiescent state and cannot be maintaining references to the pre-update view of the shared data.

Abstract: The embodiments of the invention provide methods, computer program products, etc. for autonomic retention classes when retaining data within storage devices. More specifically, a method of determining whether to retain data within at least one storage device begins by storing data items in at least one storage device. Furthermore, the method maintains access statistics for each of the data items, an age of each of the data items, and an administrator-defined importance value of each of the data items. Following this, a retention value is calculated for each of the data items based on the access statistics for each of the data items, the age of each of the data items, and the administrator-defined importance value of each of the data items.

Abstract: A method of distributing a data item to a plurality of computers in a network of computers. A data item is divided into a plurality of segments. Each segment is stored on at least one computer in said network. A list of computers onto which each of said segments has been stored is maintained. When a data item is requested, its component segments are obtained from at least two computers in the network. Some of the computers may form a peer-to-peer network.

Abstract: Described is caching classification-related metadata for a file in an alternate data stream of that file. When a file is classified (e.g., for data management), the classification properties are cached in association with the file, along with classification-related metadata that indicates the state of the file at the time of caching. The classification-related metadata in the alternate data stream is then useable in determining whether the classification properties are valid and up-to-date when next accessed, or whether the file needs to be reclassified. If the properties are valid and up-to-date, they may be used without requiring the computationally costly steps of reclassification. Also described is using more than one alternate data stream for the cache, and extending the classification-related metadata through a defined extension mechanism.

Abstract: The present invention relates to a method for detecting a delinquent or dormant customer record in a customer relationship management (CRM) database using a computer arrangement. The method includes the step of determining that the customer record does not relate to an existing customer for whom work is in progress. It is also determined that the customer record does not relate to a prospective customer. The method further includes the step of detecting the customer record when a future activity date associated with the customer record has passed.

Abstract: A system and method for the display and selection of contact data for inclusion in an address entry field in a graphical user interface of a communication device is provided. When a character string is input in an address entry field, a selection list such as a drop-down list is presented for selection of a contact having contact information matching the input string. The list is populated from both an address book and a contact data store. The contact data store comprises contact data mined from incoming and outgoing messages at the communication device. The contact data in the contact data store is aged or evaluated for frequency of use. A copy of the contact data store may be maintained in an enterprise system associated with the communication device.

Abstract: A cue sheet generation system is used to compose a cue sheet for submission to PRS from an input EDL. The system parses the EDL to extract data relating to use of musical works associated with a PRS. The system employs both local and remote databases to retrieve information relating to the extracted musical work data. The information is then used to construct a cue sheet in a form appropriate for submission to a PRS.

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: Information indicating a time of validity of content of a web page is maintained as meta data within the page itself. A content server, in response to receipt of a request for the web page, determines whether web page has expired. If the content is determined not to have expired, the content server forwards the web page to the requesting user without modification. However, if the content is determined to have expired, the content server adds a warning tag in the content section of the page specifying that the content has expired, and then forwards the page to the requesting user, thereby alert the user of the expiry. In addition, the content server may obtain an updated web page, which may then be provided in response to future requests for the web page.

Abstract: Described is a technology by which directly ascertainable properties of a processor are collected, and used as a key to access other information about the processor, such as age-related information maintained in a separate lookup table. If a matching entry is not found, the property information may be added to an unknown list and/or used to dynamically update the lookup table. A data structure such as a record comprises a set of fields including fields containing data representative of properties of a processor, a key value determined from the data in at least some of the fields and an identifier that identifies the processor relative to other processors of other computing devices. The fields may include manufacturer data, brand identifier data, cache information, normalized processor speed data, mobile chip information and/or CPU model data.

Abstract: System and method for detecting the inclusion of strings of words (records) in an input string of words. In a preparation phase, the records are pre-processed. Each record is represented by a string of chunks, each chunk composed of a pre-defined number of words. Each chunk found in at least one record is assigned a number of attributes, such as a “Begin of Record” attribute and an “End of Record” attribute. In the searching phase the input string is also divided in chunks, and for each input chunk, an Incremental Hash Function (IHF) is calculated for comparing with a prerecorded value ?I. If the two values IHF and ?I coincide for matching chunks with certain predefined attributes, a “probable match” is set, indicating a very high probability that a chunk was found in the records.