A technique for accessing a subject multi-dimensional database stored on a data store connected to the computer. An index is created for the subject multi-dimensional database, wherein the index includes another multi-dimensional database having dimensions of the subject multi-dimensional database and an additional ranking dimension. Then, the subject multi-dimensional database is accessed using the index.
CROSS-REFERENCE TO RELATED APPLICATION
This application is related to the following co-pending and commonly-assigned patent application:
Application Ser. No. 09/565,132, entitled "NAVIGATING AN INDEX TO ACCESS A SUBJECT MULTI-DIMENSIONAL DATABASE," filed on same date herewith, by William E. Malloy, et al., which is incorporated by reference herein.
It is an object of the present invention to provide encryption and decryption apparatuses capable of selecting a part of file portions handled on a computer, and encrypting and decrypting only the thus selected part of file portions. The encryption apparatus 200 and the decryption apparatus 300 can encrypt and decrypt all of item data elements in item data portions in specified association with a specific item name portion of the database 400 while maintaining reciprocal relationships among the item data portions in the database 400 regardless of whether item data elements in the item data portions are encrypted or not. This leads to the fact that major features of the database such as data search and data alignment functions remain enabled even if item data elements in item data portions of the database are encrypted.
A method for determining a with-distance relationship between a first geometry object and a second geometry object. The method includes defining an exterior approximation of the first geometry and the second geometry. A distance between the exterior approximations is computed. The computed distance is compared with a first predetermined distance to determine whether the second geometry satisfies a first filter condition with respect to the first geometry.
Customizable data diagrams are provided by a data diagram software facility. The facility receives a reference to a multidimensional data set on which to base an initial data diagram. Based, at least in part, on this information, the facility generates a data diagram providing a graphical representation of nodes corresponding to data from the multidimensional data set. The facility displays the data diagram, which can be modified by a user. For example, the facility may provide tools that allow the user to change the order of the nodes of the data diagram, change the shape of the nodes of the data diagram, change the color or format of the nodes of the data diagram, etc. The facility may also provide functionality that allows the user to drill down on aspects of the data diagram based on a breakdown scheme.
A computer system may include a display and a user interface selection device. The computer system may display a first set of data associated with a first index of a data store in a first frame, and may receive a first selection signal indicative of the user interface selection device selecting a first item of the first set of data. In response to the first selection signal, the computer system may retrieve a second set of data from the data store associated with a second index of the data store, the second set of data being associated with the first item. The computer system may display the second set of data in a second frame distinct from the first frame.
Systems, methods, and computer products that improve the techniques used to search multidimensional databases over techniques of the past. The preferred embodiment of the present invention advantageously improves the technique of determining a grid index that is used to locate a geometric shape in a spatial database. More particularly, the preferred embodiment of the present invention improves the technique of sampling data for defining the grid cell size in a grid for a given data set, thereby improving the grid indexing process that locates a particular minimum-bounding rectangle and the associated geometric shape.
