Results 1 - 10
of
20
JavaML: A Markup Language for Java Source Code
, 2000
"... The classical plain-text representation of source code is convenient for programmers but requires parsing to uncover the deep structure of the program. While sophisticated software tools parse source code to gain access to the program's structure, many lightweight programming aids such as grep ..."
Abstract
-
Cited by 118 (4 self)
- Add to MetaCart
(Show Context)
The classical plain-text representation of source code is convenient for programmers but requires parsing to uncover the deep structure of the program. While sophisticated software tools parse source code to gain access to the program's structure, many lightweight programming aids such as grep rely instead on only the lexical structure of source code. I describe a new XML application that provides an alternative representation of Java source code. This XML-based representation, called JavaML, is more natural for tools and permits easy specification of numerous software-engineering analyses by leveraging the abundance of XML tools and techniques. A robust converter built with the Jikes Java compiler framework translates from the classical Java source code representation to JavaML, and an XSLT stylesheet converts from JavaML back into the classical textual form. Keywords: Java, XML, abstract syntax tree representation, software-engineering analysis, Jikes compiler. 1 Introduction Since...
A Formal Model for an Expressive Fragment of XSLT
, 2000
"... The extension of the XSL (eXtensible Style sheet Language) by variables and passing of data values between template rules has generated a powerful XML query language: XSLT (eXtensible Style sheet Language Transformations). An informal introduction to XSTL is given, on the bases of which a formal ..."
Abstract
-
Cited by 64 (18 self)
- Add to MetaCart
The extension of the XSL (eXtensible Style sheet Language) by variables and passing of data values between template rules has generated a powerful XML query language: XSLT (eXtensible Style sheet Language Transformations). An informal introduction to XSTL is given, on the bases of which a formal model of a fragment of XSLT is defined. This formal model is in the spirit of tree transducers, and its semantics is defined by rewrite relations. It is shown that the expressive power of the fragment is already beyond that of most other XML query languages. Finally, important properties such as termination and closure under composition are considered.
Complete Answer Aggregates for Tree-like Databases: A Novel Approach to Combine Querying and Navigation
- ACM TRANSACTIONS ON INFORMATION SYSTEMS
, 2001
"... The use of markup languages like SGML, HTML, or XML for encoding the structure of documents or linguistic data has lead . . . ..."
Abstract
-
Cited by 24 (4 self)
- Add to MetaCart
(Show Context)
The use of markup languages like SGML, HTML, or XML for encoding the structure of documents or linguistic data has lead . . .
A Graphical Environment to Query XML Data with XQuery
- In Fourth Intl. Conf. on Web Information Systems Engineering (WISE’03
, 2003
"... XQuery, the standard query language for XML, is increasingly popular among computer scientists with a SQL background, since queries in XQuery and SQL require comparable skills to be formulated. However, the number of these experts is limited, and the availability of easier XQuery “dialects ” could b ..."
Abstract
-
Cited by 13 (2 self)
- Add to MetaCart
(Show Context)
XQuery, the standard query language for XML, is increasingly popular among computer scientists with a SQL background, since queries in XQuery and SQL require comparable skills to be formulated. However, the number of these experts is limited, and the availability of easier XQuery “dialects ” could be extremely valuable. With this motivation in mind, we designed XQBE, a dialect of XQuery inspired by the QBE language (Query by Example). QBE, initially proposed as an alternative to SQL, has then become popular as the user-friendly query language supported by MS Access. XQBE starts from hierarchical structures, coherent with the hierarchical nature of XML, and uses one or more structures to denote the input documents, and one structure to denote the XML document produced in output. These structures are annotated to express selection predicates; explicit bindings connecting the nodes of these structures visualize the input/output mappings. 1
Design and Implementation of a Graphical Interface to XQuery
- PROCEEDINGS ACM SYMPOSIUM ON APPLIED COMPUTING
, 2003
"... As the use of XML is rapidly growing, a growing number of users without programming skills will need to query XML data. Although designed to be easily understood by humans, XQuery, the XML standard query language, has the typical syntax of programming languages, which most users dislike. In this pap ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
(Show Context)
As the use of XML is rapidly growing, a growing number of users without programming skills will need to query XML data. Although designed to be easily understood by humans, XQuery, the XML standard query language, has the typical syntax of programming languages, which most users dislike. In this paper we describe a graphical language (XQBE) inspired by “Query By Example” (QBE), a popular relational query language used by MS Access. XQBE covers a significant subset of XQuery and is supported by a prototype enabling the formulation of queries on a graphical interface and their translation into XQuery, thus providing non-trivial querying capabilities to a wide spectrum of users. Simple queries are easily represented in XQBE, but many “complex” queries allow as well for an intuitive graphical representation.
A Formal Comparison of Visual Web Wrapper Generators
, 2003
"... We study the core fragment of the Elog wrapping language used in the Lixto system (a visual wrapper generator) and formally compare Elog to other wrapping languages proposed in the literature. 1 Important Note The long version of the work first presented in the extended abstract [10], which appeared ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
(Show Context)
We study the core fragment of the Elog wrapping language used in the Lixto system (a visual wrapper generator) and formally compare Elog to other wrapping languages proposed in the literature. 1 Important Note The long version of the work first presented in the extended abstract [10], which appeared in Proc. 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002), Madison, Wisconsin, ACM Press, New York, USA, pp. 17 – 28, was split into two parts for journal publication. The first part [11] studies the expressive power of monadic datalog over trees and establishes the connection to the monadic fragment of the visual wrapper language Elog. The second part, subject of this paper, studies and compares Elog to other practical visual wrapper languages. Currently, this paper should be understood as an addendum to [11] and cannot be read as a standalone paper. We refer the reader to [11] for all notions of which
Using Predicates for Specifying Targets of Migration and Messages in a Peer-to-Peer Mobile Agent Environment
- In 5th Int’l Conf. on Mobile Agents
, 2001
"... Mobile agent systems are a powerful approach to develop distributed applications since they migrate to hosts on which they have the resources to execute individual tasks. Existing mobile agent systems require detailed knowledge about these hosts at the time of coding. This assumption is not acce ..."
Abstract
-
Cited by 5 (4 self)
- Add to MetaCart
(Show Context)
Mobile agent systems are a powerful approach to develop distributed applications since they migrate to hosts on which they have the resources to execute individual tasks. Existing mobile agent systems require detailed knowledge about these hosts at the time of coding. This assumption is not acceptable in a dynamic environment like a peer-to-peer network, where hosts and, as a consequence, also agents become repeatedly connected and disconnected. To this end, we propose a predicatebased approach allowing the specification of hosts an agent has to migrate to. With this highly flexible approach, termed P2PMobileAgents, we combine the benefits of execution location transparency with those of code mobility. Similarly, also the recipients of messages can be specified by predicates, e.g. for synchronisation purposes. For providing meta information about agents and hosts we use XML documents. 1
XQuery Optimization
"... We take a closer look at the optimization problems that are associated with the XQuery language. We discuss the research that has been done and some open problems along with potential solutions. ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
We take a closer look at the optimization problems that are associated with the XQuery language. We discuss the research that has been done and some open problems along with potential solutions.
SQL4X: A flexible query language for XML and relational databases
- In Proc. of the 8th International Workshop on Database and Programming Languages (DBPL
, 2001
"... Abstract. SQL4X, a powerful language for simultaneously querying both relational and XML databases is presented. Using SQL4X, one can create both relations and XML documents as query results. Thus, SQL4X can be thought of as an integration language. In order to allow easy integration of XML document ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
Abstract. SQL4X, a powerful language for simultaneously querying both relational and XML databases is presented. Using SQL4X, one can create both relations and XML documents as query results. Thus, SQL4X can be thought of as an integration language. In order to allow easy integration of XML documents with varied structures, SQL4X uses flexible semantics when querying XML. SQL4X is also a powerful query language. It can express quantification, negation, aggregation, grouping and path expressions. Datalog4x and Tree-Datalog4x, extensions of Datalog, are defined as elegant abstract models for SQL4X queries. Query containment is characterized for many common classes of SQL4X queries. Specifically, for Datalog4x queries, a complete characterization of containment of conjunctive queries and of unions of queries is presented. Equivalence of Datalog4x queries under bag-set semantics is also characterized. A sufficient condition for containment of Tree-Datalog4x queries is presented. This condition is shown to be complete for a large class of common queries. 1
