By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 4 • Date Dec 1990

Filter Results

Displaying Results 1 - 7 of 7
  • Extending SQL with general transitive closure and extreme value selections

    Publication Year: 1990, Page(s):381 - 390
    Cited by:  Papers (4)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1012 KB)

    Many recursive query processing applications are still poorly supported, partly because implementations of general recursive capabilities are inefficient and hard to understand for users, partly because the approaches do not integrate well with existing query languages. An extension is proposed of the database language SQL for the processing of recursive structures. The new constructs are integrat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constraint analysis: a design process for specifying operations on objects

    Publication Year: 1990, Page(s):391 - 400
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1124 KB)

    A design process for an object-oriented database design environment, known as constraint analysis, is presented. Given the increased level of semantics associated with an object-oriented database schema, constraint analysis makes use of semantics expressed as database constraints to support the flexible specification of propagation actions for operations on objects. Constraints are formally repres... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal specification of geographic data processing requirements

    Publication Year: 1990, Page(s):370 - 380
    Cited by:  Papers (6)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    A formal foundation for the specification of geographic data processing (GDP) requirements is established. Emphasis is on modeling data and knowledge requirements rather than processing needs. A subset of first-order logic is proposed as the principal means for constructing formalizations of the GDP requirements in a manner that is independent of the data representation. Requirements executability... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A relational approach to querying data streams

    Publication Year: 1990, Page(s):401 - 409
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    Data streams are long, relatively unstructured sequences of characters that contain information such as electronic mail or a tape backup of various documents and reports created in an office. A conceptual framework is presented, using relational algebra and relational databases, within which data streams may be queried. As information is extracted from the data streams, it is put into a relational... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effectiveness of parallel joins

    Publication Year: 1990, Page(s):410 - 424
    Cited by:  Papers (21)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1320 KB)

    The effectiveness of parallel processing of relational join operations is examined. The skew in the distribution of join attribute values and the stochastic nature of the task processing times are identified as the major factors that can affect the effective exploitation of parallelism. Expressions for the execution time of parallel hash join and semijoin are derived and their effectiveness analyz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new methodology to evaluate locking protocols

    Publication Year: 1990, Page(s):431 - 435
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB)

    The average lock range (ALR) is proposed as an evaluation factor for measuring the strengths and weaknesses of locking-based concurrency control methods, for both structural and nonstructural locking. The methodology provides a simple and general way to analyze the performance of any locking method, and requires no queueing model. Based on the concept of the ALR, two popular locking protocols, the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query evaluability in statistical databases

    Publication Year: 1990, Page(s):425 - 430
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    The evaluability of queries on a statistical database containing joinable tables connected by an intersection hypergraph is considered. A characterization of evaluable queries is given, which allows one to define polynomial-time procedures both for testing evaluability and for evaluating queries. These results are useful in designing an `informed query system' for statistical databases which promo... 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