Abstract: An architecture for use in packet processing and supporting compatibility with current BSD implementations for packet processing is proposed wherein two MBUF formats are supported. A first format includes a header portion and a data portion for storing data therein. A second format includes a header portion but is absent a data portion and is for addressing data stored within a cluster and external to the MBUF itself.

Abstract: A computerized system that implements a type system can process one or more XML documents that comprise unknown schema elements, which may not correlate within one or more types in the type system. In one implementation, for example, a computer system receives one or more XML document feeds and deserializes only those schema elements that correlate with one or more system types. The computer system further passes the unknown schema elements to a buffer. An application program, such as an XML reader, can extract the unknown schema elements from the buffer as appropriate. In one implementation, for example, the application program maintains its own types separately from the system types. The application program can then correlate its application-specific types with the buffered schema elements to deserialize and process the buffered schema elements.

Abstract: Control statements related to inputting, sorting, filtering, formatting, and outputting data records in a data processing system are scanned to find one or more formatting options related to character translation. Files comprising a plurality of data records are input, processed, and output as directed by the control statements. As specified by the formatting options, character translation operations are conducted on selected characters. The character translation operations are conducted in conjunction with inputting and outputting the data records. In one embodiment, the supported character translation operations include lowercase to uppercase conversion, uppercase to lowercase conversion, EBCDIC-to-ASCII conversion, ASCII-to-EBCDIC conversion, and user-definable character translation. The present invention increases the utility of a data processing system while minimizing the programming burden associated with translating selected characters while processing data records.

Abstract: The invention relates to a device for monitoring physical objects that comprises one or more short-range remote readers (13), memory elements (5) to be attached to physical objects, and a controller (15) adapted for executing a reading function capable of interaction with the one or more remote readers in order to acquire data contained in adjacent memory elements, and for executing an integrity validation function capable of distinguishing, from the acquired data, individual identifiers particular to each of the memory elements as well as group description data stored in at least some of said memory elements, and of checking the sufficiency of group description data while checking the compliance of individual identifiers with corresponding group description data.

Abstract: A method for managing a queue, such as for example a FIFO queue, and executing a look-ahead function on the data contained in the queue includes associating to the data in the queue respective state variables (C1, C2, . . . CK), the value of each of which represents the number of times a datum is present in the queue. The look-ahead function is then executed on the respective state variables, preferentially using a number of state variables (C1, C2, . . . CK) equal to the number of different values that may be assumed by the data in the queue. The look-ahead function can involve identification of the presence of a given datum in the queue and is, in that case, executed by verifying whether among the state variables (C1, C2, . . . CK) there exists a corresponding state variable with non-nil value.

Abstract: A set of syntactic extensions that are compiled with a type-directed translation method to facilitate lifting member access on base types to a newly constructed type. The extensions are processed with a type system that facilitates seamless data access to relational and semi-structured data in an object oriented host language.

Abstract: An XML schema is compiled into an annotated automaton encoding, which includes a parsing table for structural information and annotation for type information. The representation is extended to include a mapping from schema types to states in a parsing table. To validate a fragment against a schema type, it is necessary simply to determine the state corresponding to the schema type, and start the validation process from that state. When the process returns to the state, fragment validation has reached successful completion. This approach is more efficient than a general tree representation. Only the data representation of the schema information is handled, making it much easier than manipulating validation parser code generated by a parser generator. In addition, only one representation is needed for schema information for both document and fragment validation. This approach also provides a basis for incremental validation after update.

Abstract: Techniques for object relational mapping in database technologies are described herein. According to one embodiment, in response to a query statement for accessing a relational database, a syntax tree is generated to represent semantic information of the query statement, where the query statement has a boolean parameter and is implemented as an SQL object. A data type of the boolean parameter is predicted based on the semantic information obtained from the syntax tree in view of a structure representing the syntax tree. The boolean parameter is configured to be either a numeric value or a string dependent upon metadata used to map the SQL object to the relational database. Other methods and apparatuses are also described.

Abstract: Validating data of and/or indicating errors of a structured data file using eXtensible Markup Language (XML) elements and/or XML Path (XPATH) expression are described.

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: A system of and method for maintaining data objects in containers across a network of distributed heterogeneous resources in a manner which is transparent to a client. A client request pertaining to containers is resolved by querying meta data for the container, processing the request through one or more copies of the container maintained on the system, updating the meta data for the container to reflect any changes made to the container as a result processing the request, and, if a copy of the container has changed, changing the status of the copy to indicate dirty status or synchronizing the copy to one or more other copies that may be present on the system.

Abstract: Embodiments of the present invention provide a system that tracks progress on a plan. The system starts by receiving a one or more completed plan templates (which constitute plans) from a set of plan providers. The system then stores the plans in a plan database. Next, the system receives a request for a plan, for which the plan database contains one or more plans that can be used to fulfill the request. The system then provides a user interface (UI) to display the plans that fulfill the request. Next, the system receives a selection signal that selects a plan to fulfill the request. The system then displays the selected plan through the UI, which involves initially displaying projected progress on the plan at one or more intervals on a timeline.

Abstract: A system and method for identity decisions and invalidation. Modified objects (e.g., files, executables, etc.) are flagged for reevaluation. Privileges associated with the object are only persisted if the modifications are determined to be authorized (e.g., updates and patches). In one embodiment, a tagging system registers to be notified of all writes, renames, truncations, moves, deletions, or any other relevant modifications to objects. If the tagging system detects a modification operation targeting the object, it invalidates all identity decisions cached with the object. The next time the object runs, the system does not recognize the object and it is forced to reevaluate its identity. Thus, patching and other write operations are still permitted, but the system detects the changed object and reevaluates the identity.

Abstract: A system and method for managing file data during consistency points in a file 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 file system may permit write operations to continue to a file 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: Methods and apparatus for persisting objects to a database are disclosed. A set of meta-level objects (120) are defined, each object also having defined a persistence strategy. Each object also has a set of attributes which have their own respective persistence strategy. An object also can have an association with other objects each carrying respective persistence and attribute definitions. Upon a persistence request occurring, a run-time instance of an object is created carrying attributes and attached persistence strategies. The instantiated object is then executed. By defining objects, attributes and persistence strategies at a meta-level that only are populated at run-time, they each are able to be readily modified to give effect to a desired change in persistence strategy, including which attributes are to be persisted.