Abstract: A device may include a flow table to store, in flow table records, statistics associated with a number of data flows, and a flow type table to store, in flow type table records, information that indicates whether to store statistics in the flow table for each of a number of types of data flows, information that indicates a manner for sampling data units associated with the data flows, and/or information that indicates when to delete flow table records from the flow table.

Abstract: A method of storing data in a database, the database defining a table and the data comprising at least one record. Each record comprises values for at least one field. The method comprises storing a plurality of schemas, each schema defining a respective set of fields associated with said table, wherein each of said records is associated with identification data identifying one of said schemas.

Abstract: Business application adaptation to changes in business processes is enabled through real time modification of business application schema and metadata at runtime employing business rules to accommodate changing business processes without a need to change the underlying data and models. A business application user interface reacts to runtime changes and enforces validation and business rules as if the changes are made to the underlying structure.

Abstract: A current key is received at a current arrival time at a computer. An index in an array corresponding to the current key is determined using a hash function. A previous key and a previous arrival time are retrieved from the array at the index. The array is transformed by replacing the previous key and the previous arrival time with the current key and the current arrival time in the array at the index. The previous key and the previous arrival time are inserted into a nearest eligible sequential index in the array.

Abstract: In one general aspect, an apparatus can include a completion identifier configured to identify, for completion processing, a large object (LOB) deleted from an auxiliary table within a DB2 database environment based on a space map record associated with the large object where the auxiliary table functions as an auxiliary space to a base table. The apparatus can also include a completion analyzer configured to identify a resource where an image of the large object is stored at a time before the deletion of the large object from the auxiliary table.

Abstract: Within a system comprising a processor and a memory, a method that includes, via the processor, receiving a schema as an input. For each element in the schema, the method can include parsing the element from the schema, validating the parsed element, generating a parse tree node for the parsed element, and adding the parse tree node to a schema parse tree. The method further can include outputting the schema parse tree.

Abstract: Within a system comprising a processor and a memory, a method that includes, via the processor, receiving a schema as an input. For each element in the schema, the method can include parsing the element from the schema, validating the parsed element, generating a parse tree node for the parsed element, and adding the parse tree node to a schema parse tree. The method further can include outputting the schema parse tree.

Abstract: The described implementations relate to updating views in a database system. One implementation can identify an active view that retrieves records from a database and determine one or more physical tables in the database that are referenced by the active view. The implementation can track one or more columns in the physical tables that are used by the active view and identify a change to the physical tables in a transaction log of the database. If the change does not affect the one or more columns, the change can be treated as an ignorable change for the active view.

Abstract: Embodiments of the invention may provide an approach for managing electronic records in a content management system. The content management system may use a container structure to create, edit, and manage electronic records in a coordinated way. The container structure may include a master container and a plurality of sub-containers. An associated method generally may include receiving a request comprising a record and one or more properties associated with the record; determining, from the one or more properties associated with the record, a date; based on the date of the record, associating the record with a sub-container of the container structure; and managing disposition of the sub-container based on an associated policy.

Abstract: A method and system for processing data for database modification, include receiving a set of data, performing a processing chain including a plurality of consecutive jobs to transform the set of data into transformed data, modifying a production database with respect to the transformed data and further include the steps of setting a target processing time for the performance of the consecutive jobs, before a launch of a first job, applying an original configuration as current configuration defining a parallelization level for each of the consecutive jobs, before a launch of at least one further job after the first job, upon an actual remaining processing time being out of a range of acceptable remaining processing times, applying an adapted configuration as new current configuration defining an adapted parallelization level for each of the jobs remaining in the processing chain, the adapted configuration differing from the current configuration.

Abstract: A technique includes, in a first computer system, archiving data for a plurality of environments. Each of the environments are associated with a different combination of an active data source selected from a plurality of active data sources and an archive target selected from a plurality of archive targets. The technique includes capturing a partial snapshot of the archiving, the partial snapshot is associated with one environment for the plurality of environments such that the partial snapshot may be used to replicate said archiving associated with the one environment on another computer system.

Abstract: According to an aspect of the present principles, a method is provided for generating resource description framework benchmarks. The method includes deriving a resultant benchmark dataset with a user specified size and a user specified coherence from and with respect to an input dataset of a given size and a given coherence by determining which triples of subject-property-object to add to the input dataset or remove from the input dataset to derive the resultant benchmark dataset.

