To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Intze Overhead Water Tank Design by Working Stress - IS Method.pdf
2014 IEEE DOTNET DATA MINING PROJECT An empirical performance evaluation of relational keyword search systems
1. GLOBALSOFT TECHNOLOGIES
IEEE PROJECTS & SOFTWARE DEVELOPMENTS
IEEE FINAL YEAR PROJECTS|IEEE ENGINEERING PROJECTS|IEEE STUDENTS PROJECTS|IEEE
BULK PROJECTS|BE/BTECH/ME/MTECH/MS/MCA PROJECTS|CSE/IT/ECE/EEE PROJECTS
CELL: +91 98495 39085, +91 99662 35788, +91 98495 57908, +91 97014 40401
Visit: www.finalyearprojects.org Mail to:ieeefinalsemprojects@gmai l.com
AN EMPIRICAL PERFORMANCE EVALUATION OF
RELATIONAL KEYWORD SEARCH SYSTEMS
Abstract
In the past decade, extending the keyword search paradigm to relational data has been an
active area of research within the database and information retrieval (IR) community. A large
number of approaches have been proposed and implemented, but despite numerous publications,
there remains a severe lack of standardization for system evaluations. This lack of
standardization has resulted in contradictory results from Different evaluations and the numerous
discrepancies muddle what advantages are proffered by different approaches. In this Paper, we
present a thorough empirical performance evaluation of relational keyword search systems. Our
results indicate that many existing search techniques do not provide acceptable performance for
realistic retrieval tasks. In particular, memory consumption precludes many search techniques
from scaling beyond small datasets with tens of thousands of vertices. We also explore the
relationship between execution time and factors varied in previous evaluations; our analysis
indicates that these factors have relatively little impact on performance. In summary, our work
confirms previous claims regarding the unacceptable performance of these systems and
2. underscores the need for standardization—as exemplified by the IR community when evaluating
these retrieval systems.
Existing System:
In existing system, extending the keyword search paradigm to relational data has
been an active area of research within the database and information retrieval (IR) community. A
large number of approaches have been proposed and implemented, but despite numerous
publications, there remains a severe lack of standardization for system evaluations. This lack of
standardization has resulted in contradictory results from Different evaluations and the numerous
discrepancies muddle what advantages are proffered by different approaches.
Disadvantage:
» Keyword Search without ranking.
» Execution time is more.
Proposed System:
In proposed system, empirical performance evaluation of relational keyword search
systems. Our results indicate that many existing search techniques do not provide acceptable
performance for realistic retrieval tasks. In particular, memory consumption precludes many
search techniques from scaling beyond small datasets with tens of thousands of vertices. We also
explore the relationship between execution time and factors varied in previous evaluations; our
analysis indicates that these factors have relatively little impact on performance. In summary, our
work confirms previous claims regarding the unacceptable performance of these systems and
underscores the need for standardization as exemplified by the IR community when evaluating
these retrieval systems.
Advantage:
» Keyword Search with ranking.
» Execution Time consumption is less.
» File length and Execution time can be seen.
3. » Ranking can be seen by using chart.
Algorithms :
1. It results the files on basis of the file usage by Breadth-First algorithm.
2. Chart represents the ranking of the keyword searched by the user using Djikstra's shortest path
algorithm.
3. Keyword search is essential for computing the results quickly by using Steriner Tree Problem
and improves time-taken for the search by using PseudoPolynomial Time alogirthm.
4. Discovers the files by its keyword and executes it in a fraction of second for the user by using
Sparse algorithm.
Modules Description
1. Admin
2. User
3. Keyword Search Module
4. View Ranking of Files.
5. View File Length and Execution time.
1. Admin Module :
Can view User Details.
Can upload files to search for the users.
Can view up the uploaded files.
2. User Module :
User can search files by its keywords.
Can view the file length, execution time of the files.
Can view ranking of the files by the chart.
4. 3.Keyword Search Module :
Files can be searched by its keywords which has been uploaded by the admin.
4.View Ranking of files :
File ranking can be viewed by the chart.
5. View File Length and Execution time :
File length has been read in KB format and stored it in database.
Execution time of the files are also can be viewed in the database.
System Specification
Hardware Requirements:
• System : Pentium IV 2.4 GHz.
• Hard Disk : 40 GB.
• Floppy Drive : 1.44 Mb.
• Monitor : 14’ Colour Monitor.
• Mouse : Optical Mouse.
• Ram : 512 Mb.
Software Requirements:
5. • Operating system : Windows 7.
• Coding Language : ASP.Net with C#
• Data Base : SQL Server 2008.