Abstract
Efficient management of spatial data is becoming more and more important and for very large sets of 2-dimensional data, secondary memory data representations are required. An important class of queries for spatial data are those that extract a subset of the data: they are called window queries (also region or range queries). In this paper we propose and analyze the hybrid linear quadtree for the efficient secondary memory processing of three kinds of window queries, namely the exist, the report and the select query. In particular we show that it is possible to answer to all the above queries for multiple non-overlapping features with a number of accesses to secondary memory never greater than the number of pixels inside the window. More precisely, we prove that for a window of size n×n in a feature space (e.g., an image) of size T×T (e.g., pixel elements) using the hybrid linear quadtree the exist and report query can be answered with O(nlog r T) accesses to secondary storage, while the select query can be answered with O(nlog r T+n 2/r) accesses to secondary storage. This is an improvement in worstcase time complexity over previous results [Nar93] and shows that multiple nonoverlapping features (i.e., coloured images) can be treated with the same I/O complexity as single features (i.e., black and white images).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D.J. Abel, A B+-tree Structure for Large Quadtrees, in Computer Vision, Graphics and Image Processing 27, 1 (July 1984), pp. 19–31.
W.G. Aref and H.Samet, Efficient processing of Window Queries in the Pyramid Data Structure, in Proc. of the Ninth ACM-SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, Nashville, TN, April 1990, pp.265–272.
W.G. Aref and H.Samet, An Efficient Window Retrieval Algorithm for Spatial Query Processing, Technical Report n∘ 2866 of Computer Science Department, University of Maryland, March 1992.
N. Beckmann, H. Kriegel, R. Schneider and B. Seeger, The R*-tree: an Efficient and Robust Access Method for Points and Rectangles, in Proc. of the ACM SIGMOD Int. Conf. on Management of Data, Atlantic City, NJ, 1990, pp. 322–331.
C.R.Dyer, The space efficiency of quadtrees, Computer Graphics and Image Processing, 19(4):335–348, August 1982.
M.J. Egenhofer, What's special about Spatial: Database Requirements for Vehicle Navigation in Geographic Space, Session on Database Challenges in Proc. of ACM Sigmod Int. Conf. on Management of Data, Washington DC, 1993,pp.398–402.
C. Faloutsos, T. Sellis and N. Roussopoulos, Analysis of Object Oriented Spatial Access Methods, in Proc. of the SIGMOD Conf., San Francisco, May 1987, pp. 426–439.
I. Gargantini,.An Effective Way to Represent Quadtrees, Comm. of the ACM, Vol. 25, No. 12, 1982, pp. 905–910.
O. Günther, The Design of the Cell Tree: An Object Oriented Index Structure for Geometric Databases, in Proc. of the Fifth IEEE Int. Conf. on Data Engineering, Los Angeles, CA, February 1989, pp. 598–605.
O. Gunther, O. Buchmann and A. Buchmann, Research Issues in Spatial Databases, SIGMOD RECORD, Vol. 19, No. 4, December 1990, pp. 61–68.
A. Guttman, R-Trees: a Dynamic Index Structure for Spatial Searching, in Proc. of the SIGMOD Conf., Boston, June 1984, pp. 47–57.
P. Kanellakis, S. Ramaswamy, D. Vengroff and J. Vitter, Indexing for Data Models with Constraints and Classes, in Proc. of the 12th ACM Symp. on Principles of Database Systems, Washington, DC, May 1993, pp. 233–243
E. Kawaguchi, T. Endo and M Yokota, Depth-first Expression Viewed from Digital Picture Processing, in IEEE Trans. on Pattern Analysis and Machine Intelligence, July 1983, pp. 373–384.
D.E.Knuth, The art of computer programming, Vol.3: sorting and searching, Addison-Wesley, Reading, MA, 1973.
E. Nardelli and G. Proietti, Efficient Secondary Memory Processing of Window Queries on Spatial Data, in Eigth Int. Symposium on Computer and Information Sciences, Antalya, Turkey, November 1993.
J. Nievergelt, H. Hinterberger and K.C. Sevcik, The Grid File: an Adaptable. Symmetric, Multikey File Structure, ACM Trans. on Database Systems 9, March 1984, pp. 38–71.
H. Samet, The Quadtree and Related Hierarchical Data Structures, in Computing Surveys, Vol. 16, No. 2, June 1984, pp. 187–260.
H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading, MA, 1989.
C.A.Shaffer, A formula for computing the number of quadtree node fragments created by a shift, Pattern Recognition Letters, 7(1):45–49, January 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nardelli, E., Proietti, G. (1994). A hybrid pointerless representation of quadtrees for efficient processing of window queries. In: Nievergelt, J., Roos, T., Schek, HJ., Widmayer, P. (eds) IGIS '94: Geographic Information Systems. IGIS 1994. Lecture Notes in Computer Science, vol 884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58795-0_53
Download citation
DOI: https://doi.org/10.1007/3-540-58795-0_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58795-8
Online ISBN: 978-3-540-49105-7
eBook Packages: Springer Book Archive