Abstract: A system and method for use with garbage collected systems and languages, for enabling an allocated heap memory to be updated (e.g., increased or decreased) at runtime, subject to sufficient availability of physical memory. In accordance with an embodiment, a Java Virtual Machine (JVM) is associated with a management console, which allows a systems administrator to monitor current heap utilization at runtime. The heap is visualized as a contiguous chunk of memory with one or more extension points, e.g., by use of a trailing pointer to a null list. If later, at runtime, the heap size needs to be incremented then the trailing pointer can be set to a new chunk of memory with a size of (new value?old value), so that the cumulative new size is made equal to a new value specified on the console. The new chunk of memory can again end with a trailing pointer, to allow for further extension.

Abstract: A steam-based document storage and retrieval system accepts documents that are in diverse formats and come from diverse application, automatically creates document model objects describing these documents in a consistent format and associating time stamps with the documents to automatically create a main stream in chronological order. The stream, or sub-streams meeting selected search criteria, are displayed in a variety of forms, including a receding, partly overlapping stack with aids that facilitate user interaction.

Abstract: The present invention concerns a method for processing a structured document to render, such as XML or HTML files. The method comprises the steps of: parsing the structured document into parsed tokens TK of structured data; constructing a first tree structure DTree storing the structured data of parsed tokens; constructing a render tree structure RTree storing the document content to render, said render tree structure being synchronized with the first tree structure; rendering the structured document based on the render tree structure RTree; wherein constructing the first tree structure DTree comprises deciding, for each parsed token TK, whether or not the parsed token is to be stored in said first tree structure, and storing the structured data of the parsed token therein only in case of positive decision. Partial first (DOM) tree DTree is therefore stored in memory, reducing memory use and processing time before rendering the structured document.

Abstract: A system and method comprising: receiving itinerary data from at least two sources; identifying a traveler associated with the itinerary data; and adding information about the identified traveler to the itinerary data.

Abstract: A modular method of composing an ontology alignment provides a set of correspondences between at least two ontologies thereby allowing a composition of an optimal alignment by balancing a recall value and a precision of the alignment. A two-fold strategy is followed. By means of mapping functions a set of alignment correspondences is determined. Depending on a particular mapping function a recall value of the alignment can be improved by an extension of the set of correspondences. By filtering functions particularities of the domain are reflected and incorrect mappings are avoided. Depending on a particular filtering function a precision value of the alignment can be improved by restricting the set of correspondences.

Abstract: A computer-executable application is provided with access to resources generated using a principal model. A decoration model associated with the principal model is instantiated for use by the application. The application is provided with access to an object of the decoration model responsive to a request by the application to access an object of the principal model. The decoration model object corresponds to the principal model object.

Abstract: A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.

Abstract: Management device for a network of audiovisual information reproduction systems or jukeboxes, including a database with a plurality of sets of arrays, each array containing grouped information either about the composition of a jukebox, or the use of the jukebox, or the payment of fees. The database is managed by a computer server connected with the audiovisual information reproduction systems to receive messages sent by each audiovisual information reproduction device and containing information necessary to update determined sets of arrays in the database, and update data or the program for each audiovisual information reproduction device with information stored in at least one set of arrays in the database and transmitted in this message.

Abstract: Embodiments are disclosed for performing automation services. Automation services are, in embodiments, applications, processes, or systems capable of converting an initial file into a converted file having a different file type from the initial file. In embodiments, a requestor generates a conversion request message. The conversion request message may contain information about the desired conversion, options to be performed during the conversion, and an initial file that is to be converted. The initial file may be represented by a data stream that is part of the request message. The request message is sent to a file converter that performs the desired request on the data stream to create a converted file.

Abstract: A method of resizing a concurrently accessed hash table is disclosed. The method includes acquiring the locks in the hash table. The hash table, in a first state, is dynamically reconfigured in size into a second state. Additionally, the amount of locks is dynamically adjusted based on comparing the size of the hash table in the second state to the size of the hash table in the second state.

