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.
expressed in terms of keywords, over several XML streams. However, there are few algorithms that evaluate this kind of query. One of them is MKStream, which is the current state-of-the-art algorithm for processing keyword-based queries over XML streams. In order to improve scalability, in this paper we introduce PMKStream
(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
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
documents with document-level access control. The effective and secure search is realized by incorporating metadata identifying document types, keyword definitions and access control information directly into a search index. Given a search query of an authorized user, a technique that generates SQL statements on the search
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
content of a given XML document, making the best use of XML structure. Search metrics take account of the similarity in tag names, tag values, and the structure of tags. After a search, the system displays the ranked results in the order of aggregate similarity. Three methods of query are provided: keyword search which is
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...
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.