Abstract: Consistent queries to replicated data may be performed according to global clock values. Time values for updates performed at a data set may be identified according to a global clock. The updates may be replicated to a replicated portion of a data set. Queries directed to the replicated portion of the data set may be performed in response to determining that the time values for updates indicate that the replicated portion of the data set is consistent with a time value identified for the query according to the global clock.

Abstract: An electrical connector includes: plural terminal modules each including a row of terminals arranged in a first direction and an insulator molded with the row of terminals, the plural terminal modules being arranged in a second direction perpendicular to the first direction; and an insulating housing overmolding and retaining the plurality of terminal modules to define a mating cavity, wherein the insulator of each terminal module defines plural through holes running therethrough in the second direction, and materials of the insulating housing fill the through holes of each terminal module.

Abstract: A vehicle equipment seal device includes a main body portion, a bolt portion, a metal wire connection portion and a lock structure. The main body portion has a connection surface. The bolt portion is inserted into the main body portion. The metal wire connection portion has one end fixed on the connection surface of the main body portion, and the other end provided with the bolt portion. The lock structure is arranged in the main body portion, wherein the lock structure includes a motor and a sensor, and the sensor is used to position a turning position of the motor, thereby determining whether the lock structure locks the bolt portion or unlocks the bolt portion.

Abstract: A tracker includes a tracking device and a battery device. The tracking device has recesses, fixing holes and conductive points. The battery device has a receiving portion and a body portion integrally coupled to the receiving portion. The receiving portion is provided with a receiving groove and has protrusions, through holes and conductive terminals. The body portion has recesses, fixing holes and conductive points. The tracking device is received in the receiving groove. The recesses, fixing holes and conductive points of the tracking device are respectively corresponding to the protrusions, through holes and conductive terminals of the battery device. The shape of the body portion is the same as that of the tracking device, and the recesses, fixing holes and conductive points of the body portion are disposed at the same position as the tracking device.

Abstract: Transaction requests may be ordered in a distributed database according to an independently assigned sequence. Different distributed system nodes, such as a transaction coordinator and a storage node may independently assign sequence numbers to requests to access a distributed database. A storage node may receive the request from a transaction coordinator with an assigned sequence number and another request to which the storage node may assign a sequence number. The storage node can then order performance of the requests based on the sequence numbers.

Abstract: Replicated partitions of a database may be moved from one or more replica nodes to a different primary node. The replica nodes may maintain replicated partitions of one or more primary partitions of a primary node servicing access requests to the primary partitions. The replicated partitions may be copied to a different node in order to cause the processing of access requests directed to primary partitions to be serviced by the different node. Replicated partitions of a database may be moved from replica nodes to perform a split operation or a merger operation.

Abstract: Transaction requests may be ordered in a distributed database according to an independently assigned sequence. Different distributed system nodes, such as a transaction coordinator and a storage node may independently assign sequence numbers to requests to access a distributed database. A storage node may receive the request from a transaction coordinator with an assigned sequence number and another request to which the storage node may assign a sequence number. The storage node can then order performance of the requests based on the sequence numbers.

Abstract: A tracker includes a tracking device and a battery device. The tracking device has recesses, fixing holes and conductive points. The battery device has a receiving portion and a body portion integrally coupled to the receiving portion. The receiving portion is provided with a receiving groove and has protrusions, through holes and conductive terminals. The body portion has recesses, fixing holes and conductive points. The tracking device is received in the receiving groove. The recesses, fixing holes and conductive points of the tracking device are respectively corresponding to the protrusions, through holes and conductive terminals of the battery device. The shape of the body portion is the same as that of the tracking device, and the recesses, fixing holes and conductive points of the body portion are disposed at the same position as the tracking device.

Abstract: Processing and storage responsibility for a data set may be split according to separately stored shards of the data set. As one or more loads associated with shards of the dataset grow a re-sharding operation may be performed to reduce loading of particular shards and nodes that host the particular shards. A re-sharding operation may cause only a sub-set of as set of shards of the dataset to be split and only cause second portions of the split shards to be stored in additional computing nodes. In some embodiments, a number of shards to be included in the sub-set of shards to be split may be selected based on an overall number of shards in the set and a largest number in the Fibonacci sequence that is less than the overall number of shards in the set.

Abstract: Multi-type attribute indexes may be implemented for document databases. When a request to perform a query at a document database is received that is directed toward in indexed attribute that has multiple data types for values stored in the multi-type attribute index, a predicate in the query may be replaced with a different predicate that is applicable to search the multi-type attribute index according to a sort order for the multiple data types stored in the at multi-type attribute index. A plan that includes the different predicate may be performed in order to provide a result of the query to a user.

Abstract: The subject technology generates a dataset based at least in part on a set of files. The subject technology generates, utilizing a machine learning model, a set of labels corresponding to the dataset. The subject technology filters the dataset using a set of conditions to generate at least a subset of the dataset. The subject technology generates a virtual object based at least in part on the subset of the dataset and the set of labels, where the virtual object corresponds to a selection of data from the dataset. The subject technology trains a second machine learning model using the virtual object and at least the subset of the dataset, where training the second machine learning model includes utilizing streaming file input/output (I/O), the streaming file I/O providing access to at least the subset of the dataset during training.

