vldb_1994_elementary.txt

利用lwp：：get写的

<proceedings><paper><title>Semantic Integration in Heterogeneous Databases Using Neural Networks.</title><author><AuthorName>Wen-Syan Li</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Chris Clifton</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Performing Operations over Mismatched Domains.</name><name>View Definition and Generalization for Database Integration in a Multidatabase System.</name><name>Report of the Workshop on Semantic Heterogeneity and Interoperation in Multidatabase Systems.</name><name>Multi-User View Integration System (MUVIS): An Expert System for View Integration.</name><name>Using Field Specifications to Determine Attribute Equivalence in Heterogeneous Databases.</name><name>A Theory of Attribute Equivalence in Databases with Application to Schema Integration.</name><name>Constructing Superviews.</name><name>Integrating User Views in Database Design.</name><name>A Methodology for Creating User Views in Database Design.</name><name>Federated Database Systems for Managing Distributed, Heterogeneous, and Autonomous Databases.</name><name>A Tool for Integrating Conceptual Schemas and User Views.</name><name>Querying Uncertain Data in Heterogeneous Databases.</name><name>Intelligent Integration of Information.</name></citation><abstract>One important step in integrating heterogeneous databases is
matching equivalent attributes:  Determining which fields in
two  databases refer to the same data. The meaning of information
may be embodied within a database model, a conceptual schema,
application programs, or data contents.
Integration involves  extracting semantics, expressing them
as metadata, and matching semantically equivalent data elements.
We present a procedure using a classifier to categorize attributes
according to their field specifications and data values, then
train a neural network to recognize similar attributes. In our
technique, the knowledge of how to match equivalent data
elements is ``discovered'' from metadata, not ``pre-programmed''.</abstract></paper><paper><title>Providing Dynamic Security Control in a Federated Database.</title><author><AuthorName>Norbik Bashah Idris</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>W. A. Gray</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>R. F. Churchhouse</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Integration of heterogeneous database applications through an object-oriented interface.</name><name>A Comparative Analysis of Methodologies for Database Schema Integration.</name><name>An Introduction to Database Systems, Volume I, 4th Edition.
 Addison-Wesley 1986</name><name>A Source-to-Source Meta-Translation System for Relational Query Languages.</name><name>Integration of Secrecy Features in a Federated Database Environment.</name><name>Object Identity.</name><name>Formal Models for Computer Security.</name><name>Multilevel Security Control in Multidatabase Management Systems.</name><name>Principles of Distributed Database Systems.
 Prentice-Hall 1991, ISBN 0-13-715681-2</name><name>Identification of Database Objects by Key.</name><name>Association Merging in a Schema Meta-Integration System for a Heterogeneous Object-Oriented Database Environment.</name><name>A Meta-Translation System for Object-Oriented to Relational Schema Translations.</name><name>How to Share a Secret.</name><name>A Tool for Integrating Conceptual Schemas and User Views.</name><name>Mistaking Identity.</name><name>Secure Mediated Databases.</name></citation><abstract>When data is being used in a federated database, the aim is to give a
loose coupling of the data in the component databases so that a very
dynamic and therefore flexible pattern of data sharing can be
established. When security integration is performed this flexibility is
curtailed by the resultant security level established at integration
time which by default is the least upper bound between candidate
security levels. Such overclassification of data implies that there will
be authorised users who are debarred at the federation level to access
the data. To circumvent this problem there is a need for a dynamic
mandate type control for definite periods of the federated system's
existence. An approach to establishing such temporary dynamic security
control is described in this paper. It is an adaptation of Shamir's
method [Shamir79] for sharing a secret, and it aims to let users
who are debarred at the default security level from access to particular
data, gain access to this data under local control if an appropriate
combination of current database administrator of the
system are prepared to grant the access dynamically.</abstract></paper><paper><title>An Approach for Building Secure Database Federations.</title><author><AuthorName>Dirk Jonscher</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Klaus R. Dittrich</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>The Object-Oriented Database System Manifesto.</name><name>Data Hiding and Security in Object-Oriented Databases.</name><name>On an Authorization Mechanism.</name><name>An Authorization Mechanism for a Relational Database System.</name><name>An Object-Oriented Integration Framework for Building Heterogeneous Database Systems.</name><name>Integration of Secrecy Features in a Federated Database Environment.</name><name>Complex Subjects, or: The Striving for Complexity is Ruling our World.</name><name>Object-Orientation and Interoperability.</name><name>Security Issues in Federated Database Systems: Panel Contributions.</name><name>Object Orientation in Heterogeneous Distributed Computing Systems.</name><name>Canonical Security Modeling for Federated Databases.</name><name>A Model of Authorization for Object-Oriented and Semantic Databases.</name><name>A Model of Authorization for Next-Generation Database Systems.</name><name>Suitability of Data Models as Canonical Models for Federated Databases.</name><name>Federated Database Systems for Managing Distributed, Heterogeneous, and Autonomous Databases.</name><name>Implementation of Integrity Constraints and Views by Query Modification.</name><name>Pragmatics of Access Control in Mermaid.</name><name>A Unified Framework for Enforcing Multiple Access Control Policies.</name></citation><abstract>Database federations give rise to particular security problems which
are not present in classical database environments. The problems and
solutions heavily depend on the federation's architecture and the
degree of heterogeneity of participating component systems. In this
paper we discuss a special aspect of security, namely access control
for tightly coupled federations. We determine the typical problems to
be solved and discuss several solutions providing for different degrees
of local autonomy, especially authorisation autonomy.  In particular,
we describe the interaction between independent reference monitors.
Further, we sketch powerful access control mechanisms to be applied at
the global layer and show how they can be mapped onto less powerful
mechanisms of component database management systems.</abstract></paper><paper><title>Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism.</title><author><AuthorName>Waqar Hasan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Rajeev Motwani</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Parallel Database Systems: The Future of High Performance Database Systems.</name><name>Query Optimization for Parallel Execution.</name><name>Computer and Intractability: A Guide to the Theory of NP-Completeness.
 W. H. Freeman 1979, ISBN 0-7167-1044-7</name><name>The Cost of Messages.</name><name>Exploiting Inter-Operation Parallelism in XPRS.</name><name>Optimization of Parallel Query Execution Plans in XPRS.</name><name>The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition.
 Addison-Wesley 1973</name><name>On Optimal Processor Allocation to Support Pipelined Hash Joins.</name><name>Optimization of Multi-Way Join Queries for Parallel Execution.</name><name>Parallelism in Relational Data Base Systems: Architectural Issues and Design Approaches.</name><name>Access Path Selection in a Relational Database Management System.</name><name>Optimizing Multi-Join Queries in Parallel Relational Databases.</name><name>Multi-Join Optimization for Symmetric Multiprocessors.</name><name>Scheduling Parallelizable Tasks: Putting it All on the Shelf.</name><name>Parallel Database Systems: Open Problems and New Issues.</name><name>Parallelism in a Main-Memory DBMS: The Performance of PRISMA/DB.</name></citation><abstract>We address the problem of finding parallel plans for SQL queries using
