Systems and methods are provided for using point-in-time architecture (PTA) databases. An exemplary method includes: entering first data, received from a first data source, into a first PTA database; receiving a first instruction to process the first data using a first statistical operation; executing the first statistical operation for the first data, resulting in first output data; filtering the first output data based on a user-selected attribute; and performing multiple stages of a data processing operation for the first output data.

A method and apparatus for mining a competition relationship between POIs. An embodiment of the method includes: acquiring a graphlet mining result obtained by mining map retrieval data of users which encompasses attribute information of retrieved target POIs, the graphlet mining result encompassing occurrence frequencies of respective preset situations, and a preset situation comprising: conforming to attribute information of POIs represented by a corresponding preset graphlet and a preset association relationship between attribute information of at least two POIs; for a first and second POI, determining an occurrence frequency of a preset situation corresponding to a preset graphlet where attribute information of the first and second POI co-occur, and generating a relationship feature of the first and second POI; and inputting the relationship feature into a pre-trained relationship prediction model to obtain a competition relationship prediction result of the first POI and the second POI.

A method for accessing information. The information is received by a computer system from sources for distribution to client computer systems. A piece of the information received from the sources without temporal data is identified by the computer system. The temporal data for the piece of the information based on a policy is identified by the computer system. The temporal data is associated with the piece of the information by the computer system, enabling analyzing the information by a client computer system with increased accuracy.

A method for managing big metadata using columnar techniques includes receiving a query request requesting data blocks from a data table that match query parameters. The data table is associated with system tables that each includes metadata for a corresponding data block of the data table. The method includes generating, based on the query request, a system query to return a subset of rows that correspond to the data blocks that match the query parameters. The method further includes generating, based on the query request and the system query, a final query to return a subset of data blocks from the data table corresponding to the subset of rows. The method also includes determining whether any of the data blocks in the subset of data blocks match the query parameters, and returning the matching data blocks when one or more data blocks match the query parameters.

An apparatus and methods are provided to cross-check the reliability of data. Referring to one of the methods, the cross-checking includes receiving a client request containing data in the form of geographic-related information associated with a location. The method also includes determining one or more knowledge providers to determine one or more confidence levels for the data of the client request based on a type of the geographic-related information at the specific location. The method further includes causing the transmission of at least some of the geographic-related information the client request to the one or more knowledge providers. The method still further includes determining one or more confidence levels of the geographic-related information based on a comparison of the geographic-related information and a known resource associated the specific location. A corresponding apparatus and additional method are also provided.

The present disclosure relates to database technology and in particular to dynamically updating and customizing database partitions. A computer-implemented engine is disclosed for identifying and retrieving a number of data records applicable to generate a response to a request, the engine having access to at least two partitions. Partition statistics are generated indicating correlations between the data records and, based on that partition statistics, the data records having the strongest correlation with each other are relocated to partitions so that the number of partitions which have to be queried in order to generate a response to a data request is minimized. Furthermore, the computational load caused when generating responses is more equally distributed across the partitions.

A computing device generates a first token for first data content that is associated with a first relationship and a second relationship, and a second token for second data content that is associated with the first relationship and a third relationship, such that the first token and second token are generated based on a frequency of use of data values included in the first and the second data content. The computing device calculates a first similarity score of data values from third data content that is associated with the second relationship and a fourth relationship with data values from fourth data content that is associated with the third relationship and the fourth relationship in response to the first and second token matching. The computing device then performs, in response to the first similarity score satisfying a similarity threshold, a first modification to any of the data content.

A query is received from a client device and a mode is selected to process the query from a set of possible modes. The possible modes include a fast mode and a low-cost mode. If the fast mode is selected, the query is forwarded to a cloud database to retrieve responsive records. If the low-cost mode is selected, the cloud database is queried for index metadata of responsive records and the index metadata is used to retrieve the responsive records from a datastore other than the cloud database. Regardless of the mode selected, the responsive records are provided to the client device.

In some implementations, events measured at various points in time may be organized in a data structure that defines an event represented by a document. In particular, events can be organized in columns of documents referred to as buckets. These buckets may be indexed using B-trees by addressing metadata values or value ranges. Buckets may be defined by periods of time. Documents may also be geoindexed and stored in one or more locations in a distributed computer network. One or more secondary indexes may be created based on time and/or metadata values within documents.

In some embodiments, a method receives a sequence of subsidiary features that are associated with a sequence of main features. A subsidiary feature provides subsidiary information for a main feature. A sequence of first weights for the sequence of subsidiary features is generates where a first weight in the sequence of first weights is generated based on a respective subsidiary feature. The method processes the sequence of first weights to generate a sequence of second weights. The processing uses relationships in the sequence of first weights to generate values of the second weights. The method uses the sequence of second weights to process the sequence of main features to generate an output for the sequence of main features.