Abstract: Some embodiments are directed to a computation device configured to verify that an edit script is for transforming a first string to a second string. The edit script has match operations and difference operations as allowed edit operations. The computation device obtains a representation of the edit script and subsequently performs a validation computation. For each match operation, the computation device determines a character at a current position in the first string and a character at a current position in the second string, verifies that they match, increments the current position in the first string by one and increments the current position in the second string by one. For each difference operation, the computation device increments the current position in the first string and/or the current position in the second string by one.

Abstract: Approaches presented herein enable automatically indicating approval between portions of content in digital items in a digital item network context based on social media activity. Specifically, activity signals (e.g., likes, shares, etc.) related to a social media item in a social media network environment having a topic are evaluated and a set of tags are generated based on the topic. A first portion of content from a first digital item and a second portion of content from a second digital item are selected from a collection of digital items received via a digital item network. The first portion and second portion are related to the topic based on the set of generated tags. An approval action (e.g., likes) is performed between the first portion and second portion.

Abstract: In particular embodiments, a Cross-Border Visualization Generation System is configured to: (1) identify one or more data assets associated with a particular entity; (2) analyze the one or more data assets to identify one or more data elements stored in the identified one or more data assets; (3) define a plurality of physical locations and identify, for each of the identified one or more data assets, a respective particular physical location of the plurality of physical locations; (4) analyze the identified one or more data elements to determine one or more data transfers between the one or more data systems in different particular physical locations; (5) determine one or more regulations that relate to the one or more data transfers; and (6) generate a visual representation of the one or more data transfers based at least in part on the one or more regulations.

Abstract: A computer-implemented method, according to one embodiment, is for performing internal striping within a subset of slices. The computer-implemented method includes: receiving, by a computer, a logical unit; splitting, by the computer, the logical unit into a plurality of data chunks; and distributing, by the computer, the plurality of data chunks across the subset of slices such that the plurality of data chunks are striped across the subset of slices, and striped across a plurality of physical partitions in each of the subset of slices. Moreover, each of the subset of slices correspond to a different physical storage module in a single storage device. Other systems, methods, and computer program products are described in additional embodiments.

Abstract: Digital certificates for a set of multiple network services are maintained in a certificate store and managed through a single access point that provides access to the certificate store. The certificates are managed, at least in part by i) assigning one or more tags to each digital certificate in the set of digital certificates, one of the tags indicating a service in the set of services that uses the digital certificate to perform secure communications over the communication network, and ii) performing a set of certificate management operations through the single access point to the certificate store. At least one of the certificate management operations performed through the single access point selects a subset of the digital certificates from the set of digital certificates based at least in part on the tags assigned to the digital certificates.

Abstract: At least a portion of a graph database having a plurality of vertex-centric indices is stored. A virtual edge to be generated is identified based on a plurality of edges of the graph database. The virtual edge connecting at least a pair of vertices that were not previously directly connected is generated. The plurality of vertex-centric indices is updated to include information about the virtual edge.

Abstract: A storage system is described. The storage system includes an object store having a plurality of objects to implement a quota policy or a part of a relational database. The plurality of objects include a first plurality of immutable objects, a second plurality of immutable objects and a head object. The first plurality of immutable objects contain information kept within the database. The second plurality of immutable objects contain a hierarchy of pages for accessing the first plurality of immutable objects. The plurality of objects also include a mutable object that contains a mapping table that maps identifiers of the pages to identifiers of objects of the second plurality of immutable objects. The information is one of: quota policy information; information within a table of a relational database; a stripe of a thin provisioned file.

Abstract: A communication system transmits an input block of bits over a communication channel using a prefix tree that maps a dyadic distribution of compositions of output symbols to prefixes of variable lengths. A path to each leaf of the prefix tree is defined by a prefix formed by a unique sequence of binary values of a length equal to a depth of the leaf. Each leaf is associated with a composition that has at least a number of unique permutations equals to two in a power of a length of a suffix of the block of input bits. The system selects a composition identified in the prefix tree by a prefix, permutes the selected composition according to a suffix, and transmits the permuted composition over a communication channel. The compositions are selected to reduce one or combination of energy and kurtosis of transmission.

