Abstract: A method, article of manufacture, and apparatus for recovering databases. In some embodiments, this includes switching an active segment to a resynchronization mode, receiving a change tracking log, determining a data block based on the change tracking log, and resynchronizing the determined data block with a non-active segment. In some embodiments, writes performed on the active segment are synchronized with the non-active segment.

Abstract: Using a KVS transaction processing mechanism, four lock states are managed. When a local transaction refers to and updates a map entry, the local transaction is graded up to a global transaction. Start processing as the global transaction is first performed to determine a transaction ID. A committed value, a value being updated, and a transaction ID being updated are then inserted into all map entries for which LX locks are being acquired at present. Another local transaction is then started for all map entries for which S locks are being acquired at present to acquire S locks. Next, the original local transaction is committed. As a result, the LX locks acquired are graded up to GX locks. After the termination of the global transaction as the waiting target, acquisition of S locks (GX locks) is tried as a global transaction.

Abstract: A system and method are provided for determining object access to a resource by comparing reference inputs from an object profile, an object selection profile, an environmental status, and/or a complex outcome to one or more resource profile reference conditions contained in one or more resource profiles. The object profile reference input comparison to the resource profile reference conditions is based on a plurality of object profile categories each including a plurality of hierarchically linked object profile values. The object profile represents no more than one object profile value for each object profile category. The object selection profile reference input comparison to the resource profile reference conditions is based on a plurality of object selection profile categories each including a plurality of hierarchically linked object selection profile values. The object selection profile includes one or more object selection profile values for a particular object selection profile category.

Abstract: A variety of query optimization techniques are described herein. A first query optimization technique, referred to herein as non-empty transformation, may be applied to queries that specify one or more measures, a dimensional context within which the measure(s) are to be evaluated, and a filter condition specifying that rows with only empty measure values be excluded from a result set. The non-empty transformation technique enables such queries to be rewritten into another format that can be executed more efficiently than the original queries. A second query optimization technique described herein involves restructuring an operator tree representation of a query so as to avoid unnecessary duplicated evaluation of extension columns. A third query optimization technique described herein automatically selects a minimum number of join columns having the lowest cardinality for implementing a join between two tables.

Abstract: In a method for accessing files in an electronic device, a Random Access Memory (RAM) disk is set-up to store the file system root of the electronic device. At least one file system to be mounted is discovered in the electronic device. Mount points are established on the RAM disk for each file system. Drive identifiers are assigned for each file system. A file access request comprising a first file name path comprising a drive identifier is detected. The drive identifier is mapped to a mount point and a second file name path based on the mount point and the first file name path is formed. Thereupon, a file is accessed using the second file name path in the electronic device.

Abstract: A system and method for transparently compressing file system data using compression group descriptors is provided. When data contained within a compression group be compressed beyond a predefined threshold value, a compression group descriptor is included in the compression group that signifies that the data for the group of level 0 blocks is compressed into a lesser number of physical data blocks. When performing a read operation, the file system first determines the appropriate compression group that contains the desired data and determines whether the compression group has been compressed. If so, the file system decompresses the data in the compression group before returning the decompressed data. If the magic value is not the first pointer position, then the data within the compression group was previously stored in an uncompressed format, and the data may be returned without performing a decompression operation.

Abstract: A method of summarizing data files includes implementing, at a server, a storage event for a data file, analyzing the data file and creating a summary of the data file, and storing the summary linked to the data file.

Abstract: A new approach is proposed that contemplates systems and methods to determine temporality of a query in order to generate a search result including a list of objects that are not only based on matching of the objects to the query but also based on temporality analysis of the query. Here, the temporality of the query can be defined as the distribution over time of the objects matching the query, i.e., the chronology histogram of the query. Such distribution can be analyzed to provide a classification of the intent of the query. Classification of the intent of the query can result either in discrete classification of the query into categories, or in continuous classification of the query which may be a scalar or vector value resulting from transformations of the chronology histogram.

Abstract: Many software applications allow users to consume and interact with a variety of data, such as files, photos, web pages, emails, and/or other content. Because the amount of content may be cumbersome to sift through, software applications may provide filtering and searching capabilities to aid users in finding desired content. However, the trial and error involved in current searching techniques may be time consuming and/or diminish the user's experience. Accordingly, one or more systems and/or techniques for presenting visual previews of search results are disclosed herein. In particular, a user may reference an identifier (e.g., “Bill”) that may be used as search criteria to retrieve corresponding objects (e.g., photos of Bill). A visual preview of the retrieved objects may be presented to the user. The user may quickly view visual previews of search results by referencing various identifiers without committing to a particular search result set.

