scispace - formally typeset
Search or ask a question

Showing papers on "XML published in 2006"


Journal ArticleDOI
TL;DR: The CDA R2 model is richly expressive, enabling the formal representation of clinical statements such that they can be interpreted and acted upon by a computer, and offers a low bar for adoption.

731 citations


Proceedings ArticleDOI
27 Jun 2006
TL;DR: The .NET Language-Integrated Query (LINQ) framework, proposed for the next release of the .NET framework, approaches the problem of handling data from different data models by defining a pattern of general-purpose standard query operators for traversal, filter, and projection.
Abstract: Many software applications today need to handle data from different data models; typically objects from the host programming language along with the relational and XML data models. The ROX impedance mismatch makes programs awkward to write and hard to maintain.The .NET Language-Integrated Query (LINQ) framework, proposed for the next release of the .NET framework, approaches this problem by defining a pattern of general-purpose standard query operators for traversal, filter, and projection. Based on this pattern, any .NET language can define special query comprehension syntax that is subsequently compiled into these standard operators (our code examples are in VB).Besides the general query operators, the LINQ framework also defines two domain specific APIs that work over XML (XLinq) and relational data (DLinq) respectively. The operators over XML use a lightweight and easy to use in-memory XML representation to provide XQuery-style expressiveness in the host programming language. The operators over relational data provide a simple OR mapping by leveraging remotable queries that are executed directly in the back-end relational store.

434 citations


01 Dec 2006
TL;DR: The Network Configuration Protocol (NETCONF) defined in this document provides mechanisms to install, manipulate, and delete the configuration of network devices through an Extensible Markup Language (XML)-based data encoding.
Abstract: The Network Configuration Protocol (NETCONF) defined in this document provides mechanisms to install, manipulate, and delete the configuration of network devices. It uses an Extensible Markup Language (XML)-based data encoding for the configuration data as well as the protocol messages. The NETCONF protocol operations are realized on top of a simple Remote Procedure Call (RPC) layer. [STANDARDS- TRACK]

413 citations


Journal ArticleDOI
01 Jun 2006
TL;DR: This encyclopedia is composed of millions of articles in different languages and anyone can edit an article using a wiki markup language that offers a simplified alternative to HTML.
Abstract: Wikipedia is a well known free content, multilingual encyclopedia written collaboratively by contributors around the world. Anybody can edit an article using a wiki markup language that offers a simplified alternative to HTML. This encyclopedia is composed of millions of articles in different languages.

370 citations


Proceedings ArticleDOI
27 Jun 2006
TL;DR: The main features, key contributions, and lessons learned while implementing a purely relational XQuery system, which implements all essential XML database functionalities such that it can learn from the full consequences of the architectural decisions.
Abstract: Relational XQuery systems try to re-use mature relational data management infrastructures to create fast and scalable XML database technology. This paper describes the main features, key contributions, and lessons learned while implementing such a system. Its architecture consists of (i) a range-based encoding of XML documents into relational tables, (ii) a compilation technique that translates XQuery into a basic relational algebra, (iii) a restricted (order) property-aware peephole relational query optimization strategy, and (iv) a mapping from XML update statements into relational updates. Thus, this system implements all essential XML database functionalities (rather than a single feature) such that we can learn from the full consequences of our architectural decisions. While implementing this system, we had to extend the state-of-the-art with a number of new technical contributions, such as loop-lifted staircase join and efficient relational query evaluation strategies for XQuery theta-joins with existential semantics. These contributions as well as the architectural lessons learned are also deemed valuable for other relational back-end engines. The performance and scalability of the resulting system is evaluated on the XMark benchmark up to data sizes of 11GB. The performance section also provides an extensive benchmark comparison of all major XMark results published previously, which confirm that the goal of purely relational XQuery processing, namely speed and scalability, was met.

330 citations