Abstract: A computer-implemented method includes determining a key set of properties. Based on the key set, a plurality of keys are generated for a plurality of objects, where the plurality of keys include a respective key for each object based on a value associated with the object for each property in the key set. A request is received to search for matching objects having a set of desired values for a desired set of properties, where the desired set of properties are a subset of the key set and exclude one or more properties in the key set. A Bloom filter search is performed on the plurality of objects. The Bloom filter search is based on the set of desired values for the desired set of properties and further based on the plurality of keys that are based on the key set. The matching objects are identified from the search.

Abstract: An apparatus and method for efficiently reconstructing a BVH. For example, one embodiment of a method comprises: constructing an object bounding volume hierarchy (BVH) for each object in a scene, each object BVH including a root node and one or more child nodes based on primitives included in each object; constructing a top-level BVH using the root nodes of the individual object BVHs; performing an analysis of the top-level BVH to determine whether the top-level BVH comprises a sufficiently efficient arrangement of nodes within its hierarchy; and reconstructing at least a portion of the top-level BVH if a more efficient arrangement of nodes exists, wherein reconstructing comprises rebuilding the portion of the top-level BVH until one or more stopping criteria have been met, the stopping criteria defined to prevent an entire rebuilding of the top-level BVH.

Abstract: A batch data query method and apparatus are provided. A data query server determines symbol identifiers of operands in N query statements according to operators and the operands in the N query statements, where the symbol identifiers include version numbers of the operands; determines dependency among the N query statements according to the version numbers of the operands in the N query statements; and then, performs inter-query optimization on the N query statements according to the dependency among the N query statements and a preset optimization rule.

Abstract: The invention relates to method for querying a database stored on a server network, the server being coupled to the client computer via the network, wherein the database comprises a relation, the relation comprising data items, the data items forming a partially ordered set in the relation, the method comprising receiving at the client a request for a data operation on a desired data item, the method comprising a. determining as an initial version number of the data items a currently valid version number of the data items, b.

Abstract: Methods, apparatus and computer readable media are provided for reverse editing a knowledge base from a cross tab display. A cross tab editor includes a knowledge base resident in a memory device, the knowledge base comprising attribute values and a knowledge base management system, wherein the knowledge base management system is configured to create a first list of sub-entities for a first entity, create a second list of sub-entities for a second entity, and create a relationship table listing all of the combinations of each pair of sub-entities from the first list and the second list and their attribute values. The knowledgebase management system is further configured to populate the relationship table with an attribute value for each combination. The knowledge base management system is further configured to receive a manual change in a cross tab display and to update the underlying attribute data in response to the change.

Abstract: A pluggable database (PDB) that is encoded using a particular character set (differing character set) may be plugged into a container database (CDB) and queried, even when the CDB in which the particular PDB resides is encoded using a different character set. The DBMS records what character set is used to encode the PDB. Any predicate that may prune results from a PDB that is encoded in a differing character set is converted to the differing character set as needed, such that the predicate may be applied within the PDB to prune results. At times, cross-container views will require data from a PDB that is encoded using a differing character set. The data returned from a recursive query over the PDB is converted to being encoded using the character set of the root database of the CDB.

Abstract: A method and computing system are provided for determining a hierarchical structure associated with a document. The hierarchical structure may be associated with a plurality of elements of the document. A map of the document may be generated. The map may include a plurality of links to one or more of the elements of the document.

Abstract: This invention relates to a system, method and computer program product for parsing a message against a message model, the message mode comprising hierarchical message element options organized into nodes and branches. The method includes: setting, by a computer device, a current node and current branch to a first node and first branch in the message model; setting, by the computer device, a return marker in the message at a point corresponding to the current node; parsing, by the computer device, the message from the return marker against the current branch of the message model; setting, by the computer device, the current branch to a further branch based on the current message model branch being not successfully parsed against the message; and parsing, by the computer device, the message again from the return marker whereby the parsing does not need to start from the beginning of the message model.

Abstract: This invention relates to a system, method and computer program product for parsing a message against a message model, the message model including a choice block of element options and guide field for guiding the parse, the method including: parsing a message against a message model until the choice block of element options and associated guide field is located in the message model; determining element options associated with a particular guide field value located in the message, each element option having an associated frequency of occurring within a body of messages; choosing the most frequently occurring element option for the located guide field value; and further parsing the choice block of element options against the chosen element option.

