ACM Home Page
Please provide us with feedback. Feedback
Object-relational management of complex geographical objects
Full text PdfPdf (192 KB)
Source Geographic Information Systems archive
Proceedings of the 12th annual ACM international workshop on Geographic information systems table of contents
Washington DC, USA
SESSION: Query processing and optimization table of contents
Pages: 109 - 117  
Year of Publication: 2004
ISBN:1-58113-979-9
Authors
Hans-Peter Kriegel  University of Munich, Munich, GERMANY
Peter Kunath  University of Munich, Munich, GERMANY
Martin Pfeifle  University of Munich, Munich, GERMANY
Matthias Renz  University of Munich, Munich, GERMANY
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 41,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1032222.1032240
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
Deutsch P.: RFC1951, DEFLATE Compressed Data Format Specification. http://rfc.net/rfc1951.html, 1996. Int. Conf. on Data Engineering (ICDE), 91--100, 2000.
 
4
 
5
 
6
7
8
 
9
Hirvola H.: HA archiver source code, http://sunsite.unc.edu/pub/Linux/utils/compress/ha0999plinux.tar.gz, 1995.
 
10
IBM Corp.: IBM DB2 Universal Database Application Development Guide, Version 6. Armonk, NY, 1999.
 
11
Informix Software, Inc.: DataBlade Developers Kit User's Guide, Version 3.4. Menlo Park, CA, 1998.
 
12
 
13
 
14
 
15
 
16
Lempel A., Ziv J.: A Universal Algorithm for Sequential Data Compression. IEEE Transactions on Information Theory, Vol. IT-23, No. 3, 337--343, 1977.
 
17
 
18
 
19
Oracle Corp.: Oracle8i Data Cartridge Developer's Guide, Release 2 (8.1.6). Redwood Shores, CA, 1999.
20
21
22
23
 
24
 
25
Steinmetz R., Nahrstedt K.: Multimedia Fundamentals, Volume 1: Media Coding and Content Processing, Second Edition. Prentice Hall, 110--119, 2002.
26


Collaborative Colleagues:
Hans-Peter Kriegel: colleagues
Peter Kunath: colleagues
Martin Pfeifle: colleagues
Matthias Renz: colleagues