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.
Path and Keyword search in XML documents has recently become an active area of research, in which constructing an effective index is a key issue. Existing index structures and encoding schemes for XML query processing target the Parent-Child and Ancestor-Descendant relationships, however, they depend on large index
In the research field of XML retrieval with keyword-based approach, a variant of Lowest Common Ancestors (LCAs) have been widely accepted to provide how keywords are connected by ancestor relationship. However, returning a whole subtree or a partial subtree based on LCA nodes is insufficient for identifying how
In this paper, we present an approach to process XML stream based on keyword search. We define the keyword search semantic as Meaning Independent Smallest Lowest Common Ancestors (MISLCAs) and query results as Meaning Independent Minimum Connecting Trees (MIMCTs), provide a user-friendly query interface based on
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
Keyword search has attracted a great deal of attention for retrieving XML data because it is a user-friendly mechanism. But Keyword search is hard to directly improve search quality because lots of keyword-matched nodes may not contribute to the results. XML includes rich semantic information these semantics are
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
XML employs a tree-structured model for representing data, and queries over XML documents are typically represented as twig patterns. At the same time, keyword search over XML documents has been well studied because of its intuitive and friendly query interface. Consequently, XQuery Full-Text emerges as a full-text
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
system are how to segment a large XML document to smaller fragments and how to store them. In order to achieve these goals, we designed SCOF model (service-centric object fragmentation model), which is a semi- decomposition method based on conversion rules provided by XML database managers. Keyword-based search using SCOF
The strong point of the XML is that it allows document owners to describe their documents in their own format (structure and element names). There might be the same information has been describe in various ways. When user wants to search some information from XML documents, user might not retrieve all related results because of the difference of elements (tag names). To retrieve all related results,...
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.