E.J. Otoo. A mapping function for the directory of a multidimensional extendible hashing. In Proc. of the 10th VLDB Conference, pages 493--506, Singapore, 1984.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....as the quadtree and the octree are extensively used [31] To reduce the number of disk accesses in a secondary storage environment, dynamic order preserving data structures based on extendible hashing or linear hashing have been introduced. Lomet [23] Tamminen [35] Nievergelt et al. 25] Otoo [27, 28], Whang and Khrishnamurthy [37] Freeston [14] and Seeger and Kriegel [33] describe data structures based on extendible hashing. Kriegel and Seeger [20] and Hut esz et al. 16] describe data structures based on linear hashing. All of the data structures mentioned above have been designed for a ....

E.J. Otoo. A mapping function for the directory of a multidimensional extendible hashing. Proc of the 10th Int. Conf. on Very Large Databases, 491-506, 1984.

....as the quadtree and the octree are extensively used [30] To reduce the number of disk accesses in a secondary storage environment, dynamic order preserving data structures based on extendible hashing or linear hashing have been introduced. Lomet [22] Tamminen [33] Nievergelt et al. 24] Otoo [26, 27], Whang and Khrishnamurthy [35] Freeston [13] and Seeger and Kriegel [31] describe data structures based on extendible hashing. Kriegel and Seeger [19] and Hutflesz et al. 15] describe data structures based on linear hashing. All of the data structures mentioned above have been designed for a ....

E.J. Otoo. A mapping function for the directory of a multidimensional extendible hashing. Proc of the 10th Int. Conf. on Very Large Databases, 491--506, 1984.

....in multi level signature files [CS89] and one of its important variants, the S tree [Dep86] The S tree is based on the R tree [Gut84] Besides tree based index structures for partial match retrieval hash based index structures exist. Otoo proposed a hash index for partial match retrieval in [Oto84]. However, signatures are not yet used. Later, the partitioned signature file combined hash indexes with superimposed coding for partial match retrieval of text documents [LL89] Quickfilter [RZ90, ZRT91, CZ93] is a variant of the partitioned signature file using linear hashing [Lit80] The ....

E.J. Otoo. A mapping function for the directory of a multidimensional extendible hashing. In Proc. of the 10th VLDB Conference, pages 493--506, Singapore, 1984.

....distributed data. So do many multidimensional order preserving hashing structures, for example MOLPHE[8] PLOPHashing [9] and [5] The basic principle of these structures it that they map keys of several dimensions into one dimension first, using for example z ordering or similar algorithms[8][18], and applying an order preserving hashing algorithm [23] 19] afterwards. Balanced quad tree like structures (overview in [21] were developed to solve this problem. However, much of the real world data is clustered in a few spatial areas. The dense regions data will, when inserted, be pushed ....

Ekow J. Otoo. A Mapping Function for the Directory of a Multidimensional Extendible Hashing. In Tenth International Conference on Very Large Data Bases, pages 493--506, Singapore, 1984.

....data or lower level directory page have to be identified to obtain the estimation. This would be a cumbersome and costly process. Figure 2 compares the splitting strategy of the MLGF with those of other file organizations: the Grid File [Nie84] and the Multidimensional Extendible Hashing (MEH) [Oto84]. A (a) Initial Status. b) MLGF. c) Grid File. d) MEH. C D Figure 2. Region splitting strategies. Figure 2 a represents the state of domain space partition at a time region A is to split. Figure 2 b shows the partition that the MLGF generates after splitting region A locally. Figure 2 c shows ....

Otoo, E. J., "A Mapping Function for the Directory of a Multidimensional Extendible Hashing," In Proc. 10th Intl. Conf. Very Large Data Bases, Singapore, pp.493-506, Aug. 1984.

....accesses[2, 7] Recently, various multidimensional file organizations have been proposed. Typical examples of such structures include the K D tree[1, 2] K DB tree[19] 4D tree[20] LSD tree[8] hB tree[14] MD tree[15] multidimensional linear hashing[18] multidimensional extendible hashing[17], grid file[16] BANG file[6] and multilevel grid file[25] The record clustering method stores the records that are frequently accessed together on the same page so that the total number of pages accessed in response to a set of queries is minimized[27] If the records are frequently accessed by ....

....by choosing a splitting strategy. The physical database design method for multidimensional file organizations proposed in this paper takes advantage of these features of region oriented splitting. Many of the file organizations that use region oriented splitting employ hashing for organizing files[6, 18, 17, 25]. In these cases, we call a set of hash values from which an attribute value can be drawn a hash domain. We define the hash domain space as the Cartesian product of the hash domains of all the organizing attributes. We call any subset of the hash domain space a hash region. In this paper, we use ....

Otoo, E. J., "A Mapping Function for the Directory of a Multidimensional Extendible Hashing," In Proc. Intl. Conf. on Very Large Data Bases, pp. 493-- 506, 1984.

....constrained to be always cubical at each 4 expansion step. Similar storage efficient realizations for arrays with restricted pattern of growth have been demonstrated by our earlier works on storing extendible arrays whose range of subscript values can be extended either linearly or exponentially [16, 14]. Ouksel and Scheuermann [17] presented a method of representing cubical arrays that have linear expansions, such that an n element array is represented in n locations. The mapping function however, is computable in O(log n) and is dependent on the size of the array. In [19] the question was asked ....

Ekow. J. Otoo. A mapping function for the directory of a multidimensional extendible hashing. In Proc. of the 10th Int'l Conference on Very Large Data Bases, pages 493 -- 506, Singapore, August 1984.

No context found.

E.J. Otoo. A mapping function for the directory of a multidimensional extendible hashing. In Proc. of the 10th VLDB Conference, pages 493--506, Singapore, 1984.

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