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: According to a method of access to a shared data record subject to contemporaneous read and write access by multiple requesters, a requester reads a shared data record including a payload and a first checksum. The requester calculates a second checksum of the payload of the data record. If the first and second checksums are not equal, the requester again reads the shared data record, including a third checksum, and calculates a fourth checksum of the payload of the shared data record. If the third and fourth checksums are equal, the requester processes the shared data record as valid, and if the second and fourth checksums are equal, the requester handles the shared data record as corrupt.

Abstract: Simulating a large number of users is described. A method may include receiving a test script including a plurality of commands and invoking a script interpreter. An application thread may be launched to execute the test script. A protocol engine may be invoked for each of the commands in the test script such that each protocol engine has an associated command. Each protocol engine may execute its associated command. A system on which the method may be executed may include one or more chassis or computing devices having one or more network cards. The chassis and/or computing devices may be connected to one or more networks.

Abstract: Systems and methods for managing data with respect to tape storage are provided. The system includes a data manager for receiving metadata related to content and for generating a proxy file system which mirrors the data structure of the content data. The system further includes a server coupled to a tape device, the server receiving the content data directly from a data source and providing the content data the tape device for storage on a formatted tape media.

Abstract: An embodiment of the invention provides an apparatus and method for data verification by challenge. The apparatus and method perform acts including: sending a hash value of a data piece in a sender; if the hash value matches a stored hash value in a receiver, then sending a challenge from the receiver to the sender; sending a sample data set from the data piece in the sender, wherein the sample data set is determined by a window that is identified by the challenge; comparing the sample data set with a data set that is overlapped by the window for a stored data piece in the receiver; and performing a response based on the comparison of the sample data set and the stored data set that is overlapped by the window for the stored data piece.

Abstract: According to a method of access to a shared data record subject to contemporaneous read and write access by multiple requesters, a requester reads a shared data record including a payload and a first checksum. The requester calculates a second checksum of the payload of the data record. If the first and second checksums are not equal, the requester again reads the shared data record, including a third checksum, and calculates a fourth checksum of the payload of the shared data record. If the third and fourth checksums are equal, the requester processes the shared data record as valid, and if the second and fourth checksums are equal, the requester handles the shared data record as corrupt.

Abstract: The various methods and devices described herein relate to devices which, in at least certain embodiments, may include a method of decoding data or a data stream in a file, which may include checking for a first data portion of a plurality of data portions in the file, the first data portion having a first data value, reading in data from another data portion of the plurality of data portions, decoding or decompressing the data, performing a checksum operation on the decoded data if the first data portion having the first data value is not detected, and skipping a checksum operation on the decoded data if the first data portion having the first data value is detected. In the embodiment, a checksum operation on encoded data may also be skipped. In an embodiment, the first data value may include information or instructions about how a decoder may decode the data and may also include a tag or identifier.

Abstract: Provided is a system and method for safeguarding digital objects consisting of digital assets. The system includes a unique identifier and an impairer in each digital asset, the impairer distinct from the unique identifier. A database is provided with a record of each unique identifier. A client is in communication with the database. The client is adapted to receive a subset of the digital assets and analyze each digital asset to determine the unique identifier embedded therein. The client is further adapted to query the database with the determined unique identifier to validate each received digital asset. In response to proper validation, the impairer is removed from the received digital asset. An associated method is also provided.

Abstract: One embodiment of the present invention provides a system that facilitates detecting data tampering within a table in a database. The system operates by hashing a row in the table to create a row-hash. The system then hashes a block of consecutive row-hashes to create a block-hash. Finally, the system signs the block-hash with an encryption key, so that tampering with data in the row will result in an invalid row-hash and an invalid block-hash.

Abstract: In a data storage system having a server and a media drive, a method and system for verifying data stored on a medium. The method includes reading, at the media drive in response to a verify command indicative of a user request to perform data verification, a logical record stored on the medium, where the logical record comprising data and a first checksum. The method also includes generating, at the media drive, a second checksum based on the data of the logical record read, and comparing, at the media drive, the second checksum generated at the media drive and the first checksum. The method still further includes communicating, from the media drive to the server, a status indication based on the comparison of the first checksum and the second checksum, where the status indication is representative of a result of the requested data verification.

