Abstract: Example methods, apparatus, and articles of manufacture to capture and compress telematics data are disclosed herein. An example computer-implemented method, executed by a processor, to represent telematics data includes identifying, with the processor, a physical intersection of roads, identifying, with the processor, virtual lines crossing the roads, assigning, with the processor, ordinals to the virtual lines, representing, with the processor, a physical traversal through the physical intersection captured in first telematics data by a pair of the ordinals, and storing the pair of the ordinals in second compressed telematics data.

Abstract: Embodiments of the present disclosure relate to method, device and computer program product for data backup. The method comprises: in response to receiving from a backup server a data stream to be backed up, dividing the data stream into a plurality of data segments; distributing the plurality of data segments to at least one computing node; in response to receiving an index of a corresponding data segment from a first computing node of the at least one computing node, looking up the index in a global index cache, the index being generated by the first computing node to uniquely identify the data segment, the global index cache storing indexes of data in a backup storage device; in response to the missing index in the global index cache, adding the index into the global index cache; and sending to the first computing node an indication to store the data segment in the backup storage device.

Abstract: Systems, apparatuses, methods, and computer program products are provided for managing geographically distributed data storage in a group-based communication system and for servicing deletion requests related thereto. In some embodiments, an apparatus physically located in a first geographic area defined by a first geographic boundary is provided. In embodiments, upon determining that an entity identifier associated with a message is associated with a geographic data storage policy, the apparatus is configured to transmit a geographic data residency message package comprising message data of the message to a geographic data residency server physically located within a second geographic area defined by a second geographic boundary. The second geographic area is associated with the geographic data storage policy. In some embodiments, the apparatus is configured to update the message data of the message with residency token data received from the geographic data residency server.

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: Techniques and structures to facilitate anomaly detection, including receiving performance metric data at a database system having a plurality of data point values, processing the plurality of data point values via an optimized Extreme Studentized Deviate (ESD) test to detect one or more anomalous data point values within the plurality of data point values, including storing a first set of values representing the largest values of the plurality of data point values and a second set of values representing the smallest values of the plurality of data point values, receiving a first of the plurality of data point values, determining whether the first data point value is to be included in the first set of values or the second set of values and determining that the first data point value is not an anomalous data point value upon a determination that the first data point value is not to be inserted into the first set of values or the second set of values and generating an incident alert upon a detection of one or m

Abstract: A request to perform a coordinated action is received. The coordinated action comprises a first plurality of operations. In response to reception of the request to perform the coordinated action, a second plurality of operations is performed in preparation for performing the coordinated action. A response to the request to perform the coordinated action is sent. The response to the request to perform the coordinated action comprises an indication that the first device will perform the coordinated action. An indication that the coordinated action is to be performed is received. In response to reception of the indication that the coordinated action is to be performed, the first plurality of operations is performed.

Abstract: The present disclosure relates to a method for building a knowledge graph, an electronic apparatus and a non-transitory computer-readable storage medium. The method for building a knowledge graph includes following steps: acquiring source data related to preset keywords according to the preset keywords; cleaning the source data according to a preset data dictionary and an error information table; extracting entities, attribute information of the entities and relationship information among the entities from the cleaned source data according to the preset data dictionary and an entity relationship; fusing the entities, the attribute information of the entities and the relationship information among the entities to obtain data triples, and taking the data triples as a built knowledge graph; and storing the knowledge graph into a preset graph database.

Abstract: Systems and methods are described herein for more efficiently updating a data directory, which maps data objects stored by a data storage service, such as maintained by on premise computing resources of a client of the data storage service. In one example, event data corresponding to operations performed on a plurality of data objects stored in a data storage partition of a data storage service may be obtained. A set of data objects relevant to a directory maintained locally by a client device may be determined. The event data may be filtered, such as by removing entries of the plurality of entries not corresponding to the set of data objects. The filtered event data may then be stored or pushed to a client device, to cause the directory to be updated, without requiring a full examination of the data storage partition.

Abstract: A system and method for faster access for compressed time series data. A set of blocks are generated based on a table stored in a database of the data platform. The table stores data associated with multiple sources of data provided as consecutive values, each block containing index vectors having a range of the consecutive values. A block index is generated for each block having a field start vector representing a starting position of the block relative to the range of consecutive values, and a starting value vector representing a value of the block at the starting position. The field start vector of the block index is accessed to obtain the starting position of a field corresponding to a first block and to the range of the consecutive values of the first block. The starting value vector is then determined from the block index to determine an end and a length of the field of the first block.

Abstract: Methods, systems, devices and/or apparatus related to finding and sharing information on a large-scale or global computer network such as the Internet, and, specifically, to allow for collaboratively searching for, organizing and/or accessing information.