Abstract: Database table aggregation is implemented by a method that includes encoding first and second components via a waveform definition, the first and second components specifying criteria for aggregating data. The method also includes generating a complex waveform representing the components in a pattern corresponding to the waveform definition and criteria, which spans a first axis indicative of a time period for aggregating the data. The method further includes providing a byte count for aggregated data stored in a first table defined by the criteria, aggregating the data for the time period, and creating a second table for overflow data when the count is exceeded. The method also includes updating the complex waveform to reflect results of the aggregation that includes generating a waveform representing the second table along a second axis depicted at a location corresponding to a time in which the data aggregation for the first table was initiated.

Abstract: An application server reads components data from a component information system (CIS) of a database server connected to the application server. The components data are converted to HDL data. If the converted HDL data includes illegal characters, a user is prompted to modify the illegal characters. If the converted HDL data does not include illegal characters, the application server amends formats of the converted HDL data according to requirements of each client connected to the application server. Each client includes a drawing unit. The application server controls the drawing unit to draw circuit diagram using the HDL data with the amended formats.

Abstract: A most recently used (MRU) client synchronization engine is provided to synchronize a user's most recently used (MRU) document list associated with a client machine with a file hosting server's MRU document list. The file hosting server's MRU document list contains a list of the user's most recently used documents that are stored on the file hosting server. The user's documents that are stored on the file hosting server are accessible to the user on one or more web-enabled client machines. The MRU client synchronization engine analyzes registry data pertaining to the documents that a user uses on the client machine with the file hosting server's MRU document list to determine the user's most recently used documents.

Abstract: The present invention relates to a method for providing data during an Application Selection process from a processing device to an interface device, wherein it comprises a step of modifying dynamically at least a part of said data from transaction to transaction, said at least part of data being a dynamic data.

Abstract: An event recording is received. The event is associated with an event entity and occurs over an event duration at an event location. A tag is received responsive to user interaction with a communication device. The tag is associated with at least one of the particular entity associated with the event entity, a particular time period associated with the event duration, and a particular location associated with the event location. Additional information associated with the event recording is received, and the tag is matched with at least a portion of the event recording based on at least one of the particular entity, the particular time period, and the particular location associated with the received tag. The portion of the event recording matching the received tag is presented for review along with the received additional information associated with the event recording.

Abstract: A storage abstraction system is described herein that exposes storage from an operating system as a uniform storage device and abstracts from applications the selection of a particular storage location and different properties of storage devices. The application provides the data to store and some information about the application's goals for storing the data, and lets the operating system route the data to the right place based on the data's characteristics. The operating system may choose to store data anywhere from L2 cache to a cloud-based storage service and anything in between, based on information about the data's persistence requirements, expected usage, access frequency, security needs, and so forth. The system lets applications and users focus on expressing their goals and needs for the data, and lets the operating system manage the hardware.

Abstract: Systems and methods for optimal data storage are provided. The method comprises storing data objects that are most closely related in a storage container by modeling a constraint satisfaction problem for placement of said data objects in one or more storage containers, wherein a weight is assigned to an edge connecting two data objects based on an association defining relationships between the two data objects connected by said edge, taking into account certain penalties for placing multiple copies of the same object in the one or more storage containers, and wherein a storage container comprises a logical or physical storage area as a unit of storage.

Abstract: Methods for ex vivo perfusion of organs (and/or tissues) with a perfusate designed to condition the organ with the desired effect being that upon transplant, said organ, having been administered said perfusate, is less likely to experience delayed graft function, deleterious effects of ischemia/reperfusion injury, including inflammatory reactions, and/or other detrimental responses that can injure the organ or recipient including precipitating or enhancing an immunological reaction from the recipient with the potential of compromising the graft's and/or recipients short teen and/or long term health and proper functionality while monitoring, sustaining and/or restoring the viability of the organ and preserving the organ for storage and/or transport.

Abstract: Aspects of a multi-level electrical distribution control system associated with an electrical distribution grid are disclosed. Data access and processing across the multi-level control system and the electrical distribution grid can provide improved utilization of energy within the electrical distribution grid. Further, dynamic reconfiguration of the electric distribution grid can be based distributed processing and access to information relating to the electrical distribution control system or electrical distribution grid. An encapsulated DNNC data element is disclosed as an efficient and secure means of accessing data across the multi-level electrical distribution control system or the associated electrical distribution grid.

