By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 1 • Date Feb 1994

Filter Results

Displaying Results 1 - 16 of 16
  • Semantic query optimization for tree and chain queries

    Publication Year: 1994, Page(s):136 - 151
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1464 KB)

    Semantic query optimization, or knowledge-based query optimization, has received increasing interest in recent years. The authors provide an effective and systematic approach to optimizing queries by appropriately choosing semantically equivalent transformations. Basically, there are two different types of transformations: transformations by eliminating unnecessary joins, and transformations by ad... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Volcano-an extensible and parallel query evaluation system

    Publication Year: 1994, Page(s):120 - 135
    Cited by:  Papers (47)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1692 KB)

    To investigate the interactions of extensibility and parallelism in database query processing, we have developed a new dataflow query execution system called Volcano. The Volcano effort provides a rich environment for research and education in database systems design, heuristics for query optimization, parallel query execution, and resource allocation. Volcano uses a standard interface between alg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An object-oriented query evaluation scheme for logical databases in massively parallel environment

    Publication Year: 1994, Page(s):181 - 187
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    Taking advantage of the structure of logical representations, we report an algorithm that evaluates conjunctive queries in a massively parallel environment under an object-based representation for deductive databases. By distributing objects in a database, we show that parallel evaluation of a query can be achieved in a cooperative way so that the conventional tuple-by-tuple, operation-by-operatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prolog/Rex-a way to extend Prolog for better knowledge representation

    Publication Year: 1994, Page(s):22 - 37
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1276 KB)

    Prolog/Rex represents a powerful amalgamation of the latest techniques for knowledge representation and processing, rich in semantic features that ease the difficult task of encoding heterogeneous knowledge of real-world applications. The Prolog/Rex concept mechanism lets a user represent domain entities in terms of their structural and behavioral properties, including multiple inheritance, arbitr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Outer joins and filters for instantiating objects from relational databases through views

    Publication Year: 1994, Page(s):108 - 119
    Cited by:  Papers (7)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1056 KB)

    One of the approaches for integrating object-oriented programs with databases is to instantiate objects from relational databases by evaluating view queries. In that approach, it is often necessary to evaluate some joins of the query by left outer joins to prevent information loss caused by the tuples discarded by inner joins. It is also necessary to filter some relations with selection conditions... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A graph theoretical approach to determine a join reducer sequence in distributed query processing

    Publication Year: 1994, Page(s):152 - 165
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1160 KB)

    Semijoin has traditionally been relied upon to reduce the cost of data transmission for distributed query processing. However, judiciously applying join operations as reducers can lead to further reduction in the amount of data transmission required. In view of this fact, we explore the approach of using join operations as reducers in distributed query processing. We first show that the problem of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A protocol for establishing secure communication channels in a large network

    Publication Year: 1994, Page(s):188 - 191
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    Knowledge exchange and information access in a truly distributed network often require transmitting of data through open media. Consequently, data presented through such an environment are vulnerable to attacks. To minimize such vulnerability, data transformation or encryption/decryption techniques are often utilized among senders and receivers to achieve secure communication. Since data encryptio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The design, implementation, and performance evaluation of BERMUDA

    Publication Year: 1994, Page(s):38 - 56
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1836 KB)

    We describe the design and implementation of BERMUDA, which is a loosely coupled system interfacing Prolog to the Britton-Lee Intelligent Database Machine (IDM-500). BERMUDA allows multiple concurrent Prolog processes, possibly running on different machines, to share a database. In addition, it preserves the semantics of Prolog programs and makes the use of the database system transparent to the u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using tickets to enforce the serializability of multidatabase transactions

    Publication Year: 1994, Page(s):166 - 180
    Cited by:  Papers (27)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1516 KB)

    To enforce global serializability in a multidatabase environment the multidatabase transaction manager must take into account the indirect (transitive) conflicts between multidatabase transactions caused by local transactions. Such conflicts are difficult to resolve because the behavior or even the existence of local transactions is not known to the multidatabase system. To overcome these difficul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A computationally tractable nonmonotonic logic

    Publication Year: 1994, Page(s):57 - 63
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    Nonmonotonic logic is intended to apply specifically to situations where the initial information is incomplete. Using nonmonotonic reasoning procedures we shall be able to jump to conclusions, but withdraw them later when we gain additional information. A number of nonmonotonic logics have been introduced and widely discussed. Nonmonotonic logics tend to be introduced proof theoretically, and litt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Document processing for automatic knowledge acquisition

    Publication Year: 1994, Page(s):3 - 21
    Cited by:  Papers (25)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1600 KB)

    The knowledge acquisition bottleneck has become the major impediment to the development and application of effective information systems. To remove this bottleneck, new document processing techniques must be introduced to automatically acquire knowledge from various types of documents. By presenting a survey on the techniques and problems involved, this paper aims at serving as a catalyst to stimu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated reasoning using possibilistic logic: semantics, belief revision, and variable certainty weights

    Publication Year: 1994, Page(s):64 - 71
    Cited by:  Papers (68)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    An approach to automated deduction under uncertainty, based on possibilistic logic, is described; for that purpose we deal with clauses weighted by a degree that is a lower bound of a necessity or a possibility measure, according to the nature of the uncertainty. Two resolution rules are used for coping with the different situations, and the classical refutation method can be generalized with thes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representation of qualitative user preference by quantitative belief functions

    Publication Year: 1994, Page(s):72 - 78
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    Many intelligent systems employ numeric degrees of belief supplied by the users to make decisions. However, the users may have difficulties in expressing their belief in terms of numeric values. The authors present a method for generating belief functions from symbolic information such as the qualitative preference relationships. The method of generating belief functions provides a practical inter... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounded disorder file organization

    Publication Year: 1994, Page(s):79 - 85
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    The bounded disorder file organization proposed by W. Litwin and D.B. Lomet (1987) uses a combination of hashing and tree indexing. Lomet provided an approximate analysis with the mention of the difficulty involved in exact modeling of data nodes, which motivated this work. In an earlier paper (M.V. Ramakrishna and P. Mukhopadhyay, 1988) we provided an exact model and analysis of the data nodes, w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatial SQL: a query and presentation language

    Publication Year: 1994, Page(s):86 - 95
    Cited by:  Papers (107)  |  Patents (44)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    Recently, attention has been focused on spatial databases, which combine conventional and spatially related data, such as geographic information systems, CAD/CAM, or VLSI. A language has been developed to query such spatial databases. It recognizes the significantly different requirements of spatial data handling and overcomes the inherent problems of the application of conventional database query... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constraint-based query evaluation in deductive databases

    Publication Year: 1994, Page(s):96 - 107
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1156 KB)

    Constraints play an important role in the efficient query evaluation in deductive databases. Constraint-based query evaluation in deductive databases is investigated, with emphasis on linear recursions with function symbols. Constraints are grouped into three classes: rule constraints, integrity constraints, and query constraints. Techniques are developed for the maximal use of different kinds of ... 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
Jian Pei
Simon Fraser University

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

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