By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 1 • Date Jan/Feb 1998

Filter Results

Displaying Results 1 - 12 of 12
  • A highly effective partition selection policy for object database garbage collection

    Publication Year: 1998, Page(s):153 - 172
    Cited by:  Papers (3)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    We investigate methods to improve the performance of algorithms for automatic storage reclamation of object databases. These algorithms are based on a technique called partitioned garbage collection, in which a subset of the entire database is collected independently of the rest. We evaluate how different application, database system, and garbage collection implementation parameters affect the per... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The design and implementation of seeded trees: an efficient method for spatial joins

    Publication Year: 1998, Page(s):136 - 152
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets of spatial joins may not all have precomputed indices, particularly when they are dynamically generated by other selection or join operations. Also, existing spatial indices are mostly designed for spatial selections, and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Designing access methods for bitemporal databases

    Publication Year: 1998, Page(s):1 - 20
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    By supporting the valid and transaction time dimensions, bitemporal databases represent reality more accurately than conventional databases. The authors examine the issues involved in designing efficient access methods for bitemporal databases, and propose the partial-persistence and the double-tree methodologies. The partial-persistence methodology reduces bitemporal queries to partial persistenc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Advanced transaction processing in multilevel secure file stores

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

    The concurrency control requirements for transaction processing in a multilevel secure file system are different from those in conventional transaction processing systems. In particular, there is the need to coordinate transactions at different security levels avoiding both potential timing covert channels and the starvation of transactions at higher security levels. Suppose a transaction at a low... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coherence approach to logic program revision

    Publication Year: 1998, Page(s):108 - 119
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    In this paper, we present a new approach to the problem of revising extended programs; we base this approach on the coherence theory initially advocated by Gardenfors for belief revision. Our approach resolves contradiction by removing only conflicting information, not the believed source of it, and therefore, keeps information loss minimal. Furthermore, since there is no need to search for proble... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A logic-based transformation system

    Publication Year: 1998, Page(s):91 - 107
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    In spite of advances in various transformation systems the transformation of a nonmonotonic-logic-based requirements specification into a procedural (imperative) language program has not been investigated. This paper presents a logic-based transformation system that can transform a nonmonotonic-logic-based specification, the Frame-and-Rule Oriented Requirement Specification Language (FRORL), into ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Arbitration (or how to merge knowledge bases)

    Publication Year: 1998, Page(s):76 - 90
    Cited by:  Papers (50)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    Knowledge-based systems must be able to “intelligently” manage a large amount of information coming from different sources and at different moments in time. Intelligent systems must be able to cope with a changing world by adopting a “principled” strategy. Many formalisms have been put forward in the artificial intelligence (AI) and database (DB) literature to address this ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Topological invariants for lines

    Publication Year: 1998, Page(s):38 - 54
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    A set of topological invariants for relations between lines embedded in the 2-dimensional Euclidean space is given. The set of invariants is proven to be necessary and sufficient to characterize topological equivalence classes of binary relations between simple lines. The topology of arbitrarily complex geometric scenes is described with a variation of the same set of invariants. Polynomial time a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed optimistic concurrency control methods for high-performance transaction processing

    Publication Year: 1998, Page(s):173 - 189
    Cited by:  Papers (11)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    There is an ever-increasing demand for more complex transactions and higher throughputs in transaction processing systems leading to higher degrees of transaction concurrency and, hence, higher data contention. The conventional two-phase locking (2PL) Concurrency Control (CC) method may, therefore, restrict system throughput to levels inconsistent with the available processing capacity. This is es... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reorganizing knowledge to improve performance

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

    This paper presents a method to reorganize rules in knowledge bases with the objective of improving their performance. Knowledge reorganization is achieved through the combination of rule compression and abstraction techniques. The effectiveness of this methodology is evaluated in terms of pattern matching activity and execution times using knowledge bases from several application areas View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multiagent update process in a database with temporal data dependencies and schema versioning

    Publication Year: 1998, Page(s):21 - 37
    Cited by:  Papers (4)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    Temporal data dependencies are high-level linguistic constructs that define relationships among values of data-elements in temporal databases. These constructs enable the support of schema versioning as well as the definition of consistency requirements for a single time-point and among values in different time-points. In this paper, we present a multiagent update process in a database with tempor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • OSAM*.KBMS/P: a parallel, active, object-oriented knowledge base server

    Publication Year: 1998, Page(s):55 - 75
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    An active object-oriented knowledge base server can provide many desirable features for supporting a wide spectrum of advanced and complex database applications. Knowledge rules, which are used to define a variety of database tasks to be performed automatically on the occurrence of some events, often need much more sophisticated rule-specification and control mechanisms than the traditional priori... 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