Design an Efficient Top-K Query Retrieval Technique for GIQ problems
DOI:
https://doi.org/10.53555/nncse.v2i5.446Keywords:
Design, Efficient, Top-k Query, Retrieval, Technique, GIQ problemsAbstract
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.
References
G. Navarro and L. M. Russo, "Space-efficient data-analysis queries on grids," in Algorithms and Computation, ed: Springer, 2011, pp.
-332.
A. Yu, P. K. Agarwal, and J. Yang, "Processing and notifying range top-k subscriptions," in Data Engineering (ICDE), 2012 IEEE 28th International Conference on, 2012, pp. 810-821.
C. Sheng and Y. Tao, "Dynamic top-k range reporting in external memory," in Proceedings of the 31st symposium on Principles of
Database Systems, 2012, pp. 121-130.
S. Rahul, P. Gupta, R. Janardan, and K. Rajan, "Efficient top-k queries for orthogonal ranges," in WALCOM: Algorithms and
Computation, ed: Springer, 2011, pp. 110-121.
T. Gagie, S. J. Puglisi, and A. Turpin, "Range quantile queries: Another virtue of wavelet trees," in String Processing and Information Retrieval, 2009, pp. 1-6.
C. Sheng and Y. Tao, "New results on two-dimensional orthogonal range aggregation in external memory," in Proceedings of the
thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2011, pp. 129-139
Downloads
Published
Issue
Section
License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.