[1990] Proceedings. Sixth International Conference on Data Engineering

5-9 Feb. 1990

Filter Results

Displaying Results 1 - 25 of 66
  • Sixth International Conference on Data Engineering (Cat. No.90CH2840-7)

    Publication Year: 1990
    Request permission for commercial reuse | |PDF file iconPDF (142 KB)
    Freely Available from IEEE
  • A rule-based language for deductive object-oriented databases

    Publication Year: 1990, Page(s):58 - 67
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (868 KB)

    A deductive rule-based language for object-oriented databases is presented. A deductive rule in this language derives new patterns of associations among objects of some selected classes if these objects fall in certain `base' on other derived patterns. The patterns of object associations derived by a rule are held in a subdatabase whose intention consists of some selected classes and their associa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Access invariance and its use in high contention environments

    Publication Year: 1990, Page(s):47 - 55
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (780 KB)

    Various factors suggest that data contention may be of increasing significance in transaction processing systems. One approach to this problem is to run transactions twice, the first time without making any changes to the database. Benefits may result either from data prefetching during the first execution or from determining the locks required for purposes of scheduling. Consideration is given to... View full abstract»

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

    Publication Year: 1990, Page(s):330 - 336
    Cited by:  Papers (37)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (548 KB)

    A fingerprinting database management system presents a unique version or view of the data to each user. The view contains small pseudorandom modifications to selected data items. The objective of this system is to identify users who divulge proprietary information which they have obtained through legitimate access. Even if the user makes further modifications to the data before its misuse, a stati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A paradigm for concurrency control in heterogeneous distributed database systems

    Publication Year: 1990, Page(s):37 - 46
    Cited by:  Papers (27)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (828 KB)

    A heterogeneous distributed databases system (HDDBS) is a system which integrates preexisting databases to support global applications accessing more than one database. An outline of approaches to concurrency control in HDDBSs is presented. The top-down approach emerges as a viable paradigm for ensuring the proper concurrent execution of global transactions in an HDDBS. The primary contributions o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrency control of bulk access transactions on shared nothing parallel database machines

    Publication Year: 1990, Page(s):476 - 485
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (772 KB)

    New concurrency control schemes are proposed for bulk access transactions (BATs) on shared-nothing database machines. A BAT is a transaction accessing a large bulk of data, such as a transaction updating a whole file. BATs are used for batch jobs in database services, and many BATs should be finished in a short time. Thus it is necessary to execute BATs concurrently on a database machine. When sch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The semantic data model for security: representing the security semantics of an application

    Publication Year: 1990, Page(s):322 - 329
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (844 KB)

    Data security requirements go beyond traditional access control considerations to include relationships among data that must be protected. The author extends the data-modeling concepts to include the secrecy properties of data. The semantic data model for security (SDMS) is proposed as the vehicle for users, database designers and security officers to analyze and understand the security requiremen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrency control using locking with deferred blocking

    Publication Year: 1990, Page(s):30 - 36
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (616 KB)

    The concurrency control method employed can be critical to the performance of transaction processing systems. The conventional locking scheme tends to suffer from the blocking phenomenon. The proposed scheme reduces the blocking probability by deferring the blocking behavior of transactions to the later stages of their execution. The transaction execution can then be divided into a nonblocking pha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The generalized grid file: description and performance aspects

    Publication Year: 1990, Page(s):380 - 388
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (632 KB)

    The grid file offers multiattribute access and is a structure proposed for geometrical applications. This means that so-called point, partial match, partial range and range queries for the concerned attributes are supported. The generalized grid file (GGF), which offers fast access for a single attribute too, is described. The performance of the GGF structure is evaluated for the business environm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multiuser performance analysis of alternative declustering strategies

    Publication Year: 1990, Page(s):466 - 475
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (836 KB)

    An analysis is made of the impact of three alternative declustering strategies on the performance of the selection queries using different storage/access structures in a multiuser environment. The authors quantify the tradeoffs of each organization in the context of the Gamma database machine. The response time and throughput of the system are used as the performance metric for evaluating the alte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Attribute inheritance implemented on top of a relational database system

    Publication Year: 1990, Page(s):503 - 509
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (428 KB)

    An implementation technique which solves integrity checking, query evaluation, and transaction synchronization tasks in database systems with multiple attribute inheritance and uses the support of a relational database system is presented. It is shown how to implement an integrity checker and a transaction synchronization component of a database system with attribute inheritance. The basic idea is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatial search with polyhedra

    Publication Year: 1990, Page(s):311 - 319
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (676 KB)

    Range searches in multidimensional space have been studied extensively, and several excellent search structures have been devised. However, all of these require that the ranges in the different dimensions be specified independently. In other words, only rectangular regions can be specified and searched for. Similarly, nonpoint objects can be indexed only in terms of their bounding rectangles. Howe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multimedia objects models for synchronization and databases

    Publication Year: 1990, Page(s):20 - 27
    Cited by:  Papers (9)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (724 KB)

    The authors propose a technique for formally specifying and modeling the temporal composition of multimedia data. The proposed model is based on timed Petri nets and the logic of temporal intervals. A strategy based on the inter media timing relationships established by the proposed modeling tool is presented for constructing a database schema to facilitate data storage and retrieval of data eleme... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The R-file: an efficient access structure for proximity queries

    Publication Year: 1990, Page(s):372 - 379
    Cited by:  Papers (4)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (624 KB)

    In many nonstandard database applications, spatial access to geometric objects is very important. A new access structure, the R-file, is presented for geometric objects in a dynamic environment. An extensive performance evaluation reveals that the R-file, which is based on handling axis-parallel rectangles in secondary storage, has higher storage space utilization and a more compact directory, and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Chained declustering: a new availability strategy for multiprocessor database machines

    Publication Year: 1990, Page(s):456 - 465
    Cited by:  Papers (76)  |  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (936 KB)

    A new strategy for increasing the availability of data in multiprocessor, shared-nothing database machines is presented. This technique, termed chained declustering, is demonstrated to provide superior performance in the event of failures while maintaining a very high degree of data availability. Furthermore, unlike most earlier replication strategies, the implementation of chained declustering re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Join index, materialized view, and hybrid-hash join: a performance analysis

    Publication Year: 1990, Page(s):256 - 263
    Cited by:  Papers (12)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (692 KB)

    The problem of efficiently computing a joint between two base relations in the presence of queries and updates to the base relations is dealt with. A performance analysis of three methods: join index, materialized view, and hybrid-hash join, is presented. The first two methods are examples of a strategy based on data caching; they represent two ends of a spectrum of possibilities depending on the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On representing indefinite and maybe information in relational databases: a generalization

    Publication Year: 1990, Page(s):495 - 502
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (404 KB)

    The authors present a generalization of the relational model to represent indefinite and maybe kinds of incomplete information. They introduce a data structure called M-table which is capable of representing disjunctive/indefinite and maybe facts. The notion of redundancy in the context of indefinite and maybe information is studied. The information content of an M-table is precisely defined. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Update propagation in distributed memory hierarchy

    Publication Year: 1990, Page(s):521 - 528
    Cited by:  Papers (8)  |  Patents (30)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (664 KB)

    A distributed memory hierarchy (DMH) is a memory system consisting of storage modules distributed over a high-bandwidth local area network. It provides for transaction applications an abstraction of single virtual memory space to which shared data are mapped. As in a conventional memory hierarchy (MH) in a single-machine system, a DMH is responsible for locating, migrating, and caching data pages;... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Database buffer model for the data sharing environment

    Publication Year: 1990, Page(s):538 - 544
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (560 KB)

    A simple analytic buffer model for coupled systems sharing a common database is developed. When a data block gets updated by a system, copies of that block in other systems' buffers need to be invalidated. This cross-invalidation phenomenon makes the estimation of the buffer hit ratio interesting. The concurrency control (CC) scheme can also complicate the situation. Under the optimistic CC protoc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using a metamodel to represent object-oriented data models

    Publication Year: 1990, Page(s):11 - 19
    Cited by:  Papers (3)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (620 KB)

    A metamodel for describing the semantics of object-oriented data models is presented. This metamodel supports the automatic generation of conceptual database design tool software for a variety of data models. Data modeling is viewed as having three levels of abstraction. The physical database, at the lowest level, stores objects and relationships. Specific data models reside at the middle level. A... View full abstract»

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

    Publication Year: 1990, Page(s):154 - 162
    Cited by:  Papers (50)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (740 KB)

    An algebra that synthesizes relational query concepts with object-oriented databases is defined. The algebra fully supports abstract data types and object identity, while providing associative access to objects. The operations take an abstract view of objects and access typed collections of objects through the public interface defined for the type. The algebra supports access to relationships impl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to share work on shared objects in design databases

    Publication Year: 1990, Page(s):575 - 583
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (704 KB)

    Designers in CAD environments typically perform long-duration modifications of completely structure objects and work cooperatively in design teams. Several forms of design transactions for nonstandard database systems have been proposed as a mechanism to support their kind of operational pattern. They are partitioned by checkout/check-in operations and/or divided into several kinds of subtransacti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Selectivity estimation using homogeneity measurement

    Publication Year: 1990, Page(s):304 - 310
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (584 KB)

    A new approach is presented for organizing a large collection of multidimensional data with an unknown distribution by partitioning the data such that the data are relatively homogeneously distributed in each block. A multidimensional tree is generated according to this partition. After the tree is generated, summary data estimation such as selectively estimation can be performed via a tree search... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalization and a framework for query modification

    Publication Year: 1990, Page(s):138 - 145
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (684 KB)

    The rigidity and limited expressiveness of relational queries often require that a query be iteratively modified. An initial query is posed, and once it is discovered that the answer does not meet the additional constraints, which are not expressed in the relational query, it is necessary to modify the query in a way such that those constraints are satisfied. The aim of this work is to capture thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ViewSystem: integrating heterogeneous information bases by object-oriented views

    Publication Year: 1990, Page(s):2 - 10
    Cited by:  Papers (35)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (772 KB)

    In order to overcome practical integration problems, ViewSystem, an object-oriented programming environment with dedicated integration operators by which syntactically and semantically heterogeneous information can be integrated incrementally, has been developed. ViewSystem provides an object-oriented query language and a method language with universal computational power and a distinguished set o... View full abstract»

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