Abstract: A facility for comparing two datasets and identifying metadata differences between the two datasets irrespective of the manner in which the data is stored. In some embodiments, the facility includes a comparison unit and a catalog unit. The comparison unit compares a hierarchical hash of a first dataset with a hierarchical hash of a second dataset, the hierarchical hashes each including a plurality of hierarchical hash values, to identify differences in metadata of the first and second datasets by progressively comparing the hierarchical hash values of the first and second hierarchical hashes without comparing the metadata of the first and second datasets. The catalog unit generates a catalog of differences between the first and second datasets, the catalog indicating differences in metadata of the first and second datasets.

Abstract: A method and system, the method including, in some embodiments, calculating, by a message originator, a first check sum byte, appending the first check sum byte to the message, sending the message from the originator to a client over a single wire serial bus, and determining, by the client, a validity of the message from the originator by comparing the first check sum byte with a second check sum calculated by the client.

Abstract: An information processing device includes a digital-information generating unit, an identifier assigning unit, an attribute setting unit and an electronic signing unit. The digital-information generating unit serially generates pieces of first digital information. The identifier assigning unit assigns different identifiers to the respective pieces of first digital information generated by the digital-information generating unit. The attribute setting unit sets an attribute of each first digital information so as to include the identifier assigned to each first digital information. The electronic signing unit electronically signs each first digital information to which the attribute setting unit sets the attribute including the corresponding identifier.

Abstract: One embodiment retrieves a first portion of a plurality of stored objects from at least one storage device. The embodiment further performs a base type deduplication estimation process on the first portion of stored objects. The embodiment still further categorizes the first portion of the plurality of stored objects into deduplication sets based on a deduplication relationship of each object of the plurality of stored objects with each of the estimated first plurality of deduplication chunk portions. The embodiment further combines deduplication sets into broad classes based on deduplication characteristics of the objects in the deduplication sets. The embodiment still further classifies a second portion of the plurality of stored objects into broad classes using classifiers. The embodiment further selects an appropriate deduplication approach for each categorized class.

Abstract: An attribute rule enforcer evaluates the attributes of a call to add, modify, or delete information in a directory, such as a lightweight directory access protocol (LDAP) directory. The attribute rule enforcer determines if the attributes of the call comply with predetermined rules governing the directory's content. The directory attribute rule enforcer may be located at the front end of the directory's access server, and intercepts calls to the directory access server. If the directory attribute rule enforcer determines that the attributes of a call complies with the rules governing the content of the directory, it will forward the call to the directory's access server for action. If, on the other hand, the directory attribute rule enforcer determines that the attributes of a call do not comply with the rules governing the content of the directory, the attribute rule enforcer will reject the call. Further, it may forward an appropriate error message to the source of the call.

Abstract: Lot identification codes marked on packaging comprise a fixed number of digits with substrings representing each of a date, a SKU, a lot number, and optionally a line and a checksum. The same fixed number of digits is used for the lot identification codes employed by multiple producers across an industry, or across multiple industries. The lot identification codes are therefore readily recognizable by search engines and otherwise reduce the number of steps required for consumers and others along the supply chain to obtain lot-specific information about packaged goods. Additionally, whenever an individual submits a lot identification code, it provides an opportunity to collect information about the product at that point along the supply chain. The information can link the quality of the product at the time and place of the request to the time and place of the packaging.

Abstract: A synchronization process, and associated apparatus, for placing database copies in match with one another by way of communications effectuated upon an air interface of a radio communication system. Hash functions are performed at a mobile node and at a network part upon mobile and network copies of database information. Comparison of the hash information formed therefrom provides a preliminary indication of whether the databases are in match with one another. If a determination is made that the databases are out of match, the data is compared, and the data is placed in match with one another responsive to such additional comparisons.