Abstract: A technique for running queries is provided that includes a method and system for managing unstructured data and for capturing uncertain relationships between pieces of data. A structural schema is generated from unstructured data that is configured to evolve in response to user input and incoming data that is changing over the course of an application. The schema is also configured to capture relationships between data that are uncertain or difficult for a person to capture in a consistent or comprehensive manner. The technique is especially advantageous for running and returning meaningful responses to queries that require an ability to connect pieces of data received from unstructured data or disparate sources, including user input, or where the query is directed to information that is uncertain or was not anticipated as useful or relevant at the time the data containing the information was originally received.

Abstract: Examples disclosed herein relate to: computing, by a computing device at a party among a plurality of parties, a sum of local data owned by the party. The local data is horizontally partitioned into a plurality of data segments, with each data segment representing a non-overlapping subset of data entries owned by a particular party; computing a local gradient based on the horizontally partitioned local data; initializing each data segment; anonymizing aggregated local gradients received from the mediator, wherein the aggregated local gradients comprise gradients computed based on a plurality of data entries owned by the plurality of parties; receiving, from a mediator, a global gradient based on the aggregated local gradients; learning a global analytic model based on the global gradient; and performing privacy-preserving multi-party analytics on the horizontally partitioned local data based on the learned global analytic model.

Abstract: A cloud-based write-once object store is configured to store inode-based data exported to the store from an enterprise file system. For each version of data (e.g., a file) exported to the store, there is a version of the inode corresponding to that data. As versions of the data are exported to the cloud, the system creates multiple versions of the inode. The set of inode versions corresponding to the versions of the file have a pointer associated therewith that specifies the latest version of the data associated with the inode. The inode versions in the set share the same pointer. The inode versions represent a revision history for the inode. For each inode version corresponding to a version of the data, information is received and stored in a new portion of the object store. The inode version for a file version comprises a list of data chunks for the file.

Abstract: A communication system transmits an input block of bits over a communication channel using a prefix tree that maps a dyadic distribution of compositions of output symbols to prefixes of variable lengths. A path to each leaf of the prefix tree is defined by a prefix formed by a unique sequence of binary values of a length equal to a depth of the leaf. Each leaf is associated with a composition that has at least a number of unique permutations equals to two in a power of a length of a suffix of the block of input bits. The system selects a composition identified in the prefix tree by a prefix in the input block of bits, permutes the selected composition according to a suffix in the input block of bits, and transmits the permuted composition over a communication channel.

Abstract: A system determines a count of each item in each item set, sorts each count into ascending order, assigns an ascending identifier to each item corresponding to each sorted count, and sorts each identifier in each item set in descending order. The system partitions item sets into a first group of item sets and a second group of item sets, each item set in the first group including a common largest identifier, determines a count for each subset of each item set of the first group, and determines a count of each subset of each item set by summing each count for each subset of each item set of the first group with each corresponding count for each corresponding subset of each item set of the second group. The system outputs a recommended item set based on the count of each subset of each item set.

Abstract: A log fragmentation method is disclosed. A slave database server receives a first log sent by a master database server, wherein the first log includes a data table identifier and match identifier. The slave database server determines a match tree based on the data table identifier of the first log, and fragments the first log based on the match tree. Using a match tree that has been set up, a tree structure of the match tree can be effectively utilized to fragment a log, and the fragmented log has a high degree of concurrency, thus improving the efficiency of log replay.

Abstract: A system and method for managing multiple file systems on a single non-volatile memory system is described. The system may include a non-volatile memory system with non-volatile memory having first and second file systems, each associated with respective files, and having a common pool of free space. The controller may be configured to update a file system to be mounted to reflect a capacity relating to only the respective files for that file system and all of the common pool of free space, while hiding from the host the file system not being mounted. The method may include the controller only presenting a single file system and hiding the unmounted file system, or may include the controller managing multiple file systems by presenting multiple file systems concurrently.

Abstract: A storage cluster includes a plurality of key-value storage nodes categorized into sub-groups of data associated with a first value identifying the sub-group and second values identifying respective subsets of data. A key-value processing system receives at least one of a first request to retrieve a selected one of the sub-groups of data, the first request including a plurality of keys, each of the plurality of keys including the first value and a respective one of the second values, and a second request to retrieve a selected one of the subsets of data. The second request includes a key having the first value and a selected one of the second values. The selected one of the second values corresponds to a hash value. The storage cluster selectively provides at least one of the selected one of the sub-groups of data and the selected one of the subsets of data.

