OpenRaiser/Intern-Atlas huggingface dataset:
An Integrated Approach to Quality Assurance of Expert System Knowledge Bases
Authors: Neli Zlatareva
Venue: CIKM
Year: 1993

Article Free Access Share on An integrated approach to quality assurance of expert system knowledge bases Author: Neli P. Zlatareva Department of Computer Science, Central Connecticut State University, New Britain, CT Department of Computer Science, Central Connecticut State University, New Britain, CTView Profile Authors Info & Claims CIKM '93: Proceedings of the second international conference on Information and knowledge managementDecember 1993 Pages 85–94https://doi.org/10.1145/170088.170109Published:01 December 1993Publication History 2citation360DownloadsMetricsTotal Citations2Total Downloads360Last 12 Months8Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Modeling Behavior, A Step Towards Defining Functionally Correct Views of Complex Objects in Concurrent Engineering
Authors: Fawaz S. Al-Anzi, David L. Spooner
Venue: CIKM
Year: 1994

Multidisciplinary concurrent engineering needs to model and manage different views of complex designs. Previous attempts to address the problem of creating views of complex objects in object oriented database systems focus on the structure of complex objects; little attention is paid to how complex object behavior is effected when creating views. We believe that designing functionally correct behavior for a complex object should be a major consideration when defining a view to guarantee correctness of the derived classes.In this paper, we study the problem for designing functionally correct views of complex objects in concurrent engineering. View behavioral modeling requirements are presented. A behavior model that satisfies these requirements is presented. This model is demonstrated on an example complex object that represents process management.
Closure Maintenance in An Object-Oriented Query Model
Authors: Reda Alhajj, Faruk Polat
Venue: CIKM
Year: 1994

An object-algebra is presented as a formal query model for object-oriented data models. The algebra serves not only to access and manipulate the structure and behavior of objects, but it also supports the creation of new objects and the introduction of new relationships into the schema. It provides a more powerful and flexible tool than messages for effectively dealing with complex situations and meeting associative access requirements. Operands as well as the results of operations in the proposed algebra are formally characterized as a pair of sets—a set of objects capturing the states and a set of message expressions comprised of sequences of messages modeling the object behavior. The closure property is achieved in a natural way by letting the results of operations possess the same characteristics as the operands in an algebra expression. Some operators of the algebra resemble those of the relational algebra but with different syntax and semantics. Additional operators are introduced to complement them. A class is shown to posses the properties of an operand by defining a set of objects and deriving a set of message expressions for it. Furthermore, the result of an object algebra expression is shown to have the characteristics of a class whose superclass/subclass relationships with its operand class(es) can be established providing a mechanism to properly and persistently place it in the class lattice (schema).
Introducing Semantics in Conceptual Schema Reuse
Authors: Ana Paula Ambrósio
Venue: CIKM
Year: 1994

Although standard components' manufacture and reuse is common practice in many engineering domains (e.g. electrical and mechanical engineering), this is not yet the case with respect to software development. Ironically, in such a highly “automated” domain, users still fail to find available components that match their needs faster than developing them again. The gap between what designers expect from reuse (and how it should be offered), and the actual reuse attempts remains the main barrier. This paper deals with conceptual schema construction in terms of reuse and the respective semantic requirements. It proposes a semantic retrieval mechanism based on imprecise queries for the reuse of conceptual schema components.
An Object-Oriented Database Application for HyTime Document Storage
Authors: Klemens Böhm, Karl Aberer
Venue: CIKM
Year: 1994

An open hypermedia-document storage system has to meet requirements that are not satisfied by existing systems: it has to support non-generic hypermedia document types, i.e. document types enriched with application-specific semantics. It has to provide hypermedia-document access methods. Finally, it has to allow the exchange of hypermedia documents with other systems. On a technical level, an object-oriented database-management system, on a logical level, a well established ISO standard, namely HyTime, is used to satisfy the requirements mentioned above. By means of the example of documents incorporating hypertext structures we discuss the impact of taking such an approach on representation and processing within the database system.
Structured Document Handling - A Case For Integrating Databases and Information Retrieval
Authors: Klemens Böhm, Adrian Müller, Erich J. Neuhold
Venue: CIKM
Year: 1994

In this paper we discuss the structured multimedia documents that will be, or already are, to some degree the communication backbone of the so-called superhighways. It will be shown that storage and retrieval of such documents will best be handled by an integration of database and information retrieval technologies. We assume documents to be structured with the help of standards like SGML/HyTime and represented by the multitude of formats currently used for multimedia data.
Quantitative Evaluation of a Transaction Facility for a Knowledge Base Management System
Authors: Vinay K. Chaudhri, Vassos Hadzilacos, John Mylopoulos, Kenneth C. Sevcik
Venue: CIKM
Year: 1994