Abstract: A method and apparatus for providing accurate detection of confidential information is described. In one embodiment, the method includes searching a text document for multiple classified data patterns associated with confidential information that is represented as personal identifiers. The method further includes finding, in the text document, one or more personal identifier candidates matching any of the classified data patterns, and validating each of the personal identifier candidates using one or more personal identifier validators to provide accurate detection of the confidential information in the text document.

Abstract: A structured-document management apparatus includes data storage which stores a plurality of structured document data items each including a plurality of elements, common-structure storage which stores a common structure including a plurality of structures included in the structured document data items, a first acquisition unit configured to acquire a new structured document data item, an update unit configured to update the common structure into a new common structure including the structures and a plurality of structures included in the new structured document data item, a second acquisition unit configured to acquire a differential structure between the new common structure and a structure of the new structured document data item, differential structure storage which stores the differential structure, and a storing unit configured to store an array of elements of the new structured document data item into the data storage, the array being arranged based on the differential structure.

Abstract: Providing extended or end-to-end data integrity through layers of a system. In one aspect, information is to be transmitted between an application end of the system and a physical storage medium that stores the information for a database of the system, the information to be transmitted via a database server in a database server layer of the system. At least a portion of data protection is provided for the information, the data protection causing the information to be protected from corruption between a system layer and the physical storage medium, where the system layer is a separate layer provided closer to the application end of the system than the database server layer.

Abstract: A snapshot copy facility maintains information indicating block ownership and sharing between successive versions by delegating block reference counts to parent-child relationships between the file system blocks, as indicated by block pointers in inodes and indirect blocks. When a child block becomes shared between a parent block of the production file and a parent block of a snapshot copy, the delegated reference count is split among the parent blocks. This method is compatible with a conventional data de-duplication facility, and avoids a need to update block reference counts in block metadata of child blocks of a shared indirect block upon splitting the shared indirect block when writing to a production file.

Abstract: A system and method for synchronizing data in first and second computer servers is provided. The first computer server includes a first plurality of data sets each having a first identifier and a first set of attributes. The second computer server includes second plurality of data sets each having a second identifier and a second set of attributes. The method includes transmitting a second identifier and a second checksum value both associated with one of the second plurality of data sets to the first computer server. The method further includes accessing one of the first plurality of data sets having a first identifier corresponding to the transmitted second identifier to determine a first checksum value associated with the accessed data set.

Abstract: Provided are methods, apparatus and computer programs for enhanced access to resources within a network, including for controlling use of bandwidth-sensitive connections within a network and/or for automated recovery. Hash values are used as ‘unique’ identifiers for resources distributed across a network, and each one of a set of pool servers store the hash values for a set of computers within a LAN. When a resource is required, a hash value representing the resource can be retrieved and compared with hash values stored at a pool server to determine whether the pool server holds a matching hash value. Any such matching hash value found on the pool server represents an identification of a local copy of the required resource, because of the uniqueness property of secure ash values. The information within the pool server can be used to access the required resource.

Abstract: An interface is disclosed that makes information obtained from a file deduplication process available to an application for the efficient operation thereof. A data deduplication repository is scanned to determine a plurality of file segments and respective checksum values associated with the segments. A data structure is generated that allows shared segments to be identified by indexing using a common checksum value. The segments also indicate the file to which they belong and may also include a timestamp value. This data structure is updated as files are modified, etc. The data structure is accessible to an application program so that the application program can readily determine which segments are shared between multiple files. With this information, the application can efficiently process the segment once rather than multiple times. Timestamps can be used by the application to efficiently identify only those segments that were accessed after a given time.

Abstract: Various technologies and techniques are disclosed for providing a data warehouse test automation framework system. A data generation module is provided that is operable to generate data scenarios that ensure specific logic is being validated against a data warehouse. A data validation module is provided that has data validation blocks that provide a framework for validating data completeness and data integrity of a data warehouse. The data validation blocks are represented by query templates that provide specifications for how queries that perform the validating of the data completeness and the data integrity should be structured. Dimensions in the data warehouse are modeled using an object oriented programming syntax.

