An Efficient PAB-Based Query Indexing for Processing Continuous Queries on Moving Objects

Existing methods to process continuous range queries are not scalable. In particular, as the number of continuous range queries on a large number of moving objects becomes larger, their performance degrades significantly. We propose a novel query indexing method called the projected attribute bit (P...

Full description

Saved in:
Bibliographic Details
Published inETRI journal Vol. 29; no. 5; pp. 691 - 693
Main Authors Jang, Su-Min, Song, Seok-Il, Yoo, Jae-Soo
Format Journal Article
LanguageKorean
Published 한국전자통신연구원 01.10.2007
ETRI
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Existing methods to process continuous range queries are not scalable. In particular, as the number of continuous range queries on a large number of moving objects becomes larger, their performance degrades significantly. We propose a novel query indexing method called the projected attribute bit (PAB)-based query index. We project a two-dimensional continuous range query on each axis to get two one-dimensional bit lists. Since the queries are transformed to bit lists and query evaluation is performed by bit operations, the storage cost of indexing and query evaluation time are reduced significantly. Through various experiments, we show that our method outperforms the containment-encoded squares-based indexing method, which is one of the most recently proposed methods.
Bibliography:KISTI1.1003/JNL.JAKO200771242946692
G704-001110.2007.29.5.020
ISSN:1225-6463
2233-7326