Proximity Keyword Search in Xml Documents Using CTREE Index

نویسندگان

  • J K Swapna
  • G.Vijaya Lakshmi
چکیده

Proximity Keyword Search is especially useful when searching on the web and in long unstructured documents such as XML. This system is designed to handle novel features of Proximity Keyword Search in XML documents. It concentrates mainly on producing ranked results efficiently for keyword search queries over XML documents. The proposed system is first of its kind in which the keyword string is preprocessed before searching the XML document. This system eliminates the stop words and spaces entered by the user before locating the elements which contain the keywords. The search is case insensitive. In particular, this system is implemented in two stages. In pre processing stage, a set of keyword indices are built using CTREE concept for a set of XML documents. In the searching phase, the keywords entered by the user are analyzed and searched. Lowest common ancestor of the given keywords is computed and the results are ranked based upon the distance between the keywords located.

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

ثبت نام

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

منابع مشابه

A System for Keyword Proximity Search on XML Databases

Keyword proximity search is a user-friendly information discovery technique that has been extensively studied for text documents. In extending this technique to structured databases, recent works [6, 7, 4, 2] provide keyword proximity search on labeled graphs. A keyword proximity search does not require the user to know the structure of the graph, the role of the objects containing the keywords...

متن کامل

SAIL: Structure-aware indexing for effective and progressive top-k keyword search over XML documents

Keyword search in XML documents has recently gained a lot of research attention. Given a keyword query, existing approaches first compute the lowest common ancestors (LCAs) or their variants of XML elements that contain the input keywords, and then identify the subtrees rooted at the LCAs as the answer. In this the paper we study how to use the rich structural relationships embedded in XML docu...

متن کامل

Effective Keyword Search in XML Documents Based on MIU

Keyword search is an effective approach for most users to search for information because they do not need to learn complex query languages or the underlying structures of the data. This paper focuses on effective keyword search in XML documents which are modeled as labeled trees. We first analyze the problems caused by the refinement of result granularity during XML keyword search and then prop...

متن کامل

Finding and ranking compact connected trees for effective keyword proximity search in XML documents

In this paper, we study the problem of keyword proximity search in XML documents. We take the disjunctive semantics among the keywords into consideration and find top-k relevant compact connected trees (CCTrees) as the answers of keyword proximity queries. We first introduce the notions of compact lowest common ancestor (CLCA) and maximal CLCA (MCLCA), and then propose compact connected trees a...

متن کامل

A Method for Evaluating Full-text Search Queries in Native XML Databases

In this paper we consider the problem of efficiently producing results for full-text keyword search queries over XML documents. We describe full-text search query semantics and propose a method for efficient evaluation of keyword search queries with these semantics suitable for native XML databases. Method uses inverted file index which may be efficiently updated when a part of some XML documen...

متن کامل

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


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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2017