Hans-Peter Kriegel
ABSTRACT
Modern database applications including computer-aided design, multimedia information systems, medical imaging, molecular biology, or geographical information systems impose new requirements on the effective and efficient management of spatial data. Particular problems arise from the need of high resolutions for large spatial objects and from the design goal to use general purpose database management systems in order to guarantee industrial-strength. In the past two decades, various stand-alone spatial index structures have been proposed but their integration into fully-fledged database systems is problematic. Most of these approaches are based on the decomposition of spatial objects leading to replicating index structures. In contrast to common black-and-white decompositions which suffer from the lack of intermediate solutions, we introduce gray intervals which are stored in a spatial index. Additionally, we store the exact information of these gray intervals in a compressed way. These gray intervals are created by using a cost-based decompositioning algorithm which takes the access probability and the decompression cost of them into account. Furthermore, we exploit statistical information of the database objects to find a cost-optimal decomposition of the query objects. The experimental evaluation on the SEQUOIA benchmark test points out that our new concept outperforms the Relational Interval Tree by more than one order of magnitude with respect to overall query response time.
- Bliujute R., Saltenis S., Slivinskas G., Jensen C. S.: Developing a DataBlade for a New Index. Proc. 15th Int. Conf. on Data Engineering (ICDE), 314--323, 1999. Google Scholar
Digital Library
- Chen W., Chow J.-H., Fuh Y.-C., Grandbois J., Jou M., Mattos N., Tran B., Wang Y.: High Level Indexing of User- Defined Types. Proc. 25th Int. Conf. on Very Large Databases (VLDB), 554--564, 1999. Google ScholarDigital Library
- Deutsch P.: RFC1951, DEFLATE Compressed Data Format Specification. http://rfc.net/rfc1951.html, 1996. Int. Conf. on Data Engineering (ICDE), 91--100, 2000.Google Scholar
- Freytag J.-C., Flasza M., Stillger M.: Implementing Geospatial Operations in an Object-Relational Database System. Proc. 12th Int. Conf. on Scientific and Statistical Database Management (SSDBM): 209--219, 2000. Google ScholarDigital Library
- Faloutsos C., Jagadish H. V., Manolopoulos Y.: Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyperrectangles. IEEE TKDE 9(3): 373--383, 1997. Google ScholarDigital Library
- Gaede V.: Optimal Redundancy in Spatial Database Systems. Proc. 4th Int. Symp. on Large Spatial Databases (SSD), LNCS 951: 96--116, 1995. Google ScholarDigital Library
- Gaede V., Gunther O.: Multidimensional Access Methods. ACM Computing Surveys 30(2): 170--231, 1998. Google ScholarDigital Library
- Guttman A.: R-trees: A Dynamic Index Structure for Spatial Searching. Proc. ACM SIGMOD Int. Conf. on Management of Data, 47--57, 1984. Google ScholarDigital Library
- Hirvola H.: HA archiver source code, http://sunsite.unc.edu/pub/Linux/utils/compress/ha0999plinux.tar.gz, 1995.Google Scholar
- IBM Corp.: IBM DB2 Universal Database Application Development Guide, Version 6. Armonk, NY, 1999.Google Scholar
- Informix Software, Inc.: DataBlade Developers Kit User's Guide, Version 3.4. Menlo Park, CA, 1998.Google Scholar
- Kriegel H.-P., Kunath P., Pfeifle M., Renz M.: Acceleration of Relational Index Structures Based on Statistics. Proc. 15th Int. Conf. on Scientific and Statistical Database Management (SSDBM), 2003 Google ScholarDigital Library
- Kriegel H.-P., Pfeifle M., Pötke M., Seidl T.: A Cost Model for Interval Intersection Queries on RI-Trees, Proc. 14th Int. Conf. on Scientific and Statistical Database Management (SSDBM), Edinburgh, Scotland, 2002, pp. 131--141. Google ScholarDigital Library
- Kriegel H.-P., Pötke M., Seidl T.: Managing Intervals Efficiently in Object-Relational Databases. Proc. 26th Int. Conf. on Very Large Databases (VLDB), 407--418, 2000. Google ScholarDigital Library
- Kriegel H.-P., Pötke M., Seidl T.: Interval Sequences: An Object-Relational Approach to Manage Spatial and Temporal Data. Proc. 7th Int. Symposium on Spatial and Temporal Databases (SSTD), LNCS 2121: 481--501, 2001. Google ScholarDigital Library
- Lempel A., Ziv J.: A Universal Algorithm for Sequential Data Compression. IEEE Transactions on Information Theory, Vol. IT-23, No. 3, 337--343, 1977.Google Scholar
- Moon B., Jagadish H. V., Faloutsos C., Saltz J. H.: Analysis of the Clustering Properties of Hilbert Space-filling Curve. Tech. Rep. CS-TR-3611, University of Maryland, 1996. Google ScholarDigital Library
- Manolopoulos Y., Theodoridis Y., Tsotras V. J.: Advanced Database Indexing. Boston, MA: Kluwer, 2000. Google ScholarDigital Library
- Oracle Corp.: Oracle8i Data Cartridge Developer's Guide, Release 2 (8.1.6). Redwood Shores, CA, 1999.Google Scholar
- Orenstein J. A.: Redundancy in Spatial Databases. Proc. ACM SIGMOD Int. Conf. on Management of Data, 294--305, 1989. Google ScholarDigital Library
- Roth M., Van Horn S.: Database Compression. SIGMOD Record 22(3): 31--39, 1993 Google ScholarDigital Library
- Ravi Kanth K. V., Ravada S., Sharma J., Banerjee J.: Indexing Medium-dimensionality Data in Oracle. Proc. ACM SIGMOD Int. Conf. on Management of Data: 521--522, 1999. Google ScholarDigital Library
- Stonebraker M., Frew J., Gardels K., Meredith J.: The SEQUOIA 2000 Storage Benchmark. In Proc. ACM SIGMOD Int. Conf. on Management of Data: 1993 Google ScholarDigital Library
- Srinivasan J., Murthy R., Sundara S., Agarwal N., DeFazio S.: Extensible Indexing: A Framework for Integrating Domain-Specific Indexing Schemes into Oracle8i. Proc. 16th Int. Conf. on Data Engineering (ICDE), 91--100, 2000. Google ScholarDigital Library
- Steinmetz R., Nahrstedt K.: Multimedia Fundamentals, Volume 1: Media Coding and Content Processing, Second Edition. Prentice Hall, 110--119, 2002.Google Scholar
- Witten I., Neal R., Cleary J.: Arithmetic coding for data compression, Communications of the ACM 30(6), 1987, 520--540. Google ScholarDigital Library
Index Terms
- Object-relational management of complex geographical objects
Recommendations
Towards the Maturity of Object-Relational Database Technology: Promises and Reality
Object-relational technology provides a significant increase in scalability and flexibility over the traditional relational databases. The additional object-relational features are particularly satisfying for advanced database applications that ...
Storing and querying GML in object-relational databases
GIS '06: Proceedings of the 14th annual ACM international symposium on Advances in geographic information systemsGML has become the de facto standard for electronic spatial data exchange among the applications of Web and distributed geographic information systems (GISs). As more and more geographical data is presented in GML, it is necessary to develop techniques ...
P3 Process for Object-Relational Data Migration to NoSQL Document-Oriented Datastore
The exponential growth of complex data in object-relational databases (ORDB) raises the need for efficient storage with scalability, consistency, and partition tolerance. The migration towards NoSQL (not only structured query language) datastores is ...
Comments