the two-phase approach of join ordering followed by parallelization.
We focus on the parallelization phase and develop algorithms for
exploiting pipelined parallelism.  We formulate parallelization as
scheduling a weighted operator tree to minimize response time. Our
model of response time captures the fundamental tradeoff between
parallel execution and its communication overhead.  We assess the
quality of an optimization algorithm by its performance ratio
which is the ratio of the response time of the generated schedule to
that of the optimal.  We develop fast algorithms that produce
near-optimal schedules - the performance ratio is extremely close to 1
on the average and has a worst case bound of about 2 for many cases.</abstract></paper><paper><title>Dal&amp;iacute;: A High Performance Main Memory Storage Manager.</title><author><AuthorName>H. V. Jagadish</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Daniel F. Lieuwen</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Rajeev Rastogi</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Abraham Silberschatz</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>S. Sudarshan</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>ODE (Object Database and Environment): The Language and the Data Model.</name><name>Making C++ Objects Persistent: the Hidden Pointers.</name><name>Shoring Up Persistent Applications.</name><name>Storage Management in EXODUS.</name><name>The O++ Database Programming Language: Implementation and Experience.</name><name>Locking and Latching in a Memory-Resident Database System.</name><name>Main Memory Database Systems: An Overview.</name><name>Transaction Processing: Concepts and Techniques.</name><name>The Benchmark Handbook for Database and Transaction Systems (2nd Edition).</name><name>Starburst Mid-Flight: As the Dust Clears.</name><name>Recovering from Main-Memory Lapses.</name><name>A Recovery Algorithm for A High-Performance Memory-Resident Database System.</name><name>The ObjectStore Database System.</name><name>An Evaluation of Starburst's Memory Resident Storage Component.</name><name>System M: A Transaction Processing Testbed for Memory Resident Data.</name><name>Texas: An Efficient, Portable Persistent Store.</name><name>Cricket: A Mapped, Persistent Object Store.</name><name>QuickStore: A High Performance Mapped Object Store.</name></citation><abstract>Performance needs of many database applications dictate that the entire
database be stored in main memory.  The Dal&amp;iacute; system is a main
memory storage manager designed to provide the persistence,
availability and safety guarantees one typically expects from a
disk-resident database, while at the same time providing very high
performance by virtue of being tuned to support in-memory data.
Dal&amp;iacute; follows the philosophy of treating all data, including system
data, uniformly as database files that can be memory mapped and
directly accessed/updated by user processes.  Direct access provides
high performance; slower, but more secure, access is also provided
through the use of a server process.  Various features of Dal&amp;iacute; can
be tailored to the needs of an application to achieve high performance
- for example, concurrency control and logging can be turned off if
not desired, which enables Dal&amp;iacute; to efficiently support
applications that require non-persistent memory resident data to be
shared by multiple processes.  Both object-oriented and relational
databases can be implemented on top of Dal&amp;iacute;.</abstract></paper><paper><title>Some Issues in Design of Distributed Deductive Databases.</title><author><AuthorName>Mukesh K. Mohania</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><author><AuthorName>Nandlal L. Sarda</AuthorName><institute><InstituteName></InstituteName><country></country></institute></author><year>1994</year><conference>International Conference on Very Large Data Bases</conference><citation><name>Data Allocation in Distributed Database Systems.</name><name>Logic Programming and Databases.
 Springer 1990, ISBN 3-540-51728-6</name><name>Distribution Design of Logical Database Schemas.</name><name>The Complexity of Multiway Cuts (Extended Abstract).</name><name>Computer and Intractability: A Guide to the Theory of NP-Completeness.