Efficient Approximate Algorithms To Estimate The Sr Score For Queries Over Databases

Abstract

One necessitates province information about the data sets to enlarge idea of clearness score for queries over databases. Each subject in a database encloses the units that are about a similar subject. It is in general hard to identify a formula that partitions entities into topics as it necessitates finding a successful similarity function between entities. Such parallel function depends chiefly on the domain knowledge and thoughtful users’ preferences. In this paper, we analyze the description of hard queries and propose a novel framework to determine the degree of obscurity for a keyword query over a database, bearing in mind both the structure and the content of the database and the query results.

Authors and Affiliations

N. Durga Deepti Priya, CH. S. V. V. S. N. Murty

Keywords

Related Articles

A Proposed System and Scheduling Algorithm for Grid based Indian Rural health Care

This paper focusses on proposing a system for grid based health care center. The paper dicusses the importance of health care center and grid computing. It also focusses on the proposed sytem architecture for the sys...

Heterogeneous Framework for Indian Cybercrime Cases

The internet has served as the global language of the virtual world since the beginning of the digital world and the Internet in India is increasing rapidly .Internet served seriously in many more areas in current sc...

Secure Authentication Schemes

There are different authentication methods to provide security. The most commonly used are textual passwords, but are commonly susceptible to brute -force attacks. Recognition and Recall-based techniques on graphical...

A Novel Model and Efficient Topic Extraction for Travel Package Recommendation

The new concept recommendation system is applying in many applications.in this project explore the online travel information of tourists to provide personalized travel package. But traditional recommendation system c...

A Lightweight Routing Approach for In-Network Aggregation in Wireless Sensor Networks

Wireless sensor networks (WSNs) have sensing, computation and communications capabilities. Energy conservation is a key issue in WSN. Redundant data can be aggregated at intermediate nodes which can reduce the size a...

Download PDF file
  • EP ID EP28276
  • DOI -
  • Views 300
  • Downloads 3

How To Cite

N. Durga Deepti Priya, CH. S. V. V. S. N. Murty (2015). Efficient Approximate Algorithms To Estimate The Sr Score For Queries Over Databases. International Journal of Research in Computer and Communication Technology, 4(10), -. https://www.europub.co.uk/articles/-A-28276