Abstract
A new structure for organizing a set of multidimensional points called the nested interpolation-based grid file (NIBGF) is introduced. The structure represents a synthesis and an improvement over interpolation-based grid files (IBGF), BANG files, andK-D-B-trees. It decomposes the data search space into uniquely identifiable regions which may either be disjoint as in interpolation-based grid files or enclose each other as in the BANG files. In addition to possessing the symmetry of access and clustering properties characteristic of grid file structures, the performance of NIBGF is comparable to aB-tree performance as far as the index is concerned, even in the worst case scenario, and to the BANG file performance as far as the data regions are concerned. These properties make the new structure suitable for efficient implementation of relational database operations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bayer, R., McCreight, C.: Organization and maintenance of large ordered indexes. Acta Inf.1(3), 173–189 (1972)
Bentley, J.L.: Multidimensional binary search trees used for associative indexes. Commun. ACM18(9), 509–517 (1975)
Bocca, J.: Educe: a marriage of convenience. Int. Symposium on Logic Programming, Sept. 1986, Salt Lake City
Bocca, J. et al.: Some steps towards a DBMS based KBMS. IFIP Congress, Sept. 1986, Dublin
Burkhard, W.A.: Interpolation-based index maintenances. Proc. Second ACM-SIGMOD Symp. on Principles of Database Systems, Atlanta, Georgia, 1983
Burkhard, W.A.: Index maintenances for non-uniform record distribution. Proc Third ACM-SIGMOD Symp. on Principles of Database Systems, Waterloo, Canada, 1984
Fagin, R., Nievergelt, J., Pippenger, N., Strong, H.R.: Extendible hashing: A fast access method for dynamic files. ACM Trans. Database Syst.4(3), 315–344 (1983)
Flajolet, P.: On the performance evaluation of extendible hashing and tree searching. Acta Inf.20, 345–369 (1983)
Freeston, P.: The BANG file. Proc. ACM SIGMOD 1987, pp. 260–269
Freeston, P.: Advances in the design of the BANG file. Third International Conference on Data Organizations and Algorithms, Paris, 1989
Gardarin, G., Valduriez, P.: Relational databases and knowledge bases. Reading, NJ: Addison-Wesley 1989
Hinrichs, K.: Implementation of the grid file. BIT25 (1985)
Kriegel, H.P.: Multidimensional quantile hashing is very efficient for non-uniform distributions. Proc. 3rd Intn. Conf. on Data Engineering, 1987
Litwin, W.: Linear hashing: A new tool for file and table addressing. Proc. Sixth Int. Conf. on Very Large Data Bases, Montreal, Canada, 1980, pp. 212–223
Lomet, D.B., Salzberg, B.: The hB-tree: a multi-attribute indexing method with good guaranteed performance. ACM Trans. Database Syst.15(4), 625–658 (1990)
Nievergelt, J., Hinterberger, J., Sevcik, K.C.: The grid file: An adaptable symmetric multikey file structure. ACM Trans. Database Syst.9(1), 38–71 (1984)
Orenstein, J.: Multidimensional tries used for associative searching. Proc. Ninth Int. Conf. on Very Large Databases, Florence, Italy, 1983, pp. 132–141
Orenstein, J., Manola, F.A.: PROBE spatial data modeling and query processing in an image database application. IEEE Trans. Software Eng.14(5), 611–629 (1988)
Oshawa, Y., Sakauchi, M.: The BD-tree-a new n-dimensional data structure with highly efficient dynamic characteristics. Proc. IFIP 9th World Computer Congress, 1983, pp. 539–544
Otoo, E.J.: Balanced multidimensional extendible hash trees. Proc. ACM SIGACT SIGMOD Symp. on Principles of Database Systems, 1986
Ouksel, M., Scheuermann, P.: Implicit data structures. Information Process. Lett.29, 183–189 (1988)
Ouksel, M., Mayer, O.: An anticipatory, scheme for managing concurrent database ooperations. CRIM Working Paper, No. 89-9
Ouksel, M., Yaaghoub, A.: The interpolation-based bintree and its application to graphics. (submitted to J. Vision, Graphics, Image Process.)
Ouksel, M., Scheuermann, P.: Storage mappings for multidimensional linear dynamic hashing. Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, 1983
Ouksel, M.: The interpolation-based grid file. Proc. 4th ACM SIGACT-SIGMOD Symposium on Principles of Data Base Systems, 1985, pp. 20–27
Ouksel, M.: The interpolation-based grid file: A spatial data representation scheme. CLEAR Center Report, 1989
Oskarahan, E., Ouksel, M.: Dynamic order-preserving partitioning for database machines. Proc. Eleventh Int. Conf. on Very Large Data Bases, Stockholm, 1985
Robinson, J.T.: The K-D-B-tree: A search structure for large multidimensional dynamic indexes. Proceedings ACM SIGMOD Conference on Management of Data, Boston, June 1984
Salzberg, B.: Grid file concurrency Inf. Syst.11(3), 235–244 (1986).
Samet, H.: The quadtree and related hierarchical data structures. ACM Comput. Surv.16(2), 184–260 (1984)
Scheuermann, P., Ouksel, M.: Multidimensional B-trees for associative searching in data-base systems. Inf. Syst.7(2), 123–137 (1982)
Seeger, B., Kriegel, H.: Techniques for design and implementation of efficient spatial access methods. Proc. Fourteenth Int. Conf. on Very Large Databases, Los Angeles, USA, 1988, pp. 360–371
Thom, J., Naish, L., Ramamohanarao, K.: A superjoin algorithm for deductive databases. Very Large Data Bases, Aug. 1986, Kyoto
Author information
Authors and Affiliations
Additional information
Research supported by NSF IRI-9010365
Rights and permissions
About this article
Cite this article
Ouksel, M.A., Mayer, O. A robust and efficient spatial data structure. Acta Informatica 29, 335–373 (1992). https://doi.org/10.1007/BF01178777
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01178777