Abstract: Computer-implemented systems and methods are disclosed to interface with one or more storage devices storing a plurality of documents, wherein each of the plurality of documents is associated with one or more tags of one or more predefined hierarchies of tags, wherein the one or more hierarchies of tags include multiple dimensions. In accordance with some embodiments, a method is provided to identify one or more documents from the data storage devices. The method comprises acquiring, via an interface, a selection of one or more tags of the one or more predefined hierarchies of tags. The method further comprises identifying one or more documents from the data storage devices in response to the selection, the identified one or more documents having tags that have a relationship with the selected tags, and providing data corresponding to the identified documents for displaying in the interface.

Abstract: A filter request for a data set indicates a query specification and one or more sub-range indicators of a disjoint subset descriptor. Corresponding the individual data records obtained from the data set using the query specification, a respective range mapping value is generated. Using the range mapping values and the sub-range indicators, a result set of the filter request is obtained.

Abstract: Systems and techniques are described for efficient, general-purpose, and potentially decentralized databases, distributed storage systems, version control systems, and/or other types of data repositories. Data is represented in a database system in such a way that any value is represented by a unique identifier which is derived from the value itself. Any database peer in the system will derive an identical identifier from the same logical value. The identifier for a value may be derived using a variety of mechanisms, including, without limitation, a hash function known to all peers in the system. The values may be organized hierarchically as a tree of nodes. Any two peers storing the same logical value will deterministically represent that value with a graph, such as the described “Prolly” tree, having the same topology and hash value, irrespective of possibly differing sequences of mutations which caused each to arrive at the same final value.

Abstract: An apparatus includes a data access circuit that interprets data records, each having a number of data fields, a record parsing circuit that determines a number of n-grams from terms of each of the data records and maps the number of n-grams to a corresponding number of mathematical vectors, and a record association circuit that determines whether a similarity value between a first mathematical vector for the first data record and a second mathematical vector for the second data record is greater than a threshold similarity value, and associates the first and second data records in response to the similarity value exceeding the threshold similarity value. An example apparatus includes a reporting circuit that provides a catalog entity identifier, associates each of the first term and the second term to the catalog entity identifier, and provides a summary of activity for an entity.

Abstract: System and methods for storing data include detecting presence of one or more computing devices within a defined geographic area, automatically copying media stored on the one or more computing devices, storing the copied media on a backup storage device, and grouping the stored copied media by at least one of time period, location, event and a source of the copied media.

Abstract: A query-based isolator comprising an observer, a collator and an extractor. The isolator reduces the database on which the query is run, to a new smaller, database on which the query can be performed, with the same result obtained on the smaller database, as that obtained on the original database.

Abstract: In an approach for automatically ranking and routing data quality remediation tasks, a processor analyzes a data set ingested by a repository to produce a set of data quality problems. A processor computes a score for each data quality problem of the set of data quality problems. A processor identifies a route to send each data quality problem of the set of data quality problems. A processor exports each data quality problem according to the score and the route.

Abstract: A computer-implemented method is disclosed. The method includes determining whether a level of resource utilization of an organization having a first index and a first cluster requires that the organization is assigned to a second cluster, if the level of resource utilization requires that the organization is assigned to the second cluster, creating a second index for the organization in the second cluster, adding a consul entry in a consul that points to the second index, and upon completion of a data migration operation, changing an entry of the cluster routing controller for the organization, from the first index to the second index. A connection is established using the consul entry.

Abstract: One or more computing devices, systems, and/or methods for classifier validation are provided. A set of in-sample examples are partitioned into a reduced in-sample set and a remaining in-sample set. The reduced in-sample set is processed using a set of classifiers. A subset of classifiers are identified as having error counts, over the reduced in-sample set, below a threshold number of errors. A training procedure is executed to select a classifier having a minimum error rate over the set of in-sample examples. If the classifier is within the subset of classifiers, then an out-of-sample error bound is determined for the classifier.

Abstract: A method of identifying causal relationships between time series may include accessing a hierarchy of nodes in a data structure, where each node in the plurality of nodes may include a time series of data. The method may also include identifying a subset of nodes in the plurality of nodes for which causal relationships may exist in the corresponding time series. The method may additionally include generating a model for each of the subset of nodes, where the model may receive the subset of nodes and generate coefficients indicating how strongly each of the subset of nodes causally affects other nodes in the subset of nodes. The method may further include generating a ranked output of nodes that causally affect a first node in the subset of nodes based on an output of the corresponding model.

