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.
At present many commercial database using Xpath and XQuery as XML retrieval standard, grammar about XPath and XQuery is complicated , it is difficult for general user to use. In this paper, the research work is focused on the keyword retrieval technology of XML document, designs a XML full-text information retrieval
(P2P) computing model has fueled the autonomous data sharing over the Internet in a more flexible fashion. Needless to say, XML data retrieval in P2P systems has become attractive to professionals in both research and industrial communities. In this paper, we propose a Bloom-Filter based keyword search framework for XML
Inspired by the great success of information retrieval (IR) style keyword search on the web, keyword search on XML has emerged recently. The difference between text database and XML database results in three new challenges: 1) Identify the user search intention, i.e., identify the XML node types that user wants to
Inspired by the great success of information retrieval (IR) style keyword search on the Web, keyword search on XML has emerged recently. The difference between text database and XML database results in three new challenges: (1) Identify the user search intention, i.e. identify the XML node types that user wants to
There may exist a specific relationship between the keywords if an XML multi-keywords search has more than one answers. Such relationship can be speculated by SLCA. This paper proposes a user-friendly Top-k keywords searching approach based on the relationship of keywords. The SLCA of a keyword search is first
The Holy Quran, due to its unique style and allegorical nature, needs special attention about searching and information retrieval issues. The legacy keyword searching techniques are incapable of retrieving semantically relevant verses. In this paper, we address the deficiencies of key word based searching and the
Keyword search for smallest lowest common ancestors (SLCAs) is a convenient method to retrieve information from XML documents for most of users, especially who have no knowledge or experience on XML. There have been many proposed algorithms solving SLCA problem through transforming XML documents into XML trees labeled
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...
A data element specifies one of the characteristics of its parent element. Therefore, the context of a data element is determined by its parent. Non context driven search engines build relationships between data nodes based solely on their labels and proximity to one another while overlooking their contexts. Therefore, they may return faulty answers. This paper investigates the pitfalls and limitations...
data-rich by keywords in the index path; generate extraction rule and obtain a wrapper according. The wrapper can extract data automatically in the same domain from a Website. It does relevant to the continuity, the structural similarity, and the location relations of the useful information in Web pages, but not the HTML
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.