Marc J. Hadley1
01 Jan 2006
TL;DR: This article describes the Web Application Description Language (WADL), designed to provide a machine processable protocol description format for use with such HTTP-based Web applications, especially those using XML.
Abstract: This article describes the Web Application Description Language (WADL). An increasing number of Web-based enterprises (Google, Yahoo, Amazon, Flickr - to name but a few) are developing HTTP-based applications that provide access to their internal data using XML. Typically these applications are described using a combination of textual protocol descriptions combined with XML schema-based data format descriptions; WADL is designed to provide a machine processable protocol description format for use with such HTTP-based Web applications, especially those using XML.

284 citations


Journal ArticleDOI
TL;DR: A generic framework (architecture) of traceability data management that will act as guideline for all entities/food business operators involved and underlines that the particular model is simple in use and user‐friendly, by enabling information flow through conventional technologies.
Abstract: Purpose – The main objectives of the paper are to identify the needs in data that are considered as fundamental for the efficient food traceability and to introduce a generic framework (architecture) of traceability data management that will act as guideline for all entities/food business operators involved.Design/methodology/approach – The traceability system introduced is based on the implementation of XML (eXtensible Markup Language) technology. In the first stage, the necessary traceability data are identified and categorized. In the second stage, the selected data are transformed and inserted into a five‐element generic framework/model, using PML (Physical Markup Language), which is a standard technology of XML.Findings – The assessment of information communication and diffusion underlines that the particular model is simple in use and user‐friendly, by enabling information flow through conventional technologies.Practical implications – The main feature of this framework is the simplicity in use and ...

276 citations


Journal Article
TL;DR: A conceptual structure and transition procedure to support the shift from a traditional KOS towards a full-fledged and semantically rich KOS is presented and the rules-as-you-go approach to streamlining the reengineering process is explored.
Abstract: Existing classification schemes and thesauri are lacking in well-defined semantics and structural consistency. Empowering end users in searching collections of ever increasing magnitudes with performance far exceeding plain free-text searching (as used in many Web search engines), and developing systems that not only find but also process information for action, requires far more powerful and complex knowledge organization systems (KOSs). The paper presents a conceptual structure and transition procedure to support the shift from a traditional KOS towards a full-fledged and semantically rich KOS. The proposed structure also complies with other interoperability approaches like RDFS and XML in the Web environment. AGROVOC, a traditional thesaurus developed and maintained by the Food and Agriculture Organization (FAO) of the United Nations, serves as a case study for exploring the reengineering of a traditional thesaurus into a fully-fledged ontology. We start the process of developing an inventory of specific relationship types with well-defined semantics for the agricultural domain and explore the rules-as-you-go approach to streamlining the reengineering process.

262 citations


Patent
14 Apr 2006
TL;DR: In this paper, a configuration service receives a request from a network device to provide configuration information and retrieves a template describing the device configuration, where the template associates one symbolic reference to one parameter that may receive values specific to particular devices.
Abstract: A system and an apparatus are disclosed for carrying out automatic network device provisioning and configuration. A configuration service receives a request from a network device to provide configuration information. The configuration service retrieves a template describing the device configuration, where the template associates one symbolic reference to one parameter that may receive values specific to particular devices. Based at least on the symbolic reference and the request, the configuration service retrieves a value of the parameter that is specific to the network device. A device-specific instance of the configuration information is created and stored based at least one the template and the value of the parameter. The configuration information is stored in XML format and conforms to an XML DTD.

260 citations


Book
01 Jan 2006
TL;DR: This paper presents a meta-modelling architecture for e-Business that automates the very labor-intensive and therefore time-heavy and expensive process of designing and integrating e- business models and systems.
Abstract: 1. The World of e-Business. 2. e-Business Strategy. 3. Business Models. 4. e-Business Relationships. 5. Governance Structures. 6. e - Business Technological Infrastructure. 7. XML the enabling technology for e-Business. 8. Electronic Markets. 9. e-Procurement. 10 e-Business Networks. 11. Intermediaries in the Value Systems. 12. e-Business Modelling. 13. Security and Reliability for e-Business. 14. Approaches to Middleware. 15. Component-based Development. 16. Leveraging Legacy Applications. 17. Enterprise Application Integration. 18. e-Business Integration. 19. Building Loosely Coupled e-Business Applications. 20. Business Protocols. Glossary. References. Index.

210 citations


