By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 1 • Feb 1992

Filter Results

Displaying Results 1 - 8 of 8
  • A universal relation data model with semantic abstractions

    Publication Year: 1992, Page(s):23 - 33
    Cited by:  Papers (9)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1048 KB)

    Two important features of modern database models are support for complex data structures and support for high-level data retrieval and update. The first issue has been studied by the development of various semantic data models; the second issue has been studied through universal relation data models. How the advantages of these two approaches can be combined is presently examined. A new data model... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • System-guided view integration for object-oriented databases

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

    Some of the shortcomings of current view integration methodologies, namely, a low emphasis on full-scale automated systems, a lack of algorithmic specifications of the integration activities, inattention to the design of databases with new properties such as databases for computer-aided design, and insufficient experience with data models with a rich set of type and abstraction mechanisms, are att... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification and compilation of linear recursive queries in deductive databases

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

    The authors present a graph model which is powerful in classifying and compiling linear recursive formulas in deductive databases. The graph model consists of two kinds of graphs: I-graph and resolution graph. Essential properties of a recursive formula can be extracted from its I-graph, and the compiled formula and the query evaluation plan of the recursive formulas can be determined from its res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal distribution of signatures in signature hashing

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

    G.H. Gonnet and P.A. Larson (1982) proposed a hashing scheme for external files which guarantees single access retrieval. They provided an asymptotic analysis of the scheme assuming uniform distribution of the signatures. This paper addresses an open problem posed by them in a second work (J. ACM, vol.35, no.1, p.161-84, 1988) about the performance of signatures having a skew distribution. An opti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A FAD for data intensive applications

    Publication Year: 1992, Page(s):34 - 51
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1672 KB)

    FAD is a strongly typed database programming language designed for uniformly manipulating transient and persistent data on Bubba, a parallel database system developed at MCC. The paper provides an overall description of FAD, and discusses the design rationale behind a number of its distinguishing features. Comparisons with other database programming languages are provided View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New order preserving access methods for very large files derived from linear hashing

    Publication Year: 1992, Page(s):68 - 82
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1232 KB)

    A class of order-preserving dynamic hashing structures is introduced and analyzed. The access method is referred to as the dynamic random-sequential access method (DRSAM) and is derived from linear hashing. A new logical to physical mapping that is based on sequential bucket allocations in hash order is proposed. With respect to previous methods, this allocation technique has the following charact... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating block selectivities for physical database design

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

    Access path deployment is a critical issue in physical database design. Access paths typically include a clustered index as the primary access path and a set of secondary indexes as auxiliary access paths. To deploy the right access paths requires an effective algorithm and accurate estimation of the parameters used by the algorithm. One parameter central to any index-selection algorithm is the bl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A probabilistic limit on the virtual size of replicated disk systems

    Publication Year: 1992, Page(s):99 - 102
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    Recently, there has been considerable interest in parallel disk drive systems, in which full or partial replication of the stored data is used for both fault tolerance and enhanced performance. The performance-enhancement derives both from the ability to do parallel reads, and from the reduction of seek time which results from being able to assign a read to whichever drive will produce the shortes... View full abstract»

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

Aims & Scope

IEEE Transactions on Knowledge and Data Engineering (TKDE) informs researchers, developers, managers, strategic planners, users, and others interested in state-of-the-art and state-of-the-practice activities in the knowledge and data engineering area.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Xuemin Lin
University of New South Wales

Associate Editor-in-Chief
Lei Chen
Hong Kong University of Science and Technology