Proceedings of IEEE 9th International Conference on Data Engineering

19-23 April 1993

Filter Results

Displaying Results 1 - 25 of 74
  • Proceedings of IEEE 9th International Conference on Data Engineering

    Publication Year: 1993
    Request permission for commercial reuse | PDF file iconPDF (314 KB)
    Freely Available from IEEE
  • Polyglot: extensions to relational databases for sharable types and functions in a multi-language environment

    Publication Year: 1993, Page(s):651 - 660
    Cited by:  Papers (1)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    Polyglot is an extensible relational-database-type system that supports inheritance, encapsulation, and dynamic method dispatch. It allows use from multiple application languages and permits objects to retain their behavior as they cross the boundary between database and application program. The authors describe the design of Polyglot, extensions to the structured query language (SQL) to support t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-based design bases for task-oriented systems

    Publication Year: 1993, Page(s):662 - 669
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    The nature of task-oriented application design and the rationale in building interactive design support tools are discussed. A model-based approach for the representation of design knowledge is introduced. The approach comprises an end-user task model, a problem domain data model, and an interaction domain model. These models are mapped onto an object hierarchy, allowing the construction of a desi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data quality requirements analysis and modeling

    Publication Year: 1993, Page(s):670 - 677
    Cited by:  Papers (39)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    A set or premises, terms, and definitions for data quality management are established, and a step-by-step methodology for defining and documenting data quality parameters important to users is developed. These quality parameters are used to determine quality indicators about the data manufacturing process, such as data source creation time, and collection method, that are tagged to data items. Giv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ON modularity for conceptual data models and the consequences for subtyping, inheritance and overriding

    Publication Year: 1993, Page(s):678 - 685
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    The binary relationship model is used to explain the principles of schema object types (SOTs). A SOT is a modularization concept for conventional conceptual data models, based on decomposition and abstraction from context. A SOT is at one level a single object type, but at a lower level it is described by a conceptual schema itself. The issue of subtyping, inheritance, and overriding for SOTs are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recursive functions in Iris

    Publication Year: 1993, Page(s):145 - 154
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    A complete and efficient implementation of linear, one-side recursive queries in Iris, an object-oriented database management system, is described. It is shown that recursion can be easily and efficiently added to a large class of existing database management systems. A B-tree type access path called the B++ tree that has been implemented to support the computation of recursive functions in Iris i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptable pointer swizzling strategies in object bases

    Publication Year: 1993, Page(s):155 - 162
    Cited by:  Papers (4)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    Four different approaches to optimizing the access to main memory resident persistent objects-techniques which are commonly referred to as pointer swizzling-are classified and evaluated. To speed up the access along inter-object references, the persistent pointers are transformed (swizzled) into main memory pointers (addresses). The pointer swizzling techniques allow the displacement of objects fr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for declarative updates and constraint maintenance in object-oriented databases

    Publication Year: 1993, Page(s):391 - 398
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    A framework for supporting ad-hoc declarative update requests in an object-oriented database (OODB) while maintaining database consistency and atomicity of update requests is described. The framework is based on the emulation of classic update methods in an OODB by a controlled, active, and user-transparent interaction between a predefined set of elementary updates and a set of integrity methods d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unification of temporal data models

    Publication Year: 1993, Page(s):262 - 271
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    A conceptual temporal data model that captures the time-dependent semantics of data while permitting multiple data models at the representation level is described. A conceptual notion of a bitemporal relation in which tuples are stamped with sets of two-dimensional chronons in transaction-time/valid-time space is defined. A tuple-timestamped first normal form representation is introduced to show h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On updates and inconsistency repairing in knowledge bases

    Publication Year: 1993, Page(s):608 - 615
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    A technique to compute a solution for a given update and a given knowledge base is presented. The salient features of this approach are: the problem is tackled in a general way and presents a technique for repairing inconsistency; the user can interact with the system, actively influence the solution to be generated, and is not forced to generate all possible minimal solutions from which the user ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A query model for object-oriented databases

    Publication Year: 1993, Page(s):163 - 172
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (968 KB)

    A formal object-oriented query model is described in terms of an object algebra. Both the structure and the behavior of objects are handled. An operand and the output from a query in the object algebra are defined to have a pair of sets, i.e. a set of objects and a set of message expressions, where a message expression is a valid sequence of messages. The closure property is therefore maintained i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Batch scheduling in parallel database systems

    Publication Year: 1993, Page(s):400 - 410
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    Many techniques for query scheduling in a parallel database system schedule a single query at a time. The scheduling of queries for parallel database systems by dividing the workload into batches is investigated. Scheduling algorithms that exploit the common operations within the queries in a batch are proposed. The performance of the proposed algorithms is studied using a simple analytical model ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SQL/XNF-Processing composite objects as abstractions over relational data

    Publication Year: 1993, Page(s):272 - 282
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1228 KB)

    An extension to SQL, called the SQL extended normal form (XNF), is discussed. It enhances relational technology by a composite object facility, which comprises not only extraction of composite objects from existing databases but also efficient navigation and manipulation facilities provided by an appropriate application programming interface. The language itself allows sharing of the database amon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • JazzMatch: fine-grained parallel matching for large rule sets

    Publication Year: 1993, Page(s):616 - 623
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    JazzMatch, a parallel matching algorithm explicitly designed for secondary memory-based production systems, is presented. JazzMatch is a state-saving algorithm that performs incremental match. It exploits extremely fine-grained parallelism and optimizes the storage state by permitting the sharing of common conditions in the rules. JazzMatch is supported by a message passing parallel architecture. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The O++ database programming language: implementation and experience

    Publication Year: 1993, Page(s):61 - 70
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    Ode, a database system and environment based on the object paradigm, is discussed. Ode is defined, queried and manipulated using the database programming language O++, which is based on C++. The O++ compiler translates O++ programs into C++ programs that contain calls to the Ode object manager. The implementation of O++, the Ode object manager, and the translation of the database facilities in O++... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ARIES/LHS: A concurrency control and recovery method using write-ahead logging for linear hashing with separators

    Publication Year: 1993, Page(s):243 - 252
    Cited by:  Papers (3)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    The algorithm for recovery and isolation exploitation semantics for linear hashing with separators (ARIES/LHS) that controls concurrent operations on storage structures by different users is presented. The algorithm uses fine granularity locking, guarantees serializability, and prevents rolling back transactions from getting involved in deadlocks View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance characteristics of epsilon serializability with hierarchical inconsistency bounds

    Publication Year: 1993, Page(s):587 - 594
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    The notion of hierarchical inconsistency bounds that allows inconsistency to be specified at different granularities-with transactions being at the top of the hierarchy, objects at the bottom, and groups in between-is introduced. The mechanisms needed to control the inconsistency so that it lies within the specified bounds are described. The performance improvement due to epsilon serializability (... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards more flexible schema management in object bases

    Publication Year: 1993, Page(s):174 - 181
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    An approach to database schema management is presented that allows easy tailoring of schema management, high-level specification of schema consistency, and development of advanced tools supporting the user during schema evolution. The application of this approach to the development of a simple schema manager for the core of the GOM database programming language is described. The flexibility afford... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new algorithm for computing joins with grid files

    Publication Year: 1993, Page(s):190 - 197
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    The BR2-directory representation, a directory structure for grid files, and a join algorithm for the evaluation of general n -ary joins on grid files are presented. It is shown that the CPU cost of the join algorithm is successfully reduced by introducing an inner join. A comparison with the hash join algorithm and a join algorithm on k-d trees for equijoins i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Workload balance and page access scheduling for parallel joins in shared-nothing systems

    Publication Year: 1993, Page(s):411 - 418
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    A methodology to resolve balancing and scheduling issues for parallel join execution in a shared-nothing multiprocessor environment are presented. In the past, research on parallel join methods focused on the design of algorithms for partitioning relations and distributing data buckets as evenly as possible to the processors. Once data are uniformly distributed to the processors, it is assumed tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel database systems: The case for shared-something

    Publication Year: 1993, Page(s):460 - 465
    Cited by:  Papers (6)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    Parallel database systems are becoming the primary application of multiprocessor computers. The reason for this is that they can provide high-performance and high-availability database support at a much lower price than do equivalent mainframe computers. The traditional shared-memory, shared-disk, and shared-nothing architectures of parallel database systems are compared, based on the following di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Valid-time indeterminacy

    Publication Year: 1993, Page(s):335 - 343
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    In valid-time indeterminacy, it is known that an event stored in a temporal database did in fact occur, but it is not known exactly when the event occurred. An extension of the tuple-timestamped temporal data model, called the possible chronons data model, is presented to support valid-time indeterminacy. In the possible chronons data model, each event is represented with a set of possible chronon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Voltaire: A database programming language with a single execution model for evaluating queries, constraints and functions

    Publication Year: 1993, Page(s):283 - 292
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    Various features of the Voltaire database programming language are described. Unlike most other languages, Voltaire has a single execution model for evaluating queries, enforcing constraints and computing functions. Such a design also facilitates a bootstrapped implementation. Voltaire supports a synthesis of declarative querying primitives with imperative programming primitives so that constraint... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A descriptive semantic formalism for medicine

    Publication Year: 1993, Page(s):624 - 631
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    It is argued that current clinical information systems incorporate oversimplistic, prescriptive data models that are not faithful to clinicians' observations. A non-prescriptive descriptive semantic formalism, Structured Meta Knowledge (SMK), which unifies a terminological knowledge base with controlled assertional capabilities with the medical record and supports the semantic control necessitated... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Volcano optimizer generator: extensibility and efficient search

    Publication Year: 1993, Page(s):209 - 218
    Cited by:  Papers (64)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1092 KB)

    The Volcano project, which provides efficient, extensible tools for query and request processing, particularly for object-oriented and scientific database systems, is reviewed. In particular, one of its tools, the optimizer generator, is discussed. The data model, logical algebra, physical algebra, and optimization rules are translated by the optimizer generator into optimizer source code. It is s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.