BookDOI
01 Jan 2006
TL;DR: In this paper, the authors present a new approach for estimating the selectivity of XML Twig Queries in P2P Querying and Ranking, which is based on the SOQA-SimPack Toolkit.
Abstract: Invited Lectures.- Database Architecture Fertilizers: Just-in-Time, Just-Enough, and Autonomous Growth.- Digital Video: Just Another Data Stream?.- Charting a Dataspace: Lessons from Lewis and Clark.- Data Streams.- Fast Approximate Wavelet Tracking on Streams.- Resource Adaptive Periodicity Estimation of Streaming Data.- On Futuristic Query Processing in Data Streams.- Semantic Heterogeneity.- Detecting Similarities in Ontologies with the SOQA-SimPack Toolkit.- Holistic Schema Matching for Web Query Interfaces.- Data Mapping as Search.- Distributed Databases.- Parallelizing Skyline Queries for Scalable Distribution.- Replication, Load Balancing and Efficient Range Query Processing in DHTs.- IQN Routing: Integrating Quality and Novelty in P2P Querying and Ranking.- Multidimensionality and Nearest-Neighbor Searches.- Efficient Quantile Retrieval on Multi-dimensional Data.- Fast Nearest Neighbor Search on Road Networks.- Approximation Techniques to Enable Dimensionality Reduction for Voronoi-Based Nearest Neighbor Search.- Privacy and Security.- Authorization-Transparent Access Control for XML Under the Non-Truman Model.- On Honesty in Sovereign Information Sharing.- Temporal Data Management.- Multi-dimensional Aggregation for Temporal Data.- Similarity Search on Time Series Based on Threshold Queries.- Supporting Temporal Slicing in XML Databases.- Text Databases and Information Retrieval.- Indexing Shared Content in Information Retrieval Systems.- Feedback-Driven Structural Query Expansion for Ranked Retrieval of XML Data.- Expressiveness and Performance of Full-Text Search Languages.- Schema Management.- Model-Independent Schema and Data Translation.- Physical Design Refinement: The "Merge-Reduce" Approach.- Online, Non-blocking Relational Schema Changes.- Approximation and Estimation.- Deferred Maintenance of Disk-Based Random Samples.- Exploiting Cluster Analysis for Constructing Multi-dimensional Histograms on Both Static and Evolving Data.- HASE: A Hybrid Approach to Selectivity Estimation for Conjunctive Predicates.- Data and Query Patterns.- On High Dimensional Skylines.- From Analysis to Interactive Exploration: Building Visual Hierarchies from OLAP Cubes.- DPTree: A Distributed Pattern Tree Index for Partial-Match Queries in Peer-to-Peer Networks.- XML Queries and Updates.- A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries.- Conflicting XML Updates.- Improving the Efficiency of XPath Execution on Relational Systems.- Data Streams and Pub/Sub Systems.- Bridging Physical and Virtual Worlds: Complex Event Processing for RFID Data Streams.- On Concurrency Control in Sliding Window Queries over Data Streams.- Towards Expressive Publish/Subscribe Systems.- Data Mining and Knowledge Discovery.- Finding Data Broadness Via Generalized Nearest Neighbors.- TrajPattern: Mining Sequential Patterns from Imprecise Trajectories of Mobile Objects.- On Exploring the Power-Law Relationship in the Itemset Support Distribution.- Images, Multimedia, and User Interfaces.- Fast Query Point Movement Techniques with Relevance Feedback for Content-Based Image Retrieval.- On Fast Non-metric Similarity Search by Metric Access Methods.- Constructing a Generic Natural Language Interface for an XML Database.- XML Data Management.- A New Design for a Native XML Storage and Indexing Manager.- XML Duplicate Detection Using Sorted Neighborhoods.- Handling Interlinked XML Instances on the Web.- Query Optimization.- Query Planning in the Presence of Overlapping Sources.- Optimizing Monitoring Queries over Distributed Data.- Progressive Query Optimization for Federated Queries.- Data Structures and Indexing.- Indexing Spatially Sensitive Distance Measures Using Multi-resolution Lower Bounds.- Indexing Incomplete Databases.- FlexInd: A Flexible and Parameterizable Air-Indexing Scheme for Data Broadcast Systems.- Nontraditional Query Processing.- Multi-query SQL Progress Indicators.- Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons.- Fast Computation of Reachability Labeling for Large Graphs.- Spatial Data Management.- Distributed Spatial Clustering in Sensor Networks.- SCUBA: Scalable Cluster-Based Algorithm for Evaluating Continuous Spatio-temporal Queries on Moving Objects.- Caching Complementary Space for Location-Based Services.- Extending Data Base Technology.- Evolving Triggers for Dynamic Environments.- A Framework for Distributed XML Data Management.- Querying and Updating Probabilistic Information in XML.- An ECA Rule Rewriting Mechanism for Peer Data Management Systems.- Industrial Session.- A Metric Definition, Computation, and Reporting Model for Business Operation Analysis.- BISON: Providing Business Information Analysis as a Service.- The Design and Architecture of the ?-Synopses System.- Integrating a Maximum-Entropy Cardinality Estimator into DB2 UDB.- Improving DB2 Performance Expert - A Generic Analysis Framework.- Managing Collections of XML Schemas in Microsoft SQL Server 2005.- Enabling Outsourced Service Providers to Think Globally While Acting Locally.- Another Example of a Data Warehouse System Based on Transposed Files.- Demonstration Papers.- XG: A Grid-Enabled Query Processing Engine.- Managing and Querying Versions of Multiversion Data Warehouse.- Natix Visual Interfaces.- Hermes - A Framework for Location-Based Data Management.- TeNDaX, a Collaborative Database-Based Real-Time Editor System.- Synopses Reconciliation Via Calibration in the ?-Synopses System.- X-Evolution: A System for XML Schema Evolution and Document Adaptation.- TQuEST: Threshold Query Execution for Large Sets of Time Series.- VICO: Visualizing Connected Object Orderings.- XQueryViz: An XQuery Visualization Tool.- SAT: Spatial Awareness from Textual Input.- MUSCLE: Music Classification Engine with User Feedback.- iMONDRIAN: A Visual Tool to Annotate and Query Scientific Databases.- The SIRUP Ontology Query API in Action.- Querying Mediated Geographic Data Sources.- FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries.- ArHeX: An Approximate Retrieval System for Highly Heterogeneous XML Document Collections.- MonetDB/XQuery-Consistent and Efficient Updates on the Pre/Post Plane.- STRIDER: A Versatile System for Structural Disambiguation.- An Extensible, Distributed Simulation Environment for Peer Data Management Systems.- Panel.- Data Management in the Social Web.

