Scheduled System Maintenance
On Tuesday, May 22, IEEE Xplore will undergo scheduled maintenance. Single article sales and account management will be unavailable
from 6:00am–5:00pm ET. There may be intermittent impact on performance from noon–6:00pm ET.
We apologize for the inconvenience.

[1992] Eighth International Conference on Data Engineering

2-3 Feb. 1992

Filter Results

Displaying Results 1 - 25 of 72
  • Eighth International Conference on Data Engineering (Cat. No.92CH3097-3)

    Publication Year: 1992
    Request permission for commercial reuse | PDF file iconPDF (755 KB)
    Freely Available from IEEE
  • Knowledge mining by imprecise querying: a classification-based approach

    Publication Year: 1992, Page(s):622 - 630
    Cited by:  Papers (24)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    Knowledge mining is the process of discovering knowledge that is hitherto unknown. An approach to knowledge mining by imprecise querying that utilizes conceptual clustering techniques is presented. The query processor has both a deductive and an inductive component. The deductive component finds precise matches in the traditional sense, and the inductive component identifies ways in which imprecis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data hiding and security in object-oriented databases

    Publication Year: 1992, Page(s):338 - 347
    Cited by:  Papers (3)  |  Patents (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    Hiding is an important characteristic of the object-oriented paradigm. The author shows how hiding can be exploited to support data security and privacy. The model is based on a single type of authorization, that is, the authorization of a user to execute a method on a given object. The rationale of the authorization model is described. A formal definition of the model is presented, and the algori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maintenance of materialized views of sampling queries

    Publication Year: 1992, Page(s):632 - 641
    Cited by:  Papers (5)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    The authors discuss materialized views of random sampling queries of a relational database. They show how to maintain such views in the presence of insertions, deletions, and updates of the base relations. The basic idea is to reuse the maximal portion of the original sample when constructing the updated sample. The results are based on a synthesis of view update techniques and sampling algorithms... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mapping a version model to a complex-object data model

    Publication Year: 1992, Page(s):348 - 357
    Cited by:  Papers (8)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    The authors present a version model for CAD purposes and its implementation on the basis of a complex-object database management system. The functionality of the model is illustrated with the help of a VLSI design example. In contrast to similar solutions based on the relational data model, this approach allows for a simple and efficient implementation of the version model, allowing for powerful r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logical database design with inclusion dependencies

    Publication Year: 1992, Page(s):642 - 649
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    Classical data dependencies are oblivious to important constraints which may exist between sets of attributes occurring in different relation schemes. The authors study how inclusion dependencies can be used to model these constraints, leading to the design of better database schemes. A normal form called the inclusion normal form (IN-NF) is proposed. Unlike classical normal forms, the IN-NF chara... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A keying method for a nested relational database management system

    Publication Year: 1992, Page(s):438 - 446
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    The authors discuss the keying methods that are proposed in the literature and introduce the external keying method which aims to restore the structure of tuples that is lost by unnesting a relation valued attribute in a nested relation. As opposed to the previous keying methods, it does not store the keying information within the relation instance which can be manipulated by relational algebra. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An index implementation supporting fast recovery for the POSTGRES storage system

    Publication Year: 1992, Page(s):293 - 300
    Cited by:  Papers (1)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    The authors present two algorithms for maintaining B-tree index consistency in a database management system which does not use write-ahead logging (WAL). One algorithm is similar to shadow paging, but improves performance by integrating shadow meta-data with index meta-data. The other algorithm uses a two-phase page reorganization scheme to reduce the space overhead caused by shadow paging. Althou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • M(DM): an open framework for interoperation of multimodel multidatabase systems

    Publication Year: 1992, Page(s):218 - 227
    Cited by:  Papers (7)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    The authors present M(DM), an extensible metalevel system in which the syntax and the semantics of data models, schemas, and databases can be uniformly represented. M(DM) consists primarily of a set of metatypes that capture and express data-model constructs in second-order logic: a data model is represented as a collection of M(DM) metatypes. To achieve extensibility, M(DM)'s metatypes are organi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic diagnosis of hot spots

    Publication Year: 1992, Page(s):30 - 39
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The authors present several techniques to identify, or diagnose, hot spots in a database. All of them are probabilistic in the sense that they will classify the items as hot or cold and exhibit a non-zero probability of false diagnoses. Each technique is analysed to identify the tradeoffs of time and space involved in maintaining a low probability of false diagnosis. Each of the techniques is pres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed rule processing in active databases

    Publication Year: 1992, Page(s):106 - 113
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    Processing rules in a distributed active database involves three design issues: how to decompose rules, how to distribute rules to sites, and how to evaluate distributed rules correctly. The authors study these three issues for complicated rules, which are complex and time-consuming to evaluate. They propose a relational operator, AND, and the associated algebraic manipulations of this operator to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal versioning of objects

    Publication Year: 1992, Page(s):358 - 365
    Cited by:  Papers (4)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    The purpose of versioning is to reconstruct any past state of an object class. The authors show that access to any past version is possible in almost constant time, while the space used is only linear to the number of changes occurring in the class evolution. As a result, versioning with fast reconstruction can be supported in an object-oriented environment without using excessive space requiremen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prepare and commit certification for decentralized transaction management in rigorous heterogeneous multidatabases

    Publication Year: 1992, Page(s):470 - 479
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    Algorithms for scheduling of distributed transactions in a heterogeneous multidatabase, in the presence of failures, are presented. The algorithms of prepare certification and commit certification protect against serialization errors called global view distortions and local view distortions. View serializable overall histories are guaranteed in the presence of most typical failures. The assumption... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processing hierarchical queries in heterogeneous environment

    Publication Year: 1992, Page(s):394 - 401
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    The authors investigate principles of translating relational queries to hierarchical queries. Instead of using a specific hierarchical database system they abstract a generic hierarchical database system (GHDBS) which has properties common to database systems whose schema contain hierarchical structures. Principles of query translation with GHDBS as the receiving database system are developed. Rul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A spanning tree transitive closure algorithm

    Publication Year: 1992, Page(s):2 - 11
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    The authors present a transitive closure algorithm that maintains a spanning tree of successors for each node rather than a simple successor list. This spanning tree structure promotes sharing of information across multiple nodes and leads to more efficient algorithms. An effective relational implementation of the spanning tree storage structure is suggested, and it is shown how blocking can be ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ESQL2: an object-oriented SQL with F-Logic semantics

    Publication Year: 1992, Page(s):320 - 327
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    ESQL2 is an SQL2 upward-compatible database language that integrates the essential concepts of relational, object-oriented, and deductive databases. ESQL2's salient features are a rich and extendible type system based on abstract data types (ADTs) implemented in various programming languages, complex objects with object sharing by combining generic ADTs and object identity, the capability of query... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An abstraction mechanism for modeling generation

    Publication Year: 1992, Page(s):650 - 658
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    An abstraction mechanism for modeling the generation of entities from other entities is presented. It is shown to be useful for representing a wide range of generative processes, including those which are reversible, spontaneous, and involve multiple inputs and outputs. The mechanism is related to an earlier defined abstraction mechanism which represents the transitional behavior of existing entit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A declarative approach to active databases

    Publication Year: 1992, Page(s):452 - 456
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    A general description is provided of the field of active databases, focusing on the main problems yet to be solved. The author suggests that deductive databases may contribute to the understanding of some of these problems. Classes of applications that can be specified in a declarative manner are indicated. Important classes of active database applications can have a declarative interface supporti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient database storage structure for large dynamic objects

    Publication Year: 1992, Page(s):301 - 308
    Cited by:  Papers (9)  |  Patents (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    The author presents storage structures and algorithms for the efficient manipulation of general-purpose large unstructured objects in a database system. The large object is stored in a sequence of variable-size segments, each of which consists of a large number of physically contiguous disk blocks. A tree structure indexes byte positions within the object. Disk space management is based on the bin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fault-tolerant algorithm for replicated data management

    Publication Year: 1992, Page(s):230 - 237
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    The problem of managing replicated copies of data in a distributed database is considered. Quorum consensus methods for managing replicated data require that an operation proceed only if a group of copies form a quorum. For example, in a majority voting scheme, for a write operation to proceed, a majority of the copies have to form a quorum. The authors first introduce a performance measure for me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast read-only transactions in replicated databases

    Publication Year: 1992, Page(s):246 - 253
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    The authors present a propagation mechanism, called the commit propagation mechanism (CPM), which increases the availability of data for read-only transactions. The proposed mechanism is piggy-backed on the messages used in the two-phase commit protocol. The CPM was combined with the standard quorum protocol in two different replicated database systems. In a fully replicated database, CPM allows a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Divergence control for epsilon-serializability

    Publication Year: 1992, Page(s):506 - 515
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    The authors present divergence control methods for epsilon-serializability (ESR) in centralized databases. ESR alleviates the strictness of serializability (SR) in transaction processing by allowing for limited inconsistency. The bounded inconsistency is automatically maintained by divergence control (DC) methods in a way similar to the manner in which SR is maintained by concurrency control mecha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • History-less checking of dynamic integrity constraints

    Publication Year: 1992, Page(s):557 - 564
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    An efficient implementation method is described for dynamic integrity constraints formulated in past temporal logic. Although the constraints can refer to past states of the database, their checking does not require that the entire database history be stored. Instead, every database state is extended with auxiliary relations that contain the historical information necessary for checking constraint... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient object-based algorithm for spatial searching, insertion and deletion

    Publication Year: 1992, Page(s):40 - 47
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    The authors propose an object-based index structure for manipulating spatial objects with non-zero size. They introduce the main ideas of the proposed index structure. A detailed description of the algorithms is given for searching, insertion, and deletion in a database system with a high frequency of retrievals and a low frequency of insertions and deletions. The algorithms are then described for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An object-oriented model for capturing data semantics

    Publication Year: 1992, Page(s):126 - 135
    Cited by:  Papers (1)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    OBJECTModeler is a multi-user, Unix-based software tool which implements an object-oriented data modeling design methodology supporting the definition of various types of semantic objects and their interrelationships. Subtypes can be defined through inheritance. The methodology incorporates the mechanism to extract functional and multivalued dependencies as well as relational constraints from the ... View full abstract»

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