Large knowledge bases that are intended for applications such as CAD, corporate repositories or process control will have to be shared by multiple users. For these systems to scale up, to give acceptable performance and to exhibit consistent behavior, it is mandatory to synchronize user transactions using a concurrency control algorithm. In this paper, we examine a novel concurrency control policy called Dynamic Directed Graph (or DDG) policy that effectively exploits the rich semantic structure of a knowledge base.
An Optimal Graph Traversal Algorithm for Evaluating Linear Binary-Chain Programs
Authors: Yangjun Chen, Theo Härder
Venue: CIKM
Year: 1994

Grahne et al. have presented a graph algorithm for a subset of recursive queries. This method consists of two phases. In the first phase, the method transforms a linear binary-chain program into a set of equations over expressions containing predicate symbols. In the second phase, a graph is constructed from the equations and the answers are produced by traversing the relevant paths. Here we describe a new algorithm which requires less time than the algorithm of Grahne et al. The key idea of the improvement is to reduce the search space that will be traversed when a query is invoked. Further, we speed up the evaluation of cyclic data by generating most answers directly in terms of the answers already found and the associated “path information” instead of traversing the corresponding paths as usual. In this way, our algorithm achieves a linear time complexity for both cyclic and non-cyclic data.
An Optimized Implementation for VML Based on Pattern Matching and Dynamic Programming
Authors: Weimin Chen, Volker Turau
Venue: CIKM
Year: 1994

In an object-oriented database system (OODBS), objects exist persistently and object I/O is transparent to the programmer. Therefore, some mechanism in the system must initiate I/O as the program runs. In this paper we present an approach based on pattern matching and dynamic programming that allows a program to interact efficiently with the runtime storage layer. We are interested in allowing programs to manipulate very large objects without necessarily reading them entirely. If a program touches only a small part of a large object, the problem is how to determine the part of the object needed. In this paper, we present an approach based on pattern matching and dynamic programming to resolve this problem.
A Pattern Matching Language for Spatio-Temporal Databases
Authors: Tsz S. Cheng, Shashi K. Gadia
Venue: CIKM
Year: 1994

We propose a pattern matching language for spatio-temporal databases. The matching process in time dimension is based upon the evolutionary nature of time, but in spatial dimension it is based on placement, shape and sizes of regions. The concept of pattern matching introduced in this paper is independent of the choice of the underlying model for spatio-temporal databases. In particular, the pattern matching language seamlessly extends our SQL-like query language ParaSQL for spatio-temporal databases. The pattern matching language would also have application in active databases, because patterns can be used as triggers.
Minipage Locking Support for Object-Oriented Page-Server DBMS
Authors: Iris Sheauyin Chu, Marianne Winslett
Venue: CIKM
Year: 1994

Many object-oriented database systems are implemented using a page-server architecture for its performance advantages. Since the applications envisioned for object-oriented DBMSes typically spend a great deal of time processing data already in memory, fast in-memory access is very important. A page-server architecture will permit an implementation where most routine reference following (i.e., where the referenced data is in memory and appropriately locked) is handled by virtual memory hardware to eliminate expensive software overhead. One of the major drawbacks of this approach is that locking and authorization must be handled on a per-page basis, causing unacceptable low concurrency for high-contention data pages and difficulties in supporting fine-grained authorization. With hardware support on the client side for locks on minipages (subdivisions of a page), however, it is possible to have good improvements in concurrency for high-contention areas of the database, along with the ability to do fine-grained authorization. This paper presents a callback-read locking scheme that makes use of hardware-assisted locking of minipages and compares its performance with one that uses page protection under four different workloads. Minipages are already available in several commonly used platforms, but only at the internal levels of the operating system. We conclude that minipages improve performance significantly in high-contention workloads, with minimal performance impact under low-contention workloads, and that minipage facilities should be made visible to client DBMS code. We also discuss the application of our locking algorithms to page servers that supporting object-level locking.
Analytical Version Control Management in a Hypertext System
Authors: Antonina Dattolo, Antonio Gisolfi
Venue: CIKM
Year: 1994

In this paper it is shown how structural and cognitive versioning issues can be efficiently managed in a Petri nets based hypertextual model. The advantages of this formalism are enhanced by modular and structured modeling; modularity allows to focus the attention only on some modules, while giving the abstraction of the others. Each module owns metaknowledge that is useful in defining new layers and contexts.
Facilitating Transformations in a Human Genome Project Database
Authors: Susan B. Davidson, Anthony Kosky, Barbara A. Eckman
Venue: CIKM
Year: 1994

