Abstract: Methods, non-transitory machine readable media, and computing devices that provide more efficient hierarchical propagation in tree structures are disclosed. With this technology, a first delta record for a first interior node is created optionally in an atomic transaction along with updating a first tally record for a leaf node based on a first value. The transaction is in response to an action associated with the leaf node and the first interior node is a parent of the leaf node in a hierarchical tree. A timer associated with the first delta record is then set. A second value is updated in a second tally record for the first interior node based on the first value, when the timer has expired. Accordingly, this technology advantageously maintains recursive properties or values throughout a hierarchical tree continually, with reduced cost, even in a distributed network and in hierarchical trees with large numbers of nodes.

Abstract: Systems and methods to select an object instance from a database storage to archive to an external storage based on an archiving configuration and attribute values of the object instance, transmit the selection to an application associated with the object instance, determine, based on a response received from the application, to archive the object instance, mark the object instance as ready for archiving, identify the object instance as ready for archiving, convert the object instance to an object notation format, transmit the converted object instance to a cloud application for storage in an external storage, in response to a determination that the storage in the external storage is successful, create an index object in the database storage including a subset of fields of the object instance and a link to the converted object instance stored in the external storage, and mark the object instance in the database storage as archived.

Abstract: Disclosed herein are system, method, and computer program product embodiments for storing a large object (LOB) in a database. An embodiment operates by identifying the LOB to be stored in an on-disk store of the database and determining the size of the LOB. Thereafter, an index vector for the on-disk store to include an identifier corresponding to the LOB is created. Additionally, a dictionary for the on-disk store to include a copy of the identifier and corresponding LOB data is also created. The LOB data corresponds to the LOB itself or a LOB location inside of the on-disk store based on the LOB's size.

Abstract: The purpose of the present invention is to provide a suitable user-friendliness to a user regarding a recommendation of application software on a portable information terminal. In order to accomplish the purpose, this portable information terminal is configured to set an application as a recommendation candidate when the status of the portable information terminal matches a condition corresponding to the application, and recommend the application when the application further matches a pre-set recommendation permitting condition. Hence, the portable information terminal and the application recommending method thereof capable of providing a preferable user-friendliness to the user can be provided.

Abstract: The invention relates to a method for personalizing a search of a search service. The search service comprises a search index with content items of a search type being used as first search results for first search queries issued by the client application and providing second search queries to be executed for retrieving second search results to be returned in reply to the first search queries. The method comprises using social media content items retrieved from social media services for extracting a set of keywords comprised by the social media content items. A second search query modified, wherein the modifying comprises adding keywords of the set keywords as additional search parameters of the determined second search query.

Abstract: Systems and techniques are provided for mutable data ingestion and storage. Data for a database may be received at a computing device. New data from the data for the database may be stored as a mutable data chunk. The data for the database may be determined to include updated data for a previously stored mutable data chunk. The updated data may be applied to the previously stored mutable data chunk to update the previously stored mutable chunk. A second previously stored mutable data chunk may be determined to have been initially stored a specified amount of time ago. In response to determining that the second previously stored mutable data chunk was initially stored the specified amount of time ago, the second previously stored mutable data chunk may be caused to become an immutable data chunk.

Abstract: A memory for storing a directed acyclic graph (DAG) for access by an application being executed by one or more processors of a computing device is described. The DAG includes a plurality of nodes, wherein each node represents a data point within the DAG. The DAG further includes a plurality of directional edges. Each directional edge connects a pair of the nodes and represents a covering-covered relationship between two nodes (a covering node and a covered node). Each node comprises a subgraph consisting of the respective node and all other nodes reachable via a covering path that comprises a sequence of covering and covered nodes. Nodes present in the subgraph that do not cover any other nodes are leaves of the subgraph. Each node comprises a set of node parameters including at least an identifier and an address range. Each node and the legal address specify a cover path.

Abstract: A method of synchronizing a plurality of end points is disclosed. A spoke is connected to a hub. The connecting of the spoke to the hub includes performing inbound synchronization of all of a set of data items or a subset of the set of data items with a replica. One or more additional spokes are connected to the hub. The connecting of the one or more additional spokes to the hub includes performing inbound synchronization of all of an additional set of data items or a subset of the additional set of data items with an additional replica. A subset of a set of data items stored in the replica or the additional replica is selected for outbound synchronization with any of a plurality of spokes except a spoke from which the subset of data items originated.

Abstract: In some implementations, a system may receive, from a first user, data associated with a new database entry to be added to a master database that is associated with multiple sets of users having different access permissions to entries in the master database. The system may write the data to a first repository, write an entry including the data to a master repository, and generate a record of the entry. The system may receive, from a second user, additional data associated with the new database entry. The system may write the additional data to a second repository, modify the entry in the master repository based on the additional data, and generate a record of the modified entry. The system may perform verifications and output a notification based on the verifications. The system may further output, to a public repository, the modified entry with at least one data value removed.

Abstract: A method implemented by a computer comprising collecting historical data for a plurality of items; categorizing each of the plurality of items; assigning at least one of the plurality of items as an index item for at least another of the plurality of items; collecting data for a plurality of context parameters related to at least one of the plurality of items; and forecasting a value for one of the plurality of items needed over a future period of time, wherein the method reduces a data storage capacity requirement for the computer and increases said computer's processing speed.

