Abstract: The current document is directed to a query-as-a-service system (“QAAS system”) that collects enormous volumes of data from network-connected entities, referred to as “Things” in the phrase “Internet of Things,” persistently stores the collected data and provides a distributed-query-execution engine that allows remote clients to continuously execute queries against the collected data. In a described implementation, both the raw data and query results are persistently stored in the QAAS system, with the raw data stored for significantly longer periods of time. Query results generated by the query-processing engine are securely transmitted to QAAS remote clients for distribution to file systems, storage.

Abstract: A method includes storing, by one or more processors of one or more computing devices, a plurality of datasets in a non-transitory computer memory associated with the one or more computing devices. A plurality of index representations is generated where each one of the plurality of index representations includes a compressed representation of a respective one of the plurality of datasets. The plurality of index representations is stored in the non-transitory computer memory. A sample dataset is received by the one or more processors. A sample dataset representation is generated that includes a compressed representation of the sample dataset. A determination that at least one of the plurality of datasets is most similar to the sample dataset based on the sample dataset representation and the plurality of index representations is performed.

Abstract: The present disclosure is directed to updating a multi-tenant database concurrent with tenant cloning. In some embodiments, a computer system receives a request to perform an update operation on a multi-tenant database. The update operation includes updating database entries for a plurality of tenants. Responsive to receiving the request, the update operation is initiated. Performing the update operation includes accessing a list identifying database entries awaiting the updating. During the accessing of the list, the update operation holds a lock. When the lock becomes available for acquisition, a clone process is permitted to create, during performance of the update operation, a clone of a tenant's data within the database.

Abstract: Systems and methods are provided for handling sequence-dependent data as part of processing and/or analyzing large data sets in a distributed data processing environment. The distributed data processing environment can be suitable for handling data generated at a plurality of sites within a network of manufacturing sites. The systems and methods can allow for pre-processing of some values for sequence-dependent data. This can allow secondary aggregated values and/or secondary aggregated data sets to be generated from sequence-dependent data that can span multiple blocks or partitions. Pre-calculation of secondary aggregated values and/or secondary aggregated data sets for sequence-dependent data can allow the efficiencies of parallel or distributed computation to be at least partially retained while also allowing for desired processing of the sequence-dependent data.

Abstract: A control module transferring data between a shard and destination shards within a database comprising a plurality of shards, the control module: generating a first hash wheel distribution of shard allocations by applying a defined hashing function to a first integer value per shard allocation; generating a further hash wheel distribution of shard allocations by applying the defined hashing function to a further integer value per shard allocation; determining a range of hash values associated with data to be transferred between the shard and a destination shard, wherein the range of hash values, the shard and the destination shard are defined based on determining a difference between the first hash wheel distribution of shard allocations and the further hash wheel distribution of shard allocations; selecting and controlling the transfer of data associated with the determined range of hash values between the shard and the destination shard.

Abstract: Embodiments herein describe computer-implemented methods, computer program products and systems for efficient spatial indexing. In an embodiment, the computer-implemented method may include one or more processors configured for obtaining from a database index data representing one or more assets, wherein each of the one or more assets comprise an asset identifier and a spatial attribute; generating a location hash for each of the one or more assets using the respective asset identifier and the respective spatial attribute; determining one or more sets of location hashes based on the asset identifier and the spatial attribute at one of one or more precision values; generating shadow index data comprising the one or more sets of location hashes at the one of one or more precision values; receiving a query corresponding to the index data; and returning a first set of results corresponding to the query in a first query response time.

Abstract: Disclosed herein are system, method, and computer program product embodiments for using a data statistic as a dynamic data integrity constraint. An embodiment operates by defining a data statistic for a column or a set of columns of a partition of a plurality of partitions of a database table. The embodiment creates a constraint data statistics object based on the data statistic. The embodiment receives a query for the database table. The embodiment determines the constraint data statistics object is consistent with a data state of the partition. The embodiment derives an implied constraint based on the constraint data statistics object. The embodiment processes the query for the partition based on the implied constraint.

Abstract: The blockchain generation apparatus 1 includes: a parameter calculator 122 that identifies a parameter type to be used for linkage of the new block, based on block approval method data 114, and calculates a value for the identified parameter type based on transaction datasets which are related to an identifier of a generating party; a block generation condition checker 125 that determines whether the generating party is qualified to generate the new blockchain data, based on the value calculated by the parameter calculator 122; and a blockchain generator 126 that tries to generate the new blockchain by referring to the shared data when the block generation condition checker 125 determines that the generating party is qualified. An identifier of the blend pattern included in the block approval method data 114 specifies a combination of the plurality of parameter types that conflict with each other.

Abstract: A database having multiple data columns is disclosed. Whether metadata for the multiple data columns resides in multiple different metadata columns may be determined. If so, the metadata may be consolidated into a single consolidated metadata column.

Abstract: Methods, systems and apparatus for performing indexed operations using a unary iteration quantum circuit. In one aspect, a method includes encoding an index value in an index register comprising index qubits; encoding the index value in a control register comprising multiple control qubits; and repeatedly computing and uncomputing the control qubits to perform, conditioned on the state of the control qubits, the operation on one or more target qubits corresponding to the index value, wherein during the encoding, computing and uncomputing: the multiple control qubits are made available in sequence, and the multiple control qubits correspond to a one-hot encoding of the encoded index value.