Abstract: A computer system includes a hardware controller and an internal millicode storage area. The controller includes an accelerator that decompresses a data stream requested by an application. The internal millicode storage area can store a compression dictionary library including a plurality of different pre-defined compression dictionaries. A host system includes a dictionary manager that determines a compression dictionary from the plurality of different pre-defined compression dictionaries included in the dictionary library to decompress the data stream. The accelerator can access the internal millicode storage area to obtain the determined compression dictionary, and to decompress the data stream according to the determined compression dictionary.

Abstract: A system and method are provided for enforcing user policies on database. In one aspect a user policy and/or enterprise policy is predefined and mapped to the column of the database. Further, the query is run through a query parsing module, the result is sent to a query analyzing module to analyze the sensitivity of each query. A query rewriting module rewrites the query and the rewritten query is sent to the database. A sensitive tree is generated using database metadata, which is used during query analysis and query re-writing. In cases the original query does not contain any set operators the rewritten query is executed on the database and results are displayed as per the user policy. The cases where the original query comprises set operators a function called merger is implemented in the database or at the proxy server and data is displayed as per the user policy.

Abstract: A measure of structural growth of subsurface geological formations layers or intervals is obtained to investigate and analyze layer structure development history. The measure or indication can be considered a structural growth index (SGI) and is used to evaluate for possible presence of hydrocarbons in the layers or strata in a structure of concern. The structural growth measure or index for a given geologic interval of interest is defined as the ratio of the layer thickness difference measured at two selected locations, one at a structural high and the other at a structural low of layer or interval, over the larger number of the paired-thickness measurements. The structural growth measure is determined for a series of sequentially layered geologic formations of interest and displays of determined measures are formed as functions of geologic time for the formations. Based on the structural growth measure, the geologic growth history of the given oil field structure is revealed quantitatively.

Abstract: A measure of structural growth of subsurface geological formations layers or intervals is obtained to investigate and analyze layer structure development history. The measure or indication can be considered a structural growth index (SGI) and is used to evaluate for possible presence of hydrocarbons in the layers or strata in a structure of concern. The structural growth measure or index for a given geologic interval of interest is defined as the ratio of the layer thickness difference measured at two selected locations, one at a structural high and the other at a structural low of layer or interval, over the larger number of the paired-thickness measurements. The structural growth measure is determined for a series of sequentially layered geologic formations of interest and displays of determined measures are formed as functions of geologic time for the formations. Based on the structural growth measure, the geologic growth history of the given oil field structure is revealed quantitatively.

Abstract: Optimized execution order results (e.g., from a Rete algorithm graph) are correlated with a production ordering selected by a user, thereby more accurately modeling the user's understanding of how productions relate to one another during execution in a rule system. An execution report shows in the user-selected order for each of the rules, whether the rule was executed, the inputs matched to partial conditions of the rule, and partial condition evaluation results. User rule management experience is also enhanced in other ways. For example, a graphical user interface permits user selection of a schema xpath, bulk selection of XML schema nodes to define vocabulary used in rules, if-then-else rules, rules with embedded SQL, marking rules as active or not, receiving multiple kinds of input from a single text input box, locally executing rules, importing rules authored elsewhere, iterating over a collection of objects, and validating rules against vocabulary data types.

Abstract: Techniques are disclosed for generating quality renderings of volumes by sampling a volume light by generating and analyzing a sparse voxel octree. In one embodiment, a volumetric light source may be divided into voxels and importance information stored in an octree. An importance value may be determined for each voxel based on the amount of emitted light in the region associated with that voxel. Importance values regarding the individual voxels may be stored in the leaves of the octree. Each interior node may be associated with an importance value equal to the sum of the importance values of its children. The root node may be associated with the total importance of the entire octree.

Abstract: Resolving a query received from a first node in a network includes accepting, by a second node in the network, ownership of the query from the first node, receiving, at the second node, an identification of a third node in the network, wherein the identification is received from a user of the second node and the user of the second node believes that a user of the third node has information necessary to resolve at least part of the query, and transferring, by the second node, ownership of the at least part of the query to the third node, wherein the accepting, the receiving, and the transferring dynamically generates a data structure that traces a propagation of the query, and the data structure is accessible to an origin of the query.

Abstract: Systems and methods described herein facilitate configuration changes to an NIC teaming device while enabling multiple I/O threads continue to run through the NIC teaming device concurrently without interruption. At a given time, multiple configurations of the NIC teaming device, e.g., one for a current configuration of the NIC teaming device and one for a new configuration of the NIC teaming device, can co-exist. For the duration of one iteration, the current configuration of the NIC teaming device used by a specific I/O thread does not change and the new configuration of the NIC teaming device is not adopted by the I/O thread until the start of the next iteration. Once all of the I/O threads finish their current iteration, the configuration of the NIC teaming device is flipped from the current configuration to the new configuration and the current configuration is deleted.

