Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for compressing file maps. In one aspect, a method includes accessing a file maintained by a file system that manages access to a block device. The file includes a plurality of active blocks associated with a respective logical block number and a respective block index. The method also includes assigning a file index to the file, analyzing the file to determine a maximum block index and a minimum block index, and identifying runs of blocks in the plurality of active blocks. Each run of blocks includes a respective start block. For each of the runs of blocks, the method includes identifying a respective length. For each start block, the method includes generating a file map entry for each start block. The method also includes storing the file map entries in a file map.

Abstract: A category classification processing device includes a search unit that stores, as a search keyword log assembly, Q&A examples, which are actually referred to by a client, together with keywords; and a category extracting unit that obtains keyword storage frequencies expressing a number of times each of the keywords, which are recorded together with the Q&A examples in the search keyword logs, is stored for each of the Q&A examples, extracts, as category candidates of each of the Q&A examples, an m number of top keywords (m being a positive integer) in a descending order of the keyword storage frequency, uses the extracted category candidates as categories, and associates the categories with the Q&A examples.

Abstract: Techniques for information retrieval include the features of receiving a plurality of data records, updating a plurality of database records associated with the received plurality of data records stored in a database, receiving a query for a particular database record, and preparing for display, in response to the query, one or more of the database records based on at least one of the name of the business enterprise or the alias associated with the name of the business enterprise. Each data record includes data fields associated with a business enterprise. The data fields include a name of the business enterprise. Each database record includes attributes including the name of the business enterprise and an alias associated with the name of the business enterprise. The query includes at least one of the name of the business enterprise or the alias associated with the name of the business enterprise.

Abstract: A novel system, method and computer program product for accessing digital media files stored in a media storage device via a server device in communication with the media storage device. The method provides a Project Sharing feature for enabling collaborative sharing of Non Linear Editing (NLE) Projects, even though the NLE application might normally define and save Projects as a single monolithic project file. The system and method provides a file directory and symlink scheme that allows ALL editors who are “members” of a Project Space to see all the bins created by all other editors, but controlling the WRITE ACCESS to the bins according to whose “User Folder” the bins resided in, i.e., a user-based locking scheme is provided to allow control over who can and cannot write to a file. The system and method further treats a single monolithic project file as a collection of smaller Project files, the permissions and ownerships of which could each be controlled independently.

Abstract: Large files in a file system are mapped by extents of contiguous indirect blocks in order to reduce the time for read or write access to the large files while allowing allocation of data blocks one at a time. The inode of a file includes an indication of whether file mapping metadata of the file includes either an extent of contiguous indirect blocks or a tree of blocks. In a preferred mapping scheme, an inode contains an array of block pointer entries, and each entry includes a flag indicating whether the block pointer is pointing to either an extent of indirect blocks or a tree of blocks. For sharing of data blocks between files, the block pointer fields of the indirect blocks each contain an ownership flag indicating whether the pointed-to block is shared or not.

Abstract: A query results preview generation method and system that receives a preliminary query while a query for a search is being constructed, determines a distribution of result items that would be retrieved if the search were executed using the preliminary query, among a new result category including new result items and a previous result category including result items previously retrieved in a session, generates the query results preview using the distribution of result items that would be retrieved if the search were executed using the preliminary query, and provides the query results preview while the query for the search is being constructed and prior to execution of the search using the query.

Abstract: A search condition acquisition section acquires search conditions associated with a plurality of elements having a hierarchical structure. A search processing execution section executes search processing for identifying, as search results, pieces of search target data associated with respectively corresponding elements in all the tiers that correspond to the elements included in the search condition. An information output section outputs search result information under the condition that the number of pieces of identified search target data is equal to or larger than a predetermined number N. Under the condition that the number of pieces of identified search target data is not equal to or larger than the predetermined number N, the search processing execution section executes the search processing on elements in all the tiers associated with the search condition changed so as to cancel the association with the element in a lowermost tier.

Abstract: A method for selectively utilizing a plurality of disparate solid state storage locations is disclosed. The technology initially receives class types for a plurality of disparate solid state storage locations. The characteristics of the received data are determined. The received data is then allocated to one of the plurality of disparate solid state storage locations based upon the determined characteristics of the received data.

Abstract: A system in which a file system may operate on a volume in which the logical address extent of the volume is divided into multiple tiers, each tier providing storage having a distinct trait set by mapping the logical addresses of the volume to appropriate underlying storage systems. A volume system exposes the volume to the file system in a manner that the file system itself has awareness of the tiers, and is aware of the trait sets of each tier. The file system may thus store file system namespaces (such as directories and files) into the tiers as appropriate for the file system namespace. A provisioning system may also be provided and be configured to provision the volume to include such tiers, and if desired, to extend the tiers.

Abstract: The method includes generating, by one or more computer processors, a first piece of data based on a defined set of data characteristics. The method further includes generating a first bit, wherein the first bit corresponds to the first generated piece of data. The method further includes sending the first generated piece of data to a target location. The method further includes receiving the first generated piece of data from the target location. The method further includes determining whether to validate the first generated piece of data received from the target location. The method further includes adjusting the first generated bit based on the determination of whether to validate the first generated piece of data.

