IEEE Transactions on Knowledge and Data Engineering

Issue 6 • Dec. 1995

Filter Results

Displaying Results 1 - 14 of 14
  • Editorial

    Publication Year: 1995
    Request permission for commercial reuse | PDF file iconPDF (290 KB)
    Freely Available from IEEE
  • A framework for join pattern indexing in intelligent database systems

    Publication Year: 1995, Page(s):941 - 947
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    In intelligent database systems, knowledge directed inference often derives large amounts of data, and the efficiency of query processing in these systems depends upon how the derived data is maintained. This paper focuses on situations where the rule is conditional on a join of multiple data objects (relations) and the rule-derived data are materialized to reduce the overall query processing cost... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An exploration of relationships among exclusive disjunctive data

    Publication Year: 1995, Page(s):928 - 940
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1364 KB)

    We elaborate on how to interpret the query answer on exclusive disjunctive databases and how to reduce the query answer into a more concise form. Exclusive disjunctive data are represented as a pair of value set and variable set in Pv-table which is an extension of the relational model. A value set corresponds to a finite set of possible values in which exactly one value is the true value. By vari... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Early active database efforts: a capsule summary

    Publication Year: 1995, Page(s):1008 - 1010
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (344 KB)

    Over the past few years, the topic of active databases has become an important area of research. A number of efforts-both research prototypes and commercial database management systems (DBMSs)-have addressed support for event-condition-action (ECA) rules in databases. This paper examines the motivations for providing this capability, identifies features that form the basis for supporting active fu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using constraints for efficient query processing in nondeterministic databases

    Publication Year: 1995, Page(s):850 - 864
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1712 KB)

    Nondeterministic databases store disjunctive data using OR-objects. For example, data such as “Part#1 is implementable using Nickel or Cobalt” is stored as Implement(Part#1, o1 ) where Dom(o1)={Nickel, Cobalt} is the domain of the OR-object o1. A possible world of a database is obtained by replacing every OR-object by a member from its domain, and it is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The query clustering problem: a set partitioning approach

    Publication Year: 1995, Page(s):885 - 899
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1648 KB)

    In this research, we address the query clustering problem which involves determining globally optimal execution strategies for a set of queries. The need to process a set of queries together often arises in deductive database systems, scientific database systems, large bibliographic retrieval systems and several other database applications. We address the optimization problem from the perspective ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combinatorial optimization of distributed queries

    Publication Year: 1995, Page(s):915 - 927
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1300 KB)

    In relational distributed databases a query cost consists of a local cost and a transmission cost. Query optimization is a combinatorial optimization problem. As the query size grows, the optimization methods based on exhaustive search become too expensive. We propose the following strategy for solving large distributed query optimization problems in relational database systems: (1) represent each... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A formal characterization of epsilon serializability

    Publication Year: 1995, Page(s):997 - 1007
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1208 KB)

    Epsilon serializability (ESR) is a generalization of classic serializability (SR). In this paper, we provide a precise characterization of ESR when queries that may view inconsistent data run concurrently with consistent update transactions. Our first goal is to understand the behavior of queries in the presence of conflicts and to show how ESR in fact is a generalization of SR. So, using the ACTA... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic load balancing in multicomputer database systems using partition tuning

    Publication Year: 1995, Page(s):968 - 983
    Cited by:  Papers (27)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1644 KB)

    Shared nothing multiprocessor architecture is known to be more scalable to support very large databases. Compared to other join strategies, a hash-based join algorithm is particularly efficient and easily parallelized for this computation model. However, this hardware structure is very sensitive to the skew in tuple distribution. Unless the parallel hash join algorithm includes some dynamic load b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information source tracking method: efficiency issues

    Publication Year: 1995, Page(s):947 - 954
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    This paper is devoted to the study and analysis of query processing efficiency in the information source tracking (IST) technique, an approach to the representation and manipulation of uncertain and inaccurate data. We show that the efficiency depends on the average number of information sources confirming the same data in the database. If this number is close to unity, then the efficiency of quer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-constrained query processing in CASE-DB

    Publication Year: 1995, Page(s):865 - 884
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1628 KB)

    CASE-DB is a real-time, single-user, relational prototype DBMS that permits the specification of strict time constraints for relational algebra queries. Given a time constrained nonaggregate relational algebra query and a “fragment chain” for each relation involved in the query, CASE-DB initially obtains a response to a modified version of the query and then uses an “iterative qu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Utilizing page-level join index for optimization in parallel join execution

    Publication Year: 1995, Page(s):900 - 914
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1648 KB)

    This paper presents a methodology for the optimization of parallel join execution. Past research on parallel join methods mostly focused on the design of algorithms for partitioning (e.g. hash) relations and distributing data buckets as evenly as possible to the processors. Once data is distributed to the processors, it assumes that all processors will complete their tasks at about the same time. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general theory for evolving application models

    Publication Year: 1995, Page(s):984 - 996
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1344 KB)

    Provides a general theory for evolving information systems. This theory makes a distinction between the underlying information structure at the conceptual level, its evolution on the one hand, and the description and semantics of operations on the information structure and its population on the other hand. The main issues within this theory are object typing, type relatedness and identification of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exact and approximate algorithms for the index selection problem in physical database design

    Publication Year: 1995, Page(s):955 - 967
    Cited by:  Papers (15)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1344 KB)

    The index selection problem (ISP) is an important optimization problem in the physical design of databases. The aim of this paper is to show that ISP, although NP-hard, can in practice be solved effectively through well-designed algorithms. We formulate ISP as a 0-1 integer linear program and describe an exact branch-and-bound algorithm based on the linear programming relaxation of the model. The ... 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