Abstract: Provided are sleep quality assessment methods, apparatuses, electronic devices, and storage medium, and relates to the field of artificial intelligence and deep learning technologies, and in particular to sleep quality assessment methods, apparatuses, electronic devices, and storage medium. The method includes: determining sleep data of a subject; obtaining sleep feature data based on a reference core sleep period of the subject and the sleep data; and evaluating sleep quality of the subject based on the sleep feature data. The method assesses the sleep quality of the subject based on the sleep feature data extracted based on the reference core sleep period of the subject and the sleep data of the subject, takes into account individual factors of the subject in extracting the sleep feature data, thus providing a more accurate assessment of the sleep quality of the subject.

Abstract: A coil module includes a first planar coil winding that includes a plurality of turns of coils, at least one turn of first coil in the plurality of turns of coils includes at least one first cutting opening, and the first cutting opening divides the first coil into a first outer side part and a first inner side part along an extension direction of the coil, and a first target side part includes a first cutting groove, the first target side part is at least one of the first outer side part and the first inner side part, an extension direction of the first cutting groove is the same as an extension direction of the first target side part, and a width of a single first cutting groove is less than or equal to a width of a single first cutting opening.

Abstract: A water tank for a sweeper and a sweeper including the same are provided. The water tank for the sweeper includes: a water tank lower cover, a bottom of which is provided with a containing groove; a water tank upper cover, which is connected with the water tank lower cover; a water tank release button arranged at the containing groove; and a reset member, a first end of which is coupled to the water tank release button and a second end is coupled to the water tank lower cover.

Abstract: Embodiments of this specification disclose graph data partition computer-implemented methods, non-transitory, computer-readable media, and computer-implemented systems. A computer-implemented method includes partitioning vertices in graph data into a plurality of dataset. Edges in the graph data are partitioned into datasets that include target vertices of the edges, where the datasets are used by nodes in a distributed cluster to perform graph computation, and where computational loads of the plurality of datasets are similar Implementations of this specification can achieve load balancing between nodes in the distributed cluster and can reduce communication overhead.

Abstract: Embodiments of this specification provide distributed data processing methods, apparatuses, and devices. One method includes: determining an active vertex set that currently participates in data processing in target graph data, in response to determining that an external memory of a first distributed node stores an active vertex in the active vertex set, determining, from a plurality of predetermined data processing modes, a target data processing mode that matches the active vertex set, determining, based on the target data processing mode, a to-be-updated vertex according to the association relationship with the active vertex, and sending, based on first data of the active vertex in the external memory, a first update message to a target distributed node in which the to-be-updated vertex is located.

Abstract: A method for analyzing disaster prevention and mitigation effectiveness of an ecological seawall is provided, including: performing seawall ecologicalization on a target seawall; establishing three-dimensional space hydrodynamic force for the target ecological seawall; simulating wave climbing on a dike body and a wave overtopping on a dike top of the target ecological seawall to obtain a wave overtopping index; calculating wave-flow bottom shear stress of the target ecological seawall, establishing a sediment movement model, and calculating suspended load and bed load sediment transportation volumes; calculating the change index of coastal bed surface according to the suspended load and bed load sediment transportation volumes, and determining a development index of tidal flats in front of dike of the target ecological seawall according to the change index; and calculating the disaster prevention and mitigation effectiveness grade of the target ecological seawall according to the wave overtopping index and t

Abstract: The present disclosure provides a method for reducing noise in AES detection, including steps: obtaining G based on a sub-array {tilde over (Z)} of detection data; for each element in G, forming a set of data using three adjacent elements including the element in a column direction, and sorting the set of data in a descending order to obtain an array {tilde over (D)}; performing normalization processing on the array {tilde over (D)} to obtain an array D; for each element in {tilde over (Z)}, forming a set of data using three adjacent elements including the element in the column direction, and sorting the set of data in a descending order to obtain an array U of m rows by n columns; calculating a noise difference value in the column direction, i.e., an array C of m rows by n?1 columns; formulating a noise array N of m rows by n columns; and constructing a new sub-array PN.

Abstract: A method for dynamic filter pushdown for massive parallel processing databases on the cloud, including acquiring one or more filters corresponding to a query, acquiring statistics information of one or more database tables, determining a selectivity of the one or more database tables based on the statistics information, determining whether the selectivity satisfies a threshold condition, and pushing down the one or more filters to the one or more database tables based on the determination of whether the selectivity satisfies a threshold condition.

Abstract: Embodiments of the present disclosure provide methods and devices for formatting a database. The method can include clustering, into each block, a set of sequence of elements from each column of a database; generating a file storing one or more blocks having the clustered set of sequences of elements; providing a first table storing file schema information that associates the elements with the file; and providing a second table for storing block schema information that associates the columns with the one or more blocks.

Abstract: The present disclosure provides systems and methods for prefetching data in databases. One method for prefetching data in a database comprises receiving a database query on the database, determining one or more sets of adjacent columns access by the database query, and for each set of adjacent columns of the one or more determined sets, prefetching data in the adjacent columns.

