Abstract: Embodiments of the present disclosure pertain to point cloud data. In one embodiment, the present disclosure includes a computer implemented method comprising for compressing and storing point cloud data using a space-filling curve data structure and a dictionary space data structure. In another embodiment, the present disclosure includes applying a query against the data structures to retrieve point cloud data within a range.

Abstract: A computer-implemented method for deploying a new artifact file in a database. The new artifact file provides specifications for one or more new run-time database objects to be created in the database by processing of the new artifact file by artifact-type specific conversion engines. The method includes assigning ownership of the one or more new run-time database objects to be created in the database to the new artifact file, and, when an existing database object in the database provided by another artifact file corresponds to a new run-time database object specified in the new artifact file, assigning ownership of the existing database object in the database to the new artifact file being deployed.

Abstract: Execution of an exclusive lock of a page in a database is initiated. Thereafter, subsequent to the initiation of the execution of the exclusive lock, at least one non-exclusive lock for the page in the database is received. The execution of the exclusive lock is selectively timed out based on at least one savepoint statistic. While the exclusive lock is timed out, at least one of the received non-exclusive locks is executed. Further, the exclusive lock can be restarted after the execution of the at least one of the received non-exclusive locks.

Abstract: Techniques are described for a nearest neighbor search service that enables users to perform nearest neighbor searches. The nearest neighbor search service includes an interface that enables users to create collections of searchable vectors, add and update vectors to a collection, delete vectors from a collection, and perform searches for nearest neighbors to a given vector. The nearest neighbor search service enables users to add, update, and delete vectors of a collection in real-time while also enabling users to perform searches at the same time.

Abstract: In one embodiment, a method includes receiving a query comprising a query content object and constraints, generating a feature vector representing the query content object, accessing a sparse graph comprising nodes corresponding to candidate content objects represented by compact codes and links connecting the nodes, selecting an entry node, selecting similar content objects iteratively by identifying linked nodes of the entry node, decompressing the compact codes representing candidate content objects to generate feature vectors, selecting zero or more similar content objects based on a comparison between the feature vector representing the query content object and the feature vectors representing the candidate content objects, returning the selected similar content objects if a completion condition is satisfied, else repeating the iterative selection by using a linked node corresponding to a most similar content object as the entry node, and sending instructions for presenting one or more of the selected si

Abstract: Techniques herein map between key spaces to generate a balanced adaptive resolution histogram for dataset partitioning. In embodiments, a computer (C) creates a mapping that associates sparse keys (SKs) with distinct dense keys. C constructs a trie by processing each item of a dataset as follows. Based on the item, C obtains an SK. C navigates from a root NT (node of the trie) to a particular NT based on a sequence of dense digits (SDD). Each dense digit of the SDD is based on the mapping. Each NT identifies a dense prefix comprising dense digits. C assigns the item to a target node based on a threshold and count of items assigned to a subtree rooted at the particular node. C determines a range of SKs for each partition of the dataset, based on: an item count for a node or subtree, dense prefixes of NTs, and the mapping.

Abstract: Methods and apparatus, including computer program products, are provided for first and last aggregation. In one aspect, there is provided a method, which may include receiving, by a calculation engine, a query; detecting, by the calculation engine, whether the query includes a first aggregation and/or a last aggregation over at least one group and at least one keyfigure; optimizing the received query, when the detecting indicates the received query includes the first aggregation and/or the last aggregation, wherein the optimizing further comprises initiating execution of the received query by at least: performing a single read of a table, detecting, from the single table read, at least one group, and indicating, in the detected at least one group, the first aggregation in the at least one keyfigure and/or the last aggregation in the at least one keyfigure; and returning, for the at least one detected group, the indicated first aggregation and/or the indicated second aggregation.

Abstract: The systems and methods described herein dynamically allocate streams when restoring data from databases. In some embodiments, the system and methods restore data from a database by determining a number of streams to allocate to the database for restoring files of data from the database. The determined number of streams may be based on a total amount of data within the database, and/or may be based, at least in part, on the previous number of streams used during backup operations, in order to balance the benefit of allocating streams to a restoration of data with any detriments associated with changing the number of streams from the number used during previous backup operations.

Abstract: Techniques described herein improve network security and traffic management. In an embodiment, a request associated with an identifier (ID) is received. It is determined whether the ID exists in a first membership database (MDB). If the ID exists in the first MDB, the request is serviced subject to a rate limit. If the ID does not exist in the first MDB, it is determined whether the ID exists in a second MDB. If the ID exists in the second MDB, the request is serviced. If the ID does not exist in the second MDB, the request is serviced subject to another rate limit. A response is received. The first and second MDBs can be updated based on the type of received response. In an embodiment, the response is classified as indicative of degraded or typical network performance, and the first and second MDBs are updated accordingly.