Abstract: Techniques for fast provisioning of virtual machine images using deduplication metadata are described, including receiving a request to copy a first virtual machine to form a second virtual machine, identifying a first portion of memory comprising data for the first virtual machine; and forming the second virtual machine based on the first portion of memory comprising data for the first virtual machine, wherein forming the second virtual machine further comprises linking the second virtual machine to the first portion of memory comprising data for the first virtual machine, and implementing a second portion of memory to store data for the second virtual machine independent of the first virtual machine.

Abstract: Mechanisms are provided for representing white space in a graphical representation of a data model. These mechanisms involve analyzing output data that is to be output to a user via an output device, to identify white spaces in the output data. White spaces comprise portions of a range of metrics of output data values where the output data does not have data objects representing those portions of the range of metrics of output data. For each identified white space, a white space data object is created. The white space data objects are provided to an application which performs an operation on the white space data objects to output the white space data objects in a manner that identifies the white space data objects differently from non-white space data objects in the output data.

Abstract: A system and method are provided for determining a nearest network resource using GPS coordinates. A GPS enabled computer device may obtain its location by requesting its GPS location. A list of network servers storing the desired data may be obtained by the computer system and the distance between each of the servers and the computer device may be calculated. The system then connects to the resource having the shortest distance without requiring a user to know and decide which server is closest to their location.

Abstract: A system, method, and computer program product are provided for presenting entity-related events using radially divided concentric circles. In use, a plurality of events associated with at least one entity is stored. Additionally, a set of the events is retrieved according to a preconfigured time period. Further, each of the events in the set is categorized according to a plurality of predefined categories. Still yet, a plurality of concentric circles each segmented by a radial axis centered on the concentric circles is displayed, where each segment is associated with a different one of the predefined categories and each concentric circle is associated with a different portion of the preconfigured time period. Moreover, each of the events in the set is presented in one of the segments of one of the concentric circles, based on the categorization.

Abstract: An Image Based Document Management (IBDM) server includes a table generator, a symbolic representation module and a sort engine. The table generator generates a table from the form images, the table comprising cells with data types including image data, symbolic data, image and symbolic data and an empty value, and updates the table. The symbolic representation module converts at least one of the cells with image data to symbolic data. The sort engine determines, from a sort request for a column of the table received from a user, at least a first priority for a first data type, the column including at least two of the data types, determines from the sort request a second priority within one of the data types, and sorts the column according to the sort request.

Abstract: A method for detecting similar documents includes extracting an entity from each of a first web document and a second web document; determining an importance contribution element corresponding to each of the web documents; calculating, using the processor, weights for each entity based on the determined importance contribution elements; and determining whether the web documents are similar documents based on the calculated weights. A device to detect similar documents includes a storage device; an entity extractor stored on the storage device and configured to extract an entity from a first web document and a second web document and to determine an importance contribution element from each of the web documents; a weight calculator configured to calculate weights of each entity based on the determined importance contribution elements; and a similar document detection unit configured to determine whether the web documents are similar documents based on the calculated weights.

Abstract: Systems and methods for identifying a representative image for any given search query are provided. In response to a search for a query term (or terms), the system accesses an inverted index to identify images associated with that term. The system then receives a ranked list of images. The ranked list includes image identifiers, and once an item in the list is selected the system can use the associated image identifier to retrieve the image from a server. If an editor has overridden the default image for the present search query, then the system returns the image identifier for the overridden image, which can be used to access the image from the server. Thus, the representative image system provides a reliable and universal mechanism for retrieving representative images for any given topic dynamically in real time.

Abstract: Methods and apparatus are disclosed to provide continuous, automated database-table partitioning and database-schema evolution. In one example, the disclosed methods and apparatus for automatically partitioning a logical table include monitoring a database operation to detect a partition-invoking event associated with the logical table, wherein the monitoring of the database operation is initiated in response to a table creation command that includes a partition-by constraint specifying a column of the logical table or of a different table, and, when a partition-invoking event occurs and is detected by the monitoring of the database operation, creating the next partition for the logical table and storing the next partition in a computer-readable medium.

Abstract: In one aspect, a method to synchronize volumes includes comparing a first root hash of a root hash node in a first hash tree of a first volume with a second root hash of a second root hash node in a second hash tree of a second volume, for each child node of the first root hash node, comparing a hash of the child node with a hash of a corresponding node in the second hash tree if the first root hash and the second hash are not the same, for each hash in the first hash tree that does not match the corresponding hash in the second hash tree, determining if its node is a leaf node and copying the corresponding data block of the first volume to the corresponding data block of the second volume if a node is determined to be a leaf node.

Abstract: Managing changes to a collection of records includes storing a first set of records in a data storage system, the first set of records representing a first version of the collection of records, and validating a proposed change to the collection of records specified by an input received over a user interface. The data storage system is queried based on validation criteria associated with the proposed change, and a first result is received in response to the querying. A second set of records is processed representing changes not yet applied to the collection of records to generate a second result. The first result is updated based on the second result to generate a third result. The third result is processed to determine whether the proposed change is valid according to the validation criteria.