Twin grid files: A performance evaluation
Data structures for the physical organization of multidimensional points on secondary storage usually suffer from a fairly low average storage space utilization, even for independently and uniformly distributed points. We evaluate the performance of two types of space optimizing access schemes, the optimal static and the suboptimal dynamic twin grid files. It turns out that in comparison with the (standard) grid file, twin grid files achieve considerable savings in storage space, without losing efficiency in any other relevant aspect. This is shown to hold for typical operations in a variety of practical situations. To better grasp the inherent power of twin grid files, variations of crucial parameter settings are studied in detail.
Unable to display preview. Download preview PDF.
- 1.M. Freeston: The BANG file: a new kind of grid file, Proc. ACM SIGMOD International Conference on Management of Data, 1987, 260–269.Google Scholar
- 2.K.H. Hinrichs: The grid file system: implementation and case studies of applications, Doctoral Thesis No. 7734, ETH Zürich, 1985.Google Scholar
- 3.A. Hutflesz, H.-W. Six, P. Widmayer: Globally Order Preserving Multidimensional Linear Hashing, Proc. IEEE 4th International Conference on Data Engineering, 1988, 572–579.Google Scholar
- 4.A. Hutflesz, H.-W. Six, P. Widmayer: The Twin Grid File: A Nearly Space Optimal Index Structure, Proc. International Conference Extending Database Technology, 1988, 352–363.Google Scholar
- 5.A. Hutflesz, H.-W. Six, P. Widmayer: Twin Grid Files: Space Optimizing Access Schemes, Proc. ACM SIGMOD International Conference on Management of Data, 1988.Google Scholar
- 6.H.-P. Kriegel, B. Seeger: Multidimensional Order Perserving Linear Hashing with Partial Expansions, Proc. International Conference on Database Theory, 1986, 203–220.Google Scholar
- 7.R. Krishnamurthy, K.-Y. Whang: Multilevel Grid Files, IBM Research Report, Yorktown Heights, 1985.Google Scholar
- 8.D.B. Lomet: Partial Expansions for File Organizations with an Index, ACM Transactions on Database Systems, Vol. 12, 1, 1987, 65–84.Google Scholar
- 10.E.J. Otoo: Balanced Multidimensional Extendible Hash Tree, Proc. 5th ACM SIGACT/SIGMOD Symposium on Principles of Database Systems, 1986, 100–113.Google Scholar
- 11.J.T. Robinson: The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes, Proc. ACM SIGMOD International Conference on Management of Data, 1981, 10–18.Google Scholar