Abstract: A system and method verifies and repairs mirrored data sets. Verification modules executing on both the source and destination computers cooperate to identify a common persistent consistency point image (PCPI) of the source and destination data sets. Once the common image has been identified, the source sends a data stream comprising the data from the source data set to the destination to be compared with the destination data set.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for storing file system content in a multi-tenant on-demand database system. These mechanisms and methods for storing file system content in a multi-tenant on-demand database system can enable embodiments to reduce a number of files stored on a file system, avoid copying of all file system content to file system copies, etc.

Abstract: The present invention provides methods for transmitting SyncML synchronization data. One is that the originator constructs a SyncML message after encrypting the user data to be transmitted and then transmits the data in an existing transmission way; the user data includes, but is not confined to, authentication information, terminal capability information and the data to be synchronized; the other method is that the originator encrypts the SyncML message in the transport layer before transmitting the message, and the recipient deciphers the received SyncML message from transport layer and processes the message subsequently. The two methods can be used either separately or together. If they are used together, the transmission of SyncML synchronization data is provided with double safety insurance. By using the present invention, user data can be transmitted safely without being intercepted by the third party.

Abstract: A source application reads a body of data in data block sized units and calculates a checksum value for each data block before sending the data block, the calculated checksum value and the identifier. Upon receipt, a destination application independently calculates a checksum value for each received data block and compares the two checksums. Non-matching checksums indicate a network-induced error in the data block. Identifiers for the erroneous data blocks are transmitted to the source application after all of the data blocks have been initially transmitted. The source application thereafter resends only those data blocks identified. The destination application repeats the process of comparing checksums and transmitting identifiers to the source application until all of the data blocks of the body of data have been correctly received, and then uses the data blocks to recreate the body of data.

Abstract: A method for transmitting data in an xDSL system is disclosed. In an exemplary embodiment, the method includes defining a data transmission unit (DTU) to be sent in an xDSL data stream, defining a retransmit container as a time slot that corresponds to a sent DTU, maintaining a copy of the sent DTUs and an index of corresponding retransmit containers in retransmission buffer, transmitting the DTUs in the xDSL data stream, determining whether a transmitted DTU should be retransmitted, identifying each corrupted DTU by its corresponding retransmit container, and retransmitting an uncorrupted copy of the DTU as identified by the corresponding retransmit container. The retransmission is deferred until the DTU is at a predefined position in the retransmission buffer.

Abstract: An entity to be validated for consistency is loaded into the buffer of the consistency service, a signal to verify the existence of a specific data set of an IT system is then sent by the consistency service to the IT system holding the entity to be validated for consistency, and the consistency validating information is stored in the output means, said consistency validating information depending on the signal being sent back to the consistency service. The consistency of data stored in various IT systems is checked prior to attempting to access it. Errors by calling a service or functionality that would require access to data that is not available or that is inconsistent can therefore be avoided.

Abstract: A computer-implemented method and system for checking a chemical name. The method tokenizes the chemical name to obtain corresponding tokens; checks the chemical name according to the chemical association between chemical compositions represented by the tokens; and if the chemical name does not pass the check, replaces at least part of tokens of the chemical name that does not pass the check, and repeats the checking step. The system and method can not only help users to find and correct errors in spelling a chemical name but also check the entire chemical name at the level of chemical associations. Hence, not only chemical names that are incorrectly spelled but also ones that do not conform to chemical rules can be found, and significant help is provided to users for correcting chemical names.

Abstract: Embodiments of methods and apparatus for providing an insertion and integrity protection system associated with a wireless communication platform are generally described herein. Other embodiments may be described and claimed.

Abstract: Embodiments of the present invention provide a method, system and computer program product for maintaining distributed state consistency in a distributed computing application. In an embodiment of the invention, a method for maintaining distributed state consistency in a distributed computing application can include registering a set of components of a distributed computing application, starting a transaction resulting in changes of state in different ones of the components in the registered set and determining in response to a conclusion of the transaction whether or not an inconsistency of state has arisen amongst the different components in the registered set in consequence of the changes of state in the different ones of the components in the registered set. If an inconsistency has arisen, each of the components in the registered set can be directed to rollback to a previously stored state. Otherwise a committal of state can be directed in each of the components in the registered set.