Abstract: Modifying an index for a database is provided. An index tree for the database is traversed by: identifying a next node in the index tree, requesting a lock of the next node in the index tree, responsive to locking of the next node in the index tree, releasing a lock of a current node of the index tree, and making the next node in the index tree the current node of the index tree, until the current node of the index tree is a leaf node of the index tree. Responsive to determining to split the leaf node, the lock of the leaf node is released and, after releasing the lock of the leaf node, a lock of a non-leaf node parent of the leaf node in the index tree is requested.

Abstract: Data replication groups may be used to store data in a distributed computing environment. The data replication groups may include a set of nodes executing a consensus protocol to maintain data durably. The nodes of the data replication groups may generate logs containing information corresponding committed operations performed by the nodes. These logs may be collected and processed to obtain useful information corresponding to the operation of the data replication group. Furthermore, this processed information may be provided in the form of a stream to enable event driven operations corresponding to the logs.

Abstract: Systems and methods for reducing data loss in remote databases. One method includes detecting, with an electronic processor communicatively coupled to the remote database, a failure of a user session with the remote database. The method includes, in response to determining the failure of the user session, performing, with the electronic processor, an offline detection check for the user session, the offline detection check including a canary check on a known resource related to the remote database. The method includes, in response to the offline detection check indicating that the remote database is offline, setting the user session to read-only, displaying, within a graphical user interface of the user session, an offline indicator, and graphically marking the at least one outstanding request within the user session.

Abstract: The present teaching relates to system, method, and programming for indexing user records. A plurality of user records are obtained, wherein each user record is associated with a user identifier and one or more data-segments. For each data-segment, one or more user identifiers associated with the data-segment are determined, a relative distance of each user identifier with respect to a previous user identifier associated with the data-segment is computed, and a variable number of bits to be used to store the relative distance of each user identifier in a bit stream are determined based on a criterion associated with the relative distance. Offset values are generated for the one or more data-segments, wherein an offset value of a data-segment indicates an index of the bit stream where information of a first user identifier associated with the data-segment is stored.

Abstract: An embodiment includes receiving, by a processor, an indication that a first device transmitted a file having tracking metadata to a second device. The embodiment also includes receiving, by the processor, an indication of a modification to the file by the second device. The embodiment also includes evaluating, by the processor, the modification to the file using a cognitive process that analyzes the modification as it relates to profile information for a user and generates a significance value associated with the change. The embodiment also includes automatically initiating, by the processor and responsive to the generating of the significance value, a selected responsive action from among a plurality of responsive actions based at least in part on the significance value, where the automatic initiation of the selected responsive action includes automatic transmission of a notification to the first device regarding the modification to the file.

Abstract: A method for enhancing a presentation of a network document by a client terminal with real time social media content. The method comprises analyzing a content in a web document to identify a relation to a first of a plurality of multi participant events documented in an event dataset, each of the plurality of multi participant events is held in a geographical venue which hosts an audience of a plurality of participants, matching a plurality of event indicating tags of each of a plurality of user uploaded media content files with at least one feature of the first multi participant event to identify a group of user uploaded media content files selected from the plurality of user uploaded media content files, and forwarding at least some members of the group to a simultaneous presentation on a browser running on a client terminal and presenting the web document.

Abstract: Disclosed are embodiments for determining the impact of one or more latent factors on user interaction metrics based at least in part on an impact model. The embodiments identify a value for a user interaction metric, the user interaction metric measuring interaction with content and identify an impact for a latent factor on the user interaction metric, the impact determined based at least in part on a model providing a relationship between the user interaction metric and the latent factor. Additionally, embodiments may involve adjusting an attribute of the electronically provided content based at least in part on the impact of the latent factor on the user interaction metric.

Abstract: Disclosed herein are system, method, and computer program product embodiments for performing dynamic partition pruning using data statistic objects as data integrity constraints. An embodiment operates by partitioning a database table into a plurality of partitions based on a partition criterion. The embodiment creates a data statistics object for a partition in the plurality of partitions. The embodiment receives a query for the database table. The embodiment determines the data statistics object is consistent with data in the partition. The embodiment processes the query for the partition based on the data statistics object.

Abstract: A method for transforming strings includes identifying one or more candidate example input strings from a database including a set of input strings. The candidate example input strings are presented for example transformation. For one or more of the candidate example input strings, an example output string corresponding to that example input string is received, where each example input string and its corresponding example output string define a transformation example in an example set. A string transformation program is generated based on transformation examples in the example set.

Abstract: The subject technology receives a query plan, the query plan comprising a set of query operations, the set of query operations including at least one aggregation. The subject technology analyzes the at least one aggregation to generate a modified query plan, the modified query plan including at least a top aggregation operator, an intermediate aggregation operator, and a bottom aggregation operator. The subject technology performs, with respect to the intermediate aggregation operator, at least one operation comprising: the subject technology receives an input intermediate data type; the subject technology performs an internalize operation on the input intermediate data type to generate an internal state; the subject technology performs an accumulate operation on the internal state to generate intermediate data; and the subject technology performs an externalize operation on the intermediate data to generate an output data type.