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.
With the growing popularity of XML and emergence of streaming data model, processing streaming XML has become an important topic. This paper proposes keyword search solution over XML fragment streams based on hole-filler model. Two efficient indexes, dual list and sketch are developed to further improve the
The study on XML keyword search gradually becomes the focus of information retrieval. Most previous XML keyword search algorithms are based on SLCA (smallest lowest common ancestor), but in the process of keyword search, we discover that some weakness or flaw exists in SLCA, it is summarized as follows: (1) the query
With the XML becomes a de-facto standard for exchanging and presenting information, the study on XML keyword search has become the focus of information retrieval. Several recent studies have finished the effective XML keyword search, but not all approach is effective in identifying return information, not all search
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
In the era of information explosion, information retrieval has become a bottleneck in information sharing and integration. However currently, the existing information retrieval methods are mainly based on keyword matching, which can not fully take advantage of the information context and potential knowledge. All of
approach, personal data are uniformly represented in a single data model proposed in this paper, and stored in a data warehousing system based on a storage model corresponding to the data model. Then, users are enabled to easily retrieve all their personal information by using keywords or a semi-structured query language.
With the increasing popularity of XML for data representations, there is a lot of interest in searching XML data. Due to the structural heterogeneity and textual content's diversity of XML, it is daunting for users to formulate exact queries and search accurate answers. Therefore, approximate matching is introduced to deal with the difficulty in answering users’ queries, and this matching could be...
This paper presents an algebraic approach, meant to provide an access to XML (extensible markup language) components in the XML hierarchical trees. An adequate theoretical mechanism is critical for the creation of query languages that handle XML documents and is extremely important for the development and standardization of XML parsing process. The authors of this article propose an algebraic formalism...
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.