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: Embodiments of the present disclosure relate to a multi-node storage system and a data deduplication method thereof. The method includes determining a similarity hash value of a super block, wherein the similarity hash value indicates similarity between super blocks The method further includes comparing the similarity hash value of the super block with a feature similarity hash value of a node of the multi-node storage system to determine whether the super block matches the node and, in response to determining that the super block matches the node, allocating the super block to the node.

Abstract: A method for reducing computing time of a data processing unit during processing of data.

Abstract: An embodiment includes building a hierarchical data structure using a hybrid hierarchical clustering process. The hybrid hierarchical clustering process comprises one or more iterations of a level-building process. An embodiment of the level-building process comprises building, by a classical processor, a first parent level of a current uppermost level of the hierarchical data structure by clustering classically-encoded clusters of the current uppermost level. The embodiment of the level-building process also comprises identifying, by a quantum processor, a set of candidate clustering options for clustering quantum-encoded clusters of the current uppermost level for a second parent level, including forming each of the set of candidate clustering options in parallel using respective different quantum encoding spaces. The embodiment of the level-building process also comprises building, by the classical processor, the second parent level based on a subset of the candidate clustering options.

Abstract: A method comprising while traversing, by a current agricultural implement during a current agricultural operation, a plurality of current geo-referenced locations: receiving, from one or more sensors, mounted in the current agricultural implement, current data at the plurality of current geo-referenced locations, wherein the plurality of current geo-referenced locations includes a plurality of swath locations; dynamically displaying a visual correlation between previous data collected from a previous agricultural operation and the current data, comprising: rendering a bitmap from bitmap values corresponding to the current data, wherein the bitmap includes only those bitmap values that are associated with a threshold number of swath locations; generating a plurality of values of the previous data corresponding to a current geo-referenced location of the current agricultural implement; and displaying, on a display device, the plurality of values of the previous data as visually correlated with the current data

Abstract: A method for recovering files from a filesystem stored across sparse files in a cloud environment is described. According to the method, a data management system may receive a request to read the files. The data management system may identify one or more target address ranges corresponding to the files indicated via the request. The data management system may read index information for the sparse files in the cloud environment. The index information may indicate respective address ranges for data blocks within the sparse files. The data management system may identify one or more data blocks within one or more sparse files as corresponding to address ranges that overlap with the one or more target address ranges based on the index information. The data management system may transmit, to the cloud environment, one or more read requests for the identified one or more data blocks.

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: Appropriate network data for an indoor map can be efficiently generated using input data including a structure of an indoor space. In a network data generation device (10) that generates, from the input data including at least the structure of the indoor space and information indicating a property based on the structure of the indoor space, network data, the network data including a link representing a movable space on a map and a node that is a starting point or an ending point of the link, a link/node generation unit (142) generates a set of links and a set of nodes based on the input data.

Abstract: Improved technological solutions are introduced for providing a secure and effective and enhanced clustering/grouping solution that is useful, for example, in an online dating forum as well as any number of other industries. The ability to attend live events in person or remotely is coupled with presence location and automatic verification of user devices and identities. This allows secured communication between participants without having to disclose actual contact information of the participants or their device addresses. An improved algorithm that groups members/items effectively based on a variety of matching criteria, with lowered possibilities of errors and more efficient use of processing power, is now introduced.

Abstract: A method including parsing a query into a tree of operations, generating a query matrix and a transcript matrix, determining a cross-correlation of the query matrix and the transcript matrix, applying a softness map to the cross-correlation to determine one or more matches for each of the literals, and combining the one or more matches utilizing the tree of operations to generate an output, each of the operators corresponding to a combination operation for the matches.

Abstract: The systems and methods described here can reduce the storage space required (memory and/or disk) to store certain types of data, provide efficient (fast) creation, modification and retrieval of such data, and support such data within the framework of a multi-version database. In some embodiments, the systems and methods can store each field of a set of records as a vector of values, e.g., a data vector. A set of records can be represented using a vector id vector, or “vid” vector, wherein each element of the vid vector contains a reference to the memory location of a data vector. A header table can store associations between labels and “vid” vectors that pertain to those labels. Identical data vectors can be re-used between different record sets or vid vectors needing that vector, thus saving space.

