Seeger, B. and Kriegel, H.-P., "The Buddy-Tree: An E#cient and Robust Access Method for Spatial Data Base Systems," In Proc. 6th Int'l Conf. on Very Large Data Bases, pp. 590--601, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....bu#er replacement policy, Naive Aggregation uses the CLOCK policy. We use the MLGF for the experiments here, but our methodology is applicable to other kinds of DIP multidimensional files. Multidimensionl files that obey the two rules in Lemma 1 can be DIP multidimensional files. The buddy tree [19], the quad tree [18] and the grid file [16] are examples. On the other hand, some cannot be made DIP multidimensional files. The R # tree [3] is an example. 2) DIP Aggregation This algorithm uses the same aggregation windows as those of the One Pass Aggregation algorithm. But, it traverses the ....

Seeger, B. and Kriegel, H.-P., "The Buddy-Tree: An E#cient and Robust Access Method for Spatial Data Base Systems," In Proc. 6th Int'l Conf. on Very Large Data Bases, pp. 590--601, 1990.

....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 secondary storage environment, but similar structures have also been ....

B. Seeger, H.P. Kriegel. The buddy-tree: an ecient and robust access method for spatial database systems. Proc of the 16th Int. Conf. on Very Large Databases, 590-601, 1990.

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