Abstract: Distributed database management systems may maintain collections of items spanning multiple partitions. Index structures may correspond to items on one partition or to items on multiple partitions. Item collections and indexes may be replicated. Changes to the data maintained by the distributed database management system may result in updates to multiple index structures. The changes may be compiled into an instruction set applicable to the index structures. In-memory buffers may contain the instructions prior to transmission to affected partitions. Replication logs may be combined with an acknowledgment mechanism for reliable transmission of the instructions to the affected partitions.

Abstract: One or more of the systems, apparatuses, or methods discussed herein can include a quality score for a plurality of item listings or collections of item listings. Data sparseness can be avoided, as the quality score is based on inherent properties of the listing. An item listing can be recommended to a user based on the quality score. In one or more embodiments, a method can include determining a plurality of quality scores including a quality score for each of a plurality of item listings or a plurality of collections of item listings, the quality scores determined independent of a user's attributes and independent of the user's contextual information, the contextual information corresponding to details of the user's access to a website, and recommending an item listing or collection of item listings to a user based on the quality scores and the contextual information.

Abstract: This disclosure relates to systems, methods, and computer readable media for performing multi-format, multi-protocol message threading in a way that is most beneficial for the individual user. Users desire a system that will provide for ease of message threading by “stitching” together related communications in a manner that is seamless from the user's perspective. Such stitching together of communications across multiple formats and protocols may occur, e.g., by: 1) direct user action in a centralized communications application (e.g., by a user clicking ‘Reply’ on a particular message); 2) using semantic matching (or other search-style message association techniques); 3) element-matching (e.g., matching on subject lines or senders/recipients/similar quoted text, etc.); and 4) “state-matching” (e.g., associating messages if they are specifically tagged as being related to another message, sender, etc. by a third-party service, e.g., a webmail provider or Instant Messaging (IM) service).

Abstract: Disclosed are methods and systems for generating a suggestion inventory that provides improved user engagement while ensuring privacy of relationships on a social network. The methods and systems include accessing an entity graph that specifies connections between a plurality of users on the social network; identifying a first candidate user of the plurality of users that is indirectly connected to a given user of the plurality of users; computing a number of unique paths on the entity graph between the first candidate user and the given user; determining that the number of unique paths exceeds a first threshold and includes a minimum number of friends of the given user that are directly connected to the given user on the entity graph; and adding the first candidate friend to a friend suggestion inventory for the given user in response to the determination.

Abstract: A method for execution by a processing system includes determining to retrieve index data for a set of objects stored by an object storage system. An index type is selected from a plurality of index. A request message indicating a request for the index data of one of a plurality of indices stored by the object storage system corresponding to the index type is generated, and the request message is transmitted to the object storage system. The index data for the set of objects is received in a response message from the object storage system. The index data includes a plurality of pairs that each include a key and a value, where the keys correspond to the index type, and where the value of each pair includes metadata of one of the set of objects. The index data is stored in local memory in response to receiving the index data.

Abstract: The present disclosure discloses a task processing method and a distributed computing framework. A specific embodiment of the method includes: parsing an expression corresponding to a distributed computing task, and constructing task description information corresponding to the distributed computing task, the task description information being used to describe a corresponding relationship between an operator and a distributed dataset, and the operator acting on at least one of the distributed dataset or distributed datasets obtained by grouping the distributed dataset; determining, based on the task description information, a distributed dataset the operator acting on; and performing distributed computing on the distributed dataset the operator acting on using the operator. In the distributed computing, the acting scope and nesting relationship of the operator is described by constructing a topology.

Abstract: Disclosed are a notification service server and an operating method thereof. The present invention presents a notification service server capable of providing an access notification service to harmful sites and an operating method thereof to support a manager to prevent a client terminal from accessing a harmful site.

Abstract: The present invention relates to a system for providing nutritional balance based on pet health information, and more particularly, to a system for providing nutritional balance based on pet health information, which determines the amount of supply of a recipe in consideration of pet information, such as the kind, a growth stage, and an activity stage of a pet, and the amount of motion of a pet obtained from a sensor attached to a pet, thereby providing an optimum recipe and amount.

Abstract: Computer implemented systems and methods for migrating datacenter data include providing a quantity of carriers having a data storage capacity, receiving, by the quantity of carriers, a quantity of data stored in a first data storage system having a first location and including erasure coded data blocks. The quantity of carriers migrates to a second data storage system having a second location; and transmits the quantity of data to the second data storage system.

Abstract: Example methods, apparatus, and articles of manufacture to compress telematics data are disclosed herein. An example computer-implemented method includes identifying, using one or more processors, a portion of recorded telematics data representing a physical transversal of a physical intersection of two or more road segments, wherein each road segment has an assigned unique ordinal value; identifying, using one or more processors, a first road segment on which the physical transversal entered the intersection; identifying, using one or more processors, a second road segment on which the physical transversal exited the intersection; identifying, using one or more processors, a pair of ordinal values including a first ordinal value assigned to the first road segment, and a second ordinal value assigned to the second road segment; and storing the pair of ordinal values instead of the portion of the recorded telematics data in a compressed representation of the recorded telematics data.