A hash-based index for processing frequent updates and continuous location-based range queries

Chaudhry, Natalia; Yousaf, Muhammad Murtaza

doi:10.1007/s10115-023-01884-9

Cited by 1 publication

(4 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some research efforts have been seen in this regard, for example, U-Grid index, 46 fixed grid index (fGrid) 50 and LHashMov. 27 But, the proposed indices are not consistent. It is important to evaluate the index with respect to its support in handling the conflicts of a multi-user environment.…”

Section: Consistent Index Designmentioning

confidence: 96%

“…Otherwise comparing hash-based index with tree based index would not be a fair comparison as both the structures have their own performance and design concerns. Further, the existing solutions with tree-based indices work for historical data of moving objects (past trajectories); however, our primary focus is only on point-based current location of moving objects for which tree-based structures do not work 27 The rest of the document is organized as follows. Section 2 defines the problem statement.…”

Section: Current Timelinementioning

confidence: 99%

“…Thus, designing a performance effective solution demands a careful selection of data structure. 27,47 Hash table and grid based indices can overcome the discussed limitations of hierarchical indices. 28,48,49 Uniform index, parallel grid index, and LU (Luzy Update) grid index fall in grid-based indices category.…”

Section: Aspect 2: Data Structure Utilized In Indexingmentioning

confidence: 99%

“…Recently, hash table is utilized to effectively index moving objects 27,46,50,51 ; mitigating the limitations of computationally expensive split/merge operations in tree-based structures. However, the indices are proposed for single user environment and are not consistent.…”

Section: Aspect 2: Data Structure Utilized In Indexingmentioning

confidence: 99%

See 3 more Smart Citations

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

Chaudhry,

Yousaf

2024

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

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

show abstract

Section: Consistent Index Designmentioning

confidence: 96%

Section: Current Timelinementioning

confidence: 99%