Abstract: Methods and systems for a distributed database cluster storing a plurality of replicas of a databases are provided. One method includes locating by a processor, a timestamp of a last stored record in a backup copy of the database from a plurality of logical partitions for a point in time restore operation; identifying by the processor, an operation log for each logical partition with the last stored record, the operation log providing transaction details associated with the database; splitting by the processor, the operation log for each logical partition by ignoring transactions that occurred prior to the timestamp of the last stored record; and using by the processor, the split operation log for restoring the database to the point in time.

Abstract: A processing module of a memory storage unit includes an interface configured to interface and communicate with a communication system, a memory that stores operational instructions, and processing circuitry operably coupled to the interface and to the memory that is configured to execute the operational instructions to manage data stored using append-only formatting. When the processing module determines that a section of the memory includes invalid data and the amount of invalid data compares unfavorably to a predetermined limit, the processing module determines a rate for execution of a compaction routine for the section of memory, where the rate is based on a proportion, integral and derivative (PID) function that is based on a target usage level of the memory and a current usage level of the memory.

Abstract: A capability for updating a cache. The capability includes identifying, in a query instance that has led to a filling of the cache, a parameter whose values are monotonic—in particular monotonically increasing or decreasing—over time, wherein the query instance has a first execution time. When generating a new query instance, at a second, later execution time instead of the previous value of the parameter, a new value may be used that corresponds to the monotonic previous value at the second execution time. The new query instance is executed, wherein the cache is updated with the results of the new query instance.

Abstract: Disclosed herein are methods, systems, and apparatus, including computer programs encoded on computer storage devices, for data processing and storage. One of the systems includes a multi-tier storage subsystem including multiple tiers of storage devices, an input/output (I/O) subsystem that is configured to perform a write operation of blockchain data into a data log file, and a back-end data management subsystem that is configured to perform a management operation of the data log file stored in the one of the multiple tiers of storage devices.

Abstract: An example method includes receiving a stream that identifies I/O operations requested to be performed with respect to a data grouping, identifying, in the stream, random I/O requests and sequential I/O requests, queuing the sequential I/O requests in a priority/processing queue and processing the sequential I/O requests immediately without waiting for loading of any metadata, and processing a first one of the random I/O requests and a second one of the random I/O request. When the first and second random I/O requests each depend on the same range of metadata, the first and second random I/O requests are processed in the order received, and when the first and second random I/O requests each depend on different respective ranges of metadata, the first and second random I/O requests are processed at the same time.

Abstract: Systems and methods are disclosed for implementing a low-latency data stream monitoring system. The data stream monitoring system may obtain raw data from a data source as soon after the data is generated, and may classify the data according to different topics. The topics may be published in a publish-subscribe messaging model, and data enrichment systems may subscribe to the topics to receive data for enrichment. The data enrichment systems may supplement or replace the raw data with additional information, and may further classify or reclassify the enriched data into different topics. The enriched data may then be published to an alert generation system, which may apply various criteria to the enriched data to determine that alerts should be generated, generate the alerts, and publish or transmit the alerts to client devices. Individual data streams, topics, enrichments, criteria, and alarms may be added, removed, or modified as required.

Abstract: A transformation on raw data is applied to produce transformed data, where the transformation includes at least one selected from among a summary of the raw data or a transform of the raw data between different domains. In response to a query to access data, the query is processed using the transformed data.

Abstract: Performing data analytics processing in the context of a large scale distributed system that includes a massively parallel processing (MPP) database and a distributed storage layer is disclosed. In various embodiments, a data analytics request is received. A plan is created to generate a response to the request. A corresponding portion of the plan is assigned to each of a plurality of distributed processing segments, including by invoking as indicated in the assignment one or more data analytical functions embedded in the processing segment.

Abstract: Systems for low-latency data access in distributed computing systems. A method embodiment commences upon generating a first storage area in local storage of a first computing node. Access to the first storage area is provided through the first computing node. A second storage area is generated wherein the second storage area comprises a first set of metadata that comprises local storage device locations of at least some of the local storage areas of the first storage area. A set of physical access locations of the second storage area is stored to a database that manages updates to the second set of metadata pertaining to the second storage area. Accesses to the first storage area are accomplished by querying the database retrieve a location of the second set of metadata, and then accessing the first storage area through one or more additional levels of metadata that are node-wise collocated.

Abstract: A computer-implemented method includes associating a tag with a message in a log, where the message describes a logged event. A life parameter associated with the tag is calculated, using a computer processor, where the life parameter indicates a dynamic time period during which the tag remains in a state that is active. Alerting of the tag occurs by way of a first alert manner while the state of the tag is active. It is detected that the dynamic time period indicated by the life parameter has ended. The state of the tag is changed from active to dormant, where changing the state includes ceasing the alerting of the tag by way of the first alert manner.

