SQR-tree: A spatial index using semi-quantized MBR compression scheme in R-tree

Jongwan Kim, SeokJin Im, Sang Won Kang, Chong Sun Hwang, Sang-Geun Lee

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The increase in spatial data for location-based service (LBS) in mobile computing or geographic information system (GIS) has led to more research on spatial indexing, such as R-tree. Nevertheless, few studies have attempted to improve performance by reducing the size of the index. If the minimal bounding rectangles (MBRs) that represent objects in R-tree are compressed, the index size is reduced and location-based services are provided to the user more rapidly. This study proposes a new MBR compression scheme using MBR semi-quantization (SqMBR) scheme and SQR-tree, which indexes spatial data using R-tree. Since the SqMBR scheme decreases the size of MBR keys, halves the enlargement of a quantized MBR (QMBR), and increases node utilization, it improves the overall search performance. This scheme decreases quantized space more than existing quantization schemes. The SqMBR scheme increases the utilization of disk allocation units. In spatial index, a greater number of node entries lowers tree heights and decreases the number of node accesses, thereby shrinking disk input/output. This study analyzes the number of node accesses mathematically and evaluates the performance of SQR-tree using real location data. The results show that the proposed index performs better than existing MBR compression schemes.

Original languageEnglish
Pages (from-to)1541-1563
Number of pages23
JournalJournal of Information Science and Engineering
Volume23
Issue number5
Publication statusPublished - 2007 Sep 1

Fingerprint

Location based services
Mobile computing
Geographic information systems
utilization
performance
indexing
information system

Keywords

  • Index compression
  • Index packing
  • Location-based services
  • Minimum bounding rectangle
  • Quantization
  • R-tree
  • Spatial index

ASJC Scopus subject areas

  • Information Systems

Cite this

SQR-tree : A spatial index using semi-quantized MBR compression scheme in R-tree. / Kim, Jongwan; Im, SeokJin; Kang, Sang Won; Hwang, Chong Sun; Lee, Sang-Geun.

In: Journal of Information Science and Engineering, Vol. 23, No. 5, 01.09.2007, p. 1541-1563.

Research output: Contribution to journalArticle

Kim, Jongwan ; Im, SeokJin ; Kang, Sang Won ; Hwang, Chong Sun ; Lee, Sang-Geun. / SQR-tree : A spatial index using semi-quantized MBR compression scheme in R-tree. In: Journal of Information Science and Engineering. 2007 ; Vol. 23, No. 5. pp. 1541-1563.
@article{e324b0e23dfa410e9263b09588958654,
title = "SQR-tree: A spatial index using semi-quantized MBR compression scheme in R-tree",
abstract = "The increase in spatial data for location-based service (LBS) in mobile computing or geographic information system (GIS) has led to more research on spatial indexing, such as R-tree. Nevertheless, few studies have attempted to improve performance by reducing the size of the index. If the minimal bounding rectangles (MBRs) that represent objects in R-tree are compressed, the index size is reduced and location-based services are provided to the user more rapidly. This study proposes a new MBR compression scheme using MBR semi-quantization (SqMBR) scheme and SQR-tree, which indexes spatial data using R-tree. Since the SqMBR scheme decreases the size of MBR keys, halves the enlargement of a quantized MBR (QMBR), and increases node utilization, it improves the overall search performance. This scheme decreases quantized space more than existing quantization schemes. The SqMBR scheme increases the utilization of disk allocation units. In spatial index, a greater number of node entries lowers tree heights and decreases the number of node accesses, thereby shrinking disk input/output. This study analyzes the number of node accesses mathematically and evaluates the performance of SQR-tree using real location data. The results show that the proposed index performs better than existing MBR compression schemes.",
keywords = "Index compression, Index packing, Location-based services, Minimum bounding rectangle, Quantization, R-tree, Spatial index",
author = "Jongwan Kim and SeokJin Im and Kang, {Sang Won} and Hwang, {Chong Sun} and Sang-Geun Lee",
year = "2007",
month = "9",
day = "1",
language = "English",
volume = "23",
pages = "1541--1563",
journal = "Journal of Information Science and Engineering",
issn = "1016-2364",
publisher = "Institute of Information Science",
number = "5",

}

TY - JOUR

T1 - SQR-tree

T2 - A spatial index using semi-quantized MBR compression scheme in R-tree

AU - Kim, Jongwan

AU - Im, SeokJin

AU - Kang, Sang Won

AU - Hwang, Chong Sun

AU - Lee, Sang-Geun

PY - 2007/9/1

Y1 - 2007/9/1

N2 - The increase in spatial data for location-based service (LBS) in mobile computing or geographic information system (GIS) has led to more research on spatial indexing, such as R-tree. Nevertheless, few studies have attempted to improve performance by reducing the size of the index. If the minimal bounding rectangles (MBRs) that represent objects in R-tree are compressed, the index size is reduced and location-based services are provided to the user more rapidly. This study proposes a new MBR compression scheme using MBR semi-quantization (SqMBR) scheme and SQR-tree, which indexes spatial data using R-tree. Since the SqMBR scheme decreases the size of MBR keys, halves the enlargement of a quantized MBR (QMBR), and increases node utilization, it improves the overall search performance. This scheme decreases quantized space more than existing quantization schemes. The SqMBR scheme increases the utilization of disk allocation units. In spatial index, a greater number of node entries lowers tree heights and decreases the number of node accesses, thereby shrinking disk input/output. This study analyzes the number of node accesses mathematically and evaluates the performance of SQR-tree using real location data. The results show that the proposed index performs better than existing MBR compression schemes.

AB - The increase in spatial data for location-based service (LBS) in mobile computing or geographic information system (GIS) has led to more research on spatial indexing, such as R-tree. Nevertheless, few studies have attempted to improve performance by reducing the size of the index. If the minimal bounding rectangles (MBRs) that represent objects in R-tree are compressed, the index size is reduced and location-based services are provided to the user more rapidly. This study proposes a new MBR compression scheme using MBR semi-quantization (SqMBR) scheme and SQR-tree, which indexes spatial data using R-tree. Since the SqMBR scheme decreases the size of MBR keys, halves the enlargement of a quantized MBR (QMBR), and increases node utilization, it improves the overall search performance. This scheme decreases quantized space more than existing quantization schemes. The SqMBR scheme increases the utilization of disk allocation units. In spatial index, a greater number of node entries lowers tree heights and decreases the number of node accesses, thereby shrinking disk input/output. This study analyzes the number of node accesses mathematically and evaluates the performance of SQR-tree using real location data. The results show that the proposed index performs better than existing MBR compression schemes.

KW - Index compression

KW - Index packing

KW - Location-based services

KW - Minimum bounding rectangle

KW - Quantization

KW - R-tree

KW - Spatial index

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

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

M3 - Article

AN - SCOPUS:34948848064

VL - 23

SP - 1541

EP - 1563

JO - Journal of Information Science and Engineering

JF - Journal of Information Science and Engineering

SN - 1016-2364

IS - 5

ER -