Abstract: Data records are linked across a plurality of datasets. Each dataset contains at least one data record, and each data record is associated with an entity and includes one or more attributes of that entity and a value for each attribute. Values associated with attributes are compared across datasets, and matching attributes having values that satisfy a predetermined similarity threshold are identified. In addition, linkage points between pairs of datasets are identified. Each linkage point links one or more pairs of data records. Each data record in the pair of data records is contained in one of a given pair of datasets, and each pair of data records is associated with a common entity having matching attributes in the given pair of datasets. Data records associated with the common entities are linked across datasets using the identified linkage points.

Abstract: Embodiments of the present invention relate to a declarative framework for efficient incremental information integration. In one embodiment, a method of and computer program product for information integration is provided. An integration rule is received. A first data set is accessed. A first representation of the first data is generated set based on the plurality of integration rules. The first representation is flat and includes a plurality of records. At least one index is generated. The index encodes at least one hierarchical relationship among the plurality of records. A second representation is generated of the first representation based on the at least one index. The second representation comprising nested data.

Abstract: Data records are linked across a plurality of datasets. Each dataset contains at least one data record, and each data record is associated with an entity and includes one or more attributes of that entity and a value for each attribute. Values associated with attributes are compared across datasets, and matching attributes having values that satisfy a predetermined similarity threshold are identified. In addition, linkage points between pairs of datasets are identified. Each linkage point links one or more pairs of data records. Each data record in the pair of data records is contained in one of a given pair of datasets, and each pair of data records is associated with a common entity having matching attributes in the given pair of datasets. Data records associated with the common entities are linked across datasets using the identified linkage points.

Abstract: A network switch for reducing TCP timeouts due to incast collapse is disclosed. The network switch has a plurality of buffers for storing network packets for at least one sender server. An incast buffer management component in the network switch allocates a buffer in the plurality of buffers to store an incast notification packet, the incast notification packet indicating one or more network packets that have been dropped by the network switch. The network switch also includes an incast notification component for forwarding the incast notification packet to a destination server with an incast notification packet specific header.

Abstract: Embodiments of the present invention relate to a new method of entity integration using high-level scripting languages. In one embodiment, a method of and computer product for entity integration is provided. An entity declaration is read from a machine readable medium. The entity declaration describes an entity including at least one nested entity. An index declaration is read from a machine readable medium. The index declaration describes an index of nested entities. An entity population rule is read from a machine readable medium. The entity population rule describes a mapping from an input schema to an output schema. The output schema conforms to the entity declaration. A plurality of input records is read from a first data store. The input records conform to the input schema. The entity population rule applies to the plurality of records to create a plurality of output records complying with the output schema. An index of nested entities is populated. The index complies with the index declaration.

Abstract: Embodiments of the present invention relate to a new method of entity integration using high-level scripting languages. In one embodiment, a method of and computer product for entity integration is provided. An entity declaration is read from a machine readable medium. The entity declaration describes an entity including at least one nested entity. An index declaration is read from a machine readable medium. The index declaration describes an index of nested entities. An entity population rule is read from a machine readable medium. The entity population rule describes a mapping from an input schema to an output schema. The output schema conforms to the entity declaration. A plurality of input records is read from a first data store. The input records conform to the input schema. The entity population rule applies to the plurality of records to create a plurality of output records complying with the output schema. An index of nested entities is populated. The index complies with the index declaration.

Abstract: An example method for allocating resources in accordance with aspects of the present disclosure includes collecting proposals from a plurality of modules, the proposals assigning the resources to the plurality of modules and resulting in topology changes in a computer network environment, identifying a set of proposals in the proposals, the set of proposals complying with policies associated with the plurality of modules, instructing the plurality of modules to evaluate the set of proposals, selecting a proposal from the set of proposals, and instructing at least one module associated with the selected proposal to instantiate the selected proposal.

Abstract: Example embodiments relate to work conserving bandwidth guarantees using priority. In some examples, a method may include determining VM-to-VM bandwidth guarantees between a source virtual machine (VM) and at least one destination VM, including a particular VM-to-VM bandwidth guarantee between the source VM and a particular destination VM. The method may include monitoring outbound network traffic flow from the source VM to the particular destination VM. The method may include comparing the outbound network traffic flow to the particular VM-to-VM bandwidth guarantee. When the outbound network traffic flow is less than the particular VM-to-VM bandwidth guarantee, packets of the flow may be directed according to a first priority. When the outbound network traffic flow is greater than the particular VM-to-VM bandwidth guarantee, packets of the flow may be directed according to a second priority.

Abstract: Embodiments relate to entity resolution. One aspect includes creating a deterministic model by defining an entity to be resolved, selecting two datasets for comparison, defining matching predicates for attributes of the datasets to select a set of candidate matches, and defining a precedence rule for the candidate matches to select a subset of the candidate matches. An aspect further includes running the deterministic model on the two datasets. Running the deterministic model includes applying the matching predicates and the precedence rule to data in the datasets that correspond to the attributes. An aspect also includes applying a cardinality rule to results of the running, and outputting the matching candidates for which the cardinality rule is satisfied.

Abstract: Embodiments of the present invention relate to a declarative framework for efficient incremental information integration. In one embodiment, a method of and computer program product for information integration is provided. An integration rule is received. A first data set is accessed. A first representation of the first data is generated set based on the plurality of integration rules. The first representation is flat and includes a plurality of records. At least one index is generated. The index encodes at least one hierarchical relationship among the plurality of records. A second representation is generated of the first representation based on the at least one index. The second representation comprising nested data.