Human Genome Project databases present a confluence of interesting database challenges: rapid schema and data evolution, complex data entry and constraint management, and the need to integrate multiple data sources and software systems which range over a wide variety of models and formats. While these challenges are not necessarily unique to biological databases, their combination, intensity and complexity are unusual and make automated solutions imperative. We illustrate these problems in the context of the Philadelphia Genome Center for Human Chromosome 22, and describe a new approach to a solution for these problems, by means of a deductive language for expressing database transformations and constraints.
The Role of the Database Community in the National Information Infrastructure
Authors: David W. Flater, Yelena Yesha
Venue: CIKM
Year: 1994

The computer science community is increasingly focusing its efforts on tasks related to the National Information Infrastructure. Hardware and software advances are being sought to make wide-area networks and technological resources in general more useful to mainstream society. With this transition comes a set of unavoidable political and social issues that have never been satisfactorily dealt with in the past. Grand challenges face the computer science community on both the technical and the socio-political sides of this “major upgrade.” This paper discusses various aspects of the enormous coordination problem that faces all of us and considers what the database community can do to help.
Management of Disk Space with REBATE
Authors: Shahram Ghandeharizadeh, Doug Ierardi
Venue: CIKM
Year: 1994

The past decade has witnessed a proliferation of respositories whose workload consists of queries that retrieve information. These repositories provide on-line access to vast amount of data and serve as an integral component of many application domains (e.g., library information systems, scientific applications, entertainment industry). Their storage subsystem is expected to be hierarchical consisting of memory, disk drives, and one or more tertiary storage devices. The database resides permanently on the tertiary storage devices and objects are swapped onto the magnetic disk drives on demand (and deleted once the disk storage capacity is exhausted). This may fragment the disk space over a period of time, resulting in a non-contiguous layout of an object across the surface of a disk drive. This is undesirable because, once the object is referenced, the disk drive is required to reposition its read head multiple times (incur seek operations) when retrieving the object, resulting in a low performance.
Context Interchange: Overcoming the Challenges of Large-Scale Interoperable Database Systems in a Dynamic Environment
Authors: Cheng Hian Goh, Stuart E. Madnick, Michael D. Siegel
Venue: CIKM
Year: 1994

Research in database interoperability has primarily focused on circumventing schematic and semantic incompatibility arising from autonomy of the underlying databases. We argue that, while existing integration strategies might provide satisfactory support for small or static systems, their inadequacies rapidly become evident in large-scale interoperable database systems operating in a dynamic environment. This paper highlights the problem of receiver heterogeneity, scalability, and evolution which have received little attention in the literature, provides an overview of the Context Interchange approach to interoperability, illustrates why this is able to better circumvent the problems identified, and forges the connections to other works by suggesting how the context interchange framework differs from other integration approaches in the literature.
Integrating a Part Relationship Into an Open OODB System Using Metaclasses
Authors: Michael Halper, James Geller, Yehoshua Perl, Wolfgang Klas
Venue: CIKM
Year: 1994

The part-whole semantic relationship (the part relationship, for short) is an important modeling primitive in many advanced application domains such as manufacturing, design, and document processing. In this paper, we examine the problem of integrating such a construct into an OODB system. Specifically, two questions are addressed in this regard. The first is: Can a part relationship be made an intrinsic construct of an existing OODB system without having to rewrite a substantial portion of the system? The second: Can an &quot;open&quot; OODB system which claims to support such an integration really do so, and, more specifically, can the integration be done using a metaclass mechanism which purports to bring extensibility to the VODAK Model Language (VML)? To demonstrate that both questions can be answered &quot;yes,&quot; we introduce and discuss the details of a custom VML metaclass---the &quot;HolonymicMeronymic&quot; metaclass---which we have built. This metaclass comprises two items, an &quot;instance&quot; type and an ...
LogicBase: A Deductive Database System Prototype
Authors: Jiawei Han, Ling Liu, Zhaohui Xie
Venue: CIKM
Year: 1994

A deductive database system prototype, LogicBase, has been developed, with an emphasis on efficient compilation and query evaluation of application-oriented recursions in deductive databases. The system identifies different classes of recursions and compiles recursions into chain or psuedo-chain forms when appropriate. Queries posed to the compiled recursions are analyzed systematically with efficient evaluation plans generated and executed, mainly based on a chained-based query evaluation method. The system has been tested using sophisticated recursions and queries with satisfactory performance. This paper introduces the general design principles and implementation techniques of the system and discusses its strength and limitations.
Quasi-Dynamic Two-Phase Locking
Authors: Abdelsalam Helal, Tung-Hui Ku, Judson Fortner
Venue: CIKM
Year: 1994