Abstract: A unique system and method that facilitates visually identifying authentic UI objects, bundles, or windows is provided. A detection component can detect when user-based input has activated a verification mode with respect to one or more trusted UI objects rendered on-screen. A verification component can verify at least one of a source and identity associated with one or more UI objects in order to ensure the integrity related therewith. A verification rendering engine can re-render the one or more trusted UI objects in a manner that is based at least upon whether the one or more trusted UI objects are verified, thus improving visual recognition of verified trusted UI objects over non-verified UI objects.

Abstract: Apparatus and methods for performing a rule matching are disclosed. In one embodiment, an apparatus for performing a rule matching includes a content matching module and a first rule matching module. The content matching module searches the data stream for contents. The contents are organized into rules including a simple rule with a single content and a complex rule with multiple contents. The first rules matching module is coupled to the content matching module for determining whether the rules are matched by the data stream according to a searching result of the content matching module. To this end, the first rule matching module updates status registers according to the searching result and each status register can indicate whether one of the rules is matched by the data stream.

Abstract: A data slice to be stored in a dispersed storage unit of the dispersed storage system is received. A plurality of data blocks are generated from the data slice and metadata are generated associated with each of the plurality of data blocks. A data file is generated based on the plurality of data blocks. A metadata file is generated based on the metadata associated with the plurality of data blocks. The metadata file and the data file are stored in at least one memory of the dispersed storage unit.

Abstract: A method for performing an update transaction in a database system that includes sending to a remote database client an update request to update data in a database system, in which the update request comprises a first checksum value corresponding to a state of the data in the database system as of the time of the update request. The method further includes receiving a reply from the remote database client that includes a new value for the data in the database system and the first checksum value. The method further includes determining whether the first checksum value matches a second checksum value corresponding to the state of the data in the database system as of the time that the database system received the reply, and if the first checksum value matches the second checksum value, the data in the database system is updated with the new value for the data.

Abstract: A system, method, and apparatus are directed towards identifying adaptive length segments of redundant data for encoding a data structure. Initial boundaries are identified for an input matching segment within input data and for a candidate store matching segment in a synchronized store. The data prior to and after the boundaries are compared to identify matching data. As matching data is identified, at least one of the boundaries of the matching segments is revised. An encoded representation of the resulting input matching segment is then generated based in part on pointers and offsets into the synchronized store. A data structure is generated based on the encoded representation and unmatched portion, which is sent to a receiver. The receiver uses the data structure to extract matching data from the synchronized store, and together with the unmatched input data in the data structure, reconstruct the input data.

Abstract: A system includes a storage pool including a first disk and a second disk, a data management unit (DMU), and a storage pool allocator (SPA). The SPA is configured to receive a request from the DMU to write a logical block, allocate a first physical block on the first disk, attempt to write the logical block to the first physical block, and allocate a second physical block on the second disk, if the attempt to write the logical block to the first physical block fails.

Abstract: A method, system and computer program product for confirming the validity of data returned from a data store. A data store contains a primary data set encrypted using a first encryption and a secondary data set using a second encryption. The secondary data set is a subset of the primary data set. A client issues a substantive query against the data store to retrieve a primary data result belonging to the primary data set. A query interface issues at least one validating query against the data store. Each validating query returns a secondary data result belonging to the secondary data set. The query interface receives the secondary data result and provides a data invalid notification if data satisfying the substantive query included in an unencrypted form of the secondary data result is not contained in an unencrypted form of the primary data result.

