UGC Approved Journal no 63975(19)
New UGC Peer-Reviewed Rules

ISSN: 2349-5162 | ESTD Year : 2014
Volume 13 | Issue 3 | March 2026

JETIREXPLORE- Search Thousands of research papers



WhatsApp Contact
Click Here

Published in:

Volume 6 Issue 2
February-2019
eISSN: 2349-5162

UGC and ISSN approved 7.95 impact factor UGC Approved Journal no 63975

7.95 impact factor calculated by Google scholar

Unique Identifier

Published Paper ID:
JETIR1902E39


Registration ID:
312124

Page Number

1682-1693

Share This Article


Jetir RMS

Title

Tracery and Epithet system with scheduling for contention aware kNN query

Abstract

The smart transportation systems, e.G., DiDi, Uber, have served as essential travel equipment for customers, which foster lots of research for the location-based totally queries on street network. In particular, given a set O of items and a question point q on a avenue network, the okay Nearest Neighbour (kNN) query returns the k nearest objects in O with the shortest road community distance to q. In literature, maximum existing answers for kNN queries tend to reduce the question time, indexing storage, or throughput of the kNN queries even as overlooking the correctness of the queries resulting from question-query and update-query conflicts. In our work, we endorse a grid- primarily based framework on war-aware kNN queries on moving objects which ambitions to optimize machine throughput at the same time as ensuring question correctness. In particular, we first suggest green index systems and new question algorithms that significantly enhance the throughput. We similarly present novel scheduling algorithms that aim to avoid conflicts and enhance the system throughput. Moreover, we devise approximate answers that provide a controllable trade-off among the warfare of kNN queries and device throughput. Finally, we suggest a cost-primarily based dispatching strategy to assign the kNN effects to the corresponding queries. Extensive experiments on real-world facts show the effectiveness and efficiency of our proposed answers over alternatives.

Key Words

Serialisable kNN Query, Conflict-aware Scheduling, Cost-based Dispatching, Constrained Minimum Bipartite Matching.

Cite This Article

"Tracery and Epithet system with scheduling for contention aware kNN query", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 2, page no.1682-1693, February-2019, Available :http://www.jetir.org/papers/JETIR1902E39.pdf

ISSN


2349-5162 | Impact Factor 7.95 Calculate by Google Scholar

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 7.95 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Cite This Article

"Tracery and Epithet system with scheduling for contention aware kNN query", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 2, page no. pp1682-1693, February-2019, Available at : http://www.jetir.org/papers/JETIR1902E39.pdf

Publication Details

Published Paper ID: JETIR1902E39
Registration ID: 312124
Published In: Volume 6 | Issue 2 | Year February-2019
DOI (Digital Object Identifier):
Page No: 1682-1693
Country: -, -, India .
Area: Engineering
ISSN Number: 2349-5162
Publisher: IJ Publication


Preview This Article


Downlaod

Click here for Article Preview

Download PDF

Downloads

000520

Print This Page

Current Call For Paper

Jetir RMS