Journal ArticleDOI
TL;DR: Wikipedia is a well known free content, multilingual encyclopedia written collaboratively by contributors around the world and anyone can edit an article using a wiki markup language that offers a si...
Abstract: Wikipedia is a well known free content, multilingual encyclopedia written collaboratively by contributors around the world. Anybody can edit an article using a wiki markup language that offers a si...

Journal ArticleDOI
TL;DR: This paper presents a framework for clustering XML documents by structure, and suggests the usage of structural summaries for trees to improve the performance of the distance calculation and at the same time to maintain or even improve its quality.

Journal ArticleDOI
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.

Journal Article
TL;DR: The Web Service Modeling Language (WSML) as mentioned in this paper is a formal language for the specification of different aspects of Semantic Web Services, starting from the intersection of Datalog and the Description Logic S-HIQ.
Abstract: The Web Service Modeling Language (WSML) is a language for the specification of different aspects of Semantic Web Services. It provides a formal language for the Web Service Modeling Ontology WSMO which is based on well-known logical formalisms, specifying one coherent language framework for the semantic description of Web Services, starting from the intersection of Datalog and the Description Logic S-HIQ. This core language is extended in the directions of Description Logics and Logic Programming in a principled manner with strict layering. WSML distinguishes between conceptual and logical modeling in order to support users who are not familiar with formal logic, while not restricting the expressive power of the language for the expert user. IRIs play a central role in WSML as identifiers. Furthermore, WSML defines XML and RDF serializations for inter-operation over the Semantic Web.