Abstract: The present disclosure provides a method for generating a classification model in a database system. The method comprises generating a plurality of database tables by performing data clustering on a database, acquiring a plurality of queries associated with information from the database, generating training data by executing each of the plurality of queries on the plurality of database tables, and training a classification model using the training data, wherein the classification model is used to select a database table for a query based on corresponding performance information associated with the query on the database during executing of the query. The present disclosure also provides a method for executing a query on a database using a classification model. The method comprises obtaining the classification model, obtaining a database query, generating a target table by inputting the database query into the classification model, and executing the database query on the target table.

Abstract: Efficient large column values storage in columnar databases is disclosed, including: providing a database comprising a write storage, a read storage, and an auxiliary storage, and wherein the auxiliary storage is used to store a large column value of a row that is associated with either the write storage or the read storage, wherein the large column value comprises a column value that meets a set of large column value criteria; and operating the database using the write storage, the read storage, and the auxiliary storage.

Abstract: Embodiments of the present disclosure provide methods and devices for inserting data in a database. The method can include caching one or more rows of data in a delta table in response to a request to insert the one or more rows in a destination table, wherein the destination table is one of a group of destination tables of a first database, and wherein the delta table contains requested changes of rows of the destination table, the changes being caused by a data operation; determining a priority of the destination table based on runtime information of the destination table relative to the group of destination tables; and scheduling the merging of the inserted rows from the delta table to the destination table based on the determined priority of the destination table. The destination table is in a format of a file storing one or more blocks, each block having a set of sequence of elements clustered from each column of the destination table.

Abstract: Intelligent merging for efficient updates in columnar databases are disclosed, including: determining a current age associated with a row in a database, wherein the database comprises a write storage and a read storage, wherein the row is located in the write storage; determining a set of one or more merge criteria based at least in part on a modification age distribution, wherein the modification age distribution is dynamically determined based at least in part on previous transactions at the database; determining whether the current age meets the set of merge criteria; and in response to a determination that the current age meets the set of merge criteria, merging the row from the write storage into the read storage.

Abstract: Intelligent merging for efficient updates in columnar databases are disclosed, including: determining a current age associated with a row in a database, wherein the database comprises a write storage and a read storage, wherein the row is located in the write storage; determining a set of one or more merge criteria based at least in part on a modification age distribution, wherein the modification age distribution is dynamically determined based at least in part on previous transactions at the database; determining whether the current age meets the set of merge criteria; and in response to a determination that the current age meets the set of merge criteria, merging the row from the write storage into the read storage.

Abstract: Efficient large column values storage in columnar databases is disclosed, including: providing a database comprising a write storage, a read storage, and an auxiliary storage, and wherein the auxiliary storage is used to store a large column value of a row that is associated with either the write storage or the read storage, wherein the large column value comprises a column value that meets a set of large column value criteria; and operating the database using the write storage, the read storage, and the auxiliary storage.

Abstract: The present disclosure provides systems and methods for an indexing system in databases. One method for locating a row in a row-group columnar storage database comprises: receiving a query to locate a target row in the row-group columnar storage database that comprises rows of data divided into one or more blocks of data having columns of data that correspond to the rows of data, and one or more block information tables having column information corresponding to the columns of data in the one or more blocks of data, each block information table of the one or more block information tables being associated with a corresponding block of data of the one or more blocks of data; and locating the target row using the column information from the one or more block information tables.

Abstract: The present disclosure provides systems and methods for prefetching data in databases. One method for prefetching data in a database comprises receiving a database query on the database, determining one or more sets of adjacent columns access by the database query, and for each set of adjacent columns of the one or more determined sets, prefetching data in the adjacent columns.

Abstract: Embodiments of the present disclosure provide methods and devices for inserting data in a database. The method can include caching one or more rows of data in a delta table in response to a request to insert the one or more rows in a destination table, wherein the destination table is one of a group of destination tables of a first database, and wherein the delta table contains requested changes of rows of the destination table, the changes being caused by a data operation; determining a priority of the destination table based on runtime information of the destination table relative to the group of destination tables; and scheduling the merging of the inserted rows from the delta table to the destination table based on the determined priority of the destination table. The destination table is in a format of a file storing one or more blocks, each block having a set of sequence of elements clustered from each column of the destination table.

Abstract: The present disclosure provides a method for compressing numeric data. The method comprises receiving a data set having a plurality of numeric values; for each numeric value of the plurality of numeric values of the data set, dividing a numeric value into a plurality of arrays arranged according to a specific location of the numeric value, wherein the plurality of arrays include a first array and a second array; grouping, across the plurality of numeric values, first arrays; grouping, across the plurality of numeric values, second arrays; and compressing the group of first arrays and the group of second arrays. The present disclosure also provides a method for decompressing numeric data. The method comprises receiving a data buffer comprising compressed numeric values; decompressing the compressed numeric values into groups of arrays; aligning the groups of arrays according to their relative positions from decimal points; and reconstructing numeric values according to the aligned groups of arrays.