Abstract: A database engine receives a database query that specifies retrieving data from a data source. The database engine parses the query to build an operator tree that includes a TableScan operator configured to scan a table from the data source to produce outputs corresponding to a single data field from the table, and includes a GroupBy operator that groups rows of the table according to the data field. The database engine generates and executes code corresponding to the operator tree to retrieve a result set. When the TableScan operator is a child of the GroupBy operator and the outputs are independent of duplicate input rows from the table, execution of the TableScan operator comprises, for each storage block of rows from the table: determining a storage compression scheme for encoding the data field and, for certain encodings, using the encoding to produce the outputs without duplication of rows.

Abstract: A server has a processor and a memory connected to the processor. The memory stores instructions executed by the processor to receive broadcast reports from a network, where each broadcast report includes an account identifier, a group identifier, a data stream identifier and a value. Each broadcast report is stored in a database as raw data. A request for information in the database is received. In response to the request, the raw data is altered in accordance with a pre-defined data transformation to produce transformed data. A first visualization of the transformed data associated with a first data stream identifier of a first group identifier is rendered. A second visualization of the transformed data associated with a second data stream identifier of the first group identifier is rendered. The first visualization is supplied in conjunction with the second visualization in response to the request.

Abstract: In one embodiment, a method includes accessing policy states associated with a policy, determining that a particular policy state of the policy states should not be pruned, and generating possible next policy states for the particular policy state based on one or more policy actions and one or more costs associated with the respective policy actions, wherein each policy action is associated with one or more probabilities corresponding to one or more possibilities of resulting in one or more of the possible next policy states, wherein the respective cost associated with the policy action is determined based on one or more computing costs of the policy action resulting in the one or more of the possible next policy states in combination with the respective one or more probabilities, and wherein each policy state of the created policy evaluation tree comprises a rule state for each rule of the policy.

Abstract: Systems and methods, as well as devices, are described for clinical resource generation. CCDA documents that include clinical information and observations are utilized to generate FHIR model instances that are specific to the CCDA documents. Path definitions are assigned for each information-value pair the CCDA documents that define mappings between the information-value pairs and objects of FHIR model instances. Objects for the instance models are created, and values are provided to the objects representative of the information-value pairs. Groups of objects are provided in FHIR resource bundles that are stored in a database which may be queried against to provide specific FHIR resources upon request. Requests for clinical information may be used to trigger the generation of the FHIR resource bundles.

Abstract: An example method to manage a virtual machine deployment in a cloud environment includes generating a blueprint comprising a blueprint component corresponding to an application storage policy for all endpoints associated with an infrastructure source in the cloud environment, in response to a determination that the application storage policy comprises a first storage policy of a first endpoint among the endpoints, collecting the first storage policy to deploy the virtual machine on the first endpoint according to the first storage policy, or in response to a determination that the application storage policy does not comprise any storage policy of the first endpoint among the endpoints, creating a storage policy of the first endpoint and collecting the created storage policy to deploy the virtual machine on the first endpoint according to the created storage policy.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing contextual information for a displayed resource. In one aspect, a method includes receiving, from a user device, a query-independent request for contextual information relevant to an active resource displayed in an application environment on the user device, identifying multiple search items from the content in the resource, determining a relevance score for each of the multiple search items, selecting one or more of the multiple search items based on the relevance scores, and providing, to the user device for each of the selected one or more multiple search items, a respective contextual user interface element for display with the active resource, where each contextual user interface element includes contextual information regarding the respective search item.

Abstract: A duplicate word acquisition unit acquires, as a duplicate word, when an item is selected by a user from a list of items to be selected by the user, a word contained in both text information associated with the item selected by the user and text information associated with another item having a predetermined relationship with the item selected by the user. A search condition setting unit sets a search condition for searching for an item similar to the item selected by the user based on the duplicate word. A search execution unit executes a search based on the search condition.

Abstract: A data processing system identifies a first topic for a first table, identifies a second topic for a second table, collects at least one first table attribute comprising at least one row name for the first table, and collects at least one second table attribute comprising at least one row name for the second table. The at least one semantic vector for the first table is compared with the at least one semantic vector for the second table to identify as related at least one row of the first table and at least one row of the second table. The at least one row of the first table and the at least one row of the second table are provided to a communication device with an identification as related.

Abstract: Tables and techniques to configure the same are provided. In some embodiments, configuration of one or more memory devices can permit or otherwise facilitate including transaction records in a table or another type of data structure, where the transaction records can be organized based at least on a defined location for a merchant or another type of organization associated with the transaction records.

Abstract: Embodiments of the present application disclose a method, device, system and server for acquiring and providing vehicle image data.

Abstract: Systems, devices, and methods for identifying media content using indirect qualities are provided. An example media-delivery system includes a content identification engine that applies a model associated with an indirect quality to media content items to generate indirect quality scores for the media content items, filters the media content items based on metadata associated with the media content items to generate filtered media content items, and presents at least some of the filtered media content items based on the indirect quality scores. An example media-playback device includes a search control engine that presents a search interface with a user-actuatable control for specifying a value of an indirect quality for use as a search criteria, transmits the search criteria to a media-delivery service, and receives media content items matching the search criteria from the media-delivery service, wherein the media content items are identified using a statistical model.