Proceedings ArticleDOI
01 Sep 2006
TL;DR: The BP-QL language is based on an intuitive model of business processes, an abstraction of the emerging BPEL (Business Process Execution Language) standard, and can be employed in a distributed setting, where process components may be provided by distinct providers(peers).
Abstract: We present in this paper BP-QL, a novel query language for querying business processes. The BP-QL language is based on an intuitive model of business processes, an abstraction of the emerging BPEL (Business Process Execution Language) standard. It allows users to query business processes visually, in a manner very analogous to how such processes are typically specified, and can be employed in a distributed setting, where process components may be provided by distinct providers(peers).We describe here the query language as well as its underlying formal model. We consider the properties of the various language components and explain how they influenced the language design. In particular we distinguish features that can be efficiently supported, and those that incur a prohibitively high cost, or cannot be computed at all. We also present our implementation which complies with real life standards for business process specifications, XML, and Web services, and is used in the BP-QL system.

Journal Article
TL;DR: Transformation rules are derived semi-automatically from an initial prototypical set of interrelated source and target models, which describe critical cases of the model transformation problem in a purely declarative way.
Abstract: In advanced XML transformer tools, XSLT rules are generated automatically after relating simple source and target XML documents. In this paper, we generalize this approach for the design of model transformations: transformation rules are derived semi-automatically from an initial prototypical set of interrelated source and target models. These initial model pairs describe critical cases of the model transformation problem in a purely declarative way. The derived transformation rules can be refined later by adding further source-target model pairs. The main advantage of the approach is that transformation designers do not need to learn a new model transformation language, instead they only use the concepts of the source and target modeling languages.

Journal ArticleDOI
TL;DR: An XML-based interchange format for event-driven process chains (EPC) that is called EPC markup language (EPML), which builds on EPC syntax related work and is tailored to be a serialization format for EPC modelling tools.
Abstract: This article presents an XML-based interchange format for event-driven process chains (EPC) that is called EPC markup language (EPML). EPML builds on EPC syntax related work and is tailored to be a serialization format for EPC modelling tools. Design principles inspired by other standardization efforts and XML design guidelines have governed the specification of EPML. After giving an overview of EPML concepts we present examples to illustrate its features including flat and hierarchical EPCs, business views, graphical information, and syntactical correctness.

Patent
17 Nov 2006
TL;DR: In this article, a computer is programmed to accept queries over streams of, data structured as per a predetermined syntax (e.g. defined in XML), and the computer is further programmed to execute such queries continually (or periodically) on data streams of tuples containing structured data that conform to the same predetermined syntax.
Abstract: A computer is programmed to accept queries over streams of, data structured as per a predetermined syntax (e.g. defined in XML). The computer is further programmed to execute such queries continually (or periodically) on data streams of tuples containing structured data that conform to the same predetermined syntax. In many embodiments, the computer includes an engine that exclusively processes only structured data, quickly and efficiently. The computer invokes the structured data engine in two different ways depending on the embodiment: (a) directly on encountering a structured data operator, or (b) indirectly by parsing operands within the structured data operator which contain path expressions, creating a new source to supply scalar data extracted from structured data, and generating additional trees of operators that are natively supported, followed by invoking the structured data engine only when the structured data operator in the query cannot be fully implemented by natively supported operators.

Proceedings Article
01 Jan 2006
TL;DR: In this article, a simpler formalism equivalent to XSDs is proposed, based on contextual patterns rather than on recursive types and it might serve as a light-weight front end for XML Schema.
Abstract: The common abstraction of XML Schema by unranked regular tree languages is not entirely accurate. To shed some light on the actual expressive power of XML Schema, intuitive semantical characterizations of the Element Declarations Consistent (EDC) rule are provided. In particular, it is obtained that schemas satisfying EDC can only reason about regular properties of ancestors of nodes. Hence, with respect to expressive power, XML Schema is closer to DTDs than to tree automata. These theoretical results are complemented with an investigation of the XML Schema Definitions (XSDs) occurring in practice, revealing that the extra expressiveness ofXSDs over DTDs is only used to a very limited extent. As this might be due to the complexity of the XML Schema specification and the difficulty of understanding the effect of constraints on typing and validation of schemas, a simpler formalism equivalent to XSDs is proposed. It is based on contextual patterns rather than on recursive types and it might serve as a light-weight front end for XML Schema. Next, the effect of EDC on the way XML documents can be typed is discussed. It is argued that a cleaner, more robust, larger but equally feasible class is obtained by replacing EDC with the notion of 1-pass preorder typing (1PPT): schemas that allow one to determine the type of an element of a streaming document when its opening tag is met. This notion can be defined in terms of grammars with restrained competition regular expressions and there is again an equivalent syntactical formalism based on contextual patterns. Finally, algorithms for recognition, simplification, and inclusion of schemas for the various classes are given.

