Institute for Systems Research Technical Reports

Permanent URI for this collectionhttp://hdl.handle.net/1903/4376

This archive contains a collection of reports generated by the faculty and students of the Institute for Systems Research (ISR), a permanent, interdisciplinary research unit in the A. James Clark School of Engineering at the University of Maryland. ISR-based projects are conducted through partnerships with industry and government, bringing together faculty and students from multiple academic departments and colleges across the university.

Browse

Search Results

Now showing 1 - 8 of 8
  • Thumbnail Image
    Item
    Issues in Integrating Active Rules into Database Systems
    (1992) Cochrane, Roberta J.; Mark, L.; ISR
    An essential feature of next-generation database systems is the ability to define and process rules that respond to database events. We address several issues involved in fully integrating such active rules into multi-user database systems. We do this by investigating two very different database rule systems: the Update Dependency Language, which uses a tentative goal-oriented search strategy, and the Starburst Rule System, which uses a forward-chaining irrevocable control strategy.

    For the Update Dependency Language, we formally define the language and define safety requirements for its conditions and procedures. We analyze the lacking requirements for two different execution strategies: one that uses a depth-first search and one that uses a concurrent search. We show that it is incorrect to release shared locks on failed subpaths before a successful path is found. However, we show that two-phase locking can be relaxed to allow the early release of exclusive locks along failed subpaths.

    For the Starburst Rule System, we describe the components that handle recovery in the presence of system- generated and user-requested rollbacks. We investigate the problem of maintaining rule priorities in the Starburst Rule System and others, describing the requirements and implementation of a priority system that combines user-defined priorities and system-generated default priorities. To support an environment in which users can modify rules during normal database operations, we define consistency requirements for rule definition operations and present a solution based on hierarchical locking that maintains these consistency requirement in a multi-user environment.

  • Thumbnail Image
    Item
    Update Dependencies in the Relational Model
    (1991) Mark, Leo; Roussopoulos, N.; Cochrane, Roberta J.; ISR
    Relational database systems suffer from the lack of a rich update language. In this paper we present the Update Dependency Language which allows the database designer to specify a procedure for each update that is activated when attempts are made to perform the update. Each procedure integrates the update dependencies for an update and provides an operational semantics for the update which is maintained by the system. We provide a formal definition for this language, illustrate its use, and discuss concurrency control issues related to integrating such a language into a database system.
  • Thumbnail Image
    Item
    On Maintaining Priorities in a Production Rule System
    (1991) Agrawal, Rakesh; Cochrane, Roberta J.; Lindsay, Bruce G.; ISR
    We present a priority system which is particularly suited for production rules coupled to databases. In this system, there are default priorities between all rules and overriding user-defined priorities between particular rules. Rule processing using this system is repeatable: for a given set of rules and priorities, the rules are considered for execution in the same order if the same set of transactions is executed twice on the same initial database state. The rule order adheres to the default order as closely as possible: rules are considered in the same order as the default order unless user-defined precedence constraints force an inversion.

    We present data structures an efficient algorithms for implementing such a priority system. We show how the data structures can be incrementally maintained as user- defined priorities are altered. We also discuss how the proposed scheme can be extended to build a multi-level hierarchical priority system.

  • Thumbnail Image
    Item
    Relational Database Support for Complex Objects Defined by Grammars
    (1991) Cochrane, Roberta J.; Mark, Leo; ISR
    Context-free grammars provide the basis for many useful tools such as parsergenerators, compiler-compilers and syntax-directed editors. This paper demonstrates the potential benefits obtained when context-free grammars are used to define complex objects in the relational model. The grammar formalism facilitates relational queries on the hierarchical structure of these objects and promotes the use of grammar-based tools as front ends to relational database systems.
  • Thumbnail Image
    Item
    Implementing Set-Oriented Production Rules as an Extension to Starburst
    (1991) Widom, J.; Lindsay, Bruce G.; Cochrane, Roberta J.; ISR
    This paper describes the implementation of a set-oriented database production rule language proposed in earlier papers. Our implementation uses the extensibility features of the Starburst database system, and rule execution is fully integrated into database query and transaction processing.
  • Thumbnail Image
    Item
    Automating Relational Database Support for Objects Defined by Context-Free Grammars - the Intension-Extension Framework.
    (1989) Mark, Leo; Cochrane, Roberta J.; ISR
    We are designing a framework that provides a common foundation for the integration of databases with other areas of computer science and engineering. This framework is based on the fundamental concepts: context-free grammars and database relations.Our goal is to provide automatic database support for complex objects that can be described by context-free grammars. Such support should include Data Definition, Data Update, Grammar Catalog Generation, Data Retrieval, and Database Restructuring. This paper addresses the first three areas: Data Definition: GeneRel automatically generates a set of normalized relational schemes under which ob,iects derived from a given grammar can be stored. Data Update: GenParse automatically generates parser specifications with insertion statements for storing sentences acceptable by a given grammar. Grammar Catalog Generation: GenRel, when applied to a meta-grammar, generates relations in which grammars derived from the meta-grammar can be stored. Furthermore, GenRel and GenParse can be implemented through the specification of semantic actions in a compiler-compiler specification of the meta-grammar. We believe that GenRel and GeneParse, together with our related efforts towards providing support for data retrieval and database restructuring in this environment, provide a tool that eliminates the need for manual relational database design, enhances data storage and querying, aids in the process of database restructuring, and provides a common foundation for the integration of databases with other areas of computer science and engineenng.
  • Thumbnail Image
    Item
    Grammars and Relations.
    (1989) Mark, Leo; Cochrane, Roberta J.; ISR
    Programming languages and databases have evolved on separate foundations and with separate goals for many years. Buzzwords such as persistent data objects, objectoriented databases and software engineering databases reflect increased activity aimed at integrating the two areas at their current state of evolution. This paper suggests that we retum to basics and consider the foundation of the two areas, grammars and relations, as a basis for their integration. We present an algorithm, GeneRel, which given a grammar automatically generates a set of normalized relations in which objects derived from the grammar can be stored. We demonstrate how the algorithm applied to a meta- grammar generates relations in which grammars derived from the meta-grammar can be stored. We show how an extended relational algebra can be used to retrieve information about stored grammars and stored objects derived from the grammars. We outline an algorithm, GeneView, which given a set of non-terminals from a grammar generates a set of view definitions on the created relations.
  • Thumbnail Image
    Item
    Operational Relational Model - Implementation Through Specification.
    (1989) Cochrane, Roberta J.; ISR
    Our research evolves around the specification and implementation of the Operational Relational Model, (ORM), a model based on Update Dependencies [MARK11]. The intension and extension dimensions are explored through the construction of a self- describing system. The result, the implementation of ORM, will consist of a production system for specifying operations as an integral part of the conceptual schema of the database.