By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 5 • Date Oct 1994

Filter Results

Displaying Results 1 - 15 of 15
  • RAPS: a rule-based language for specifying resource allocation and time-tabling problems

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

    A general language for specifying resource allocation and time-tabling problems is presented. The language is based on an expert system paradigm that was developed previously by the authors and that enables the solution of resource allocation problems by using experts' knowledge and heuristics. The language enables the specification of a problem in terms of resources, activities, allocation rules,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity measures for rule-based programs

    Publication Year: 1994, Page(s):669 - 680
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1200 KB)

    Software complexity measures are quantitative estimates of the amount of effort required by a programmer to comprehend a piece of code. Many measures have been designed for standard procedural languages, but little work has been done to apply software complexity concepts to nontraditional programming paradigms. This paper presents a collection of software complexity measures that were specifically... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient local search with conflict minimization: a case study of the n-queens problem

    Publication Year: 1994, Page(s):661 - 668
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    Backtracking search is frequently applied to solve a constraint-based search problem, but it often suffers from exponential growth of computing time. We present an alternative to backtracking search: local search with conflict minimization. We have applied this general search framework to study a benchmark constraint-based search problem, the n-queens problem. An efficient local search algorithm f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Order structure of symbolic assertion objects

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

    We study assertion objects that constitute a particular class of symbolic objects. Symbolic objects constitute a data analysis driven formalism, which can be compared to propositional calculus, but which is oriented toward the duality intension (characteristic properties) versus extension (set of all individuals verifying a given set of properties). The set of assertion objects is endowed with a p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A space-and-time-efficient coding algorithm for lattice computations

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

    We present an encoding algorithm for lattices that significantly reduces space requirements while allowing fast computations of least upper bounds and greatest lower bounds of pairs of elements. We analyze the algorithms for encoding, LUB and GLB computations, and prove their correctness. Empirical experiments reveal that our method is significantly more space efficient than the transitive closure... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient indefiniteness inference scheme in indefinite deductive databases

    Publication Year: 1994, Page(s):713 - 722
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB)

    We introduce an inference scheme, based on the compilation approach, that can answer “true,” provable-false,” “indefinite,” or “assumable-false” to a closed query in an indefinite deductive database under the generalized closed world assumption. The inference scheme proposed in this paper consists of a representation scheme and an evaluation process that u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient query processing for a subset of linear recursive binary rules

    Publication Year: 1994, Page(s):842 - 849
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    We study the complexity of processing a class of rules called simple binary rule sets. The data referenced by the rules are stored in secondary memory. A necessary and sufficient condition that a simple binary rule set can be processed in a single pass of a file containing the base relations is given. Because not all simple binary rule sets can be processed in a single pass, a necessary and suffic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel hash-based join algorithms for a shared-everything environment

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

    Analyzes the costs, and describes the implementation, of three hash-based join algorithms for a general purpose shared-memory multiprocessor. The three algorithms considered are the hashed loops, GRACE and hybrid algorithms. We also describe the results of a set of experiments that validate the cost models presented and demonstrate the relative performance of the three algorithms View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The performance of protocols based on locks with ordered sharing

    Publication Year: 1994, Page(s):805 - 818
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1096 KB)

    There is growing evidence that for a wide variety of database workloads and system configurations, locking-based concurrency control outperforms other types of concurrency control strategies. However, in the presence of increased data contention, locking protocols such as two-phase locking perform poorly. In this paper, we analyze a family of locking-based protocols that employ a new relationship ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Toward systematic construction of diagnostic systems for large industrial plants: methods, languages, and tools

    Publication Year: 1994, Page(s):698 - 712
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1380 KB)

    We address the problem of systematically constructing diagnostic systems for large industrial plants. Toward this end, we propose an environment based on methods, languages and tools allowing systematic construction of diagnostic systems for units of large industrial plants. This environment is based on a skillful articulation of methods, languages, and tools. The process of construction proceeds ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Materialization [database design]

    Publication Year: 1994, Page(s):835 - 842
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    A new data abstraction, called Materialization, is introduced to model a situation that occurs frequently in the real world and has important implications for database design. Materialization is the relationship between two entity types, one that represents a conceptual object, for example, a TV Model, and one that represents its corresponding concrete objects, in this case, actual TV Sets. The Ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A study on the structure of linear recursion

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

    We study a general class of single linear recursions and the properties of their expansions by analyzing the structures of the recursions. We show that the expansions of a linear recursion of this class are very regular in that the variable connections are heavily shared and change periodically with respect to the expansions. The variable connections can be precisely characterized as static bindin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of affinity clustering on transaction processing coupling architecture

    Publication Year: 1994, Page(s):764 - 786
    Cited by:  Papers (16)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2264 KB)

    Coupling multiple computing nodes for transaction processing has become increasingly attractive for reasons of capacity, cost, and availability. This paper presents a comparison of robustness (in terms of performance) of three different architectures for transaction processing. In the shared nothing (SN) architecture, neither disks nor memories are shared. In the shared disk (SD) architecture, all... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A structured approach for cooperative query answering

    Publication Year: 1994, Page(s):738 - 749
    Cited by:  Papers (22)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (972 KB)

    This paper proposes the use of a type abstraction hierarchy as a framework for deriving cooperative query answers. The type abstraction hierarchy integrates the abstraction view with the subsumption (is-a) and composition (part-of) views of a type hierarchy. Such a framework provides multilevel object representation, which is an important aspect of cooperative query answering. The concept of patte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Explicit graphs in a functional model for spatial databases

    Publication Year: 1994, Page(s):787 - 804
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1684 KB)

    Observing that networks are ubiquitous in applications for spatial databases, we define a new data model and query language that especially supports graph structures. This model integrates concepts of functional data modeling with order-sorted algebra. Besides object and data type hierarchies, graphs are available as an explicit modeling tool, and graph operations are part of the query language. G... 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