Design an Efficient Top-K Query Retrieval Technique for GIQ problems release_5jyngfxy4zaj7atx2zyst4wxqm

by V. Kumaresan, S. Vairachilai

Published in Journal of advance research in computer science & enigneering by Green Publication.

2015   p01-06

Abstract

In a given geometric objects, set of objects are retrieved as results for the given query. The problem is defined as geometric query intersection problem. The problem defines that, for the given user query, all the relevant results which are intersected by the query are showed as output. Because of the large number results, it occupies the huge memory space. For that here we propose a solution that we show the top-k results as the output where k is the integer. This paper gives a general technique to solve any top-k GIQ problem efficiently. The technique relies only on the availability of an efficient solution for the underlying (non-top-k) GIQ problem, which is often the case. Using this, asymptotically efficient solutions are derived for several top-k GIQ problems, including top-k orthogonal and circular range search, point enclosure search, half space range search, etc. Implementations of some of these solutions, using practical data structures, show that they are quite efficient in practice. This paper also does a formal investigation of the hardness of the top-k GIQ problem, which reveals interesting connections between the top-k GIQ problem and the underlying (non-top-k) GIQ problem. In our proposed system we are going to perform multiple query processing. Because in the existing approach it can able to process only one query at the time. But in our proposed work we process multiple queries at the time.
In application/xml+jats format

Archived Files and Locations

application/pdf  306.8 kB
file_opvsyuot3vaohjkkn3obf2x3ny
nnpub.org (publisher)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2015-05-31
Journal Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  2456-3552
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 3b205694-a22a-49db-bd3d-989d579610cb
API URL: JSON