Abstract: The present disclosure provides a data processing method. The method includes the steps of constructing a keyword library of an obtained comment corpus associated with a target object, the keyword library comprising a plurality of keywords; extracting a plurality of partial comment corpora from the comment corpus, each partial comment corpus of the plurality of partial comment corpora comprising a plurality of comment words including at least one of the plurality of keywords in the keyword library; combining the plurality of partial comment corpora to produce a candidate corpus; and performing a topic clustering process on the candidate corpus of each keyword to obtain a subject term for the target object.

Abstract: A computing system is described that determines, based on user-initiated actions performed by a group of computing devices, an intent of a search using a particular search query received from a computing device. The computing system adjusts, based on the intent, at least a particular portion of search results obtained from the search using the search query by emphasizing information that satisfies the intent. The computing system sends, to the computing device, an indication of the adjusted search results.

Abstract: Described herein are enhancements for operating content nodes in a content delivery network. In at least one implementation, a content node deploys a request handler configuration and a key-value object, wherein the key-value object includes one or more key-value pairs and wherein the request handler configuration calls, in response to a content request from an end user device, the key-value object using a key associated with the content request and the key-value object returns a value associated with the key. The content node further obtains a request to modify the key-value object, identifies a modification to the key-value object based on the command, and updates the key-value object with the modification.

Abstract: Systems and methods are presented for identifying unwanted photos and videos on a device. Such systems may contain various modules to do one or more of: (i) review the image quality of photos and videos, (ii) review a user's interaction with photos and videos, (iii) review the properties of photos and videos, (iv) review the user's profile/preferences as to photos, or (v) review information obtained from additional sources regarding the user, his or her photos, and any interaction therewith. With one tap, an exemplary application can identify all of a user's unwanted photos, such as, for example: photos with bad lighting, blurry shots, similar photos, and even photos that the system predicts a user may find boring. Any photos that an exemplary system is unsure about may be left for the user to review and act upon. By analyzing user decisions exemplary systems become progressively more accurate and thus improve their predictions over time.

Abstract: A data warehouse system may include a connection pool manager. The connection pool manager may invoke a first client-provided function for rerouting a connection request from a first database to a second database based on a query that is to be executed using the connection. The connection pool manager may invoke a second client-provided function for rewriting the query to be executed to leverage database aspects found on the second database.

Abstract: Embodiments of this application provide a blockchain-based information processing method, including: obtaining an original index information set, the original index information set comprising at least one piece of original index information, each piece of original index information comprising plaintext sensitive content; obtaining information in to-be-matched blocks in a blockchain system, the information comprising information content and an information index, the information content having a correspondence with the information index; matching the information content in the information by using the original index information set, to obtain a matching result; and determining a variant index information set when the matching result indicates that the matching succeeds, the variant index information set comprising at least one piece of variant index information, the variant index information comprising the information index corresponding to the information content in the information.

Abstract: A computer system may create version records in a versioned database that stores data from transaction documents. Each version record may include a timestamp that represents a time from which the data stored in the version record is valid. The timestamp may represent the time of creation of particular version of the transaction document. The version records may be accessed to perform a valuation for a specified time.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for blockchain-based data synchronization, are provided. One of the methods includes: obtaining, from one or more blockchain nodes associated with a blockchain, data associated with a plurality of blockchain transactions recorded in one or more blocks of the blockchain; storing the obtained data in one or more data stores, wherein the storing comprises organizing the obtained data according to one or more schemas, at least one of the one or more schemas being different from a data structure of the blockchain; receiving, from a client device, a data query based on one of the one or more schemas; executing the data query on the data in the one or more data stores to obtain a result; and sending, to the client device, a response comprising the obtained result.

Abstract: This disclosure relates to systems and methods for managing data associated with a user using a personalized cloud storage platform operating as a centralized repository for user data generated from a variety of sources and/or user devices. By centralizing the storage and/or management of personal data that would conventionally be confined between multiple information silos, embodiments of the systems and methods disclosed herein may improve the ability of a user to control their personal data, facilitate utilization of their personal data in a variety of ways not offered by services associated with the silos, and/or allow a user to centrally manage their personal data. Further embodiments disclosed herein allow a user to define one or more policies or other rules associated with personal data stored in their personal cloud.

Abstract: In embodiments, a computer-implemented method may entail receiving a search request. A first data store and a second data store, that contains data archived from the first data store, may be identified. Data from the first data store may remain available in the first data store for a limited period of time once archived to the second data store. The first data store storing data in a first format and the second data store storing data in a second format, the first format and the second format being different from one another. Determining that a subset of data that has been archived into the second data store and is to be searched as part of the search request is still available from the first data store, and executing the search request on the subset of data utilizing the first data store. Additional embodiments are described and/or claimed.