Abstract: Access usage of one or more shards of a set of shards of a database is determined. The set of shards includes a plurality of shards including a primary shard and one or more replica shards of the primary shard. A shard of the plurality of shards is selected based on the access usage, and a set of indexes is built for the shard that is selected. The set of indexes built for the shard that is selected is used for at least multiple shards of the plurality of shards.

Abstract: A data rebuilding method, a memory storage apparatus, and a memory control circuit unit are disclosed. The method includes: establishing a connection between the memory storage apparatus and a host system; storing a first data to a memory of the host system via the connection; detecting an error in the first data in the memory; and rebuilding a part of data in the first data in the memory according to the error.

Abstract: A package structure includes a first die and a second die embedded in a first molding material, a first redistribution structure over the first die and the second die, a second molding material over portions of the first die and the second die, wherein the second molding material is disposed between a first portion of the first redistribution structure and a second portion of the first redistribution structure, a first via extending through the second molding material, wherein the first via is electrically connected to the first die, a second via extending through the second molding material, wherein the second via is electrically connected to the second die and a silicon bridge electrically coupled to the first via and the second via.

Abstract: The present disclosure provides a memory device, a semiconductor device, and a method of operating a memory device. A memory device includes a memory cell, a bit line, a word line, a select transistor, a fuse element, and a heater. The bit line is connected to the memory cell. The word line is connected to the memory cell. The select transistor is disposed in the memory cell. A gate of the select transistor is connected to the word line. The fuse element is disposed in the memory cell. The fuse element is connected to the bit line and the select transistor. The heater is configured to heat the fuse element.

Abstract: The present invention discloses a highly reliable implantable device of an implantable biological sensor. Before use, the fixed seat cannot move relative to the slidable seat, achieving reliable transportation. In use, the lower end face of the slidable seat is pressed against the skin; the lower end face of the first snap-fit protrusion squeezes the upper end face of the vertical snap-fit plate; the first snap-fit protrusion is gradually away from the support of the vertical snap-fit plate, whereby the inside vertical face of the vertical snap-fit plate pushes the first snap-fit protrusion inward, and the fixed seat moves downward relative to the slidable seat, achieving good controllability.

Abstract: An electronic device includes a first insulating layer, a first conductive portion, a second conductive portion, a transistor, and an electronic unit. The first insulating layer has a first opening penetrating the first insulating layer along a first direction. The first conductive portion is disposed in the first opening. The second conductive portion is electrically connected to the first conductive portion. The transistor is electrically connected to the second conductive portion. The electronic unit is electrically connected to the first conductive portion. In a cross-sectional view of the electronic device, the electronic unit and the second conductive portion are disposed on two opposite sides of the first insulating layer respectively, the first conductive portion has a first length along a second direction perpendicular to the first direction, the second conductive portion has a second length along the second direction, and the first length is different from the second length.

Abstract: A computer-implemented method dynamically switches access plans for a query during concurrent query execution. The method includes receiving a first query configured to be processed by a database system. The method also includes generating, for the first query, an access plan for each of identified resource sets. The method includes determining a first set of available resources that represent an available capacity for the database system. The method further includes selecting a first resource set of the one or more resource sets, where the selecting is based on the first set of available resources being closest to the first resource set. The method also includes selecting, based on the first set of available resources, a first access plan of the one or more access plans. The method includes executing the first query and returning results of the first query to a source of the first query.

Abstract: This disclosure provides a method, a computing system, and a computer program product for managing prefetching of pages in a database system. The method comprises obtaining shared information associated with page access, wherein the shared information associated with the page access includes information associated with the page access from a plurality of computing nodes. The method further comprises determining whether to prefetch a number of pages into a global buffer pool based at least on the shared information associated with the page access using a sequential prefetching method.

Abstract: A centrifugal heat dissipation fan including a housing and an impeller is provided. The housing has at least one inlet disposed along an axis and at least one first outlet and a second outlet located in different radial directions, wherein the first outlet and the second outlet are opposite to and separated from each other. The impeller is disposed in the housing along the axis. A heat dissipation system of an electronic device is also provided.

Abstract: A computer implemented method processes a query. A number of processor units processes the query to identify a result set in response to receiving the query from a first client. The number of processor units stores, the result set in a shared cache assigned to a group of clients, wherein result set stored in the shared cache is accessible by the group of clients. The number of processor units returns the result set to a second client in the group of clients from the shared cache in response to receiving the query from the second client in the group of clients.

Abstract: Computer technology for retrieving data stored in a table that includes the following computer operations: receiving, from persistent storage of a computer, an original Index Tree data structure; storing, in volatile memory, a memory-based Index Tree data structure based on the original Index Tree data structure, with the memory-based Index Tree data structure including: a root node, a set of hierarchically arranged intermediate layer(s) with each intermediate layer including a plurality of non-leaf nodes, and a leaf layer including a plurality of leaf nodes; and retrieving data from a table in a database, with the retrieval including traversing the memory-based Index Tree data structure through a plurality of child lock pointers to locate pages including the data to be retrieved from the table.

