By Topic

Knowledge and Data Engineering, IEEE Transactions on

Issue 3 • Date May/Jun 1997

Filter Results

Displaying Results 1 - 12 of 12
  • Default logic as a query language

    Publication Year: 1997 , Page(s): 448 - 463
    Cited by:  Papers (10)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (436 KB)  

    Research in nonmonotonic reasoning has focused largely on the idea of representing knowledge about the world via rules that are generally true but can be defeated. Even if relational databases are nowadays the main tool for storing very large sets of data, the approach of using nonmonotonic AI formalisms as relational database query languages has been investigated to a much smaller extent. In this... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient bulk-loading of gridfiles

    Publication Year: 1997 , Page(s): 410 - 420
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (264 KB)  

    This paper considers the problem of bulk-loading large data sets for the gridfile multiattribute indexing technique. We propose a rectilinear partitioning algorithm that heuristically seeks to minimize the size of the gridfile needed to ensure no bucket overflows. Empirical studies on both synthetic data sets and on data sets drawn from computational fluid dynamics applications demonstrate that ou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal relational data model

    Publication Year: 1997 , Page(s): 464 - 479
    Cited by:  Papers (15)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (284 KB)  

    This paper incorporates a temporal dimension to nested relations. It combines research in temporal databases and nested relations for managing the temporal data in nontraditional database applications. A temporal data value is represented as a temporal atom; a temporal atom consists of two parts: a temporal set and a value. The temporal atom asserts that the value is valid over the time duration r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance comparison of locking methods with limited wait depth

    Publication Year: 1997 , Page(s): 421 - 434
    Cited by:  Papers (4)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (220 KB)  

    A number of recent studies have proposed lock conflict resolution methods to improve the performance of standard locking, i.e., strict two-phase locking with the general waiting method. This paper is primarily concerned with the performance of wait depth limited methods with respect to each other and some other methods. The methods considered include the general waiting, wound-wait, and no-waiting... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal design of multiple hash tables for concurrency control

    Publication Year: 1997 , Page(s): 384 - 390
    Cited by:  Papers (3)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (224 KB)  

    In this paper, we propose the approach of using multiple hash tables for lock requests with different data access patterns to minimize the number of false contentions in a data sharing environment. We first derive some theoretical results on using multiple hash tables. Then, in light of these derivations, a two-step procedure to design multiple hash tables is developed. In the first step, data ite... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data on air: organization and access

    Publication Year: 1997 , Page(s): 353 - 372
    Cited by:  Papers (219)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (532 KB)  

    Organizing massive amount of data on wireless communication networks in order to provide fast and low power access to users equipped with palmtops, is a new challenge to the data management and telecommunication communities. Solutions must take under consideration the physical restrictions of low network bandwidth and limited battery life of palmtops. This paper proposes algorithms for multiplexin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SQL extension for interval data

    Publication Year: 1997 , Page(s): 480 - 499
    Cited by:  Papers (21)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (280 KB)  

    IXSQL, an extension to SQL, is proposed for the management of interval data. IXSQL is syntactically and semantically upwards consistent with SQL2. Its specification has been based both on theoretical results and actual user requirements for the management of temporal data, a special case of interval data. Design decisions and implementation issues are also discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient multiversion access structure

    Publication Year: 1997 , Page(s): 391 - 409
    Cited by:  Papers (21)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (452 KB)  

    An efficient multiversion access structure for a transaction-time database is presented. Our method requires optimal storage and query times for several important queries and logarithmic update times. Three version operations-inserts, updates, and deletes-are allowed on the current database, while queries are allowed on any version, present or past. The following query operations are performed in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of the n-dimensional quadtree decomposition for arbitrary hyperrectangles

    Publication Year: 1997 , Page(s): 373 - 383
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (536 KB)  

    We give a closed-form expression for the average number of n-dimensional quadtree nodes (“pieces” or “blocks”) required by an n-dimensional hyperrectangle aligned with the axes. Our formula includes as special cases the formulae of previous efforts for two-dimensional spaces. It also agrees with theoretical and empirical results that the number of blocks depends on the hype... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Similarity searching in medical image databases

    Publication Year: 1997 , Page(s): 435 - 447
    Cited by:  Papers (62)  |  Patents (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (424 KB)  

    We propose a method to handle approximate searching by image content in medical image databases. Image content is represented by attributed relational graphs holding features of objects and relationships between objects. The method relies on the assumption that a fixed number of “labeled” or “expected” objects (e.g., “heart”, “lungs”, etc.) are commo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved algorithm for the incremental recomputation of active relational expressions

    Publication Year: 1997 , Page(s): 508 - 511
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (56 KB)  

    Qian and Wiederhold (1991) presented an algorithm for the incremental recomputation of relational algebra expressions that was claimed to preserve a certain minimality condition. This condition guarantees that the incremental change sets do not contain any unnecessary tuples; so, redundant computations are not performed. We show that, in fact, their algorithm violates this condition. We present an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On modeling cost functions for object-oriented databases

    Publication Year: 1997 , Page(s): 500 - 508
    Cited by:  Papers (2)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (116 KB)  

    In this paper, we present a set of parameters able to exactly model topologies of object references in object-oriented databases. These parameters are important since they are used to model query execution strategy costs for optimization. The model we present considers also the cases of multivalued attributes and null references. Moreover, a set of derived parameters are introduced and their mathe... 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