Abstract: In one implementation, a plurality of signature vectors from a multi-dimensional representation of a graphical object is generated. Each of the signature vectors comprises attributes that vary little in response to changes in shape, size, orientation, and visual layer appearance of the graphical object, and each of the signature vectors includes attributes based on operations of integration, differentiation, and transforms on the multi-dimensional representation of the graphical object. Each signature vector is composited into multiple portions from the plurality of signature vectors to define an appearance-invariant signature of the graphical object.

Abstract: Systems and method for multi-dimensional data representation of an object is provided. The multi-dimensional data representation method includes evaluating a similarity measure for a query corresponding to an object. The similarity measure between the objects are used to compute the similarity values corresponding to the object and based on at least one metadata dimension associated with the object. The similarity value are sorted to create a multi-dimensional array of similarity values. The similarity values are represented in a scalar form and a visualization interface displays a multi visual representation of the similarity values and data associated with the object.

Abstract: Techniques for tuning the key space of an instance of a tree data structure are provided. In one embodiment, a computer system can receive a request to create the instance, where the request includes an expected key space value indicating an expected range of key values to be addressed by the instance. The computer system can further calculate a number of bits to allocate to each key of each node of the instance based on the expected key space value. The computer system can then, at a time of instantiating each node of the instance, allocate the keys for the node in accordance with the calculated number of bits.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.

Abstract: The present disclosure provides methods and systems for multicast collaborative erasure encoding and methods and systems for distributed parity protection. One embodiment relates to a method of multicast collaborative erasure encoding of a chunk stored in a distributed object storage cluster. A roll-call request is multicast to every storage server in a negotiating group for the chunk. Roll-call inventory responses are generated and multicast by every storage server in the negotiating group. The roll-call inventory responses are collected by every storage server in the negotiating group from other storage servers in the negotiating group to form a set of roll-call inventory responses. A logical evaluation of the set of roll-call inventory responses may then be performed by every storage server in the negotiating group. Other embodiments, aspects and features are also disclosed.

Abstract: An improved persistent memory process is disclosed that persists a traversable data structure by converting the traversable data structure into one or more traversable array structures that are saved on a secondary memory. The traversable array structure could be rapidly traversed and maintained, and can be used to restore one or more portions of the traversable data structure.

Abstract: Embodiments of the present invention provide a method, system and computer program product for document content re-ordering for assistive technology processing. In an embodiment of the invention, a method for document content re-ordering for assistive technology processing is provided. The method includes sensing in a computer display a drawing of a path across different portions of displayed content in the computer display. Thereafter, a sequence of the different portions of the displayed content can be identified from the path. As such, meta-data indicative of the sequence can be generated in the memory of the computer and the content can be annotated with the generated meta-data. Finally, the portions of the content can be processed with assistive technology in an order dictated by the sequence.

Abstract: A database system includes a query planner with instructions executed by a processor to generate a logical plan tree. Each node of the logical plan tree is a distributed relational algebra operator. Each child node of the logical plan tree produces results processed by a parent node. The logical plan tree includes a distributed relational operator that reparations tuples of results that are at least 1 GB on a dimension and regroups the tuples on the dimension to avoid broadcasting the tuples between machines and thereby avoid consumption of network bandwidth associated with broadcasting the tuples. The logical plan tree is modified according to algebraic transformation rules. The logical plan tree is mapped to distributed query execution primitives. The distributed query execution primitives are processed on machines storing partitions of a distributed database table.

Abstract: In a method for managing a data index, one or more processors inserting one or more rows of data sequentially into a data table of a database. The method further includes inserting index entries that correspond to the inserted one or more rows of data sequentially into an index of the data table, wherein an index B-tree structure is not built initially during insertion. The method further includes determining whether one of: (i) a size threshold of index entries inserted into the index and (ii) a time threshold for inserting index entries into the index, is met. The method further includes responsive to determining that one of: (i) a size threshold of index entries inserted into the index and (ii) a time threshold for inserting index entries into the index, is met, building an index-B-tree structure that includes the index entries inserted into the index.