Abstract: A distributed graph database that enables scaling and efficient processing is described. The distributed graph database can, for example, scale up to petabytes of data to enable transactional processing of graph data with low latency and low processing overhead. The distributed graph database can include a cluster of devices and a remote direct memory access (RDMA)-based communication layer to perform low latency messaging between devices of the cluster of devices. Additionally, the distributed graph database can include a shared memory layer that provides one or more data structures, a transaction layer to facilitate query processing, and a graph database layer stored in computer-readable media and executed on a processor to implement a graph data model. In at least one example, the graph data model can be mapped to the one or more data structures.

Abstract: Transaction requests may be ordered in a distributed database according to an independently assigned sequence. Different distributed system nodes, such as a transaction coordinator and a storage node may independently assign sequence numbers to requests to access a distributed database. A storage node may receive the request from a transaction coordinator with an assigned sequence number and another request to which the storage node may assign a sequence number. The storage node can then order performance of the requests based on the sequence numbers.

Abstract: Processing responsibility for a data set may be split according to separately stored partitions of the data set. A data set may be stored in different storage units that separately store different partitions of the data set. Mapping information may be maintained indicating the assignment of a node to process access requests to multiple partitions of a data set. A split event may be detected for the node, and one or more partitions assigned to the node may be reassigned to a different node. The storage units for the reassigned partitions may be made accessible to the different node. Then mapping information can be updated to indicate change in assignment from the original node to the different node so that the different node can begin processing access requests for the reassigned partitions.

Abstract: A distributed graph database that enables scaling and efficient processing is described. The distributed graph database can, for example, scale up to petabytes of data to enable transactional processing of graph data with low latency and low processing overhead. The distributed graph database can include a cluster of devices and a remote direct memory access (RDMA)-based communication layer to perform low latency messaging between devices of the cluster of devices. Additionally, the distributed graph database can include a shared memory layer that provides one or more data structures, a transaction layer to facilitate query processing, and a graph database layer stored in computer-readable media and executed on a processor to implement a graph data model. In at least one example, the graph data model can be mapped to the one or more data structures.

Abstract: A receptacle electrical connector includes a metallic shell, an insulating bracket defining a receiving cavity, an upper member including a base portion and a mating portion and a lower insulating member distinct from and assembled with the base portion. The upper member is loaded with upper contacts with contacting portions arranged on an upper surface of the mating portion and a shielding plate is located between the upper and lower surface of the upper member. The lower member is loaded with lower contacts with contacting portions extending beyond a front edge of the lower insulating member and arranged on the lower surface of the mating tongue. The assembled base portion and the lower member is received in the receiving cavity of the insulating bracket and the mating portion extends beyond a front face of the insulating bracket and surrounding by the metallic shell to define a mating cavity thereamong.

Abstract: The use of statistics collected during the parallel distributed execution of the tasks of a job may be used to optimize the performance of the task or similar recurring tasks. An execution plan for a job is initially generated, in which the execution plan includes tasks. Statistics regarding operations performed in the tasks are collected while the tasks are executed via parallel distributed execution. Another execution plan is then generated for another recurring job, in which the additional execution plan has at least one task in common with the execution plan for the job. The additional execution plan is subsequently optimized based at least on the statistics to produce an optimized execution plan.

Abstract: Systems and methods that enable resolving deadlock cycles by victim selection based on cost and/or priority of strongly connected components in a static wait-for graph. As such, victims can be selected by iteratively estimating total deadlock resolution cost (based on cost of strongly connected components) for remaining deadlock participants, selecting the participant with the least estimated total cost as the next victim, and reducing the wait-for graph after removing the victim vertex. The victim selection algorithm can be a cost-based greedy algorithm, wherein during each victim selection iteration, a single optimal victim is selected based on estimated remaining cost.

Abstract: An electrical connector assembly comprises a first connector unit and a second connector. The first connector unit comprises a first connector having an insulative housing with a plurality of contacts mounted thereon. A printed circuit board, on which the first connector is seated, defines a pair of mounting sections at opposite ends thereof and locate adjacent to the first connector. An insulative cover is attached to a first surface of the printed circuit board which is opposite to the first connector. The insulative cover forms a pair of guiding posts retained in said mounting sections and a pair of stand-off sections located at opposite ends thereof for supporting the first connector during the mating process. A metallic cover is attached to the insulative cover. The second connector defines a pair of guiding apertures at opposite ends thereof for receiving said guiding posts.

Abstract: A receptacle electrical connector includes a metallic shell, an insulating bracket defining a receiving cavity, an upper member including a base portion and a mating portion and a lower insulating member distinct from and assembled with the base portion. The upper member is loaded with upper contacts with contacting portions arranged on an upper surface of the mating portion and a shielding plate is located between the upper and lower surface of the upper member. The lower member is loaded with lower contacts with contacting portions extending beyond a front edge of the lower insulating member and arranged on the lower surface of the mating tongue. The assembled base portion and the lower member is received in the receiving cavity of the insulating bracket and the mating portion extends beyond a front face of the insulating bracket and surrounding by the metallic shell to define a mating cavity thereamong.