Abstract: The present disclosure pertains to collecting various different ways of designating a destination address or physical location (Source Databases A,B,C), and associating them to a single, canonical form (Canonical Database, FIG. 2). The canonical form can be conveniently used to route an item for delivery (process FIG. 3). The present disclosure solved the problem where there is either no “proper” address or there are a plurality of them (e.g. different addresses for the same house) (FIG. 1). Preferably, a meta-database (FIG. 5) links across the multiple source databases (A,B,C) and logically connects their contents to the canonical address database, wherein each delivery location has a single associated canonical address designator (532), and each address designator in each source database (536, 538) that refers to that delivery point is linked by the meta-database to that associated canonical designator.

Abstract: A method, system and computer readable storage medium for replicating procedures with unsupported table data type arguments such as Boolean arguments. The method includes identifying the argument of an unsupported table data type in a procedure to be replicated, mapping the argument to an equivalent supported value, and creating a table containing a column representing the argument as the supported table data type and sending data corresponding to the unsupported table data type argument to a replication server.

Abstract: A method, system and computer readable storage medium for replicating structured data stored in a database. The method includes identifying the stored structured data, mapping the data to an unstructured data type, and sending the mapped data to one or more replicate databases as unstructured data.

Abstract: Systems and methods for managing and evaluating a social network. The social network is represented as a graph structure and stored in distributed memory. A viable path from one node that is not directly connected to another node in the graph structure may be determined by traversing the graph in stages, moving outward from each node in stages until common midpoint nodes are found providing a connection between the nodes. When midpoint nodes are found, the paths connecting the one node to the other node may be reconstructed.

Abstract: An information processing apparatus includes a processing unit configured to monitor a storage area and to process data in response to the data being stored into the storage area, a storage unit configured to store setting information containing area information indicating the storage area monitored by the processing unit, a readout unit configured to read out the setting information from the storage unit, and a control unit configured to determine whether the storage area monitored by the processing unit exists based on the setting information, and to enable a user interface for receiving a user operation to store the data into the storage area determined to exist.

Abstract: A network intelligence solution (“NIS”) is arranged to access a stream of IP (Internet Protocol) packets associated with communications over a network between a network access device and a server. The NIS performs deep packet inspection (“DPI”) to extract a volume of information from the accessed stream that conforms to at least one discrimination criteria and further utilizes an evaluation model that applies rules to filter the volume of information to distinguish user-initiated traffic flowing across the network from non-user-initiated traffic. The filtered results are written to a database and may be analyzed to determine network usage and/or other network characteristics.

Abstract: A method for data storage is disclosed. The method includes the following steps: establishing an entity table for storing entity information in a database (901); storing the entity information into the entity table (902); establishing a state table for storing state information of the entity in the database (903); storing the state information of the entity into the state table (904); associating the entity table with the state table (905); associating the state tables by using time dimension (906). A data storage structure and a method for storing and inquiring data in the data storage structure are also disclosed.

Abstract: A method includes providing a columnar database comprising a plurality of columnar data structures associated with one column attribute; providing first data records having a plurality of first attribute-value pairs comprising counting information indicative of a number of first data records having the respective first attribute-value pair; providing mask data structures comprising one or more second attribute-value pairs; selecting second data records by intersecting the columnar data structures and the mask data structures; selecting one of the column attributes and one value contained in the column data structure associated with said selected column attribute as the destination attribute-value pair; creating one second rule for each first attribute-value pair; calculating, for each second rule, a co-occurrence-count between its respective source attribute-value pair and its destination attribute-value pair; and specifically selecting one or more of said second rules as the first rules in dependence on the

Abstract: A database system comprising a node value stored in a first electronic data memory device sector. A lock state and access visa associated with the node value, such that if the visa is non-zero, the visa must be presented to access the node. A notification field associated with the node value, the notification field stored in a second electronic data memory device sector. An update processor configured to electronically retrieve and process the notification field if the node value is modified.

Abstract: Methods and apparatus that identify a change of resources in a device to a first backup source are described. In response to receiving a token from the first backup source for authorization to a second backup source, the change of resources can be backed up to the second backup source with the token. The change of resources can be committed to the first backup source if the back up of the change to the second backup source is successful.