Journal ArticleDOI
TL;DR: The current status of the development of GDML is presented and the contents of the latest GDML schema, which is the basic definition of the format, are discussed, which will concentrate on the GDML processors.
Abstract: The Geometry Description Markup Language (GDML) is a specialized XML-based language designed as an application-independent persistent format for describing the geometries of detectors associated with physics measurements. It serves to implement "geometry trees" which correspond to the hierarchy of volumes a detector geometry can be composed of, and to allow to identify the position of individual solids, as well as to describe the materials they are made of. Being pure XML, GDML can be universally used, and in particular it can be considered as the format for interchanging geometries among different applications. In this paper we will present the current status of the development of GDML. After having discussed the contents of the latest GDML schema, which is the basic definition of the format, we will concentrate on the GDML processors. We will present the latest implementation of the GDML "writers" as well as "readers" for either Geant4 , or ROOT ,

Book ChapterDOI
01 Oct 2006
TL;DR: In this paper, transformation rules are derived semi-automatically from an initial prototypical set of interrelated source and target models, which can be refined later by adding further source-target model pairs.
Abstract: In advanced XML transformer tools, XSLT rules are generated automatically after relating simple source and target XML documents. In this paper, we generalize this approach for the design of model transformations: transformation rules are derived semi-automatically from an initial prototypical set of interrelated source and target models. These initial model pairs describe critical cases of the model transformation problem in a purely declarative way. The derived transformation rules can be refined later by adding further source-target model pairs. The main advantage of the approach is that transformation designers do not need to learn a new model transformation language, instead they only use the concepts of the source and target modeling languages.

Proceedings ArticleDOI
04 Jan 2006
TL;DR: This paper looks in detail at the support for discovery for semantic web services in OWL-S IDE, and presents the matching schemes, the implementation and the results of performance evaluation.
Abstract: The increasing availability of web services necessitates efficient discovery and execution framework. The use of xml at various levels of web services standards poses challenges to the above process. OWL-S is a service ontology and language, whose semantics are based on OWL. The semantics provided by OWL support greater automation of service selection, invocation, translation of message content between heterogeneous services, and service composition. The development and consumption of an OWL-S based web service is time consuming and error prone. OWL-S IDE assists developers in the semantic web service development, deployment and consumption processes. In order to achieve this the OWL-S IDE uses and extends existing web service tools. In this paper we will look in detail at the support for discovery for semantic web services. We also present the matching schemes, the implementation and the results of performance evaluation.

Journal ArticleDOI
TL;DR: It is shown that the representation system can represent partial information about the source document acquired by successive queries, and that it can be used to intelligently answer new queries.
Abstract: We study the representation and querying of XML with incomplete information. We consider a simple model for XML data and their DTDs, a very simple query language, and a representation system for incomplete information in the spirit of the representations systems developed by Imielinski and Lipski [1984] for relational databases. In the scenario we consider, the incomplete information about an XML document is continuously enriched by successive queries to the document. We show that our representation system can represent partial information about the source document acquired by successive queries, and that it can be used to intelligently answer new queries. We also consider the impact on complexity of enriching our representation system or query language with additional features. The results suggest that our approach achieves a practically appealing balance between expressiveness and tractability.