Abstract: An attribute rule enforcer for evaluating the attributes of a call to add, modify, or delete information in a directory, such as a lightweight directory access protocol (LDAP) directory. The attribute rule enforcer determines if the attributes of the call comply with predetermined rules governing the directory's content. The directory attribute rule enforcer may be located at the front end of the directory's access server, and intercepts calls to the directory access server. If the directory attribute rule enforcer determines that the attributes of a call complies with the rules governing the content of the directory, it will forward the call to the directory's access server for action. If, on the other hand, directory attribute rule enforcer determines that the attributes of a call do not comply with the rules governing the content of the directory, the attribute rule enforcer will reject the call. Further, it may forward an appropriate error message to the source of the call.

Abstract: The present invention is directed to a Siebel SPF template file update utility. A method for updating a template file in accordance with an embodiment of the present invention includes: obtaining a template file, an existing row_id, and a target row_id; scanning the template file for section markers; locating an encoded length of a section of the template file using a section marker; decoding the encoded length of the section to obtain a section length; reading the section in its entirety using the section length; scanning the section to locate each instance of the existing row_id; replacing each instance of the existing row_id with the target row_id; and recalculating and re-encoding the section length. This process is repeated for each additional section marker.

Abstract: One embodiment of the present invention sets forth a method for storing data collected from a network. The method may involve storing collected data only when a change relative to a previous value of the data is detected. For some embodiments, string data may be converted to numeric values, allowing the same change detection mechanisms to be used for both string and numeric values.

Abstract: The present invention provides a method that uses differential backup which is a key feature when uploading file for back up data from a client terminal to a server terminal. At the time of backup, only the changes from the client terminal side are sent back to the server terminal which saves the bandwidth and makes the process fast. While uploading, data is sent in the form of chunks of fixed size. In case any of the chunks could not be delivered on the server terminal, the same chunk is retransmitted from the client terminal.

Abstract: A system and method for performing File System checKing (FSCK) allows a file system to be accessed while the file system is being checked for consistency in the background. In the event that a file is accessed prior to having been checked for consistency by the background FSCK process, the background FSCK process is interrupted, and an in-context FSCK is performed on the accessed file. In addition, an in-context FSCK method and system is described which uses a snapshot block bitmap, FSCK block bitmap and FS block bitmap to check block consistency in the context of handling a block access to handle consistency and corruption issues as part of the file access.

Abstract: An apparatus and method for reducing the time required to search for files in a file system are provided. The apparatus includes a first calculating unit which calculates a first hash value of the file name of a file among a plurality of files included in a file entry, a second calculating unit which calculates a first result value based on the first hash value, a mapping-table-generating unit which generates a mapping table indicating a mapping relation between the first result value and entry numbers of the file having the first result value, and a control unit which manages a plurality of files included in the file entry based on the mapping table.

Abstract: A server system receives a first request for a data item from a web application on a client device, wherein the first request includes an identifier of the data item. In response to the first request, the server system calculates a first checksum of the data item and sends the data item and the first checksum to the web application, for storage in the local database. The server system receives a second request for the data item from the web application, calculates a second checksum of the data item and compares the first and second checksums. The server system, determines that the data item has been updated by comparing the first checksum to the second checksum; and in response to determining that the data item has been updated, the server system a reply to the web application a indicating that the data item has been updated.

Abstract: Systems and methods are disclosed for verifying the accuracy of reported information. The systems and methods may include generating a hash based on ingredient data related to the creation of a report, storing the hash and the ingredients in a database, the hash being associated with the ingredient data in the database, and outputting the report, the report including the hash. Furthermore, the systems and methods may include receiving an input, the input being based on a first hash of ingredient data related to the creation of the report and determining if the database contains a record corresponding to the input. Moreover, the systems and methods may include outputting information contained in the record corresponding to the input if it was determined that the database contains the record corresponding to the input, the information contained in the record comprising the ingredient data.

Abstract: A method provides access to a data entity having a basis version and the creation of derived versions. The method includes a creating procedure for creating a derived version, by carrying out one or more operations on the basis version, storing them, and accepting them. The method further includes a providing procedure for providing access to the derived version through first addresses mapped to second addresses of the basis version and of the accepted one or more operations, by reconstructing the derived version based on the basis version and the accepted one or more operations.