Copyright ACM, 2000

SAC2000 Como, Italy 2000

A PERFORMANCE COMPARISON OF QUADTREE-BASED
ACCESS METHODS FOR THEMATIC MAPS

Eleni Tousidou & Yannis Manolopoulos
Data Engineering Lab
Department of Informatics
Aristotle University
54006 Thessaloniki, Greece
email: {eleni,manolopo}@delab.csd.auth.gr

Abstract:

In this paper, the efficient manipulation of thematic maps that contain multiple non-overlapping features is investigated. New methods based on Linear quadtrees are proposed and their performance is compared to that of similar structures. More specifically, window queries involving multiple features are described and tested having the number of disk accesses as a performance measure. Experimentally, it is shown that the proposed methods have a stable behavior and, in general, outperform the previous structures with respect to time and space complexity.

Keywords

spatial databases, region quadtrees, multiple features, superimposed bitstrings, window queries

Copyright 2000 ACM

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and or fee.
SAC 2000 March 19-21 Como, Italy
(c) 2000 ACM 1-58113-239-5/00/003>...>$5.00