Processing of Top-k Selection Queries in Relational Database System

Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 3

Abstract

 Abstract: In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typically a rank of the top-k tuples that best match the given attribute values. Focusing on the top-k items according to a ranking criterion constitutes an important functionality in many different query answering scenarios. The idea is to read only the necessary information mostly from secondary storage with the ultimate goal to achieve low latency. In this paper, we study the advantages and limitations of processing a top-k query by translating it into a single range query that traditional relational database management systems can process efficiently. In this work, we also consider processing such top-k queries under the constraint that the result items are members of a specific set, which is provided at query time it is also known as set-defined selection criterion.

Authors and Affiliations

Neha Singh , P. K. Pandey

Keywords

Related Articles

A Novel Approach For Data Hiding In Web Page Steganography Using Encryption With Compression Based Technique

Abstract: Cryptography, Steganography and Watermarking are three rudimentary techniques which will avail us to secure data from unauthorized access. Steganography is one of the best techniques to obnubilate messagefrom u...

 A survey on context aware system & intelligent Middleware’s

 Context aware system or Sentient system is the most profound concept in the ubiquitous computing. In the cloud system or in distributed computing building a context aware system is difficult task and programmer...

 Methods Migration from On-premise to Cloud

 Abstract: Cloud computing is evolving as a key computing platform for sharing resources that includeinfrastructures, software, applications, and business. An increasing number of companies are expected tomigrate th...

 A Novel Approach to Design a Customized Image Editor and Real-Time Control of Hand-Gesture Mimicking Robotic Movements on an I-Robot Create

 Abstract: Image processing and computer vision are considered as one of the most promising as well as exciting domains of modern day engineering. Equipped with concepts of artificial intelligence and some very adva...

 Information technology implementation for educationaldevelopment of rural India – A review

 Abstract : India as a developing country is on its path of revolution in every aspect. But the poor economy andlow per capita income of families in India affects the quality of education. As India comprises 70% of...

Download PDF file
  • EP ID EP88648
  • DOI 10.9790/0661-16375460
  • Views 130
  • Downloads 0

How To Cite

Neha Singh, P. K. Pandey (2014).  Processing of Top-k Selection Queries in Relational Database System. IOSR Journals (IOSR Journal of Computer Engineering), 16(3), 54-60. https://europub.co.uk/articles/-A-88648