Proceedings ArticleDOI
03 Apr 2006
TL;DR: This paper uses a compact data structure to encode pattern matches rather than storing them explicitly and proposes a polynomial time streaming algorithm to evaluate XPath queries by probing the data structure in a lazy fashion.
Abstract: Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML data is recursive. In this paper, we use a compact data structure to encode these pattern matches rather than storing them explicitly. We then propose a polynomial time streaming algorithm to evaluate XPath queries by probing the data structure in a lazy fashion. Extensive experiments show that our approach not only has a good theoretical complexity bound but is also efficient in practice.

Book ChapterDOI
27 Sep 2006
TL;DR: OSCAR3 is an open extensible system for the automated annotation of chemistry in scientific articles that supports applications such as interactive browsing and chemically-aware searching, and has been designed for integration with larger text-analysis systems.
Abstract: OSCAR3 is an open extensible system for the automated annotation of chemistry in scientific articles, which can process thousands of articles per hour. This XML annotation supports applications such as interactive browsing and chemically-aware searching, and has been designed for integration with larger text-analysis systems. We report its application to the high-throughput analysis of the small-molecule chemistry content of texts in life sciences, such as PubMed abstracts.

Patent
20 Apr 2006
TL;DR: Workflow Templates as discussed by the authors provide the means to create, define and store the name and definition of and 'trigger points' for each workflow item, and trigger points for when a document is used are also determined when creating the template.
Abstract: The present invention facilitates the creation and implementation of Workflow Templates and also the designation of linkage between these templates and specific projects dealing with different media type handling. Workflow Templates are used to automatically generate user interface views which will be used by agents, knowledge workers, supervisors and customers. Such Workflow Templates provide the means to create, define and store the name and definition of and 'trigger points' for each workflow item. The trigger points for when a document is used are also determined when creating the template. Further, in creating a Workflow Templates the administrator can instruct the system to save scripts associated with the template that can be saved as XML, EDI, JSP, CGI, VXML, etc. so as to be able to automatically generate documents or logic flows consistent with the target media type for the anticipated interactions with customers.

Patent
05 Jun 2006
TL;DR: In this paper, an XML-based application programming interface (API) for network router management interfaces is presented, which allows clients to formulate requests and receive replies according to an extensible markup language such as XML.
Abstract: A network router management interface for use in configuring a router and obtaining operational information provides an application programming interface (API) that permits clients to formulate requests and receive replies according to an extensible markup language such as XML. The router may transform a login stream at a router command line interface (CLI) to implement the XML-based API. For example, the management server accepts input from the CLI and, upon receipt of a particular command from the client, transforms the CLI into a programmatic interface for exchange of XML-tagged requests and XML-tagged replies according to the XML-based API. Providing access to the XML-based API via the CLI login shell enables the use of standard login, security, authentication and authorization techniques.

Patent
16 Oct 2006
TL;DR: In this article, the authors define exemplary embodiments as a method comprising rendering a verdict indicative of whether a predetermined software system functions in a predetermined manner, based upon machine instructions, which can be automatically generated via a module adapted to parse and/or load an Extensible Markup Language XML file indicative of a test case.
Abstract: Certain exemplary embodiments comprise a method comprising rendering a verdict indicative of whether a predetermined software system functions in a predetermined manner. The verdict can be determined based upon machine instructions. The machine instructions can be automatically generated via a module adapted to parse and/or load an Extensible Markup Language XML file indicative of a test case.

Patent
07 Mar 2006
TL;DR: The eXtensible on-line analytical processing (XOLAP) as discussed by the authors is a scalable client/server platform that allows the multi-dimensional analysis of modern data types, as well as traditional relational data, by bringing them all into an internal common XML-based model, without the time and expense of creating a data warehouse.
Abstract: A system and method for analyzing and reporting data from multiple sources is provided. The system is a foundation for an analytical platform that covers not only traditional relational data, but also a new generation of extensible data formats designed for the web, such as those based on XML (FIXML, FpML, ebXML, XBRL, ACORD, etc.), as well as HTML, E-mail, Excel, PDF, and others. In a preferred embodiment, the eXtensible on-line analytical processing (XOLAP), is a scalable client/server platform that allows the multi-dimensional analysis of modern data types, as well as traditional relational data, by bringing them all into an internal common XML-based model, without the time and expense of creating a data warehouse.