Among the plethora of concurrency control algorithms that have been proposed and analyzed, two-phase locking (2PL) has been adapted as the industry de facto standard concurrency control. In accord, current research in concurrency control is focusing on enhancing the scalability of 2PL performance in highly concurrent and contentious environments. This is especially needed in future on-line transaction processing systems, where thousand Transaction Per Second performance will be required.
Discovery of Decision Rules in Relational Databases: A Rough Set Approach
Authors: Xiaohua Hu, Nick Cercone
Venue: CIKM
Year: 1994

We develop an attribute-oriented rough set approach for the discovery of decision rules in relational databases. Our approach combines machine learning techniques and rough set theory. We consider a learning procedure to consist of the two phases data generalization and data reduction. In the data generalization phase, utilizing knowledge about concept hierarchies and relevance of the data, an attribute-oriented induction is performed attribute by attribute. Some undesirable attributes of the discovery task are removed and the primitive data in the databases are generalized to the desirable level; this process greatly decreases the number of tuples which must be examined for the discovery task and substantially reduces the computational complexity of the database learning processes. Subsequently, in data reduction phase, rough set theory is applied to the generalized relation; the cause-effect relationships among the condition and decision attributes in the databases are analyzed and the non-essential or irrelevant attributes to the discovery task are eliminated without losing information of the original database system. This process further reduces the generalized relation. Thus very concise and more accurate decision rules for each class in the decision attribute with little or no redundancy information, can be extracted automatically from the reduced relation during the learning process. Our study shows that attribute-oriented induction combined with rough set theory provide an efficient and effective mechanism for discovering decision rules in database systems.
Group Formation Mechanisms for Transactions in ISIS
Authors: Neel K. Jain
Venue: CIKM
Year: 1994

Distributed toolkits like Isis provide means of replicating data but not means for making it persistent. This makes the use of transactions desirable, even in non-database applications. Using Isis can alleviate the programming cost of distributed transaction processing the multi-phase commit protocols. Using the Isis transaction tool, however, imposes additional cost, and we examine the effect of group formation strategies on the overhead. The paper presents three different group formation mechanisms in Isis and compares the costs associated with them.
Re-Evaluating Indexing Schemes for Nested Objects
Authors: Yin-he Jiang, Xiangning Liu, Bharat K. Bhargava
Venue: CIKM
Year: 1994

Performance is a major issue in the acceptance of object-oriented database management systems (OODBMS). The nested index and path index schemes have been criticized for their heavy costs and poor handling of update operations. This paper re-evaluates three index schemes (nested index, path index, and multi-index) applicable to queries on nested attributes. Among these, we found that a multi-index scheme is best supported in the object-oriented or extended relational DBMS environment. Multi-index schemes not only provide a better balance between retrieval and update costs than do the nested or path indices, but they also scale well for update when the number of indices increases. In this paper, we propose a multi-index design that reuses the single-table index structures already present in a DBMS. Our performance study extends previous models by permitting attributes to be multi-valued as well as single-valued. We also suggest that a combination of nested index and multi-index schemes offers a feasible solution to the support of queries on nested objects.
Linguistic Instruments and Qualitative Reasoning for Schema Integration
Authors: Paul Johannesson
Venue: CIKM
Year: 1994

Two major problems in schema integration are to identify correspondences between different conceptual schemas and to verify that the proposed correspondences are consistent with the semantics of the schemas. We propose a heuristic method, based on the use of Galois lattices, for identifying schema correspondences. We show how the results of this method can be checked for correctness by introducing a number of necessary conditions for schema mergeability. These conditions are formulated in the context of a semantically rich modelling formalism, the distinguishing feature of which is the use of case grammar.
A Storage System for Scalable Knowledge Representation
Authors: Peter D. Karp, Suzanne M. Paley, Ira B. Greenberg
Venue: CIKM
Year: 1994

Twenty years of AI research in knowledge representation has produced frame knowledge representation systems (FRSs) that incorporate a number of important advances. However, FRSs lack two important capabilities that prevent them from scaling up to realistic applications: they cannot provide high-speed access to large knowledge bases (KBs), and they do not support shared, concurrent KB access by multiple users. Our research investigates the hypothesis that one can employ an existing database management system (DBMS) as a storage subsystem for an FRS, to provide high-speed access to large, shared KBs. We describe the design and implementation of a general storage system that incrementally loads referenced frames from a DBMS, and saves modified frames back to the DBMS, for two different FRSs: LOOM and THEO. We also present experimental results showing that the performance of our prototype storage subsystem exceeds that of flat files for simulated applications that reference or update up to one third of the frames from a large LOOM KB.