Abstract: Database processing using columns to present to a processing unit decompressed column data without changing the underlying row-based database architecture. For some embodiments, a database accelerator is used to efficiently process the columns of a database and output tuples to a processing unit's memory, such that the columns can be quickly processed (with the advantages of a column-based architecture) to create tuples of requested data, but without having to depart from a row-based architecture at the processing unit level or having decompressed data scattered throughout the processing unit's memory.

Abstract: A storage apparatus includes a data storage unit, management information storage unit, compression judgment unit, and compression control unit. The data storage unit stores the data of files. The management information storage unit stores management information on the files. The compression judgment unit evaluates compression effectiveness for a file at prescribed execution timing and determines whether the compression of the file is appropriate or not. The compression control unit updates the management information so as to reflect the determination result obtained by the compression judgment unit, and then stores the compressed data of the file in a compressed format in the data storage unit if the determination result indicates that the compression is appropriate, and stores the uncompressed data of the file in an uncompressed format in the data storage unit if the determination result indicates the compression is inappropriate.

Abstract: An apparatus comprises a processing platform configured to implement a cluster labeling system for documents comprising unstructured text data. The cluster labeling system comprises a clustering module and a visualization module. The clustering module implements a topic model generator and is configured to assign each of the documents to one or more of a plurality of clusters based at least in part on one or more topics identified from the unstructured text data using at least one topic model provided by the topic model generator. The visualization module comprises multiple view generators configured to generate respective distinct visualizations of a selected one of the clusters. The multiple view generators include at least a bigram view generator configured to provide a visualization of a plurality of term pairs from the selected cluster, and a summarization view generator configured to provide a visualization of representative term sequences from the selected cluster.

Abstract: A data-processing technique for increasing data-size capacity and improving query speed on large datasets where fields within records are replaced by integers representing distinct values of those fields, the integers drawn from a densely-populated range, wherein a computer data storage structure is initialized and maintained to represent a large number of binary values (“bits”) within a smaller number of actual machine-memory bits of the computer. Representative structures and operations thereon, as well as applications of the data structure to support more-sophisticated data structures and operations, are described and claimed.

Abstract: Various technologies described herein pertain to detecting contextual anomalies in a behavioral network. Label propagation can be performed to construct contexts and assign respective context membership scores to users. Each context can be a respective subset of the users expected to have similar resource usages. The contexts can be constructed and the context membership scores can be assigned by combining behavioral information and contextual side information. The behavioral information can specify respective resource usages by the users within the behavioral network. Moreover, respective contextual anomaly scores for the users can be computed based on the respective context membership scores assigned to the users and the contextual side information. Further, the contextual anomalies can be detected from the contextual anomaly scores.

Abstract: The invention identifies and caches query plans in a shared-nothing distributed data store that are unlikely to become invalid because they do not reference objects that are likely to be changed or deleted. Plans that are likely to become invalid and are not cached are those plans that reference data that is partitioned across segment/query execution nodes of the data store, plans that are complex, and plans that reference objects that are not “built-in” (primitive) objects. The effect is that most plans which are generated on a query dispatch (master) node are not cached, whereas most plans generated on an execution (segment) node are cached.

Abstract: A system for an efficient data rehydration comprises a server, one or more reader device managers, a writer device manager, and a verifier. The server is for receiving a restore list comprising a plurality of storage locations and lengths for performing a data rehydration. The one or more reader device managers is for reading a data set indicated by the restore list by reading the plurality of storage locations for the lengths from one or more storage nodes. The plurality of storage locations and lengths indicate chunks from a client system stored as part of a full or as an incremental backup session on a storage device attached to a storage node. The writer device manager is for transferring the data set to a save node. A verifier is for verifying transfer of the data set.

Abstract: A technique and associated mechanism is described for registering event metadata at a first site, transferring the event metadata to a second site using a portable module, and processing the event metadata at the second site. A user can register the event metadata at the first site in the course of consuming broadcast content. Namely, when the user encounters an interesting portion of the broadcast content, the user activates an input mechanism, resulting in the storage of event metadata associated with the interesting portion on the portable module. The second site can upload the event metadata from the portable module and, in response, provide content associated with the event metadata, including recommended content associated with the event metadata.

Abstract: A system and related methods suggest content based on user input and another metric. In one implementation, web-sites are suggested to advertisers in response to keyword input and by factoring in how often such web-sites were selected or “clicked on” as a result of corresponding search queries. Search logs are processed to determine how often certain query terms led to web-sites being selected. Web-sites are ranked accordingly. Keywords from advertisers are matched to the web-site rankings to present the top web-sites.