Abstract: A method of managing data transfer from a server to an electronic device via a wireless communication, includes initiating a synchronization of a database of the electronic device with the server and determining, by the electronic device, a length of time since the synchronization of the database of the electronic device with the server. The method also includes, in response to determining that the length of time meets the threshold period, determining a quantity of data records for sending from the server to the electronic device to perform a further synchronization and requesting one of complete data records or incomplete data records based on the quantity of data records for transfer to the electronic device.

Abstract: A database is partitioned into a plurality of sorted runs, wherein each sorted run includes a set of sorted segments of data records. One of the sorted runs preferably includes more than half of the records of the database, and the other sorted runs are progressively smaller. A query is processed by searching each of the sorted runs. Writes are effected by appending a new sorted run to the database. Sorted merges are used to combine the smaller sorted runs. Deletions are effected by marking the deleted record in the sorted run. Modifications are effected by deleting the original record and writing the modified record to the database. The larger sorted runs are only re-sorted or merged when the sorted run includes a substantial number of deletions. Two merge queues are maintained to enable rapid merges of the smaller sorted runs while a merger of larger sorted runs are occurring.

Abstract: The present technology provides an interface and system for generating a previous version of a directory structure that can be useful in the restoration of a directory or file. The system, methods and non-transitory computer-readable storage media include receiving a request for a previous version of a directory structure at an indicated date, querying a content management system for placeholder content items associated with the previous version of the directory structure at the indicated date, receiving the placeholder content items, and generating a read-only copy of at least a portion of the previous version of the directory structure at the indicated date based on the placeholder content items, wherein the read-only copy of the directory structure is separate from the directory structure at a current date.

Abstract: Embodiments of the invention are directed to a block chain architecture for optimized system performance and data storage. The invention provides a unique structure comprising levels of interconnected chains that allow for dynamically configurable connections to be formed between the various nodes. Connections between the different of the hierarchy create a continuum of regions allowing for data to be moved across the spiral construction over time depending on the requirements of the data. In this way, storage and management of the data is optimized through a trade-off of data requirements as data moves between different levels of the spiral architecture based on user preference and, ultimately, to permanent data retirement and long-term storage. Further, the present invention provides a method of decentralized data storage across optimized storage regions within the block chain hierarchy.

Abstract: In some examples, a system may receive, from a first user, a request to create a team folder from a folder associated with the first user. The request may indicate a requested storage quota from a team folder storage pool to associate with the team folder. The system may determine whether the requested storage quota is below a threshold amount corresponding to a profile for team folder creation associated with the first user. If the requested storage quota is below the threshold amount, the system may automatically create a shared file system for the team folder and allocate a quantity of storage from the team folder storage pool to the shared file system based on the requested storage quota. Alternatively, if the requested storage quota exceeds the threshold amount, the system may generate a communication to an administrator to request approval for creation of the team folder.

Abstract: The use of log marking (otherwise known as “coloring”) of sub-portions of a log that records actions (e.g., data operations) performed by a computing system. The log is composed of multiple sub-portions, such as virtual log files, which are successively added to the log as the log grows. For instance, the sub-portions may be virtual log files of the log. The principles described herein change the use of log marking depending on which sub-portion of the log is being marked. If the computing system fails, and recovery is needed, the recovery process can thus deterministically identify where the last written log record is.

Abstract: Methods, systems, and computer-readable media for chain logging using key-value data storage are disclosed. A chain is generated that represents a plurality of events in chronological order. The chain comprises a head and one or more nodes. The head and the one or more nodes are stored in a persistent data store as a plurality of key-value pairs. For a request to add data indicative of a new event to the chain, the head is updated in the data store to include the data indicative of the new event.

Abstract: A method of improving data sets, for example, of patients, each being characterized by relatively low-cost medical data, identifies those patients where the acquisition of higher cost medical data would best inform an estimate of the higher cost medical data for the remaining patients. In this way scarce medical resources can be more efficiently applied in characterizing a potential patient pool, for example, for a clinical trial when resources are not available for extensive medical characterization of each trial participant.

Abstract: A matching machine accordingly accesses a query fingerprint that includes query sub-fingerprints that have been generated from query segments of a portion of query audio. After selecting reference sub-fingerprints for comparison to the query sub-fingerprints, the matching machine identifies a best-matching subset of the reference sub-fingerprints by evaluating total matches between the query sub-fingerprints and different subsets of the reference sub-fingerprints. The match machine then generates a count vector that stores the total counts mapped to respective offsets from a reference point in the reference sub-fingerprints. The matching machine determines a maximum count among the total counts and classifies the reference sub-fingerprints as a match with the query sub-fingerprints based on the maximum count.