Abstract: Every presence has needs. A need could be consumer electronics, loans, autos, or knowledge, etc. The presence uses search engines to become knowledgeable about the need. The current search engines are not intelligent. The idea of the invention is to provide more accurate results and semantically linked results through an intelligent index. The invention uses results from known, semantic and unknown indexes with Guiding Information to return the most relevant results to the users.

Abstract: A network based system for archiving digital assets based on keywords associated with the digital assets is provided. In general, digital assets residing at a client node are each tagged with one or more keywords. One or more of the keywords are then identified as archiving keywords, thereby creating a list of archiving keywords. The list of archiving keywords is provided from the client node to a central node. The central node then provides a request to the client node for the digital assets tagged with the keywords in the list of archiving keywords. In response, the client node uploads the digital assets tagged with the keywords in the list of archiving keywords to the central node.

Abstract: Described is a mechanism for exposing a volume shadow copy of a shared volume over a network to a remote client. A shared volume is accessed at a client computing system having a root. A volume shadow copy (or “snapshot”) of the volume is identified as a child resource of the shared volume. The child resource representing the snapshot may be hidden from ordinary view by default. To access the snapshot, a user may access the child resource as if it were an ordinary file or directory on the shared volume. Advantageously, the user need not mount a new volume representing the snapshot volume, but rather the user may directly access the snapshot.

Abstract: The present invention leverages MOLAP performance for ROLAP objects (dimensions, partitions and aggregations) by building, in a background process, a MOLAP equivalent of that object. When the background processing completes, queries are switched from ROLAP queries to MOLAP queries. When changes occur to relevant relational objects (such as tables that define content of OLAP objects), an OLAP object is switched back to a ROLAP mode, and all relevant caches are dropped while, as a background process, a new MOLAP equivalent is created.

Abstract: The present invention leverages MOLAP performance for ROLAP objects (dimensions, partitions and aggregations) by building, in a background process, a MOLAP equivalent of that object. When the background processing completes, queries are switched from ROLAP queries to MOLAP queries. When changes occur to relevant relational objects (such as tables that define content of OLAP objects), an OLAP object is switched back to a ROLAP mode, and all relevant caches are dropped while, as a background process, a new MOLAP equivalent is created.

Abstract: Provided is a map editing-and-displaying system that acquires partial map data from a database that contains map data. The partial map data includes appended index data. The system automatically assigns a map name to the partial map data based on the appended index data. A user can then identify and select the map according to the assigned map name.

Abstract: An interface may be provided that enables the user to select a parent list, to view a set of available child lists corresponding to the selected parent list, and to select a particular child list from the set of available child lists. The set of available child lists may be automatically compiled in response to the selection of the parent list. Another interface may be provided that enables the user to select a particular portion of the parent list for which to view corresponding child data. The corresponding child data may be automatically identified and displayed in a running application.

Abstract: A process determines for a search string which, if any, of the strings in a text list have edit distance from the search string less than a threshold. The process uses dynamic programming on a grid with search string characters corresponding to rows and text characters corresponding to columns. For each text string, computation proceeds by columns. If successive text strings share a prefix, then the columns corresponding to the prefix are re-used. If the minimum value in a column is at least the threshold, then the prefix corresponding to that and previous columns causes edit distance to be at least the threshold. So the computation for the present text is abandoned, and computations for any other texts that share the prefix are avoided.

Abstract: A system for maintaining an address book, wherein the address book includes a plurality of entries with each entry containing contact information and wherein address book updates are transmitted over a wireless network. The system includes a gateway for storing the address book and transmitting the address book updates to a wireless device.

Abstract: A method for use with an information retrieval system, in which the method is used for transforming a database statement containing a first subquery and a second subquery joined together, the first subquery including a group by operation over a child subquery, the method comprising removing the first subquery from the database statement thereby removing the join between the first subquery and the second subquery.

Abstract: A NAS system including a NAS controller which processes file level input/output requests and controls the NAS system, and a storage apparatus having a controller which controls a storage device upon which plural volumes for storing data are represented. In the invention when at least a portion of data of a file stored on a volume is updated, the updated data is stored to an unused area of the volume, information is stored on the volume indicating that the updated data corresponding to original data stored in an original area is stored in the unused area so that subsequent accesses to the original of the updated data is directed to the updated data stored in the unused area, and the original of the updated data is retained in the original area, thereby implementing long term data archiving of the original of the updated data.

Abstract: Methods and apparatus, including computer systems and program products, for executing a query on a subset of data, for example, to facilitate a fast search with a very large result set. In one general aspect, a method of executing a query includes receiving a query for execution on data in the data repository; generating an estimate of a number of results of the query; defining a subset of data in the data repository; determining whether to execute the query on the subset of the data; executing the query on the subset of the data to generate a partial set of results if the query is to be executed on the subset of the data, otherwise executing the query on the data repository to generate a complete set of results; and providing query results.

Abstract: A database system and method for organizing data elements according to a Hilbert curve, said data elements being representable by a plurality of coordinates, said database system comprising: first means for generating a plurality of bitblocks by bitwise interleaving the coordinates of the data elements; second means for applying a fliprot transformation to a first bitblock; said fliprot transformation comprising a flip transformation and a rot transformation, said flip transformation inverting bits of said bitblock, said rot transformation interchanging bits of said bitblock; third means for obtaining, for each further bitblock, a fliprot transformation by a concatenation of two or more fliprot transformations; and fourth means for applying fliprot transformations to their corresponding bitblock; whereby the bitblock bits determine the organization of said data elements according to said Hilbert curve.