Exploiting hashing for concurrent query processing and indexing of current location of moving objects

Summary Due to recent developments in location‐based services and mobile computing, the need for indices for moving objects has been strengthened to improve the response time of a query operation. With a single index in place for managing both the update and query operations for moving objects, the...

Full description

Saved in:
Bibliographic Details
Published in:Concurrency and computation Vol. 36; no. 11
Main Authors: Chaudhry, Natalia, Yousaf, Muhammad Murtaza
Format: Journal Article
Language:English
Published: Hoboken Wiley Subscription Services, Inc 15.05.2024
Subjects:
Algorithms
Concurrency
Concurrency control
mobile
Mobile computing
Object motion
Queries
Query processing
real‐time
Response time (computers)
ISSN:1532-0626, 1532-0634
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Summary Due to recent developments in location‐based services and mobile computing, the need for indices for moving objects has been strengthened to improve the response time of a query operation. With a single index in place for managing both the update and query operations for moving objects, the index needs to be updated each time the object moves. This deteriorates the performance of concurrent query operations. It is critical to handle the conflicts between continuous update and query operations effectively using appropriate concurrency control protocol otherwise, inconsistent results will be reported. Many indices have been proposed in the literature for moving objects but they lack the support for processing concurrent operations. Further, the consistent indices in the literature are based on tree structure that have computationally expensive split/merge operations that can negatively affect the response time of query processing algorithms. Moreover such tree based indices are proposed for historical and future timeline data. As the scope of this article is on current timeline and concurrent continuous query operations, therefore, we exploit state of the art hash‐based indices in the literature and presented the two consistent versions. The comparative analysis of the indices is performed and meaningful findings are also presented along.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.8013