Abstract: Methods and apparatus, including computer program products, are provided for a case join. In one aspect, there is provided method, which may include receiving a query for a predefined view that is configured to inhibit modification; detecting whether the predefined view includes a database table extended to include an additional column; and generating, in response to the query, a view based on a case join, when the predefined view includes the database table extended to include the additional column. Related apparatus, systems, methods, and articles are also described.

Abstract: A system and method for applying extended regular expressions against arbitrary data objects, wherein a state machine maintains an internal state model for the system, an object analysis server receives data objects from a data source, and the object analysis server analyzes the structure and contents of the objects, compares them against received search pattern, and directs the state machine to update the state model based on either or both of the analysis and comparison operations.

Abstract: Embodiments of systems and methods for storing documents in a cloud storage system comprising a cloud processor and a plurality of storage components are disclosed.

Abstract: A system for identifying a schema for storing graph data includes a database containing a graph dataset of data and relationships between data pairs and a list of storage methods that each are a distinct structural arrangement of the data and relationships from the graph data set. An analyzer module collects statistics for the graph dataset, and a data classification module uses the collected statistics to calculate metrics describing the data and relationships in the graph dataset, uses the calculated metrics to group the data and relationships into a plurality of graph dataset subsets and associates each graph dataset subset with one of the plurality of storage methods. The resulting group of storage methods associated with the plurality of graph dataset subsets includes a unique storage method for each graph dataset subset. The data and relationships in each graph dataset subset are arranged in accordance with associated storage methods.

Abstract: The subject disclosure relates to interaction and execution of objects in a distributed network or in the cloud. Each object comprises a Uniform Resource Identifier (URI) path that names the object in the cloud through a distributed object directory. A client device can directly interface with a live instance of an object based on the URI path. The object can be agnostic to remote procedure call semantics. In some aspects, the object can be connected to an interacted with either remotely or locally. Further, single instances or multiple instances of the object can exist at substantially the same time.

Abstract: A system and a method for delivering an event from an event publisher to an event subscriber via an event broker are disclosed. The event broker performs several functions such as receiving an event published by an event publisher of a first domain, assigning a priority based on a second domain to a plurality of subscribers of the second domain, processing the event based on a rule and the priority, and further delivering the event published by the event publisher of the first domain to the plurality of event subscribers of the second domain in accordance with the priority.

Abstract: An end-to-end data curation system and the various methods used in linking, matching, and cleaning large-scale data sources. The goal of this system is to provide scalable and efficient record deduplication. The system uses a crowd of experts to train the system. The system operator can optionally provide a set of hints to reduce the number of questions sent to the experts. The system solves the problem of schema mapping and record deduplication in a holistic way by unifying these problems into a unified linkage problem.

Abstract: In some natural language understanding (NLU) applications, results may not be tailored to the user's query. In an embodiment of the present invention, a method includes tagging elements of automated speech recognition (ASR) data based on an ontology stored in a memory. The method further includes indexing tagged elements to an entity of the ontology. The method further includes generating a logical form of the ASR data based on the tagged elements and the indexed entities. The method further includes mapping the logical form to a query to a respective corresponding database stored in the memory. The method further includes issuing the query to the respective corresponding databases. The method further includes presenting results of the query to the user via a display or a voice response system.

Abstract: A distributed log collector and report generation architecture is disclosed. In some embodiments, a received query to generate a log report is forwarded to each of a plurality of log collector clusters, and responses to the query received from each of at least a subset of the plurality of log collector clusters are aggregated to generate the log report.

Abstract: A system and method enable the selection of a time range, or other record selection criteria, of database records for upload from a local database source and for transfer to a remote database. A specifically bounded time period is selected to limit the number of data records selected for upload in a particular action to those records that are individually associated with date time stamp values falling within the specified time period. This limitation of records selected for inclusion in an upload process to data records having associations with date time stamps falling within a limited time range, or other criteria, reduces a likelihood of overload in transferring data and thereby reduces the incidence of time-outs in the communication of a local database, any intermediary server or software action, and the remote database in an updating of the recipient database to reflect a current state of the local database.

Abstract: A technique for storing data in a data storage system detects that a read is being performed pursuant to a data copy request. In response, the data storage system stores a digest of the data being read in an entry of a digest cache. Later, when a write pursuant to the same copy request arrives, the storage system obtains the entry from the digest cache and completes the write request without creating a duplicate copy of the data.