Abstract: The present invention is directed to recording and providing media files based on a location. Such systems and methods maybe transacted by a client application or a processor in communication with one or more electronic devices. In accordance with some embodiments of the present invention, methods may include receiving from a first device: a media file; data comprising information identifying a location associated with the media file; storing the media file and data in a database; receiving from a second device information identifying a location of the second device; determining a geographic radius of the second device based upon user selection; determining if one or more media files stored in the database are associated with a location in the geographic radius of the second device; and sending the one or more media files to the second device.

Abstract: The present invention is directed to recording and providing media files based on a location. Such systems and methods maybe transacted by a client application or a processor in communication with one or more electronic devices. In accordance with some embodiments of the present invention, methods may include receiving from a first device: a media file; data comprising information identifying a location associated with the media file; storing the media file and data in a database; receiving from a second device information identifying a location of the second device; determining a geographic radius of the second device based upon user selection; determining if one or more media files stored in the database are associated with a location in the geographic radius of the second device; and sending the one or more media files to the second device.

Abstract: A search engine finds patents, patent applications and related documents and presents a selection of found documents in textual formats and/or graphical formats. After executing a search, the displayed information may include a selection of results sorted by inventor name, year and other variables found within patent documents. Financial data pertaining to patent owning entities is presented along with patent portfolio analysis and estimates of financial worth.

Abstract: System and methods for managing versions of partition maps in a distributed data store are disclosed. A relational database may use partition maps to indicate the location of data in a particular partition, or in a replica thereof. These partition maps may be versioned using a two-stage mechanism in which partition map updates are communicated to all nodes, or to affected nodes only, and in which operation may continue without waiting for acknowledgment of their application to each node. The system may handle minor partition changes differently than major partition changes. For example, if a replica of a partition is promoted to be a primary copy due to hardware or network failures, partition map changes may only be propagated to nodes in the same replica group. For major partition changes (e.g., splits, moves, mergers, added partitions, or size change), a new partition map may be made available to all nodes.

Abstract: Disclosed are methods and systems for downloading map data. A database of layers of map data is maintained. The map data may be representative of at least one map image of a geographic area. Each layer may provide progressively more detailed display information. Map data is downloaded to a client computer, and the may data may be sufficient to allow a user to navigate within a geographic area without requiring new map data to be downloaded.

Abstract: The present invention is directed to a method for forensic examination of data access of an information system. The invention allows a user to determine the occurrence and nature of data access. In particular, it allows the user to determine if data were copied. The invention does not require modification of the information system or data beforehand, and requires access to no artifact or evidence other than information system itself.

Abstract: The resent invention relates to a system for gathering and assembling information based on data received from one or several mobile terminals, the system comprising: one or several mobile terminals, and a central processing unit. The data at least relates to a position, environmental information and a tool used by a user of the mobile terminal for carrying out an activity and the central processing unit is configured to: process said data, assemble a unique information based on said data, said unique information comprising optimized data for carrying out said activity.

Abstract: A system and method are provided for real-time analysis of text. During a single sweep through the text, a detection tree is used to identify a sequence of characters in the text from a large dictionary of keywords. When a keyword is detected a rule tally database is updated. An intermediate score may be available during the sweep and a final score of the text may be available substantially immediately upon finishing the single sweep. A second text may be analyzed immediately using the same score buffer and rule tally database without updating the rule tally database.

Abstract: In one aspect, a method to backup a file includes reading a signature corresponding to a portion of a file stored in a first storage location using a read signature command, searching for the signature in a second storage location, saving the portion of the file as a pointer to the data with the same signature if signature exists and saving the data and the signature in the second storage location if the signature does not exist in the second storage.

Abstract: Creating message files in a publication subscription computer system by: (i) receiving data corresponding to a first message; (ii) receiving a list of subscribers that subscribe to a topic of the first message; and (iii) creating a digital data file that includes a payload data and a consumption metadata. The payload data includes content data corresponding to the first message. The consumption metadata includes data relating to whether one or more subscribers of the list of subscribers will potentially consume the first message at a later period in time from the time of receiving the content data corresponding to the first message.

Abstract: A data storage system protects virtual machines using block-level backup operations and restores the data at a file level. The system accesses the virtual machine file information from the file allocation table of the host system underlying the virtualization layer. A file index associates this virtual machine file information with the related protected blocks in a secondary storage device during the block-level backup. Using the file index, the system can identify the specific blocks in the secondary storage device associated with a selected restore file. As a result, file level granularity for restore operations is possible for virtual machine data protected by block-level backup operations without restoring more than the selected file blocks from the block-level backup data.