A system and method of query processing in a multi-level storage system having a unified table architecture. A query is received by a common query execution engine connected with the unified table architecture, the query specifying a data record. The common query execution engine performs a look-up for the data record based on the query at the first level storage structure. If the data record is not present at the first level storage structure, the common query execution engine performs separate look-ups in each of the second level storage structure and the main store.

A central node can: receive a query comprising at least one parameter comprising a time range of a dataset stored in a cloud storage system; transmit one or more of the query parameters comprising the time range to a metadata service; receive from the metadata service a list of files related to the query; and assign to each processing node of a plurality of processing nodes a subset of the files. Each processing node can: determine that the subset is not stored on a cache; retrieving the subset not stored on the cache from the cloud storage system; store the retrieved subset in a local memory; scan the subset stored in the local memory for data matching the at least one parameter to generate a subset of query results; and concurrently copy using a separate thread from the scanning, the subset stored in the local memory to the cache.

A computer-implemented method that includes generating a graphical user interface including a coding interface and a document viewer interface. The coding interface displays a grid that includes a plurality of cells representing a plurality of documents and a plurality of fields. A selection of one of the cells is received. The cell represents a selected one of the documents, and a selected one of the fields. A rendering of the selected document is automatically displayed in the document viewer interface. A value entered into the selected cell is received and the value is transmitted to a database for storage thereby.

Provided are a data search method and apparatus, an electronic device and a storage medium. The method includes acquiring search data and a search condition and determining a target data set corresponding to the search data; determining each data distance between the search data and a respective query datum included in the target data set; performing data filtering on the each data distance based on the search condition and writing each filtered data distance as a target data distance into a memory; and reading the target data distance stored in the memory, using a query datum corresponding to the target data distance as a target response datum of the search data and displaying the target response datum.

Systems and methods for controlling data in a hierarchy receive a data query corresponding to data organized within nodes in a data hierarchy, wherein the data hierarchy is defined by a plurality of dimensions. A data traversal of the data hierarchy is performed including a rollup operation between different nodes at different levels of the plurality of dimensions. The rollup operation aggregates data values of the nodes at the different levels. Aggregated values for different nodes at each level are output based on the rollup operation, and the data query is executed using the aggregated values for the different nodes.

An embodiment includes deriving usage data associated with records of a database by monitoring requests to perform read operations on the records of the database. The embodiment generates record correlation data representative of correlations between respective groups of records of the database by parsing the usage data associated with the records of the database. The embodiment stores a plurality of records received as respective write requests during a first time interval in an intermediate storage medium. The embodiment identifies a correlation in the record correlation data between a first record of the plurality of records and a second record of the plurality of records. The embodiment selects, responsive to identifying the correlation, a first location in the database for writing the first record and a second location in the database for writing the second record based on a proximity of the first location to the second location.

A query requesting a count of unique data values for a specific attribute is received. The received query is used to generate and transmit a plurality of non-overlapping queries to a data store. A plurality of responses is received from the data store. Results from the plurality of responses is summed and the resulting sum is returned.

A key-value store is provided, implementing multiple-tiered sorted data structures in memory and storage, including concurrent write buffers in memory, and page-level consolidation of updates on storage, where pages are trivially translated in physical-to-virtual address mapping. The key-value store is built on an indexed sorted data structure on storage, occupying much less storage space and incurring much less disk activity in consolidating updates than a conventional log-structured merge tree organized into files. Concurrent write buffers operate concurrently and independently so that data is committed from memory to storage in an efficient manner, while maintaining chronological sequence of delta pages. Trivial mapping allows mappings of a number of physical pages to be omitted, enabling page mapping tables to occupy less storage space, and simplifying processing workload of read operation retrievals from storage.

Methods and systems disclosed herein may optimize write operations in a transaction to reduce the number of operations to the point where each of the write operations may be performed in parallel. The writer optimizer may review a first write operation and a second write operation to determine whether the first write operation and the second write operation write to the same row in the same table. When the first write operation and the second write operation write to the same row in the same table, the first write operation and the second write operation may be combined to generate a functionally-equivalent third write operation. The third write operation may reduce the number of operations in the transaction by replacing both the first write operation and the second write operation.

Techniques are described for querying on hybrid formats and storages by a DBMS to leverage faster mirror format (MF) data and completeness of persistent format (PF) data. In an embodiment, the DBMS receives a query that specifies both in-memory and disk-only columns. The DBMS identifies that a scan-based operation is referencing an in-memory column stored within both MF and PF data. The DBMS may initiate performing the operation on the in-memory column on one of the formats of data. While doing so, the DBMS may determine that the actual improvement metric for the operation on the selected format data is not achieving the desired improvement. If so, the DBMS may dynamically switch the performing of the scan-based operation to the other format of the same data.