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.
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
Due to its considerable ease of use, relational keyword search (R-KWS) has become increasingly popular. Its simplicity, however, comes at the cost of intensive query processing. Specifically, R-KWS explores a vast search space, comprised of all possible combinations of keyword occurrences in any attribute of every
(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
Computing top-k results matching XML queries is gaining importance due to the increasing of large XML repositories. In this paper, we propose a novel two-layer-based index construction and associated algorithms for efficiently computing top-k results for SLCA-based XML keyword search. We have conducted expensive
Retrieval queries that combine structural constraints with keyword search represent a significant challenge to XML data management systems. Queries are expected to be answered as efficiently and effectively as in traditional keyword search, while satisfying additional constraints. Several XML-retrieval systems support
With the rapid increase of XML documents on the web, how to index, store and retrieve these documents has become a very popular and valuable problem. At present, there are two normal ways of retrieving XML documents. One is structure-based retrieval; the other is keyword-based retrieval. However, XML keyword search is
A new semantic search scheme for XML data is proposed. The semantics of both XML documents and the query are enriched by domain ontology annotation. Also, the additional information provided by the structure of XML documents is considered by adding node path index, semantic keyword index and element tag index to
As a semi-structured data standard rich in both content and structure, XML is becoming the dominant information organization format in digital library. Compared with traditional information retrieval systems, XML retrieval system has great advantages in organizing and retrieving information due to its element-level rather than document-level access to relevant information. This paper gives a detailed...
to the quality of the information. Traditional search engine that uses keyword to search for information about the meaning of a word or a sentence often produce biased and irrelevant search results. Ontology has been developed to overcome this problem. In this paper an ontology framework is presented, which was
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.