Abstract: Techniques are used for balancing load on a storage system according to multiple variables. The techniques may be used to provide, among other things, defining, across at least two variables, a balance constraint for a load on a storage system. Among a set of transfers of volumes from one node to another node in the storage system, a transfer of a volume that minimizes the distance between the load and an ideal balanced state of the storage system is identified. The identified transfer of a volume is added to a combination of transfers of volumes. Whether the combination of transfers of volumes meets the balance constraint is determined. If the combination meets the balance constraint, the combination is selected as a solution to balance the load.

Abstract: A technique for performing load balancing between storage nodes includes generating a first performance metric for volumes accessed through a first storage node and generating a second performance metric for volumes accessed through a second storage node. The volumes accessed through the first storage node include a set of volumes that belong to a NAS (network-attached storage) file server hosted by the first storage node. In response to detecting a load imbalance based on the first performance metric and the second performance metric, the technique further includes moving the NAS file server from the first storage node to the second storage node and hosting the set of volumes that belong to the NAS file server from the second storage node.

Abstract: Determining and using deduplication estimates may include: determining two deduplication sample indexes (DSIs) for two logical device sets each including one or more logical devices, determining a Jaccard Similarity for the two DSIs, wherein the Jaccard Similarity denotes a measurement of similarity and mutual deduplication between the two logical device sets; determining, in accordance with one or more criteria, whether the two logical device sets should be located in different data storage systems or a same data storage system that performs data deduplication, wherein the one or more criteria uses the Jaccard Similarity in determining whether to locate the two logical device sets in the same data storage system or the different data storage systems; and responsive to determining that the two logical device sets should be located in the same data storage system, locating the two logical device sets in the same data storage system.

Abstract: Load balancing may include: receiving I/O workloads of storage server entities that service I/O operations received for logical devices, wherein each logical device has an owner that is one of the storage server entities that processes I/O operations directed to the logical device; determining normalized I/O workloads corresponding to the I/O workloads of the storage server entities; determining, in accordance with utilization criteria, imbalance criteria and the normalized I/O workloads, whether to rebalance the I/O workloads of the storage server entities; and responsive to determining to rebalance the I/O workloads of the storage server entities, performing processing to alleviate a detected I/O workload imbalance between two storage server entities. The processing may include moving logical device from a first storage server entity to a second storage server entity; and transferring ownership of the logical device from the first to the second storage server entity.

Abstract: Data units of a dataset may be compressed by clustering the data units into clusters, selecting a reference unit for each unit cluster, and compressing data units of each unit cluster using the reference unit of the unit cluster as a dictionary. The computational efficiency of the clustering algorithm may be improved by not applying it to data units themselves, but rather to hash values of the data units, where the hash values have a much smaller size than the data units. The hash function may be a locality-sensitive hash (LSH) function. The reference unit of a cluster may be determined in any of a variety of ways, for example, by selecting a centroid or exemplar of the cluster. Clusters, including their references values, may be indexed in a cluster index (e.g., a Faiss index), which may be searched to assign future added or modified data units to clusters.

Abstract: Determining and using deduplication estimates may include: determining two deduplication sample indexes (DSIs) for two logical device sets each including one or more logical devices, determining a Jaccard Similarity for the two DSIs, wherein the Jaccard Similarity denotes a measurement of similarity and mutual deduplication between the two logical device sets; determining, in accordance with one or more criteria, whether the two logical device sets should be located in different data storage systems or a same data storage system that performs data deduplication, wherein the one or more criteria uses the Jaccard Similarity in determining whether to locate the two logical device sets in the same data storage system or the different data storage systems; and responsive to determining that the two logical device sets should be located in the same data storage system, locating the two logical device sets in the same data storage system.

Abstract: A system is for use with a data communication network that includes a plurality of servers and a plurality of programs to be run by the servers to provide a plurality of services to devices communicating with the servers over the network. The system comprises a memory that contains computer-readable and computer-executable instructions, and a processor coupled to the memory and configured to read and execute the instructions, the instructions being configured to cause the processor to determine a suggested mapping of the programs to the servers that is different than a current mapping of the programs to the servers.

Abstract: A system for use in a network that includes a plurality of clients and a plurality of servers configured to provide services includes at least one interface configured to communicate with the clients and the servers, a memory that contains computer-readable and computer-executable instructions, and a processor coupled to the at least one interface and to the memory and configured to read and execute the instructions, the instructions being configured to cause the processor to: analyze a client-service communication, received from one of the clients by the at least one interface, for a client identifier associated with the client originating the client-service communication and for a virtual service identifier associated with an intended service of the client-service communication; perform network address translation on the client-service communication to produce a modified client-service communication, the translation including translating the virtual service identifier to an actual service identifier of the

Abstract: A method and system for improving utilization of the typical DBMS client-server configuration is provided. Specifically, the present invention can include a Database Switch (dBSwitch) situated between the applications and database servers in a network, capable of dynamically and transparently connecting applications to databases using standard database servers and standard protocols. The Database Switch appliance performs this database routing in real time, with high bandwidth and negligible latency. The Database Switch enables the formation of a Database Area Network (DAN) architecture, which promotes database virtualization by integrating the database servers, the shared storage, and the interconnecting network, making them appear to be one large, scalable database server. This DAN architecture yields high utilization, high availability, scalability on demand, simplified management and security, in a shared and heterogeneous application environment.

Abstract: A method and system for visualizing relatively large amounts of data in a limited display space includes segmenting the data, mapping each segment to a node within the display space based on a specified nodal layout, texture mapping each graphical display of each segment of data to its node, and displaying the data in each node of the display space as mapped. This visualization scheme enables a user to map a relation to a specification of an N-dimensional display, by designating how attributes are to be used to get a desired segmentation, layout and presentation and enables a user to explore the data with various exploring features including real time continuous scaling.

Abstract: The present invention is a method and system for using materialized views to compute answers to SQL queries with grouping and aggregation. A query is evaluated a using a materialized view. The materialized view is semantically analyzed to determine whether the materialized view is usable in evaluating an input query. The semantic analysis includes determining that the materialized view does not project out any columns needed to evaluate the input query and determining that the view does not discard any tuple that satisfies a condition enforced in the input query. If the view is usable, the input query is rewritten to produce an output query that is multi-set equivalent to the input query and that specifies one or more occurrences of the materialized view as a source of information to be returned by the output query. The output query is then evaluated. The semantic analysis and rewriting may be iterated, with the output query of each iteration being the input query of the next iteration.

Abstract: A method for making data objects having hidden pointers persistent is disclosed. A pre-existing process for creating data objects is modified so as to selectively inhibit both the allocation of memory space for the data object and the initialization of data within the data object. A data object with hidden pointers created by a previous program invocation is retrieved into memory by a subsequent program invocation. The modified object creation process is then advantageously applied to the data object. As a result, the hidden pointers within the data object are initialized without allocating new memory or disturbing the data within the data object. Where the object creation process includes the execution of a user supplied initialization function, the initialization function is modified so as to inhibit the initialization of data within the data object. A global flag is set by the object creation process and tested within the initialization function.