Abstract: Techniques for topic recommendation are described herein. The techniques include a method that topic recommendation includes identifying topics associated with events within a social network environment. A rank may be determined indicating interest for an identified topic within the social network environment. The method may include recommending a topic to a user for posting in the social network environment based on the rank.

Abstract: This application provides a search apparatus, including a global dispatcher, a global arbiter, and N search engines. The N search engines can access a first search table. The global dispatcher is configured to: determine that a first search keyword is corresponding to the first search table and dispatch the first search keyword to the N search engines. Each search engine is configured to: search, according to a first search algorithm, one subtable to determine whether an entry that matches the first search keyword exists; and output a search result to the global arbiter. The global arbiter is configured to arbitrate the search result output by each search engine, to obtain a search result corresponding to the first search table.

Abstract: Methods and systems for compressing data, such as ion-mass information data in mass spectrometry spectra, to reduce index size are provided. Data in an index, such as fragment-ion data in a fragment-ion index, can be transformed for reduction of entropy and then encoded using a running counter technique to compress repetitive and redundant information in the index.

Abstract: A join operation between split data tables includes providing reduction data from first partitions to each partition among second partitions. The reduction data serves to identify actual values in one of the second partitions that also occur in one of the first partitions. Global IDs are assigned. Translation lists including the global IDs are sent to the first partitions. Each first partition and each second partition create globalized lists which can then be combined to generate respective first and second compiled lists. The join operation can then be conducted on the first and second compiled lists.

Abstract: A device can obtain location information that includes a set of location name values associated with a set of locations. The device can identify, using a natural language processing model, a set of proper noun values associated with the set of location name values. The device can generate a set of search criteria variant terms for the set of proper noun values. The set of search criteria variant terms can each include one or more characters associated with an alias of a particular proper noun value. The device can receive, from a user device, partial search criteria relating to an alias of a destination location. The device can process the partial search criteria using the set of search criteria variant terms to identify a set of candidate search terms. The device can provide the set of candidate search terms to the user device.

Abstract: Provided are an apparatus and a method for replicating changed-data in a source database management system to a target database management system in real time, for minimizing the load on the source DBMS system, reducing costs for DBMS hardware configuration, and facilitating operation and failure recovery. The source server transmits the changed-data from a redo log file or an archive log file in a source DBMS area to a target server in real time, and the target server receives the changed-data transmitted from the source server to temporarily store the changed-data in a local area, and extracts the change data stored in the local area to replicate the extracted changed-data to the target DBMS, thereby implementing the apparatus for replicating the changed-data in the source database management system to the target database management system in real time.

Abstract: Techniques are presented herein for storing cursor duration temporary tables in memory of nodes in a clustered database system in association with iterations of an iterative query operation. The techniques involve associating a portion of memory with one or more iteration values. The iteration values indicate which iterations correspond to data that is stored in the portion of memory. When data is requested for a particular iteration, portions of memory are checked to determine if it stores the particular iteration.

Abstract: A method for avoiding inode number conflict during metadata restoration at a restoration location is provided. The method includes receiving metadata for a first file including an inode containing an initial internal inode number and a directory entry containing an external inode number, determining an allocation status of the initial internal inode number at the restoration location, identifying an available internal inode number to be allocated to the first file, updating the initial internal inode number in the inode for the first file with the available internal inode number, registering the available internal inode number and the external inode number in an inode mapping table indicating correspondence between the available internal inode number and the external inode number, and restoring the inode based on the available internal inode number.

Abstract: In one embodiment, the present invention includes a computer-implemented method comprising storing data in an application using an application custom data type and application custom data structure. The data is stored in a database using the application custom data type and the application custom data structure. In one embodiment, a request is sent to access the data from the application to the database. The data is retrieved from the database in response to the request in the application custom data type and the application custom data structure. In one embodiment, the data is sent from the database to a shared memory in the application custom data type and the application custom data structure and the data is retrieved by the application from the shared memory in the application custom data type and the application custom data structure.

Abstract: A datastore that includes property listings (e.g., for rental properties) may be accessed by a computing resource configured to execute a thumb printing algorithm to generate summary data values (e.g., thumbprint values, hash values) of digital data included one or more images of a property listing. The summary data values along with listing attributes (e.g., address, zip code, geolocation, brand, number of bedrooms/bathrooms/sleeps, amenities) of the property listing may be compared with summary data values and listing attributes of other property listings to determine if the summary data values of one or more images match and if one or more listing attributes match. A threshold number of image matches and listing attribute matches may indicate that the property listings are duplicate property listings, which may be merged, removed or replaced with links/pointers by the computer resource to increase data storage space and/or reduce data search latency times of the datastore.