Abstract: Methods, systems, and computer program products are described herein for unsupervised clustering of browser history using web navigational activities. For example, correlation scores are calculated that indicate correlations between web pages indicated in a browsing history of a user. Moreover, the correlation scores are calculated based on web navigational activities determined from the browsing history. In addition, the web pages are clustered into a plurality of clusters based on the correlation scores and the clusters are ranked for relevancy to the user based on a relevancy algorithm. The relevancy algorithm determines a likelihood that a user will access a corresponding web page for each web page of a cluster. A cluster having a greatest ranking is identified and an indication of a web page of the identified cluster as a suggested web page to revisit is provided to a user.

Abstract: A data storage system includes accelerated storages that store data encoded using a first data integrity scheme. The data storage system also includes a global enumerator that obtains a request to use a second data integrity scheme to store the data; in response to obtaining the request: performs a recoding process for the data including: reading data chunks, corresponding to the data, from the storages; generating new data chunks based on: the read data chunks and the second data integrity scheme; storing the new data chunks in the accelerated storages in an arrangement specified by the second data integrity scheme; and deleting the data chunks after storing the new data chunks.

Abstract: Example distributed storage systems, replication managers, and methods provide barriers for dependent data operations among sharded data stores. Shard operation logs may be associated with different shards and storage nodes. Dependent data operations may be identified in each shard and data operation entries corresponding to dependency sets for those dependent data operations may be determined. Log-based operations may be executed by delaying execution of the dependent data operations in all shards until the dependency set data operations in all shards are completed.

Abstract: A computer-implemented method of managing data in a data repository is disclosed. The method comprises maintaining a data repository, the data repository storing data imported from one or more data sources. A database entity added to the data repository is identified and a metadata object for storing metadata relating to the database entity is created and stored in a metadata repository. The metadata object is also added to a documentation queue. Metadata for the metadata object is received from user via a metadata management user interface and the received metadata is stored in the metadata repository and associated with the metadata object.

Abstract: Verified snapshots are generated by obtaining, from one of a plurality of first nodes, a difference between a common data at a first time point and the common data at a second time point that is different from the first time point, generating a first snapshot of the common data at the first time point based on the difference, obtaining a hash of the common data at the first time point from one of the plurality of first nodes, and verifying the first snapshot at the first time point with the hash of the common data at the first time point.

Abstract: Content management systems that utilize external content libraries are described herein. According to some embodiments, an example system includes a content management system configured to create web content that includes at least one asset that resides on an external system that is remote to the system, the web content having a reference to the at least one asset, an external content library connector system exposing connectors that are accessible to both the content management system and a dynamic experience delivery system, and the dynamic experience delivery system configured to invoke the external content library connector system to obtain the at least one asset based on the reference using one or more of the connectors and publish the web content with the at least one asset included therein.

Abstract: A method and apparatus for executing a distributed computing task are provided. The method can include: parsing an expression of the distributed computing task to obtain an operator keyword; and executing, by using an operator corresponding to the operator keyword, the distributed computing task based on an input parameter of the operator, the input parameter of the operator including at least one of: a distributed stored distributed dataset including at least one data element, a distributed stored distributed key-value pair set including at least one key-value pair, and a value of the key-value pair in the distributed key-value pair set being a distributed dataset or a distributed key-value pair set.

Abstract: A method and software tool for identifying relationships between columns of one or more data tables are disclosed. In the disclosed method, a relationship indicator is computed for each of a plurality of column pairs, each column pair comprising respective first and second columns selected from the one or more data tables. The relationship indicator comprises a measure of a relationship (e.g. indicating a strength or likelihood of a relationship) between data of the first column and data of the second column. Relationships between columns of the data tables are then identified in dependence on the computed relationship indicators. The identified relationships may be used to create and execute data queries.

Abstract: Zero block elimination (ZBE) and statistical accounting for reduction in storage space used in a memory component of a file system due to ZBE can be managed. During a write operation, in response to eliminating a zero block from the write operation, a data management component (DMC) can associate a zero extent with a sparse region that represents a block in the memory component where the zero block was to have been written, unless a zero extent is already associated with that block. DMC can determine a number of zero blocks eliminated from write operations due to ZBE based on the number of zero extents associated with files stored in the memory component, to facilitate determining an amount of reduction of use of storage space in the memory component, or a data reduction ratio, storage efficiency ratio, or zero reduction ratio associated with the memory component, due to ZBE.

Abstract: A method and device for storing high-concurrency data. The method comprises: receiving high-concurrency data sent from a plurality of clients (110); pushing the high-concurrency data into a primary data queue, and responding to a corresponding client (120); consuming the high-concurrency data in the primary data queue by using multithreading (130); fragmenting the high-concurrency data according to the number of local queues (140); pushing the fragmented high-concurrency data into the local queues (150); and consuming the high-concurrency data in the local queues and storing the high-concurrency data in a database (160). By means of data asynchronous storage, high-concurrency data is temporarily stored in the primary data queue and the local queues, thereby alleviating pressure on the database, avoiding the problem of a database crash in the case of a high-concurrency storage, and improving the efficiency of storing high-concurrency data.