Abstract: A dataset structure that is suitable for transferring data between service components may include a table having one or more rows and a plurality of columns. The table may be defined by a schema for an entity type. The schema may include a corresponding column definition for each column. Each of the rows may store a tuple of information that conforms to the entity type defined by the schema. A data transfer component may use the dataset structure to transfer data between the service components.

Abstract: A system and method by which users via programs on one computer may seamlessly access files remotely stored on other computers that run a well known file access protocol. An operating system extension and an application level network access program are provided. The operating system extension receives file system requests for remote files from the operating system that were issued according to a well known application program interface. The operating system extension forwards the remote file system request to the network access program. The network access program reformats the request according to a well known application level network protocol extension and sends it over a network to a remote computer system.

Abstract: A communication device and method of controlling an operation of a communication device are provided, by which an application can be efficiently selected according to location information. The communication device includes a wireless communication unit for determining a location using received information, a controller for generating location information based on the determined location and searching for an application corresponding to the location information, and a display for displaying an indicator of the searched application.

Abstract: Methods and systems for digital asset management are described. Some embodiments provide methods and systems for: (1) a high-performance database system for storing assets and the associated metadata, (2) computing an inverse delta between two files without generating any intermediate files or deltas, (3) uniquely identifying a digital asset and storing the digital asset's namespace change history in a version control system, (4) inferring dependencies amongst namespace changes, (5) a workflow management tool that is tightly integrated with a version control system, (6) publishing milestones in a project which can consistently maintain the namespace uniqueness invariant, and/or (7) implicitly versioning data and/or files that are associated with certain types of digital assets in a version control system.

Abstract: A method and system is provided for reducing delay to applications connected to a database server that guarantees no data loss during failure or disaster. After storing a log record persistently in a local primary log, the log writer returns control to the application which continues running concurrently with the database server sending the session's log records to a standby database. A separate back channel is used by the standby to communicate, out-of-band to the primary, the location of the last log record stored persistently to the standby log. An application waiting for a transaction to commit may wait until the transaction's commit record has been persisted. Also described is a technique for reducing application delay when there is contention between nodes of a multi-node cluster for updating the same block. The technique provides for an asynchronous ping protocol that guarantees zero data loss during failure or disaster.

Abstract: Systems and methods, including computer software products, for updating data on a remote device involve defining multiple channels on a remote device, where each channel is associated with a predetermined type of content. Content updates for the channels are automatically delivered to the remote device, and an update frequency is identified for each channel. A most frequent update frequency among the multiple channels defined on the remote device is determined, and updates to the channels are requested according to the most frequent update frequency.

Abstract: An apparatus for use in managing information content in a network-based communication system. The apparatus includes a processing element that includes a processor managed and operated by an operation system (OS) software and coupled to a memory. The processing element executes a first application to call a second application for permitting the user to enter a plurality of defining terms for the second application to apply the defining terms as search filters for searching and retrieving uniform resource locators for linking to contents relevant to the defining terms entered by the user. The second application further determines whether to call the OS depending on the search filters generated from the defining terms.

Abstract: A plurality of original files represent underlying original bits of data from which a key is created in a multi-dimensional mapping space for a relevancy topic. If new data is sufficiently close to this relevancy topic key, it is related to the topic and presented to users. Various closeness measures are defined as are methods for key creation. Still other features contemplate computing arrangements and program products.

Abstract: Requests for resources can be throttled based on relative allocations, whereby the actual usage of a client or sub-client over time can be monitored in order to make intelligent throttling decisions. A centralized throttling service can maintain throttling information according to a hierarchical allocation tree, and can determine whether to throttle a request based at least in part whether any tokens, or available resource units, are available for a class or node of the tree corresponding to the request. In some cases, an empty token bucket for a node can borrow tokens from a parent node, in order to allow a user to exceed an allocation when the capacity of the system allows for such usage. When a user has been exceeding an allocation or otherwise inappropriately taxing various resources, the system can prevent that user from borrowing tokens for at least a specified period of time.

Abstract: A data item is retrieved from a data store in a data processing system. The data processing system comprises an index, which at least partially indexes the data store, and also a partiality definition store. The partiality definition store indicates a part of the data store which is referenced by the partial index. A request is received for a data item from the data store and responsive to determining that the requested data item is not referenced by the partial index, the data store is searched by using the partiality definition store to avoid searching a part of the data store which is known to be indexed.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for rule-based performance of actions on related objects. These mechanisms and methods for rule-based performance of actions on related objects can provide a generalized technique for configuring related object actions that are responsive to object updates. The ability to provide this generalized technique can enable actions to be automatically performed on objects in response to updates to related objects, in a rule-based manner.