The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A user who wants to get information from a relational database needs to know database schema and structured query languages like SQL. The ordinary users are not familiar to those things, so searching information from relational databases is hard to them. Keyword search is a solution of the problem, where a keyword
Keyword search is a user-friendly way to query XML data, such that users do not need to understand the complex syntax of structured query languages and the complex structural information of the underlying XML data. However, existing semantics suffer from limited expressiveness, thus users cannot obtain desired
basic unit of query to avoid expensive join operations. Furthermore, QTPI provides a terse index that can quickly derive the keyword query and generate a set of effective structured queries by analyzing the given keyword query and scanning the index, hence it has a performance advantage over methods indexing either. We
This paper introduces a novel keyword searching paradigm in relational databases (DBs), where the result of a search is a ranked set of object summaries (OSs). An OS summarizes all data held about a data subject (DS) in the database. More precisely, it is a tree with a tuple containing the keyword as a root and
One of the most convenient ways to query XML data is a keyword search because it does not require any knowledge about XML structure and without the need to learn a new user interface. However, keyword search interface is very flexible. It is hard for a system to decide which node is likely to be chosen as a return
The Web has the potential to become the world's largest knowledge base. In order to unleash this potential, the wealth of information available on the Web needs to be extracted and organized. There is a need for new querying techniques that are simple and yet more expressive than those provided by standard keyword
The existing query languages for XML (e.g., XQuery) require professional programming skills to be formulated, however, such complex query languages burden the query processing. In addition, when issuing an XML query, users are required to be familiar with the content (including the structural and textual information) of the hierarchical XML, which is diffcult for common users. The need for designing...
query language based on keyword search. The architecture of the system centers around a distributed search plane that performs query processing using a network of search nodes. Finally, the paper outlines the design of a search node, which contains a local database that maintains graph partitions.
The syntactic approach of most of Web search engines still has the drawback of not considering the semantics of the keywords entered by the user. So, users usually have to browse many hits looking for the information they want. In this paper, we present a system that, given a set of keywords with well defined
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.