Thesis (Ph. D.)--University of Washington, 2002. / Vita. Includes bibliographical references (p. 166-185).

Thesis (M.S. in Computer Science)--Naval Postgraduate School, March 2003. / Thesis advisor(s): Don Brutzman, Curtis L. Blais. Includes bibliographical references (p. 121-122). Also available online.

Thesis (M.S. in Information Systems Technology)--Naval Postgraduate School, March 2003. / Thesis advisor(s): Magdi N. Kamel, Gordon H. Bradley. Includes bibliographical references (p. 101-103). Also available online.

Includes bibliographical references (p. 39-41).

Thesis (M.S. in Systems Technology)--Naval Postgraduate School, June 2003. / Thesis advisor(s): Don Brutzman, Jeff Weekley. Includes bibliographical references (p. 107-111). Also available online.

published_or_final_version / Computer Science and Information Systems / Master / Master of Philosophy

This thesis developed a new markup language based on eXtensible Markup Language (XML), named as the Unified Programming Markup Language (UPML), which represents an abstraction of programming techniques of popular programming languages, and is used to store the programming semantic information of various programming languages. UPML aims to provide a general software quality analysis platform and as a gateway to translate programs between high-level programming languages. This research created and analyzed the features of UPML and concluded that UPML may have advantages over the traditional and newly appeared methods in software quality analysis and programming language translation. As the proof of concept in building such a software analysis and translation system, this research developed a PHP to UPML transformer. Execution examples showed its correctness of working in the core programming area of popular programming techniques, structure programming (SP) and object-oriented programming (OOP). The PHP implementation can be easily applied to other programming languages that support the same programming techniques. Since UPML is extensible, languages of other programming paradigms beyond the SP and OOP can be easily added. / Related work -- Analysis of programming languages and programming techniques -- Implementation of UPML -- Implementation of a PHP to UPML transformer -- Examples of execution. / Department of Computer Science

Recent years have seen a surge in the popularity of XML, a markup language for representing semi-structured data. Some of this popularity can be attributed to the success that the semi-structured data model has had in environments where the relational data model has been insufficiently expressive. Concomitant with XMLs growing popularity, the world of database research has seen the rebirth of interest in tree-structured, hierarchical database systems. This thesis analyzes several problems that arise when constructing XML data management systems, particularly in the case where such systems must handle dynamic content. In the first chapter, we consider the problem of incremental schema validation, which arises in almost any XML database system. We build upon previous work by finding several classes of schemas for which very efficient algorithms exist. We also develop an algorithm that works for any schema, and prove that it is optimal. In the second chapter, we turn to the problem of improving query evaluation times on extremely large database systems. In particular, we boost the performance of the structural and twig joins, fundamental XML query evaluation techniques, through the use of an adaptive index. This index tunes itself to the query workload, providing a 20-80% boost in speed for these join operators. The adaptive nature of the index also allows updates to the database to be easily tracked. While accurate selectivity estimation is a critical problem in any database system due to its importance in choosing optimal query plans, there has been very little work on selectivity estimation in the presence of updates. We ask whether it is possible to design a structure for selectivity in XML databases that is updateable, and can return results with theoretically sound error guarantees. Through a combination of lower and upper bounds, we give strong evidence suggesting that this is unlikely in practice. Motivated by these results, we then develop a heuristic selectivity estimation structure for XML databases. This structure is the first such synopsis that can handle all aspects of core XPath, and is also updateable. Our experimental results demonstrate the efficacy of the approach.

Thesis (M.S.)--State University of New York at Binghamton, Department of Computer Science, Thomas J. Watson School of Engineering and Applied Science, 2007. / Includes bibliographical references.

Thesis (M.C.S.)--Carleton University, 2002. / Includes bibliographical references (p. 104-112). Also available in electronic format on the Internet.