Blanken, H., A. Ijbema, P. Meek, and B. van den Akker (1990). The generalized grid file: Description and performance aspects. In Proc. 6th IEEE Int. Conf. on Data Eng., pp. 380--388.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....until Section 4.2. 4.1. 1 The Grid File (Nievergelt, Hinterberger, and Sevcik 1981) As a typical representative for an access method based on hashing, we will first discuss the grid file and some of its variants (Hinrichs 1985; Ouksel 1985; Whang and Krishnamurthy 1985; Six and Widmayer 1988; Blanken et al. 1990). The grid file 23 superimposes a d dimensional orthogonal grid on the universe. Because the grid is not necessarily regular, the resulting cells may be of different shapes and sizes. A grid directory associates one or more of these cells with data buckets, which are stored on one disk page ....

Blanken, H., A. Ijbema, P. Meek, and B. van den Akker (1990). The generalized grid file: Description and performance aspects. In Proc. 6th IEEE Int. Conf. on Data Eng., pp. 380--388.

....data access methods have been proposed to retrieve objects which are n dimensional points or solids. The spatial access methods optimize queries to retrieve all points or solids enclosed in or overlapping with a given search region. The proposed access methods include R tree [5, 6] Grid Files [7 11] , and other search trees [12, 13, 13 17] However, these access methods were designed with the assumption of static world with no moving objects. The update rates were assumed to be much smaller than the search query rate. The object shape, size and location distributions are assumed to be random ....

....different cell sizes. The objects located in a grid cell are stored together to preserve the geographic proximity relationship. The grid itself serves as the directory of the access method, storing pointers to the disk blocks containing object addresses. Grid Files [10 Generalized Grid Files [7] Balanced and Nested Grid Files[8] and Grid Files without directory structure [20] utilize the idea of grids. The grid File was designed to handle efficiently a collection of records with a modest number of search attributes whose domains are large and linearly ordered[10] It is based on the ....

H. Blanken, A. Ubema, P. Meek, and B. van den Akker, The Generalized Grid File: Description and Performance Aspects, 6th International Conference on Data Engineering, (1990.).

....below will give the reader an idea about the multidimensional access methods functionality. 3.1 Hashing access methods 3.1. 1 The Grid file and its variants As a typical representative for an access method based on hashing, we will first discuss is the grid file and some of its variants [Hinr85, Ouks85, Whan85, Sixw88, Blan90]. The grid file is a variation of the grid method, which relaxes the requirement that cell division lines should be equidistant. Its goal is to retrieve records by at most two disk accesses and to efficiently handle range queries. This is done by using a grid directory consisting of grid blocks ....

Blanken, H., A. Ijbema, P. Meek, and B van den Akker, "The generalized grid file: Description and performance aspects," In Proceeding of 6 th IEEE International Conference on Data Engineering, pp. 380-388, 1990

....tree, a hybrid method. 4.1. 1 The Grid File (Nievergelt, Hinterberger, and Sevcik 1984) As a typical representative for an access method based on hashing, we will first discuss the grid file and some of its variants (Hinrichs 1985; Ouksel 1985; Whang and Krishnamurthy 1985; Six and Widmayer 1988; Blanken et al. 1990). The grid file superimposes a d dimensional orthogonal grid on the universe. Because the grid is not necessarily regular, the resulting cells may be of different shapes and sizes. A grid directory associates one or more of these cells with data buckets, which are stored on one disk page each. ....

Blanken, H., A. Ijbema, P. Meek, and B. van den Akker (1990). The generalized grid file: Description and performance aspects. In Proc. 6th IEEE Int. Conf. on Data Eng., pp. 380--388.

....base management systems to store and retrieve spatial data efficiently. Typical queries supported are point queries and region queries. Fast insertion, deletion, and modification of data is also facilitated. Commonly used data structures to accomplish this are the R tree [13] and the Grid file [3]. In our project, comparison of spatial arrangements is not done in terms of absolute positions of the features but in terms of their relative positions. As mentioned in Section 2, icon based systems use 2D strings [6] to describe the relative position of elements from left to right and from ....

H. Blanken, A. Ijebma, P. Meek, and B. van den Akker. The generalized grid file: Description and performance aspects.

....until Section 4.2. 4.1. 1 The Grid File (Nievergelt, Hinterberger, and Sevcik 1981) As a typical representative for an access method based on hashing, we will first discuss the grid file and some of its variants (Hinrichs 1985; Ouksel 1985; Whang and Krishnamurthy 1985; Six and Widmayer 1988; Blanken et al. 1990). The grid file superimposes a d dimensional orthogonal grid on the universe. Because the grid is not necessarily regular, the resulting cells may be of different shapes and sizes. A grid directory associates one or more of these cells with data buckets, which are stored on one disk page each. ....

Blanken, H., A. Ijbema, P. Meek, and B. van den Akker (1990). The generalized grid file: Description and performance aspects. In Proc. 6th IEEE Int. Conf. on Data Eng., pp. 380--388.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC