About: XML namespace is a research topic. Over the lifetime, 343 publications have been published within this topic receiving 9426 citations. The topic is also known as: xmlns.
TL;DR: Wang et al. as mentioned in this paper proposed a new system for indexing and storing XML data based on a numbering scheme for elements, which quickly determines the ancestor-descendant relationship between elements in the hierarchy of XML data.
Abstract: With the advent of XML as a standard for data representation and exchange on the Internet, storing and querying XML data becomes more and more important. Several XML query languages have been proposed, and the common feature of the languages is the use of regular path expressions to query XML data. This poses a new challenge concerning indexing and searching XML data, because conventional approaches based on tree traversals may not meet the processing requirements under heavy access requests. In this paper, we propose a new system for indexing and storing XML data based on a numbering scheme for elements. This numbering scheme quickly determines the ancestor-descendant relationship between elements in the hierarchy of XML data. We also propose several algorithms for processing regular path expressions, namely, (1) -Join for searching paths from an element to another, (2) -Join for scanning sorted elements and attributes to find element-attribute pairs, and (3) -Join for finding Kleene-Closure on repeated paths or elements. The -Join algorithm is highly effective particularly for searching paths that are very long or whose lengths are unknown. Experimental results from our prototype system implementation show that the proposed algorithms can process XML queries with regular path expressions by up to an or
TL;DR: The Namespace Management System as mentioned in this paper is a run-time configurable state information management system that evaluates a request within a semantic domain defined by the state information at a given moment in time.
Abstract: The Namespace Management System comprises a run-time configurable state information management system that evaluates a request within a semantic domain defined by the state information at a given moment in time. The Namespace Management System comprises a Namespace Management application, executing on a computer system that is connected to the Internet or other Autonomous System. The Namespace Management System is programmatically and dynamically configurable to take part in and administer a multiplicity of namespaces, each of which contains listings, data, and services or other state information required to satisfy a request and/or interact with callable services. A multiplicity of Namespace Management Systems can register services, provide services, discover services, communicate with services, and participate in one or more dynamic network namespaces, with each Namespace Management System having at least one associated dynamic network namespace listing. At run-time, a Namespace Management System can register a subscriber's present point of presence to associate with its dynamic network namespace listing. The Namespace Management System provides dynamic point of presence registration for namespace listings and through a scheme handler service to resolve a namespace listing reference, which is given as a Uniform Resource Identifier, to the present point of presence for the namespace listing. This process enables the Namespace Management System to provide web services independent of the physical location of the subscriber.
TL;DR: This paper defines XML keyword, proximity queries to return the (possibly heterogeneous) set of minimum connecting trees (MCTs) of the matches to the individual keywords in the query to efficiently execute keyword proximity queries on labeled trees (XML).
Abstract: Recent works have shown the benefits of keyword proximity search in querying XML documents in addition to text documents. For example, given query keywords over Shakespeare's plays in XML, the user might be interested in knowing how the keywords cooccur. In this paper, we focus on XML trees and define XML keyword, proximity queries to return the (possibly heterogeneous) set of minimum connecting trees (MCTs) of the matches to the individual keywords in the query. We consider efficiently executing keyword proximity queries on labeled trees (XML) in various settings: 1) when the XML database has been preprocessed and 2) when no indices are available on the XML database. We perform a detailed experimental evaluation to study the benefits of our approach and show that our algorithms considerably outperform prior algorithms and other applicable approaches.
TL;DR: In this paper, an Extensible Markup Language (XML) data group is selected from a plurality of XML data groups and an XML display layout is selected for a particular GUI on a computer display, and XML data items are hierarchically ordered within each of the aggregations of data.
Abstract: Systems, methods and computer program products are provided for building and displaying dynamic graphical user interfaces (GUIs) that can be updated automatically without requiring code-level modification and recompiling. In response to a request to display a particular GUI on a computer display, an Extensible Markup Language (XML) data group is selected from a plurality of XML data groups and an XML display layout is selected from a plurality of XML display layouts. The selected XML data group includes one or more aggregations of data hierarchically ordered within the selected XML data group. XML data items are hierarchically ordered within each of the aggregations of data. The selected XML display layout contains one or more areas that define respective GUI display spaces within which XML data items from the respective aggregations of data can be displayed. XML markup tags associated with each aggregation of data within the selected XML data group are matched with XML markup tags associated with a respective area contained within the selected XML display layout. The XML data items contained within each aggregation of data are rendered in hierarchical order within a respective GUI display space defined by a respective area within the XML display layout.
TL;DR: In this paper, an identity system generates an output XML containing raw identity information organized in accordance with a set of XML templates, and the identity system dynamically determines the desired response type and prepares the response from the output XML.
Abstract: In response to a user request, an Identity System generates an Output XML containing raw identity information organized in accordance with a set of XML templates. The Identity System dynamically determines the desired response type and prepares the response from the Output XML. One response type is server-side processing—the Identity System combines the Output XML with XSL stylesheets to generate a HTML response. An alternative response type is client-side processing—the Identity System supplies the user with the Output XML. In further client-side embodiments, the Identity System provides XSL stylesheet references along with the Output XML. Additional embodiments provide for the Identity System to perform customized post-processing on the Output XML.