Journal Article10.1023/A:1019256828670
Window Query Processing in Linear Quadtrees
Ashraf Aboulnaga,Walid G. Aref +1 more
TL;DR: An algorithm and a cost model are presented for processing window queries in linear quadtrees that can handle query windows of any shape in the general case of spatial databases with overlapping objects.
read more
Abstract: The linear quadtree is a spatial access method that is built by decomposing the spatial objects in a database into quadtree blocks and storing these quadtree blocks in a B-tree. The linear quadtree is very useful for geographic information systems because it provides good query performance while using existing B-tree implementations. An algorithm and a cost model are presented for processing window queries in linear quadtrees. The algorithm can handle query windows of any shape in the general case of spatial databases with overlapping objects. The algorithm recursively decomposes the space into quadtree blocks, and uses the quadtree blocks overlapping the query window to search the B-tree. The cost model estimates the I/O cost of processing window queries using the algorithm. The cost model is also based on a recursive decomposition of the space, and it uses very simple parameters that can easily be maintained in the database catalog. Experiments with real and synthetic data sets verify the accuracy of the cost model.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Indexing spatial data with a quadtree index having cost-based query decomposition
Ivan T. Bowman,David Edward De Haan +1 more
- 23 Dec 2010
TL;DR: In this paper, an approach for indexing and retrieving spatial data with a B-tree index in database management systems is described, where data objects are stored without decomposition within a linearized quadtree stored within a Btree index.
52
High-performance quadtree constructions on large-scale geospatial rasters using GPGPU parallel primitives
Jianting Zhang,Simin You +1 more
TL;DR: A parallel, primitive-based approach to quadtree construction is proposed by transforming a multidimensional geospatial computing problem into chaining a set of generic parallel primitives that are designed for one-dimensional (1D) arrays.
•Posted Content
Efficient Spatial Keyword Search in Trajectory Databases
TL;DR: This paper proposes one novel method for efficiently computing top-$k$ trajectories based on a new hybrid index, cell-keyword conscious B$^+$-tree, denoted by \cellbtree, which enables it to exploit both text relevance and location proximity to facilitate efficient and effective query processing.
Indexing large-scale raster geospatial data using massively parallel GPGPU computing
Jianting Zhang,Simin You,Le Gruenwald +2 more
- 02 Nov 2010
TL;DR: A cache conscious quadtree data structure (CCQ-Tree) that is suitable for GPU indexing of large-scale raster geospatial data using GPGPU computing is designed.
Patent
Data caching for mobile applications
Lance Waterman,Michael Ho,Brian Keith Lorenz,Evan Ireland,Hemal Pandya +4 more
- 14 Apr 2010
TL;DR: In this article, the authors describe a system for data caching and cache synchronization, which includes comparing data in a cache with data stored at a data source and determining database operations needed to synchronize one or more partitions of the cache with the data source.
20
References
R-trees: a dynamic index structure for spatial searching
Antonin Guttman
- 01 Jun 1984
TL;DR: A dynamic index structure called an R-tree is described which meets this need, and algorithms for searching and updating it are given and it is concluded that it is useful for current database systems in spatial applications.
8K
The Quadtree and Related Hierarchical Data Structures
TL;DR: L'accentuation est mise sur la representation de donnees dans les applications de traitement d'images, d'infographie, les systemes d'informations geographiques and the robotique.
Ubiquitous B-Tree
TL;DR: The major variations of the B-tree are discussed, especially the B+-tree, contrasting the merits and costs of each implementation and illustrating a general purpose access method that uses a B- tree.
2.1K
Linear clustering of objects with multiple attributes
H. V. Jagadish
- 01 May 1990
TL;DR: A mapping based on Hilbert's space-filling curve is presented, which out-performs previously proposed mappings on average over a variety of different operating conditions.
Related Papers (5)
Hanan Samet,Jim Gray +1 more
- 22 Aug 2006
Alan Berrey,Aaron Heiner +1 more
- 22 Sep 2006
Rainer Brendle,Frank Brunswig +1 more
- 20 Jul 2004