Thesis (Ph. D.)--University of Hong Kong, 2002. / Includes bibliographical references (leaves 69-72).

Thesis (M. Sc.)--York University, 2001. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 155-159). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://wwwlib.umi.com/cr/yorku/fullcit?pMQ71641.

Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: computation pushdown; XML; order-based Xquery processing; relational database; ordered SQL queries; data model mapping; XQuery; XML data mapping; SQL; XML algebra rewrite rules; XML document order. Includes bibliographical references (p. 64-67).

Thesis (DTech. degree in Computer Science and Data Processing: Software Development.)--Tshwane University of Technology, 2012. / Based on the fundamental assumption that individuals view their privacy differently, this study attempts to find a solution on how to protect the personal information of an individual stored in a relational database system against privacy violations. Secondly, to determine how the Hippocratic principles can be effectively applied to give individuals better control over their personal information, while at the same time allowing the organisation to process its transactions on the same personalised information. In answering these problems, the study established a set of extended principles to which the collection and the use of personal data should strictly hold.

published_or_final_version / Architecture / Master / Master of Philosophy

No description available.

Database systems maintain integrity of the stored information by ensuring that modifications to the database comply with constraints designed by the administrators. As the number of users and applications sharing a common database increases, so does the complexity of the set of constraints that originate from higher level business processes. The lack of a systematic mechanism for integrating and reasoning about a diverse set of evolving and potentially interfering policies manifested as database level constraints makes corporate policy management within relational systems a chaotic process. In this thesis we present a systematic method of mapping a broad set of process centric business policies onto database level constraints. We exploit the observation that the state of a database represents the union of all the states of every ongoing business process and thus establish a bijective relationship between progression in individual business processes and changes in the database state space. We propose graphical notations that are equivalent to integrity constraints specified in linear temporal logic of the past. Furthermore we demonstrate how this notation can accommodate a wide array of workflow patterns, can allow for multiple policy makers to implement their own process centric constraints independently using their own logical policy models, and can model check these constraints within the database system to detect potential conflicting constraints across several different business processes. A major contribution of this thesis is that it bridges several different areas of research including database systems, temporal logics, model checking, and business workflow/policy management to propose an accessible method of integrating, enforcing, and reasoning about the consequences of process-centric constraints embedded in database systems. As a result, the task of ensuring that a database continuously complies with evolving business rules governed by hundreds of processes, which is traditionally handled by an army of database programmers regularly updating triggers and batch procedures, is made easier, more manageable, and more predictable.

Thesis (M.S.)--Rochester Institute of Technology, 2008. / Typescript. Includes bibliographical references (leaves 82-83).

Thesis (M.S.)--Rochester Institute of Technology, 1989. / Includes bibliographical references (leaves 67-68).

Thesis (M.A.)--University of Missouri-Columbia, 2004. / Typescript. Includes bibliographical references (leaves 212-216). Also available on the Internet.