Abstract: The systems and methods described here can reduce the storage space required (memory and/or disk) to store certain types of data, provide efficient (fast) creation, modification and retrieval of such data, and support such data within the framework of a multi-version database. In some embodiments, the systems and methods can store each field of a set of records as a vector of values, e.g., a data vector. A set of records can be represented using a vector hash vector, or “vhash” vector, wherein each element of the vhash vector contains a unique identifier of a data vector, based on a cryptographic hash of the data vector. A header table can store associations between labels and “vhash” vectors that pertain to those labels. Identical data vectors can be re-used between different record sets or vhash vectors needing that vector, thus saving space.

Abstract: A method, computer program, and computer system is provided for signaling for session-based dynamic adaptive streaming over HTTP (DASH). Multiple queries at one or more elements of a Media Presentation Description are added. At least part of the multiple queries are replaced when building a Session-Based DASH query, whereby one or more query descriptors are added at the one or more elements of the Media Presentation Description. A relationship is determined between Session-Based DASH descriptors based on assigning values to the Session-Based DASH descriptors.

Abstract: In a computing system, data is ingested into a primary row of shards in a stamp data structure. The stamp data structure includes a primary row of data shards and a set of replica rows of data shards so the data shards are arranged in rows and columns in the stamp structure. The ingested data is replicated from the primary row into the replica rows of data shards. Each of the data shards, in each row, is evaluated to identify a particular data shard in each column of shards to generate a logical row of data shards. Queries against the data shards are serviced from the logical row of data shards. The system dynamically controls expansion and contraction of the number of data shards in a row and of the number of replica rows.

Abstract: Indexing data is disclosed. An image and a text data associated with a dataset are received. A tag is generated using one or more hierarchical classifiers. The image and the text data are input into at least one of the one or more hierarchical classifiers. A search index is generated based at least on the generated tag.

Abstract: A system for indexing includes an interface and a processor. The interface is configured to receive a metadata amendment. The metadata amendment defines a change to a transactional index schema to a first transactional index. The first transactional index comprises a querying system data. The processor is configured to maintain a first state of the first transactional index. The first transactional index does not incorporate the metadata amendment. The processor is configured to build a second transactional index incorporating the metadata amendment, determine whether an indication to switch from the first transactional index to the second transactional index has been received, and indicate to switch from using the first transactional index to the second transactional index for queries regarding a system data.

Abstract: In some embodiments a distributed computing system is provided that includes a plurality of different feature modules and a matching engine. The different feature modules each provide different processing for handling parent requests and submitting, to the matching engine, commands for child data transaction requests that are associated with the parent request.

Abstract: Systems and methods are described for balancing workloads and reliably delivering data to a plurality of indexing systems in a data intake and query system. A topic-based indexing system load balancer may receive event data from various data sources, each of which may be associated with a topic. The event data may be entirely unparsed, unparsed but divided into events, or parsed into events. The topic-based indexing system load balancer may distribute the received event data on a per-topic or per-event basis to a set of indexing systems, and may distribute topics and events based on the volume received. Unparsed data may be divided into portions, and the topic-based indexing system load balancer may ensure that portions data associated with the same topic are delivered to the same indexer so that events split between two portions may be recombined and indexed.

Abstract: In some examples, the database system maintains metadata for a plurality of data objects, the metadata containing ranges of values of an attribute for the plurality of data objects, where the ranges of values of the attribute comprise a respective range of values of the attribute for each corresponding data object of the plurality of data objects. The database system generates a data structure tracking quantities of ranges of values of the attribute that have a specified relationship with respect to corresponding different values of the attribute. The database system receives a database query comprising a predicate specifying a condition on a given value of the attribute, and computes, for the database query, a selectivity of filtering based on the metadata, the selectivity computed based on the data structure.

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.