By Topic

IEEE Transactions on Knowledge and Data Engineering

Issue 3 • Date Jun 1995

Filter Results

Displaying Results 1 - 12 of 12
  • Parallel natural language processing on a semantic network array processor

    Publication Year: 1995, Page(s):391 - 405
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1264 KB)

    This paper presents a parallel natural language processing system implemented on a marker-passing parallel AI computer, the Semantic Network Array Processor (SNAP). Our system uses a memory-based parsing approach in which parsing is viewed as a memory search process. Linguistic information is stored as phrasal patterns in a semantic network knowledge base distributed over the memory of the paralle... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for asynchronous parallel processing of object-oriented databases

    Publication Year: 1995, Page(s):487 - 504
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1984 KB)

    Management of large quantities of complex data is essential in many advanced application areas. Object-oriented (OO) database management system have been developed to effectively model and process the complex domain knowledge. They have been shown to outperform some existing relational systems. The existing implementations of OO database management systems attempt to improve the efficiency of OO q... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On sort-merge algorithm for band joins

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

    The article proposes two ways to improve the sort merge based band join algorithm. The techniques proposed address issues that have not been previously discussed: to choose a right relation as the inner relation to achieve better performance and to optimally allocate and adjust buffer allocations to make the algorithms robust to data skew and estimation errors View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Temporal triggers in active databases

    Publication Year: 1995, Page(s):471 - 486
    Cited by:  Papers (22)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1824 KB)

    In this paper we propose two languages, called Future Temporal Logic (FTL) and Past Temporal Logic (PTL), for specifying temporal triggers. Some examples of trigger conditions that can be specified in our language are the following: “The value of a certain attribute increases by more than 10% in 10 minutes,” “A tuple that satisfies a certain predicate is added to the database at ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • G-Log: a graph-based query language

    Publication Year: 1995, Page(s):436 - 453
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1732 KB)

    We introduce G-Log, a declarative query language based on graphs, which combines the expressive power of logic, the modeling power of complex objects with identity and the representation power of graphs. G-Log is a nondeterministic complete query language, and thus allows the expression of a large variety of queries. We compare G-Log to well-known deductive database languages, and find that it is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mapping Datalog program execution to networks of processors

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

    The problem of mapping the parallel bottom up execution of Datalog programs to an interconnected network of processors is studied. The parallelization is achieved by using hash functions that partition the set of instantiations for the rules. We first examine this problem in an environment where the number of processors and the interconnection topology is known, and communication between program s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A development environment for an object specification language

    Publication Year: 1995, Page(s):505 - 508
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    Techniques for the development of reliable information systems on the basis of their formal specification are the main concern in the project. Our work focuses on the specification language TROLL light which allows one to describe the part of the world to be modeled as a community of concurrently existing and communicating objects. Our specification language comes with an integrated, open developm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Atlas: a nested relational database system for text applications

    Publication Year: 1995, Page(s):454 - 470
    Cited by:  Papers (19)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1756 KB)

    Advanced database applications require facilities such as text indexing, image storage, and the ability to store data with a complex structure. However, these facilities are not usually included in traditional database systems. In this paper we describe Atlas, a nested relational database system that has been designed for text-based applications. The Atlas query language is TQL, an SQL-like query ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • WFS + branch and bound = stable models

    Publication Year: 1995, Page(s):362 - 377
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1584 KB)

    Though the semantics of nonmonotonic logic programming has been studied extensively, relatively little work has been done on operational aspects of these semantics. In this paper, we develop techniques to compute the well-founded model of a logic program. We describe a prototype implementation and show, based on experimental results, that our technique is more efficient than the standard alternati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Foundations of secure deductive databases

    Publication Year: 1995, Page(s):406 - 422
    Cited by:  Papers (17)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1816 KB)

    We develop a formal logical foundation for secure deductive databases. This logical foundation is based on an extended logic involving several modal operators. We develop two models of interaction between the user and the database called “yes-no” dialogs, and “yes-no-don't know” dialogs. Both dialog frameworks allow the database to lie to the user. We develop an algorithm f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability estimation during prototyping of knowledge-based systems

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

    Many knowledge based systems are designed and built with little attention paid to the reliability of the output. In this paper, we present an approach, using partitioning of both the knowledge base and the input space, that allows for the measurement of the reliability during any program increment in a rapid prototyping development cycle. Before presenting the approach, we formalize the problem us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient signature file methods for text retrieval

    Publication Year: 1995, Page(s):423 - 435
    Cited by:  Papers (21)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1208 KB)

    Signature files have been studied extensively, as an access method for textual databases. Many approaches have been proposed for searching signatures files efficiently. However, different methods make different assumptions and use different performance measures, making it difficult to compare their performance. In this paper, we study three basic methods proposed in the literature, namely, the ind... 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