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.
integrate information from multiple interrelated pages to answer keyword queries meaningfully. Next-generation web search engines require link-awareness, or more generally, the capability of integrating correlative information items that are linked through hyperlinks. In this paper, we study the problems of identifying the
We present a new index method to provide approximate keyword search in search engines. Our approximate keyword matching adopts a new similarity measurement called Listance model, which is a variation of the LCS (longest common subsequence) model. Two keywords are considered approximately matched, if their Listance is
Workflows are widely used for representing business processes, Web services, scientific experiments, and activities in daily life, like recipes. There is an increasing need for people to search a workflow repository using keywords and retrieve the relevant ones according to their interests. A workflow hierarchy is a
The task of researching information on a particular topic using the Web is mainly accomplished by using keyword-based search engines. Although this approach provides a good starting point, it remains a tedious task to collect additional information that puts this topic in greater context. In this paper we present
relational database of web pages. So there are many researches focusing on the search in these relational database with keywords, compared with these researches, our algorithms are mainly based on bags using the greedy algorithms and supporting the phrase recognition by utilizing multiple dictionaries. We make a comparison
does not consider the keyword attributes on the query interface. This paper presents increment-based random walk, a new technique applicable to any kind of attributes. The main idea of this approach is for keyword attributes, it incrementally obtains new values from a database. That is, select a value from the current
The inability of the present search engines to map the retrieved result set using semantics of the query keywords has been discussed. The present study suggests a framework to improve the mapping of Concept and Context of the query keywords and thereby remove noise from the query. This ensures more relevant and
provides a novel technique for indexing the web documents based on the context of keywords that helps a search engine to serve a query with more specific documents, and relevant contents.
As an ever-increasing amount of information on the Web today is available through search interfaces, users have to key in a set of keywords in order to access the pages from certain Web sites, which are often referred to as the hidden Web or the deep Web. Since there is no static links to the hidden Web pages, search
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.