Scribd
Upload
85 views4 pages

An Empirical Performance Evaluation of Relational Keyword Search Systems

This paper presents an empirical performance evaluation of relational keyword search techniques. The evaluation finds that many existing search techniques do not provide acceptable performance for realistic retrieval tasks due to high memory consumption that prevents scaling to large datasets. Factors varied in previous evaluations are also found to have little impact on performance. The evaluation underscores the need for standardization in how these retrieval systems are assessed.

Uploaded by

Mahi Prince
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
85 views4 pages

An Empirical Performance Evaluation of Relational Keyword Search Systems

This paper presents an empirical performance evaluation of relational keyword search techniques. The evaluation finds that many existing search techniques do not provide acceptable performance for realistic retrieval tasks due to high memory consumption that prevents scaling to large datasets. Factors varied in previous evaluations are also found to have little impact on performance. The evaluation underscores the need for standardization in how these retrieval systems are assessed.

Uploaded by

Mahi Prince
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

An Empirical Performance Evaluation Of Relational

Keyword Search Systems


ABSTRACT:
Extending the keyword search paradigm to relational data has been an active area
of research within the database and IR community during the past decade. Many
approaches have been proposed, but despite numerous publications, there remains
a severe lack of standardization for the evaluation of proposed search techniques.
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 the most extensive empirical
performance evaluation of relational keyword search techniques to appear to date
in the literature. 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 data
sets with tens of thousands of vertices. We also explore the relationship between
execution time and factors varied in previous evaluations; our analysis indicates
that most of these factors have relatively little impact on performance. In summary,
our work confirms previous claims regarding the unacceptable performance of
these search techniques and underscores the need for standardization in evaluations
standardization exemplified by the IR community.

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.
DISADVANTAGES OF EXISTING SYSTEM:
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.

ADVANTAGES OF PROPOSED SYSTEM:


Keyword Search with ranking.
Execution Time consumption is less.
File length and Execution time can be seen.
Ranking can be seen by using chart.

SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:
System

Pentium IV 2.4 GHz.

Hard Disk

40 GB.

Floppy Drive

1.44 Mb.

Monitor

15 VGA Colour.

Mouse

Logitech.

Ram

512 Mb.

SOFTWARE REQUIREMENTS:
Operating system :

Windows XP/7.

Coding Language :

ASP.net, C#.net

Tool

Visual Studio 2010

Database

SQL SERVER 2008

REFERENCE:
Joel Coffman, and Alfred C. Weaver An Empirical Performance Evaluation of
Relational Keyword Search Techniques IEEE TRANSACTIONS ON
KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. 1, JANUARY 2014.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy