article

Free access

Multidimensional access methods

Authors:

Volker Gaede and

Oliver GüntherAuthors Info & Claims

ACM Computing Surveys (CSUR), Volume 30, Issue 2

Pages 170 - 231

https://doi.org/10.1145/280277.280279

Published: 01 June 1998 Publication History

Abstract

Search operations in databases require special support at the physical level. This is true for conventional databases as well as spatial databases, where typical search operations include the point query (find all objects that contain a given search point) and the region query (find all objects that overlap a given search region). More than ten years of spatial database research have resulted in a great variety of multidimensional access methods to support such operations. We give an overview of that work. After a brief survey of spatial data management in general, we first present the class of point access methods, which are used to search sets of points in two or more dimensions. The second part of the paper is devoted to spatial access methods to handle extended objects, such as rectangles or polyhedra. We conclude with a discussion of theoretical and experimental results concerning the relative performance of various approaches.

References

[1]

ABEL, D. J. AND MARK, D.M. 1990. A comparative analysis of some two-dimensional orderings. Int. J. Geograph. Inf. Syst. 4, 1, 21-31.

[2]

ABEL, D. J. AND SMITH, J.L. 1983. A data structure and algorithm based on a linear key for a rectangle retrieval problem. Comput. Vis. 24, 1-13.

[3]

ANG, C. AND TAN, T. 1997. New linear node splitting algorithm for R-trees. In Advances in Spatial Databases, M. Scholl and A. Voisard, Eds., LNCS, Springer-Verlag, Berlin/Heidelberg/New York.

[4]

AREF, W. G. AND SAMET, H. 1994. The spatial filter revisited. In Proceedings of the Sixth International Symposium on Spatial Data Handling, 190-208.

[5]

BAYER, R. 1996. The universal B-tree for multidimensional indexing. Tech. Rep. I9639, Technische Universit~it Mfinchen, Munich, Germany. http://www.leo.org/pub/comp/doc/ techre po rts/tu m/info rm a tik/re port/ 1996/TUM- I9639.ps.gz.

[6]

BAYER, R. AND MCCREIGHT, E.M. 1972. Organization and maintenance of large ordered indices. Acta Inf. 1, 3, 173-189.

[7]

BAYER, R. AND SCHKOLNICK, M. 1977. Concurrency of operations on B-trees. Acta Inf. 9, 1-21.

[8]

BECKER, B., FRANCIOSA, P., GSCHWIND, S., OHLER, T., THIEM, F., AND WIDMAYER, P. 1992. Enclosing many boxes by an optimal pair of boxes. In Proceedings of STACS'92, A. Finkel and M. Jantzen, Eds., LNCS 525, Springer- Verlag, Berlin/Heidelberg/New York, 475-486.

[9]

BECKER, L. 1992. A new algorithm and a cost model for join processing with the grid file. Ph.D. thesis, Universit~it-Gesamthochschule Siegen, Germany.

[10]

BECKMANN, N., K_RIEGEL, H.-P., SCHNEIDER, R., AND SEEGER, B. 1990. The R*-tree: An efficient and robust access method for points and rectangles. In Proceedings of ACM SIGMOD International Conference on Management of Data, 322-331.

[11]

BELUSSI, A. AND FALOUTSOS, C. 1995. Estimating the selectivity of spatial queries using the 'correlation' fractal dimension. In Proceedings of the 21st International Conference on Very Large Data Bases, 299-310.

[12]

BENTLEY, J. L. 1975. Multidimensional binary search trees used for associative searching. Commun. ACM 18, 9, 509-517.

[13]

BENTLEY, J. L. 1979. Multidimensional binary search in database applications. IEEE Trans. Softw. Eng. 4, 5, 333-340.

[14]

BENTLEY, J. L. AND FRIEDMAN, J.H. 1979. Data structures for range searching. ACM Comput. Surv. 11, 4, 397-409.

[15]

BERCHTOLD, S., KEIM, D., AND K_RIEGEL, H.-P. 1996. The X-tree: An index structure for high-dimensional data. In Proceedings of the 22nd International Conference on Very Large Data Bases, (Bombay) 28-39.

[16]

BLANKEN, H., IJBEMA, A., MEEK, P., AND VAN DEN AKKER, B. 1990. The generalized grid file: Description and performance aspects. In Proceedings of the Sixth IEEE International Conference on Data Engineering, 380-388.

[17]

BRINKHOFF, T. 1994. Der spatial join in geodatenbanksystemen. Ph.D. Thesis, Ludwig- Maximilians-Universit~it Mfinchen. Germany (in German).

[18]

BRINKHOFF, T. AND K_RIEGEL, H.-P. 1994. The impact of global clustering on spatial database systems. In Proceedings of the Twentieth International Conference on Very Large Data Bases, 168-179.

[19]

BRINKHOFF, T., K_RIEGEL, H.-P., AND SCHNEIDER, R. 1993a. Comparison of approximations of complex objects used for approximation-based query processing in spatial database systems. In Proceedings of the Ninth IEEE International Conference on Data Engineering, 40- 49.

[20]

BRINKHOFF, T., K_RIEGEL, H.-P., AND SEEGER, B. 1993b. Efficient processing of spatial joins using R-trees. In Proceedings of A CM SIG- MOD International Conference on Management of Data, 237-246.

[21]

BRINKHOFF, T., KRIEGEL, H.-P., SCHNEIDER, R., AND SEEGER, B. 1994. Multi-step processing of spatial joins. In Proceedings of the ACM SIG- MOD International Conference on Management of Data, 197-208.

[22]

