Abstract: A visualization engine may provide, on a screen, a visual display of an object, the object being associated with object data having a data display size smaller than a visual threshold and therefore not displayed on the screen. The visualization engine may include a request handler configured to receive a magnification request to magnify the object at a magnification speed, a threshold manager configured to determine a data threshold at which fetching of the object data must be initiated to ensure receipt thereof prior to the visual threshold being reached, and an object comparator configured to initiate fetching of the object data, based on the visual threshold, the data threshold, and the magnification speed. The visualization engine may then display the object data within the object upon magnification of the object meeting the visual threshold.

Abstract: A computer implemented system and method is used to identify groups of entities based on bipartite directed graphs. Each group consists of two sets of entities, which have some association between each other. Two parameters, typicality and coverage, are taken into account in the computation for identifying the groups.

Abstract: Systems and methods are disclosed for inserting a key into a radix tree. In an example method, inserting a key into the radix tree includes comparing a first key including a first sequence of elements with a second key including a second sequence of elements. The method includes identifying a common prefix in the first and second keys and identifying a remainder sequence in the second key. The remainder sequence is a suffix after the common prefix in the second sequence of elements. The method also includes splitting the remainder sequence into a plurality of chunks. Each chunk includes a sequence of elements in the remainder sequence. The method further includes for each chunk, locating a parent container from which to insert a child container into the radix tree, creating a new container including the respective chunk, and inserting the new container as a child container of the parent container.

Abstract: Systems and methods are disclosed for inserting a key into and removing a key from a composite data structure including a radix tree and an auxiliary data structure. In an example, a method of inserting a key into the composite data structure includes receiving an instruction to store a first key in the composite data structure. The composite data structure stores a second key. The method further includes generating, based on comparing the first and second keys, one or more sequences of elements. The method also includes splitting each of the generated sequences of elements into a prefix and a suffix, storing the respective prefixes into the radix tree; and storing the respective suffixes into the auxiliary data structure.

Abstract: A data storage and query method supporting an agile development and horizontal scaling, in a field of computer applications, includes steps of: transforming data into a 2-tuple (Key, MiniTable) and identifying any MiniTable (having a data set removed) with a unique Key, wherein the MiniTable includes multiple data columns; a structure of each data column is limited by a pre-defined mode; and the data columns are sorted according to a primary key defined by the mode. The data storage and query method obtains a capability of the horizontal scaling via removing dependency among the data sets, and a capability of the agile development via supporting an analogous SQL grammar by saving dependency among the data within the data sets. The data storage and query method can be applied to a data management system which supports the horizontal scaling of big data and the agile development of short development lifecycles.