Abstract: Systems and methods are disclosed for tracking the content of building information models. Embodiments include various computer-implemented methods for the tagging of BIM information, and for the monitoring of modification events involving BIM information. In addition, activities involving physical elements associated with BIM information are tracked. Providers of BIM content can tag content prior to distribution, enabling an internet-based service to track usage, enabling improved service to consumers of that BIM content. Designers can tag BIM content and BIM elements for tracking during the useful life of a building. Internet based messaging protocols can be used for communication between web services, client services and client applications. Monitoring and communication services function unattended. The system includes integration with BIM design applications, as well as stand-alone, end user system applications and browser interfaces. Analytic tools can be used to report on the tracking data.

Abstract: Systems and methods for manipulating and archiving web content. A uniform resource locator (URL) associated with a network resource is obtained. A virtual copy of the network resource is rendered by accessing the network resource and associated resources using the URL, where the associated resources include presentation data. A client-side representation of the network resource is stored based on the rendering of the virtual copy of the network resource. At least one irrelevant data pattern in the virtual copy of the network resource is identified. The virtual copy of the network resource is manipulated by applying client-side scripting language code to remove irrelevant data associated with the at least one irrelevant data pattern. One or more linked URLs present in the virtual copy of the network resource are recursively processed.

Abstract: Systems, methods, and other embodiments associated with information management are described. One example method includes controlling a computerized process to discover an information management client and one or more information management entities associated with the information management client. The example method may also include determining a data movement plan and executing the data movement plan.

Abstract: Systems and methods for hosting variable schema data such as dynamic tables and columns in a fixed physical database schema. Standard objects, such as tables are provided for use by multiple tenants or organizations in a multi-tenant database system. Each organization may add or define custom fields for inclusion in a standard object.

Abstract: An apparatus and method of searching for an instance path based on an ontology schema are provided. The method of searching for an instance path based on an ontology schema, which is performed by an instance path search apparatus, includes (a) receiving two or more keywords from a user and generating a pair of instances with respect to the keywords, respectively, (b) extracting a pair of classes corresponding to each of the pairs of instances from an ontology instance database, respectively, (c) obtaining an ontology schema path with respect to each of the pairs of classes from an ontology schema path database, respectively, and (d) replacing start and end classes with corresponding first and second instances in each of the ontology schema paths and searching for an instance path connected between the first instance and the second instance, respectively.

Abstract: Access to hierarchical data stored in a database is facilitated by using an ordered flat file that maintains the hierarchical organization of the data. Queries against the hierarchical data are processed by accessing the ordered flat file rather than the underlying database. The speed of accessing the ordered flat file is increased by using memory mapping the ordered flat file. Changes to the data in the underlying database are reflected in real-time without regenerating the ordered flat file by employing an overflow area for storing changes to elements that cannot be made within the ordered flat file.

Abstract: The invention relates to a server connected to a network on which a database application is running for collecting and managing data. The server is connected to several machine tools and has means for receiving identification data and/or identification data and/or operating parameters and/or dynamic information items with respect to the tools. Static information about the tools are stored in the database, and the server processes the received data, parameters and information items to generate updated information about the tools.

Abstract: An embodiment of the invention provides a method for anonymizing data from multiple data sources according to an embodiment of the invention. The data sources include record identifiers identifying entities associated with the data, wherein the record identifiers are only stored by the data sources. The data is collected by a central data aggregation module connected to the data sources. A record identifier is received by an anonymization engine from a first data source; and, a first anonymous identifier is generated with the anonymization engine to replace the record identifier. A map is sent to a mapping module if the anonymization engine has anonymized the record identifier before, wherein the map includes a list of anonymous identifiers that have been used to replace the record identifier. The first anonymous identifier and first data associated with the first anonymous identifier are sent to the data aggregation module.

Abstract: Embodiments of the present invention relate to synchronously replicating data in a distributed computing environment. To achieve synchronous replication both an eventual consistency approach and a strong consistency approach are contemplated. Received data may be written to a log of a primary data store for eventual committal. The data may then be annotated with a record, such as a unique identifier, which facilitates the replay of the data at a secondary data store. Upon receiving an acknowledgment that the secondary data store has written the data to a log, the primary data store may commit the data and communicate an acknowledgment of success back to the client. In a strong consistency approach, the primary data store may wait to send an acknowledgement of success to the client until it receives an acknowledgment that the secondary has not only written, but also committed, the data.