Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

OS and Networks

PDF

Series

Institution
Keyword
Publication Year
Publication

Articles 1111 - 1120 of 1120

Full-Text Articles in Physical Sciences and Mathematics

The Architecture Of Braid: A System For Bridging Al/Db Systems, Amit P. Sheth, Anthony B. O'Hare Apr 1991

The Architecture Of Braid: A System For Bridging Al/Db Systems, Amit P. Sheth, Anthony B. O'Hare

Kno.e.sis Publications

We describe the design of BrAID (a Bridge between Artificial Intelligence and Database Management Systems), an experimental system for the efficient integration of logic based Artificial Intelligence (Al) and database (DB) technologies. Features provided by BrAID include (a) access to conventional DBMSs, (b) support for multiple inferencing strategies, (c) a powerful caching subsystem that manages views and employs subsumption to facilitate the reuse of previously cached data, (d) lazy or eager evaluation of queries submitted by the AI system, and (e) the generation of advice by the AI system to aid in cache management and query execution planning. To discuss …

Go to article

Management Of Interdependent Data: Specifying Dependency And Consistency Requirements, Amit P. Sheth, Marek Rusinkiewicz Nov 1990

Management Of Interdependent Data: Specifying Dependency And Consistency Requirements, Amit P. Sheth, Marek Rusinkiewicz

Kno.e.sis Publications

Multiple databases that serve the needs of various application systems are considered. One of the significant problems in managing these databases is to maintain the related data items consistent to the required degree. This problem is frequently referred to as `redundant data management'. Since the term `redundancy' tends to imply that the data is unwanted or superfluous, the authors use the more general term `management of interdependent data'. Some preliminary ideas in this area are discussed. The problem of managing interdependent data is characterized, and some important types of interdatabase dependency are identified.

Go to article

Attribute Relationships: An Impediment In Automating Schema Integration, Amit P. Sheth, Sunit K. Gala Dec 1989

Attribute Relationships: An Impediment In Automating Schema Integration, Amit P. Sheth, Sunit K. Gala

Kno.e.sis Publications

Success in schema integration depends on understanding the semantics of schema components (e.g., entity sets, relationship sets, attributes), and the ability to capture and reason about these semantics. An important objective of our work on schema integration is to automate the reasoning as much as possible, and when not possible, depend on the human input and guidance. A key results of comparing the semantics associated with schema objects is that of determining attribute relationship. Once attribute relationships are determined, the task of object class(e.g., entity sets and relationship sets) integration becomes simpler and can e automated to a great extent. …

Go to article

Efficient Interconnection Schemes For Vlsi And Parallel Computation, Ronald I. Greenberg Sep 1989

Efficient Interconnection Schemes For Vlsi And Parallel Computation, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This thesis is primarily concerned with two problems of interconnecting components in VLSI technologies. In the first case, the goal is to construct efficient interconnection networks for general-purpose parallel computers. The second problem is a more specialized problem in the design of VLSI chips, namely multilayer channel routing. In addition, a final part of this thesis provides lower bounds on the area required for VLSI implementations of finite-state machines. This thesis shows that networks based on Leiserson's fat-tree architecture are nearly as good as any network built in a comparable amount of physical space. It shows that these "universal" networks …

Go to article

Fault Tolerance In A Very Large Database System: A Strawman Analysis, Amit P. Sheth Jun 1989

Fault Tolerance In A Very Large Database System: A Strawman Analysis, Amit P. Sheth

Kno.e.sis Publications

A simple model is used to study the effect of fault-tolerance techniques and system design on system availability. A generic multiprocessor architecture is used that can be configured in different ways to study the effect of system architectures. Important parameters studied are different system architectures and hardware fault-tolerance techniques, mean time to failure of basic components, database size and distribution, interconnect capacity, etc. Quantitative analysis compares the relative effect of different parameter values. Results show that the effect of different parameter values on system availability can be very significant. System architecture, use of hardware fault tolerance (particularly mirroring), and data …

Go to article

Randomized Routing On Fat-Trees, Ronald I. Greenberg, Charles E. Leiserson Jan 1989

Randomized Routing On Fat-Trees, Ronald I. Greenberg, Charles E. Leiserson

Computer Science: Faculty Publications and Other Works

Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor lambda on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(lambda + lg n lg lg n) with probability 1-O(1/n). The best previous …

Go to article

A Tool For Integrating Conceptual Schemas And User Views, Amit P. Sheth, James A. Larson, Aloysius Cornelio, Shamkant B. Navathe Feb 1988

A Tool For Integrating Conceptual Schemas And User Views, Amit P. Sheth, James A. Larson, Aloysius Cornelio, Shamkant B. Navathe

Kno.e.sis Publications

An interactive tool has been developed to assist database designers and administrators (DDA) in integrating schemas. It collects the information required for integration from a DDA, performs essential bookkeeping, and integrates schemas according to the semantics provided. The authors present the capabilities of this tool by discussing the integration methodology and the user interface of the tool.

Go to article

Randomized Routing On Fat-Trees, Ronald I. Greenberg Oct 1985

Randomized Routing On Fat-Trees, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor lambda on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(lambda+lgnlglgn) with probability 1-O(1/ …

Go to article

An Analysis Of The Effect Of Network Load And Topology On The Performance Of Concurrency Control Algorithm In Distributed Database Systems, Anoop Singhal, Amit P. Sheth, Ming T. Liu Dec 1984

An Analysis Of The Effect Of Network Load And Topology On The Performance Of Concurrency Control Algorithm In Distributed Database Systems, Anoop Singhal, Amit P. Sheth, Ming T. Liu

Kno.e.sis Publications

Earlier studies in the performance analysis of concurrency control algorithms in distributed database systems (DDBS) have assumed that the message transmission time between any two nodes of a network is constant. Hence they disregard the effect of communication subnet related parameters such as network traffic, network topology, the capacity of transmission channels and the size of messages transmitted. In this paper an analytical model is used to estimate the delays in transmission channels for a DDBS in a long haul network. The analysis shows that the constant transmission time assumption cannot be justified in many cases and that response time …

Go to article

Ua66 Ogden Instructional Computing Newsletter, Vol. 1, No. 2, Wku Computer Science Sep 1979

Ua66 Ogden Instructional Computing Newsletter, Vol. 1, No. 2, Wku Computer Science

WKU Archives Records

Newsletter created by WKU Computer Science regarding the department, campus computer use and curriculum.

Go to article

First Prev