Abstract: A method for dynamically updating database statistics and a plurality of access paths associated with at least one database table is provided. The method may include identifying at least one dynamically changing column associated with the at least one database table. The method may further include determining at least one predicate pattern associated with the identified at least one dynamically changing column. Additionally, the method may include dynamically detecting at least one range change associated with the determined at least one predicate pattern based on at least one record insert. The method may also include updating the plurality of database statistics associated with the identified at least one dynamically changing column based on the dynamically detected at least one range change. The method may further include determining at least one filter factor based on the updated plurality of database statistics associated with the identified at least one dynamically changing column.

Abstract: A machine-implemented method includes establishing a virtual or augmented reality entity, and establishing a state for the entity having a state time and state properties including a state spatial arrangement. The data entity and state are stored, and are subsequently received and outputted at a time other than the state time so as to exhibit a “virtual time machine” functionality. An apparatus includes a processor, a data store, and an output. A data entity establisher, a state establisher, a storer, a data entity receiver, a state receiver, and an outputter are instantiated on the processor.

Abstract: Ranking of data and retrieval of data or relationships of the data responsive to the ranking. A data model is represented as a graph, with edges in the graph linking related concepts, and an assertion represented in the graph as a reified n-ary relation. The graph is ingested though traversal and storage of the node paths. The traversal includes concepts and categories. In addition, neighborhood of one or more adjacent concepts are followed and stored in relation to the node paths. The ingested graph is converted into a set of flat document structures supported by information ranking and a retrieval framework.

Abstract: An improved method is provided for determining whether a sample point is within a defined geographic area. Indexes for the geographic area of interest are generated in advance. Such indexes complement the traditional spatial indexing techniques such as quad tree and r-tree. The geographic area, as defined by an outer boundary, is subdivided into some regular geometric shape, preferably a rectangle, encoded into a suitable form, and indexed. Then, a simplified comparison of the sample point to the indexed regular shapes is made.

Abstract: A computer-implemented method is implemented to compress a file system namespace. The method starts with determining that a first leaf page of a hierarchical data structure of a storage system is sparse. The hierarchical data structure contains root node layer, intermediate node layer, and leaf page layer, where each leaf page contains namespace entries corresponding to a file or a directory of a file system, and where being sparse means a first size of the entries of the first leaf page is less than a first percentage. The method continues with identifying a second immediate adjacent leaf page as a merging candidate. The method continues with merging the second leaf page into the first leaf page upon determining that a second size of combined entries of the first and second leaf pages is less than a second percentage larger than the first percentage.

Abstract: Embodiments of the invention provide systems and methods to implement an object memory fabric. Object memory modules may include object storage storing memory objects, memory object meta-data, and a memory module object directory. Each memory object and/or memory object portion may be created natively within the object memory module and may be a managed at a memory layer. The memory module object directory may index all memory objects and/or portions within the object memory module. A hierarchy of object routers may communicatively couple the object memory modules. Each object router may maintain an object cache state for the memory objects and/or portions contained in object memory modules below the object router in the hierarchy. The hierarchy, based on the object cache state, may behave in aggregate as a single object directory communicatively coupled to all object memory modules and to process requests based on the object cache state.

Abstract: An apparatus in one embodiment comprises a multi-tier storage system having at least a front-end storage tier and a back-end storage tier. The storage system comprises a software-defined storage controller configured to implement the front-end storage tier as a unified memory cluster accessible to respective processors of a plurality of compute nodes. The software-defined storage controller is implemented using at least one processing device comprising a processor coupled to a memory. The unified memory cluster in some embodiments comprises portions of respective memories of at least a subset of the compute nodes. The portions of respective memories of at least a subset of the compute nodes may comprise, for example, respective flash memories of those compute nodes, or respective dynamic random access memories of those compute nodes. Other illustrative embodiments include systems, methods and processor-readable storage media.

Abstract: An apparatus in one embodiment comprises a plurality of compute nodes each having a processor coupled to a memory. The apparatus further comprises a storage system configured for communication with the compute nodes over at least one network, with the storage system comprising a software-defined storage controller configured to implement an in-memory database accessible as a unified memory cluster to respective processors of the compute nodes. The in-memory database comprises portions of respective memories of the compute nodes. The in-memory database may be expanded, for example, using an additional portion of the memory of one of the compute nodes, responsive to an overflow event associated with the memory of another one of the compute nodes. The compute nodes may illustratively comprise respective analysis nodes that run respective applications configured to utilize analytics functionality of the in-memory database.