Data Extraction from Structured Databases using Keyword-based Queries

نویسندگان

  • Mariana Ramada
  • João Carlos da Silva
  • Plínio de Sá Leitão Júnior
چکیده

Relational databases are used to store a large quantity of data scattered around the world. However, users face difficulties in accessing such data for lack of a more natural way of specifying queries. Techniques that use natural language words to search different information sources on the Web are now very common, but they cannot be employed to search relational databases. This work proposes a method that allows user to submit keyword-based queries, which are then semantically analysed and enriched before being mapped for the database language. By analysing keyword-based queries, the method considers different factors, e.g. the proximity between keywords, query segmentation, and the use of aggregate functions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Answering Structured Queries on Unstructured Data

There is growing number of applications that require access to both structured and unstructured data. Such collections of data have been referred to as dataspaces, and Dataspace Support Platforms (DSSPs) were proposed to offer several services over dataspaces, including search and query, source discovery and categorization, indexing and some forms of recovery. One of the key services of a DSSP ...

متن کامل

Keyword search across distributed heterogenous structured data sources

Many applications and users require integrated data from multiple, distributed, heterogeneous (semi-) structured sources. Sources are relational databases, XML databases, or even structured Web resources. Mediator systems represent one class of solutions for data integration. They provide a uniform view and uniform way to query the virtually integrated data. As data resides in the local sources...

متن کامل

An Effective Path-aware Approach for Keyword Search over Data Graphs

Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...

متن کامل

Automatic Keyword Extraction

Users often try to assimilate information on a topic of interest from multiple information sources. Sometimes user’s information need might be expressed in terms of an available relevant document, rather than a query. This document can result from a web search, but also arrive at user’s desktop directly e.g. as an e-mail attachment. Recently a lot of work was performed towards enabling keyword ...

متن کامل

Effectively Interpreting Keyword Queries on RDF Databases with a Rear View

Effective techniques for keyword search over RDF databases incorporate an explicit interpretation phase that maps keywords in a keyword query to structured query constructs. Because of the ambiguity of keyword queries, it is often not possible to generate a unique interpretation for a keyword query. Consequently, heuristics geared toward generating the top-K likeliest user-intended interpretati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014