BRODSKY, A., LASSEZ, C., LASSEZ, J.-L., AND MAHER, M.J. 1995. Separability of polyhedra for optimal filtering of spatial and constraint data. In Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (San Jose, CA), 54-64.

[23]

BURKHARD, W. 1984. Index maintenance for non-uniform record distributions. In Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 173-180.

[24]

BURKHARD, W.A. 1983. Interpolation-based index maintenance. BIT 23, 274-294.

[25]

CHEN, L., DRACH, R., KEATING, M., LOUIS, S., ROTEM, D., AND SHOSHANI, A. 1995. Access to multidimensional datasets on tertiary storage systems. Inf. Syst. 20, 2, 155-183.

[26]

COMER, D. 1979. The ubiquitous B-tree. ACM Comput. Surv. 11, 2, 121-138.

[27]

DANDAMUDI, S. P. AND SORENSON, P. G. 1986. Algorithms for BD-trees. Softw. Pract. Exper. 16, 2, 1077-1096.

[28]

DANDAMUDI, S. P. AND SORENSON, P. G. 1991. Improved partial-match search algorithms for BD-trees. Comput. J. 34, 5, 415-422.

[29]

EGENHOFER, M. 1989. Spatial query languages. Ph.D. Thesis, University of Maine, Orono, ME.

[30]

EGENHOFER, M. 1994. Spatial SQL: A query and presentation language. IEEE Trans. Knowl. Data Eng. 6, 1, 86-95.

[31]

EVANGELIDIS, G. 1994. The hBn-tree: A concurrent and recoverable multi-attribute index structure. Ph.D. Thesis, Northeastern University, Boston, MA.

[32]

EVANGELIDIS, G., LOMET, D., AND SALZBERG, B. 1995. The hBn-tree: A modified hB-tree supporting concurrency, recovery and node consolidation. In Proceedings of the 21st International Conference on Very Large Data Bases, 551-561.

[33]

FAGIN, R., NIEVERGELT, J., PIPPENGER, N., AND STRONG, R. 1979. Extendible hashing: A fast access method for dynamic files. ACM Trans. Database Syst. 4, 3, 315-344.

[34]

FALOUTSOS, C. 1986. Multiattribute hashing using Gray-codes. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 227-238.

[35]

FALOUTSOS, C. 1988. Gray-codes for partial match and range queries. IEEE Trans. Softw. Eng. 14, 1381-1393.

[36]

FALOUTSOS, C. AND GAEDE, V. 1996. Analysis of n-dimensional quadtrees using the Hausdorff fractal dimension. In Proceedings of the 22nd International Conference on Very Large Data Bases, (Bombay), 40-50.

[37]

FALOUTSOS, C. AND KAMEL, I. 1994. Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension. In Proceedings of the Thirteenth ACM SIGACT- SIGMOD-SIGART Symposium on Principles of Database Systems, 4-13.{

[38]

FALOUTSOS, C. AND RONG, Y. 1991. DOT: A spatial access method using fractals. In Proceedings of the Seventh IEEE International Conference on Data Engineering, 152-159.

[39]

FALOUTSOS, C. AND ROSEMAN, S. 1989. Fractals for secondary key retrieval. In Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 247-252.

[40]

FALOUTSOS, C., SELLIS, T., AND ROUSSOPOULOS, N. 1987. Analysis of object-oriented spatial access methods. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 426-439.

[41]

FINKEL, R. AND BENTLEY, J. L. 1974. Quad trees: A data structure for retrieval of composite keys. Acta Inf. 4, 1, 1-9.

[42]

FLAJOLET, P. 1983. On the performance evaluation of extendible hashing and trie searching. Acta Inf. 20, 345-369.

[43]

FRANK, A. AND BARRERA, R. 1989. The fieldtree: A data structure for geographic information systems. In Design and Implementation of Large Spatial Database Systems, A. Buchmann, O. Gfinther, T.R. Smith, and Y.-F. Wang, Eds., LNCS 409, Springer-Verlag, Berlin/Heidelberg/New York, 29-44.{

[44]

FREESTON, M. 1987. The BANG file: A new kind of grid file. In Proceedings of the ACM SIG- MOD International Conference on Management of Data, 260-269.

[45]

FREESTON, M. 1989a. Advances in the design of the BANG file. In Proceedings of the Third International Conference on Foundations of Data Organization and Algorithms, LNCS 367, Springer-Verlag, Berlin/Heidelberg/New York, 322-338.

[46]

FREESTON, M. 1989b. A well-behaved structure for the storage of geometric objects. In Design and Implementation of Large Spatial Database Systems, A. Buchmann, O. Gfinther, T. R. Smith, and Y.-F. Wang, Eds., LNCS 409, Springer-Verlag, Berlin/Heidelberg/New York, 287-300.

[47]

FREESTON, M. 1995. A general solution of the n-dimensional B-tree problem. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 80-91.

[48]

FREESTON, M. 1997. On the complexity of BV- tree updates. In Proceedings of CDB'97 and CP'96 Workshop on Constraint Databases and their Application, V. Gaede, A. Brodsky, O. Gfinther, D. Srivastava, V. Vianu, and M. Wallace, Eds., LNCS 1191, Springer-Verlag, Berlin/Heidelberg/New York, 282-293.

[49]

FUCHS, H., ABRAM, G. D., AND GRANT, E.D. 1983. Near real-time shaded display of rigid objects. Computer Graph. 17, 3, 65-72.

[50]

FUCHS, H., KEDEM, Z., AND NAYLOR, B. 1980. On visible surface generation by a priori tree structures. Computer Graph. 14, 3.

[51]

GAEDE, V. 1995a. Geometric information makes spatial query processing more efficient. In Proceedings of the Third ACM International Workshop on Advances in Geographic Information Systems (ACM-GIS'95) (Baltimore, MD) 45-52.

[52]

GAEDE, V. 1995b. Optimal redundancy in spatial database systems. In Advances in Spatial Databases, M. J. Egenhofer and J. R. Herring, Eds., LNCS 951, Springer-Verlag, Berlin/Heidelberg/New York, 96-116.

[53]

GAEDE, V. AND RIEKERT, W.-F. 1994. Spatial access methods and query processing in the object-oriented GIS GODOT. In Proceedings of the AGDM'94 Workshop (Delft, The Netherlands), Netherlands Geodetic Commission, 40-52.

[54]

GAEDE, V. AND WALLACE, M. 1997. An informal introduction to constraint databases. In Proceedings of CDB'97 and CP'96 Workshop on Constraint Databases and their Application, V. Gaede, A. Brodsky, O. Gfinther, D. Srivastava, V. Vianu, and M. Wallace, Eds., LNCS 1191, Springer-Verlag, Berlin/Heidelberg/ New York, 7-52.

[55]

GARG, A. K. AND GOTLIEB, C. C. 1986. Orderpreserving key transformation. ACM Trans. Database Syst. 11, 2, 213-234.

[56]

GREENE, D. 1989. An implementation and performance analysis of spatial data access methods. In Proceedings of the Fifth IEEE International Conference on Data Engineering, 606-615.

[57]

GUNTHER, O. 1988. Efficient Structures for Geometric Data Management. LNCS 337, Springer-Verlag, Berlin/Heidelberg/New York.

[58]

GUNTHER, O. 1989. The cell tree: An object-oriented index structure for geometric databases. In Proceedings of the Fifth IEEE International Conference on Data Engineering, 598-605.

[59]

GUNTHER, O. 1991. Evaluation of spatial access methods with oversize shelves. In Geographic Database Management Systems, G. Gambosi, M. Scholl, and H.-W. Six, Eds., Springer-Verlag, Berlin/Heidelberg/New York, 177-193.

[60]

GUNTHER, O. 1993. Efficient computation of spatial joins. In Proceedings of the Ninth IEEE International Conference on Data Engineering, 50-59.

[61]

GUNTHER, O. AND BILMES, J. 1991. Tree-based access methods for spatial databases: Implementation and performance evaluation. IEEE Trans. Knowl. Data Eng. 3, 3, 342-356.

[62]

GUNTHER, O. AND BUCHMANN, A. 1990. Research issues in spatial databases. SIGMOD Rec. 19, 4, 61-68.

[63]

GUNTHER, O. AND GAEDE, V. 1997. Oversize shelves: A storage management technique for large spatial data objects. Int. J. Geog. Inf. Syst. 11, 1, 5-32.

[64]

GUNTHER, O. AND NOLTEMEIER, H. 1991. Spatial database indices for large extended objects. In Proceedings of the Seventh IEEE International Conference on Data Engineering, 520- 526.

[65]

GUNTHER, O., MULLER, R., SCHMIDT, P., BHARGAVA, H., AND KRISHNAN, R. 1997. MMM: A WWW-based approach for sharing statistical software modules. IEEE Internet Comput. 1, 3.

[66]

GUNTHER, O., ORIA, V., PICOUET, P., SAGLIO, J.-M., AND SCHOLL, M. 1998. Benchmarking spatial joins ~ la carte. In Proceedings of the 10th International Conference on Scientific and Statistical Database Management. IEEE, New York.

[67]

GUTING, R. H. 1989. Gral: An extendible relational database system for geometric applications. In Proceedings of the Fifteenth International Conference on Very Large Data Bases, 33-44.

[68]

GUTING, R. H. AND SCHNEIDER, M. 1993. Realms: A foundation for spatial data types in database systems. In Advances in Spatial Databases, D. Abel and B. C. Ooi, Eds., LNCS 692, Springer-Verlag, Berlin/Heidelberg/New York.

[69]

GUTTMAN, A. 1984. R-trees: A dynamic index structure for spatial searching. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 47-54.

[70]

HELLERSTEIN, J. M., KOUTSOUPIAS, E., AND PAPAD- IMITRIOU, C.H. 1997. Towards a theory of indexability. In Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.

[71]

HELLERSTEIN, J. M., NAUGHTON, J. F., AND PFEF- FER, A. 1995. Generalized search trees for database systems. In Proceedings of the 21st International Conference on Very Large Data Bases, 562-573.

[72]

HENRICH, A. 1995. Adapting the transformation technique to maintain multidimensional nonpoint objects in k-d-tree based access structures. In Proceedings of the Third ACM International Workshop on Advances in Geographic Information Systems (ACM-GIS'95) (Baltimore, MD) ACM Press, New York.

[73]

HENRICH, A. AND MOLLER, J. 1995. Extending a spatial access structure to support additional standard attributes. In Advances in Spatial Databases, M. J. Egenhofer and J. R. Herring, Eds., LNCS 951, Springer-Verlag, Berlin/Heidelberg/New York, 132-151.

[74]

HENRICH, A. AND SIX, H.-W. 1991. How to split buckets in spatial data structures. In Geographic Database Management Systems, G. Gambosi, M. Scholl, and H.-W. Six, Eds., Springer-Verlag, Berlin/Heidelberg/New York, 212-244.

[75]

HENRICH, A., SIX, H.-W., AND WIDMAYER, P. 1989. The LSD tree: Spatial access to multidimensional point and non-point objects. In Proceedings of the Fifteenth International Conference on Very Large Data Bases, 45-53.

[76]

HINRICHS, K. 1985. Implementation of the grid file: Design concepts and experience. BIT 25, 569-592.

[77]

HOEL, E. G. AND SAMET, H. 1992. A qualitative comparison study of data structures for large segment databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 205-214.

[78]

HOEL, E. G. AND SAMET, H. 1995. Benchmarking spatial join operations with spatial output. In Proceedings of the 21st International Conference on Very Large Data Bases, 606- 618.

[79]

HUTFLESZ, A., SIX, H.-W., AND WIDMAYER, P. 1988a. Globally order preserving multidimensional linear hashing. In Proceedings of the Fourth IEEE International Conference on Data Engineering, 572-579.

[80]

HUTFLESZ, A., SIX, H.-W., AND WIDMAYER, P. 1988b. Twin grid files: Space optimizing access schemes. In Proceedings of the ACM SIG- MOD International Conference on Management of Data, 183-190.

[81]

HUTFLESZ, A., SIX, H.-W., AND WIDMAYER, P. 1990. The R-file: An efficient access structure for proximity queries. In Proceedings of the Sixth IEEE International Conference on Data Engineering, 372-379.

[82]

HUTFLESZ, A., WIDMAYER, P., AND ZIMMERMANN, C. 1991. Global order makes spatial access faster. In Geographic Database Management Systems, G. Gambosi, M. Scholl, and H.-W. Six, Eds., Springer-Verlag, Berlin/Heidelberg/ New York, 161-176.

[83]

INFORMIX INC. 1997. The DataBlade architecture. URL http://www.informix.com.

[84]

JAGADISH, H.V. 1990a. Linear clustering of objects with multiple attributes. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 332-342.

[85]

JAGADISH, H. V. 1990b. On indexing line segments. In Proceedings of the Sixteenth International Conference on Very Large Data Bases, 614-625.

[86]

JAGADISH, H. V. 1990c. Spatial search with polyhedra. In Proceedings of the Sixth IEEE International Conference on Data Engineering, 311-319.

[87]

KAMEL, I. AND FALOUTSOS, C. 1992. Parallel R- trees. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 195-204.

[88]

KAMEL, I. AND FALOUTSOS, C. 1993. On packing R-trees. In Proceedings of the Second International Conference on Information and Knowledge Management, 490-499.

[89]

KAMEL, I. AND FALOUTSOS, C. 1994. Hilbert R- tree: An improved R-tree using fractals. In Proceedings of the Twentieth International Conference on Very Large Data Bases, 500- 509.

[90]

KAMEL, I., KHALIL, M., AND KOURAMAJIAN, V. 1996. Bulk insertion in dynamic R-trees. In Proceedings of the Seventh International Symposium on Spatial Data Handling (Delft, The Netherlands), 3B.31-3B.42.

[91]

KANELLAKIS, P. C., RAMASWAMY, S., VENGROFF, D. E., AND VITTER, J.S. 1993. Indexing for data models with constraints and classes. In Proceedings of the Twelfth ACM SIGACT- SIGMOD-SIGART Symposium on Principles of Database Systems, 233-243.

[92]

KEDEM, G. 1982. The quad-CIF tree: A data structure for hierarchical on-line algorithms. In Proceedings of the Nineteenth Conference on Design and Automation, 352-357.

[93]

KEMPER, A. AND WALLRATH, M. 1987. An analysis of geometric modeling in database systerns. ACM Comput. Surv. 19, 1, 47-91.

[94]

KLINGER, A. 1971. Pattern and search statistics. In Optimizing Methods in Statistics, S. Rustagi, Ed., 303-337.

[95]

KNOTT, G. 1975. Hashing functions. Comput. J. 18, 3, 265-278.

[96]

KOLOVSON, C. 1990. Indexing techniques for multi-dimensional spatial data and historical data in database management systems. Ph.D. Thesis, University of California at Berkeley.

[97]

KOLOVSON, C. AND STONEBRAKER, M. 1991. Segment indexes: Dynamic indexing techniques for multi-dimensional interval data. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 138-147.{

[98]

KRIEGEL, H.-P. 1984. Performance comparison of index structures for multikey retrieval. In Proceedings of the A CM SIGMOD International Conference on Management of Data, 186-196.

[99]

KRIEGEL, H.-P., HELP, P., HELP, S., SCHIWIETZ, M., AND SCHNEIDER, R. 1991. An access method based query processor for spatial database systems. In Geographic Database Management Systems, G. Gambosi, M. Scholl, and H.-W. Six, Eds., Springer-Verlag, Berlin/Heidelberg/New York, 273-292.

[100]

KRIEGEL, H.-P., SCHIWIETZ, M., SCHNEIDER, R., AND SEEGER, B. 1990. Performance comparison of point and spatial access methods. In Design and Implementation of Large Spatial Database Systems, A. Buchmann, O. Gtinther, T. R. Smith, and Y.-F. Wang, Eds., LNCS 409, Springer-Verlag, Berlin/Heidelberg/New York, 89-114.

[101]

KRIEGEL, H.-P. AND SEEGER, B. 1986. Multidimensional order preserving linear hashing with partial expansions. In Proceedings of the International Conference on Database Theory, LNCS 243, Springer-Verlag, Berlin/Heidelberg/New York.

[102]

KRIEGEL, H.-P. AND SEEGER, B. 1987. Multidimensional quantile hashing is very efficient for non-uniform record distributions. In Proceedings of the Third IEEE International Conference on Data Engineering, 10-17.

[103]

KRIEGEL, H.-P. AND SEEGER, B. 1988. PLOP- hashing: A grid file without directory. In Proceedings of the Fourth IEEE International Conference on Data Engineering, 369-376.

[104]

KRIEGEL, H.-P. AND SEEGER, B. 1989. Multidimensional quantile hashing is very efficient for non-uniform distributions. Inf. Sci. 48, 99-117.

[105]

KORNACKER, M. AND BANKS, D. 1995. High-concurrency locking in R-trees. In Proceedings of the 21st International Conference on Very Large Data Bases, 134-145.

[106]

KUMAR, A. 1994a. G-tree: A new data structure for organizing multidimensional data. IEEE Trans. Knowl. Data Eng. 6, 2, 341-347.

[107]

KUMAR, A. 1994b. A study of spatial clustering techniques. In Proceedings of the Fifth Conference on Database and Expert Systems Applications (DEXA'94), D. Karagiannis, Ed., LNCS 856, Springer-Verlag, Berlin/Heidelberg/New York, 57-70.

[108]

LARSON, P.A. 1980. Linear hashing with partial expansions. In Proceedings of the Sixth International Conference on Very Large Data Bases, 224-232.

[109]

LEHMAN, P. AND YAO, S. 1981. Efficient locking for concurrent operations on B-trees. ACM Trans. Database Syst. 6, 4, 650-670.

[110]

LIN, K.-I., JAGADISH, H., AND FALOUTSOS, C. 1994. The TV-tree: An index structure for high-dimensional data. VLDB J. 3, 4, 517- 543.

[111]

LITWIN, W. 1980. Linear hashing: A new tool for file and table addressing. In Proceedings of the Sixth International Conference on Very Large Data Bases, 212-223.

[112]

Lo, M. AND RAVISHANKAR, C. 1994. Spatial joins using seeded trees. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 209-220.

[113]

LOMET, D.B. 1983. Boundex index exponential hashing. A CM Trans. Database Syst. 8, 1, 136-165.

[114]

LOMET, D.B. 1991. Grow and post index trees: Role, techniques and future potential. In Advances in Spatial Databases, O. Gtinther and H. Schek, Eds., LNCS 525, Springer-Verlag, Berlin/Heidelberg/New York, 183-206.

[115]

LOMET, D. B. AND SALZBERG, B. 1989. The hB- tree: A robust multiattribute search structure. In Proceedings of the Fifth IEEE International Conference on Data Engineering, 296 -304.

[116]

LOMET, D. B. AND SALZBERG, B. 1990. The hB- tree: A multiattribute indexing method with good guaranteed performance. ACM Trans. Database Syst. 15, 4, 625-658. Reprinted in Readings in Database Systems, M. Stonebraker, Ed., Morgan-Kaufmann, San Mateo, CA, 1994.

[117]

LOMET, D. B. AND SALZBERG, B. 1992. Access method concurrency with recovery. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 351-360.

[118]

Lu, H. AND OoI, B.-C. 1993. Spatial indexing: Past and future. IEEE Data Eng. Bull. 16, 3, 16-21.

[119]

MATSUYAMA, T., HAO, L. V., AND NAGAO, M. 1984. A file organization for geographic information systems based on spatial proximity. Int. J. Comput. Vis. Graph. Image Process. 26, 3, 303-318.

[120]

MORTON, G. 1966. A computer oriented geodetic data base and a new technique in file sequencing. IBM Ltd.

[121]

0NELSON, R. AND SAMET, H. 1987. A population analysis for hierarchical data structures. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 270-277.

[122]

NEWELL, R. G. AND DOE, M. 1997. Discrete geometry with seamless topology in a GIS. URL http://www.smallworld-us.com.

[123]

NG, R. T. AND HAN, J. 1994. Efficient and effective clustering methods for spatial data mining. In Proceedings of the Twentieth International Conference on Very Large Data Bases, 144-154.

[124]

NG, V. AND KAMEDA, T. 1993. Concurrent accesses to R-trees. In Advances in Spatial Databases, D. Abel and B. C. Ooi, Eds., LNCS 692, Springer-Verlag, Berlin/Heidelberg/New York, 142-161.

[125]

NG, V. AND KAMEDA, T. 1994. The R-link tree: A recoverable index structure for spatial data. In Proceedings of the Fifth Conference on Database and Expert Systems Applications (DEXA'94), D. Karagiannis, Ed., LNCS 856, Springer-Verlag, Berlin/Heidelberg/New York, 163-172.

[126]

NIEVERGELT, g. 1989. 7---2 criteria for assessing and comparing spatial data structures. In Design and Implementation of Large Spatial Database Systems, A. Buchmann, O. Gfinther, T. R. Smith, and Y.-F. Wang, Eds., LNCS 409, Springer-Verlag, Berlin/Heidelberg/New York, 3-27.

[127]

NIEVERGELT, g. AND HINRICHS, K. 1987. Storage and access structures for geometric data bases. In Proceedings of the International Conference on Foundations of Data Organization, S. Ghosh, Y. Kambayashi, and K. Tanaka, Eds., Plenum, New York.

[128]

NIEVERGELT, g., HINTERBERGER, g., AND SEVCIK, Z. 1981. The grid file: An adaptable, symmetric multikey file structure. In Proceedings of the Third ECI Conference, A. Duijvestijn and P. Lockemann, Eds., LNCS 123, Springer-Verlag, Berlin/Heidelberg/New York, 236-251.

[129]

NIEVERGELT, g., HINTERBERGER, g., AND SEVCIK, K.C. 1984. The grid file: An adaptable, symmetric multikey file structure. ACM Trans. Database Syst. 9, 1, 38-71.

[130]

OHSAWA, Y. AND SAKAUCHI, M. 1983. BD-tree: A new n-dimensional data structure with efficient dynamic characteristics. In Proceedings of the Ninth World Computer Congress, IFIP 1983, 539-544.

[131]

OHSAWA, Y. AND SAKAUCHI, M. 1990. A new tree type data structure with homogeneous node suitable for a very large spatial database. In Proceedings of the Sixth IEEE International Conference on Data Engineering, 296-303.

[132]

OoI, B. C. 1990. Efficient Query Processing in Geographic Information Systems. LNCS 471, Springer-Verlag, Berlin/Heidelberg/New York.

[133]

OoI, B. C., MCDONELL, K. J., AND SACKS-DAVIS, R. 1987. Spatial kd-tree: An indexing mechanism for spatial databases. In Proceedings of the IEEE Computer Software and Applications Conference, 433-438.

[134]

OoI, B. C., SACKS-DAVIS, R., AND MCDONELL, K.J. 1991. Spatial indexing by binary decomposition and spatial bounding. Inf. Syst. J. 16, 2, 211-237.

[135]

OOSTEROM, P. 1990. Reactive data structures for geographic information systems. Ph.D. Thesis, University of Leiden, The Netherlands.

[136]

ORACLE INC. 1995. Oracle 7 multidimension: Advances in relational database technology for spatial data management. White paper.

[137]

ORENSTEIN, J. 1982. Multidimensional tries used for associative searching. Inf. Process. Lett. 14, 4, 150-157.

[138]

ORENSTEIN, J. 1983. A dynamic file for random and sequential accessing. In Proceedings of the Ninth International Conference on Very Large Data Bases, 132-141.

[139]

ORENSTEIN, J. 1989a. Redundancy in spatial databases. In Proceedings of the ACM SIG- MOD International Conference on Management of Data, 294-305.

[140]

ORENSTEIN, J. 1989b. Strategies for optimizing the use of redundancy in spatial databases. In Design and Implementation of Large Spatial Database Systems, A. Buchmann, O. Gfinther, T. R. Smith, and Y.-F. Wang, Eds., LNCS 409, Springer-Verlag, Berlin/Heidelberg/New York, 115-134.

[141]

ORENSTEIN, J. 1990. A comparison of spatial query processing techniques for native and parameter space. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 343-352.

[142]

ORENSTEIN, J. AND MERRETT, T.H. 1984. A class of data structures for associative searching. In Proceedings of the Third A CM SIGACT- SIGMOD Symposium on Principles of Database Systems, 181-190.

[143]

ORENSTEIN, J. A. 1986. Spatial query processing in an object-oriented database system. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 326-333.

[144]

OTOO, E. J. 1984. A mapping function for the directory of a multidimensional extendible hashing. In Proceedings of the Tenth International Conference on Very Large Data Bases, 493-506.

[145]

OTOO, E. J. 1985. Symmetric dynamic index maintenance scheme. In Proceedings of the International Conference on Foundations of Data Organization, Plenum, New York, 283- 296.{

[146]

OTOO, E. J. 1986. Balanced multidimensional extendible hash tree. In Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 100-113.

[147]

OUKSEL, M. 1985. The interpolation based grid file. In Proceedings of the Fourth ACM SI- GACT-SIGMOD Symposium on Principles of Database Systems, 20-27.

[148]

OUKSEL, M. AND SCHEUERMANN, P. 1983. Storage mappings for multidimensional linear dynamic hashing. In Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 90-105.

[149]

OUKSEL, M. A. AND MAYER, O. 1992. A robust and efficient spatial data structure. Acta Inf. 29, 335-373.

[150]

OVERMARS, M. H., SMID, M. H., BERG, T., AND VAN KREVELD, M.J. 1990. Maintaining range trees in secondary memory: Part I: Partitions. Acta Inf. 27, 423-452.

[151]

PAGEL, B. U., SIX, H.-W., AND TOBEN, H. 1993a. The transformation technique for spatial objects revisited. In Advances in Spatial Databases, D. Abel and B. C. Ooi, Eds., LNCS 692, Springer-Verlag, Berlin/Heidelberg/New York, 73-88.

[152]

PAGEL, B. U., SIX, H.-W., AND WINTER, M. 1995. Window query optimal clustering of spatial objects. In Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 86-94.

[153]

PAGEL, B. U., SIX, H.-W., TOBEN, H., AND WID- MAYER, P. 1993b. Towards an analysis of range query performance in spatial data structures. In Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 214-221.

[154]

PAPADIAS, D., THEODORIDIS, Y., SELLIS, T., AND EGENHOFER, M.J. 1995. Topological relations in the world of minimum bounding rectangles: A study with R-trees. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 92-103.

[155]

PAPADOPOULOS, A. AND MANOLOPOULOS, Y. 1997. Performance of nearest neighbor queries in R-trees. In Proceedings of the International Conference on Database Theory (ICDT'97), F. Afrati and P. Kolaitis, Eds., LNCS 1186, Springer-Verlag, Berlin/Heidelberg/New York, 394-408.

[156]

PELOUX, J., REYNAL, G., AND SCHOLL, M. 1994. Evaluation of spatial indices implemented with the 02 DBMS. Ingdni~rie des Syst~mes d'Information 6.

[157]

PREPARATA, F. P. AND SHAMOS, M.I. 1985. Computational Geometry. Springer-Verlag, New York.

[158]

REGNIER, M. 1985. Analysis of the grid file algorithms. BIT 25, 335-357.{

[159]

ROBINSON, J.T. 1981. The K-D-B-tree: A search structure for large multidimensional dynamic indexes. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 10-18.

[160]

ROTEM, D. 1991. Spatial join indices. In Proceedings of the Seventh IEEE International Conference on Data Engineering, 10-18.

[161]

ROUSSOPOULOS, N. AND LEIFKER, D. 1984. An introduction to PSQL: A pictorial structured query language. In Proceedings of the IEEE Workshop on Visual Languages.

[162]

ROUSSOPOULOS, N. AND LEIFKER, D. 1985. Direct spatial search on pictorial databases using packed R-trees. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 17-31.

[163]

SAGAN, H. 1994. Space-Filling Curves. Springer-Verlag, Berlin/Heidelberg/New York.

[164]

SAMET, H. 1984. The quadtree and related hierarchical data structure. ACM Comput. Surv. 16, 2, 187-260.

[165]

SAMET, H. 1988. Hierarchical representation of collections of small rectangles. ACM Comput. Surv. 20, 4, 271-309.

[166]

SAMET, H. 1990a. Applications of Spatial Data Structures. Addison-Wesley, Reading, MA.

[167]

SAMET, H. 1990b. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA.

[168]

SAMET, H. AND WEBBER, R. E. 1985. Storing a collection of polygons using quadtrees. ACM Trans. Graph. 4, 3, 182-222.

[169]

SCHIWIETZ, M. 1993. Speicherung und anfragebearbeitung komplexer geo-objekte. Ph.D. Thesis, Ludwig-Maximilians-Universit~it Mtinchen, Germany (in German).

[170]

SCHNEIDER, R. AND KRIEGEL, H.-P. 1992. The TR*-tree: A new representation of polygonal objects supporting spatial queries and operations. In Proceedings of the Seventh Workshop on Computational Geometry, LNCS 553, Springer-Verlag, Berlin/Heidelberg/New York, 249-264.

[171]

SCHOLL, M. AND VOISARD, A. 1989. Thematic map modeling. In Design and Implementation of Large Spatial Database Systems, A. Buchmann, O. Gtinther, T.R. Smith, and Y.-F. Wang, Eds., LNCS 409, Springer-Verlag, Berlin/Heidelberg/New York.

[172]

SEEGER, B. 1991. Performance comparison of segment access methods implemented on top of the buddy-tree. In Advances in Spatial Databases, O. Gtinther and H. Schek, Eds., LNCS 525, Springer-Verlag, Berlin/Heidelberg/New York, 277-296.

[173]

SEEGER, B. AND KRIEGEL, H.-P. 1988. Techniques for design and implementation of spatial access methods. In Proceedings of the Fourteenth International Conference on Very Large Data Bases, 360-371.

[174]

SEEGER, B. AND KRIEGEL, H.-P. 1990. The buddy-tree: An efficient and robust access method for spatial data base systems. In Proceedings of the Sixteenth International Conference on Very Large Data Bases, 590-601.

[175]

SELLIS, T., ROUSSOPOULOS, N., AND FALOUTSOS, C. 1987. The R~-tree: A dynamic index for multi-dimensional objects. In Proceedings of the Thirteenth International Conference on Very Large Data Bases, 507-518.

[176]

SEVCIK, K. AND KOUDAS, N. 1996. Filter trees for managing spatial data over a range of size granularities. In Proceedings of the 22th International Conference on Very Large Data Bases (Bombay), 16-27.

[177]

SEXTON, n.P. 1997. Querying indexed files. In Proceedings of the CDB'97 and CP'96 Workshop on Constraint Databases and Their Application, V. Gaede, A. Brodsky, O. Gfinther, D. Srivastava, V. Vianu, and M. Wallace, Eds., LNCS 1191, Springer-Verlag, Berlin/ Heidelberg/New York, 263-281.

[178]

SHEKHAR, S. AND LIU, D.-R. 1995. CCAM: A connectivity-clustered access method for aggregate queries on transportation networks: A summary of results. In Proceedings of the Eleventh IEEE International Conference on Data Engineering, 410-419.

[179]

SIEMENS NIXDORF INFORMATIONSSYSTEME AG 1997. URL http://www.sni.de.

[180]

SIX, H. AND WIDMAYER, P. 1988. Spatial searching in geometric databases. In Proceedings of the Fourth IEEE International Conference on Data Engineering, 496-503.

[181]

SMID, M. H. AND OVERMARS, M.H. 1990. Maintaining range trees in secondary memory part II: Lower bounds. Acta Inf. 27, 453-480.

[182]

SMITH, T. R. AND GAO, P. 1990. Experimental performance evaluations on spatial access methods. In Proceedings of the Fourth International Symposium on Spatial Data Handling (Zfirich), 991-1002.

[183]

STONEBRAKER, M. (ED.) 1994. Readings in Database Systems. Morgan-Kaufmann, San Mateo, CA.

[184]

STONEBRAKER, M., SELLIS, T., AND HANSON, E. 1986. An analysis of rule indexing implementations in data base systems. In Proceedings of the First International Conference on Expert Data Base Systems.

[185]

STUCKEY, P. 1997. Constraint search trees. In Proceedings of the International Conference on Logic Programming (CLP'97), L. Naish, Ed., MIT Press, Cambridge, MA.

[186]

SUBRAMANIAN, S. AND RAMASWAMY, S. 1995. The P-range tree: A new data structure for range searching in secondary memory. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA'95).

[187]

TAMMINEN, M. 1982. The extendible cell method for closest point problems. BIT 22, 27-41.

[188]

TAMMINEN, M. 1983. Performance analysis of cell based geometric file organisations. Int. J. Cutup. Vis. Graph. Image Process. 24, 160- 181.

[189]

TAMMINEN, M. 1984. Comment on quad- and octrees. Commun. ACM 30, 3, 204-212.

[190]

THEODORIDIS, Y. AND SELLIS, T. K. 1996. A model for the prediction of R-tree performance. In Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 161-171.

[191]

TROPF, H. AND HERZOG, H. 1981. Multidimensional range search in dynamically balanced trees. Angewandte Informatik 2, 71-77.

[192]

WHANG, K.-Y. AND KRISHNAMURTHY, R. 1985. Multilevel grid files. IBM Research Laboratory, Yorktown Heights, NY.

[193]

WHITE, M. 1981. N-trees: Large ordered indexes for multi-dimensional space. Tech. Rep., Application Mathematics Research Staff, Statistical Research Division, US Bureau of the Census.

[194]

WIDMAYER, P. 1991. Datenstrukturen ffir Geodatenbanken. In Entwicklungstendenzen bei Datenbank-Systemen, G. Vossen and K.-U. Witt, Eds., Oldenbourg-Verlag, Munich, Chapter 9, 317-361 (in German).

Cited By

Christodoulou GBouros PMamoulis N(2024)LIT: Lightning-fast In-memory Temporal IndexingProceedings of the ACM on Management of Data10.1145/36392752:1(1-27)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639275
Gutiérrez GTorres-Avilés RCaniupán M(2024)cKd-tree: A Compact Kd-treeIEEE Access10.1109/ACCESS.2024.336505412(28666-28676)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3365054
Duch AMartínez C(2024)On the Expected Cost of Partial Match Queries in Random Quad-K-d TreesLa Matematica10.1007/s44007-024-00090-53:1(385-416)Online publication date: 4-Mar-2024
https://doi.org/10.1007/s44007-024-00090-5
Show More Cited By

Recommendations

Configuring role-based access control to enforce mandatory and discretionary access control policies

Access control models have traditionally included mandatory access control (or lattice-based access control) and discretionary access control. Subsequently, role-based access control has been introduced, along with claims that its mechanisms are general ...
Read More
Authorized! access denied, unauthorized! access granted
SIN '13: Proceedings of the 6th International Conference on Security of Information and Networks

Existing access control systems are mostly identity-based. However, such access control systems impose risks because recognized identity is not essentially an interpretation of good intentions of access. On the other hand, an un-identified individual ...
Read More
Role-Based Access Control Models

Since the 1970s, computer systems have featured multiple applications and served multiple users, leading to heightened awareness of data security issues. System administrators and software developers focused on different kinds of access control to ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Computing Surveys

ACM Computing Surveys Volume 30, Issue 2

June 1998

160 pages

ISSN:0360-0300

EISSN:1557-7341

DOI:10.1145/280277

Issue’s Table of Contents

Copyright © 1998 ACM.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1998

Published in CSUR Volume 30, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1,203
Total Citations
View Citations
8,567
Total Downloads

Downloads (Last 12 months)504
Downloads (Last 6 weeks)32

Other Metrics

View Author Metrics

Citations

Cited By

Christodoulou GBouros PMamoulis N(2024)LIT: Lightning-fast In-memory Temporal IndexingProceedings of the ACM on Management of Data10.1145/36392752:1(1-27)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639275
Gutiérrez GTorres-Avilés RCaniupán M(2024)cKd-tree: A Compact Kd-treeIEEE Access10.1109/ACCESS.2024.336505412(28666-28676)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3365054
Duch AMartínez C(2024)On the Expected Cost of Partial Match Queries in Random Quad-K-d TreesLa Matematica10.1007/s44007-024-00090-53:1(385-416)Online publication date: 4-Mar-2024
https://doi.org/10.1007/s44007-024-00090-5
Bormann PKrämer MWürz HGöhringer P(2024)Executing Ad-Hoc Queries on Large Geospatial Data Sets Without Acceleration StructuresSN Computer Science10.1007/s42979-024-02986-z5:5Online publication date: 13-Jun-2024
https://dl.acm.org/doi/10.1007/s42979-024-02986-z
Lee JKwon TJung S(2024)An effective spatial join method for blockchain-based geospatial data using hierarchical quadrant spatial LSM+ treeThe Journal of Supercomputing10.1007/s11227-024-06134-580:12(17492-17523)Online publication date: 29-Apr-2024
https://doi.org/10.1007/s11227-024-06134-5
Sun LSong B(2023)Feature adaptive multi-view hash for image searchElectronic Research Archive10.3934/era.202329731:9(5845-5865)Online publication date: 2023
https://doi.org/10.3934/era.2023297
Arslan SYazici A(2023)MM-FOOD: a high-dimensional index structure for efficiently querying content and concept of multimedia dataJournal of Intelligent & Fuzzy Systems10.3233/JIFS-22067344:1(251-282)Online publication date: 5-Jan-2023
https://doi.org/10.3233/JIFS-220673
Reznichenko V(2023)60 Years of Databases (final part)PROBLEMS IN PROGRAMMING10.15407/pp2023.01.066(66-103)Online publication date: Jan-2023
https://doi.org/10.15407/pp2023.01.066
Lülf CMartins DSalles MZhou YGieseke F(2023)Fast Search-by-Classification for Large-Scale Databases Using Index-Aware Decision Trees and Random ForestsProceedings of the VLDB Endowment10.14778/3611479.361149216:11(2845-2857)Online publication date: 24-Aug-2023
https://dl.acm.org/doi/10.14778/3611479.3611492
Teng XTrajcevski GZüfle A(2023)Distance, Origin and Category Constrained PathsACM Transactions on Spatial Algorithms and Systems10.1145/35966019:3(1-27)Online publication date: 23-Jun-2023
https://dl.acm.org/doi/10.1145/3596601
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Media

Figures

Other

Tables

View Issue’s Table of Contents