Abstract: According to an example, a cloud bandwidth modeling system may determine components for an application, create a vertex for each component in a graph representing a bandwidth model for the application, determine bandwidth requirements between each component, and create directed edges between the components to represent the bandwidth requirements.

Abstract: According to an example, a method for bandwidth guarantee and work conservation includes determining virtual machine (VM) bandwidth guarantees assigned to VMs in a network including a source VM that communicates with destination VMs. The method further includes assigning minimum bandwidth guarantees to communications between the source VM with the destination VMs by dividing a VM bandwidth guarantee assigned to the source VM between the destination VMs based on active VM-to-VM communications between the source VM and the destination VMs. The method also includes allocating, by a processor, spare bandwidth capacity in the network to a communication between the source VM and a destination VM based on the assigned minimum bandwidth guarantees.

Abstract: Embodiments of the present invention relate to a new method of entity integration using high-level scripting languages. In one embodiment, a method of and computer product for entity integration is provided. An entity declaration is read from a machine readable medium. The entity declaration describes an entity including at least one nested entity. An index declaration is read from a machine readable medium. The index declaration describes an index of nested entities. An entity population rule is read from a machine readable medium. The entity population rule describes a mapping from an input schema to an output schema. The output schema conforms to the entity declaration. A plurality of input records is read from a first data store. The input records conform to the input schema. The entity population rule applies to the plurality of records to create a plurality of output records complying with the output schema. An index of nested entities is populated. The index complies with the index declaration.

Abstract: Data records are linked across a plurality of datasets. Each dataset contains at least one data record, and each data record is associated with an entity and includes one or more attributes of that entity and a value for each attribute. Values associated with attributes are compared across datasets, and matching attributes having values that satisfy a predetermined similarity threshold are identified. In addition, linkage points between pairs of datasets are identified. Each linkage point links one or more pairs of data records. Each data record in the pair of data records is contained in one of a given pair of datasets, and each pair of data records is associated with a common entity having matching attributes in the given pair of datasets. Data records associated with the common entities are linked across datasets using the identified linkage points.

Abstract: A computer-implemented method for use with an extensible markup language (XML) document includes inputting a high-level mapping specification for a schema mapping; and generating a target XML document based on the mapping. The method may perform schema mapping-based XML transformation as a three-phase process comprising tuple extraction, XML-fragment generation, and data merging. The tuple extraction phase may be adapted to handle streamed XML data (as well as stored/indexed XML data). The data merging phase may use a hybrid method that can dynamically switch between main memory-based and disk-based algorithms based on the size of the XML data to be merged.

Abstract: A network switch for reducing TCP timeouts due to incast collapse is disclosed. The network switch has a plurality of buffers for storing network packets for at least one sender server. An incast buffer management component in the network switch allocates a buffer in the plurality of hullers to store an incast notification packet, the incast notification packet indicating one or mote network packets that have been dropped by the network switch. The network switch also includes an incast notification component for forwarding the incast notification packet to a destination server with an incast notification packet specific header.

Abstract: Embodiments of the invention relate to correlating schema mappings. In one embodiment, a set of schema mappings over a source schema and a target schema are received. Each of the schema mappings is decomposed into a basic schema mapping. A first set and second set of relations re determined for the source schema and the target schema, respectively. Each relation in the first set of relations is paired to at least one relation in the second set of relations. The pairing forms multiple relation pairs between the first set and second of relations in the form of (T, T?), where T is a source portion of a relation pair and T? is a target portion of the relation pair. A set of basic schema mappings is identified that matches the relation pair. Each basic schema mapping is merged into a single schema mapping.

Abstract: Methods, systems and computer program products for interactive generation of integrated schemas. Exemplary embodiments include a method for schema integration, the method including recasting a first source schema into a first graph of concepts with HasA relationships, recasting a second source schema into a second graph of concepts with HasA relationships, identifying matching concepts in the first graph and the second graph based on correspondences between attributes of the concepts of the first and second graphs, producing an integrated schema, based on a fixed specification of matching concepts to merge, and generating a mapping from the first source schema to the integrated schema and from the second source schema to the integrated schema.

Abstract: A method, system and program product for specifying, in a schema mapping framework, a mapping between a source schema and a target schema. The source and target schemas are schemas included in respective groups of registered, heterogeneous schemas. The source and target schemas may be of different types. Serialized versions of the source and target schemas include source objects and target objects, respectively. A mapping model is serialized into mapping objects that include logical references representing the source objects and logical references representing the target objects. The logical references are resolved to the source objects and target objects, thereby storing pointers to the source objects and to the target objects. After resolving the logical references, the mapping model includes the logical references and the pointers to the source and target objects.

Abstract: A method and system for processing a schema mapping M from a source schema S to a target schema T by executing program code on a processor of a computer system. A schema mapping M? from T to S is determined via processing the schema mapping M. The schema mapping M includes at least one constraint ?. Each constraint ? consists of a source-to-target tuple-generating dependencies (s-t tgd). The schema mapping M? includes at least one constraint ??. Each constraint ?? consists of a disjunctive tgd with constants and inequalities among the constants. The schema mapping M? is stored in at least one computer usable storage device of the computer system and/or is outputted in at least one output device of the computer system.