Window query processing in linear quadtrees

Ashraf Aboulnaga, Walid G. Aref

Research output: Contribution to journalArticle

7 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)111-126
Number of pages16
JournalDistributed and Parallel Databases
Volume10
Issue number2
DOIs
Publication statusPublished - 1 Sep 2001
Externally publishedYes

Fingerprint

Quadtree
Query processing
Query Processing
Cost Model
B-tree
Query
Costs
Overlapping
Processing
Geographic information systems
Decompose
Spatial Database
Geographic Information Systems
Synthetic Data
Decomposition
Cost model
Verify
Data base
Experiments
Estimate

Keywords

  • GIS
  • Quadtrees
  • Spatial access methods
  • Spatial databases
  • Window queries

ASJC Scopus subject areas

  • Information Systems
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Window query processing in linear quadtrees. / Aboulnaga, Ashraf; Aref, Walid G.

In: Distributed and Parallel Databases, Vol. 10, No. 2, 01.09.2001, p. 111-126.

Research output: Contribution to journalArticle

Aboulnaga, Ashraf ; Aref, Walid G. / Window query processing in linear quadtrees. In: Distributed and Parallel Databases. 2001 ; Vol. 10, No. 2. pp. 111-126.
@article{8e146a68257847b3b8eb40bdfc807674,
title = "Window query processing in linear quadtrees",
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.",
keywords = "GIS, Quadtrees, Spatial access methods, Spatial databases, Window queries",
author = "Ashraf Aboulnaga and Aref, {Walid G.}",
year = "2001",
month = "9",
day = "1",
doi = "10.1023/A:1019256828670",
language = "English",
volume = "10",
pages = "111--126",
journal = "Distributed and Parallel Databases",
issn = "0926-8782",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - Window query processing in linear quadtrees

AU - Aboulnaga, Ashraf

AU - Aref, Walid G.

PY - 2001/9/1

Y1 - 2001/9/1

N2 - 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.

AB - 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.

KW - GIS

KW - Quadtrees

KW - Spatial access methods

KW - Spatial databases

KW - Window queries

UR - http://www.scopus.com/inward/record.url?scp=0035452740&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035452740&partnerID=8YFLogxK

U2 - 10.1023/A:1019256828670

DO - 10.1023/A:1019256828670

M3 - Article

VL - 10

SP - 111

EP - 126

JO - Distributed and Parallel Databases

JF - Distributed and Parallel Databases

SN - 0926-8782

IS - 2

ER -