Abstract: An embodiment for analyzing and tracking data flow to determine proper schemas for unstructured data. The embodiment may automatically use a sidecar to collect schema discovery rules during conversion of raw data to unstructured data. The embodiment may automatically generate multiple schemas for different tenants using the collected schema discovery rules. The embodiment may automatically use ETL to export unstructured data to SQL databases with the generated multiple schemas for the different tenants. The embodiment may automatically monitor usage data of the SQL databases and collect the usage data. The embodiment may automatically optimize schema discovery using the collected usage data. The embodiment may automatically discover schemas with hot usage and apply the discovered schemas with hot usage to other tenants for consumption and further monitoring.

Abstract: A computer-implemented method, system and computer program product for scaling a resource of a Database as a Service (DBaaS) cluster in a cloud platform. User service requests from a service cluster to be processed by the DBaaS cluster are received. A first set of tracing data is generated by a service mesh, which facilitates service-to-service communication between the service cluster and the DBaaS cluster, from the user service requests. A second set of tracing data is generated by the DBaaS cluster from handling the user service requests. A dependency tree is then generated to discover application relationships to identify potential bottlenecks in nodes of the DBaaS cluster based on these sets of tracing data. The pod(s) of a DBaaS node are then scaled based on the dependency tree, which is used in part, to predict the utilization of the resources of the DBaaS node identified as being a potential bottleneck.

Abstract: This disclosure provides a computer-implemented method, a computer system and a computer program product for database compression oriented to combinations of fields of a database record. One or more combinations of fields of a record of a database are determined that satisfy a frequency criterion indicating that access frequencies of the one or more combinations of fields are higher than an access frequency threshold. The record is reorganized based on the one or more combinations of fields to store fields of each combination of the one or more combinations of fields in a respective contiguous storage space. The reorganized record is compressed by applying a compression scheme to the one or more combinations of fields.

Abstract: A computer-implemented method that includes receiving an ingestion request to ingest data to a database comprising physical shards and detecting that the ingestion request is directed to a first hotspot shard. The first hotspot shard has a contention level over a threshold value. The method also detects context characteristics within the data and generates a first virtual shard based on a first virtual shard key selected from the detected context characteristics. The first virtual shard virtually duplicates at least a portion of the first hotspot shard. The method also includes ingesting the data to the first virtual shard.

Abstract: A method, computer system, and a computer program product is provided for computer log management. In one embodiment, in response to receiving a log request from a user, an input content is analyzed and adjusted according to input contents and user's previous activities. A similarity analysis and a fairness analysis is performed to determine similarities between the input content, as adjusted, and a plurality of log records in an object library. The similarity analysis includes analyzing any patterns and attributes. The attributes have a dimension, and each dimension has a predefined weight (W). The fairness analysis ensures that one type of log is not favored over others. A best possible match is then determined, and one or more logs are presented to the user providing the best possible match.

Abstract: A field-of-view stitching system including: a light source module for emitting a first beam; a light guiding element for splitting the first beam into a plurality of second beams and includes an incident surface, a first exit surface, and a plurality of second exit surfaces, the second beams propagate along an optical path of the first beam; and a plurality of light modulators, a number of the plurality of light modulators is the same as a total number of the first exit surface and the plurality of second exit surfaces, each of the plurality of light modulators is configured to receive and regularly reflect one of the plurality of second beams; the light guiding element is further configured to receive and combine the second beams reflected by the light modulators to form an illuminating light. A field-of-view stitching method, a biological sample identification device and method are also provided.

Abstract: One or more computer processors generate a debug chain from one or more similar resource bound breakpoints, wherein the debug chain provides dynamic code flow. The one or more computer processors distribute the generated debug chain to one or more tenants.

Abstract: A display device and a control method thereof are provided. The display device includes a display panel, a first light source, and a second light source. The first light source is disposed adjacent to a first side of the display panel corresponding to a first part display area of the display panel. The second light source is disposed adjacent to a second side of the display panel corresponding to a second part display area of the display panel, wherein the first side is opposite to the second side. The first light source and the second light source are respectively lit up during a first time period and a second time period, wherein an interval time is provided between the first time period and the second time period.

Abstract: Disclosed are techniques for relational database locks based on columns. Database transactions may be targeted to specific columns of one or more records, instead of the entire row for those records, using primary keys. Column locks on specific keys are stored separately than column locks on ranges of keys, which are both checked when requesting a new column lock for either a single key or a range of keys. When a threshold number of columns for a given record, or range of records/keys, have been locked, the column locks for that record, or range of records, can be combined into a single row level lock to reduce resource costs for maintaining multiple concurrent locks.