ftp.cs.arizona.edu/ftp.cs.arizona.edu.tar/ftp.cs.arizona.edu/bib/database.bib

Text File | 1996-01-25 | 1MB | 28,361 lines

@Comment(BIBTEMPLATE .)
@Comment(BIBREFERENCES stdalphabetic)
@Comment{BIBSEPARATORS ",;"}


@article    ( ABBADI89,
key    =    "Abbadi \& Toueg" ,
author    =    "Abbadi, A. and Toueg, S." ,
title    =    "The Group Paradigm for Concurrency Control
Protocols" ,
journal    =    "IEEE Transactions on Data and Knowledge
Engineering" ,
volume    =    "1" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1989" ,
pages    =    "376--386" ,
keywords=    "Concurrency control; distributed databases;
fault-tolerance; partitioning failures; replication; serializability
theory; transaction processing" ,
abstract=    "We propose a paradigm for developing, describing,
and proving the correctness of concurrency control protocols for
replicated databases in the presence of failures or communication
restrictions. Our approach is to hierarchically divide the problem of
achieving one-copy serializability by introducing the notion of a
'group' that is a higher level of abstraction than transactions.
Instead of dealing with the overall problem of serializing all
transactions, our paradigm divides the problem into two simpler ones:
1) a local policy for each group that ensures a total order of all
transactions in that group; 2) a global policy that ensures a correct
serialization of all groups. We use the paradigm to demonstrate the
similarities between several concurrency control protocols by
comparing the way they achieve correctness." ,
bibdate    =    "Fri Dec  8 14:26:30 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( ABBOD87A,
key    =    "Abodd et al." ,
author    =    "Abodd, T. and Brown, K. and Noble, H." ,
title    =    "Providing Time-Related Constraints for
Conventional Database Systems" ,
booktitle=    "vldb" ,
year    =    "1987" ,
pages    =    "167--175" ,
abstract=    "A model for a historical database is described
which is based upon time-stamped tuples as the unit of storage. The
model includes both physical and logical time-stamps. The technical
characteristics of write-once laser discs prevent the use of double
logical time-stamps. The model distinguishes versions from
correction-updates. It is shown that if set-valued attributes are
involved the use of null values is unavoidable if back-dated
correction-updates are allowed. A method of handling user-defined
integrity constraint rules is outlined which involves the maintenance
of a time-stamped trace of such rules. Such a trace is necessary for
the proper handling of back-dated correction-updates. An outline of a
system SIS-BASE is described which implements some of these ideas." ,
bibdate    =    "Thu Apr 22 11:57:53 1993" ,
owner    =    "bassili" ,
)

@article    ( ABBOTT92,
key    =    "Abbott \& Garcia-Molina" ,
author    =    "Abbott, R.K. and Garcia-Molina, H." ,
title    =    "Scheduling Real-Time Transactions: A Performance
Evaluation" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "17" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1992" ,
pages    =    "513--560" ,
keywords=    "deadlines; locking protocols; real-time systems" ,
abstract=    "Managing transactions with real-time requirements
presents many new problems. In this paper we address several: How can
we schedule transactions with deadlines? How do the real-time
constraints affect concurrency control? How should overloads be
handled? How does the scheduling of I/O requests affect the timeliness
of transactions? How should exclusive and shared locking be handled?
We describe a new group of algorithms for scheduling real-time
transactions that produce serializable schedules. We present a model
for scheduling transactions with deadlines on a single processor disk
resident database system, and evaluate the scheduling algorithms
through detailed simulation experiments." ,
bibdate    =    "Mon Oct 26 21:17:10 1992" ,
owner    =    "leoso" ,
)

@techreport    ( ABITEBOUL84,
key    =    "Abiteboul \& Hull" ,
author    =    "Abiteboul, S. and Hull, R." ,
title    =    "IFO: A Formal Semantic Database Model" ,
number    =    "TR-84-304" ,
institution=    "University of Southern California" ,
address    =    "Los Angeles, CA" ,
year    =    "1984" ,
month    =    "apr" ,
pages    =    "1--92" ,
abstract=    "A new, formally defined database model is
introduced which combines fundamental principles of ``semantic''
database modeling in a coherent fashion. Using a graph-based
formalism, the IFO model provides mechanisms for representing
structured objects, and functional and ISA relationships between them.
A number of fundamental results concerning semantic data modeling are
obtained in the context of the IFO model. Notably, the types of object
structure that can arise as a result of multiple uses of ISA
relationships and object construction are described. Also, a natural,
formal definition of update propagation is given, and it is shown that
(under certain conditions) a correct update always exists." ,
bibdate    =    "Thu Oct 23 15:58:18 1986" ,
owner    =    "manning" ,
)

@article    ( ABITEBOUL86A,
key    =    "Abiteboul \& Ginsburg" ,
author    =    "Abiteboul, S. and Ginsburg, S." ,
title    =    "Tuple Sequences and Lexicographic Indexes" ,
journal    =    "jacm" ,
publisher=    "acm" ,
volume    =    "33" ,
number    =    "3" ,
month    =    "jul" ,
year    =    "1986" ,
pages    =    "409--422" ,
keywords=    "Design; management; theory; verification;
dependencies inference rules; structure connected with relational
implementation" ,
abstract=    "The concept of a tuple sequence is introduced in
order to investigate structure connected with relational model
implementation. Analogs are presented for the relational operations of
projection, join, and selection, and the decomposition problem for
tuple sequences is considered. The lexicographical ordering of tuple
sequences is studied via the notion of (lexicographic) index. A sound
and complete set of inference rules for indexes is exhibited, and two
algorithmic questions related to indexes examined. Finally, indexes
and functional dependencies in combination are studied." ,
bibdate    =    "Mon Feb 23 14:12:16 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( ABITEBOUL87B,
key    =    "Abiteboul et al." ,
author    =    "Abiteboul, S. and Kanellakis, P. and Brahne, G." ,
title    =    "On the Representation and Querying of Sets of
Possible Worlds" ,
booktitle=    "Proceedings of SIGMod 1987 Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "34--38" ,
abstract=    "We represent a set of possible worlds using an
incomplete information database. The representation techniques that we
study form a hierarchy, which generalizes relations of constants. This
hierarchy ranges from the very simple Codd-table -i.e., a relation of
constants and distinct variables called nulls, which stand for values
present but unknown- to much more complex mechanisms involving views
on conditioned-tables -i.e., queries on Codd- tables together with
conditions. The views we consider are the queries that have polynomial
data-complexity on complete information databases. Our conditions are
conjunctions of equalitiies and inequalities. 1- We provide matching
upper and lower bounds on the data-complexity of testing containement,
membership, and uniqueness for sets of possible worlds and we fully
classify these problems with respect to our representation hierarchy.
The most surprising result in this classification is that: it is
complete in II2p, whether a set of possible worlds represented by a
Codd-table is a subset of a set of possible worlds represented by a
Codd-table with one conjunction of inequalities. 2- We investigate the
data-complexity of querying incomplete information databases. We
examine both asking certain facts and for possible facts. Our approach
is algebraic but our bounds also apply to logical databases. We show
that asking for a certain fact is coNP-complete, even for a fixed
first order query on a Codd-table. We thus strengthen a lower bound of
[16], who showed that this holds for a Codd-table with a conjunction
of inequalities. For each fixed positive existential query we present
a polynomial algorithm solving the bounded possible fact problem of
this query on conditioned tables. We show that our approach is, in a
sense, the best possible, by deriving two NP-completeness lower bounds
for the bounded possible fact problem- when the fixed query contains
either negation or recursion." ,
bibdate    =    "Tue Aug 25 14:08:10 1987" ,
owner    =    "manning" ,
)

@article    ( ABITEBOUL87C,
key    =    "Abiteboul \& Hull" ,
author    =    "Abiteboul, S. and Hull, R." ,
title    =    "IFO: A Formal Semantic Database Model" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "12" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1987" ,
pages    =    "525--565" ,
keywords=    "Design; theory; complex database objects; database
theory; semantic database models; update propagation" ,
abstract=    "A new, formally defined database model is
introduced that combines fundamental principles of ``semantic''
database modeling in a coherent fashion. Using a graph-based
formalism, the IFO model provides mechanisms for representing
structured objects, and functional and ISA relationships between them.
A number of fundamental results concerning semantic data modeling are
obtained in the context of the IFO model. Notably, the types of object
structure that can arise as a result of multiple uses of ISA
relationships and object construction are described. Also, a natural,
formal definition of update propagation is given, and it is shown
that, under certain conditions, a correct update always exists." ,
bibdate    =    "Tue Jan 26 14:09:59 1988" ,
owner    =    "manning" ,
)

@article    ( ABITEBOUL88,
key    =    "Abiteboul \& Hull" ,
author    =    "Abiteboul, S. and Hull, R." ,
title    =    "Update Propagation in a Formal Semantic Model" ,
journal    =    "Data Engineering" ,
volume    =    "11" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1988" ,
pages    =    "3--12" ,
abstract=    "The update propagation methodology of a semantic
database model, IFO, is described. An informal review of IFO, a
mathematically defined model which subsumes the structural components
of most prominent semantic models in the literature, is also
presented." ,
bibdate    =    "Wed Oct 25 07:57:46 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( ABITEBOUL89A,
key    =    "Abiteboul \& Kanellakis" ,
author    =    "Abiteboul, S. and Kanellakis, P." ,
title    =    "Object Identity as a Query Language" ,
booktitle=    "sigmod" ,
address    =    "New York" ,
year    =    "1989" ,
pages    =    "159-173" ,
annote    =    "The paper looks at the idea of constructing a
formal rigorous mathematically based query language based on object
identity as the basic concept. The new system is called IQL." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( ABITEBOUL90,
key    =    "Abiteboul et al." ,
author    =    "Abiteboul, S. and Buneman, P. and Delobel, C. and
Hull, R. and Kanellakis, P. and Vianu, V." ,
title    =    "New Hope on Data Models and Types: Report of an
NSF-INRIA Workshop" ,
journal    =    "sigmod" ,
volume    =    "19" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1990" ,
pages    =    "41--48" ,
abstract=    "In May 1990, a small workshop was held in New
Hope, Pennsylvania to discuss the fundamental issues raised by
continuing work on the interface between databases and programming
languages. Four topics were addressed: new directions stemming from
object- oriented data models, contributions of type theory to database
programming languages (DBPLs), applications of logic to DBPL issues,
and DBPL implementations. This workshop was organized under the
auspices fo the INRIA-NSF program, `Languages for Databases and
Knowledge Bases.'" ,
bibdate    =    "Sun Jan 19 20:39:21 1992" ,
owner    =    "soo" ,
)

@inproceedings    ( ACHARYA85,
key    =    "Acharya \& Buckley" ,
author    =    "Acharya, S. and Buckley, G." ,
title    =    "Transaction Restarts in Prolog Database Systems" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "364--373" ,
bibdate    =    "Wed Jun 12 11:49:02 1985" ,
)

@inproceedings    ( ADIBA80,
key    =    "Adiba \& Lindsay" ,
author    =    "Adiba, M.E. and Lindsay, B.G." ,
title    =    "Database Snapshots" ,
booktitle=    "vldb" ,
address    =    "Montreal, Canada" ,
month    =    "oct" ,
year    =    "1980" ,
pages    =    "86--91" ,
abstract=    "Many database applications require or will
tolerate access to obsolete versions of the database. We propose the
notion of system supported snapshots which periodically reflect
selected portions of the database so as to allow applications to view
the database ``as of'' an earlier time without having to execute at
that time. We discuss snapshots semantics and implementation and we
show the importance of the snapshot concept in centralized and
distributed databases." ,
bibdate    =    "Mon Mar  4 09:03:17 1985" ,
)

@inproceedings    ( ADIBA80B,
key    =    "Adiba et al." ,
author    =    "Adiba, M. and Anrade, J. and Decitre, P. and
Fernandez, F. and Nguyen, G." ,
title    =    "POLYPHEME: AN Experience in Distributed Database
System Design and Implementation" ,
booktitle=    "Proceedings of the Third International Symposium
on Distributed Data Bases" ,
pages    =    "67--84" ,
address    =    "New York " ,
month    =    "March" ,
year    =    1980 ,
annote    =    "Polypheme is a distributed heterogeneous system.
Based on re-interpreting queries. It uses the concept of mapping a
global name, space to a local object space." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( ADIBA81B,
key    =    "Adiba" ,
author    =    "Adiba, M." ,
title    =    "Derived Relations: A Unified Mechanism for Views,
Snapshots and Distributed Data" ,
booktitle=    "vldb" ,
address    =    "Cannes, France" ,
editor    =    "Zaniolo, C. and Delobel, C." ,
month    =    "sep" ,
year    =    "1981" ,
pages    =    "293--305" ,
keywords=    "database views, derived relations, snapshots" ,
abstract=    "In a relational system, a database is composed of
base relations, views, and snapshots. We show that this traditional
approach can be extended to different classes of derived relations,
and we propose a unified data definition mechanism for centralized and
distributed databases. Our mechanism, called DEREL, can be used to
define base relations and to derive different classes of views,
snapshots, partitioned and replicated data. DEREL is intended to be
part of a general purpose distributed relational database management
system." ,
bibdate    =    "Wed Aug 19 19:47:32 1987" ,
owner    =    "mckenzie" ,
)

@article    ( ADIBA92,
key    =    "Adiba et al." ,
author    =    "Adiba, M. and Collet, C. and DEchamboux, P. and
Defude, B." ,
title    =    "Integrated Tools for Object Oriented Persistent
Application Development" ,
journal    =    "DEXA 92 Conference" ,
month    =    "sep" ,
year    =    "1992" ,
pages    =    "1--11" ,
abstract=    "This paper presents the main characteristics of an
integrated environment for object oriented, persistent application
development. We first discuss the rationale of our approach and give
our analysis of current database systems or persistent languages.
Using such systems or languages is still a very difficult task because
persistent application development combines the complexity of databae
schema design together with a software engineering problem. In the
framework of the Aristote Project, we describe the main components of
an integrated environment that helps the designer to define types,
schema, methods and to structure his/her application. The main idea is
to achieve a good degree of declarativity and to provide general tools
to generate specific code for target (object oriented or extensible)
DBMS. Issue of interoperability is also discussed." ,
bibdate    =    "Sat Oct 31 23:57:28 1992" ,
owner    =    "leoso" ,
)

@inproceedings    ( AFSARMANSEH85,
key    =    "Afsarmanseh et al." ,
author    =    "Afsarmanseh, H. and McLeod, D. and Knapp, D. and
Parker, A." ,
title    =    "An Extensible Object-Oriented Approach to VLSI-CAD" ,
booktitle=    "vldb" ,
pages    =    "13--24" ,
address    =    "New York" ,
year    =    1985 ,
annote    =    "The use of OO models to encapsulate component
behavior as well as structure is explored. The use of these objects in
simulation systems is also considered. A spatial model of OO
technology with 3 axis system Domain, Mapping, Range s proposed.
Moving along these axes gives a graphical representation for component
of, model of and similar relations between components of the design
database." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( AGARWAL89,
key    =    "Agarwal et al." ,
author    =    "Agarwal, Anant and Horowitz, Mark and Hennessy,
John" ,
title    =    "An Analytical Cache Model" ,
journal    =    "ACM Transactions on Computer Systems" ,
year    =    "1989" ,
volume    =    "7" ,
number    =    "2" ,
pages    =    "184--215" ,
month    =    "May" ,
)

@article    ( AGHA85,
key    =    "Agha" ,
author    =    "Agha, Gul" ,
title    =    "A Message-Passing Paradigm for Object Management" ,
journal    =    "Database Engineering. Special Issue on
Object-Oriented Systems" ,
year    =    "1985" ,
volume    =    "8" ,
number    =    "4" ,
pages    =    "75--82" ,
month    =    "December" ,
)

@article    ( AGHILI82,
key    =    "Aghili \& Severance" ,
author    =    "Aghili, J. and Severance, D." ,
title    =    "A Pratical Guide to the Design of Differential
Files for Recovery of On-Line Databases" ,
journal    =    "tods" ,
volume    =    "7" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1982" ,
pages    =    "540--565" ,
bibdate    =    "Fri Apr 26 23:15:37 1985" ,
)

@techreport    ( AGRAWAL83,
key    =    "Agrawal \& DeWitt" ,
author    =    "Agrawal, R. and DeWitt, D.J." ,
title    =    "Integrated Concurrency Control and Recovery
Mechanisms: Design and Performance Evaluation" ,
number    =    "497" ,
institution=    "Computer Science Department" ,
address    =    "University of Wisconsin, Madison, WI" ,
year    =    "1983" ,
month    =    "feb" ,
pages    =    "1--48" ,
abstract=    "In spite of the wide variety of concurrency
control and mechanisms proposed during the past decade, the behavior
and the performance of various concurrency control and recovery
mechanisms remain largely not well understood. In addition, although
concurrency control and recovery mechanisms are intimately related,
the interaction between them has not been adequately explored. In this
paper, we take a unified view of the problems associated with
concurrency control and recovery for transaction-oriented multi-user
centralized database management systems, and present several
integrated mechanisms. We then develop analytical models to study the
behavior and compare the performance of these integrated mechanisms
and present the results of our performance evaluation." ,
bibdate    =    "Tue Jan 20 13:29:48 1987" ,
owner    =    "manning" ,
)

@article    ( AGRAWAL83A,
key    =    "Agrawal \& Dewitt" ,
author    =    "Agrawal, R. and Dewitt, D." ,
title    =    "Updating hypothetical data bases" ,
journal    =    "Information Processing Letters" ,
volume    =    "16" ,
month    =    "apr" ,
year    =    "1983" ,
pages    =    "145--146" ,
bibdate    =    "Mon Oct 23 08:37:39 1989" ,
owner    =    "robyn" ,
)

@article    ( AGRAWAL83B,
key    =    "Agrawal \& Dewitt" ,
author    =    "Agrawal, R. and Dewitt, D.J." ,
title    =    "Updating Hypothetical Data Bases" ,
journal    =    "Information Processing Letters" ,
publisher=    "Horth-Holland Publishing Company" ,
volume    =    "16" ,
number    =    "3" ,
month    =    "apr" ,
year    =    "1983" ,
pages    =    "145--146" ,
keywords=    "hypothetical database, update, crash recovery,
differential files, log" ,
bibdate    =    "Fri Sep  4 17:36:10 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( AGRAWAL85,
key    =    "Agrawal et al." ,
author    =    "Agrawal, R. and Carey, M.J. and Livny, M." ,
title    =    "Models For Studying Concurrency Control
Performance: Alternatives and Implications" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "108--121" ,
bibdate    =    "Tue Jun 11 11:54:59 1985" ,
)

@inproceedings    ( AGRAWAL85A,
key    =    "Agrawal \& DeWitt" ,
author    =    "Agrawal, R. and DeWitt, D.J." ,
title    =    "Recovery Architectures for Multiprocessor Database
Machines" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "131--145" ,
bibdate    =    "Tue Jun 11 11:52:07 1985" ,
)

@article    ( AGRAWAL85B,
key    =    "Agrawal \& Dewitt" ,
author    =    "Agrawal, R. and Dewitt, D.J." ,
title    =    "Integrated Concurrency Control and Recovery
Mechanisms: Design and Performance Evaluation" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "10" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1985" ,
pages    =    "529--564" ,
keywords=    "Algorithms; performance; concurrency control;
recovery; transaction processing" ,
abstract=    "In spite of the wide variety of concurrency
control and recovery mechanisms proposed during the past decade, the
behavior and performance of various concurrency control and recovery
mechanisms remain largely not well understood. In addition, although
concurrency control and recovery mechanisms are intimately related,
the interaction between them has not been adequately explored. In this
paper, we take a unified view of the problems associated with
concurrency control and recovery for transaction-oriented multiuser
centralized database management systems, and we present several
integrated mechanisms. We then develop analytical models to study the
behavior and compare the performance of these integrated mechanisms,
and we present the results of our performance evaluation." ,
bibdate    =    "Mon Feb  2 11:08:19 1987" ,
owner    =    "manning" ,
)

@article    ( AGRAWAL87,
key    =    "Agrawal et al." ,
author    =    "Agrawal, R and Carey, M. and Livny, M." ,
title    =    "Concurrency Control Performance Modeling:
Alternatives and Implications" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "12" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1987" ,
pages    =    "609--654" ,
keywords=    "Algorithms; performance; concurrency control" ,
abstract=    "A number of recent studies have examined the
performance of concurrency control algorithms for database management
systems. The results reported to date, rather than being definitive,
have tended to be contradictory. In this paper, rather than presenting
``yet another algorithm performance study'', we critically investigate
the assumptions made in the models used in past studies and their
implications. We employ a fairly complete model of a databasee
environment for studying the relative performance of three different
approaches to the concurrency control problem under a variety of
modeling assumptions. The three approaches studied represent different
extremes in how transaction conflicts are dealt with, and the
assumptions addressed pertain to the nature of the database system's
resources, how transaction restarts are modeled, and the amount of
information available to the concurrency control algorithm about
transactions' reference strings. We show that differences in the
underlying assumptions explain the seemingly contradictory performance
results. We also address the question of how realistic the various
assumptions are for actual database systems." ,
bibdate    =    "Tue Jan 26 14:43:03 1988" ,
owner    =    "manning" ,
)

@article    ( AGRAWAL87A,
key    =    "Agrawal et al." ,
author    =    "Agrawal, R. and Carey, M.J. and McVoy, L.W." ,
title    =    "The Performance of Alternative Strategies for
Dealing with Deadlocks in Database Management Systems" ,
journal    =    "tse" ,
publisher=    "ieee" ,
volume    =    "SE-13" ,
number    =    "12" ,
month    =    "dec" ,
year    =    "1987" ,
pages    =    "1348--1363" ,
keywords=    "concurrency control; database systems; deadlock;
modeling and simulation; transaction processing" ,
abstract=    "There is a growing evidence, that, for a fairly
wide variety of database workloads and system configurations, locking
is the concurrency control strategy of choice. With locking, of
course, comes the possibility of deadlocks. Although the database
literature is full of algorithms for dealing with deadlocks, very
little in the way of practical performance information is available to
a database system designer faced with the decision of choosing a good
deadlock resolution strategy. This paper is an attempt to bridge this
gap in our understanding of the behavior and performance of
alternative deadlock resolution strategies. We employ a simulation
model of a database environment to study the relative performance of
several strategies based on deadlock prevention, and a strategy based
on timeouts. We show that the choice of the best deadlock resolution
strategy depends upon the level of data contention, the resource
utilization levels, and the types of transactions. We provide
guidelines for selecting a deadlock resolution strategy for different
operating regions." ,
bibdate    =    "Mon Feb 15 12:28:24 1988" ,
owner    =    "manning" ,
)

@inproceedings    ( AGRAWAL89,
key    =    "Agrawal \& Gehani" ,
author    =    "Agrawal, R. and Gehani, N. H." ,
title    =    "Rationale for the Design of Persistence and Query
Processing Facilities in the Database Programming Language O++" ,
booktitle=    "2nd Int'l Workshop on Database Programming
Languages" ,
month    =    "jun" ,
year    =    "1989" ,
bibdate    =    "Tue Dec 19 13:22:06 1989" ,
owner    =    "robyn" ,
)

@article    ( AGRAWAL92,
key    =    "Agrawal \& El Abbadi" ,
author    =    "Agrawal, D. and El Abbadi, A," ,
title    =    "The Generalized Tree Quorum Protocol: An Efficient
Approach for Managing Replicated Data" ,
journal    =    "tods" ,
volume    =    "17" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1992" ,
pages    =    "689--717" ,
abstract=    "In this paper, we present a low-cost
fault-tolerant protocol for managing replicated data. We imposed a
logical tree structure on the set of copies of an object and develop a
protocol that uses the information available in the logical structure
to reduce the communication requirements for read and write
operations. The tree quorum protocol is a generalization of the static
voting protocol with two degrees of freedom for choosing quorums. In
general, this result in significantly lower communication costs for
comparable data availability. The protocol exhibits the property of
graceful degradation, i.e., communication costs for executing
operations are minimal in a failure-free environment but may increase
as failures occur. This approach in designing distributed systems is
desirable since it provides fault-tolerance without imposing
unnecessary costs on the failure-free modes of operations." ,
bibdate    =    "Fri Jan 22 12:33:46 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( AGRAWAL93,
key    =    "Agrawal et al." ,
author    =    "Agrawal, R. and Faloutsos, C. and Swami, A." ,
title    =    "Efficiency Similarity Search in Sequence Databases" ,
booktitle=    "Proceedings of the Conference on Foundations of
Data Organization" ,
organization=    "IBM Almaden Research Center" ,
year    =    "1993" ,
pages    =    "22" ,
abstract=    "We propose an indexing method for time sequences
for processing similarity queries. We use the Discrete Fourier
Transform (DFT), to map time sequences to the frequency domain, the
crucial observation being that, for most sequences of practical
interest, only the first few frequencies are strong. The second
important observation is Parseval's theorem, which specifies that the
Fourier transform preserves the Euclidean distance in the time or
frequency domain. Having thus mapped sequences to a
lower-dimensionality space by using only the first few Fourier
coefficients, we use $R^*$-trees to index the sequences and
efficiently answer similarity queries. We also provide experimental
results that demonstrate the superiority of our method over research
based on sequential scanning. Our experiments show that a small number
of coefficients (1-3) is adequate to provide good performance. The
performance gain of our method increases with the number and length of
sequences. Thus, our method is very promising for large databases." ,
bibdate    =    "Tue Jul 20 21:53:52 1993" ,
owner    =    "daisyc" ,
)

@article    ( AGRAWAL93A,
key    =    "Agrawal et al." ,
author    =    "Agrawal, D. and Abbadi, A.~E. and Singh, A.~K." ,
title    =    "Consistency and Orderability: Semantics-Based
Correctness Criteria for Databases" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "18" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1993" ,
pages    =    "460--486" ,
keywords=    "Concurrency control; object-oriented databases;
semantics; serializability theory" ,
abstract=    "The semantics of objects and transactions in
database systems are investigated. User-defined predicates called
consistency assertions are used to specify user programs. Three new
correctness criteria are proposed. The first correctness criterion
consistency is based solely on the users' specifications and admits
nonserializable executions that are acceptable to the users. Integrity
constraints of the database are maintained through consistency
assertions. The second correctness criterion orderability is a
generalization of view serializability and represents a weak notion of
equivalence to a serial schedule. Finally, the third correctness
criterion strong orderability is introduced as a generalization of
conflict serializability. Unlike consistency, the notions of
orderability allows users to operate in isolation as maintenance of
the integrity constraints now becomes the responsibility of the
database system." ,
bibdate    =    "Tue Nov 23 17:39:58 1993" ,
owner    =    "daisyc" ,
)

@inproceedings    ( AGRAWAL95,
key    =    "Agrawal \& Srikant" ,
author    =    "Agrawal, R. and Srikant, R." ,
title    =    "Mining Sequential Patterns" ,
booktitle=    "International Conference on Database Engineering" ,
organization=    "ieee" ,
year    =    "1995" ,
pages    =    "3--14" ,
bibdate    =    "Mon Nov 20 12:25:40 1995" ,
abstract=    "We are given a large database of customer
transactions, where each transaction consists of customer-id,
transaction time, and the items bought in the transaction. We
introduce the problem of mining sequential patterns over such
databases. We present three algorithms to solve this problem, and
empirically evaluate their performance using synthetic data. Two of
the proposed algorithms, AprioriSome and AprioriAll, have comparable
performance, albeit AprioriSome performs a little better when the
minimum number of customers that must support a sequential pattern is
low. Scale-up experiments show that both AprioriSome and AprioriAII
scale linearly with the number of customer transactions. They also
have excellent scale-up properties with respect to the number of
transactions per customer and the number of items in a transaction." ,
owner    =    "jeff" ,
)

@article    ( AHAMAD89,
key    =    "Ahamad \& Ammar" ,
author    =    "Ahamad, M. and Ammar, M.H." ,
title    =    "Performance Characterization of Quorum-Consensus
Algorithms for Replicated Data" ,
journal    =    "tose" ,
publisher=    "ieee" ,
volume    =    "15" ,
number    =    "4" ,
month    =    "apr" ,
year    =    "1989" ,
pages    =    "492--501" ,
keywords=    "data replication; quorum-consensus algorithms;
system availability; transaction response time; voting" ,
abstract=    "Replication is a popular technique for enhancing
the availability of data in a distributed system. Such a system must
use algorithms to maintain consistency of the replicated data. In this
correspondence, we develop a model and define performance measures for
a replicated data system that makes use of a quorum-census algorithm
to maintain consistency. We consider two measures: the proportion of
successfully completed transactions in systems where a transaction
aborts if data is not available and the mean response time in systems
where a transaction waits until data becomes available. Based on the
model, we show that for some quorum assignments, there is an optimal
degree of replication beyond which performance degrades. There exist
other quorum assignments which have no optimal degree replication. We
also derive optimal read and write quorums which maximize the
proportion of successful transactions." ,
bibdate    =    "Tue Apr 11 10:57:16 1989" ,
owner    =    "payne" ,
)

@techreport    ( AHN86D,
key    =    "Ahn" ,
author    =    "Ahn, Ilsoo" ,
title    =    "Adaptive Hashing" ,
institution=    "AT \& T Bell Laboratories" ,
address    =    "Columbus, OH" ,
year    =    "1986" ,
month    =    "dec" ,
pages    =    "1--21" ,
abstract=    "A new hashing scheme, termed adaptive hashing, is
proposed to handle dynamic growth or shrinkage of files. Until there
occurs an overflow, adaptive hashing is the same as conventional
fixed-size hashing. When an overflow or an underflow occurs, a bucket
is split into two or merged with another by maintaining a list of
overflow addresses. The overflow list, storing only the addresses of
buckets that experienced overflows, is usually small enough to reside
in the main memory, thus the cost to retrieve a record is just one
bucket access. When the overflow list grows too big, the list itself
can be organized for rapid access using the same hashing scheme
recursively. It is also possible to reduce the overflow list by
reorganizing the file with a bigger address space." ,
bibdate    =    "Tue Mar 24 17:13:01 1987" ,
owner    =    "manning" ,
)

@article    ( AHN87A,
key    =    "Ahn" ,
author    =    "Ahn, I." ,
title    =    "Adative Hashing" ,
journal    =    "submitted for publication" ,
year    =    "1987" ,
)

@article    ( AHO79,
key    =    "Aho et al." ,
author    =    "Aho, A.V. and Sagiv, Y. and Ullman, J.D." ,
title    =    "Efficient Optimization of a Class of Relational
Expressions" ,
journal    =    "tods" ,
volume    =    "4" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1979" ,
pages    =    "435--454" ,
keywords=    "relational database;relational algebra;query
optimization;equivalence of queries;NP-completeness;tableaux" ,
abstract=    "The design of several database query languages has
been influenced by Codd's relational algebra. This paper discusses the
difficulty of optimizing queries based on the relational algebra
operations select, project, and join. A matrix, called a tableau, is
proposed as a useful device for representing the value of a query, and
optimization of queries is couched in terms of finding a minimal
tableau equivalent to a given one. Functional dependencies can be used
to imply additional equivalences among tableaux.\pendencies can be
used to imply additional equivalences among tableaux. Although the
optimization problem is NP-complete, a polynomial time algorithm
exists to optimize tableaux that correspond to an important subclass
of queries." ,
bibdate    =    "Sun Oct 28 16:16:13 1984" ,
)

@article    ( AHO79A,
key    =    "Aho et al." ,
author    =    "Aho. A.V. and Sagiv, Y. and Ullman, J.D." ,
title    =    "Equivalences Among Relational Expressions" ,
journal    =    "SIAM Journal of COmputing" ,
volume    =    "8" ,
number    =    "2" ,
month    =    "may" ,
year    =    "1979" ,
pages    =    "218--246" ,
bibdate    =    "Wed Nov  2 15:28:18 1994" ,
owner    =    "rts" ,
)

@article    ( AHO79B,
key    =    "Aho et al." ,
author    =    "Aho, A.V. and Beeri, C. and Ullman, J.D." ,
title    =    "The Theory of Joins in Relational Databases" ,
journal    =    "tods" ,
volume    =    "4" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1979" ,
pages    =    "297--314" ,
keywords=    "relational databases, decomposition of database
schemes, lossless join, functional dependencies, multivalued
dependencies, natural join, projection of dependencies" ,
abstract=    "Answering queries in a relational database often
requires that the natural join of two or more relations be computed.
However, the result of a join may not be what one expects. In this
paper we give efficient algorithms to determine whether the join of
several relations has the intuitively expected value (is lossless) and
to determine whether a set of relations has a subset with a lossy
join. These algorithms assume that all data dependencies are
functional. We then discuss the extension of our techniques to the
case where data dependencies are multivalued." ,
bibdate    =    "Wed Sep  2 17:26:37 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( AIKEN92,
key    =    "Aiken et al." ,
author    =    "Aiken, A. and Widom, J. and Hellerstein, J. M." ,
title    =    "Behavior of Database Production Rules:
Termination, Confluence, and Observable Determinism" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "San Diego, California" ,
editor    =    "Stonebraker, M." ,
volume    =    "21" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "59--68" ,
abstract=    "Static analysis methods are given for determining
whether arbitrary sets of database production rules are (1) guaranteed
to terminate; (2) guaranteed to produce a unique final database state;
(3) guaranteed to produce a unique stream of observable actions. When
the analysis determines that one of these properties is not
guaranteed, it isolates the rules responsible for the problem and
determines criteria that, if satisfied, guarantee the property. The
analysis methods are presented in the context of the Starburst Rule
system; they will form the basis of an interactive development
environment for Starburst rule programmers." ,
bibdate    =    "Mon Jan 25 13:32:31 1993" ,
owner    =    "bassili" ,
)

@techreport    ( AKSCYN84,
key    =    "Akscyn\&McCracken" ,
author    =    "Akscyn, R.M. and McCracken, D.L." ,
title    =    "The ZOG Approach to Database Management" ,
number    =    "CMU-CS-84-128" ,
institution=    "cmucsd" ,
year    =    "1984" ,
month    =    "mar" ,
abstract=    "ZOG is a general-purpose human-computer interface
system that combines the features of a database system, a
word-processing wystem, and an operating system shell. The primary
features of ZOG are (1) an emphasis on menu-selection as the primary
interface mode; (2) th se of the selection process for naigation in
the database, editing the content and structure of the database, and
interactin with programs; (3) an architecture that supports the
implementation and growth of very large, distributed databases; and
(4) rapid system response. A distributed MIS, based on the ZOG
concept, was developed by Carnegie-Mellon University for the USS CARL
VINSON, a nuclear-powered aircraft carrier, in cooperation with the
ship's crew. This system is a distributed database system implemented
on a network of high-powered personal computers (PERQ's). This paper
focuses on ZOG as a database management system. Using a set of common
database problems as a framework, the ZOG approach to database
management is discussed and compared with conventional approaches." ,
annote    =    "ZOG solutions to the following database problems
are presented: building, flexibility, aggregation, reliability,
multiple versions, integration, unfamiliarity, accessibility,
security, conflicting update, and change awareness." ,
bibdate    =    "Tue Aug 28 12:51:09 1984" ,
)

@inbook        ( ALBANO88,
key    =    "Albano et al" ,
author    =    "Albano, A. and Ghelli, G. and Orsini, R." ,
title    =    "The Implementation of Galileo's Persistent Values" ,
booktitle=    "Data Types and Persistence" ,
publisher=    "Springer-Verlag" ,
year    =    "1988" ,
chapter    =    "16" ,
pages    =    "253--263" ,
abstract=    "Galileo is a conceptual language for database
applications in which the persistence of values is an orthogonal
property, i.e., values of any type are persistent as long as they are
accessible from the top level environment. In Galileo providing such
property poses difficult problems since the language is based on a
heap memory management, with variable size elements and an incremental
garbage collection, and it allows user control of failures and undo of
updates. The interaction of these features is described and the
approach adopted in the implementation now underway is discussed." ,
bibdate    =    "Mon Nov  6 16:02:02 1989" ,
owner    =    "robyn" ,
)

@techreport    ( ALLCHIN83D,
key    =    "Allchin" ,
author    =    "Allchin, J." ,
title    =    "How to Shadow a Shadow" ,
number    =    "GIT-ICS-83/5" ,
institution=    "Georgia Institute of Technology" ,
year    =    "1983" ,
month    =    "feb" ,
pages    =    "1--12" ,
abstract=    "Several file and database systems have used a
shadowing technique for recovery purposes on data files which are not
concurrently accessed. Essentially there are two versions: the current
version and a shadow version. Transactions manipulate only the current
version. When a change is first made to a data page, a new page is
allocated and the current version page directory is updated with the
new page location. The usual implementation is exceptionally efficient
for small to medium-sized files because on transaction termination the
only processing required is to determine which version should become
the shadow; the other version is discarded. This paper discusses an
efficient solution for using this approach with concurrent
transactions. We present a technique for building not only
single-level concurrent transactions, but nested transactions which
may be concurrent as desired." ,
bibdate    =    "Wed Dec 13 09:17:00 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( ALLMAN76,
key    =    "Allman et al." ,
author    =    "Allman, E. and G. Held and M. Stonebraker" ,
title    =    "Embedding a Data Manipulation Language in a
General Purpose Programming Language" ,
booktitle=    "Proceedings of the Conference on Data Abstraction,
Definition, and Structure" ,
organization=    "ACM-SIGPLAN-SIGMOD" ,
publisher=    "ACM" ,
address    =    "Salt Lake City, UT" ,
month    =    "mar" ,
year    =    "1976" ,
pages    =    "25--35" ,
bibdate    =    "Mon May  9 14:10:20 1988" ,
owner    =    "" ,
)

@inbook        ( ALONSO88,
key    =    "Alonso et al" ,
author    =    "Alonso, R. and Barbara, D. and Garcia-Molina, H.
and Abad, S." ,
title    =    "Quasi-copies: Efficient data sharing for
information retrieval systems" ,
series    =    "Lecture Notes in Computer Science" ,
publisher=    "Springer-Verlag" ,
volume    =    "303" ,
year    =    "1988" ,
pages    =    "443--468" ,
bibdate    =    "Mon Oct 23 08:44:51 1989" ,
owner    =    "robyn" ,
)

@techreport    ( ALONSO92,
key    =    "Alonso \& Barbara" ,
author    =    "Alonso, R. and Barbara, D." ,
title    =    "The Characterization of Continuous Queries in
General Environments" ,
number    =    "MITL-TR-38-92" ,
institution=    "Matsushita Information Technology Laboratory" ,
year    =    "1992" ,
month    =    "dec" ,
pages    =    "23" ,
abstract=    "In a world where the amount of electronic
information available is constantly growing, techniques to select and
filter information efficiently become increasingly important.
Continuous queries are a tool that allows users to monitor one or more
information sources, by giving the impression that the queries for a
wide spectrum of environments. We consider both append-only data
sources and systems that allow more general data manipulation. We
examine the case where the database management software may be
modified as well as where we must treat it as a black box. We study
the classes of queries that can be supported in each case and present
efficient implementation techniques for them." ,
bibdate    =    "Fri Mar 26 19:40:44 1993" ,
owner    =    "bassili" ,
)

@article    ( AMIR90,
key    =    "Amir \& Roussopoulos" ,
author    =    "Amir, Amihood and Roussopoulos, Nick" ,
title    =    "Optimal View Caching" ,
journal    =    "Information Systems" ,
year    =    "1990" ,
volume    =    "15" ,
number    =    "2" ,
pages    =    "169--171" ,
month    =    "" ,
)

@article    ( AMIR90A,
key    =    "Amir \& Roussopoulos" ,
author    =    "Amir, A. and Roussopoulos, N." ,
title    =    "Optimal View Caching" ,
journal    =    "Information Systems" ,
publisher=    "Pergammon Press" ,
volume    =    "15" ,
number    =    "2" ,
year    =    "1990" ,
pages    =    "169--171" ,
abstract=    "A view in a database is a subset of records
selected from several files to satisfy some condition, e.g. the join
of two relations. It has been shown that it's more efficient to tore
pointers to the satisfying records of the base relations rather than
the complete records of the view. We are interested in efficient
caching of such pointers (in effect constructing the view) when the
database lies in a secondary storage and only a limited number buffers
exists in memory. A view caching is optimal if it is done with the
minimum number of reads from secondary storage. We prove that optimal
view caching is NP-complete." ,
bibdate    =    "Wed May 19 23:01:35 1993" ,
owner    =    "bassili" ,
)

@article    ( AMMON85,
key    =    "Ammon et al." ,
author    =    "Ammon, G. and Calabria, J. and Thomas, D." ,
title    =    "A High-Speed, Large-Capacity, Jukebox Optical Disk
System" ,
journal    =    "IEEE Computer" ,
volume    =    "18" ,
number    =    "7" ,
month    =    "jul" ,
year    =    "1985" ,
pages    =    "36--46" ,
bibdate    =    "Mon Aug  5 15:28:36 1985" ,
)

@inproceedings    ( ANDANY91,
key    =    "Andany et al." ,
author    =    "Andany, J. and Leonard, M. and Palisser, C." ,
title    =    "Management of Schema Evolatuion in Databases" ,
booktitle=    "vldb" ,
address    =    "Barcelona, Spain" ,
month    =    "sep" ,
year    =    "1991" ,
pages    =    "161--170" ,
bibdate    =    "Tue Mar 16 11:16:36 1993" ,
owner    =    "rts" ,
)

@article    ( ANSI75,
key    =    "ANSI" ,
author    =    "ANSI/X3/SPARC" ,
title    =    "Interim report of the Study Group on Database
Management System" ,
journal    =    "FDT (ACM SIGMOD Bulletin)" ,
volume    =    "7" ,
number    =    "2" ,
month    =    "feb" ,
year    =    "1975" ,
bibdate    =    "Fri Apr 26 08:34:25 1985" ,
)

@manual        ( ANSI89,
key    =    "ANSI" ,
title    =    "X3.135-1989 Database Language SQL" ,
year    =    "1989" ,
organization=    "American National Standards Institute" ,
bibdate    =    "Sat Oct 31 15:37:04 1992" ,
owner    =    "rts" ,
)

@techreport    ( ANWAR92A,
key    =    "Anwar" ,
author    =    "Anwar, E. and Maugis, L. and Chakravarthy, S." ,
title    =    "A New Perspective on Rule Support for
Object-Oriented databases" ,
number    =    "UF-CIS-TR-92-042" ,
institution=    "University of Florida" ,
address    =    "Department of Computer and Information Sciences" ,
year    =    "1992" ,
month    =    "nov" ,
pages    =    "28" ,
abstract=    "This paper proposes a new approach for supporting
reactive capability in an object-oriented database. We introduce an
event interface, which extends the conventional object semantics to
include the role of an event generator. The proposed design of this
interface enables objects to propagate events relevant to that class
asynchronously. This interface provides a basis for the specification
of events spanning sets of object, possibly from different classes,
and detection of primitive and complex events. This approach clearly
separates event detection from rules. New rules can be added and use
existing objects, enabling objects to react to their own changes as
well as to the changes of other objects. We use a runtime subscription
mechanism, between rules and objects to selectively monitor particular
objects dynamically. This elegantly supports class level as well as
instance level rules. Moreover, we propose a design for the
specification and detection of simple as well as complex events. Both
events and rules are treated as first class objects. Finally,
treatment of events and rules as objects and the general event
interface permit specification of rules on any set of objects,
including rules themselves." ,
bibdate    =    "Tue Jan 19 13:14:05 1993" ,
owner    =    "bassili" ,
)

@techreport    ( AREF94,
key    =    "Aref et al." ,
author    =    "Aref, Walid and Barbara, Daniel and Korth, Henry
F." ,
title    =    "Handwritten Databases: Ink as a first-class
database type (Extended Abstract)" ,
institution=    "Panasonic Technologies, Inc." ,
address    =    "Princeton, NJ" ,
year    =    "1994" ,
month    =    "oct" ,
bibdate    =    "Mon Nov 14 12:48:13 1994" ,
owner    =    "kevin" ,
)

@techreport    ( AREF94A,
key    =    "Aref et al." ,
author    =    "Aref, Walid G. and Vallabhaneni, Padmavathi and
Barbara, Daniel" ,
title    =    "The Handwritten Trie: Indexing Electronic Ink" ,
institution=    "Matsushita Information Technology Laboratory" ,
address    =    "Princeton, NJ" ,
year    =    "1994" ,
month    =    "oct" ,
abstract=    "The emergence of the pen as the main interface
device for personal digital assistants and pen-computers has made
handwritten text, and more generally ink, a first-calss object. As for
any other type of data, the need of retrieval is a prevailing one.
Retrieval of handwritten text is more difficult than that of
conventional data since it is necessary to identify a handwritten word
given slightly different variations in its shape. The current way of
addressing this is by using handwriting recognition, which is prone to
errors and limits the expressiveness of ink. Alternatively, one can
retrieve from the database handwritten words that are similar to a
query handwritten word using techniques borrowed from pattern and
speech recognition. In particular, Hidden Markov Models (HMM) can be
used as representatives of the handwritten words in the database.
However, using HMM techniques to match the input against every item in
the database (sequential searching) is unacceptably slow and does not
scale up for large ink databases. In this paper, an indexing technique
based on HMMs is proposed. The new index is a variation of the trie
data structure that uses HMMs and a new search algorithm to provide
approximate matching. Each node in the tree contains handwritten
letters, where each letter is represented by an HMM. Branching in the
trie is based on the ranking of matches given by the HMMs. The new
search algorithm is parameterized so that it provides means for
controlling the matching quality of the search process via a
time-based budget. The index dramatically improves the search time in
a database of handwritten words. Due to the variety of platforms for
which this work is aimed, ranging from personal digital assistants to
desktop computers, we implemented both main-memory and disk-based
systems. The implementations are reported in this paper, along with
performance results that show the practicality of the technique under
a variety of conditions." ,
bibdate    =    "Tue Nov 29 21:01:45 1994" ,
owner    =    "kevin" ,
)

@inbook        ( AREF94C,
key    =    "Aref et al." ,
author    =    "Aref, Walid G. and Barbara, Daniel and Lopresti,
Daniel P. and Tomkins, Andrew" ,
title    =    "Ink as a First-Class Datatype in Multimedia
Databases" ,
booktitle=    "Multimedia Databases" ,
publisher=    "Spinger and Verlag" ,
address    =    "Princeton, NJ" ,
year    =    "1994" ,
month    =    "oct" ,
bibdate    =    "Thu Dec  1 11:08:17 1994" ,
owner    =    "kevin" ,
)

@inproceedings    ( ARMSTRONG74,
key    =    "Armstrong" ,
author    =    "Armstrong, W." ,
title    =    "Dependency Structures of Data Base Relationships" ,
booktitle=    "Proceedings of the IFIP Congress" ,
year    =    "1974" ,
bibdate    =    "Tue Jun 27 15:10:34 1995" ,
owner    =    "soo" ,
)

@article    ( ASTRAHAN75A,
key    =    "Astrahan \& Chamberlin" ,
author    =    "Astrahan, M.M. and Chamberlin, D.D." ,
title    =    "Implementation of a structured English query
language" ,
journal    =    "cacm" ,
volume    =    "18" ,
number    =    "10" ,
month    =    "oct" ,
year    =    "1975" ,
pages    =    "580--588" ,
)

@article    ( ASTRAHAN76,
key    =    "Astrahan et al." ,
author    =    "Astrahan, M. and Blasgen, M. and Chamberlin, D.
and Eswaran, K. and Gray, J. and Griffiths, P. and King, W. and Lorie,
R. and McJones, P. and others" ,
title    =    "System R: Relational Approach to Database
Management" ,
journal    =    "tods" ,
volume    =    "1" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1976" ,
pages    =    "97--137" ,
bibdate    =    "Mon Dec  2 11:26:18 1985" ,
)

@inproceedings    ( ATKINSON85,
key    =    "Atkinson \& Morrison" ,
author    =    "Atkinson, M. and Morrison, M." ,
title    =    "Types, Bindings and Parameters in a Persistent
Environment" ,
booktitle=    "Proceedings of the Appin Workshop on Persistence
and Data Types" ,
address    =    "Glasgow" ,
month    =    "aug" ,
year    =    "1985" ,
bibdate    =    "Mon Feb  2 11:28:01 1987" ,
owner    =    "manning" ,
)

@techreport    ( ATKINSON87,
key    =    "Atkinson et al." ,
author    =    "Atkinson, M. and Buneman, P. and Morrison, R." ,
title    =    "Delayed binding and Type Checking in Database
Programming Languages" ,
number    =    "45" ,
institution=    "University of St. Andrews" ,
address    =    "St. Andrews, Scotland" ,
year    =    "1987" ,
month    =    "sep" ,
pages    =    "1--27" ,
abstract=    "Attention is drawn to the issues regarding the
timing and performance of binding and type checking in database
programming languages. Examination of the relationships between long
term data and programs leads to the recognition of four patterns of
binding. A representative sample of such languages is reviewed to show
that some give explicit control over binding without loss of strong
typing, whereas others have no mechanisms to support the binding we
deem necessary. We conclude that it is both possible and desirable to
provide constructs to explicitly identify bindings that should be
delayed, without loss of strong type checking. Such provision has an
impact on the type equivalence rules available for database
programming languages." ,
bibdate    =    "Fri Jan 19 16:05:19 1990" ,
owner    =    "robyn" ,
)

@inbook        ( ATKINSON90,
key    =    "Atkinson et al." ,
author    =    "Atkinson, M. and Bancilhon, F. and DeWitt, D. and
Dittrich, K. and Maier, D. and Zdonik, S." ,
title    =    "The Object-Oriented Database System Manifesto" ,
booktitle=    "Deductive and Object-Oriented Databases" ,
publisher=    "Elsevere Science Publishers" ,
address    =    "Amsterdam" ,
year    =    "1990" ,
bibdate    =    "Fri Apr 24 15:14:32 1992" ,
owner    =    "soo" ,
)

@techreport    ( ATKINSON90A,
key    =    "Atkinson et al." ,
author    =    "Atkinson, M. and Bancilhon, F. and DeWitt, D. and
Dittrich, K. and Maier, D. and Zdonik, S." ,
title    =    "The Object Oriented Database System Manifesto" ,
number    =    "30-89" ,
institution=    "GIP ALTAIR" ,
address    =    "Le Chesnay France" ,
month    =    "sep" ,
year    =    1989 ,
annote    =    "The manifesto is a discussion of what it is to be
OODBMS, the factors are divided into 3 classes required, optional, and
'goodies'. Goodies are extras which, while useful keep getting in the
way of actually defining OO. The authors argue for a revolution in
D.B. leading towards the OO paradigm." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( ATZENI81,
key    =    "Atzeni \& Chen" ,
author    =    "Atzeni, P. and Chen, P.P." ,
title    =    "Completeness of Query Languages for the Entity-
Relationship Model" ,
booktitle=    "Entity-Relationship Approach to Information
Modeling and Analysis" ,
publisher=    "North-Holland Publishers" ,
address    =    "Washington, D.C." ,
editor    =    "Chen, P.P." ,
month    =    "oct" ,
year    =    "1981" ,
pages    =    "111--124" ,
abstract=    "The notion of completeness for query languages
based on the Entity-Relationship model is proposed. It is based on
predicate calculus, like relational completeness but also takes into
account the ability of the Entity-Relationship model to capture the
semantics of the real world. Two formal definitions of completeness
are given: E-R completeness and simplified E-R completeness, the
latter being a weak version of the former. Finally, a modified version
of a recently proposed language, the Executable Language, is briefly
described and it is shown to satisfy the property of simplified E-R
completeness." ,
bibdate    =    "Mon Mar 25 09:39:22 1985" ,
)

@inproceedings    ( ATZENI82,
key    =    "Atzeni \& Parker" ,
author    =    "Atzeni, P. and Parker, S., Jr." ,
title    =    "Assumptions in Relational Database Theory" ,
booktitle=    "pods" ,
organization=    "acm" ,
address    =    "Los Angeles, CA" ,
month    =    "mar" ,
year    =    "1982" ,
pages    =    "1--9" ,
abstract=    "Many results in relational database theory on the
structure of dependencies, query languages, and databases in general
have now been established. However, neither (a) the reliance of these
results on various {\em assumptions}, nor (b) the desirability or
reasonableness of these assumptions themselves have been closely
examined. These assumptions are nontrivial: examples include the
universal relation assumption and the lossless join assumption. The
purpose of the present paper is clarify many of the existing
assumptions, and point out weaknesses. This is desirable both to
harden the statements of previous results, and to evaluate recent
suggestions that certain assumptions (such as the acyclic JD
assumption) may be useful for modeling ``real-world'' databases.
Specifically, studies are made of assumptions made for (1) universal
relations, (2) functional dependency inference, and (3) decomposition
theory. We show that: \begin{itemize} \item Some assumptions (such as
uniqueness of relationships among attributes) can be more powerful
than they appear; \item common treatment of FDs is sometimes
inappropriate, and for example FD inferences such as \{ A --> B, B -->
C \} |= A --> C can be incorrect; \item the `decomposition' approach
to design may be hard to justify in real terms; and \item Acyclic JDs
may have drawbacks in eliminating ambiguity in queries and in modeling
real enterprises. \end{itemize} It is hoped that this exposition will
help clarify some confusing issues in this field, and will lead to a
better understanding of which assumptions are reasonable and useful in
modeling the ``real-world''." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( BABAD77,
key    =    "Babad" ,
author    =    "Babad, J." ,
title    =    "A Record and File Partitioning Model" ,
journal    =    "cacm" ,
volume    =    "20" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1977" ,
pages    =    "22--31" ,
bibdate    =    "Mon Jun  2 16:30:18 1986" ,
owner    =    "ahn" ,
)

@article    ( BAEZA89,
key    =    "Baeza-Yates \& Larson" ,
author    =    "Baeza-Yates, R. and Larson, P." ,
title    =    "Performance of B+ -Trees with Partial Expansions" ,
journal    =    "tse" ,
volume    =    "1" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1989" ,
pages    =    "248--257" ,
keywords=    "analysis of algorithms; B-trees; file structures;
overflow techniques; partial expansions" ,
abstract=    "A B+-tree with partial expansions is based on the
idea of gradually increasing the size of an overflowing bucket,
instead of immediately splitting it. When the bucket reaches some
maximum size, it is split in the normal way. In this paper we
mathematically analyze the behavior of the new file structure under
random insertions, focusing on the expected storage utilization and
the expected cost of insertions. The model can be used for studying
both the asymptotic and dynamic behavior. The accuracy of the model is
confirmed by simulation. Disk space management is more difficult than
for standard B+ -trees. We investigate two simple space management
schemes specifically designed for handling buckets of two different
sizes. It is found that an overall storage utilization of 81 percent
can be achieved in practice." ,
bibdate    =    "Fri Oct 20 10:43:05 1989" ,
owner    =    "robyn" ,
)

@article    ( BANCILHON81,
key    =    "Bancilhon \& Spyratos" ,
author    =    "Bancilhon, F. and Spyratos, N." ,
title    =    "Update Semantics of Relational Views" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "6" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1981" ,
pages    =    "557--575" ,
bibdate    =    "Thu Aug  4 19:32:11 1988" ,
owner    =    "" ,
)

@inproceedings    ( BANCILHON85,
key    =    "Bancilhon et al." ,
author    =    "Bancilhon, Francois and Kim, Won and Korth, Henry
F." ,
title    =    "A Model of CAD Transactions" ,
booktitle=    "Proceedings of the 11th International Conference
on Very Large Data Bases" ,
year    =    "1985" ,
pages    =    "25--33" ,
month    =    "" ,
)

@inproceedings    ( BANCILHON86,
key    =    "Bancilhon \& Ramakrishnan" ,
author    =    "Bancilhon, Francois and Ramakrishnan, Raghu" ,
title    =    "An Amateur's Introduction to Recursive Query
Processing Strategies" ,
booktitle=    "Proceedings of the ACM SIGMOD '86" ,
year    =    "1986" ,
pages    =    "16--52" ,
month    =    "May" ,
)

@inproceedings    ( BANCILHON87,
key    =    "Bancilhon et al." ,
author    =    "Bancilhon, F. and Briggs, T. and Khoshafian, S.
and Valduriez, P" ,
title    =    "FAD, a Powerful and Simple Database Language" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
year    =    "1987" ,
pages    =    "97--105" ,
abstract=    "FAD is a powerful and simple language designed for
a highly parallel database machine. The basic concepts of the language
are its data structures (which we call objects) and its programs
(defined in terms of operators and predicates). The primary features
of the language are (i) the support of complex objects with built-in
notion of object identity; (ii) an abstract data type capability;
(iii) a persistent object space; and (iv) the efficient support of
iteration, conditionals, and set operations. FAD is functional and
uses low level operators and operator constructors. This provides for
the opportunity of dataflow execution in a parallel architecture. FAD
has been successfully implemented in (i) an interpreter working on a
main memory database and (ii) integrated in a prototype of a database
machine." ,
bibdate    =    "Thu Jan 18 10:49:00 1990" ,
owner    =    "robyn" ,
)

@article    ( BANCILHON90,
key    =    "Bancilhon \& Kim" ,
author    =    "Bancilhon, F. and Kim, W." ,
title    =    "Object-Oriented Database Systems: In Transition" ,
journal    =    "IEEE Data Engineering" ,
publisher=    "ieee" ,
volume    =    "13" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1990" ,
pages    =    "24--28" ,
bibdate    =    "Thu Jul  8 22:29:47 1993" ,
owner    =    "daisyc" ,
)

@inproceedings    ( BANERJEE87,
key    =    "Banerjee et al." ,
author    =    "Banerjee, J. and Kim, W. and Kim, H.J. and Korth,
H.F." ,
title    =    "Semantics and Implementation of Schema Evolution
in Object-Oriented Databases" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Dayal, U. and Traiger, I." ,
address    =    "San Francisco, CA" ,
year    =    "1987" ,
pages    =    "311--322" ,
abstract=    "Object-oriented programming is well-suited to such
data-intensive application domains as CAD/CAM, AI, and OIS (office
information system) with multimedia documents. At MCC, we have built a
prototype object- oriented database system, called ORION. It adds
persistence and sharability to objects created and manipulated in
applications implemented in an object- oriented programming
environment. One of the important requirements of these applications
is schema evolution, that is, the ability to dynamically make a wide
variety of changes to the database schema. In this paper, following a
brief review of the object-oriented data model that we support in
ORION, we establish a framework for supporting schema evolution,
define the semantics of schema evolution, and discuss its
implementation." ,
bibdate    =    "Wed Apr 22 14:13:27 1987" ,
owner    =    "manning" ,
)

@article    ( BANERJEE87A,
key    =    "Banerjee et al." ,
author    =    "Banerjee, J. and Chou, H. and Kim, W. and Garza,
H. and Woelk, D. and Ballou, N. and Kim, H.J." ,
title    =    "Data Model Issues for Object-Oriented Applications" ,
journal    =    "tois" ,
publisher=    "acm" ,
volume    =    "5" ,
number    =    "1" ,
month    =    "apr" ,
year    =    "1987" ,
keywords=    "design; theory; composite objects; object-oriented
database, schema evolution; version management" ,
abstract=    "Presented in this paper is the data model for
ORION, a prototype database system that adds persistence and
sharability to objects created and manipulated in object-oriented
applications. The ORION data model consolidates and modifies a number
of major concepts found in many object-oriented systems, such as
objects, classes, class lattice, methods, and inheritance. These
concepts are reviewed and three major enhancements to the conventional
object-oriented data model, namely, schema evolution, composite
objects, and versions, are elaborated upon. Schema evolution is the
ability to dynamically make changes to the class definitions and the
structure of the class lattice. Composite objects are recursive
collections of exclusive components that are treated as units of
storage, retrieval, and integrity enforcement. Versions are variations
of the same object that are related by the history of their
derivation. These enhancements are strongly motivated by the data
managment requirements of ORION applications from the domains of
artificial intelligence, computer-aided design and manufacturing, and
office information systems with multimedia documents." ,
bibdate    =    "Fri Mar 31 14:05:28 1989" ,
owner    =    "payne" ,
)

@inproceedings    ( BANERJEE87B,
key    =    "Banerjee et al." ,
author    =    "Banerjee, J. and Kim, W. and Kim, H.J. and Korth,
H.F." ,
title    =    "Semantics and Implementation of Schema Evolution
in Object-Oriented Databases" ,
booktitle=    "Proceedings of the ACM SIGMOD 87" ,
organization=    "acm" ,
publisher=    "acm" ,
address    =    "San Francisco, CA" ,
year    =    "1987" ,
month    =    "may" ,
bibdate    =    "Fri Mar 31 14:09:01 1989" ,
owner    =    "payne" ,
)

@article    ( BANERJEE88,
key    =    "Banerjee et al." ,
author    =    "Banerjee, Jay and Kim, Won and Kim, Sung-Jo and
Garza, Jorge F." ,
title    =    "Clustering a DAG for CAD Databases" ,
journal    =    "IEEE Transactions on Software Engineering" ,
year    =    "1988" ,
volume    =    "14" ,
number    =    "11" ,
pages    =    "1684--1699" ,
month    =    "November" ,
)

@article    ( BARCUCCI90,
key    =    "Barcucci et al" ,
author    =    "Barcucci, E. and Pinzani, R. and Sprugnoli, R." ,
title    =    "Optimal Selection of Secondary Indexes" ,
journal    =    "tse" ,
volume    =    "16" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1990" ,
pages    =    "32--38" ,
abstract=    "When planning a database, the problem of index
selection is of particular interest. In this paper, we examine a
transaction model which includes queries, updates, insertions, and
deletions, and we define a function that calculates the transactions
total cost when an index set is used. Our aim was to minimize the
function cost in order to identify the optimal set. The algorithms
proposed in other studies require an exponential time in the number of
file attributes in order to solve the problem. We propose a heuristic
algorithm based on some properties of the cost function and this
algorithm produces an almost optimal set in polinomial time. In many
cases, the cost function properties make it possible to prove that the
solution obtained is the optimal one." ,
bibdate    =    "Fri Dec 29 15:47:06 1989" ,
owner    =    "robyn" ,
)

@article    ( BARGHOUTI91,
key    =    "Barghouti \& Kaiser" ,
author    =    "Barghouti, N. and Kaiser, G." ,
title    =    "Concurrency Control in Advanced Database
Applications" ,
journal    =    "compsurv" ,
volume    =    "23" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1991" ,
pages    =    "269--317" ,
abstract=    "Concurrency control has been thoroughly studied in
the context of traditional database applications such as banking and
airline reservations systems. There are relatively few studies,
however, that address the concurrency control issues of advanced
database applications such as CAD/CAM and software development
environments. The concurrency control requirements in such
applications are different from those in conventional database
applications; in particular, there is a need to support
nonserializable cooperation among users whose transactions are
long-lived and interactive and to integrate concurrency control
mechanisms with version and configuration control. This paper outlines
the characteristics of data and operations in some advanced database
applications, discusses their concurrency control requirements, and
surveys the mechanisms proposed to address these requirements." ,
keywords=    "advanced database applications, concurrency
control, cooperative transactions, design environments, extended
transaction models, long transactions, object-oriented databases,
relaxing serializability" ,
bibdate    =    "Mon Oct 28 16:07:02 1991" ,
owner    =    "soo" ,
)

@article    ( BASSIOUNI85,
key    =    "Bassiouni" ,
author    =    "Bassiouni, M. A." ,
title    =    "Data Compression in Scientific and Statistical
Databases" ,
journal    =    "IEEE Transactions on Software Engineering" ,
year    =    "1985" ,
volume    =    "SE-11" ,
number    =    "10" ,
pages    =    "1047--1058" ,
month    =    "October" ,
)

@inproceedings    ( BATINI85,
key    =    "Batini \& Ceri" ,
author    =    "Batini, C. and Ceri, S." ,
title    =    "Database Design: Methodologies, Tools, and
Environments" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "148--150" ,
bibdate    =    "Tue Jun 11 11:57:58 1985" ,
)

@article    ( BATINI86,
key    =    "Batini et al." ,
author    =    "Batini, C. and Lenzerini, M. and Navathe, S.B." ,
title    =    "A Comparative Analysis of Methodologies for
Database Schema Integration" ,
journal    =    "compsurv" ,
publisher=    "acm" ,
volume    =    "18" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1986" ,
pages    =    "323--364" ,
keywords=    "Management; conceptual database design; database
integration; database schema integration; information systems design;
models; view integration" ,
abstract=    "One of the fundamental principles of the database
approach is that a database allows a nonredundant, unified
representation of all data managed in an organization. This is
achieved only when methodologies are available to support integration
across organizational and application boundaries. Methodologies for
database design usually perform the design activity by separately
producing several schemas, representing parts of the application,
which are subsequently merged. Database schema integration is the
activity of integrating the schemas of existing or proposed databases
in a global, unified schema. The aim of the paper is to provide first
a unifying framework for the problem of schema integration, then a
comparative review of the work done thus far in this area. Such a
framework, with the associated analysis of the existing approaches,
provides a basis for identifying strengths and weaknesses of
individual methodologies, as well as general guidelines for future
improvements and extensions." ,
bibdate    =    "Mon Aug 24 12:45:30 1987" ,
owner    =    "manning" ,
)

@article    ( BATINI89,
key    =    "Batini et al" ,
author    =    "Batini, C. and Nardelli, E. and Tamassia, R." ,
title    =    "A Layout Algorithm for Data Flow Diagrams" ,
journal    =    "tse" ,
publisher=    "ieee" ,
volume    =    "12" ,
number    =    "4" ,
month    =    "apr" ,
year    =    "1986" ,
pages    =    "538--546" ,
keywords=    "database design; design tools; functional
analysis; layout algorithms" ,
abstract=    "A layout algorithm is presented that allows the
automatic drawing of data flow diagrams, a diagrammatic representation
widely used in the functional analysis of information systems. A grid
standard is defined for such diagrams, and aesthetics for a good
readability are identified. The layout algorithm receives as input an
abstract graph, specifying connectivity relations between the elements
of the diagram, and produces as output a corresponding diagram
according to the aesthetics. The basic strategy is to build
incrementally the layout; first, a good topology is constructed with
few crossings between edges; subsequently, the shape of the diagram is
determined in terms of angles appearing along edges; and finally,
dimensions are given to the graph, obtaining a grid skeleton for the
diagram." ,
bibdate    =    "Fri Oct  6 14:34:06 1989" ,
owner    =    "robyn" ,
)

@book        ( BATINI92,
key    =    "Batini et al." ,
author    =    "Batini, C. and Ceri, S. and Navathe, S." ,
title    =    "Conceptual Database Design An Entity-Relationship
Approach" ,
publisher=    "Benjamin-Cummings" ,
address    =    "Redwood City CA" ,
year    =    1992 ,
annote    =    "A discussion of DBMS design issues. Extensive use
of EER, and conatians mappings from EER to and from Network,
heirarchical and Relational Models." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( BATORY81,
key    =    "Batory" ,
author    =    "Batory, D." ,
title    =    "B+ Trees and Indexed Sequential Files: A
Performance Comparison" ,
booktitle=    "sigmod" ,
volume    =    "11" ,
month    =    "may" ,
year    =    "1981" ,
pages    =    "30--39" ,
bibdate    =    "Fri Apr 26 23:50:09 1985" ,
)

@article    ( BATORY82A,
key    =    "Batory \& Gotlieb" ,
author    =    "Batory, D. and Gotlieb, C." ,
title    =    "A Unifying Model of Physical Databases" ,
journal    =    "tods" ,
volume    =    "7" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1982" ,
pages    =    "509--539" ,
bibdate    =    "Fri Apr 26 23:13:15 1985" ,
)

@article    ( BATORY82B,
key    =    "Batory" ,
author    =    "Batory, D." ,
title    =    "Optimal File Designs and Reorganization Points" ,
journal    =    "tods" ,
volume    =    "7" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1982" ,
pages    =    "60--81" ,
bibdate    =    "Sat Apr 27 22:50:43 1985" ,
)

@article    ( BATORY85A,
key    =    "Batory \& Kim" ,
author    =    "Batory, D.S. and Kim, W." ,
title    =    "Modeling Concepts for VLSI CAD Objects" ,
journal    =    "Proceedings of ACM-SIGMOD 1985 International
Conference on Management of Data" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "446" ,
bibdate    =    "Wed Jun 12 15:34:48 1985" ,
)

@inbook        ( BATORY85B,
key    =    "Batory" ,
author    =    "Batory, D." ,
title    =    "Progress Toward Automating The Development of
Database System Software" ,
booktitle=    "Query Processing Database Systems" ,
publisher=    "Springer-Verlag" ,
year    =    "1985" ,
pages    =    "261--278" ,
bibdate    =    "Wed Nov  6 22:28:19 1985" ,
)

@article    ( BATORY85C,
key    =    "Batory" ,
author    =    "Batory, D.S." ,
title    =    "Modeling the Storage Architectures of Commercial
Database Systems" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "10" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1985" ,
pages    =    "463--528" ,
keywords=    "Design documentation" ,
abstract=    "Modeling the storage structures of a DBMS is a
prerequisite to understanding and optimizing database performance.
Previously, such modeling was very difficult because the fundamental
role of conceptual-to-internal mappings in DBMS implementations went
unrecognized. In this paper we present a model of physical databases,
called the transformation model, that makes conceptual-to-internal
mappings explicit. By exposing such mappings, we show that it is
possible to model the storage architecture (i.e., the storage
structures and mappings) of many commercial DBMSs in a precise,
systematic, and comprehendible way. Models of the INQUIRE, ADABAS, and
SYSTEM 2000 storage architectures are presented as examples of the
model's utility. We believe the transformation model helps bridge the
gap between physical database theory and practice. It also reveals the
possibility of a technology to automate the development of physical
database software." ,
bibdate    =    "Mon Feb  2 11:02:30 1987" ,
owner    =    "manning" ,
)

@techreport    ( BATORY86,
key    =    "Batory \& Leung" ,
author    =    "Batory, D.S. and Leung, T.Y." ,
title    =    "Implementation Concepts for an Extensible Data
Model and Data Language" ,
number    =    "86-24" ,
institution=    "Department of Computer Sciences" ,
address    =    "University of Texas, Austin, TX" ,
year    =    "1986" ,
month    =    "oct" ,
pages    =    "1--34" ,
abstract=    "Future database systems must feature extensible
data models and data languages in order to accommodate the novel data
types and special- purpose operators that are required by
nontraditional database applications. In this paper, we outline a
functional data model and data language that are targeted as the
semantic end-user interface of GENESIS, an extensible DBMS. The model
and language are generalizations of FQL and DAPLEX, and fit ideally
with the modularity required by extensible database technology. We
explore different implementations of functional operators through
experimental and analytic means, and provides evidence that the
efficiency of processing queries using functional methods have the
potential to equal nonfunctional methods currently used in today's
DBMSs. We also explain the advantages of a functional front-end to
non-1NF databases, and show how our language and implementation are
being used process queries on both 1NF and non-1NF relations." ,
bibdate    =    "Thu Sep  3 10:20:26 1987" ,
owner    =    "manning" ,
)

@article    ( BATORY86A,
key    =    "Batory" ,
author    =    "Batory, D.S." ,
title    =    "Extensible Cost Models and Query Optimization in
GENESIS" ,
journal    =    "Database Engineering" ,
publisher=    "ieee" ,
volume    =    "9" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1986" ,
pages    =    "30--36" ,
abstract=    "The GENESIS extensible DBMS is founded on the
premise that customized DBMSs can be synthesized from primitive and
prewritten modules. In this article, we explain how cost models used
in query optimization can be synthesized from primitive cost
functions." ,
bibdate    =    "Mon Jun  6 16:42:04 1988" ,
owner    =    "manning" ,
)

@inproceedings    ( BATORY86C,
key    =    "Batory \& Mannino" ,
author    =    "Batory, D.S. and Mannino, M." ,
title    =    "Panel on Extensible Database Systems" ,
booktitle=    "sigmod" ,
organization=    "ACM" ,
publisher=    "ACM" ,
address    =    "Washington, D.C." ,
editor    =    "Zaniolo, C." ,
month    =    "May" ,
year    =    "1986" ,
pages    =    "187--190" ,
bibdate    =    "Fri Oct 28 16:48:35 1988" ,
owner    =    "" ,
)

@article    ( BATORY87,
key    =    "Batory" ,
author    =    "Batory, D.S." ,
title    =    "Principles of Database Management System
Extensibility" ,
journal    =    "Database Engineering" ,
publisher=    "IEEE" ,
volume    =    "10" ,
number    =    "2" ,
year    =    "1987" ,
pages    =    "100--106" ,
bibdate    =    "Sun Oct 30 14:03:47 1988" ,
owner    =    "" ,
)

@techreport    ( BATORY88,
key    =    "Batory et al." ,
author    =    "Batory, D. S. and J. R. Barnett and J. Roy and B.
C. Twichell and J. Garza" ,
title    =    "Construction of File Management Systems from
Software Components" ,
number    =    "TR-88-36" ,
institution=    "The University of Texas at Austin" ,
year    =    "1988" ,
pages    =    "7" ,
keywords=    "domain analysis, software building blocks,
software reusability, database systems." ,
abstract=    "Domain analysis is a classical approach in
software engineering to the identification of reusable software
modules. It relies on indepth studies of existing systems, published
algorithms and structures to deceern genericarchitectures for large
classes of systems. An architecture is a template in which
building-block modules can be plugged. Interfaces are standardized to
make blocks interchangeable. In this paper, we explain how domain
analysis has lead us to a building-blocks technology for file
management systems (FMSs) and we describe our most recent prototype,
an FMS synthesizer. the synthesizer enabales a customized FMS to be
assembled from preweitten components in minutes at virtually no cost.
Producing a comparable FMS from scratch would required man-years of
effort and hundreds of thousands of dollars." ,
bibdate    =    "Thu Nov 21 15:06:15 1991" ,
owner    =    "suchen" ,
)

@article    ( BATORY88A,
key    =    "Batory et al." ,
author    =    "Batory, D.S. and Leung, T.Y. and Wise, T.E." ,
title    =    "Implementation Concepts for an Extensible Data
Model and Data Language" ,
journal    =    "tods" ,
publisher=    "ACM" ,
volume    =    "13" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1988" ,
pages    =    "231--262" ,
keywords=    "coroutines; functional data model; query
processing; data models; data manipulation languages; lazy evaluation" ,
bibdate    =    "Mon Oct 31 11:15:15 1988" ,
owner    =    "" ,
)

@article    ( BATORY88B,
key    =    "Batory et al." ,
author    =    "Batory, D. and Barnett, J. and Garza, J. and
Smith, K. and Tsukuda, K. and Twichell, B. and Wise, T." ,
title    =    "GENESIS: An Extensible Database Management System" ,
journal    =    "tse" ,
volume    =    "14" ,
number    =    "11" ,
month    =    "nov" ,
year    =    "1988" ,
pages    =    "1711--1730" ,
keywords=    "Extensible DBMS, software building blocks,
software reusability, transformation model, unifying model" ,
abstract=    "We present a novel yet simple technology which
enables customized database management systems to be developed
rapidly. Over the last few years, a theory of database implementation
was developed to explain the storage architectures of many commercial
DBMSs (i.e., how these systems store and retrieve data). The theory
identified basic components of DBMS software, required all components
to have the same interface, and showed that component composition can
be achieved in a simple manner. We are designing an extensible DBMS,
called Genesis, which is based on this theory. This paper gives a
detailed description of our first operational prototype. DBMS software
components in GENESIS can be written in a few months. When all
components for a target DBMS are present, writing the architecture
specification of the DBMS and reconfiguring GENESIS takes a few hours
and can be accomplished with negligible cost. Building the same DBMS
from scratch can take many man-years and cost hundreds of thousands of
dollars. We believe that the extensible software technology proposed
herein embodies an important advance in tailoring database management
systems to specialized applications. We also outline a way that our
technology might impact software development beyond the confines of a
DBMS setting." ,
bibdate    =    "Sun Nov 17 20:03:37 1991" ,
owner    =    "soo" ,
)

@techreport    ( BATORY88C,
key    =    "Batory" ,
author    =    "Batory, D." ,
title    =    "Concepts for a Database System Compiler" ,
type    =    "TR" ,
number    =    "88-01" ,
institution=    "Department of Computer Science, The University of
Texas at Austin" ,
year    =    "1988" ,
month    =    "jan" ,
abstract=    "We propose a very simple formalism based on
parametrized types and a rule-based algebra to explain the storage
structures and algorithms of database management systems.
Implementations of DBMSs are expressed as equations. If all functions
referenced in the equations have been implemented, the software for a
DBMS can be synthesized in minutes at little cost, in contrast to
current methods where man-years of effort and hundreds of thousands of
dollars are required. Our research aims to develop a DBMS counterpart
to today's compiler-compiler technologies." ,
bibdate    =    "Wed Nov 20 17:24:49 1991" ,
owner    =    "soo" ,
)

@article    ( BATORY89,
key    =    "Batory" ,
author    =    "Batory, D. S." ,
title    =    "On the Reusability of Query Optimization
Algorithms" ,
journal    =    "Information Sciences" ,
year    =    "1989" ,
pages    =    "177--202" ,
abstract=    "We tackle the problem of software reusability as
it pertains to an important class of nonrecursive query optimization
algorithms. We demonstrate reusability can be achieved by (1) imposing
standardized interfaces and (2) expressing algorithms in a
DBMS-implementation-independent manner. The former is accomplished by
generalizing the notion of query graphs, and the latter is
accomplished by standardizing algorithm definitions in terms of
query-graph rewrite rules. Demonstrating algorithm reusability is an
essential step toward a building-block technology for extensible
database systems." ,
bibdate    =    "Thu Jan 11 10:17:48 1990" ,
owner    =    "robyn" ,
)

@techreport    ( BATORY90,
key    =    "Batory" ,
author    =    "Batory, D." ,
title    =    "The Genesis Database System Compiler: Unix User
Manual" ,
type    =    "TR" ,
number    =    "90-38" ,
institution=    "Department of Computer Science, The University of
Texas at Austin" ,
year    =    "1990" ,
month    =    "dec" ,
bibdate    =    "Wed Nov 20 17:25:49 1991" ,
owner    =    "soo" ,
)

@techreport    ( BATORY92A,
key    =    "Batory \& Vasavada" ,
author    =    "Batory, D. and Vasavada, D." ,
title    =    "Software Components for Object-Oriented Database
Systems" ,
number    =    "TR-92-27" ,
institution=    "Department of Computer Sciences, University of
Texas at Austin" ,
address    =    "Austin, TX" ,
year    =    "1992" ,
month    =    "may" ,
pages    =    "27" ,
keywords=    "inheritance; large scale reuse; Gen Voca; Genesis;
relational database systems; object-oriented database systems" ,
abstract=    "Genesis is a software system generator for
database management systems that relies exclusively on as-is large
scale component reuse. We briefly review the general model of software
components on which Genesis is based and also discuss some component
libraries for relational database systems in terms of this model. We
then explain how we have evolved Genesis and its libraries to be able
to synthesize object-oriented databse systems. We study a subproblem
of creating ``self-tuning'' software systems by examining the
performance of selected components for object-oriented database
systems." ,
bibdate    =    "Wed Jul 14 21:01:43 1993" ,
owner    =    "daisyc" ,
)

@article    ( BATRA,
key    =    "Batra et al." ,
author    =    "Batra, D. and Hoffer, J. and Bostrom, R." ,
title    =    "Comparing Representations with Relational and {\it
EER} Models" ,
journal    =    "cacm" ,
volume    =    33 ,
pages    =    "126--139" ,
month    =    "feb" ,
year    =    1990 ,
annote    =    "The study involved several semantic abstractions
for DBMS design. The result is a discussion of the ease of use, and
accuracy of the abstractions for the design and specification of a
relational DBMS. The results of a study on the ease of use of these
two approaches by users of various levels of expertise is included.
Each model won some of the comparisons, and lost others." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( BAYER72,
key    =    "Bayer \& McCreight" ,
author    =    "Bayer, R. and McCreight, E." ,
title    =    "Organization and Maintenance of Large Ordered
Indexes" ,
journal    =    "Acta Informatica" ,
volume    =    "1" ,
number    =    "3" ,
year    =    "1972" ,
pages    =    "173--189" ,
bibdate    =    "Tue Jun 17 22:32:13 1986" ,
owner    =    "ahn" ,
)

@article    ( BAYER77,
key    =    "Bayer \& Unterauer" ,
author    =    "Bayer, R. and Unterauer, K." ,
title    =    "Prefix B-Trees" ,
journal    =    "tods" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1977" ,
pages    =    "11--26" ,
bibdate    =    "Sat Apr 27 22:56:32 1985" ,
)

@inproceedings    ( BECKLEY85,
key    =    "Beckley et al." ,
author    =    "Beckley, D.A. and Evans, M.W. and Raman, V.K." ,
title    =    "Multikey Retrieval From K-d Trees and Quad-Trees" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "291--301" ,
abstract=    "Associative file structures are potentially
valuable for many database and artificial intelligence applications,
but very little information is available to database designers trying
to choose an appropriate file structure for a particular problem. This
paper describes an experiment comparing the retrieval performance of
K-d trees, quad-trees, and flat files, as measured by CPU time, wall
clock time, and I/O operations. Five types of queries are used: exact
match, partial match, range search, nearest neighbor, and best match.
The database used in this study is a static medical database of half a
million characters with the patient information removed. Results
suggest that there is no one best type of file structure for all types
of associative queries; quad trees dominated with some query classes,
K-d trees with others." ,
bibdate    =    "Tue Jun 11 13:53:22 1985" ,
)

@inproceedings    ( BEERI88,
key    =    "Beeri" ,
author    =    "Beeri, C." ,
title    =    "Data Models and languages for Databases" ,
booktitle=    "ICDT 88 Second International Conference on
Database Theory" ,
pages    =    "20--40" ,
address    =    "New York" ,
month    =    "sep" ,
year    =    1988 ,
annote    =    "A good review of existing systems, especially the
relational, and its extensions. Complex objects and a Calculus of
Complex Objects is presented. Then the Object model is introduced,
with the concepts of an an abstract query and update mechanism." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( BELCASTRO88,
key    =    "Belcastro et al." ,
author    =    "Belcastro, V. and Dutkowski, A. and Kaminski, W.
and Kowalewski, M. and Mallamaci, C. and Mezyk, S. and Mostardi, T.
and Scrocco, F. and Staniszkis, W. and Turco, G." ,
title    =    "An Overview of the Distributed Query System {\it
DQS}" ,
booktitle=    "Advances in Database Technology EDBT 88" ,
pages    =    "170--189" ,
publisher=    "Springer Verlag" ,
address    =    "New York " ,
month    =    "mar" ,
year    =    1988 ,
annote    =    "A Distributed Heterogeneous system is described.
It relies on the translation of generic SQL queries to the equivalent
local queries, Each node has a global query processor, and Schemas for
several local DBMS. Both local and global access to each DBMS is
maintained." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@techreport    ( BELZ91,
key    =    "Belz \& Luckham" ,
author    =    "Belz, Frank C. and David C. Luckham" ,
title    =    "A New Approach to Prototyping Distributed, Time
Sensitive Systems" ,
institution=    "Stanford University" ,
year    =    "1991" ,
pages    =    "17" ,
abstract=    <Currently, prototyping is not a single technique,
but rather a collection of widely diverse activities, with highly
fragmented support technology. TRW and Standford have recently
collaborated to develop an approach for reducing this fragmentation in
the future. This approach focusses on supporting the development of
large distributed systems in a variety of modern implementation
languages, including Ada, and C++. It is based upon the design of a
prototyping language and system which we are tentatively calling
Reality. The Reality language is a departure from "normal" programming
languages, but bears similarityies in form and concepts to standard
languages, Ada and VHDL. In fact, it can be viewed as both : an
executable design language for distributed systems and a Module
Interconnection Language for preexisting components written in other
languages. The Reality language and system are being designed to
support multiple prototyping strategies including (i) evolutionary
development based on stepwise refinement from abstract models to
detailed realistic products, (ii) botom-up approaches based on using
preexisting components in prototypes of full systems, and (iii)
various hybrid approaches.> ,
bibdate    =    "Mon Nov 25 11:24:00 1991" ,
owner    =    "suchen" ,
)

@inproceedings    ( BENCZUR87,
key    =    "Benczur" ,
author    =    "Benczur, A." ,
title    =    "Information Measurement in Relational Databases" ,
booktitle=    "MFDBS 87 First Symposium on Mathematical
Fundamentals of Database Systems" ,
pages    =    "1--9" ,
publisher=    "Springer-Verlag" ,
address    =    "New York" ,
year    =    1987 ,
annote    =    "The paper presents two mathematical methods for
determining an approximate informational content number for a
relational schema. One approach involves combinatorics the other an
algorithm. The variables used are the number of domains number of
tables, average number of columns per table etc." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( BENTLEY75,
key    =    "Bentley" ,
author    =    "Bentley, J." ,
title    =    "Multidimensional Binary Search Trees Used for
Associative Searching" ,
journal    =    "cacm" ,
volume    =    "18" ,
number    =    "9" ,
month    =    "sep" ,
year    =    "1975" ,
pages    =    "509--517" ,
bibdate    =    "Wed Jun  5 22:18:25 1985" ,
)

@techreport    ( BENZAKEN90,
key    =    "Benzaken" ,
author    =    "Benzaken, V." ,
title    =    "An Evaluation Model for Clustering Strategies in
the 02 Object-Oriented Database System" ,
institution=    "Altair" ,
number    =    "49--90" ,
year    =    "1990" ,
month    =    "aug" ,
pages    =    "16" ,
abstract=    "This paper addresses the problem of clustering
complex data on disk to minimize the number of I/0 in data intensive
applications. It describes the clustering strategies adopted in the 02
system. As clustering depends on both structural aspects (compositions
hierarchy of the classes) and dynamic aspects (the methods associated
with the classes) the paper details a cost model in order to evaluate
the benefits of the clustering strategies. The model will permit to
automatically derive new clustering strategies. To this end, a
derivation algorithm which builds an optimal strategy in linear time
is presented." ,
bibdate    =    "Mon Oct  8 15:29:37 1990" ,
owner    =    "soo" ,
)

@inproceedings    ( BERNSTEIN80B,
key    =    "Bernstein \& Goodman" ,
author    =    "Bernstein, P. and Goodman, N." ,
title    =    "Timestamp-Based Algorithms for Concurrency Control
in Distributed Database Systems" ,
booktitle=    "vldb" ,
month    =    "oct" ,
year    =    "1980" ,
bibdate    =    "Sat Apr 26 11:23:59 1986" ,
owner    =    "ahn" ,
)

@article    ( BERNSTEIN81,
key    =    "Bernstein \& Goodman" ,
author    =    "Bernstein, P.A. and Goodman, N." ,
title    =    "Concurrency Control in Distributed Database
Systems" ,
journal    =    "comsurv" ,
publisher=    "acm" ,
volume    =    "13" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1981" ,
pages    =    "185--221" ,
keywords=    "Concurrency control; deadlock; distributed
database management systems; locking; serializability;
synchronization; timestamp ordering; timestamps; two-phase commit;
two-phase locking" ,
abstract=    "In this paper we survey, consolidate, and present
the state of the art in distributed database concurrency control. The
heart of our analysis is a decomposition of the concurrency control
problem into two major subproblems: read-write and write-write
synchronization. We describe a series of synchronization techniques
for solving each subproblem and show how to combine these techniques
into algorithms for solving the entire concurrency control problem.
Such algorithms are called ``concurrency control methods''. We
describe 48 principal methods, including all practical algorithms that
have appeared in the literature plus several new ones. We concentrate
on the structure and correctness of concurrency control algorithms.
Issues of performance are given only secondary treatment." ,
bibdate    =    "Thu Jan 15 13:39:55 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( BERNSTEIN83,
key    =    "Bernstein" ,
author    =    "Bernstein, Philip A." ,
title    =    "Database Theory" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "acm" ,
address    =    "PO Box 64145, Baltimore, MD 21264" ,
editor    =    "DeWitt, David J., Gardarin, Georges" ,
month    =    "may" ,
year    =    "1983" ,
pages    =    "2" ,
bibdate    =    "Tue Nov 20 14:46:55 1984" ,
)

@techreport    ( BERNSTEIN86A,
key    =    "Bernstein" ,
author    =    "Bernstein, P." ,
title    =    "Transaction Processing in Centralized DBMS's" ,
institution=    "Wang Institute of Graduate Studies" ,
address    =    "Tyngsboro, MA" ,
year    =    "1986" ,
bibdate    =    "Wed Aug  1 13:10:50 1990" ,
owner    =    "robyn" ,
)

@book        ( BERNSTEIN87,
key    =    "Bernstein et al." ,
author    =    "Bernstein, P.A. and Hadzilacos, V. and Goodman, N." ,
title    =    "Concurrency Control and Recovery in Database
Systems" ,
publisher=    "Addison-Wesley" ,
year    =    "1987" ,
series    =    "Addison-Wesley Series in Computer Science" ,
isbn    =    "0-201-10715-5" ,
bibdate    =    "Fri Jan 23 11:19:56 1987" ,
owner    =    "mckenzie" ,
)

@article    ( BERNSTEIN90A,
key    =    "Bernstein" ,
author    =    "Bernstein, P. A." ,
title    =    "Transaction Processing Monitors" ,
journal    =    "cacm" ,
publisher=    "Acm Press" ,
volume    =    "33" ,
number    =    "11" ,
month    =    "nov" ,
year    =    "1990" ,
pages    =    "75--86" ,
bibdate    =    "Sat Apr 10 13:43:40 1993" ,
owner    =    "bassili" ,
)

@article    ( BERRA87,
key    =    "Berra \& Troullinos" ,
author    =    "Berra, P.B. and Troullinos, N.B." ,
title    =    "Optical Techniques and Data/Knowledge Base
Machines" ,
journal    =    "Computer" ,
publisher=    "ieee" ,
volume    =    "20" ,
number    =    "10" ,
month    =    "oct" ,
year    =    "1987" ,
pages    =    "59--70" ,
bibdate    =    "Mon Oct 12 16:35:15 1987" ,
owner    =    "manning" ,
)

@article    ( BERSON95,
key    =    "Berson et al." ,
author    =    "Berson, S. and Ghandeharizadeh, S. and Muntz, R.
and Ju, X." ,
title    =    "Staggered Striping: A Flexible Technique to
Display Continuous Media" ,
journal    =    "Kluwer Journal of Multimedia Tools and
Applications" ,
month    =    "mar" ,
year    =    "1995" ,
pages    =    "30" ,
bibdate    =    "Wed Jan 10 15:25:11 1996" ,
abstract=    "During the past decade, information technology has
evolved to where it is economically viable to store and retrieve
continuous media data types, e.g., audio and video objects. Systems
that support this data type are expected to play a major role in many
applications including library information systems, entertainment
technology, and educational applications. The objects of this new data
type should be retrieved at a pre-specified bandwidth. If an object is
retrieved at a rate lower than its pre-specified bandwidth then its
display will suffer from frequent disruptions and delays termed
hiccups. This paper describes staggered striping as a novel technique
to support a hiccup-free retrieval of continuous media data types. Its
design is based on a multidisk architecture. It is a flexible
technique that can support media types whose bandwidth requirements
are either lower or higher than the bandwidth of a single disk. Its
design allows a system to scale to thousands of disk drives as its
incurred overhead is fixed and does not increase as a function of
additional disk drives." ,
owner    =    "jeff" ,
)

@article    ( BERTINO86,
key    =    "Bertino \& Rabitti" ,
author    =    "Bertino, E. and Rabitti, F." ,
title    =    "Query Processing Based on Complex Object Types" ,
journal    =    "Data Engineering" ,
volume    =    "9" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1986" ,
pages    =    "22--29" ,
abstract=    "In application areas where the data management
system has to deal with a large number of complex data objects with a
wide variety of types, the system must be able to process queries
containing both conditions on the schema of the data objects and on
the values of the data objects. In this paper we will focus on a
particular phase in query processing on a data base of complex objects
called Type-Level Query Processing. In this phase, the query is
analyzed, completed, and transformed on the basis of the definitions
of the complex object types. We will present, in particular, the
techniques used in the ESPRIT project MULTOS. In this project, a data
server has been implemented in which data objects are constituted by
multimedia documents with complex internal structures." ,
bibdate    =    "Wed Oct 25 08:06:25 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( BERTINO88,
key    =    "Bertino et al." ,
author    =    "Bertino, E. and Gagliardi, R. and Negri, M. and
Pelagatti, G. and Sbattella, L." ,
title    =    "The {\it COMANDOS\/} Integration System: an Object
Oriented Approach to the Interconnection of Heterogeneous Applications" ,
booktitle=    "Advances in Object Oriented Database Systems 2nd
International Workshop on Object Oriented Database Systems" ,
pages    =    "213--218" ,
publisher=    "Springer-Verlag" ,
address    =    "New York" ,
month    =    "sep" ,
year    =    1988 ,
annote    =    "A proposed, and partially implemented integration
system is presented. A good generic spanning model has been defined.
The system even takes into account the integration of databases that
have no query language. The objects created to model the existing
structures are divided into three categories, single valued variant
component, variant multi valued component, multi valued variant
component. On these data types both generic queries and user defined
functions should be allowed. The system is designed to be part of the
CIS project." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( BERTINO89,
key    =    "Bertino \& Kim" ,
author    =    "Bertino, E. and Won, K." ,
title    =    "Indexing Techniques for Queries on Nested Objects" ,
journal    =    "tse" ,
volume    =    "1" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1989" ,
pages    =    "196--214" ,
keywords=    "access methods; complex objects; database
performance and measurement; index selection; nested relations;
object-oriented databases; query optimization." ,
abstract=    "In relational databases, an attribute of a
relation may only have a single primitive value, making it cumbersome
to model complex artifacts of interest to a wide variety of
applications. An object-oriented and nested relational model of data
removes this difficulty by introducing the notion of nested objects,
that is, by allowing the value of an object to be another object or a
set of other objects. This means that a class (relation) consists of a
set of attributes, and the values of the attributes are objects that
belong to other classes (relations); that is, the definition of a
class (relation) forms a hierarchy of classes (relations). All
attributes of the nested classes are nested attributes of the root
hierarchy. Just as a secondary index on an attribute or a combination
of attributes is useful for expediting the evaluation of a query on a
relation, a secondary index is useful for evaluating queries on a
nested class in an object-oriented database or a nested relation in a
nested relational database. In this paper, we introduce three index
organizations for use in the evaluation of a query in an
object-oriented or nested relational database. We develop detailed
models of the three indexes. Using the models, we evaluate the storage
cost, retrieval cost, and update cost of these indexes, and make a
number of observations about the use of these indexes for evaluating
queries for object-oriented or nested relational databases." ,
bibdate    =    "Fri Oct 20 10:30:58 1989" ,
owner    =    "robyn" ,
)

@article    ( BERTINO91,
key    =    "Bertino \& Martino" ,
author    =    "Bertino, E. and Martino, L." ,
title    =    "Object-Oriented Database Management Systems:
Concepts and issues" ,
journal    =    "IEEE Computer" ,
publisher=    "ieee" ,
volume    =    "24" ,
number    =    "4" ,
month    =    "apr" ,
year    =    "1991" ,
pages    =    "33--47" ,
bibdate    =    "Sat Apr 10 13:46:58 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( BERTINO92A,
key    =    "Bertino" ,
author    =    "Bertino, E." ,
title    =    "A View Mechanism for Object-Oriented Databases" ,
booktitle=    "Proceeedings of the International Conference on
Extending Database Technology" ,
address    =    "Vienna, Austria" ,
month    =    "mar" ,
year    =    "1992" ,
bibdate    =    "Fri Jan  7 14:42:16 1994" ,
owner    =    "rts" ,
)

@book        ( BERTINO93,
key    =    "Bertino \& Martino" ,
author    =    "Bertino, E. and Martino, L." ,
title    =    "Object-Oriented Database Systems" ,
publisher=    "Addison-Wesley" ,
year    =    "1993" ,
series    =    "International Computer Science Series" ,
isbn    =    "0-201-62439-7" ,
bibdate    =    "Fri Jan  7 14:48:37 1994" ,
owner    =    "rts" ,
)

@article    ( BERTINO95A,
key    =    "Bertino \& Foscoli" ,
author    =    "Bertino, E. and Foscoli, P." ,
title    =    "Index Organizations for Object-Oriented Database
Systems" ,
journal    =    "tkde" ,
publisher=    "ieee" ,
volume    =    "7" ,
number    =    "2" ,
month    =    "apr" ,
year    =    "1995" ,
pages    =    "193--209" ,
bibdate    =    "Wed Jan 10 16:26:26 1996" ,
abstract=    "In this paper we present an indexing technique
providing support for queries involving complex, nested objects and
inheritance hierarchies. This technique is compared with two
techniques obtained from more traditional organizations. The three
techniques are evaluated using an analytical cost model. The
discussion will be cast in the framework of object-oriented databases.
However, results are applicable to data management systems
characterized by features such as complex objects and inheritance
hierarchies." ,
owner    =    "jeff" ,
)

@article    ( BEVER85,
key    =    "Bever \& Lockemann" ,
author    =    "Bever, M. and Lockemann, P.C." ,
title    =    "Database Hosting in Strongly-Typed Programming
Languages" ,
journal    =    "tods" ,
volume    =    "10" ,
number    =    "1" ,
month    =    "1985" ,
year    =    "1985" ,
pages    =    "107--126" ,
keywords=    "design; languages; parameterized data types;
database schema; strong typing; schema mapping" ,
abstract=    "Database system support has become an essential
part of many computer application, which have extended beyond the more
traditional commercial applications to, among others, engineering
applications. Correspondingly, application programming with the need
to access databases has progressively shifted to scientifically
oriented languages. Modern developments in these languages are
characterized by advanced mechanisms for the liberal declaration of
data types, for type checking, and facilities for modularization of
large programs. The present paper examines how a DBMS can be accessed
from such a language in a way that conforms to its syntax and utilizes
its type-checking facilities, without modifying the language
specification itself, and hence its compilers. The basic idea is to
rely on facilities for defining modules as separately compilable
units, and to use these to declare user-defined abstract data types.
The idea is demonstrated by an experiment in which a specific DBMS
(ADABAS) is hosted in the programming language (LIS). The paper
outlines a number of approaches and their problems, shows how to embed
the DML into LIS and how a more user-oriented DML can be provided in
LIS." ,
bibdate    =    "Fri May 10 14:29:35 1985" ,
)

@inproceedings    ( BHARGAVA85,
key    =    "Bhargava" ,
author    =    "Bhargava, B." ,
title    =    "Panel Discussion: Reliability in Distributed
Database Systems" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "420--422" ,
bibdate    =    "Wed Jun 12 15:22:35 1985" ,
)

@techreport    ( BHAT87,
key    =    "Bhat" ,
author    =    "Bhat, V." ,
title    =    "Design of CADM Based Sort/Search/Set Engine" ,
number    =    "TR-87-36" ,
institution=    "Department of Computer Sciences" ,
address    =    "University of Texas, Austin, TX" ,
year    =    "1987" ,
month    =    "sep" ,
pages    =    "1--164" ,
abstract=    "Managing large databases involves time consuming
and computationally intensive operations such as sorting, searching,
and various relational algebraic operations. These are traditionally
performed on general purpose computers. Special hardware can be used
to achieve higher speed in implementing these operations. The design
of one such system for performing sort, search and set operations such
as union, intersection, and set difference, is described. The
performance of this system is compared with the performance of general
purpose computers for performing the above operations, and it is how
that our system performs considerably better. Implementation of a
prototype is decribed." ,
bibdate    =    "Thu May 19 15:58:47 1988" ,
owner    =    "manning" ,
)

@inproceedings    ( BIC89,
key    =    "Bic" ,
author    =    "Bic, Lubomir and Gilbert, Jonathan and
Rundensteiner Elke and Yin, Meng-Lai" ,
title    =    "Set-restricted Semantic Grouping" ,
booktitle=    "Submitted to the Proceedings of the ACM SIGMOD '89" ,
year    =    "1989" ,
pages    =    "1--26" ,
month    =    "" ,
)

@inproceedings    ( BISKUP87,
key    =    "Biskup \& Rasch" ,
author    =    "Biskup, J. and Rasch, U." ,
title    =    "The Equivalence Problem for Relational Databases
Schemes" ,
booktitle=    "MFDBS 87 First Symposium on Mathematical
Fundamentals of Database Systems" ,
pages    =    "42--70" ,
publisher=    "Springer-Verlag" ,
address    =    "New York" ,
year    =    1987 ,
annote    =    "A very through and abstract system for determining
syntactical equivalence between relational schemas is presented. A
very complete set of proofs is presented." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@techreport    ( BITTON83,
key    =    "Bitton et al." ,
author    =    "Bitton, D. and DeWitt, D.J. and Turbyfill, C." ,
title    =    "Benchmarking Database Systems: A Systematic
Approach" ,
type    =    "Computer Science Technical Report" ,
number    =    "526" ,
institution=    "Computer Sciences Department" ,
address    =    "University of Wisconsin, Madison, WI" ,
year    =    "1983" ,
month    =    "dec" ,
pages    =    "1--41" ,
abstract=    "This paper describes a customized database and a
comprehensive set of queries that can be used for systematic
benchmarking of relational database systems. Designing this database
and a set of carefully tuned benchmarks represents a first attempt in
developing a scientific methodology for performance evaluation of
database management systems. We have used this database to perform a
comparative evaluation of the database machine DIRECT, the university
and commercial versions of the INGRES database system, the relational
database system ORACLE, and the IDM 500 database machine. We present a
subset of our measurements-for the single user case only-that
constitute a preliminary performance evalution of these systems." ,
bibdate    =    "Tue Apr 11 09:44:21 1989" ,
owner    =    "payne" ,
)

@article    ( BITTON83A,
key    =    "Bitton et al" ,
author    =    "Bitton, D. and Boral, H. and DeWitt, D. and
Wilkinson, W.K." ,
title    =    "Parallel Algorithms for the Execution of
Relational Database Operations" ,
journal    =    "tods" ,
volume    =    "8" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1983" ,
pages    =    "324--353" ,
keywords=    "Algorithms; Performance; Sorting, projection
operator, join operation, aggregate operations, database machines,
parallel processing" ,
abstract=    "This paper presents and analyzes algorithms for
parallel processing of relational database operations in a general
multiprocessor framework. To analyze alternative algorithms, we
introduce an analysis methodology which incorporates I/o, CPU, and
message costs and which can be adjusted to fit different
multiprocessor architectures. Algorithms are presented and analyzed
previously, we have generalized each in order to handle the case where
the number of pages is significantly larger than the number of
processors. In addition, we present and analyze algorithms for the
parallel execution of update and aggregate operations." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( BLAHA88,
key    =    "Blaha et al." ,
author    =    "Blaha, F. and Premerlani, W. and Rumbaugh, J." ,
title    =    "Relational Database Design Using an
Object-Oriented Methodology" ,
journal    =    "cacm" ,
volume    =    31 ,
pages    =    "414--427" ,
month    =    "apr" ,
year    =    1988 ,
annote    =    "Overview of using OO model to direct the design of
a relational schema." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( BLAIN85,
key    =    "Blain et al." ,
author    =    "Blain, Tomas and Dohler, Michael and Michaelis,
Ralph and Qureshi, Emran" ,
title    =    "Managing the Printed Circuit Board Design Process" ,
booktitle=    "Proceedings of the ACM SIGMOD '85" ,
year    =    "1985" ,
pages    =    "447--456" ,
month    =    "" ,
)

@inproceedings    ( BLAKELEY86A,
key    =    "Blakeley et al." ,
author    =    "Blakeley, J.A. and Coburn, N. and Larson, P.-A." ,
title    =    "Updating Derived Relations: Detecting Irrelevant
and Autonomously Computable Updates" ,
booktitle=    "vldb" ,
address    =    "Kyoto, Japan" ,
editor    =    "Kambayaski, Y." ,
month    =    "aug" ,
year    =    "1986" ,
pages    =    "457--466" ,
keywords=    "relational databases, database theory, view update" ,
abstract=    "Consider a database containing not only base
relations but also stored derived relations (also called materialized
or concrete views). When a base relation is updated, it may also be
necessary to update some of the derived relations. This paper gives
sufficient and necessary conditions for detecting when an update of a
base relation cannot affect a derived relation (an irrelevant update),
and for detecting when a derived relation can be correctly updated
using no data other than the derived relation itself and the given
update operation (an autonomously computable update). The class of
derived relations considered is restricted to those defined by
PSJ-expressions, that is, any relational algebra expression
constructed from an arbitrary number of project, select, and join
opeerations. The class of update operations consists of insertions,
deletions, and modifications, where the set of tuples to be deleted or
modified is specified by a PSJ-expression." ,
bibdate    =    "Wed Aug 19 22:22:28 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( BLAKELEY86B,
key    =    "Blakeley et al." ,
author    =    "Blakeley, J.A. and Larson, P.-A. and Tompa, F.W." ,
title    =    "Efficiently Updating Materialized Views" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
address    =    "Washington, DC" ,
editor    =    "Zaniolo, C." ,
month    =    "may" ,
year    =    "1986" ,
pages    =    "61--71" ,
abstract=    "Query processing can be sped up by keeping
frequently accessed users' views materialized. However, the need to
access base relations in response to queries can be avoided only if
the materialized view is adequately maintained. We propose a method in
which all database updates to base relations are first filtered to
remove from consideration those that cannot possibly affect the view.
The conditions given for the detection of updates of this type, called
irrelevant updates, are necessary and sufficient and are independent
of the database state. For the remaining database updates, a
differential algorithm can be applied to re-evaluate the view
expression. The algorithm proposed exploits the knowledge provided by
both the view definition expression and the database update
operations." ,
bibdate    =    "Mon Oct 19 16:44:30 1987" ,
owner    =    "mckenzie" ,
)

@article    ( BLAKELEY89,
key    =    "Blakeley et al" ,
author    =    "Blakeley, J. A. and Coburn, N. and Larson, P." ,
title    =    "Updating Derived Relations: Detecting Irrelevant
and Autonomously Computable Updates" ,
journal    =    "tods" ,
volume    =    "14" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1989" ,
pages    =    "369--400" ,
keywords=    "Algorithms; Theory; Conceptual relations; database
design; derived relations; materialized views; prejoined relations;
relational databases; stored relations" ,
abstract=    "Consider a database containing not only base
relations but also stored derived relations (also called materialized
or concrete views). When a base relation is updated, it may also be
necessary to update some of the derived relations. This paper gives
sufficient and necessary conditions for detecting when an update of a
base relation cannot affect a derived relation (an irrelevant update),
and for detecting when a derived relation can be correctly updated
using no data other than the derived relation itself and the given
update operation (an autonomously computable update). The class of
derived relations considered is restricted to those defined by
PSJ-expressions, that is, any relational algebra expressions
constructed from an arbitrary number of project, select and join
operations (but containing no self-joins). The class of update
operations consists of insertions, deletions, and modifications, where
the set of tuples to be deleted or modified is specified by a
selection condition on attributes of the relation being updated." ,
bibdate    =    "Tue Nov  7 14:27:23 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( BLAKELEY90,
key    =    "Blakeley \& Martin" ,
author    =    "Blakeley, Jose A. and Martin, Nancy L." ,
title    =    "Join Index, Materialized View, and Hybrid-Hash
Join: A Performance Analysis" ,
booktitle=    "Proceedings of the Sixth International Conference
on Data Engineering" ,
year    =    "1990" ,
pages    =    "256--263" ,
month    =    "February" ,
)

@techreport    ( BLAKELEY91,
key    =    "Blakeley" ,
author    =    "Blakeley, J.A." ,
title    =    "ZQL[C++]: Extending a Persistent C++ Language with
a Query Capability" ,
number    =    "ITB-91-10-01" ,
institution=    "Computer Science Laboratory, Texas Instruments
Inc." ,
address    =    "Dallas, TX" ,
year    =    "1991" ,
month    =    "oct" ,
pages    =    "32" ,
keywords=    "database programming language systems;
persistent-object management systems; object-oriented databases; query
and programming languages integration; query language embedding" ,
abstract=    "This paper reports the results of an experiment to
integrate an associative query language, called ZQL[C++], with a
persistent C++ language. Our approach consists of a combination of
three main ideas: (1) supporting parameterized collection types in
C++, (2) extending C++ with a query statement that adopts the popular
SELECT-FROM-WHERE structure of SQL, and (3) allowing C++ expressions
to be used in the formulation of queries. Queries in ZQL[C++] are
orthogonal to persistence which allows queries on transient as well as
on persistent data. ZQL[C++] supports parameterized collection types,
data abstraction, inheritance, and complex objects. It also supports
type checking across the interface between the database and the
programming language. In ZQL[C++], the notions of type and extent are
distinguished, thus allowing multiple sets of a type in an
application. ZQL[C++] permits user-defined functions in the
formulation of queries including collection-valued functions and
Boolean-valued functions. The above features of ZQL[C++] yield a
unique integration between C++ and a query language. We describe a
prototype implementation of ZQL[C++] as part of the Zeitgeist Object
Database Management project." ,
bibdate    =    "Tue Jan  4 13:37:07 1994" ,
owner    =    "rts" ,
)

@article    ( BLOOM70,
key    =    "Bloom" ,
author    =    "Bloom, B." ,
title    =    "Space/Time Trade-offs in Hash Coding with
Allowable Errors" ,
journal    =    "cacm" ,
volume    =    "13" ,
number    =    "7" ,
month    =    "jul" ,
year    =    "1970" ,
pages    =    "422--426" ,
bibdate    =    "Wed Jun  5 22:13:28 1985" ,
)

@techreport    ( BLOOM89,
key    =    "Bloom" ,
author    =    "Bloom, H." ,
title    =    "The Role of the {\it National Institute\/} of {\it
Standards\/} and {\it Technology\/} as it relates to Product Driven
Data Engineering" ,
number    =    "NBSIR 89-4078" ,
institution=    "NIST" ,
year    =    1989 ,
annote    =    "A review of past integrated engineering systems,
and a discussion of the NIST part of PDES, specifically the PDES
test-bed system." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@techreport    ( BOIES89,
key    =    "Boies et al." ,
author    =    "Boies, S. J. and Bennett, W. E. and Gould, J. D.
and Greene, S. L. and Wiecha, C." ,
title    =    "The Interactive Transaction System (ITS): Tools
for Application Development" ,
institution=    "ibm" ,
address    =    "Yorktown Heights, NY" ,
year    =    "1989" ,
month    =    "jun" ,
pages    =    "79" ,
abstract=    "This is an overview description of the ITS
project. ITS is a new, comprehensive approach to computer application
development. ITS provides software tools for user interface and
application development, and a run-time environment for application
execution. There are three key concepts. First, ITS separates the
style of an application from the content of an application.
Human-computer interface styles are general, rule-based, under
parameter control, and designed to handle a variety of applications.
Second, ITS envisions four general work roles in application design
and development: content experts, content programmers, style experts,
and style programmers. Third, ITS aims at creating software tools for
each role. In this overview paper we describe the ITS philosophy,
tools, architecture, and status." ,
bibdate    =    "Tue Feb 27 13:42:45 1990" ,
owner    =    "robyn" ,
)

@article    ( BOKSENBAUM87,
key    =    "Boksenbaum et al." ,
author    =    "Boksenbaum, C. and Cart and M. and Ferrie, J. and
Pons, J.-F." ,
title    =    "Concurrent Certifications by Intervals of
Timestamps in Distributed Database Systems" ,
journal    =    "tse" ,
publisher=    "ieee" ,
volume    =    "SE-13" ,
number    =    "4" ,
month    =    "apr" ,
year    =    "1987" ,
pages    =    "409--419" ,
keywords=    "Certification; concurrency control; dependency
graph; distributed databases; intervals of timestamps" ,
abstract=    "This paper introduces, as an optimistic
concurrency control method, a new certification method by means of
intervals of timestamps, usable in a distributed database system. The
main advantage of this method is that it allows a chronological commit
order which differs from the serialization one (thus avoiding
rejections or delays of transactions which occur in usual
certification methods or in classical locking or timestamping ones.)
The use of the dependency graph permits both classifying this method
among existing ones and proving it. The certification protocol is
first presented under the hypothesis that transactions' certifications
are processed in the same order on all the concerned sites; it is then
extended to allow concurrent certifications of transactions." ,
bibdate    =    "Mon Aug 24 13:08:46 1987" ,
owner    =    "manning" ,
)

@inbook        ( BONTEMPO83,
key    =    "Bontempo" ,
author    =    "Bontempo, C. J." ,
title    =    "Feature Analysis of Query-By-Example" ,
publisher=    "Springer-Verlag" ,
address    =    "New York" ,
year    =    "1983" ,
pages    =    "409--433" ,
booktitle=    "Relational Database Systems" ,
bibdate    =    "Thu Oct  6 22:45:41 1983" ,
)

@article    ( BORAL81,
key    =    "Boral \& DeWitt" ,
author    =    "Boral and H. DeWitt, D.J." ,
title    =    "Processor Allocation for Multiprocessor Database
Machines" ,
journal    =    "tods" ,
volume    =    "6" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1981" ,
pages    =    "227--254" ,
annote    =    "Extended version of Boral\&DeWitt82." ,
bibdate    =    "Wed Dec 29 19:52:53 1982" ,
)

@article    ( BORAL82,
key    =    "Boral \& DeWitt" ,
author    =    "Boral, H. and DeWitt, D.J." ,
title    =    "Applying Data Flow Techniques to Data Base
Machines" ,
journal    =    "Computermag" ,
month    =    "aug" ,
year    =    "1982" ,
pages    =    "57--63" ,
volume    =    "15" ,
number    =    "8" ,
annote    =    "A dataflow implementation of relational algebra,
at the granularity of pages, was simulated.. Controlling the processes
was quite expensive." ,
bibdate    =    "Wed Dec 29 19:51:10 1982" ,
)

@inproceedings    ( BORAL84,
key    =    "Boral \& DeWitt" ,
author    =    "Boral, H. and DeWitt, D.J." ,
title    =    "A Methodology for Database Performance Evaluation" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Yormark, B." ,
address    =    "Boston, MA" ,
month    =    "jun" ,
pages    =    "176--185" ,
year    =    "1984" ,
abstract=    "This paper presents a methodology for evaluating
the performance of database management systems and database machines
in a multiuser environment. Three main factors that affect transaction
throughput in a multiuser environment are identified: multiprogramming
level, degree of data sharing among simultaneously executing
transactions, and transaction mix. We demonstrate that only four basic
query types are needed to construct a benchmark that will evaluate the
performance of a system under a wide variety of workloads. Finally, we
present the results of applying our techniques to the Britton-Lee IDM
500 database machine." ,
bibdate    =    "Mon Oct  1 14:05:43 1984" ,
)

@article    ( BORAL90,
key    =    "Boral et al." ,
author    =    "Boral, Haran and William Alexander and Larry Clay
and George Copeland and Scott Danforth and Michael Franklin and Brian
Hart and Marc Smith and Patrick Valduriez" ,
title    =    "Prototyping Bubba, A highly Parallel Database
System" ,
journal    =    "tkde" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1990" ,
pages    =    "4-24" ,
keywords=    "Complex object management, database operating
system, database programming language, database system performance,
database system prototype, parallel database system" ,
abstract=    "Since 1984, the goal of the Bubba project at MCC
has been to design a scalable, high-performance and highly available
database system that will provide significant cost/performance
advantages over conventional mainframes in the 1990's. The design
process has been an iterative one, cyclig through design, modeling,
and prototyping in progressive detail. The current Bubba prototype
runs on a commercial 40-node multicomputer and includes a
parallelizing compiler, distributed transaction management, object
management, and a customized version of UNIX. This paper describes the
current prototype and discusses of the major design decisions that
went into its construction. The lessons leraned from this prototype
and its predecessors are presented." ,
bibdate    =    "Sun Aug  4 13:22:59 1991" ,
owner    =    "bib" ,
)

@article    ( BORGIDA85,
key    =    "Borgida" ,
author    =    "Borgida, Alexander" ,
title    =    "Language Features for Flexible Handling of
Exceptions in Information Systems" ,
journal    =    "ACM Transactions of Database Systems" ,
year    =    "1985" ,
volume    =    "10" ,
number    =    "4" ,
pages    =    "565--603" ,
month    =    "December" ,
)

@inproceedings    ( BORGIDA88,
key    =    "Borgida" ,
author    =    "Borgida, Alexander" ,
title    =    "Modelling Class Hierarchies with Contradictions" ,
booktitle=    "Proceedings of the ACM SIGMOD '88" ,
year    =    "1988" ,
pages    =    "434--443" ,
month    =    "" ,
)

@article    ( BOYCE75,
key    =    "Boyce et al." ,
author    =    "Boyce, R. F. and Chamberlin, D. D. and King, W. F.
and Hammer, M. M." ,
title    =    "Specifying Queries as Relational Expressions: The
Square Data Sublanguage" ,
journal    =    "Communications of the ACM" ,
year    =    "1975" ,
volume    =    "18" ,
number    =    "11" ,
pages    =    "621--628" ,
month    =    "November" ,
)

@article    ( BRACHMAN83,
key    =    "Brachman" ,
author    =    "Brachman, Ronald J." ,
title    =    "What IS-A Is and Isn't: An Analysis of Taxonomic
Links in Semantic Networks" ,
journal    =    "IEEE Computer Magazine" ,
year    =    "1983" ,
volume    =    "" ,
number    =    "" ,
pages    =    "30--36" ,
month    =    "October" ,
)

@inproceedings    ( BRADLEY78,
key    =    "Bradley" ,
author    =    "Bradley, J." ,
title    =    "Operations on Data Bases" ,
booktitle=    "vldb" ,
address    =    "West Berlin, Germany" ,
editor    =    "Yao, S.B." ,
month    =    "sep" ,
year    =    "1978" ,
pages    =    "164--176" ,
annote    =    "Distinguishes between object entity classes and
process entity classes. Presents a superschema or data supermodel
concept to cover time." ,
bibdate    =    "Wed Dec 29 16:29:01 1982" ,
)

@article    ( BRADLEY83,
key    =    "Bradley" ,
author    =    "Bradley, J" ,
title    =    "Application of SQL/N to The Attribute Relation
Associations Implicit in Functional Dependencies" ,
journal    =    "int. J. Compute Info. Sci. " ,
volume    =    "12" ,
number    =    "2" ,
month    =    "April" ,
year    =    "1983" ,
pages    =    "65 -- 86" ,
keywords=    "" ,
bibdate    =    "Fri Mar 22 10:54:02 1991" ,
owner    =    "suchen" ,
)

@inproceedings    ( BRANDING95,
key    =    "Branding \& Buchmann" ,
author    =    "Branding, H. and Buchmann, A." ,
title    =    "On Providing Soft and Hard Real-Time Capabilities
in an Active DBMS" ,
booktitle=    "International Workshop on Active and Real-Time
Database Systems" ,
organization=    "University of Skovde, Sweden" ,
address    =    "Sweden" ,
year    =    "1995" ,
month    =    "jun" ,
bibdate    =    "Thu Aug 10 16:11:58 1995" ,
owner    =    "jeff" ,
)

@inproceedings    ( BRATBERGSENGEN84,
key    =    "Bratbergsengen" ,
author    =    "Bratbergsengen, K." ,
title    =    "Hashing Methods and Relational Algebra Operations" ,
booktitle=    "vldb" ,
address    =    "Singapore" ,
month    =    "aug" ,
year    =    "1984" ,
pages    =    "323--333" ,
abstract=    "This paper presents algroithms for relational
algebra and set operations based on hashing. Execution times are
computed and performance is compared to standard methods based on
nested loop and sort-merge. The algorithms are intended for use on a
monoprocessor computer with standard disks for data base storage. It
is indicated however that hashing methods are well suited to
multiprocessor or especially multi machine database machines. The
relational algebra operations described in this paper are under
implementation in TECHRA, a database system especially designed to
meet the needs of technical applications, like CAD systems, utility
maps, oil field exploration, etc." ,
bibdate    =    "Sun Sep 11 20:54:33 1988" ,
owner    =    "" ,
)

@article    ( BREITBART90,
key    =    "Breitbart" ,
author    =    "Breitbart, Y." ,
title    =    "Multidatabase Interoperability" ,
journal    =    "sigmod" ,
volume    =    19 ,
pages    =    "53--60" ,
month    =    "sep" ,
year    =    1990 ,
annote    =    "Discusses the current research issues in
interoperability and future directions. Specifies the following major
areas Schema Migration and Semantic Heterogeneity, Transaction
Management, Query Optimization, and OO Multidatabases." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( BREITBART90A,
key    =    "Breitbart" ,
author    =    "Breitbart, Y." ,
title    =    "Multidatabase Interoperability" ,
journal    =    "sigmod" ,
publisher=    "Acm Press" ,
volume    =    "19" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1990" ,
pages    =    "53--60" ,
abstract=    "The main purpose of this paper is to provide a
brief review of the most current work in the area of multidatabases.
We first define the problem and argue that multidatabase research will
become increasingly important in the incoming years. We then outline
basic research issues in this area and concentrate on issues related
to schema integration and semantic heterogeneity, and multidatabase
transaction management. The review is not intended to be comprehensive
and in spite of our effort to remain objective in selective review
topics, probably reflects the author's biases to some extent." ,
bibdate    =    "Thu Apr 22 11:57:53 1993" ,
owner    =    "bassili" ,
)

@article    ( BREITBART92,
key    =    "Breitbart et al." ,
author    =    "Breitbart, Y. and Garcia-Molina, H. and
Silberschatz, A." ,
title    =    "Overview of Multidatabase Transaction Management" ,
journal    =    "The VLDB Journal" ,
publisher=    "VLDB Endowment" ,
volume    =    "1" ,
number    =    "2" ,
month    =    "oct" ,
year    =    "1992" ,
pages    =    "181--240" ,
keywords=    "Multidatabase; serializability; recovery;
reliability; two-level serializability; transaction" ,
abstract=    "A multi database system (MDBS) is a facility that
allows users access to data located in multiple autonomous database
management systems (DBMSs). In such a system, global transactions are
executed under the control of the MDBS. Independently, local
transactions are executed under the control of the local DBMSs. Each
local DBMS integrated by the MDBS may employ a different transaction
management scheme. In addition, each local DBMS has complete control
over all transactions (global and local) executing at its site,
including the ability to abort at any point any of the transactions
executing at its site. Typically, no design or internal DBMS structure
changes are allowed in order to accommodate the MDBS. Furthermore, the
local DBMSs may not be aware of each other and, as a consequence,
cannot coordinate their actions. Thus, traditional techniques for
ensuring transaction atomicity and consistency in homogeneous
distributed database systems may not be appropriate for an MDBS
environment. The objective of this article is to provide a brief
review of the most current work in the area of multidatabase
transaction management. We first define the problem and argue that the
multidatabase research will become increasingly important in the
coming years. We then outline basic research issues in multidatabase
transaction management and review recent results in the area. We
conclude with a discussion of open problems and practical implication
s of this research." ,
bibdate    =    "Thu Jan 28 11:54:50 1993" ,
owner    =    "bassili" ,
)

@article    ( BREITBART92A,
key    =    "Breitbart et al." ,
author    =    "Breitbart, Y. and Silberschatz, A. and Thompson,
G. R." ,
title    =    "An Approach to Recovery Management in a
Multidatabase System" ,
journal    =    "VLDB Journal" ,
publisher=    "VLDB Endowment" ,
volume    =    "1" ,
number    =    "1" ,
month    =    "jul" ,
year    =    "1992" ,
pages    =    "1--40" ,
keywords=    "Algorithms; performance; reliability;
serializability; deadlock recovery; transaction log" ,
abstract=    "This paper is concerned with the problem of
integrating a number of existing, off-the-shelf local database systems
into a multidatabase system that maintains consistency in the face of
concurrency and failures. The major difficulties in designing such
systems stem from the requirements that local transactions be allowed
to execute outside the multidatabase system control, and that the
various local database systems cannot participate in the execution of
a global commit protocol. A scheme based on the assumption that the
component local database systems use the strict two-phase locking
protocol is developed. Two major problems are addressed: How to ensure
global transaction atomicity without the provision of a commit
protocol, and how to ensure freedom from global deadlocks." ,
bibdate    =    "Thu Jan 28 18:52:12 1993" ,
owner    =    "bassili" ,
)

@incollection    ( BRETL89,
key    =    "Bretl et al." ,
author    =    "Bretl, R. and Maier, D. and Otis, A. and Penney,
J. and Schuchardt, B. and Stein, J. and Williams, E. and Williams, M." ,
title    =    "The {\it GemStone Data Management System}" ,
editor    =    "W. Kim and H. Lochovsky" ,
booktitle=    "Object Oriented Concepts, Databases and
Applications" ,
pages    =    "283--308" ,
publisher=    "ACM Press" ,
address    =    "New York" ,
year    =    1989 ,
annote    =    "An overview of the GemStone system" ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inbook        ( BREUTMANN79,
key    =    "Breutmann et al." ,
author    =    "Breutmann, B. and Falkenberg, E. F. and Mauer, R." ,
title    =    "CSL: A language of defining conceptual schemas" ,
publisher=    "North Holland, Inc." ,
address    =    "Amsterdam" ,
year    =    "1979" ,
month    =    "jun" ,
booktitle=    "Data Base Architecture" ,
bibdate    =    "Sat Oct  1 15:47:04 1983" ,
)

@inproceedings    ( BREUTMANN79A,
key    =    "Breutmann et al." ,
author    =    "Breutmann, B. and Falkenberg, E. and Mauer, R." ,
title    =    "CSL: A Language for Defining Conceptual Schemas on
Database Architecture" ,
publisher=    "North Holland" ,
booktitle=    "IFIP Working Conference" ,
editor    =    "Bracchi, G. and Nijssen, G. M." ,
pages    =    "237--256" ,
address    =    "Venice, Italy" ,
year    =    "1979" ,
abstract=    "This paper describes a high level data definition
language, CSL, which provides powerful capabilities for defining
conceptual schemas within the three level architecture of DBMS. The
language includes both descriptive and procedural elements in a
well-balanced proportion providing a notation of the conceptual schema
easy to survey. CSL provides a general solution to the naming and
identification problem and the option of introducing time frames and
calendar systems. Aiming at the central interface of the three level
architecture CSL lends itself for expressing both the static and the
dynamic aspects of conceptual data." ,
bibdate    =    "Tue Oct  9 09:54:58 1990" ,
owner    =    "robyn" ,
)

@incollection    ( BRODIE84,
key    =    "Brodie" ,
author    =    "Brodie, Michael L." ,
title    =    "On the Development of Data Models" ,
booktitle=    "On Conceptual Modelling" ,
publisher=    "Springer Verlag" ,
year    =    "1984" ,
editor    =    "Brodie, Michael J. and Mylopoulos, John and
Schmidt, Joachim W." ,
chapter    =    "21" ,
pages    =    "19--47" ,
)

@proceedings    ( BRUEGGE91,
key    =    "Bruegge" ,
title    =    "A Protable Platform for Distributed Event
Environments" ,
organization=    "acm" ,
publisher=    "acm" ,
author    =    "Bruegge, Bernd" ,
year    =    "1991" ,
month    =    "May" ,
abstract=    "Bee is a portable platform for building
distributed event environments to monitor and debug the performance of
distributed heterogenous applications. An important feature is the
dynamic connection of client programs to monitoring tools which
facilitates flexible monitoring of network programs at runtime. It
also supports user defined event classes which can be used by
implementors to build complex event systems as well as by application
programmers who need to write customized monitors. BEE has been
implemented for a variety of systems. One implementation based on a
reliable message protocol is available on NECTAR, a network of
workstations connected by optical figbers with a maximum thoughput of
100 Mbit/sec. A TCP/IP based implementation has been ported to several
machine architectures (sun Vax and Cray-YMP), supporting the
instrumentation of C and Ada programs. The paper describes BEE's
architecture, portrays some of the problems encountered suring the
various ports of BEE and demonstrated the cost associated with
distributed heterogenous event processing" ,
bibdate    =    "Thu Jan 16 17:00:04 1992" ,
owner    =    "suchen" ,
)

@inproceedings    ( BUBENKO80,
key    =    "Bubenko" ,
author    =    "Bubenko, J. A., Jr." ,
title    =    "Information modeling in the context of system
development" ,
booktitle=    "Proceedings of IFIP Congress 80" ,
month    =    "oct" ,
year    =    "1980" ,
bibdate    =    "Sat Oct  1 15:44:21 1983" ,
)

@article    ( BUFF91,
key    =    "Buff" ,
author    =    "Buff, H.W." ,
title    =    "A Complete Identity Set For Codd Algebras" ,
journal    =    "sigmod" ,
publisher=    "ACM" ,
volume    =    "20" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1991" ,
pages    =    "50--51" ,
abstract=    "none given" ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( BUITENDIJK88,
key    =    "Buitendijk" ,
author    =    "Buitendijk" ,
title    =    "Logical errors in database SQL retrieval queries" ,
journal    =    "Comput. Sci. Econ. Mangge." ,
volume    =    "1" ,
number    =    "2" ,
year    =    "1988" ,
pages    =    "79 -- 96" ,
keywords=    "SQL" ,
bibdate    =    "Fri Mar 22 11:29:23 1991" ,
owner    =    "suchen" ,
)

@article    ( BUNEMAN79A,
key    =    "Buneman \& Clemons" ,
author    =    "Buneman, O.P. and Clemons, E.K." ,
title    =    "Efficiently Monitoring Relational Databases" ,
journal    =    "tods" ,
volume    =    "4" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1979" ,
pages    =    "368--382" ,
keywords=    "relational databases, alerters, integrity
constraints, exception reporting, programming techniques" ,
abstract=    "An alerter is a program which monitors a database
and reports to some user or program when a specified condition occurs.
It may be that the condition is a complicated expression involving
several entities in the database; in this case the evaluation of the
expression may be computationally expensive. A scheme is presented in
which alerters may be placed on a complex query involving a relational
database, and a method is demonstrated for reducing the amount of
computation involved in checking whether an alerter should be
triggered." ,
bibdate    =    "Fri Sep  4 18:04:55 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( BUNEMAN86A,
key    =    "Buneman \& Ohori" ,
author    =    "Buneman, P. and Ohori, A." ,
title    =    "A Domain Theoretic Approach to Higher-Order
Relations" ,
booktitle=    "Proceedings of the International Conference on
Database Theory" ,
publisher=    "Springer-Verlag" ,
address    =    "Rome, Italy" ,
editor    =    "Ausiello, G. and Atzeni, P." ,
month    =    "sep" ,
year    =    "1986" ,
pages    =    "91--104" ,
bibdate    =    "Wed Sep  2 14:59:20 1987" ,
owner    =    "mckenzie" ,
)

@article    ( BURKHARD76,
key    =    "Burkhard" ,
author    =    "Burkhard, W." ,
title    =    "Hashing and Trie Algorithms for Partial Match
Retrieval" ,
journal    =    "tods" ,
volume    =    "1" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1976" ,
pages    =    "175--187" ,
bibdate    =    "Sat Apr 27 22:55:11 1985" ,
)

@inproceedings    ( BURNS88,
key    =    "Burns et al" ,
author    =    "Burns, L. M. and Archibald, J. A. and Malhotra, A." ,
title    =    "A graphical entity-relationship browser" ,
booktitle=    "Proc. HICSS '88" ,
volume    =    "11" ,
month    =    "jan" ,
year    =    "1988" ,
pages    =    "694--704" ,
bibdate    =    "Tue Nov  7 11:42:14 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( BUTLER87,
key    =    "Butler" ,
author    =    "Butler, M.H." ,
title    =    "Storage Reclamation in Object Oriented Database
Systems" ,
booktitle=    "Proceedings of the ACM SIGMOD Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "410--425" ,
abstract=    "When providing data management for nontraditional
data, database systems encounteer storage reclamation problems similar
to those encountered by virtual memory managers. The paging behavior
of existing automatic storage reclamation schemes as applied to
objects stored in a database management system is one indicator of the
performance cost of various features of storage reclamation
algorithms. The results of modeling the paging behavior suggest that
Mark and Sweep causes many more input/output operations than
Copy-Compact. A contributing factor to the expense of Mark and Sweep
is that it does not recluster memory as does Copy-Compact. If memory
is not reclustered, the average cost of accessing data can go up
tremendously. Other algorithms that do not recluster memory also
suffer performance problems, namely all reference counting schemes.
The main advantage of a reference count scheme is that it does not
force a running program to pause for a long period of time while
reclamation takes place; it amortizes the cost of reclamation across
all accesses. The reclustering of Copy-Compact and the cost
amortization of Reference Count are combined to great advantage in
Baker's algorithm. This algorithm proves to be the least prohibitive
for operating on disk-based data." ,
bibdate    =    "Fri Jul 24 16:16:53 1987" ,
owner    =    "manning" ,
)

@article    ( BUTTERWORTH91,
key    =    "Butterworth et al." ,
author    =    "Butterworth, Paul and Allen Otis and Jacob Stein" ,
title    =    "The GemStone Object Database Management System" ,
journal    =    "cacm" ,
volume    =    "34" ,
number    =    "10" ,
month    =    "Oct" ,
year    =    "1991" ,
pages    =    "64 -- 77" ,
abstract=    "GemStone, a commercially available object database
management system (ODBMS), was developed to satisfy the needs of the
commercial and MIS markets as well as the engineering market.
Therefore, several distinct areas are emphasized." ,
bibdate    =    "Sun Nov  3 23:30:38 1991" ,
owner    =    "suchen" ,
)

@inproceedings    ( CAMMARATA81,
key    =    "Cammarata" ,
author    =    "Cammarata, Stephanie" ,
title    =    "Deferring Updates in a Relational Data Base System" ,
booktitle=    "Proceedings of the Seventh International
Conference on Very Large Databases" ,
year    =    "1981" ,
pages    =    "286--292" ,
month    =    "" ,
)

@inproceedings    ( CAMPBELL85,
key    =    "Campbell et al" ,
author    =    "Campbell, D. M. and Embley, D. W. and Czejdo, B." ,
title    =    "A relationally complete query language for an
entity-relationship model" ,
booktitle=    "Proc. 4th Int. Conf. Entity-Relationship Approach" ,
address    =    "Chicago, IL" ,
year    =    "1985" ,
bibdate    =    "Tue Nov  7 11:45:08 1989" ,
owner    =    "robyn" ,
)

@inbook        ( CARDELLI88,
key    =    "Cardelli \& MacQueen" ,
author    =    "Cardelli, L. and MacQueen, D." ,
title    =    "Persistence and Type Abstraction" ,
booktitle=    "Data Types and Persistence" ,
publisher=    "Springer-Verlag" ,
year    =    "1988" ,
chapter    =    "3" ,
pages    =    "31--41" ,
abstract=    "Abstract types are a familiar and effective way of
structuring programs. The basic idea of information hiding must,
however, be reconciled with the need to store data for long periods of
time and make it accessible to different activities. In particular,
this requires that a type checker be able to recognize occurrences of
the same abstract type during different activations of a program,
while at the same time enforcing the privacy of data representations.
To support such a type checker, the persistent storage of data must
preserve type information, and must respect type abstraction. The use
of type abstractions in the presence of persistent storage requires
that abstract types be made persistent as well. Under these
conditions, we can preserve type security across distinct activations
of the typechecker. The following is a brief account of how various
models of abstraction and persistence interact. We start by sketching
a simple polymorphic language and its types and showing various ways
of modeling type abstraction in such a language. We then discuss some
basic notions underlying persistent storage of typed objects, such as
the intern and extern primitives and the special type dynamic, and
describe three persistence strategies. Finally we discuss a particular
approach to persistent abstract types." ,
bibdate    =    "Wed Nov  8 14:26:41 1989" ,
owner    =    "robyn" ,
)

@article    ( CARDENAS73,
key    =    "Cardenas" ,
author    =    "Cardenas, A." ,
title    =    "Evaluation and Selection of File Organization - A
Model and System" ,
journal    =    "cacm" ,
volume    =    "16" ,
number    =    "9" ,
month    =    "sep" ,
year    =    "1973" ,
pages    =    "540--548" ,
bibdate    =    "Fri Apr 26 23:35:58 1985" ,
)

@article    ( CARDENAS75,
key    =    "Cardenas" ,
author    =    "Cardenas, A." ,
title    =    "Analysis and Performance of Inverted Data Base
Structures" ,
journal    =    "cacm" ,
volume    =    "18" ,
number    =    "5" ,
month    =    "may" ,
year    =    "1975" ,
pages    =    "253--263" ,
bibdate    =    "Fri Apr 26 23:37:24 1985" ,
)

@inproceedings    ( CARDENAS85,
key    =    "Cardenas \& Wang" ,
author    =    "A. F. Cardenas, G. R. Wang" ,
title    =    "Translation of SQL/DS Data Access/Update into
Entity-Relationship Data Access/Update" ,
booktitle=    "Proceedings of the 4th International Conference on
Entity-Relationship Approach" ,
month    =    "28 - 30 Oct." ,
year    =    "1985" ,
pages    =    "256 -- 267" ,
keywords=    "SQL Entity-Relationship" ,
bibdate    =    "Fri Mar 22 16:19:12 1991" ,
owner    =    "suchen" ,
)

@phdthesis    ( CAREY83A,
key    =    "Carey" ,
author    =    "Carey, M.J." ,
title    =    "Modeling and Evaluation of Database Concurrency
Control Algorithms" ,
school    =    "ucbcsd" ,
address    =    "Berkeley, CA" ,
month    =    "aug" ,
year    =    "1983" ,
bibdate    =    "Sun Oct 30 14:37:49 1988" ,
owner    =    "" ,
)

@techreport    ( CAREY86,
key    =    "Carey et al." ,
author    =    "Carey, M.J. and DeWitt, D.J. and Frank, D. and
Graefe, G. and Richardson, J.E.; Shekita, E.J.; Muralikrishna, M." ,
title    =    "The Architecture of the EXODUS Extensible DBMS: A
Preliminary Report" ,
type    =    "Computer Sciences" ,
number    =    "644" ,
institution=    "University of Wisconsin" ,
address    =    "Madison, WI" ,
year    =    "1986" ,
month    =    "may" ,
pages    =    "1--34" ,
abstract=    "With non-traditional application areas such as
engineering design, image/voice data management,
scientific/statistical applications, and artifical intelligence
systems all clamoring for ways to store and efficiently process larger
and larger volumes of data, it is clear that traditional database
technology has been pushed to its limit. It also seems clear that no
single database system will be capable of simultaneously meeting the
functionality and performance requirements of such a diverse set of
applications. In this paper we describe the preliminary design of
EXODUS, an extensible database systems. EXODUS provides certain kernel
facilities, including a versatile storage manager and a type manager.
In addition, it provides an architectural framework for building
application-specific database systems, tools to partially automate the
generation of such systems, and libraries of software components
(e.g., access methods) that are likely to be useful for many
application domains." ,
bibdate    =    "Thu Sep 11 13:08:42 1986" ,
owner    =    "manning" ,
)

@inproceedings    ( CAREY86A,
key    =    "Carey et al." ,
author    =    "Carey, M.J. and DeWitt, D.J. and Richardson, J.E.
and Shekita, E.J." ,
title    =    "Object and File Management in the EXODUS
Extensible Database System" ,
booktitle=    "vldb" ,
organization=    "VLDB" ,
address    =    "Kyoto, Japan" ,
month    =    "aug" ,
year    =    "1986" ,
pages    =    "1--27" ,
abstract=    "This paper describes the design of the
object-oriented storage component of EXODUS, an extensible database
management system currently under development at the University of
Wisconsin. The basic abstraction in the EXODUS storage system is the
storage object, an uninterpreted variable-length record of arbitrary
size; higher level abstractions such as records and indices are
supported via the storage object abstraction. One of the key design
features described here is a scheme for managing large dynamic
objects, as storage objects can occupy many disk pages and can grow or
shrink at arbitrary points. The data structure and algorithms used to
support such objects are described, and performance results from a
preliminary prototype of the EXODUS large-object management scheme are
presented. A scheme for maintaining versions of large objects is also
described. We then describe the file structure used in the EXODUS
approach to buffer management, concurrency control, and recovery, both
for small and large objects." ,
bibdate    =    "Thu Sep 11 13:26:19 1986" ,
owner    =    "manning" ,
)

@article    ( CAREY86B,
key    =    "Carey \& Muhanna" ,
author    =    "Carey, M.J. and Muhanna, W.A." ,
title    =    "The Performance of Multiversion Concurrency
Control Algorithms" ,
journal    =    "tocs" ,
publisher=    "acm" ,
volume    =    "4" ,
number    =    "4" ,
month    =    "nov" ,
year    =    "1986" ,
pages    =    "338--378" ,
keywords=    "Algorithms; design; performance; concurrency
control; multiple versions" ,
abstract=    "A number of multiversion concurrency control
algorithms have been proposed in the past few years. These algorithms
use previous versions of data items in order to improve the level of
achievable concurrency. This paper describes a simulation study of the
performance of several multiversion concurrency control algorithms,
investigating the extent to which they provide increases in the level
of concurrency and also the CPU, I/O, and storage costs resulting from
the use of multiple versions. The multiversion algorithms are compared
with regard to performance with their single-version counterparts and
also with each other. It is shown that each multiversion algorithm
offers significant performance improvements despite the additional
disk accesses involved in accessing old versions of data; the nature
of the improvement depends on the algorithm in question. It is also
shown that the storage overhead for maintaining old versions that may
be required by ongoing transactions is not all that large under most
circumstances. Finally, it is demonstrated that it is important for
version maintenance to be implemented efficiently, as otherwise the
cost of maintaining old versions could outweigh their concurrency
benefits." ,
bibdate    =    "Thu Jan 15 14:45:48 1987" ,
owner    =    "manning" ,
)

@article    ( CAREY87,
key    =    "Carey" ,
author    =    "Carey, M.J." ,
title    =    "Improving the Performance of an Optimistic
Concurrency Control Algorithm Through Timestamps and Versions" ,
journal    =    "tse" ,
publisher=    "ieee" ,
volume    =    "SE-13" ,
number    =    "6" ,
month    =    "jun" ,
year    =    "1987" ,
pages    =    "746--751" ,
keywords=    "Concurrency control; database systems; modeling
and simulation; transaction processing" ,
abstract=    "This correspondence describes and analyzes two
schemes for improving the performance of serial validation, an
optimistic concurrency control algorithm proposed by Kung and
Robinson. It is shown that timestamp-based techniques can be used to
implement serial validation, yielding an equalivant algorithm with a
much lower validation cost. A multiple version variant of serial
validation is the presented, and simulation results indicate that
multiversion serial validation has significant performance advantages
over the single version algorithms." ,
bibdate    =    "Wed Jul 29 12:21:44 1987" ,
owner    =    "manning" ,
)

@article    ( CAREY87B,
key    =    "Carey \& DeWitt" ,
author    =    "Carey, M. J. and DeWitt, D. J." ,
title    =    "An Overview of the EXODUS Project" ,
journal    =    "Database Engineering" ,
publisher=    "IEEE" ,
volume    =    "10" ,
number    =    "2" ,
year    =    "1987" ,
pages    =    "107--114" ,
bibdate    =    "Sun Oct 30 14:05:08 1988" ,
owner    =    "" ,
)

@techreport    ( CAREY88,
key    =    "Carey et al." ,
author    =    "Carey, J.J. and Jauhari, R. and Livny, M." ,
title    =    "On Transaction Boundaries in Active Databases: A
Performance Perspective" ,
type    =    "Computer Science Technical Report" ,
number    =    "796" ,
institution=    "Computer Sciences Department" ,
address    =    "University of Wisconsin, Madison, WI" ,
year    =    "1988" ,
month    =    "nov" ,
pages    =    "1--37" ,
abstract=    "The workload of an active DBMS consists of two
types of activities: externally generated tasks submitted by users,
and rule management tasks caused by the triggering of rules stored in
the knowledge component of the system. Most design proposals for
active DBMSs assume that an external task should be combined with all
the resulting rule management tasks into a single transaction. There
is no compelling reason for this assumption, however; the semantics of
rules can be used to divide the workload into transactions in a number
of different ways. In this paper, we describe a performance model of
an active database, and present the results of simulation experiments
that study system performance as a function of transaction boundary
semantics for varying levels of data contention, rule complexity, and
data sharing between externally submitted tasks and rule managment
tasks. Our results demonstrate that the way in which transaction
boundaries are imposed can have a major impact on the performance of
an active DBMS, and that this aspect of rule semantics must therefore
be carefully considered at the time that rules are specified." ,
bibdate    =    "Tue Apr 11 09:40:05 1989" ,
owner    =    "payne" ,
)

@techreport    ( CAREY88A,
key    =    "Carey \& Livny" ,
author    =    "Carey, M. J. and Livny, M." ,
title    =    "Distributed Concurrency Control Performance: A
Study of Algorithms, Distribution, and Replication" ,
number    =    "758" ,
institution=    "University of Wisconsin-Madison" ,
year    =    "1988" ,
month    =    "mar" ,
pages    =    "1--30" ,
abstract=    "Many concurrency control algorithms have been
proposed for use in distributed database systems. Despite the large
number of available algorithms, and the fact that distributed database
systems are becoming a commercial reality, distributed concurrency
control performance trade-offs are still not well understood. In this
paper we attempt to shed light on some of the important issues by
studying the performance of four representative
algorithms--distributed 2PL, wound-wait, basic timestamp ordering, and
a distributed optimistic algorithm--using a detailed simulation model
of a distributed DBMS. We examine the performance of these algorithms
for various levels of contention, 'distributedness' of the workload,
and data replication. The results should prove useful to designers of
future distributed database systems." ,
bibdate    =    "Wed Dec 13 09:26:40 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( CAREY88B,
key    =    "Carey et al." ,
author    =    "Carey, M.J. and DeWitt, D.J. and Vandenburg, S.L." ,
title    =    "A Data Model and Query Language for EXODUS" ,
booktitle=    "sigmod" ,
organization=    "ACM" ,
address    =    "Chicago, IL" ,
month    =    "jun" ,
year    =    "1988" ,
pages    =    "413--423" ,
abstract=    "In this paper, we present the design of the EXTRA
data model and the EXCESS query language for the EXODUS extensible
database system. The EXTRA data model includes support for complex
objects with shared subobjects, a novel mix of object- and
value-oriented semantics for data, support for persistent objects of
any type in the EXTRA type lattice, and user-defined abstract data
types (ADTs). The EXCESS query language provides facilities for
querying and updating complex object structures, and it can be
extended through the addition of ADT functions and operators,
procedures and functions for manipulating EXTA schema types, and
generic set functions. EXTRA and EXCESS are intended to serve as a
test vehicle for tools developed under the EXODUS extensible database
system project." ,
)

@techreport    ( CAREY90,
key    =    "Carey et al." ,
author    =    "Carey, Michael and Shekita, Eugene and Lapis,
George and Lindsay, Bruce and McPherson, John" ,
title    =    "An Incremental Join Attachment for Starburst" ,
institution=    "Computer Sciences Department, University of
Wisconsin | Madison" ,
year    =    "1990" ,
type    =    "Technical report," ,
number    =    "937" ,
address    =    "Madison, WI 53706" ,
month    =    "June" ,
note    =    "To appear in VLDB '90." ,
)

@article    ( CAREY90A,
key    =    "Carey \& Haas" ,
author    =    "Carey, M. and Haas, L." ,
title    =    "Extensible Database Management Systems" ,
journal    =    "sigmod" ,
volume    =    "19" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1990" ,
pages    =    "54--60" ,
bibdate    =    "Sun Jan 19 20:46:45 1992" ,
owner    =    "soo" ,
)

@article    ( CAREY91,
key    =    "Carey \& Livny" ,
author    =    "Carey, Michael J. and Miron Livny" ,
title    =    "Conflict Detection tradeoffs for Replicated Data" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "16" ,
number    =    "4" ,
month    =    "Dec" ,
year    =    "1991" ,
pages    =    "703--746" ,
keywords=    "Algorithm Performance, Concurrency control,
replicated data" ,
abstract=    (many concurrency control algorithms have been
proposed for use in distribureded database systems. Despite the large
number of available algorithms and the fact that distributed database
systems are becoming a commercial reality, sidtributed concurrency
control performance trade-offs are still not well understood. In this
paper we examine some of these trade-offs by using a detailed model of
a distributed DBMS to study a set of representativoe algorithms,
including several derivatives of the two-phase locking, timestamp
ordering, and optimistic approaches to distributed concurrency
control. In particular, we examine the performance of these algorithms
for update transactions as a function of data contention for various
levels of data replication and "distributedness" ofaccesses to
replicated data. The results provide some intersting insights into how
the trade-offs between eraly and late conflict dtection vary as a
function of message cost, and should prove useful to distributed
database system designers.) ,
bibdate    =    "Thu Jan 16 16:25:22 1992" ,
owner    =    "suchen" ,
)

@inproceedings    ( CASANOVA81,
key    =    "Casanova et al." ,
author    =    "Casanova, M. and Fagin, R. and Papadimitriou, C." ,
title    =    "Inclusion Dependencies and Their Interaction with
Functional Dependencies" ,
booktitle=    "Proceedings of the Conference on Principles of
Database Systems" ,
year    =    "1981" ,
bibdate    =    "Wed Jul 22 01:10:02 1992" ,
owner    =    "soo" ,
)

@article    ( CASANOVA84A,
key    =    "Casanova et al." ,
author    =    "Casanova, M. A. and Fagin, R. and Papadimitriou,
C. H." ,
title    =    "Inclusion Dependencies and Their Interaction with
Functional Dependencies" ,
journal    =    "Journal of Computer and System Sciences" ,
volume    =    "28" ,
number    =    "1" ,
year    =    "1984" ,
pages    =    "29--59" ,
bibdate    =    "Thu Apr 22 00:02:00 1993" ,
owner    =    "soo" ,
)

@inproceedings    ( CATTELL80B,
key    =    "Cattell" ,
author    =    "Cattell, R.G.G." ,
title    =    "Integrating a Database System and
Programming/Information Environment" ,
booktitle=    "Proceedings of the Workshop on Data Abstraction,
Databases, and Conceptual Modelling" ,
organization=    "acm" ,
editor    =    "Brodie, M. L. and Zilles, S. N." ,
month    =    "jun" ,
year    =    "1980" ,
pages    =    "110--111" ,
bibdate    =    "Wed Dec 29 22:02:49 1982" ,
)

@techreport    ( CATTELL83,
key    =    "Cattell" ,
author    =    "Cattell, R.G.G." ,
title    =    "Design and Implementation of a
Relationship-Entity-Datum Data Model" ,
number    =    "CSL-83-4" ,
institution=    "Xerox Corporation" ,
address    =    "Palo Alto Research Center, Palo Alto, CA" ,
year    =    "1983" ,
month    =    "may" ,
pages    =    "1--125" ,
keywords=    "Cedar; Cypress; database systems; semantic model;
data model" ,
abstract=    "The Model level of the Cypress Database Management
System, built upon the earlier Cedar DBMS, provides data description
and access capabilities at a higher level of abstraction than the
existing system an other conventional DBMS's. In this report we
describe the design of the Cypress data model and discuss issues in
the efficient implementation of such a model. Cypress incorporates
features motivated by experience with local database applications. It
may be viewed as an integration of a number of existing data models;
we present the criteria that led to this choice. The Cypress
primitives include simple data values such as strings or integers,
entities representing real or abstract objects, and relationships
among entities and/or simple data values. We also provide mechanisms
for a hierarchy of types, relational keys, and segmentation of
databases into independent files. Cypress allows a conventional
relational query language. We argue that our extensions to simpler
data models allow a more powerful and efficient implementation, an we
describe the optimizations Cypress performs. We also discuss some
preliminary experience with user tools and applications developed in
conjunction with Cypress." ,
bibdate    =    "Tue Jan 20 13:43:29 1987" ,
owner    =    "manning" ,
)

@techreport    ( CATTELL90,
key    =    "Cattell \& Skeen" ,
author    =    "Cattell, R. G. G. and J. Skeen" ,
title    =    "Engineering Database Benchmark" ,
institution=    "Database Engineering Group Sun Microsystems" ,
year    =    "1990" ,
month    =    "Apr" ,
pages    =    "27" ,
abstract=    "Permamce is a major issue in the acceptance of
Object-oriented and relational database systems aimed at engineering
applications such as Computer-Aided Software Engineering (CASE) and
Computer-Aided Design (CAD). Because traditional databas systems
benchmarks (Bitton, Dewitt, & Turbyfill [1984], Anon et al [1985], TPC
[1989]) are inappropriate to measure the kind of performance that
engineering applications require, we designed a new benchmark
(Rubenstein, Kubicar, & Cattell [1987]), that Subsequently has been
run on a number of DBMSs. On the basis of three years experience we
have refined and simplified our benchmark measures. In this paper, we
describe the simplified benchmark and new results we obtained running
it on relational and object-oriented systems. In addition to providing
a careful specification and demonstratio of a reproducible benchmark
for enginering applications, we present evidence that an order of
magnitude difference mismatch, implementing new distributed database
architectures, taking advantage of large main memories, and using
link-based access methods." ,
bibdate    =    "Sat Sep 21 17:04:58 1991" ,
owner    =    "bib" ,
)

@article    ( CATTELL91,
key    =    "Cattell" ,
author    =    "Cattell, R. G. G." ,
title    =    "Next Generation Database Systems" ,
journal    =    "cacm" ,
volume    =    "34" ,
number    =    "10" ,
month    =    "Oct" ,
year    =    "1991" ,
pages    =    "30 -- 34" ,
abstract=    "This issue illustrates some of the most popular
approaches to next-generation database management systems, sometimes
called object-oriented or extended relational DBMSs. These new DBMSs
are designed to widen the applicability of database technology to new
kinds of applications. These applications include computer-aided
software enginering (CASE), mechanical and electrical computer0-aided
design (CAD), scientific and medical applications, graphics
representation, office automation, knowledge representation for
artificial intelligence, and business applicatons where traditional
DBMSs have proven inadequate." ,
bibdate    =    "Sun Nov  3 23:11:16 1991" ,
owner    =    "suchen" ,
)

@book        ( CATTELL93,
author    =    "Cattell, R. G. G." ,
title    =    "The Object Database Standard OMDG-93" ,
publisher=    "Morgan-Kaufmann" ,
year    =    "1993" ,
bibdate    =    "Fri Aug 13 12:17:00 1993" ,
)

@book        ( CERI84,
key    =    "Ceri \& Pelagatti" ,
author    =    "Ceri, S. and Pelagatti, G." ,
title    =    "Distributed Databases Principles \& Systems" ,
publisher=    "McGraw-Hill" ,
address    =    "NY" ,
year    =    "1984" ,
bibdate    =    "Thu Oct  3 14:12:25 1985" ,
)

@article    ( CERI85,
key    =    "Ceri \& Gottlob" ,
author    =    "Ceri, S. and Gottlob, G." ,
title    =    "Translating SQL Into Relational Algebra:
Optimization, Semantics, and Equivalence of SQL Queries" ,
journal    =    "tse" ,
volume    =    "SE-11" ,
number    =    "4" ,
month    =    "apr" ,
year    =    "1985" ,
pages    =    "324--345" ,
keywords=    "program translation; query equivalence; query
languages; query optimization; relational algebra; relational database
model; SQL" ,
abstract=    "In this paper, we present a translator from a
relevant subset of SQL into relational algebra. The translation is
syntax-directed, with translation rules associated with grammar
productions; each production corresponds to a particular type of SQL
subquery. The translations is performed in two steps, associated with
two different grammars of SQL. The first step, driven by the larger
grammar, transforms SQL queries into equivalent SQL queries that can
be accepted by a restricted grammar. The second step transforms SQL
queries accepted by the restricted grammar into expressions of
relational algebra. This approach allows performing the second step,
which is the most difficult one, on a restricted number of
productions. The translator can be used in conjunction with an
optimizer which operates on expressions of relational algebra, thus
taking advantage of a body of knowledge on the optimization of
algebraic expressions. Moreover, the proposed aproach indicates a
methodology for the correct specification and fast implementation of
new relational query languages. Finally, the translator defines the
semantics of the SQL language, and can be used for the proof of
equivalence of SQL queries which are syntactically different." ,
bibdate    =    "Mon May 20 16:12:00 1985" ,
)

@inproceedings    ( CERI87,
key    =    "Ceri \& Tanca" ,
author    =    "Ceri, S. and Tanca, L." ,
title    =    "Optimization of Systems of Algebraic Equations for
Evaluating Datalog Queries" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
editor    =    "Hammersley, P." ,
month    =    "sep" ,
year    =    "1987" ,
pages    =    "31--41" ,
abstract=    "A Datalog program can be translated into a system
of fixpoint equations of relational algebra; this paper studies how
such a system can be solved and optimized for a particular query. The
paper presents a structured approach to optimization, by identifying
several optimization steps and by studying solution methods for each
step." ,
bibdate    =    "Thu Apr 28 17:25:41 1988" ,
owner    =    "" ,
)

@inproceedings    ( CERI87A,
key    =    "Ceri et al." ,
author    =    "Ceri, Stefano and Gottlob, Georg and Wiederhold,
Gio" ,
title    =    "Interfacing Relational Databases and Prolog
Efficiently" ,
booktitle=    "Proceedings from the First International
Conference on Expert Database Systems" ,
year    =    "1987" ,
pages    =    "141--153" ,
month    =    "" ,
)

@article    ( CERI89A,
key    =    "Ceri et al." ,
author    =    "Ceri, Stefano and Gottlob, Georg and Tanca,
Letizia" ,
title    =    "What You Always Wanted to Know About Datalog (And
Never Dared to Ask)" ,
journal    =    "IEEE Transactions on Knowledge and Data
Engineering" ,
year    =    "1989" ,
volume    =    "1" ,
number    =    "1" ,
pages    =    "146--166" ,
month    =    "March" ,
)

@article    ( CHAKRAVARTHY82,
key    =    "Chakravarthy \& Minker" ,
author    =    "Chakravarthy, U.S., Minker, J." ,
title    =    "Processing Multiple Queries in Database Systems" ,
journal    =    "Database Engineering" ,
volume    =    "5" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1982" ,
pages    =    "38--44" ,
bibdate    =    "Mon Aug 29 15:58:55 1988" ,
owner    =    "" ,
)

@inproceedings    ( CHAKRAVARTHY86A,
key    =    "Chakravarthy \& Minker" ,
author    =    "Chakravarthy, U.S. and Minker, J." ,
title    =    "Multiple Query Processing in Deductive Databases
Using Query Graphs" ,
booktitle=    "vldb" ,
address    =    "Kyoto, Japan" ,
editor    =    "Kambayashi, Y." ,
month    =    "aug" ,
year    =    "1986" ,
pages    =    "384--391" ,
abstract=    "Reserach activity on query evaluation and
optimization has been centered around processing one query at a time.
Query processing systems, in general, attempt to minimize the cost of
processing a set of queries by minimizing the processing cost of each
query separately. A separate plan is generated and executed for each
query. The cost of processing (that is the CPU cost + Input/Output
cost) a set of queries evaluated in the above manner is equal to the
sum of the processing cost for each query. In this paper we extend the
connection graph decomposition algorithm to generate a single plan for
evaluating a set of queries. The approach presented in this paper is
aimed at generating a single plan, exploiting the common
subexpressions that can be detected using heuristics. We assume, for
the purposes of this paper, that we are answering queries over a
deductive database, although the approach is equally applicable to a
group of independent queries." ,
bibdate    =    "Fri Nov 20 11:35:08 1987" ,
owner    =    "mckenzie" ,
)

@techreport    ( CHAKRAVARTHY92,
key    =    "Chakravarthy et al." ,
author    =    "Chakravarthy, S. and Muthuraj, J. and Varadarajan,
R. and Navathe, S. B." ,
title    =    "An Objective Function for Vertically Partitioning
Relations in Distributed Databases and its Analysis" ,
number    =    "UF-CIS-TR-92-045" ,
institution=    "University of Florida" ,
address    =    "Department of Computer and Information Sciences" ,
year    =    "1992" ,
month    =    "nov" ,
pages    =    "25" ,
keywords=    "Data Clustering, distributed database design,
vertical partioning, objective function, attribute usage matrix" ,
abstract=    "The design of distributed databases is an
optimization problem requiring solutions to several interrelated
problems including: data fragmentation, allocation, and local
optimization. Each problem can be solved with several different
approaches thereby making the distributed database design a very
difficult task. Although there is a large body of work on the design
of data fragmentation, most of them are either ad hoc solutions or
formal solutions for special cases (e.g., binary vertical
partitioning). In this paper, we address the general vertical
partitioning problem formally. We first provide a comparison of work
in the area of data clustering and distributed databases to highlight
the thrust of this work. We derive an objective function that
generalizes and subsumes earlier work on vertical partitioning in
databases. The objective function developed in this paper provides a
basis for developing heuristic algorithms for vertical partitioning.
The objective function also facilitates comparison of previously
developed algorithms for vertical partitioning. We also illustrate how
the objective function developed for distributed transaction
processing can be extended to include additional information, such as
transaction types, different local and remote accessing costs and
replication. Finally, we indicate the current status of implementation
of a testbed." ,
bibdate    =    "Tue Jan 19 13:12:43 1993" ,
owner    =    "bassili" ,
)

@techreport    ( CHAKRAVARTHY92A,
key    =    "Chakravarthy" ,
author    =    "Chakravarthy, S." ,
title    =    "Architecture and Monitoring Techniques for Active
Database: An Evaluation" ,
number    =    "UF-CIS-TR-92-041" ,
institution=    "University of Florida" ,
address    =    "Department of Computer and Information Sciences" ,
year    =    "1992" ,
month    =    "nov" ,
pages    =    "28" ,
keywords=    "Active database, Polling, Performance evaluation,
Implementation Strategies, Layered approach, Object-oriented design" ,
abstract=    "The need for active capability for non-traditional
applications and its concomitant benefits are well-established.
Although the event-based technique for monitoring conditions (leading
to the integrated architecture) is the most versatile of all the
techniques, from a practical viewpoint there is a need for enhancing
pre-existing non-active DBMSs to support active capability. The set of
techniques that can be used for providing this add-on active
capability (leading to the layered architecture) imposes limitations
on the active capability that can be supported. Insights into the
details of techniques as well as their impact on the architecture
entails a better design that meets the active database objectives.
This paper identifies a repertoire of techniques for condition
monitoring and discusses their suitability to different architectures.
This paper argues that from a pragmatic viewpoint, both layered and
integrated approaches to support active capability need to be pursued.
Then it compares polling and event-based or asynchronous monitoring
techniques using an implementation of flavors on Symbolics. The focus
of this comparison is on: techniques, performance, influence of
implementation strategies on performance, and identification of
opportunities for optimization." ,
bibdate    =    "Tue Jan 19 13:10:48 1993" ,
owner    =    "bassili" ,
)

@article    ( CHAMBERLAIN76,
key    =    "Chamberlain et al." ,
author    =    "Chamberlain, D.~D." ,
title    =    "SEQUEL 2: A Unified Approach to Data Definition,
Manipulation and Control." ,
journal    =    "ibmsj" ,
volume    =    "20" ,
number    =    "6" ,
year    =    "1976" ,
pages    =    "560--575" ,
bibdate    =    "Wed Mar 29 14:29:30 1995" ,
owner    =    "jeff" ,
)

@inproceedings    ( CHAMBERLIN75,
key    =    "Chamberlin et al." ,
author    =    "Chamberlin, D.D. and Gray, J.N. and Traiger, I.L." ,
title    =    "Views, Authorization, and Locking in a Relational
Data Base System" ,
booktitle=    "AFIPS Conference Proceedings" ,
organization=    "AFIPS" ,
address    =    "Anaheim, CA" ,
year    =    "1975" ,
pages    =    "425--430" ,
bibdate    =    "Thu Jun  9 17:05:39 1988" ,
owner    =    "" ,
)

@article    ( CHAMBERLIN81,
key    =    "Chamberlin et al." ,
author    =    "Chamberlin, D.D. and Astrahan, M.M. and King, W.F.
and Lorie, R.A. and Mehl, J.W. and Price, T.G. and Schkolnick, M. and
Selinger Griffiths, P. and Slutz, D.R. and Wade, B.W. and Yost, R.A." ,
title    =    "Support for Repetitive Transactions and Ad Hoc
Queries in System R" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "6" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1981" ,
pages    =    "70--94" ,
keywords=    "Relational database systems; compilation;
performance measurements; transaction processing; query languages" ,
abstract=    "System R supports a high-level relational user
language called SQL which may be used by ad hoc users at terminals or
as an embedded data sublanguage in PL/I or COBOL. Host-language
programs with embedded SQL statements are processed by the System R
precompiler which replaces the SQL statements by calls to a
machine-language access module. The precompilation approach removes
much of the work of parsing, name binding, and access path selection
from the path of a running program, enabling highly efficient support
for repetitive transactions. Ad hoc queries are processed by a similar
approach of name binding and access path selection which takes place
on-line when the query is specified. By providing a flexible spectrum
of binding times, System R permits transaction-oriented programs and
ad hoc query users to share a database without loss of efficiency.
System R is an experimental database management system designed and
built by members of the IBM San Jose Research Laboratory as part of a
research program on the relational model of data. This paper describes
the architecture of System R, and gives some preliminary measurements
of system performance in both the ad hoc query and the ``canned
program'' environments. " ,
bibdate    =    "Thu Apr  2 10:07:00 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( CHAN82,
key    =    "Chan et al." ,
author    =    "Chan, A. and Fox, S. and Lin, W.T.K. and Nori, A.
and Ries, D.R." ,
title    =    "The Implementation of an Integrated Concurrency
Control and Recovery Scheme" ,
booktitle=    "sigmod" ,
organization=    "ACM" ,
address    =    "Orlando, FL" ,
month    =    "june" ,
year    =    "1982" ,
pages    =    "184--191" ,
bibdate    =    "Sun Oct 30 14:50:19 1988" ,
owner    =    "" ,
)

@inproceedings    ( CHAN87,
key    =    "Chan et al." ,
author    =    "Chan, A. and Dayal, U. and Fox, S." ,
title    =    "An Ada-Compatible Distributed Database Management
System" ,
booktitle=    "Proceedings of the IEEE, Special Issue on
Distributed Databases" ,
organization=    "ieee" ,
publisher=    "ieee" ,
volume    =    "75" ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "674--694" ,
abstract=    "Adaplex is an integrated language for programming
database applications. It results from the embedding of the database
sublanguage Daplex in the general-purpose programming language Ada.
This paper describes the design of DDM, a general-purpose distributed
database management system implemented in Ada that supports the use of
Adaplex as interface language. There are two novel aspects in the
design of this system. First, this is the first full-scale distributed
database system to support a semantically rich, functional data model.
DDM goes beyond systems like Distributed INGRES and R*-which are based
on the relational technology- in providing advanced data modeling
capabilities and ease of use. Second, this is the first full-function
distributed DBMS designed to be compatible with the Ada programming
environment. The coupling between Ada and Daplex has been achieved at
the expression level which is much tighter than the statement level
integration attained in previous systems. This tight coupling poses
new implementation problems but also cretes new opportunities for
optimization. The current paper highlights the Adaplex language and
discusses innovative aspects in DDM's design that are intended to meet
the dual objectives of good performance and high data availability." ,
bibdate    =    "Fri Mar  4 12:44:34 1988" ,
owner    =    "manning" ,
)

@article    ( CHANDRA80,
key    =    "Chandra \& Harel" ,
author    =    "Chandra, A.K. and Harel, D." ,
title    =    "Computable Queries for Relational Data Bases" ,
journal    =    "Journal of Computer and System Sciences" ,
volume    =    "21" ,
number    =    "2" ,
month    =    "oct" ,
year    =    "1980" ,
pages    =    "156--178" ,
abstract=    "The concept of ``reasonable'' queries on
relational data bases is investigated. We provide an abstract
characterization of the class of queries which are computable, and
define the completeness of a query language as the property of being
precisely powerful enough to express the queries in this class. This
definition is then compared with other proposals for measuring the
power of query languages. Our main result is the completeness of a
simple programming language which can be thought of as consisting of
the relational algebra augmented with the power of iteration." ,
bibdate    =    "Mon Feb  2 13:45:48 1987" ,
owner    =    "manning" ,
)

@article    ( CHANG80,
key    =    "Chang \& Fu" ,
author    =    "Chang, N. and Fu, K." ,
title    =    "Query-by-Pictorial-Example" ,
journal    =    "tse" ,
publisher=    "IEEE" ,
volume    =    "SE-6" ,
number    =    "6" ,
month    =    "nov" ,
year    =    "1980" ,
pages    =    "519--524" ,
keywords=    "Graphics; image processing; pictorial example;
pictorial relations; query language" ,
abstract=    "Query-by-Pictorial-Example is a relational query
language introduced for manipulating queries regarding pictorial
relations as well as conventional relations. In addition to the
manipulating capabilities of the conventional query languages, queries
can also be expressed in terms of pictorial examples through a display
terminal. Example queries are used to illustrate the language
facilites. " ,
bibdate    =    "Tue Jan 20 11:38:24 1987" ,
owner    =    "manning" ,
)

@techreport    ( CHANG88,
key    =    "Chang \& Katz" ,
author    =    "Chang, E.E. and Katz, R.H." ,
title    =    "Exploiting Inheritance and Structure Semantics for
Effective Clustering and Buffering in an Object-Oriented DBMS" ,
number    =    "UCB/CSD 88/473" ,
institution=    "Computer Science Division-EECS" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1988" ,
month    =    "nov" ,
pages    =    "1--29" ,
keywords=    "object-oriented dbms; design databases;
clustering; context-sensitive buffering" ,
abstract=    "Object-oriented databases provide new kinds of
data semantics in terms of inheritance and structural relationships.
In this paper, we examine how to make use of the additional semantics
to obtain more effective object buffering and clustering. We have
instrumented real-world object-oriented applications, i.e., the
Berkeley CAD Group's OCT design tools, and have used the collected
information as the basis for a simulation model in which to
investigate alternative buffering and clustering strategies. We have
observed from our measurements that real CAD applications exhibit high
data read to write ratios. We propose a run-time reclustering
algorithm whose initial evaluation indicates that system response time
can be improved by a factor of 200\% when the read/write ratio is
high. We have also found it useful to limit the amount of I/O allowed
to the clustering algorithm as it examines candidate pages for
reclustering at run-time. Basically, there is little performance
destiniction between limiting reclustering to a few I/Os or many, so a
low limit on I/O appears to be acceptable. We also examine, under a
variety of workload assumptions, context-sensitive buffer replacement
policies with alternative prefetching policies." ,
bibdate    =    "Tue Apr 11 09:30:06 1989" ,
owner    =    "payne" ,
)

@article    ( CHANG92,
key    =    "Chang \& Hsu" ,
author    =    "Chang, S. and Hsu, A." ,
title    =    "Image Information Systems: Where Do We Go From
Here?" ,
journal    =    "tdke" ,
publisher=    "ieee" ,
volume    =    "4" ,
number    =    "5" ,
month    =    "oct" ,
year    =    "1992" ,
pages    =    "431--442" ,
keywords=    "Image information systems, image database, image
data models, feature-based indexing, active index, generalized icons,
smart images" ,
abstract=    "A conceptual framework for image information
system is presented. Current research topics are surveyed, and
application examples presented, followed by a discussion on the design
issues for the next generation of image information systems. It is our
view that the next generation of active image information systems
should be designed based upon the notions of generalized icons and
active indexes, resulting in smart images." ,
bibdate    =    "Tue Jan 19 13:21:00 1993" ,
owner    =    "bassili" ,
)

@article    ( CHATTERJEE91,
key    =    "Chatterjee \& Segev" ,
author    =    "Chatterjee, A. and Segev, A." ,
title    =    "Data Manipulation in Heterogeneous Databases" ,
journal    =    "sigmod" ,
volume    =    "20" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1991" ,
pages    =    "64--68" ,
abstract=    "Many important information systems applications
require access to data stored in multiple heterogeneous databases.
This paper examines a problem in inter-database data manipulation
within a heterogeneous environment, where conventional techniques are
no longer useful. To solve the problem, a broader definition for join
operator is proposed. Also, a method to probabilistically estimate the
accuracy of the join is discussed." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( CHAUDHRI95,
key    =    "Chaudhri" ,
author    =    "Chaudhri, A. B." ,
title    =    "An Annotated Bibliography of Benchmarks for Object
Databases" ,
journal    =    "sigmod" ,
publisher=    "ACM Press" ,
volume    =    "24" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1995" ,
pages    =    "50--57" ,
bibdate    =    "Wed Nov 22 12:58:15 1995" ,
abstract=    "This annotated bibliography presents a collection
of published papers, technical reports, Master's and PhD Theses that
have investigated various aspects of object database performance." ,
owner    =    "jeff" ,
)

@techreport    ( CHAUDHURI89,
key    =    "Chaudhuri" ,
author    =    "Chaudhuri, Surajit" ,
title    =    "Generalization as a Query Modification Operation" ,
institution=    "Stanford University" ,
year    =    "1989" ,
type    =    "" ,
number    =    "" ,
address    =    "" ,
month    =    "" ,
note    =    "Paper submitted for publication" ,
)

@inproceedings    ( CHAUDHURI90,
key    =    "Chaudhuri" ,
author    =    "Chaudhuri, Surajit" ,
title    =    "Generalization as a Framework for Query
Modification" ,
booktitle=    "Proceedings of the Sixth International Conference
on Data Engineering" ,
year    =    "1990" ,
pages    =    "138--145" ,
month    =    "February" ,
)

@inproceedings    ( CHAUDHURI94,
key    =    "Chaudhuri \& Shim" ,
author    =    "Chaudhuri, Surajit and Shim, Kyuseok" ,
title    =    "Including Group-By in Query Optimization" ,
booktitle=    "vldb" ,
publisher=    "Morgan Kauffman" ,
month    =    "sep" ,
year    =    "1994" ,
bibdate    =    "Wed Sep 21 13:06:58 1994" ,
owner    =    "kevin" ,
)

@inproceedings    ( CHAUDHURI95A,
key    =    "Chaudhuri et al." ,
author    =    "Chaudhuri, S. and Krishnamurthy, R. and
Potamianos, S. and Shim, K." ,
title    =    "Optimizing Queries with Materialized Views" ,
booktitle=    "International Conference on Database Engineering" ,
organization=    "ieee" ,
year    =    "1995" ,
pages    =    "190--200" ,
bibdate    =    "Mon Nov 20 15:15:32 1995" ,
abstract=    "While much work has addressed the problem of
maintaining materialized views, the important question of optimizing
queries in the presence of materialized views has not been resolved.
In this paper, we analyze the optimization question and provide a
comprehensive and efficient solution. Our solution has the desirable
property that it is a simple generalization of the traditional query
optimization algorithm." ,
owner    =    "jeff" ,
)

@article    ( CHEN76,
key    =    "Chen" ,
author    =    "Chen, P. P-S." ,
title    =    "The Entity-Relationship Model -- Toward a Unified
View of Data" ,
journal    =    "tods" ,
volume    =    "1" ,
year    =    "1976" ,
number    =    "1" ,
month    =    "mar" ,
pages    =    "9--36" ,
keywords=    "Database design, logical view of data, semantics
of data models, entity-relationship model, Data Base Task Group,
network model, entity set model, data definition and manipulation,
data integrity and consistency" ,
abstract=    "A data model, called the entity-relationship
model, is proposed. This model incorporates some of the important
semantic information about the real world. A special diagrammatic
technique is introduced as a tool for database design. An example of
database design and description using the model and the diagrammatic
technique is given. Some implications for data integrity, information
retrieval, and data manipulation are discussed. The
entity-relationship model can be used as a basis for unification of
different views of data: the network model, the relational model, and
the entity set model. Semantic ambiguities in these models are
analyzed. Possible ways to derive their views of data from the
entity-relationship model are presented." ,
)

@inproceedings    ( CHEN77B,
key    =    "Chen \& Yao" ,
author    =    "Chen, P. and Yao, S." ,
title    =    "Design and Performance Tools for Data Base Systems" ,
booktitle=    "vldb" ,
year    =    "1977" ,
pages    =    "3--15" ,
bibdate    =    "Sun May  5 17:18:22 1985" ,
)

@article    ( CHEN84B,
key    =    "Chen \& Vitter" ,
author    =    "Chen, W. and Vitter, J." ,
title    =    "Analysis of New Variants of Coalesced Hashing" ,
journal    =    "tods" ,
volume    =    "9" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1984" ,
pages    =    "616--645" ,
bibdate    =    "Sat Apr 27 22:44:41 1985" ,
)

@inproceedings    ( CHEN89,
key    =    "Chen \& McNamee" ,
author    =    "Chen, M. C. and McNamee, L." ,
title    =    "A Data Model and Access Method for Summary Data
Management" ,
booktitle=    "Proceedings of the Fifth International Conference
on Data Engineering" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1989" ,
pages    =    "242--249" ,
abstract=    "This paper proposes a data model and an access
method for summary data management. Summary data, represented as a
trinary tuple <statistical function, category, summary>, is
meta-knowledge summarized by a statistical function of a category of
individual information typically stored in a coventional database. For
instance, <average-income, female engineer with 10 years experience
and master degree, \$45,000> is a summary data. The concept of
category (type or class) and the additivity property of statistical
functions form the basis of this model that allows for the derivation
of new summary data. The complexity of deriving new summary data has
been found computationally intractable in general and the proposed
summary data model, with disjointness constraint, solves the problem
without the loss of information. The proposed access method called
Summary Data tree, or SD-tree, which handles an orthogonal category as
a hyper-rectangle, realizes the proposed summary data model. The
structure of the SD-tree provides for efficient operations including
summary data search, derivation and insertion on the stored summary
data." ,
bibdate    =    "Fri Jan 12 10:22:14 1990" ,
owner    =    "robyn" ,
)

@article    ( CHEN89A,
key    =    "Chen \& Li" ,
author    =    "Chen, J. S. J. and Li, V. O. K." ,
title    =    "Optimizing Joins in Fragmental Database Systems on
a Broadcast Local Networks" ,
journal    =    "tse" ,
publisher=    "ieee" ,
volume    =    "15" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1989" ,
pages    =    "26--38" ,
keywords=    "Broadcast network; distributed query processing;
fragmented database; join; minimum weight vertex cover; semijoin" ,
abstract=    "The problem of optimizing joins between fragmented
relations on a broadcast local network is analyzed. Data redundancy is
considered. Semantic information associated with fragments are used to
eliminate unnecessary processing. Furthermore, we allow more than one
physical copies of a fragment to be used in a strategy to achieve more
parallelism. Join-analysis graphs are introduced to represent joins on
two fragmented relations. The problem of optimizing a join is mapped
into an equivalent problem of finding a minimum-weight vertex cover
for the corresponding join-analysis graph. This problem is proved to
be NP-hard. A four-phase approach for processing joins is processed." ,
bibdate    =    "Sun Apr 11 15:37:15 1993" ,
owner    =    "bassili" ,
)

@article    ( CHEN92,
key    =    "Chen \& Lynch" ,
author    =    "Chen, H. and Lynch, K." ,
title    =    "Semantics-Based Information Management and
Retrieval: A Knowledge Discovery Approach" ,
journal    =    "IEEE Transactions on Systems, Man, and Cybernetics" ,
publisher=    "IEEE" ,
volume    =    "?" ,
number    =    "?" ,
month    =    "Forthcoming" ,
year    =    "1992" ,
pages    =    "??--??" ,
abstract=    "We report results of a study that involved the
creation of knowledge bases from large, operational textual databases.
Two East-bloc computing knowledge bases, both based on semantic
network structure, were created automatically using two statistical
algorithms. With the help of four East-bloc computing experts, we
evaluated the two knowledge bases in detail in a concept-association
experiment bases on recall and recognition tests. In our experiment,
one of the knowledge bases that exhibited the asymmetric link property
out-performed all four experts in recalling relevant concepts in
East-bloc computing. The knowledge base, which contained about 20,000
concepts (nodes) and 280,000 weighted relationships (links), was
incorporated as a thesauras-like component into an intelligent
retrieval system. The system allowed users to perform semantics-based
information management and information retrieval via interactive,
conceptual relevance feedback. Current research efforts include
development of a meta knowledge base and design of semantic network
and neural network based inferencing algorithms." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( CHEUNG82,
key    =    "Cheung" ,
author    =    "Cheung, T." ,
title    =    "Estimating Block Accesses and Number of Records in
File Management" ,
journal    =    "cacm" ,
volume    =    "25" ,
number    =    "7" ,
month    =    "jul" ,
year    =    "1982" ,
pages    =    "484--487" ,
bibdate    =    "Fri Apr 26 23:23:33 1985" ,
)

@article    ( CHEUNG89,
key    =    "Cheung et al" ,
author    =    "Cheung, S. Y. and Ahamad, M. and Ammar, M. H." ,
title    =    "Optimizing Vote and Quorum Assignments for Reading
and Writing Replicated Data" ,
journal    =    "IEEE Transactions on Data and Knowledge
Engineering" ,
volume    =    "1" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1989" ,
pages    =    "387--397" ,
keywords=    "Availability; data replication; fault tolerance;
replica control methods; vote and quorum assignment; weighted voting" ,
abstract=    "In the weighted voting protocol which is used to
maintain the consistency of replicated data, the availability of the
data to read and write operations not only depends on the availability
of the nodes storing the data but also on the vote and quorum
assignments used. We consider the problem of determining the vote and
quorum assignments that yield the best performance in a distributed
system where node availabilities can be different and the mix of the
read and write operations is arbitrary. The optimal vote and quorum
assignments depend not only on the system parameters such as node
availability and operation mix, but also on the performance measure.
We present an enumeration algorithm that can be used to find the vote
and quorum assignments that need to be considered for achieving
optimal performance. When the performance measure is data
availability, an analytical method is derived to evaluate it for any
vote and quorum assignment. This method and the enumeration algorithm
are used to find the optimal vote and quorum assignment for several
systems. The enumeration algorithm can also be used to obtain the
optimal performance when other measures are considered." ,
bibdate    =    "Fri Dec  8 15:35:58 1989" ,
owner    =    "robyn" ,
)

@article    ( CHIMENTI90,
key    =    "Chimenti et al." ,
author    =    "Chimenti, Danette and Ruben Gamboa and Ravi
Krishnamurthy and Shamim Naqvi and Shalom Tsur and Carlo Zaniolo" ,
title    =    "The LDL System Prototype" ,
journal    =    "tkde" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1990" ,
pages    =    "76--90" ,
keywords=    "Data dredging, declarative programming, deductive
databases, logical data language, optimization, rapid prototyping,
recursion,, rule-based systems, transitive closure." ,
abstract=    "The \em{L D L} system provides a declarative
login-based language and integrates relational database and login
programming technologies so as to support advanced data and
knowledge-based applications. Theis paper contains a comprehensive
overview of the system and contains a descriotion of the \em{L D L}
language and the compilation techniques employed to translate \em {L D
L} queries into target query execution plans on the stored data. The
paper further contains a description of the architecture and run-time
environment of the system and the optimization techniques employed in
order to improve the performance and assure the safety of the compiled
queries. The paper comcludes with an account of the experience gained
so far with the system, and discusses applicatrion areas where the
\em{L D L} approach appears to be particularly effective." ,
bibdate    =    "Sun Aug  4 14:46:48 1991" ,
owner    =    "bib" ,
)

@article    ( CHO89,
key    =    "Cho et al." ,
author    =    "Cho, H. R. and Park, S. J. and Hevia, E." ,
title    =    "An Approach to Efficient Database Design
Incorporating Usage Information" ,
journal    =    "Information Systems" ,
year    =    "1989" ,
volume    =    "14" ,
number    =    "2" ,
pages    =    "107--115" ,
month    =    "" ,
)

@inproceedings    ( CHOLVY86A,
key    =    "Cholvy" ,
author    =    "Cholvy, L." ,
title    =    "Update Semantics under the Domain Closure
Assumption" ,
booktitle=    "Proceedings of the International Conference on
Database Theory" ,
publisher=    "Springer-Verlag" ,
address    =    "Rome, Italy" ,
editor    =    "Ausiello, G. and Atzeni, P." ,
month    =    "sep" ,
year    =    "1986" ,
pages    =    "123--140" ,
abstract=    "The problem addressed in this paper is the
characterization of the database state which results from an update.
To reach this goal, we suppose that some transition constraints may be
expressed. We also assume that the set of objects which are
manipulated in the database is finite, and the considered operation is
not a domain modification. Finally, we aim to define the update
semantics in such a way that an update on two equivalent states leads
to two equivalent resulting states. The operations we consider are not
restricted to facts, and may concern more general information." ,
bibdate    =    "Wed Sep  2 14:51:50 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( CHOLVYM87,
key    =    "Cholvym \& Demolombre" ,
author    =    "Cholvym Laurence and Demolombre, Robert" ,
title    =    "Querying a Rule Base" ,
booktitle=    "Proceedings from the First International
Conference on Expert Database Systems" ,
year    =    "1987" ,
pages    =    "365--371" ,
month    =    "" ,
)

@techreport    ( CHOMICKI89,
key    =    "Chomicki \& Imielinski" ,
author    =    "Chomicki, J. and Imielinski, T." ,
title    =    "Relational Specifications of Infinite Query
Answers" ,
number    =    "UMIACS-TR-89-3.1, CS-TR-2177.1" ,
edition    =    "January 1989, Revised March 1989" ,
institution=    "Institute for Advanced Computer Studies,
Department of Computer Science; Deparment of Computer Science" ,
address    =    "University of Maryland, College Park, MD 20742;
Rutgers University, New Brunswick, NJ 08903" ,
year    =    "1989" ,
month    =    "jan" ,
pages    =    "1--10" ,
abstract=    "We investigate here functional deductive
databases: an extension of DATALOG capable of representing infinite
phenomena. Rules in functional deductive databases are Horn and
predicates can have arbitrary unary and limited k-ary function symbols
in one fixed position. This class is known to be decidable. However,
least fixpoints of functional rules may be infinite. We present here a
method to finitely represent infinite least fixpoints and infinite
query answers as relational specifications. Relational specifications
consist of a finite set of tuples and of a finitely specificed
congruence relation. Our method is applicable to every
domain-independent set of functional rules." ,
bibdate    =    "Mon May  8 12:12:01 1989" ,
owner    =    "payne" ,
)

@inproceedings    ( CHOMICKI92,
key    =    "Chomicki" ,
author    =    "Chomicki, J." ,
title    =    "Real-Time Integrity Constraints (extended
abstract)" ,
booktitle=    "pods" ,
address    =    "San Diego, CA" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "274--281" ,
abstract=    "We propose that Past Metric Temporal Logic
(Temporal Logic with real-time operators referring to the past) be
used as a language for specifying real-time integrity constraints.
Building on our earlier work, we develop efficient, history-less
methods of evaluating such constraints. We argue that real-time
constraints should be implemented as Condition-Action rules with
temporal conditions." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( CHOMICKI93,
key    =    "Chomicki \& Imieli\'{n}ski" ,
author    =    "Chomicki, J. and Imieli\'{n}ski" ,
title    =    "Finite Representation of Infinite Query Answers" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "18" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1993" ,
pages    =    "181--223" ,
keywords=    "Computational complexity; Datalog; decidability;
logic programming; non-Herbrand models; nonstandard query answers;
query processing; safety" ,
abstract=    "We define here a formal notion of finite
representation of infinite query answers in logic programs. We apply
this notion to $Datalog_{nS}$ (Datalog with n successors): am
extension of Datalog capable of representing infinite phenomena lke
flow of time or plan construction. Predicates in $Datalog_{nS}$ can
have arbitrary unary and limited $n$-ary function symbols in one fixed
position. This class of logic programs is known to be decidable.
However, least Herbrand models of $Datalog_{nS}$ programs may be
infinite and consequently queries may have infinite answers. We
present a method to finitely represent infinite least Herbrand models
of $Datalog_{nS}$ programs as relational specifications. A relational
specification consists of a finite set of facts and a finitely
specified congruence relation. A relational specification has the
following desirable properties: First, it is explicit in the sense
that once it is computed, the original $Datalog_{nS}$ program (and its
underlying computational engine) can be forgotten. Given a query to be
eveluated, it is easy to obtain from the relational specification
finitely many answers substitutions that represent infinitely many
answer substitutions to the query. The method involved is a
combination of a simple, unificationless, computational mechanism
(graph traversal, congruence closure, or term rewriting) and standard
relational query eveluation methods. Second, a relational
specification is effectively computable and its computation is no
harder, in the sense of the complexity class, than answering yes-no
queries. Our method is applicable to every range-restricted
$Datalog_{nS}$ program. We also show that for some very simple
non-$Datalog_{nS}$ logic programs, finite representations of query
answers do not exist." ,
bibdate    =    "Wed Jul 21 22:48:42 1993" ,
owner    =    "daisyc" ,
)

@inbook        ( CHOU85,
key    =    "Chou et al." ,
author    =    "Chou, H.T., Dewitt, D.J. and Katz, R.H. and Klug,
A.C." ,
title    =    "Design and Implementation of the Wisconsin Storage
System" ,
booktitle=    "spe" ,
publisher=    "John Wiley \& Sons, Ltd." ,
year    =    "1985" ,
month    =    "oct" ,
volume    =    "15" ,
chapter    =    "10" ,
pages    =    "943--962" ,
keywords=    "Database systems; file system design; storage
structures; access methods" ,
abstract=    "We describe the implementation of a flexible data
storage system for the UNIX environment that has been designed as an
experimental vehicle for building database management systems. The
storage component forms a foundation upon which a variety of database
systems can be constructed including support for unconventional types
of data. We describe the system architecture, the design decisions
incorporated within its implementation, our experiences in developing
this large piece of software, and the applications that have been
built on top of it." ,
bibdate    =    "Mon Feb  2 13:18:53 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( CHRISTENSEN87,
key    =    "Christensen \& Zahle" ,
author    =    "Christensen, A. and Zahle, T. U." ,
title    =    "A Comparison of Self-Contained and Embedded
Database Languages" ,
booktitle=    "Proceedings of the 13'th International Conference
on Very Large Data Bases" ,
year    =    "1987" ,
pages    =    "209--216" ,
month    =    "September" ,
)

@inproceedings    ( CHRISTODOULAKIS83,
key    =    "Christodoulakis" ,
author    =    "Christodoulakis, S." ,
title    =    "Estimating Block Transfers and Join Sizes" ,
booktitle=    "sigmod" ,
volume    =    "13" ,
month    =    "may" ,
year    =    "1983" ,
pages    =    "40--54" ,
bibdate    =    "Fri Apr 26 23:19:23 1985" ,
)

@article    ( CHRISTODOULAKIS83A,
key    =    "Christodoulakis" ,
author    =    "Christodoulakis, S." ,
title    =    "Estimating Record Selectivities" ,
journal    =    "Information Systems" ,
publisher=    "Pergamon Press Ltd." ,
volume    =    "8" ,
number    =    "2" ,
year    =    "1983" ,
pages    =    "105--115" ,
abstract=    "In this paper we examine the problem of modelling
data base contents and user requests. This modelling is necessary in
analytic data base performance evaluation studies in order to estimate
the number of records of a file that have to be retrieved in response
to user(s) requests. The cpu, io, and telecommunication costs of the
system are directly or indirectly expressed in terms of these
quantities. We first show that certain assumptions used for modelling
data base contents, data placement on devices and user requests often
are not satisfied in actual data base environments. Thereafter we
provide more detailed modelling techniques based on a multivariate
statistical model, and we demonstrate their use in improving data base
performance." ,
bibdate    =    "Thu Jul  1 04:20:59 1993" ,
owner    =    "daisyc" ,
)

@article    ( CHRISTODOULAKIS84,
key    =    "Christodoulakis" ,
author    =    "Christodoulakis, S." ,
title    =    "Implications of Certain Assumptions in Database
Performance Evaluation" ,
journal    =    "tods" ,
volume    =    "9" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1984" ,
pages    =    "163--186" ,
bibdate    =    "Sat Apr 27 22:40:56 1985" ,
)

@article    ( CHRISTODOULAKIS84A,
key    =    "Christodoulakis" ,
author    =    "Christodoulakis, S." ,
title    =    "Estimating Block Selectivities" ,
journal    =    "Information Systems" ,
publisher=    "Pergamon Press Ltd." ,
volume    =    "9" ,
number    =    "1" ,
year    =    "1984" ,
pages    =    "69--79" ,
abstract=    "In many data base performance studies there is a
need to estimate the number of records of a file which qualify in a
query, as well as the number of blocks of secondary storage which
contain these records. In this paper we present a model of data base
contents and data placement on devices. We extend a multivariate
statistical model that was used for the estimation of record
selectivities in to model the distribution of records that qualify in
a query among the blocks of secondary storage. Then we show how to
obtain estimates of block selectivities and we compare our estimates
with the estimates of previous models." ,
bibdate    =    "Thu Jul  1 02:27:17 1993" ,
owner    =    "daisyc" ,
)

@inproceedings    ( CHRISTODOULAKIS85,
key    =    "Christodoulakis" ,
author    =    "Christodoulakis, S." ,
title    =    "Issues in the Architecture of a Document Archiver
using Optical Disk Technology" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "34--50" ,
abstract=    "We present issues related to the architecture of a
document archiver using optical disk technology. In particular we
examine the problems of data placement in the optical disk, storage
hierarchies, data duplication and version control. Simulation results
and analytical results are presented. These results are used to
analyze the effect of various design decisions on the performance of
such a system." ,
bibdate    =    "Tue Jun 11 11:26:31 1985" ,
)

@inproceedings    ( CHRISTODOULAKIS85A,
key    =    "Christodoulakis" ,
author    =    "Christodoulakis, S." ,
title    =    "Panel: Multimedia Database Management Systems
Applications and Problems, A Position Paper" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "304--305" ,
bibdate    =    "Tue Jun 11 13:55:25 1985" ,
)

@article    ( CHRISTODOULAKIS86,
key    =    "Christodoulakis \& Faloutsos" ,
author    =    "Christodoulakis, S. and Faloutsos, C." ,
title    =    "Design and Performance Considerations for an
Optical Disk-Based, Multimedia Object Server" ,
journal    =    "Computer" ,
publisher=    "IEEE" ,
volume    =    "19" ,
number    =    "12" ,
month    =    "dec" ,
year    =    "1986" ,
pages    =    "45--56" ,
bibdate    =    "Thu Jan  8 11:37:46 1987" ,
owner    =    "manning" ,
)

@article    ( CHRISTODOULAKIS86A,
key    =    "Christodoulakis" ,
author    =    "Christodoulakis, S." ,
title    =    "Query Processing in Optical Disk Based Multimedia
Information Systems" ,
journal    =    "Database Engineering" ,
publisher=    "ieee" ,
volume    =    "9" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1986" ,
pages    =    "17--21" ,
abstract=    "MINOS is a project in multimedia information
management. In this project, we investigate issues related to the
integrated magnetic and optical disk storage management for multimedia
objects, content addressibility for multimedia objects, access
methods, user interfaces, editing and formatting tools, distributed
systems aspects, and finally query optimization in a multimedia server
environment. In this project, we have implemented and demonstrated a
series of prototypes. We are using the prototypes for experimentation
and evaluation of our ideas. Currently we are involved in the
implementation of a high-performance multimedia object server based on
optical disk technology. Optical disks have been chosen because of
their ability to store inexpensively large volumes of multimedia
information. We are studying various aspects of query processing in
such an environment analytically and experimentally. The results of
our investigations will be incorporated in our system implementation.
In this report we outline our research efforts in multimedia query
processing." ,
bibdate    =    "Mon Jun  6 16:39:51 1988" ,
owner    =    "manning" ,
)

@article    ( CHRISTODOULAKIS87,
key    =    "Christodoulakis" ,
author    =    "Christodoulakis, S." ,
title    =    "Analysis of Retrieval Performance for Records and
Objects Using Optical Disk Technology" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "12" ,
number    =    "2" ,
year    =    "1987" ,
pages    =    "137--169" ,
abstract=    "In this paper we examine the problem of object and
record retrieval from optical disks. General objects (such as images,
documents, etc.) may be long and their length may have high variance.
We assume that all components of an object are stored consecutively in
storage to speedup retrieval performance. We first present an optical
disk model and an optimal schedule for retrieval of records and
objects which qualify in a single query on a file which is stored on
an optical disk device. Then we provide exact and approximate analytic
results for evaluating the retrieval performance for objects from an
optical disk. The analysis provides some basic analytic tools for
studying the performance of various file and data base organizations
for optical disks. The results involve probability distribution of
block accesses, probability distributions of span accesses,
probability distribution of seek times. Record retrieval is an
important special case. The differences of this analysis with similiar
analysis in data base environments are: 1) Large size and large
variance of the size of objects. 2) Crossing of track boundaries by
objects. 3) The capability for span access that optical disks provide.
(E.g. when the optical assembly is located into a given position
information can be read from a number of consecutive tracks (span with
a small additional cost)." ,
bibdate    =    "Wed Feb 11 12:44:40 1987" ,
owner    =    "manning" ,
)

@article    ( CHRISTODOULAKIS88,
key    =    "Christodoulakis et al." ,
author    =    "Christodoulakis, S. and Elliott, K. and Ford, D.
and Hatzilemonias, K. and Ledoux, E. and Leitch, M. and Ng, R." ,
title    =    "Optical Mass Storage Systems and their Performance" ,
journal    =    "Database Engineering" ,
publisher=    "ieee" ,
volume    =    "11" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1988" ,
pages    =    "14--25" ,
abstract=    "The MINOS project at the University of Waterloo
aims at the development of multimedia data base management systems.
These systems regularly have as a major resource, information which is
not formatted- text, graphics, bitmaps, voice, animation, etc. Due to
the very large storage requirements of these data types and the
archival nature of the applications involved, optical discs are
currently the most appropriate storage devices. As part of the MINOS
project we study performance aspects of various optical disk based
architectures, and we are designing and implementing a high
performance server based on optical disk technology. In this paper we
summarize our current research activities." ,
owner    =    "manning" ,
bibdate    =    "Tue Jun  7 14:56:45 1988" ,
)

@inproceedings    ( CHRISTODOULAKIS88B,
key    =    "Christodoulakis \& Ford" ,
author    =    "Christodoulakis, S. and Ford, D.A." ,
title    =    "Performance Analysis and Fundamental Performance
Trade Offs for CLV Optical Disks" ,
booktitle=    "sigmod" ,
organization=    "ACM" ,
address    =    "Chicago, IL" ,
month    =    "june" ,
year    =    "1988" ,
pages    =    "286--294" ,
bibdate    =    "Wed Nov  2 11:37:58 1988" ,
owner    =    "" ,
)

@article    ( CHRISTODOULAKIS91,
key    =    "Christodoulakis et al." ,
author    =    "Christodoulakis, Stavros and Natassa Ailamaki and
Manolis Fragonikolakis and Yorgos Kapetanakis and Leonidas Koveos " ,
title    =    "An Object Oriented Architecture For Multimedia
Information Systems" ,
journal    =    "Data Engineering" ,
publisher=    "IEEE" ,
volume    =    "14" ,
number    =    "3" ,
month    =    "Sept" ,
year    =    "1991" ,
pages    =    "4--15" ,
abstract=    "we present aspects of the design and
implementation of a Multimedia Object Server. We first present the
design and implementation of the Object Virtual Machine(OVM), a
multimedia object manager. OVM considers environments with large main
memories that can comtain a large number of objects. However,
multimedia objects ahvae to reside in secondary and tertiary storage
due to their size. Multimedia objects are treated as first class
objects, and methods and acces structures for them are supported by
the system. The secondary storage information is modeled in three
layers: logical files, physical files and devices; thus allowing
flexibility, clustering and parallelism in the multimedia database
design. Next, we describe experimental and analytical performance
studies for a server environment for multimedia data. We outline
results on optimal data placement on optical disks, buffering for
delay-sensitive multimedia data environments and schdeuling aspects in
a server based on secondary and tertiary optical storage(jukeboxes)." ,
bibdate    =    "Wed Dec 11 11:19:22 1991" ,
owner    =    "suchen" ,
)

@article    ( CICHELLI80,
key    =    "Cichelli" ,
author    =    "Cichelli, R." ,
title    =    "Minimal perfect hash functions made simple" ,
journal    =    "cacm" ,
volume    =    "23" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1980" ,
pages    =    "17--19" ,
bibdate    =    "Fri Jun  7 17:57:10 1985" ,
)

@techreport    ( CLAMEN91,
key    =    "Clamen" ,
author    =    "Clamen, S. M." ,
title    =    "Data Persistence in Programming Languages -- A
Survey" ,
number    =    "CMU-CS-91-155" ,
institution=    "cmucsd" ,
year    =    "1991" ,
month    =    "may" ,
pages    =    "66" ,
abstract=    "Database systems are primarily concerned with the
creation and maintenance of large, long-lived collection of data,
while traditional programming languages have promoted such ideas as
procedural control and data and functional abstraction. While each
provides considerable utility in their respective domains, there
exists a large number of applications that require functionality from
both database and programming language systems. To this end, there has
been serious effort over the past few years at developing systems that
integrate the basic ideas from the two domains. This paper
concentrates on research developments which have resulted in
programming languages incorporating database functionality into their
programming models, most importantly, a concept of data persistence." ,
bibdate    =    "Wed Jan 27 04:27:16 1993" ,
owner    =    "bassili" ,
)

@article    ( CLAMEN94,
key    =    "Clamen" ,
author    =    "Clamen, S. M." ,
title    =    "Schema Evolution and Integration" ,
journal    =    "Distributed and Parallel Databases" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1994" ,
bibdate    =    "Thu Dec  1 11:05:18 1994" ,
owner    =    "kevin" ,
)

@article    ( CLAYBROOK85,
key    =    "Claybrook et al." ,
author    =    "Claybrook, Billy G. and Claybrook, Anne-Marie and
Williams, James" ,
title    =    "Defining Database Views as Data Abstractions" ,
journal    =    "IEEE Transactions on Software Engineering" ,
year    =    "1985" ,
volume    =    "SE-11" ,
number    =    "1" ,
pages    =    "3--14" ,
month    =    "January" ,
)

@article    ( CLEVELAND88,
key    =    "Cleveland" ,
author    =    "Cleveland, J. C." ,
title    =    "Building an Application Generator" ,
journal    =    "IEEE Software" ,
year    =    "1988" ,
volume    =    "5" ,
number    =    "4" ,
pages    =    "25--33" ,
month    =    "July" ,
)

@article    ( COCKSHOTT84,
key    =    "Cockshott et al." ,
author    =    "Cockshott, W. and Atkinson, M. and Chisholm, K.
and Bailey, P. and Morrison, R." ,
title    =    "Persistent Object Management Systems" ,
journal    =    "spe" ,
volume    =    "14" ,
year    =    "1984" ,
pages    =    "49--71" ,
bibdate    =    "Tue May 26 08:52:53 1987" ,
owner    =    "manning" ,
)

@article    ( CODD70,
key    =    "Codd" ,
author    =    "Codd, E. F." ,
title    =    "A Relational Model of Data for Large Shared Data
Banks" ,
journal    =    "cacm" ,
volume    =    "13" ,
year    =    "1970" ,
number    =    "6" ,
month    =    "jun" ,
pages    =    "377--387" ,
keywords=    "data bank, data base, data structure, data
organization, hierarchies of data, networks of data, relations,
derivability, redundancy, consistency, composition, join, retrieval
language, predicate calculus, security, data integrity" ,
abstract=    "Future users of large data banks must be protected
from having to know how the data is organized in the machine (the
internal representation). A prompting service which supplies such
information is not a satisfactory solution. Activities of users at
terminals and most application programs whould remain unaffected when
the internal representation of data is changed and even when some
aspects of the external representation are changed. Changes in data
representation will often be needed as a result of changes in query,
update, and report traffic and natural growth in the types of stored
information. Existing noninferential, formatted data systems provide
users with tree-structured files or slightly more general network
models of the data. In Section 1, inadequacies of these models are
discussed. A model based on n-ary relations, a normal form for data
base relations, and the concept of a universal data sublanguage are
introduced. In Section 2, certain operations on relations (other than
logical ingerence) are discussed and applied to the problems of
redundancy and consistency in the user's model." ,
)

@inbook        ( CODD72,
key    =    "Codd" ,
author    =    "Codd, E. F." ,
title    =    "Relational Completeness of Data Base Sublanguages" ,
booktitle=    "Data Base Systems" ,
publisher=    "Prentice Hall" ,
address    =    "Englewood Cliffs, N.J." ,
year    =    "1972" ,
pages    =    "65--98" ,
keywords=    "alpha" ,
series    =    "Courant Computer Symposia Series" ,
volume    =    "6" ,
annote    =    "This paper attempts to provide a theoretical basis
which may be used to determine how complete a selection capability is
provided in a proposed data sublanguage independent of any host
language in which the sublanguage is embedded. A relational algebra
and a relational calculus are defiend. An algorithm is presented for
reducing an arbitrary relation-defining expression (based on the
calculus) into a semantically equivalent expression of the relational
algebra. [abstract]" ,
bibdate    =    "Thu Jun 16 16:11:54 1983" ,
)

@inbook        ( CODD72B,
key    =    "Codd" ,
author    =    "Codd, E. F." ,
title    =    "Further Normalization of the Data Base Relational
Model" ,
booktitle=    "Data Base Systems" ,
publisher=    "Prentice Hall" ,
address    =    "Englewood Cliffs, N.J." ,
year    =    "1972" ,
series    =    "Courant Computer Symposia Series" ,
volume    =    "6" ,
bibdate    =    "Mon Jul  6 11:18:06 1992" ,
owner    =    "rts" ,
)

@inproceedings    ( CODD74,
key    =    "Codd" ,
author    =    "Codd, E. F." ,
title    =    "Recent Investigations in Relational Database
Systems" ,
booktitle=    "Proceedings of the IFIP Congress" ,
year    =    "1974" ,
bibdate    =    "Mon Jul 27 23:19:50 1992" ,
owner    =    "soo" ,
)

@article    ( CODD79,
key    =    "Codd" ,
author    =    "Codd, E.F." ,
title    =    "Extending the Database Relational Model to Capture
More Meaning" ,
journal    =    "tods" ,
month    =    "dec" ,
year    =    "1979" ,
pages    =    "397--434" ,
volume    =    "4" ,
number    =    "4" ,
bibdate    =    "Wed Dec 29 16:55:51 1982" ,
keywords=    "relation, relational database, relational model,
relational schema, database, data model, database schema, data
semantics, semantic model, knowledge representation, knowledge base,
conceptual model, conceptual schema, entity model" ,
abstract=    "During the last three or four years several
investigators have been exploring 'semantic models' for formatted
databases. The intent is to capture (in a more or less formal way)
more of the meaning of the data so that database design can become
more systematic and the database system itself can behave more
intelligently. Two major thrusts are clear: (1) the search for
meaningful units that are as small as possible - atomic semantics; (2)
the search for meaningful units that are larger than the usual n-ary
relation - molecular semantics. In this paper we propose extensions to
the relational model to support certain atomic and molecular
semantics. These extensions represent a synthesis of many ideas from
the published work in semantic modeling plus the introduction of new
rules for insertion, update, and deletion, as well as new algebraic
operators." ,
)

@article    ( CODD81,
key    =    "Codd" ,
author    =    "Codd, E.F." ,
title    =    "Data Models in Database Management" ,
journal    =    "sigmod" ,
volume    =    "11" ,
number    =    "2" ,
month    =    "feb" ,
year    =    "1981" ,
bibdate    =    "Thu Aug 11 10:38:32 1988" ,
owner    =    "" ,
)

@article    ( CODD82,
key    =    "Codd" ,
author    =    "Codd, E. F." ,
title    =    "Relational Database: A Practical Foundation for
Productivity" ,
journal    =    "Communications of the ACM" ,
year    =    "1982" ,
volume    =    "25" ,
number    =    "2" ,
pages    =    "109--117" ,
month    =    "February" ,
)

@inproceedings    ( CODD86A,
key    =    "Codd" ,
author    =    "Codd, E.F." ,
title    =    "An Evaluation Scheme for Database Management
Systems that are claimed to be Relational" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1986" ,
pages    =    "720--729" ,
abstract=    "This article offers basic principles for use in
determining how ``relational'' a DBMS product is - a challenge which
faces many buyers today, because almost every vendor is claiming that
his DBMS product is ``relational''. The material is likely to be of
interest to vendors also. Some of them may not realize how far from
the mark they are " ,
bibdate    =    "Sun Mar 30 17:14:44 1986" ,
owner    =    "rts" ,
)

@article    ( COFFMAN70,
key    =    "Coffman \& Eve" ,
author    =    "Coffman, E. and Eve, J." ,
title    =    "File Structures Using Hashing Functions" ,
journal    =    "cacm" ,
volume    =    "13" ,
number    =    "7" ,
month    =    "jul" ,
year    =    "1970" ,
pages    =    "427--432" ,
bibdate    =    "Wed Jun  5 22:12:11 1985" ,
)

@book        ( COHEN78,
key    =    "Cohen" ,
author    =    "Cohen, L." ,
title    =    "Data Base Management Systems" ,
publisher=    "Q.E.D. Information Sciences, Inc." ,
address    =    "Wellesley, MA" ,
year    =    "1978" ,
annote    =    "This book compares several DBMs, including IMS/US,
TOTAL, ADABAS, system 2000, and IDMS. Familiarity with general DB
systems is assumed, and only the differences between the particular
systems is presented." ,
bibdate    =    "Wed Jul 18 14:10:37 1984" ,
)

@article    ( COMER79,
key    =    "Comer" ,
author    =    "Comer, D." ,
title    =    "The Ubiquitous B-tree" ,
journal    =    "Computing Surveys" ,
volume    =    "11" ,
number    =    "2" ,
year    =    "1979" ,
pages    =    "121--138" ,
bibdate    =    "Tue Nov 12 16:00:01 1985" ,
)

@article    ( COMMITTEE90,
key    =    "Committee" ,
author    =    "The Committee for Advanced DBMS Function" ,
title    =    "Third-Generation Database System Manifesto" ,
journal    =    "sigmod" ,
publisher=    "Acm Press" ,
volume    =    "19" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1990" ,
pages    =    "31--44" ,
abstract=    "We call the older hierarchical and network systems
first generation database systems and refer to the current collection
of relational systems as the second generation. In this paper we
consider the characteristics that must be satisfied by the next
generation of data managers, which we call third generation database
systems. Our requirements are collected into three basis tenets with
13 more detailed propositions." ,
bibdate    =    "Thu Apr 22 11:56:37 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( CONNERS88,
key    =    "Conners \& Lyngbaek" ,
author    =    "Connors, T. and Lyngbaek, P." ,
title    =    "Providing Uniform Access to Heterogeneous
Information Bases" ,
booktitle=    "Advances in Object Oriented Database Systems 2nd
International Workshop on Object Oriented Database Systems" ,
pages    =    "163--173" ,
publisher=    "Springer-Verlag" ,
address    =    "New York" ,
month    =    "sep" ,
year    =    1988 ,
annote    =    "The application of the Iris system to serve as the
specification DBMS in a heterogeneous distributed environment. The key
concept of the paper is Iris's ability to use a function as a data
type, and the ability to define foreign functions. Thus other DBMS can
be accessed as part of an Iris DBMS by simply defining functions that
materialize the desired data as part of the Iris Schema. The main
problem shown is Iris' problem in dealing with exception conditions in
the functions." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( COPELAND84,
key    =    "Copeland \& Maier" ,
author    =    "Copeland, G. and Maier, D." ,
title    =    "Making Smalltalk a Database System" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Yormark, B." ,
address    =    "Boston, MA" ,
month    =    "jun" ,
year    =    "1984" ,
pages    =    "316--325" ,
bibdate    =    "Wed Feb 27 22:03:07 1985" ,
)

@article    ( COSMADAKIS84,
key    =    "Cosmadakis \& Papadimitriou" ,
author    =    "Cosmadakis, S.S. and Papadimitriou, C.H." ,
title    =    "Updates of Relational Views" ,
journal    =    "jacm" ,
publisher=    "acm" ,
volume    =    "31" ,
number    =    "4" ,
month    =    "oct" ,
year    =    "1984" ,
pages    =    "742--760" ,
bibdate    =    "Thu Aug  4 19:35:29 1988" ,
owner    =    "" ,
)

@inproceedings    ( CROFT87,
key    =    "Croft \& Stemple" ,
author    =    "Croft, W.B. and Stemple, D.W." ,
title    =    "Supporting Office Document Architectures with
Constrainted Types" ,
booktitle=    "Proceedings of the ACM SIGMOD Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "504--509" ,
abstract=    "Data models have been proposed as a means of
defining the objects and operations in an office information system.
Office documents, because of their highly variable structure and
multimedia content, are a difficult class of objects to model. The
modeling task is further complicated by document architectures
standards used for interchange between systems. We present an approach
to data modeling based on constrainted type definitions that allows
architecture standards to be defined and ensures that individual
documents types conform to those standards. The ADABTPL model, which
is used to define the schema of document types and standards is
described." ,
bibdate    =    "Fri Jul 24 16:55:33 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( CROKER86,
key    =    "Croker \& Maier" ,
author    =    "Croker, A. and Maier, D." ,
title    =    "A Dynamic Tree-Locking Protocol" ,
booktitle=    "International Conference on Data Engineering" ,
month    =    "feb" ,
year    =    "1986" ,
pages    =    "49--56" ,
abstract=    "The tree-locking protocol proposed by Silberschatz
and Kedem guarantees transaction schedules that are both serializable
and deadlock-free. The tree-locking protocol assumes the existence of
a partial order defined over all of the objects in a database.
Requiring all transactions to be tree-locked with respect to this
single partial order limits the degree of concurrency obtainable in a
database system by increasing the potential for conflict between
transactions. In this paper we define a new locking protocol that is
derived from the tree-locking protocol, but allows a changing set of
partial orders to be defined over the objects in a database. We call
this protocol dynamic tree-locking." ,
bibdate    =    "Wed Nov  8 07:41:00 1989" ,
owner    =    "robyn" ,
)

@article    ( CROKER87,
key    =    "Croker" ,
author    =    "Croker, A." ,
title    =    "Improvements in Database Concurrency Control with
Locking" ,
journal    =    "Journal of Management Information Systems" ,
volume    =    "4" ,
number    =    "2" ,
year    =    "1987" ,
pages    =    "74--92" ,
keywords=    "Concurrency control; two-phase locking protocol;
tree locking protocol" ,
abstract=    "Various techniques have been proposed to ensure
the safe, concurrent execution of a set of database transactions.
Locking protocols are the most prominent and widely used of these
techniques, with two-phase locking and tree locking being but two
examples of these protocols. A locking protocol defines a general set
of restrictions on the placement of lock and unlock steps within
transactions. In this paper we show that it is possible to further
increase the potential level of concurrency of a set of transactions,
within the context of a specific locking protocol, by further
restricting the placement of lock and unlock steps within each
transaction. We also discuss a variation of the tree locking protocols
that allows transactions to be locked with respect to a dynamically
changing set of tree structures. In addition, we define and discuss
the concept of a concurrency cost function for a locked transaction.
This cost function measures the potential for conflict of a
transaction with other transactions." ,
bibdate    =    "Wed Nov  8 07:33:14 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( CRUZ89,
key    =    "Cruz, \& Norvell" ,
author    =    "Cruz, Isabel F. and Norvell, Theodore S." ,
title    =    "Aggregative Closure: An Extension of Transitive
Closure" ,
booktitle=    "Proceedings of the Fifth International Conference
on Data Engineering" ,
year    =    "1989" ,
pages    =    "384--391" ,
month    =    "February" ,
)

@article    ( CZEJDO90,
key    =    "Czejdo et al." ,
author    =    "Czejdo, B. and Elmasri, R. and Rusinkiewicz, M.
and Embley, D." ,
title    =    "A Graphical Data Manipulation Language for an
Extended Entity-Relationship Model" ,
journal    =    "IEEE Computer" ,
volume    =    23 ,
pages    =    "26--36" ,
publisher=    "IEEE Press" ,
month    =    "mar" ,
year    =    1990 ,
annote    =    "A writeup is given of a graphical front end for an
ER manipulation system. The extended ER model is used which gives the
system the OO like ability to represent sub class hierarchies. The
concept is similar to Spooner-Sanderson translation-migration approach
in that the alterations specified on the schema are realized as
alterations to the associated instances." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( DADAM86,
key    =    "Dadam et al." ,
author    =    "Dadam, P. and Kuespert K. and Andersen, F. and
Blanken, H. and Erbe, R. and Guenauer, J. and Lum, V. and Pistor, P.
and Walch, G." ,
title    =    "A DBMS Prototype to Support Extended NF2
Relations: An Integrated View on Flat Tables and Hierarchies" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
address    =    "Washington, DC" ,
editor    =    "Zaniolo, C." ,
month    =    "may" ,
year    =    "1986" ,
pages    =    "356--367" ,
abstract=    "Recently, extensions for relational database
management systems (DBMS) have been proposed to support also
hierarchical structures (complex objects). These extensions have been
mainly implemented on top of an existing DBMS. Such an approach leads
to many disadvantages not only from the conceptual point of view but
also from performance aspects. This paper reports on a 3-year effort
to design and prototype a DBMS to support a generalized relational
data model, called extended NF2 (Non First Normal Form) data model
which treats flat relations, lists, and hierarchical structures in a
uniform way. The logical data model, a language for this model, and
alternatives for storage structures to implement generatlized
relations are presented and discussed." ,
bibdate    =    "Sun Sep 11 15:11:23 1988" ,
owner    =    "" ,
)

@article    ( DAMBROT90,
key    =    "Dambrot" ,
author    =    "Dambrot, Stuart" ,
title    =    "Japanese Boost Speed of Supercomputers" ,
journal    =    "The Institute" ,
year    =    "1990" ,
volume    =    "14" ,
number    =    "10" ,
pages    =    "" ,
month    =    "November" ,
)

@article    ( DANFORTH92,
key    =    "Danforth \& Valduriez" ,
author    =    "Danforth, S. and Valduriez, P." ,
title    =    "A FAD for Data Intensive Applications" ,
journal    =    "tkde" ,
volume    =    "4" ,
number    =    "1" ,
month    =    "feb" ,
year    =    "1992" ,
pages    =    "34--51" ,
keywords=    "Complex objects, data model, database programming
language, parallel database system, query optimization" ,
abstract=    "FAD is a strongly-typed database programming
language designed for uniformly manipulating transient and persistent
data on Bubba, a parallel database system developed at MCC. This paper
provides an overall description of FAD, and discusses the design
rationale behind a number of its distinguishing features. Comparisons
with other database programming languages are provided." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( DANIELS87,
key    =    "Daniels et al." ,
author    =    "Daniels, D.S. and Spector, A.Z. and Thompson, D.S." ,
title    =    "Distributed Logging for Transaction Processing" ,
booktitle=    "Proceedings of the ACM SIGMOD Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "82--96" ,
abstract=    "Increased interest in using workstations and small
processors for distributed transaction processing raises the question
of how to implement the logs needed for transaction recovery. Although
logs can be implemented with data written to duplexed disks on each
processing node, this paper argues there are advantages if log data is
written to multiple log server nodes. A simple analysis of expected
logging loads leads to the conclusion that a high performance,
microprocessor-based processing node can support a log server if it
uses efficient communication protocols and low latency, non-volatile
storage to buffer log data. The buffer is needed to reduce the
processing time per log record and to increase throughtput to the
logging disk. An interface to the log servers using simple, robust,
and efficient protocols is presented. Also described are the disk data
structures that the log servers use. This paper concludes with a brief
discussion of remaining design issues, the status of a prototype
implementation, and plans for its completion." ,
bibdate    =    "Fri Jul 24 14:03:13 1987" ,
owner    =    "manning" ,
)

@article    ( DAR93,
key    =    "Dar \& Agrawal" ,
author    =    "Dar, S. and Agrawal, R." ,
title    =    "Extending SQL with Generalized Transitive Closure" ,
journal    =    "tkde" ,
publisher=    "ieee" ,
volume    =    "5" ,
number    =    "5" ,
month    =    "oct" ,
year    =    "1993" ,
pages    =    "799--812" ,
keywords=    "Alpha-extended relational algebra; deductive
databases; recursion; SQL; transitive closure" ,
abstract=    "We present SQL/TC, an extension of SQL, to allow
the expression of generalized transitive closure queries. The
extension permits the user to pose queries that compute paths between
two points and information associated with these paths. Such queries
may specify selections on arcs, paths, or sets of paths. The output of
a query may include the aggregation of information for different paths
between the same endpoints. Our notation is declarative, preserves the
spirit of SQL, and allows a declarative and concise formulation of
transitive closure queries." ,
bibdate    =    "Sun Nov 28 15:29:39 1993" ,
owner    =    "daisyc" ,
)

@inproceedings    ( DAS95,
key    =    "Das \& Batory" ,
author    =    "Das, D. and Batory, D." ,
title    =    "Prairie: A Rule Specification Framework for Query
Optimizers" ,
booktitle=    "International Conference on Database Engineering" ,
organization=    "ieee" ,
year    =    "1995" ,
pages    =    "201--210" ,
bibdate    =    "Mon Nov 20 15:23:25 1995" ,
abstract=    "From our experience, current rule-based query
optimizers do not provide a very intuitive and well-defined framework
to define rules and actions. To remedy this situation, we propose an
extensible and structured algebraic framework called Prairie for
specifying rules. Prairie facilitates rule-writing by enabling a user
to write rules and actions more quickly, correctly and in an
easy-to-understand and easy-to-debug manner. Query optimizers consist
of three major parts: a search space, a cost model and a search
strategy. The approach we take is only to develop the algebra which
defines the search space and the cost model and use the Volcano
optimizer-generator as our search engine. Using Prairie as a
front-end, we translate Prairie rules to Volcano to validate our claim
that Prairie makes it easier to write rules. We describe our algebra
and present experimental results which show that using a high-level
framework like Prairie to design large-scale optimizers does not
sacrifice efficiency." ,
owner    =    "jeff" ,
)

@book        ( DATE83,
key    =    "Date" ,
author    =    "Date, C. J." ,
title    =    "An Introduction to Database Systems" ,
publisher=    "Addison-Wesley Pub. Co., Inc." ,
address    =    "Reading, MA" ,
year    =    "1983" ,
series    =    "Addison-Wesley Systems Programming Series" ,
volume    =    "II" ,
bibdate    =    "Tue Oct 11 20:44:15 1983" ,
)

@article    ( DATE84A,
key    =    "Date" ,
author    =    "Date, C.J." ,
title    =    "A Critique Of The SQL Database Language" ,
journal    =    "sigmod" ,
volume    =    "14" ,
number    =    "3" ,
month    =    "nov" ,
year    =    "1984" ,
pages    =    "8--54" ,
abstract=    "The ANS Database Committee is currently at work on
a proposed standard relational database language (RDL), and has
adopted as a basis for that activity a definition of the ``structured
query language'' SQL from IBM. Moreover, numberous hardware and
software vendors (in addition to IBM) have already released or at
least announced products that are based to a greater or lesser extent
on the SQL language as defined by IBM. There can thus be little doubt
that the importance of that language will increase significantly over
the next few years. Yet the SQL language is very far from perfect. The
purpose of this paper is to present a critical analysis of the
language's major shortcomings, in the hope that it may be possible to
remedy some of the deficiencies before their influence becomes too
all-pervasive. The paper's standpoint is primarily that of formal
computer languages in general, rather than that of database languages
specifically." ,
bibdate    =    "Thu Feb  7 16:01:59 1985" ,
)

@article    ( DATE84B,
key    =    "Date" ,
author    =    "Date, C.J." ,
title    =    "Some Principles of Good Language Design" ,
journal    =    "sigmod" ,
volume    =    "14" ,
number    =    "3" ,
month    =    "nov" ,
year    =    "1984" ,
pages    =    "1--7" ,
bibdate    =    "Thu Feb  7 15:49:36 1985" ,
)

@inbook        ( DATE86,
key    =    "Date" ,
author    =    "Date, C.J." ,
title    =    "Some Relational Myths Exploded: An Examination of
Some Popular Misconceptions Concerning Relational Database Management
Systems" ,
booktitle=    "Relational Database: Selected Writings" ,
publisher=    "Addison-Wesley" ,
address    =    "Reading, MA" ,
year    =    "1986" ,
chapter    =    "6" ,
pages    =    "77--123" ,
abstract=    "Relational database management is a key technology
for the 1980s, yet the field still suffers from a great deal of
misunderstanding and misrepresentation. Misconceptions abound. The
purpose of this paper is to correct some of those misconceptions." ,
bibdate    =    "Wed Sep  2 14:00:52 1987" ,
owner    =    "manning" ,
)

@inbook        ( DATE86A,
key    =    "Date" ,
author    =    "Date, C.J." ,
title    =    "The Relational Model and Its Interpretation" ,
booktitle=    "Relational Database: Selected Writings" ,
publisher=    "Addison-Wesley" ,
address    =    "Reading, MA" ,
year    =    "1986" ,
chapter    =    "8" ,
pages    =    "143--150" ,
abstract=    "This paper is not intended as yet another tutorial
on the relational model. Rather, it is a discussion of what the model
means, i.e., it is a discussion of the intended interpretation of the
model in the real world. An understanding of that interpretation is
prerequisite to intelligent use of the model. Lack of such
understanding- unfortunately not uncommon-leads to a number of
confusions, some of which are sketched briefly in the paper. Although
the paper is of course primarily concerned with the relational model
per se, many of the remarks are of a quite general nature and apply to
any data model. The reader is assumed to be familiar with the basic
concepts of the relational model." ,
bibdate    =    "Wed Sep  2 14:05:22 1987" ,
owner    =    "manning" ,
)

@inbook        ( DATE86B,
key    =    "Date" ,
author    =    "Date, C.J." ,
title    =    "Some Principles of Good Language Design with
Especial Reference to the Design of Database Languages" ,
booktitle=    "Relational Database: Selected Writings" ,
publisher=    "Addison-Wesley" ,
address    =    "Reading, MA" ,
year    =    "1986" ,
chapter    =    "13" ,
pages    =    "261--268" ,
abstract=    "The purpose of this note is to try to pull
together a list of language design principles that will serve as a
reference for database language designers and any others who might be
interested. The list is not taken from any one place but rather is
culled from a variety of sources, including computer science folklore
and ``conventional wisdom''." ,
bibdate    =    "Wed Sep  2 14:09:32 1987" ,
owner    =    "manning" ,
)

@inbook        ( DATE86C,
key    =    "Date" ,
author    =    "Date, C.J." ,
title    =    "Some Principles of Good Language Design with
Especial Reference to the Design of Database Languages" ,
booktitle=    "Relational Database: Selected Writings" ,
publisher=    "Addison-Wesley" ,
address    =    "Reading, MA" ,
year    =    "1986" ,
chapter    =    "14" ,
pages    =    "269--311" ,
abstract=    "The ANSI Database Committee-X3H2-is currently at
work on a proposed standard relational database language-RDL-and has
adopted as a basis for that activity a definition of the ``Structured
Query Language'' SQL from IBM. Moreover, numerous hardware and
software vendors-in addition to IBM- have already released or at least
announced products that are based to a greater or lesser extent on the
SQL language as defined by IBM. There can thus be little doubt that
the importance of that language will increase significantly over the
next few years. Yet the language is very far from perfect. The purpose
of this paper is to present a critical analysis of the language's
major shortcomings, in the hope that it may be possible to remedy some
of the deficiencies before their influence becomes too allpervasive.
The paper's standpoint is primarily that of formal computer languages
in general, rather than that of database languages specifically." ,
bibdate    =    "Wed Sep  2 14:10:26 1987" ,
owner    =    "manning" ,
)

@inbook        ( DATE86E,
key    =    "Date" ,
author    =    "Date, C.J." ,
title    =    "The Outer Join" ,
booktitle=    "Relational Database: Selected Writings" ,
publisher=    "Addison-Wesley" ,
address    =    "Reading, MA" ,
year    =    "1986" ,
chapter    =    "16" ,
pages    =    "335--366" ,
abstract=    "We present a discussion of the outer join
operation, together with a concrete proposal for supporting that
operation in a relational language such as SQL. We also compare our
proposal with an earlier proposal due to Chamberlin." ,
bibdate    =    "Thu Sep  3 10:05:40 1987" ,
owner    =    "manning" ,
)

@inbook        ( DATE86G,
key    =    "Date" ,
author    =    "Date, C.J." ,
title    =    "Relational Database: An Overview" ,
booktitle=    "Relational Database: Selected Writings" ,
publisher=    "Addison-Wesley" ,
address    =    "Reading, MA" ,
year    =    "1986" ,
chapter    =    "1" ,
pages    =    "3--19" ,
abstract=    "The aim of this paper is to present a brief and
very informal description of relational database systems, using SQL/DS
as a vehicle for purposes of illustration. Codd's pioneering paper on
the relational model was published in June 1970. SQL/DS, IBM's first
fully supported relational database program product, was announced in
January 1981. A secondary objective of the present paper is to give
some guidance to the vast body of literature that has grown up on the
subject in the intervening years (a Further Readings section is
included at the end of the paper). The paper consists primarily of a
distillation of material from the author's book An Introduction to
Database Systems: Volume I" ,
bibdate    =    "Sun Nov 22 17:27:20 1987" ,
owner    =    "mckenzie" ,
)

@book        ( DATE86H,
key    =    "Date" ,
author    =    "Date, C.J." ,
title    =    "An Introduction to Database Systems" ,
publisher=    "Addison-Wesley Pub. Co., Inc." ,
address    =    "Reading, MA" ,
year    =    "1986" ,
series    =    "Addison-Wesley Systems Programming Series" ,
volume    =    "I" ,
bibdate    =    "Sun Jul 24 14:50:08 1988" ,
owner    =    "" ,
)

@book        ( DATE86I,
key    =    "Date" ,
author    =    "Date, C.J." ,
title    =    "An Introduction to Database Systems" ,
publisher=    "Addison-Wesley Pub. Co., Inc." ,
address    =    "Reading, MA" ,
year    =    "1986" ,
series    =    "Addison-Wesley Systems Programming Series" ,
volume    =    "II" ,
bibdate    =    "Sun Jul 24 14:50:55 1988" ,
owner    =    "" ,
)

@inbook        ( DATE86J,
key    =    "Date" ,
author    =    "Date, C.J." ,
title    =    "A Formal Definition of the Relational Model" ,
booktitle=    "Relational Database: Selected Writings" ,
publisher=    "Addison-Wesley" ,
address    =    "Reading, MA" ,
year    =    "1986" ,
chapter    =    "7" ,
pages    =    "125--141" ,
abstract=    "The relational model of data, originally
introduced by Codd, has threee components: (1) a set of objects
(relations, domains, etc.); (2) a set of operators (union, project,
etc.); (3) a set of general integrity rules. The purpose of this paper
is to provide a formal definition of each of these three components." ,
bibdate    =    "Thu Aug 11 10:43:45 1988" ,
owner    =    "" ,
)

@article    ( DATE88,
key    =    "Date" ,
author    =    "Date, C.J." ,
title    =    "A Proposal for Adding Date and Time Support to SQL" ,
journal    =    "SIGMOD Record" ,
publisher=    "ACM" ,
volume    =    "17" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1988" ,
pages    =    "53--76" ,
bibdate    =    "Tue Jul 19 16:31:57 1988" ,
owner    =    "" ,
abstract=    "The question of defining data types in a database
language is examined. In order to illustrate the general ideas and
make them more concrete, the specific case of adding support for dates
and times to the database language SQL is considered in detail." ,
)

@article    ( DATE89,
key    =    "Date" ,
author    =    "Date, C. J." ,
title    =    "A Note On The Relational Calculus" ,
journal    =    "sigmod" ,
volume    =    "18" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1989" ,
pages    =    "12--16" ,
abstract=    "We examine a logical anomaly in Codd's relational
calculus [1], according to which queries can occasionally return
somewhat surprising results." ,
bibdate    =    "Fri Dec 29 15:37:35 1989" ,
owner    =    "robyn" ,
)

@article    ( DATE89A,
key    =    "Date" ,
author    =    "C. J. Date" ,
title    =    "An Overview of SQL2" ,
journal    =    "Info. Database" ,
volume    =    "4" ,
number    =    "1" ,
month    =    "Spring" ,
year    =    "1989" ,
pages    =    "8--12" ,
keywords=    "SQL" ,
bibdate    =    "Fri Mar 22 11:15:09 1991" ,
owner    =    "suchen" ,
)

@article    ( DATE92,
key    =    "Date \& Fagin" ,
author    =    "Date, C.J. and Fagin, R." ,
title    =    "Simple Conditions for Guaranteeing Higher Normal
Forms in Relational Databases" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "17" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1992" ,
pages    =    "465--476" ,
keywords=    "Boyce-Codd normal form; BCNF; database design;
fifth normal form; 5NF; forth normal form; 4NF; functional dependency;
join dependency; projection-join normal form; PJ/NF; multivalued
dependency; normalization; relational database; simple key" ,
abstract=    "A key is simple if it consists of a single
attribute. It is shown that if a relation schema is in third normal
form and every key is simple, then it is in projection-join normal
form (sometimes called fifth normal form), the ultimate normal form
with respect to projections and joins. Furthermore, it is shown that
if a relation schema is in Boyce-Codd normal form and some key is
simple, then it is in fourth normal form (but not necessarily
projection-join normal form). These results give the database designer
simple sufficient conditions, defined in terms of functional
dependencies alone, that guarantee that the schema being designed is
automatically in higher normal forms." ,
bibdate    =    "Mon Oct 26 20:59:33 1992" ,
owner    =    "leoso" ,
)

@inproceedings    ( DAVIS85A,
key    =    "Davis \& Arora" ,
author    =    "Davis, K. and Arora, A." ,
title    =    "A Methodology for Translating a Conventional File
System into an Entity Relationship Model" ,
booktitle=    "Proceedings 1985 International Conference on the
Entity Relationship Approach" ,
pages    =    "148--159" ,
publisher=    "IEEE Press" ,
address    =    "New York" ,
year    =    1985 ,
annote    =    "Some early work on a base set of translation
primitives. Some good examples of equivalent structures represented by
different ER graphs." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( DAYAL78,
key    =    "Dayal \& Bernstein" ,
author    =    "Dayal, Umeshwar and Bernstein, Philip A." ,
title    =    "On the Updatability of Relational Views" ,
booktitle=    "Proceedings of the Fourth International Conference
on Very Large Data Bases" ,
year    =    "1978" ,
pages    =    "368--377" ,
month    =    "" ,
)

@inproceedings    ( DAYAL82,
key    =    "Dayal et al." ,
author    =    "Dayal, U. and Goodman, N. and Katz, R.H." ,
title    =    "An Extended Relational Algebra with Control Over
Duplicate Elimination" ,
booktitle=    "pods" ,
address    =    "Los Angeles, CA" ,
month    =    "mar" ,
year    =    "1982" ,
pages    =    "117--123" ,
abstract=    "In the pure relational model, duplicate tuples are
automatically eliminated. Some real world languages such as DAPLEX,
however, give users control over duplicate elimination. This papers
extends the relational model to include multiset relations, i.e.,
relations with duplicate tuples. It considers three formalisms for
expressing queries in this model: extended relational algebra,
tableaus, and DAPLEX. It shows that, as in the original algebra, the
equivalence problem for conjunctive expressions in the extended
algebra can be solved using tableaux, and is NP-complete. Finally, it
demonstrates that the extended algebra and DAPLEX have essentially the
same expressiveness relative to conjunctive expressions." ,
bibdate    =    "Mon Jan 19 14:21:40 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( DAYAL82B,
key    =    "Dayal \& Goodman" ,
author    =    "Dayal, U. and Goodman, N." ,
title    =    "Query Optimization for CODASYL Database Systems" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
address    =    "Orlando, FL" ,
editor    =    "Schkolnick, M." ,
month    =    "jun" ,
year    =    "1982" ,
pages    =    "138--150" ,
abstract=    "One of the tasks of MULTIBASE, a system for
integrated access to heterogeneous distributed databases, is to
present a high-level query interface to navigational systems such as
CODASYL. The interface compiles queries into efficient programs that
implement the queries. The principal problem in constructing such an
interface is access path optimization, i.e., the selection of an
optimal sequence of access paths that must be traversed to process a
given query. This paper identifies a class of queries for which
efficient programs can be synthesized. It characterizes the strategies
for processing a given query, and shows how to synthesize a program
for implementing each strategy. It develops a model for estimating the
cost of executing a program, and uses this model to find the optimal
strategy for processing a given query." ,
bibdate    =    "Thu Nov 19 21:04:43 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( DAYAL87,
key    =    "Dayal" ,
author    =    "Dayal, U." ,
title    =    "Of Nests and Trees: A Unified Approach to
Processing Queries that Contain Nested Subqueries, Aggregates, and
Quantifiers" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
editor    =    "Hammersley, P." ,
month    =    "sep" ,
year    =    "1987" ,
pages    =    "197--208" ,
abstract=    "Existing query optimizers focus on
Restrict-Project-Join queries. In practice, however, query languages
such as SQL and DAPLEX have many powerful features (eg., control over
duplicates, nested subqueries, grouping, aggregates, and quantifiers)
that are not expressible as sequences of Restrict, Project, and Join
operations. Existing optimizers are severely limited in their
strategies for processing such queries; typically they use only tuple
substitution, and process nested subquery blocks top down. Tuple
substitution, however, is generally inefficient and especially so when
the database is distributed. Hence, it is imperative to develop
alternative strategies. This paper introduces new operations for these
difficult features, and describes implementation methods for them.
From the algebraic properties of these operations, new query
processing tactics are derived. It is shown how these new tactics can
be deployed to greatly increase the space of interesting strategies
for optimization, without seriously altering the architecture of
existing optimizers. The contribution of the paper is in demonstrating
the feasibility and desirability of developing an integrated framework
for optimizing all of SQL or other query languages that have similar
features." ,
bibdate    =    "Thu Apr 28 17:49:22 1988" ,
owner    =    "" ,
)

@inproceedings    ( DAYAL88,
key    =    "Dayal et al" ,
author    =    "Dayal, U. and Blaustein, B. and Buchmann, A. and
Chakravarthy, U. and Hsu, M. and Ledin, R. and McCarthy, D. and
Rosenthal, A. and Sarin, S. and Carey, M. J. and Livny, M. and
Jauhari, R." ,
title    =    "The HiPAC project: Combining active databases and
timing constraints" ,
booktitle=    "sigmod" ,
month    =    "mar" ,
year    =    "1988" ,
pages    =    "51--70" ,
bibdate    =    "Tue Nov  7 15:30:03 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( DAYAL88A,
key    =    "Dayal" ,
author    =    "Dayal, U." ,
title    =    "Active Database Management Systems" ,
booktitle=    "Proceedings of the Third International Conference
on Data and Knowledge Bases" ,
organization=    "Information Processing Association of Israel" ,
publisher=    "Morgan Kaufmann" ,
address    =    "San Matheo, CA" ,
editor    =    "Beeri, C. and Schmidt, J.W. and Dayal, U." ,
month    =    "jun" ,
year    =    "1988" ,
pages    =    "150--169" ,
abstract=    "Conventional passive database management systems
are inadequate for time-constrained applications, because they either
do not provide timely response to critical situations or compromise
modularity. Active database management systems attempt to provide both
modularity and timely response, by allowing event-condition-action
rules to be specified declaratively; when events of interest occur,
they efficiently evaluate the corresponding conditions, and if these
conditions are satisfied, they trigger the corresponding actions. The
development of active database management systems requires the
solution of a number of research problems in the areas of knowledge
modelling, execution modelling, condition monitoring, scheduling,
system architecture, and performance evaluation. This paper describes
the principal research issues in each of these areas, surveys the
approaches being taken in a number of research projects on active
DBMSs, and emphasizes the approaches we are taking in the HiPAC (High
Performance ACtive DBMS) project." ,
bibdate    =    "Fri Sep  4 16:13:01 1992" ,
owner    =    "leoso" ,
)

@inproceedings    ( DAYAL89,
key    =    "Dayal" ,
author    =    "Dayal, U." ,
title    =    "Queries and Views in an Object-Oriented Data Model" ,
booktitle=    "Proceedings of the 2nd Workshop on Database
Programming Languages" ,
year    =    "1989" ,
bibdate    =    "Sat Apr 25 16:34:25 1992" ,
owner    =    "soo" ,
)

@inbook        ( DAYAL91,
key    =    "Dayal" ,
author    =    "Dayal, U." ,
title    =    "Summary" ,
booktitle=    "On Object-Oriented Database Systems" ,
publisher=    "Springer-Verlag" ,
address    =    "Berlin Heidelberg" ,
year    =    "1991" ,
chapter    =    "23" ,
pages    =    "379--383" ,
bibdate    =    "Fri Aug 28 16:20:03 1992" ,
owner    =    "leoso" ,
)

@techreport    ( DECKER89,
key    =    "Decker" ,
author    =    "Decker, L. and Mayer, R." ,
title    =    "{\it IISyCL} Language Reference" ,
number    =    "KBSL-89-1002" ,
institution=    "Texas A and M University" ,
address    =    "College Station Texas" ,
month    =    "oct" ,
year    =    1989 ,
annote    =    "Definition of the IISyCL system. Designed to aid
in translation. It is a meta-meta data model. Object Oriented in that
it models both data and its associated behavior. Designed to let the
user set up IISyCL models that correspond to existing data transfer
models. Weak on the details of just how a new format is to be set up." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( DEEN85,
key    =    "Deen" ,
author    =    "Deen, S.M." ,
title    =    "DEAL: A Relational Language with Deductions,
Functions and Recursions" ,
journal    =    "Data and Knowledge Engineering" ,
volume    =    "1" ,
year    =    "1985" ,
bibdate    =    "Tue May 21 15:37:13 1991" ,
owner    =    "rts" ,
)

@inproceedings    ( DELCAMBRE88,
key    =    "Delcambre \& Etheredge" ,
author    =    "Delcambre, Lois M. L. and Etheredge, James N." ,
title    =    "The Relational Production Language: A Production
Language for Relational Databases" ,
booktitle=    "Proceedings from the Second International
Conference on Expert Database Systems" ,
year    =    "1988" ,
pages    =    "153--162" ,
month    =    "" ,
)

@techreport    ( DELIS91,
key    =    "Delis \& Roussopoulos" ,
author    =    "Delis, A. and Roussopoulos, N." ,
title    =    "Performance Comparison of Three Modern DBMS
Architectures" ,
number    =    "CS--TR--2679" ,
institution=    "University of Maryland" ,
address    =    "College Park, Maryland" ,
year    =    "1991" ,
month    =    "may" ,
abstract=    "The introduction of powerful workstations
connected through LAN networks inspired new DBMS architectures which
offer high performance characteristics. In this paper, we examine
three such architecture configurations, namely: Client-Server (CS),
RAD-Unify type of DBMS (RU) and Enhanced Workstation-Server (EWS).
Their specific functional components and design rationales are
discussed. We use three simulation models to provide a performance
comparison under different transaction workloads. Our simulation
results show that the RU almost always performs slightly better that
the CS, especially under heavy workloads, and that EWS offers
significant performance improvement over both CS and RU. Under
reasonable update rates, the EWS over CS (or RU) performance tation is
almost proportional to the number of participating workstations (for
less than 32 workstations). We also examine the impact of certain key
parameters on the performance of the three architectures and finally
show that EWS is more scalable than the other two." ,
bibdate    =    "Sun Oct 27 11:43:53 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( DEMO85,
key    =    "Demo \& Kundu" ,
author    =    "Demo, G.B. and Kundu, S." ,
title    =    "Analysis Of The Context Dependency Of Codasyl
Find-Statements With Application To Database Program Conversion" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "354--361" ,
bibdate    =    "Wed Jun 12 11:47:51 1985" ,
)

@techreport    ( DEMURJIAN89,
key    =    "Demurjian and Ellis" ,
author    =    "Demurjian, Steven A. and Heidi J. Ellis" ,
title    =    "The storage and Management of Software in an
Object-Oriented Database System to Support Program Questioning" ,
number    =    "CSE-TR-89-26" ,
institution=    "Computer Science and Engineering Department
University of Connecticut" ,
address    =    "Box U-155, 260 Glenbrook Road University of
Connecticut Storrs, CT 06269-3155" ,
year    =    "1989" ,
pages    =    "24" ,
abstract=    "Improving the software-development process through
the integration of CASE tools into a cohesive environment has drawn
the attention of researchers in recent years.By incorporating database
system support within these CASE environments (CASEE), we can offer a
variety of new features that enhance the software-development process,
namely, transaction support for multiple, concurrent users, integrity
for data consistency, security to control data access, and recovery in
the event of system failure. Moreover, since database systems are
adept at answering questioins, it may now be possible to augment a
CASSEE with a new capability: the ability to quiz and analyze the
software for relevant and pertinent program characteristics. In
particular, we are interested in formulating, posing, and answering
questioons about software that is under development. The answers to
these questions can then be utilized to find-tune the program
performance, identify and track software bugs, and to integrate
separately-developed software components (i.e., modules) into a
complete system The ultimate utility of such a capability will result
in an improvement of the development process as well as aa reduction
of the development time, thereby leading to more successful system
development and integration. The work in this paper investigates the
issues and concerns which are necessary to support program questioning
during the software-development process. Sepcifically, our goal is in
storing programs as structured collections of objects, in an
object-oriented databaase system (i.e., Gemstone by Servo-Logic,
Inc.), to support program questioning. To satisfy this goal, this
paper examines related work for program storage/questioning, presents
a taxonomy of five categories of progra questions, discussees a design
strategy for storing programs as objects using the Opal
object-oriented programming/database language, proposes possible
structures for program questioning tools, and offers some concluding
remarks on our current and related work." ,
bibdate    =    "Fri Oct  4 09:16:49 1991" ,
owner    =    "suchen" ,
)

@techreport    ( DEMURJIAN90,
key    =    "Demurjian et al." ,
author    =    "Demurjian, Steven A. and George McA. Beshers and
Greg Nichols" ,
title    =    "Object-Oriented Database Support for
Software-Development Environments" ,
number    =    "CSE-TR-90-10" ,
institution=    " Computer Science and Engineering Department
University of Connecticut" ,
address    =    "Box U-155, 260 Glenbrook Road University of
Connecticut Storrs, CT 06269-3155" ,
year    =    "1990" ,
pages    =    "39" ,
bibdate    =    "Fri Oct  4 09:01:19 1991" ,
owner    =    "suchen" ,
)

@inbook        ( DEPPISH,
key    =    "Deppish et al." ,
author    =    "Deppisch, U. and Paul, H.-B. and Schek, H.-J. and
Weikum, G." ,
title    =    "Managing Complex Objects in the Darmstadt Database
Kernel System" ,
booktitle=    "On Object-Oriented Database Systems" ,
publisher=    "Springer-Verlag" ,
address    =    "Berlin Heidelberg" ,
year    =    "1991" ,
chapter    =    "22" ,
pages    =    "357--375" ,
abstract=    "Complex objects are required in many new
applications of databases. A common feature is that objects use other
(sub-)objects for their description. So, retrieval or update of
complex objects may include some or all of their subobjects. The
kernel of DASDBS, the DArmStadt DataBase System, is described which
was designed and implemented with the objective to provide a storage
system for a variety of complex object notions. This paper
concentrates on the mapping of hierachically structured complex
records to sets of pages and shows how set-orientation in the
operations at the kernel interfaces can be preserved and transformed
to operations on sets of pages." ,
bibdate    =    "Fri Aug 28 16:17:24 1992" ,
owner    =    "leoso" ,
)

@misc        ( DERRETT91,
key    =    "Derrett" ,
author    =    "Derrett, Nigel" ,
title    =    "Private Communication" ,
year    =    "1991" ,
month    =    "January" ,
)

@article    ( DEUX90,
key    =    "Deux et al." ,
author    =    "Deux, O." ,
title    =    "The Story of O2" ,
journal    =    "tkde" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1990" ,
pages    =    "91--108" ,
keywords=    "Complex objects, data model, database programming
language, database system, object-oriented database system,
object-oriented system, OODBS, programming environment, user
interface." ,
abstract=    "This is a complete description of the O2 system.
O2 is an object-oriented database system. It thus has the
functionality of a DBMS (persistence, disk mangement, sharing, and
query language) and that of an object-oriented system (complex
objects, object identy, encapsulation, typing, inheritance,
overriding, extensibility, and completeness). It also includes a set
of usr interface generation tools and a complete programming
environment. O2 supports a multilanguage paradigm, a dual mode of
operation(development and execution), and operates on a
workstative/server configuration. We describe the system as seen from
the programmer's point of view, and as seen through the programming
environment. we also provide a complete description of the
implementation. Finally, we give an evaluation of the protptype
performance." ,
bibdate    =    "Sun Aug  4 15:02:08 1991" ,
owner    =    "bib" ,
)

@article    ( DEUX91,
key    =    "Deux et al." ,
author    =    "Deux, O. et al." ,
title    =    "The O2 System" ,
journal    =    "cacm" ,
volume    =    "34" ,
number    =    "10" ,
month    =    "Oct" ,
year    =    "1991" ,
pages    =    "34 --49" ,
abstract=    "The O2 system is an objected-oriented database
management system (OODBMS) with a complete development environment and
a set of user interface tools. As an OODBMS, it satisfies the rules of
[2] as do other systems such as Orion, Iris or GemStone" ,
bibdate    =    "Sun Nov  3 23:16:54 1991" ,
owner    =    "suchen" ,
)

@article    ( DEWAN91,
key    =    "Dewan" ,
author    =    "Dewan, Prasun" ,
title    =    "An Inheritance Model for Supporting Flexible
Displays of Data Structures" ,
journal    =    "Software-Practice and Experience. " ,
volume    =    "21" ,
number    =    "7" ,
month    =    "Jul" ,
year    =    "1991" ,
pages    =    "719--738" ,
keywords=    "Inheritance Program visualization User intervace
development environments" ,
abstract=    "We have designed an inheritance model that reduces
the effort required to define presentations of data structures of
programs written in conventional languages. It assumes that the
presentation of a data structure is determined by ony or more
attributes of the data structure; classifies data structures into
several groups based on their types, contexts, siblings, ancestors and
other properties; and allows an attribute to be defined once for all
members of a group. These groups are arranged in multiple intersetiong
hierarchies, and a subgroup is allowed to inherit attributes from its
supergroups(s). This paper motivates, describes, and illustrates our
method of grouping vallues and arranging the vallue groups in
inheritance hierarchies." ,
bibdate    =    "Wed Dec 11 09:48:32 1991" ,
owner    =    "suchen" ,
)

@techreport    ( DEWITT84,
key    =    "DeWitt et al." ,
author    =    "DeWitt, D.J. and Katz, R.H. and Olken, F. and
Shapiro, L.D. and Stonebraker, M.R. and Wood, D." ,
title    =    "Implementation Techniques for Main Memory Database
Systems" ,
number    =    "UCB/ERL 84/5" ,
institution=    "Electronics Research Laboratory, University of
California" ,
address    =    "Berkeley, CA" ,
year    =    "1984" ,
month    =    "jan" ,
pages    =    "1--23" ,
keywords=    "Main Memory Databases, Access Methods, Join
Algorithms, Access Planning, Recovery Mechanisms" ,
abstract=    "With the availability of very large, relatively
inexpensive main memories, it is becoming possible to keep large
databases resident in main memory. In this paper we consider the
changes necessary to permit a relational database system to take
advantage of large amounts of main memory. We evaluate AVL vs. B+-tree
access methods for main memory databases, hash-based query processing
strategies vs. sort-merge, and study recovery issues when most or all
of the database fits in main memory. As expected, B+-trees are the
preferred storage mechanism unless more than 80-90\% of the database
fits in main memory. A somewhat surprising result is that hash based
query processing strategies are advantageous for large memory
situations." ,
bibdate    =    "Mon Jul 28 12:25:16 1986" ,
owner    =    "manning" ,
)

@inproceedings    ( DEWITT84A,
key    =    "DeWitt" ,
author    =    "DeWitt, D.~J. and Katz, R.~H. and Olken, F. and
Shapiro, L.~D. and Stonebraker, M.~R. and Wood, D." ,
title    =    "Implementation Techniques for Main Memory Database
Systems" ,
booktitle=    "Proceedings of the ACM SIGMOD International
Conference on Management of Data" ,
month    =    "jun" ,
year    =    "1984" ,
pages    =    "1--8" ,
bibdate    =    "Wed Jun 28 17:41:31 1995" ,
owner    =    "soo" ,
)

@article    ( DEWITT90,
key    =    "DeWITT et al." ,
author    =    "DeWitt, David J. and Shaharm Ghandeharizadeh and
Donovan A. Schneider and Allan Bricker and Hui-i Hsiao and Rick
Rasmusen" ,
title    =    "The Gamma Database Machine Project" ,
journal    =    "tkde" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1990" ,
pages    =    "44--62" ,
keywords=    "database machines, dataflow query processing,
distributed database systems, parallel algorithms, relational database
systems." ,
abstract=    "This paper describes the design of the Gamma
database machine and the techniques employed in its implementation.
Gamma is a relational database machine currently operating on an intel
iPSC/2 hpercube with 32 processors and 32 disk drives. Gamma employs
three key technical ideas which enable the architecture to be scaled
to hundreds of processors. First, all relations are horizontally
partitioned across multiple disk drives enabling relations to be
scanned in parallel. second, novel parallel algorithms based on
hashing are used to implement the complex relational operators such as
join and aggregate functions. Third, dataflow scheduling techniques
are used to coordinate multioperator queries. By using these
techniques it is possible to contol the execution of very complex
queries with minimal coordination- a necessity for configurations
involving a very large number of processors. In addition to describing
the design of the gamma software, a thorough performance evaluation of
the iPSC/2 hypercube version of /Gamma is also preseted. in addition
to measjuuring the effect of relation size and indexes on the response
time for selection, join, aggregation, and update queries, we also
analyze the performance of gamma relative to the numver of processors
employed when the sizes of the input relations and kept constant
(speedup) and when the sizes of the input relations are increased
proportionally to the number of processors(scaleup). The spedup
results obrainedd for both selection and join qeries are linear; thus,
doubling the number of processors halves the response time for a
query. The scaleup results obtained are also quite encouraging.
theyreveal the a nearly constant resp[pnse time can be maintained for
both selection and join queries as the workload is increased by adding
a proportional number of processors and disks. " ,
bibdate    =    "Sun Aug  4 13:52:39 1991" ,
owner    =    "bib" ,
)

@article    ( DEWITT90A,
key    =    "DeWitt \& Gray" ,
author    =    "DeWitt, D. and Gray, J." ,
title    =    "Parallel Database Systems: The Future of Database
Processing or a Passing Fad?" ,
journal    =    "sigmod" ,
volume    =    "19" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1990" ,
pages    =    "104--112" ,
abstract=    "The concept of parallel database machines
consisting of exotic hardware has been replaced by a fairly
conventional shared-nothing hardware base along with a highly parallel
dataflow software architecture. Such a design provides speedup and
scaleup in processing relational database queries. This paper reviews
the techniques used by such systems, and surveys current commercial
and research systems." ,
bibdate    =    "Sun Jan 19 21:11:02 1992" ,
owner    =    "soo" ,
)

@inproceedings    ( DEWITT91,
key    =    "DeWitt et al." ,
author    =    "DeWitt, D. and Naughton, J. and Schneider, D." ,
title    =    "An Evaluation of Non-Equijoin Algorithms" ,
booktitle=    "vldb" ,
year    =    "1991" ,
pages    =    "443--452" ,
abstract=    "A non-equijoin of relations R and S is a band join
if the join predicate requires values in the join attribute of R to
fall within a specified band about the values in the join attribute of
S. We propose a new algorithm, termed a partitioned band join, for
evaluating band joins. We present a comparison between the partitioned
band join algorithm and the classical sort-merge join algorithm
(optimized for band joins) using both an analytical model and an
implementation on top of the WiSS storage system. The results show
that the partitioned band join algorithm outperforms sort-merge unless
memory is scarce and the operands of the join are of equal size. We
also describe a parallel implementation of the partitioned band join
on the Gamma database machine, and present data from speedup and
scaleup experiments demonstration that the partitioned band join is
efficiently implementable." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@techreport    ( DEWITT91A,
key    =    "DeWitt et al." ,
author    =    "DeWitt, D.J. and Naughton, J.F. and Schneider,
D.A." ,
title    =    "An Evaluation of Non-Equijoin Algorithms" ,
number    =    "1011" ,
institution=    "University of Wisconsin-Madison" ,
year    =    "1991" ,
month    =    "February" ,
bibdate    =    "Sun Aug  9 18:41:29 1992" ,
owner    =    "bib" ,
)

@article    ( DEWITT92,
key    =    "DeWitt \& Gray" ,
author    =    "DeWitt, D. and Gray, J." ,
title    =    "Parallel Database Systems: The Future of High
Performance Database Systems" ,
journal    =    "cacm" ,
publisher=    "ACM Press" ,
volume    =    "35" ,
number    =    "6" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "85--98" ,
bibdate    =    "Mon Oct  5 19:23:17 1992" ,
owner    =    "leoso" ,
)

@article    ( DHAR88,
key    =    "Dhar \& Croker" ,
author    =    "Dhar, V. and Croker, A." ,
title    =    "Knowledge-Based Decision Support in Business:
Issues and a Solution" ,
journal    =    "IEEE Expert" ,
year    =    "1988" ,
pages    =    "53--62" ,
bibdate    =    "Tue Nov  7 16:03:42 1989" ,
owner    =    "robyn" ,
)

@article    ( DIEDRICH91,
key    =    "Diedrich \& Milton" ,
author    =    "Diedrich, J. and Milton, J." ,
title    =    "Creating Domain Specific Metadata for Scientific
Data and Knowledge Bases" ,
journal    =    "tkde" ,
volume    =    3 ,
pages    =    "421--443" ,
month    =    "dec" ,
year    =    1991 ,
annote    =    "Discussion about how to recognize a domain of
discourse for a given subject area. Written using the AI terminology." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( DITTRICH86B,
key    =    "Dittrich" ,
author    =    "Dittrich, K.R." ,
title    =    "Object-oriented Database Systems: the Notion and
the Issues (Extended Abstract)" ,
booktitle=    "Proceedings of the 1986 International Workshop on
Object-Oriented Database Systems" ,
organization=    "ACM; IEEE" ,
publisher=    "Computer Society Press" ,
address    =    "Pacific Grove, CA" ,
editor    =    "Dittrich, K. and Dayal, U." ,
month    =    "sep" ,
year    =    "1986" ,
pages    =    "2--4" ,
bibdate    =    "Thu Nov 20 11:08:21 1986" ,
owner    =    "manning" ,
)

@article    ( DITTRICH88,
key    =    "Dittrich \& Lorie" ,
author    =    "Dittrich, Klaus R. and Lorie, Raymond A." ,
title    =    "Version Support for Engineering Database Systems" ,
journal    =    "IEEE Transactions on Software Engineering" ,
year    =    "1988" ,
volume    =    "14" ,
number    =    "4" ,
pages    =    "429--437" ,
month    =    "April" ,
)

@inproceedings    ( DIXON87,
key    =    "Dixon \& Shrivastava" ,
author    =    "Dixon, G.N. and Shrivastava, S.K." ,
title    =    "Exploiting Type Inheritance Facilities to
Implement Recoverability in Object Based Systems" ,
booktitle=    "Proceedings of the Sixth Symposium on Reliability
in Distributed Software and Database Systems" ,
organization=    "IEEE" ,
address    =    "Williamsburgh, VA" ,
month    =    "mar" ,
year    =    "1987" ,
bibdate    =    "Thu May 12 13:35:43 1988" ,
owner    =    "" ,
)

@article    ( DOLK87,
key    =    "Dolk \& Kirsch" ,
author    =    "Dolk, D.R. and Kirsch, R.A., II" ,
title    =    "A Relational Information Resource Dictionary
System" ,
journal    =    "cacm" ,
publisher=    "acm" ,
volume    =    "30" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1987" ,
pages    =    "48--61" ,
bibdate    =    "Tue Jan 20 12:01:54 1987" ,
owner    =    "manning" ,
)

@techreport    ( DONAHUE86,
key    =    "Donahue et al." ,
author    =    "Donahue, J. and Hauser, C. and Kent, J." ,
title    =    "A Client Interface to an Entity-Relationship
Database System" ,
number    =    "CSL-86-4" ,
institution=    "Xerox Corporation" ,
address    =    "Palo Alto Research Center, Palo Alto, CA" ,
year    =    "1986" ,
month    =    "sep" ,
pages    =    "1--29" ,
keywords=    "Database programming languages;
entity-relationship databases" ,
abstract=    "This paper presents the design of an interface,
written in the Cedar language, for an entity-relationship data model
database system (the database system is called Cypress). We discuss
some of the design decisions that need to be made when building such
an interface. This interface has been used to implement a number of
database applications in the Cedar environment. The material presented
in this paper can be seen in two lights. First, it continues the
development of ``database programming languages.'' The novel aspect of
the work in this regard is its use of the type structure and interface
definition facility of the Cedar language to syntactic extensions to
the underlying language. The second (and more interesting) aspect of
the work reported here is that we give a completely operational
description of an entity-relationship data model. The paper discusses
several advantages of this approach over a purely relational system." ,
bibdate    =    "Fri Aug 21 14:47:36 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( DOSCH82,
key    =    "Dosch et al." ,
author    =    "Dosch, Walter and Mascari, Gianfranco and Wirsing,
Martin" ,
title    =    "On the Algebraic Specification of Databases" ,
booktitle=    "Proceedings of the Eighth International Conference
on Very large Data Bases" ,
year    =    "1982" ,
pages    =    "370--385" ,
month    =    "September" ,
)

@inproceedings    ( DREW90,
key    =    "Drew et al." ,
author    =    "Drew, Pamela and King, Roger and Hudson, Scott" ,
title    =    "The performance and Utility of the Cactis
Implementation Algorithms" ,
booktitle=    "Proceedings of the Sixteenth International
Conference on Very Large Data Bases" ,
year    =    "1990" ,
pages    =    "135--147" ,
month    =    "August" ,
)

@article    ( DREW92,
key    =    "Drew et al." ,
author    =    "Drew, P. and King, R. and Heimbigner, D." ,
title    =    "A Toolkit for Incremental Implementation of
Heterogeneous Database Management Systems" ,
journal    =    "The VLDB Journal" ,
publisher=    "VLDB Endowment" ,
volume    =    "1" ,
number    =    "2" ,
month    =    "oct" ,
year    =    "1992" ,
pages    =    "241--284" ,
keywords=    "Heterogeneous databases; extensible database; open
architectures; reconfigurable architectures; incremental integration;
heterogeneous transaction management; database toolkits" ,
abstract=    "The integration of heterogeneous database
environments is a difficult and complex task. The A la carte Framework
addresses this complexity by providing a reusable and extensible
architecture in which a set of heterogeneous database management
systems can be integrated. The goal is to support incremental
integration of existing database facilities into heterogeneous,
interoperative, distributed systems. The Framework addresses the three
main issues in heterogeneous systems integration. First, it identifies
the problems in integrating heterogeneous systems. Second, it
identifies the key interfaces and parameters required for autonomous
systems to interoperate correctly. Third, it demonstrates an approach
to integrating these interfaces in an extensible and increment way.
The A la carte Framework provides a set of reusable, integrating
components which integrate the major functional domains, such as
transaction management, that could or should be integrated in
heterogeneous systems. It also provides a mechanism for capturing key
characteristics of the components and constraints which describe how
the components can be mixed and interchanged, thereby helping to
reduce the complexity of the integration process. Using this
framework, we have implemented an experimental, heterogeneous
configuration as part of the object management work in the software
engineering research consortium, Arcadia." ,
bibdate    =    "Thu Jan 28 11:56:27 1993" ,
owner    =    "bassili" ,
)

@article    ( DU91,
key    =    "Du \& Tong" ,
author    =    "Du, D.H.C. and Tong, S.--R." ,
title    =    "Multilevel Extendible hashing: A File Structure
for Very Large Databases" ,
journal    =    "tkde" ,
publisher=    "IEEE" ,
volume    =    "3" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1991" ,
pages    =    "357--370" ,
abstract=    "Hashing schemes have been found to be one of the
useful access methods for physical database system implementation. In
the last decade several schemes have been proposed to extend the
applicability of hashing methods to dynamic files. When a very large
database system is considered, besides the space utilization and the
retrieval time of the directory also become a major concern. In this
paper, we propose a new dynamic hashing scheme, based on extendible
hashing, whose directory can grow into a multilevel directory. We
compare the proposed scheme to two other schemes, the Extendible
hashing and the Extendible Hashing Tree schemes. The simulation
results reveal that the proposed scheme is superior than the other two
in the aspect of directory space utilization, especially for files
with nonuniform record distribution. Furthermore, this scheme can be
easily extended to multikey file systems and also has good
performance." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( DUCHAMP89,
key    =    "Duchamp" ,
author    =    "Duchamp, D." ,
title    =    "Analysis of Transaction Management Performance" ,
booktitle=    "Proceedings of the Twelfth ACM SOSP" ,
volume    =    "23" ,
month    =    "dec" ,
year    =    "1989" ,
pages    =    "177--190" ,
address    =    "Litchfield Park, AZ" ,
abstract=    "There is currently much interest in incorporating
transactions into both operating systems and general-purpose
programming languages. This paper provides a detailed examination of
the design and performance of the transaction manager of the Camelot
system. Camelot is a transaction facility that provides a rich model
of transactions intended to support a wide variety of general-purpose
applications. The transaction manager's principal function is to
execute the protocols that ensure atomicity. The conclusions of this
study are: a simple optimization to two-phase commit reduces logging
activity of distributed transactions; non-blocking commit is practical
for some applications; multithreaded design improves throughput
provided that log batching is used; multicasting reduces the variance
of distributed commit protocols in a LAN environment; and the
performance of transaction mechanisms such as Camelot depend heavily
upon kernel performance." ,
bibdate    =    "Fri Jan 12 09:04:31 1990" ,
owner    =    "robyn" ,
)

@article    ( EASTON86,
key    =    "Easton" ,
author    =    "Easton, M." ,
title    =    "Key-Sequence Data Sets on Indelible Storage" ,
journal    =    "IBM Journal of Research Development" ,
publisher=    "IBM" ,
volume    =    "30" ,
number    =    "3" ,
month    =    "may" ,
year    =    "1986" ,
pages    =    "230--241" ,
bibdate    =    "Tue May 26 08:50:15 1987" ,
owner    =    "manning" ,
)

@article    ( EFFELSBERG84,
key    =    "Effelsberg \& Haerder" ,
author    =    "Effelsberg, W. and Haerder, T." ,
title    =    "Principles of Database Buffer Management" ,
journal    =    "tods" ,
volume    =    "9" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1984" ,
pages    =    "560--595" ,
keywords=    "database; buffer management; locality; replacement
algorithms" ,
abstract=    "This paper discusses the implementation of a
database buffer manager as a component of a DBMS. The interface
between calling components of higher system layers and the buffer
manager is described; the principle differences between virtual memory
paging and database buffer management are outlined; the notion of
referencing versus addressing of database pages is introduced; and the
concept of fixing pages in the buffer to prevent uncontrolled
replacement is explained. Three basic tasks have to be performed by
the buffer manager: buffer search, allocation of frames to concurrent
transactions, and page replacement. For each of these tasks,
implementation alternatives are discussed and illustrated by examples
from a performance evaluation project of a CODASYL DBMS." ,
bibdate    =    "Fri Mar  1 14:09:30 1985" ,
)

@techreport    ( EGE86,
key    =    "Ege \& Ellis" ,
author    =    "Ege, A. and Ellis, C.A." ,
title    =    "Design and Implementation of GORDION, An Object
Base Management System" ,
number    =    "STP-172-86" ,
institution=    "Software Technology Program, MCC" ,
address    =    "Austin, TX" ,
year    =    "1986" ,
month    =    "may" ,
pages    =    "1--22" ,
abstract=    "An experimental object base management syystem
called Gordion is presented. Gordion is a server which provides
permanence and sharing of objects for workstations within an
object-oriented environment. Among the unique aspects of Gordion are:
its ability to communicate with multiple languages, introduction of
new concurrency control primitives, ability to manipulate objects of
arbitrary size, and object sharing acorss the languages through a base
set of classes. The system is currently interfaced to two languages,
BiggerTalk and Zetalisp Flavors. Beside its language interface, Gordin
has an interface for the system administrator, and an interface for
debugging. Major functional components of the system are: concurrency
control, storage, history and inquiry, and maintenance. Concurrent
access to objects is regulated by four types of locks, and
transactions encapsulate units of work for the system. The storage
systems uses a hashing scheme and Unix files to store objects. A
discussion of the future prospects for Gordion concludes the paper." ,
bibdate    =    "Mon Aug 24 13:16:40 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( EGGERS80,
key    =    "Eggers \& Shoshani" ,
author    =    "Eggers, S. and Shoshani, A." ,
title    =    "Efficient Access of Compressed Data" ,
booktitle=    "vldb" ,
year    =    "1980" ,
pages    =    "205--211" ,
bibdate    =    "Thu May 23 21:14:22 1985" ,
)

@techreport    ( EGGERS88,
key    =    "Eggers" ,
author    =    "Eggers, J." ,
title    =    "Implementing {\it EXPRESS} in {\it SQL}" ,
number    =    "TC184/SC4/WG1 Document 292" ,
institution=    "ISO" ,
year    =    1988 ,
annote    =    "A system constructed to map many of EXPRESS
constructs into SQL. The key idea being to give each entity an ID
number, and then use relations that represent E-R relationships to
link the various items. Care was given to such things as internal and
external attributes. Overall a very well thought out plan of attack,
that lent itself well to automatic translation. On the negative side,
only the syntax of EXPRESS was ported items such as Rules Functions,
Derived attributes, and Procedures were not translated." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( EHRICH88,
key    =    "Ehrich" ,
author    =    "Ehrich, H." ,
title    =    "Abstract Object Types For Databases" ,
booktitle=    "Advances in Object Oriented Database Systems 2nd
International Workshop on Object Oriented Database Systems" ,
pages    =    "144--149" ,
publisher=    "Springer-Verlag" ,
address    =    "New York" ,
month    =    "sep" ,
year    =    1988 ,
annote    =    "The paper presents a good definition in both the
formal and informal sense of the concept of object. An object is
finally defined in both algebraic form, using a state machine to model
the life of an object, and as a process that interacts with other
processes. The concepts of typing is also considered." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( EICH92,
key    =    "Eich" ,
author    =    "Eich, M." ,
title    =    "Main Memory Databases: Current and Future Research
Issues" ,
journal    =    "tdke" ,
publisher=    "ieee" ,
volume    =    "4" ,
number    =    "6" ,
month    =    "dec" ,
year    =    "1992" ,
pages    =    "507--508" ,
bibdate    =    "Wed Jan 27 04:42:01 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( EICK85,
key    =    "Eick \& Lockemann" ,
author    =    "Eick, C.F. and Lockemann, P.C." ,
title    =    "Acquisition of terminological knowledge using
database design techniques" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "84--94" ,
bibdate    =    "Tue Jun 11 11:39:09 1985" ,
)

@article    ( ELHARDT84,
key    =    "Elhardt \& Bayer" ,
author    =    "Elhardt, K. and Bayer, R." ,
title    =    "A Database Cache for High Performance and Fast
Restart in Database Systems" ,
journal    =    "tods" ,
volume    =    "9" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1984" ,
pages    =    "503--525" ,
keywords=    "algorithms; performance; buffer management; crash
recovery; media failure; very long transactions" ,
abstract=    "Performance in database systems is strongly
influenced by buffer management and transaction recovery methods. This
paper presents the principles of the database cache, which replaces
the traditional buffer. In comparison to buffer management, cache
management is more carefully coordinated with transaction management,
and integrates transaction recovery. High throuhgput of small- and
medium-sized transactions is achieved by fast commit processing and
low database traffic. Very fast handling of transaction failures and
short restart time after system failure are guraranteed in such an
environment. Very long retrieval and update transactions are also
supported." ,
)

@inproceedings    ( ELMAGARMID88,
key    =    "Elmagarmid \& Helal" ,
author    =    "Elmagarmid, A. and Helal, A." ,
title    =    "Supporting Updates in Heterogeneous Distributed
Database Systems" ,
booktitle=    "Proceedings of the Fourth International Conference
on Data Engineering" ,
pages    =    "564--569" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "New York " ,
month    =    "feb" ,
year    =    1988 ,
annote    =    "A full discussion in update processing in a
distributed system. Special attention is paid to locking and rollback." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( ELMASRI83,
key    =    "Elmasri \& Wiederhold" ,
author    =    "Elmasri, R. and Wiederhold, G." ,
title    =    "GORDAS: A formal high-level query language for the
entity-relationship model" ,
journal    =    "Entity-Relationship Approach to Software
Engineering" ,
year    =    "1983" ,
bibdate    =    "Wed Nov  8 13:52:29 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( ELMASRI85,
key    =    "Elmasri \& Larson" ,
author    =    "Elmasri, R. and Larson, J." ,
title    =    "A graphical query facility for ER databases" ,
booktitle=    "Proc. 4th Int. Conf. Entity-Relationship Approach" ,
address    =    "Chicago, IL" ,
year    =    "1985" ,
bibdate    =    "Tue Nov  7 10:16:59 1989" ,
owner    =    "robyn" ,
)

@article    ( ELMASRI85A,
key    =    "Elmasri et al." ,
author    =    "Elmasri, R. and Weeldreyer, J. and Hevner, A." ,
title    =    "The Category Concept: An Extension to the Entity
Relationship Model" ,
journal    =    "International Journal on Data and Knowledge
Engineering" ,
volume    =    1 ,
month    =    "may" ,
year    =    1985 ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( ENBODY88,
key    =    "Enbody \& Du" ,
author    =    "Enbody, R. J. and Du, H. C." ,
title    =    "Dynamic Hashing Schemes" ,
journal    =    "compsurv" ,
publisher=    "Acm Press" ,
volume    =    "20" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1988" ,
pages    =    "85--114" ,
keywords=    "Dynamic hashing" ,
abstract=    "A new type of dynamic file access called dynamic
hashing has recently emerged. It promises the flexibility of handling
dynamic files while preserving the fast access times expected from
hashing. Such a fast, dynamic file access schemes is needed to support
modern database systems. This paper surveys dynamic hashing schemes
and examines their critical design issues." ,
bibdate    =    "Thu Feb 25 13:25:17 1993" ,
owner    =    "bassili" ,
)

@manual        ( ENFORM83,
key    =    "Tandem" ,
title    =    "ENFORM Reference Manual" ,
year    =    "1983" ,
author    =    "Tandem Computers, Inc." ,
address    =    "Cupertino, CA" ,
bibdate    =    "Wed Feb 27 22:13:41 1985" ,
)

@techreport    ( EPSTEIN77,
key    =    "Epstein" ,
author    =    "Epstein" ,
title    =    "A Tutorial on INGRES" ,
number    =    "M77/25" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1977" ,
bibdate    =    "Mon Nov  2 10:40:18 1987" ,
owner    =    "manning" ,
)

@techreport    ( EPSTEIN77A,
key    =    "Epstein" ,
author    =    "Epstein" ,
title    =    "Creating and Maintaining a Data Base Using INGRES" ,
number    =    "M77/71" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1977" ,
bibdate    =    "Mon Nov  2 10:41:07 1987" ,
owner    =    "manning" ,
)

@techreport    ( EPSTEIN79,
key    =    "Epstein" ,
author    =    "Epstein, R." ,
title    =    "Techniques for Processing of Aggregates in
Relational Database Systems" ,
type    =    "UCB/ERL" ,
number    =    "M7918" ,
institution=    "ucbcsd" ,
year    =    "1979" ,
month    =    "feb" ,
keywords=    "aggregates, Quel, ingres" ,
bibdate    =    "Thu Dec 15 11:10:41 1983" ,
)

@article    ( FAGIN77,
key    =    "Fagin" ,
author    =    "Fagin, R." ,
title    =    "Multivalued Dependencies and a New Normal Form for
Relational Databases" ,
journal    =    "tods" ,
volume    =    "2" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1977" ,
pages    =    "262--278" ,
bibdate    =    "Wed Jul 22 01:06:59 1992" ,
owner    =    "soo" ,
)

@article    ( FAGIN79,
key    =    "Fagin et al." ,
author    =    "Fagin, R. and Nievergelt, J. and Pippenger, N. and
Strong, H.R." ,
title    =    "Extendible Hashing-A Fast Access Method for
Dynamic Files" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "4" ,
number    =    "3" ,
month    =    "sept" ,
year    =    "1979" ,
pages    =    "315--344" ,
keywords=    "Hashing; extendible hashing; searching; index;
file organization; radix search; access method; B-tree; trie;
directory; external hashing" ,
abstract=    "Extendible hashing is a new access technique, in
which the user is guaranteed no more than two page faults to locate
the data associated with a given unique identifier, or key. Unlike
conventional hashing, extendible hashing has a dynamic structure that
grows and shrinks gracefully as the database grows and shrinks. This
approach simultaneously solves the problem of making hash tables that
are extendible and of making radix search trees that are balanced. We
study, by analysis and simulation, the performance of extendible
hashing. The results indicate that extendible hashing provides an
attractive alternative to other access methods, such as balanced
trees." ,
bibdate    =    "Tue Jan 20 12:52:57 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( FAGIN79A,
key    =    "Fagin" ,
author    =    "Fagin, R." ,
title    =    "Normal Forms and Relational Database Operators" ,
booktitle=    "sigmod" ,
year    =    "1979" ,
bibdate    =    "Wed Jul 22 01:04:07 1992" ,
owner    =    "soo" ,
)

@article    ( FAGIN81,
key    =    "Fagin" ,
author    =    "Fagin, R." ,
title    =    "A Normal Form For Relational Databases That is
Based on Domains and Keys" ,
journal    =    "tods" ,
volume    =    "6" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1981" ,
pages    =    "387--415" ,
bibdate    =    "Wed Jul 22 01:06:00 1992" ,
owner    =    "soo" ,
)

@inproceedings    ( FALOUTSOS85,
key    =    "Faloutsos" ,
author    =    "Faloutsos, C." ,
title    =    "Signature files: Design and performance comparison
of some signature extraction methods." ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "63--82" ,
bibdate    =    "Tue Jun 11 11:37:11 1985" ,
)

@inproceedings    ( FALOUTSOS87,
key    =    "Faloutsos et al." ,
author    =    "Faloutsos, C. and Sellis, T. and Roussopoulos, N." ,
title    =    "Analysis of Object Oriented Spatial Access Methods" ,
booktitle=    "Proceedings of the ACM SIGMOD Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "426--439" ,
abstract=    "This paper provides an analysis of R-trees and a
variation (R+-trees) that avoids overlapping rectangles in
intermediate nodes of the tree. The main contributions of the paper
are the following. We provide the first known analysis of R-trees.
Although formulas are given for objects in one dimension (line
segments), they can be generalized for objects in higher dimensions as
well. We show how the transformation of objects to higher dimensions
[HINR83] can be effectively used as a tool for the analysis of R- and
R+ -trees. Finally, we derive formulas for R+-trees and compare the
two methods analytically. The results we obtaineed show that R+-trees
require less than half the disk accesses required by a corresponding
R-tree when searching files of real life sizes. R+-trees are clearly
superior in cases where there are few long segments and a lot of small
ones." ,
bibdate    =    "Fri Jul 24 16:23:05 1987" ,
owner    =    "manning" ,
)

@techreport    ( FALOUTSOS87A,
key    =    "Faloutsos \& Chan" ,
author    =    "Faloutsos, C. and Chan, R." ,
title    =    "Fast Text Access Methods for Optical Disks:
Designs and Performance Comparison" ,
number    =    "UMIACS-TR-87-66/CS-TR-1958" ,
institution=    "Department of Computer Science, University of
Maryland" ,
address    =    "College Park, MD" ,
year    =    "1987" ,
month    =    "dec" ,
pages    =    "29" ,
abstract=    "Optical disks are ideal for archiving large text
data based. In this work, we examine efficient searching techniques
for write-once optical disks. We propose a unifying framework, which
reveals the similarities between signature files and an inverted file
using hash table. Then, we design methods that combine the ease of
insertion of the signature files with the fast retrieval of inverted
files. We develop analytical models of for their performance and we
verify it through experimentation on a 2.8 Mb data base. The agreement
between theory and experimentation is very good. The results show that
the proposed methods achieve fast retrieval, they require a modest
10\%-30\% space overhead, (as opposed to 50\%-300\% overhead for the
inverted files), and they do not violate the write-once restriction of
the optical disks. Using our verified model, the performance
predictions for the proposed methods on large data bases (e.g., 250
Mb) are very promising." ,
bibdate    =    "Thu Jul  1 04:04:44 1993" ,
owner    =    "daisyc" ,
)

@article    ( FERRANTE87,
key    =    "Ferrante" ,
author    =    "L. Ferrante" ,
title    =    "A Comparison of the ISO Working Draft Standard for
SQL and A Commercial Implementation of SQL" ,
journal    =    "SIGSMALL/PC notes" ,
volume    =    "13" ,
number    =    "3" ,
month    =    "Aug" ,
year    =    "1987" ,
pages    =    "28 -- 55" ,
keywords=    "SQL" ,
bibdate    =    "Fri Mar 22 12:01:31 1991" ,
owner    =    "suchen" ,
)

@inproceedings    ( FINKELSTEIN82A,
key    =    "Finkelstein" ,
author    =    "Finkelstein, S." ,
title    =    "Common Expression Analysis in Database
Applications" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
address    =    "Orlando, FL" ,
editor    =    "Schkolnick, M." ,
month    =    "jun" ,
year    =    "1982" ,
pages    =    "235--245" ,
abstract=    "Independent optimization of database requests
overlooks potential savings which can be achieved when they are
optimized collectively. An intuitive model for queries called the
query graph supports common expression detection for optimization of a
stream of requests. We describe how ad hoc query processing can be
improved using intermediate results and answers produced from earlier
queries, without significantly impacting processing costs when no
common expressions are found. We have written a Pascal program,
COMMON, which implements a variation of the algorithm which we
describe." ,
bibdate    =    "Thu Nov 19 20:44:36 1987" ,
owner    =    "mckenzie" ,
)

@article    ( FISHMAN87,
key    =    "Fishman, et al." ,
author    =    "Fishman, D.H. and Beech, D. and Cate, H.P. and
Chow, E.C. and Connors, T. and Davis, J.W. and Derrett, N. and Hoch,
C.G. and Kent, W. and Lyngbaek, P. and Mahbod, B. and Neimat, M.A. and
Ryan, T.A. and Shan, M.C." ,
title    =    "Iris: An Object-Oriented Database Management
System" ,
journal    =    "tois" ,
publisher=    "acm" ,
volume    =    "5" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1987" ,
pages    =    "48--69" ,
keywords=    "languages; Iris DBMS; LISP; object-oriented DBMS;
OSQL persistnet objects; SQL" ,
abstract=    "The Iris database management system is a research
prototype of a next-generation database management
system-DBMS-intended to meet the needs of new and emergin database
applications, including office information and knowledge-based
systems, engineering test and measurement, and hardware and software
design. Iris is exploring a rich set of new database capabilities
required by these applications, including rich data-modeling
constructs, direct database support for inference, matrices, support
for long transactions spanning minutes to many days, and multiple
versions of data. These capabilities are, in addition to the usual
support for permanence of data, controlled sharing, backup, and
recovery. The Iris DBMS consists of 1- a query processor that
implements the Iris object-oriented data model, 2- a Relational
Storage Subsystem-RSS-like storage manager that provides access paths
and concurrency control, backup, and recovery, and 3- a collection of
programmatic and interactive interfaces. The data model supports
high-level structural abstractions, such as classification,
generalization, and aggregation, as well as behavioral abstractions.
The interfaces to Iris include an object-oriented extension to SQL." ,
bibdate    =    "Fri Apr  7 15:16:39 1989" ,
owner    =    "payne" ,
)

@techreport    ( FISHMAN90,
key    =    "Fishman" ,
author    =    "Fishman, D." ,
title    =    "Overview of the IRIS DBMS" ,
institution=    "Hewlett Packard Laboratories" ,
address    =    "Palo Alto CA" ,
month    =    "jan" ,
year    =    "1990" ,
annote    =    "An overview of IRIS with some implementation
details discussed. Its features include stored functions, a Query
Language (OBJ-SQL) A weak versioning concept, generic objects, and a
slick graphical editor." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( FOGG84,
key    =    "Fogg" ,
author    =    "Fogg, D." ,
title    =    "Lessons from a 'Living In A Database' Graphical
Query Interface" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Yormark, B." ,
address    =    "Boston, MA" ,
month    =    "jun" ,
year    =    "1984" ,
pages    =    "100--106" ,
abstract=    "The Living In a Database system (LID) is a
user-friendly interface to an entity-relationship database. Its
underlying ideas are similar to Cattell's PDB [Cattell 80], but its
presentation is significantly different. LID uses a bitt-mapped
graphics terminal with mouse pointer to create an attractive
interaction environment. Experience from implementation suggests that
dynamic graphic display -- those which have graphic symbols that
change as the data they present change -- are an important feature in
user interfaces but are diffiult to implement with current technology.
The implementation also uncovers an important inadequacy in the
PDB/LID idea: the inability to operate on sets of data instances in
the same way as individual data instances. An extension to LID is
suggested to alleviate the problem." ,
bibdate    =    "Mon Oct  1 09:48:42 1984" ,
)

@book        ( FONG91,
key    =    "Fong et al." ,
editor    =    "Fong, J. and Kent, W. and Moore, K. and Thompson,
C." ,
title    =    "X3/SPARC/DBSSG/OODBTG Final Report" ,
publisher=    "NIST" ,
address    =    "Gaithersburg MD" ,
year    =    1991 ,
annote    =    "This report attempts to give the consensus opinion
from all of their workshops as to just what an OODBMS is. They create
a long list of features, and discuss the applicability of each to
OODBMS. There is an extensive glossary of OODBMS terms, and their
definitions." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( FOTOUHI89,
key    =    "Fotouhi \& Pramanik" ,
author    =    "Fotouhi, F. and Pramanik, S." ,
title    =    "Optimal Secondary Storage Access Sequence for
Performing Relational Join" ,
journal    =    "IEEE Transactions on Data and Knowledge
Engineering" ,
volume    =    "1" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1989" ,
pages    =    "318--328" ,
keywords=    "Database accesses; graph models; NP-complete
problems; relational database; relational join" ,
abstract=    "Two graph models are developed to determine the
minimum required buffer size for achieving the theoretical lower bound
on the number of disk accesses for performing relational join. Here,
the lower bound implies only one disk access per joining block or
page. The first graph model is based on the block connectivity of the
joining relations. Using this model, we considered the problem of
determining an ordered list of joining blocks that requires the
smallest size buffer. We have shown this problem as well as the
problem of computing the least upper bound on the buffer size to be
NP-hard. The second graph model represents the page connectivity of
the joining relations. We have shown the problem of computing the
least upper bound on the buffer size for the page connectivity model
to be also NP-hard. We believe that the problem of determining an
ordered list of pages which requires smallest size buffer is NP-hard.
Heuristic procedures are presented for the page connectivity model and
we showed that the sequence obtained using the heuristics requires a
near optimal buffer size. We have also shown the performance
improvement of the proposed heuristics over the hybrid-hash join
algorithm for a wide range of join factors." ,
bibdate    =    "Fri Dec  8 11:47:48 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( FRANK92A,
key    =    "Frank et al." ,
author    =    "Frank, M. R. and Omiecinski, E. R. and Navathe, S.
B." ,
title    =    "Adaptive and Automated Index Selection in RDBMS" ,
booktitle=    "Proceedings of the Conference on Extending Data
Base Technology" ,
year    =    "1992" ,
abstract=    "We present a novel approach for a tool that
assists the database administrator in designing an index configuration
for a relational database system, A new methodology for collecting
usage statistics at run time is developed which lets the optimizer
estimate query execution costs for alternative index configurations.
Defining the workload specification required by existing index design
tools may be very complex for a large integrated database system. Our
tool automatically derives the workload statistics. These statistics
are then used to efficiently compute an index configuration. Execution
of a prototype of the tool against a sample database demonstrates that
the proposed index configuration is reasonably close to the optimum
for test query sets." ,
bibdate    =    "Fri Jan 29 13:34:22 1993" ,
owner    =    "bassili" ,
)

@article    ( FRATARCANGELI91,
key    =    "Fratarcangeli" ,
author    =    "Fratarcangeli, C." ,
title    =    "Technique for Universal Quantification in SQL" ,
journal    =    "sigmod" ,
publisher=    "ACM" ,
volume    =    "20" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1991" ,
pages    =    "16--24" ,
abstract=    "Universal quantification is expressed in ANSI SQL
with negated existential quantification because there is no direct
support for universal quantification in ANSI SQL. However, the lack of
explicit support for universal quantification diminishes the
userfriendliness of the language because some queries are expressed
more naturally using universal quantification than they are using
negated existential quantification. It is the intent of this paper to
describe a technique to facilitate the construction of universal
quantification queries in ANSI SQL. The technique is based upon a
proposed extension to ANSI SQL to incorporate explicit general support
for universal quantification." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( FREESTON87,
key    =    "Freeston" ,
author    =    "Freeston, M." ,
title    =    "The BANG file: A New Kind of Grid File" ,
booktitle=    "Proceedings of the ACM SIGMOD Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "260--269" ,
abstract=    "A new multi-dimensional file structure has been
developed in the course of a project to devise ways of improving the
support for interactive queries to databases and knowledge bases.
Christened the 'BANG' file - a Balanced And Nested Grid - the new
structure is of the `grid file' type, but is fundamentally different
from previous grid file designs in that it does not share their common
underlying properties. It has a tree-structured directory which has
the self-balancing property of a B-tree and which, in contrast to
previous designs, always expands at the same rate as the data,
whatever the form of the data distribution. Its partitioning strategy
both accurately reflects the clustering of points in the data space,
and is flexible enough to adapt gracefully to changes in the
distribution." ,
bibdate    =    "Fri Jul 24 15:29:55 1987" ,
owner    =    "manning" ,
)

@article    ( FRENCH90,
key    =    "French et al." ,
author    =    "French, J. and Jones, A. and Pfaltz, J." ,
title    =    "Summary of the Final Report of the NSF Workshop on
Scientific Database Management" ,
journal    =    "sigmod" ,
volume    =    "19" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1990" ,
pages    =    "32--40" ,
abstract=    "The National Science Foundation sponsored a two
day workshop hosted by the University of Virginia on March 12--13,
1990 at which representatives from the earth, life, and space sciences
met with computer scientists to discuss the issues facing the
scientific community in the area of database management. The workshop
participants concluded that initiatives by the National Science
Foundation and other funding agencies, as well as specific discipline
professional societies are urgently needed to address the problems
facing scientists with respect to data management. This article
presents a condensed version of the workshop final report emphasizing
the technical research issues." ,
bibdate    =    "Sun Jan 19 20:31:12 1992" ,
owner    =    "soo" ,
)

@article    ( FREUNDLICH90,
key    =    "Freundlich" ,
author    =    "Freundlich, Yehudah" ,
title    =    "Knowledge Bases and Databases. Converging
Technologies, Diverging Interests" ,
journal    =    "IEEE Computer Magazine" ,
year    =    "1990" ,
volume    =    "" ,
number    =    "" ,
pages    =    "51--57" ,
month    =    "November" ,
)

@phdthesis    ( FREYTAG85,
key    =    "Freytag" ,
author    =    "Freytag, J.C." ,
title    =    "Translating Relational Queries into Iterative
Programs" ,
school    =    "Center for Research in Computing Technology, Aiken
Computation Laboratory" ,
address    =    "Cambridge, MA" ,
month    =    "sep" ,
year    =    "1985" ,
abstract=    "This thesis investigates the problem of
translating set-oriented query specification into iterative programs.
The translation uses techniques of functional programming and program
transformation. The first part presents two algorithms which generate
iterative programs from algebra based query specifications. The first
algorithm translates query specifications into recursive programs.
Those are simplified by sets of transformation rules before the
algorithm generates the final iterative form. The second algorithm
uses a two level translation which generates iterative programs faster
than the first algorithm. On the first level a small set of
transformation rules performs structural simplification before the
functional combination on the second level yields the final iterative
form. In the second part the same techniques are used to generate
efficient programs for the evaluation of agggregate functions. One
possible evaluation strategy is to sort the relation before applying
the aggregate function, or better yet, to perform aggregation while
sorting. Several transformation steps systematically generate these
more efficient programs from separate specifications for the sort
algorithm and the aggregate function. Finally, the third part
investigates the Lisp-dialect T as a possible implementation language
for database systems." ,
bibdate    =    "Wed Oct 28 15:22:17 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( FREYTAG86A,
key    =    "Freytag \& Goodman" ,
author    =    "Freytag, J.C. and Goodman, N." ,
title    =    "Translating Aggregate Queries into Iterative
Programs" ,
booktitle=    "vldb" ,
address    =    "Kyoto, Japan" ,
editor    =    "Kambayaski, Y." ,
month    =    "aug" ,
year    =    "1986" ,
pages    =    "138--146" ,
keywords=    "relational databases, aggregates, iterative
programs" ,
abstract=    "Over the last decade, many techniques for
optimizing relational queries have been developed. However, the
optimization of queries with aggregation has received little
attention. This paper investigates possible improvements for aggregate
queries on groups of tuples. We suggest the use of program
transformation methods to systematically generate efficient iterative
programs for their evaluation. Two transformation steps successively
translate a program, which sorts the relation before applying the
aggregate function, into an iterative program which performs the
aggregation while sorting, thus using less time and space than needed
for the execution of the initial program." ,
bibdate    =    "Wed Aug 19 22:57:30 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( FREYTAG87,
key    =    "Freytag" ,
author    =    "Freytag, J.C." ,
title    =    "A Rule-Based View of Query Optimization" ,
booktitle=    "Proceedings of the ACM SIGMOD Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "173--180" ,
abstract=    "The query optimizer is an important system
component of a relational database management system (DBMS). It is the
responsibility of this component to translate the user-submitted query
- usually written in a non-procedural language - into an efficient
query evaluation plan (QEP) which is then executed against the
database. The research literature describes a wide variety of
optimization strategies for different query languages and
implementation environments. However, very little is known about how
to design and structure the query optimization component to implement
these strategies. This paper proposes a first step towards the design
of a modular query optimizer. We describe its operations by
transformation rules which generate different QEP's from initial query
specifications. As we distinguish different aspects of the query
optimization process, our hope is that the approach taken in this
paper will contribute to the more general goal of a modular query
optimizer as part of an extensible database management system." ,
bibdate    =    "Fri Jul 24 15:23:04 1987" ,
owner    =    "manning" ,
)

@book        ( FREYTAG87B,
key    =    "Freytag" ,
author    =    "Freytag, J.C." ,
title    =    "Translating Relational Queries into Iterative
Programs" ,
publisher=    "Springer-Verlag" ,
year    =    "1987" ,
series    =    "Lecture Notes in Computer Science" ,
volume    =    "261" ,
isbn    =    "0-387-18000-1" ,
editor    =    "Goos, G. and Hartmanis, J." ,
abstract=    "This book investigates the problem of translating
set-oriented query specifications into iterative programs. The
translation uses techniques of functional programming and program
transformation. The first part presents two algorithms which generate
iterative programs from algebra-based query specifications. The first
algorithm initially translates query specifications into recursive
programs. Those are simplified by sets of transformation rules before
the last step of the algorithm generates the final iterative form. The
second algorithm uses a two level trnaslation which generates
iterative programs faster than the first algorithm. On the first level
a small set of transformation rules performs structural simplification
before the functional combination on the second level yields the final
iterative form. In the second part the same techniques are used to
generate efficient programs for the evaluation of aggregate functions.
One possible evaluation strategy is to sort the relation before
applying the aggregate function, or better yet, to perform aggregation
while sorting. Several transformation steps systematically generate
these more efficient programs from separate specifications for the
sort algorithm and the aggregate function. Finally, the third part
investigates the Lisp-dialect T as a possible implementation language
for database systems." ,
bibdate    =    "Wed Nov 25 13:10:39 1987" ,
owner    =    "mckenzie" ,
)

@article    ( FRIEDELL82,
key    =    "Friedell et al." ,
author    =    "Friedell, M and Barnett, J and Kramlich, D." ,
title    =    "Context-sensitive, Graphic Presentation of
Information" ,
journal    =    "Computer Graphics" ,
volume    =    "16" ,
number    =    "3" ,
month    =    "July" ,
year    =    "1982" ,
pages    =    "181--188" ,
abstract=    "We begin by reviewing spatial data management -
technique of accessing and organizing information via its graphical
representation in an organized spatial framework. We describe an
operational prototype system that exceeds the capabilities of other
spatial data management systems in two ways: (1) the graphical
presentation of data is tailored to the user's identity, task, and
database query; and (2) the system has the capacity for large
databases. These capabilities are possible because the system
dynamically generates its graphics environment. Our technique for
dynamically generating the graphics environment relies on modeling of
user context, semantic modeling of the underlying database, and direct
use of knowledge about design layout and the utility of pictures. We
briefly describe our current research efforts to extend this
knowledge-based approach to automatic graphics environment synthesis." ,
annote    =    "The system is composed of two main modules: an
answer space generator, which combines the user's query specification
with knowledge about the user's viewing preferences, task goals, and
other information gathered throughtout the query session, outputting a
description of the answer space as it should be presented to the I
space that is the system's graphical response to the user's database
query. The system uses a joystick, a dater tablet, a keyboard, and two
touch-sensitive color displays as input devices to specify a query.
Icons are selected by a complex heiristic algorithm, taking into
account the user's identity, task, the particular entity type, and
attribute list (attribute values are not involved). Icons are placed
on a rectangular grid, scaled based on space constraints. Additional
icons are available if the user moves to a portion of the image space
not displayed with detail monitor (there are two levels displayed, the
entire space and a more detailed view, on separate monitors)." ,
bibdate    =    "Tue Feb  5 15:18:57 1985" ,
)

@article    ( FRY77,
key    =    "Fry" ,
author    =    "Fry, J." ,
title    =    "Stored Data Description and Data Translation: A
Model and Language" ,
journal    =    "Information Systems" ,
volume    =    2 ,
pages    =    "95--145" ,
publisher=    "Pergamon press" ,
year    =    1977 ,
annote    =    "An early attempt at describing both the syntax,
and a modeling system for data translation between systems." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( FURTADO79,
key    =    "Furtado et al." ,
author    =    "Furtado, A.L. and Sevcik, K.C. and dos Santos,
C.S." ,
title    =    "Premitting Updates Through Views of Data Bases" ,
journal    =    "Information Systems" ,
volume    =    "4" ,
number    =    "4" ,
year    =    "1979" ,
bibdate    =    "Thu Aug  4 19:40:45 1988" ,
owner    =    "" ,
)

@inbook        ( FURTADO85,
key    =    "Furtado \& Casanova" ,
author    =    "Furtado, A.L. and Casanova, M.A." ,
title    =    "Updating Relational Views" ,
booktitle=    "Query Processing in Database Systems" ,
publisher=    "Springer-Verlag" ,
year    =    "1985" ,
pages    =    "127--142" ,
bibdate    =    "Thu Aug  4 19:43:49 1988" ,
owner    =    "" ,
)

@article    ( GAIT88,
key    =    "Gait" ,
author    =    "Gait, J." ,
title    =    "The Optical File Cabinet: A Random-Access File
System for Write-Once Optical Disks" ,
journal    =    "Computer" ,
publisher=    "ieee" ,
volume    =    "21" ,
number    =    "6" ,
month    =    "jun" ,
year    =    "1988" ,
pages    =    "11--22" ,
bibdate    =    "Tue Jul 19 14:03:57 1988" ,
owner    =    "payne" ,
)

@article    ( GAIT94,
key    =    "Gait" ,
author    =    "Gait, Jason" ,
title    =    "Optimizing Unix Database File Operations" ,
journal    =    "IEEE Software" ,
publisher=    "IEEE Computer Society" ,
volume    =    "11" ,
number    =    "3" ,
month    =    "may" ,
year    =    "1994" ,
pages    =    "48--56" ,
abstract=    "Ratfiles, or rational file system, bypasses the
Unix kernel to perform database-file operations at nearly twice the
speed of conventional file systems and offers several techniques,
including atomic write and write-order discipline, to improve data
integrity." ,
bibdate    =    "Wed Sep 14 13:26:31 1994" ,
owner    =    "kevin" ,
)

@inproceedings    ( GALINDOLEGARIA92,
key    =    "Galindo-Legaria \& Rosenthal" ,
author    =    "Galindo-Legaria, C. and Rosenthal, A." ,
title    =    "How to Extend a Conventional Optimizer to Handle
One-and-Two-Sided Outerjoin" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "ieee" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Alamitos, CA" ,
editor    =    "Golshani, F." ,
volume    =    "8" ,
month    =    "feb" ,
year    =    "1992" ,
pages    =    "402--409" ,
abstract=    "Free choice among join orderings is one of the
most powerful optimizations in a conventional optimizer. The freedom
is normally limited to Select/Project/Join queries. In this paper, we
extend this freedom to queries that include 1- and 2-sided outerjoins.
Unlike previous work, these results are not limited to queries
possessing a nice structure, or queries that are nicely represented in
relational calculus. Our theoretical results concern query
simplication and reassociation using a generalized outerjoin. Our
reordering technique is compatible with the join-order generation of a
conventional query optimizer." ,
bibdate    =    "Sat Aug 29 15:29:31 1992" ,
owner    =    "leoso" ,
)

@inproceedings    ( GAMBINO77,
key    =    "Gambino \& Gerritsen" ,
author    =    "Gambino, T. and Gerritsen, R." ,
title    =    "A Data Base Design Decision Support System" ,
booktitle=    "vldb" ,
year    =    "1977" ,
pages    =    "534--544" ,
bibdate    =    "Thu May 23 21:17:16 1985" ,
)

@inproceedings    ( GANSKI87,
key    =    "Ganski \& Wong" ,
author    =    "Ganski, R.A. and Wong, H.K.T." ,
title    =    "Optimization of Nested SQL Queries Revisited" ,
booktitle=    "Proceedings of the SIGMod 1987 Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "23--33" ,
abstract=    "Current methods of evaluating nested queries in
the SQL language can be inefficient in a variety of query and data
base contexts. Previous research in the area of nested query
optimization which sought methods of reducing evaluation costs is
summarized, including a classification scheme for nested queries,
algorithms designed to transform each type of query to a logically
equivalent form which may then be evaluated more efficiently, and a
description of a major bug in one of these algorithms. Further
examination reveals another bug in the same algorithm. Solutions to
these bugs are proposed and incorporated into a new transformation
algorithm, and extensions are proposed which will allow the
transformation algorithms to handle a larger class of predicates. A
recrusive algorithm for processing a general nested query is
presesnted and the action of this algorithm is demonstrated. This
algorithm can be used to transform any nested query." ,
bibdate    =    "Tue Aug 25 13:51:39 1987" ,
owner    =    "manning" ,
)

@article    ( GARCIA-MOLINA90,
key    =    "Garcia-Molina \& Lindsay" ,
author    =    "Garcia-Molina, H. and LLindsay, B." ,
title    =    "Research Directions for Distributed Databases" ,
journal    =    "sigmod" ,
volume    =    "19" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1990" ,
pages    =    "98--103" ,
bibdate    =    "Sun Jan 19 21:09:40 1992" ,
owner    =    "soo" ,
)

@techreport    ( GARCIA90,
key    =    "Garcia-Molina et al." ,
author    =    "Garcia-Molina, H. and Gawlick, D. and Klein, J.
and Kleissner, K. and Salem, K." ,
title    =    "Coordinating Multi-Transaction Activities" ,
institution=    "Princeton University" ,
address    =    "Princeton, NJ" ,
year    =    "1990" ,
month    =    "feb" ,
pages    =    "1--16" ,
abstract=    "Data processing applications must often execute
collections of related transactions. We propose a model for
structuring and coordinating these multi-transaction activities. The
model includes mechanisms for communication between transactions, for
compensating transactions after an activity has failed, for dynamic
creation and binding of activities, and for checkpointing the progress
of an activity." ,
bibdate    =    "Thu Aug 16 07:24:07 1990" ,
owner    =    "robyn" ,
)

@article    ( GARCIAMOLINA82A,
key    =    "Garcia-Molina \& Wiederhold" ,
author    =    "Garcia-Molina, H. and Wiederhold, G." ,
title    =    "Read-Only Transactions in a Distributed Database" ,
journal    =    "tods" ,
volume    =    "7" ,
number    =    "2" ,
month    =    "june" ,
year    =    "1982" ,
pages    =    "209--234" ,
keywords=    "algorithms; performance; concurrency control;
consistency; currency; query; R insularity; read-only transaction;
schedule; serializability; transaction; transaction processing
algorithm" ,
abstract=    "A read-only transaction or query is a transaction
which does not modify any data. Read-only transactions could be
processed with general transaction processing algorithms, but in many
cases it is more efficient to process read-only transactions with
special algorithms which take advantage of the knowledge that the
transaction only reads. This paper defines the various consistency and
currency requirements that read-only transactions may have. The
processing of the different classes of read-only transactions in a
distributed database is discussed. The concept of R insularity is
introduced to characterize both the read-only and update algorithms.
Several simple update and read-only transaction processing algorithms
are presented to illustrate how the query requirements and the update
algorithms affect the read-only transaction processing algorithms." ,
bibdate    =    "Tue Apr 16 08:39:31 1985" ,
)

@inproceedings    ( GARCIAMOLINA87,
key    =    "Garcia-Molina \& Salem" ,
author    =    "Garcia-Molina, H. and Salem, K." ,
title    =    "SAGAS" ,
booktitle=    "Proceedings of the SIGMod 1987 Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, Ca" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "249--259" ,
abstract=    "Long lived transactions (LLTs) hold on to database
resources for relatively long periods of time, significantly delaying
the termination of shorter and more common transactions. To alleviate
these problems we propose the notion of a saga. A LLT is a saga if it
can be written as a sequence of transactions that can be interleaved
with other transactions. The database management system guarantees
that either all the transactions in a saga are successfully completed
or compensating transactions are run to amend a partial execution.
Both the concept of saga and its implementation are relatively simple,
but they have the potential to improve performance significantly. We
analyze the various implementation issues related to sagas, including
how they can be run on an existing system thaat does not directly
support them. We also discuss techniques for database and LLT design
that make it feasible to break up LLTs into sagas. " ,
bibdate    =    "Thu Sep  3 11:43:11 1987" ,
owner    =    "manning" ,
)

@article    ( GARCIAMOLINA92,
key    =    "Garcia-Molina \& Salem" ,
author    =    "Garcia-Molina, H. and Salem, K." ,
title    =    "Main Memory Database Systems: An Overview " ,
journal    =    "tdke" ,
publisher=    "ieee" ,
volume    =    "4" ,
number    =    "6" ,
month    =    "dec" ,
year    =    "1992" ,
pages    =    "509--516" ,
keywords=    "Access methods; application programming interface;
commit processing; concurrency control; data clustering; data
representation; main memory database system (MMDB); query processing;
recovery" ,
abstract=    "Memory resident database systems (MMDB's) store
their data in main physical memory and provide very high-speed access.
Conventional database systems are optimized for the particular
characteristics of disk storage mechanisms. Memory resident systems,
on the other hand, use different optimizations to structure and
organize the date, as well as to make it reliable. This paper surveys
the major memory residence optimizations and briefly discusses some of
the memory resident systems that have been designed or implemented." ,
bibdate    =    "Wed Jan 27 04:44:02 1993" ,
owner    =    "bassili" ,
)

@book        ( GARDARIN84,
key    =    "Gardarin \& Gelenbe" ,
author    =    "Gardarin, G. and Gelenbe, E." ,
title    =    "New Applications of Data Bases" ,
publisher=    "Academic Press" ,
year    =    "1984" ,
bibdate    =    "Mon Jun 24 10:17:32 1985" ,
)

@inproceedings    ( GARDARIN84B,
key    =    "Gardarin et al." ,
author    =    "Gardarin, G. and Valduriez, P. and Viemont, Y." ,
title    =    "Predicate Trees: An Approach to Optimize
Relational Query Operations" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
month    =    "apr" ,
year    =    "1984" ,
pages    =    "439--444" ,
keywords=    "database machine, relational, access paths,
multi-dimensional searching, indexing, predicate trees, clustering,
filtering." ,
abstract=    "With the advent of relational database systems,
multi-key searching problems have become the focus of a great deal of
research. In this paper, we present a new data structure called
predicate trees for clustering tuples of a relation in a way that
allows the system to accelerate a large number of multi-dimensional
queries. The directories used for the implementation of predicate
trees in SABRE are organized as relations which are searched
efficiently by filters. One of the most significant advantages of
predicate trees is the possibility of defining logical addresses based
on content, called signatures, and to use filters to manage
directories" ,
bibdate    =    "Wed Sep  2 14:01:42 1987" ,
owner    =    "mckenzie" ,
)

@techreport    ( GARNETT89,
key    =    "Garnett \& Tansel" ,
author    =    "Garnett, L. and Tansel, A." ,
title    =    "Equivalence of the Relational Algebra and Calculus
Languages for Nested Relations" ,
institution=    "City University of New York" ,
address    =    "New York, New York" ,
year    =    "1989" ,
bibdate    =    "Mon Oct 29 08:11:58 1990" ,
owner    =    "robyn" ,
)

@inproceedings    ( GE88,
key    =    "Ge et al." ,
author    =    "Ge, L. and Johannsen, W. and Lamersdorf, W. and
Reinhardt, K. and Schmidt, J." ,
title    =    "Database Applications Support in Open Systems:
Language Concepts and Implementation Architectures" ,
booktitle=    "Fourth International Data Engineering Conference" ,
pages    =    "556--563" ,
publisher=    "IEEE" ,
address    =    "New York " ,
month    =    "feb" ,
year    =    1988 ,
annote    =    "Distributed DBMS issues in terms of data sharing.
The approach is what is known as federated." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( GEHANI82,
key    =    "Gehani" ,
author    =    "Gehani, Narain" ,
title    =    "Databases and Unit of Measure" ,
journal    =    "IEEE Transactions on Software Engineering" ,
year    =    "1982" ,
volume    =    "SE-8" ,
number    =    "6" ,
pages    =    "605--611" ,
month    =    "November" ,
)

@inproceedings    ( GEHANI92A,
key    =    "Gehani et al." ,
author    =    "Gehani, N. H. and Jagadish, H. V. and Shmueli, O." ,
title    =    "Event Specification in an Active Object-Oriented
Database" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "San Diego, California" ,
editor    =    "Stonebraker, M." ,
volume    =    "21" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "81--90" ,
abstract=    "The concept of a trigger is central to any active
database. Upon the occurrence of a trigger event, the trigger is
'fired', i.e, the trigger action is executed. We describe a model and
a language for specifying basic and composite trigger events in the
context of an abject-oriented database. The specified events can be
detected efficiently using finite automata. We integrate our model
with O++, the database programming language for the Ode object
database being developed at AT&T Bell Labs. We propose a new
Event-Action model, which folds into the event specification the
condition part of the well-known Event-Condition-Action model and
avoids the multiple coupling modes between the event, condition, and
action trigger components." ,
bibdate    =    "Mon Jan 25 13:33:31 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( GELDER92,
key    =    "Van Gelder" ,
author    =    "Van Gelder, A." ,
title    =    "The Well--Founded Semantics of Aggregation
(Extended Abstract)" ,
booktitle=    "pods" ,
address    =    "San Diego, CA" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "127--138" ,
abstract=    "Common aggregation predicates have natural
definitions in logic, either as first order sentences (min, max,
etc.), or with elementary induction over a data structure that
represents the relation (sum, count, etc.). The well-founded semantics
for logic programs provides an interpretation of such definitions. The
interpretation of first-order aggregates seems to be quite natural and
intuitively satisfying, even in the presence of recursion through
aggregation. Care is needed to get useful results on inductive
aggregates, however. A basic building block is the ``subset''
predicate, which states that a data structure represents a subset of
an IDB predicate, and which is definable in the well-founded
semantics. The analogous ``superset'' is also definable, and their
combination yields a ``generic'' form of findall. Surprisingly,
findall must be used negatively to obtain useful approximations when
the exact relation is not yet known. Extensions to the semantics,
restrictions on the input, and other supplementary requirements
proposed in earlier studies appear to be unnecessary for the purpose
of attaching a meaning to a program that involves recursion through
aggregation. For example, any reasonable definition of ``shortest
paths'' tolerates negative weight edges, correctly computes shortest
paths that exist, and leaves tuples undefined where negative-weight
cycles cause the shortest path not to exist. Other examples exhibit
similarly robust behavior, when defined carefully. Connections with
the generic model of computation are discussed briefly." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( GELLER91,
key    =    "Geller et al." ,
author    =    "Geller, J. and Perl, Y. and Neuhold, E." ,
title    =    "Structure and Semantics in OODB Class
Specification" ,
journal    =    "sigmod" ,
volume    =    20 ,
pages    =    "40--43" ,
month    =    "dec" ,
year    =    1991 ,
annote    =    "Good working definition of how to tell the
difference between structure and semantics in the definition procedure
for a class." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( GERRITSEN76A,
key    =    "Gerritsen \& Morgan" ,
author    =    "Gerritsen, R. and Morgan, H.L." ,
title    =    "Dynamic Restructuring of Databases with Generation
Data Structures" ,
booktitle=    "Proceedings of the ACM Annual Conference" ,
organization=    "acm" ,
address    =    "Houston, TX" ,
month    =    "oct" ,
year    =    "1976" ,
pages    =    "281--286" ,
keywords=    "network model, scheme evolution, dynamic
restructuring" ,
abstract=    "Most logical database restructuring schemes
require a complete pass through the database for reformation. Our
approach is to leave the database in situ and to permit a mixture
(several generations) of structures to co-exist. Each generation of
structure is described in a Generation Data Structure Schema, which
has a generic structure of its own. A Restructuring Data Definition
Language is proposed for describing the evolution from one schema to
the next. Steps toward implementation are discussed." ,
bibdate    =    "Tue Mar 31 16:06:59 1987" ,
owner    =    "mckenzie" ,
)

@article    ( GERSTING88,
key    =    "Gersting et al." ,
author    =    "Gersting, J. and Kinsley, K. and McDonald, N. and
North, J. and Sastry, M. and Stull, E." ,
title    =    "Reference Model for DBMS User Facility" ,
journal    =    "SIGMod Record" ,
publisher=    "ACM" ,
volume    =    "17" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1988" ,
pages    =    "23--52" ,
bibdate    =    "Sun Jul 17 11:21:35 1988" ,
owner    =    "" ,
)

@techreport    ( GHANDEHARIZADAH95,
key    =    "Ghandeharizadah" ,
author    =    "Ghandeharizadah, S." ,
title    =    "Stream-based Versus Structured Video Objects:
Issues, Solutions, and Challenges" ,
institution=    "Computer Science Department, University of
Southern California" ,
address    =    "Los Angeles, CA" ,
year    =    "1995" ,
pages    =    "26" ,
abstract=    "An emerging area of database system research is to
investigate techniques that ensure a continuous display of video
objects. As compared to the traditional data types, e.g., text, a
video object must be retrieved at a prespecified rate. If it is
retrieved at a lower rate then its display may suffer from frequent
disruptions and delays, termed hiccups. This paper describes two
alternative approaches to representing video objects (stream-based and
structured) and the issues involved in supporting their hiccup-free
display. For each approach, we describe the existing solutions and the
future research directions from a database systems perspective." ,
bibdate    =    "Wed Sep  6 13:42:53 1995" ,
owner    =    "jeff" ,
)

@inproceedings    ( GHANDEHARIZADEH95,
key    =    "Ghandeharizadeh et al." ,
author    =    "Ghandeharizadeh, S. and Kim, S. H. and Shahabi, C." ,
title    =    "On Configuring a Single Disk Continuous Media
Server" ,
booktitle=    "Proceedings of the ACM-Sigmetrics Conference" ,
month    =    "may" ,
year    =    "1995" ,
pages    =    "23" ,
bibdate    =    "Wed Jan 10 15:21:34 1996" ,
abstract=    "The past decade has witnessed a proliferation of
repositories that store and retrieve continuous media data types,
e.g., audio and video objects. These repositories are expected to play
a major role in several emerging applications, e.g., library
information systems, educational applications, entertainment industry,
etc. To support the display of a video object, the system partitions
each object into fixed size blocks. All blocks of an object reside
permanently on the disk drive. When displaying an object, the system
stages the blocks of the object into memory one at a time for
immediate display. In the presence of multiple displays referencing
different objects, the bandwidth of the disk drive is multiplexed
among requests, introducing disk seeks. Disk seeks reduce the useful
utilization of the disk bandwidth and result in a lower number of
simultaneous displays (throughput). This paper characterizes the
impact of disk seeks on the throughput of the system. It describes
REBECA as a mechanism that maximizes the throughput of the system by
minimizing the time attributed to each incurred seek. A limitation of
REBECA is that it increases the latency observed by each request. We
quantify this throughput vs. latency tradeoff of REBECA and, develop
an efficient technique that computes its configuration parameters to
realize the performance requirements (desired latency and throughput)
of an application." ,
owner    =    "jeff" ,
)

@article    ( GHOSH86,
key    =    "Ghosh" ,
author    =    "Ghosh, S.P." ,
title    =    "Statistical Relational Tables for Statistical
Database Management" ,
journal    =    "tse" ,
publisher=    "IEEE" ,
volume    =    "SE-12" ,
number    =    "12" ,
month    =    "dec" ,
year    =    "1986" ,
pages    =    "1106--1116" ,
keywords=    "Codd's relational model, metadata, statistical
data, statistical relational table" ,
abstract=    "This paper extends Codd's relational view to
represent statistical data and to achieve the efficient analysis of
statistical data. It discusses why the relational calculus has not
been popular with statisticians. A new view called a statistical
relational table is presented, to meet the needs of the statisticians.
Some of Codd's relational operators are extended to the statistical
relational tables. New operators, based on the statistical relational
tables, are introduced for communicating requests for statistical
analysis. A new query language, called the query-by-statistical-
relational-table (which has some similarities with query-by-example),
is introduced. Extensions of SQL language for processing the commands
of the new query language are also discussed. Creation and storage of
metadata for fast statistical analysis are considered. Some problems
related to privacy in statistical databases are also examined." ,
bibdate    =    "Fri Nov  7 15:54:49 1986" ,
owner    =    "manning" ,
)

@techreport    ( GHOSH88,
key    =    "Ghosh" ,
author    =    "Ghosh, Sakti P." ,
title    =    "Statistical Relational Databases: Normal Forms" ,
institution=    "IBM Research Division, Almaden Research Center" ,
year    =    "1988" ,
type    =    "Technical report," ,
number    =    "RJ-6555" ,
address    =    "San Jose, California" ,
month    =    "November" ,
note    =    "" ,
)

@article    ( GHOSH89,
key    =    "Ghosh" ,
author    =    "Ghosh, Sakti P." ,
title    =    "Numerical Operations on a Relational Database" ,
journal    =    "IEEE Transactions on Software Engineering" ,
year    =    "1989" ,
volume    =    "15" ,
number    =    "5" ,
pages    =    "600--610" ,
month    =    "May" ,
)

@techreport    ( GHOSH90,
key    =    "Ghosh" ,
author    =    "Ghosh, Sakti P." ,
title    =    "Statistical Relational Model" ,
institution=    "IBM Almaden Research Center" ,
year    =    "1990" ,
type    =    "Technical report," ,
number    =    "RJ-7551" ,
address    =    "605 Harry Road, San Jose, CA 95120-6099" ,
month    =    "June" ,
note    =    "A book chapter" ,
)

@article    ( GHOSH91,
key    =    "Ghosh" ,
author    =    "Ghosh, Sakti P." ,
title    =    "Statistical Relational Databases: Normal Forms" ,
journal    =    "tkde" ,
volume    =    "3" ,
number    =    "1" ,
month    =    "Mar" ,
year    =    "1991" ,
pages    =    "55--64" ,
keywords=    "Category-numeric relation data, extended SQL,
normal forms, relational daatabase, relational decomposition,
statistical-database." ,
abstract=    " This paper discusses problems associated with
defining normal forms of relational tables relevant to statistical
processing. The concepts of derived identifier, class identifier,
derived class-counts, count domains, compa ct and uniform domains for
continue: statistical relational tables have been introduced. We also
discuss t he structures of the first and the second statistical-normal
forms and the relat ional decompositions needed to achieve them. The
statistical-normal form can be an important method to continue:
determin whether the usual statistical analysis techniques are valid.
We have some suggestions for extending the SQL statemaents to achieve
these ope rations on statistical relational tables. Some results
linking Codd's normal for ms with statistical normal forms are also
discussed. We also discuss relational statistical abnormalities,
called outlyers." ,
bibdate    =    "Tue Aug  6 16:32:00 1991" ,
owner    =    "suchen" ,
)

@article    ( GINSBURG85B,
key    =    "Ginsburg \& Spanier" ,
author    =    "Ginsburg, S. and Spanier, E.H." ,
title    =    "On Completing Tables to Satisfy Functional
Dependencies" ,
journal    =    "Theoretical Computer Science" ,
publisher=    "North-Holland" ,
volume    =    "39" ,
year    =    "1985" ,
pages    =    "309--317" ,
abstract=    "Several sufficiency conditions on a given set of
functional dependencies are presented to ensure that a
partially-specified table can be to a completely-specified table
satisfying the dependencies. In particular, each table over a minimal
key can be extended to such a table (over the entire attribute set)" ,
bibdate    =    "Mon Feb 23 14:17:26 1987" ,
owner    =    "manning" ,
)

@article    ( GINSBURG86A,
key    =    "Ginsburg \& Hull" ,
author    =    "Ginsburg, S. and Hull, R." ,
title    =    "Sort Sets in the Relational Model" ,
journal    =    "jacm" ,
publisher=    "acm" ,
volume    =    "33" ,
number    =    "3" ,
month    =    "jul" ,
year    =    "1986" ,
pages    =    "465--488" ,
keywords=    "Design; management; theory; verification;
dependencies; logical implication; ordered domains" ,
abstract=    "The notion of sort set is introduced here to
formalize the fact that certain database relations can be sorted so
that two or more columns are simultaneously listed in order. This
notion is shown to be applicable in several ways to enhance the
efficiency of an implemented database. A characterization of when
order dependency implies the existence of sort sets in a database is
presented, along with several corollaries concerning complexity,
Armstrong directions, and cliques of certain graphs. Sort-set
dependencies are then introduced. A (finite) sound and complete set of
inference rules for sort-set dependencies is presented, as well as a
proof that there is no such set for functional and sort-set
dependencies taken together. Deciding logical implication for sort-set
dependencies is proved to be polynomial, but if functional
dependencies are included the problem is co-NP-complete. Each set of
sort-set and functional dependencies is shown to have an Armstrong
relation. A natural generalization of Armstrong relation, here called
separator, is given and then used to study the relationship between
order and sort-set dependencies." ,
bibdate    =    "Mon Feb 23 14:28:33 1987" ,
owner    =    "manning" ,
)

@article    ( GOGOLLA90,
key    =    "Gogolla" ,
author    =    "Martin Gogolla" ,
title    =    "A note on translation of SQL to tuple calculus" ,
journal    =    "SIGMOD Rec. " ,
volume    =    "19" ,
number    =    "1" ,
month    =    "Mar." ,
year    =    "1990" ,
pages    =    "18 -- 22" ,
keywords=    "SQL, Tuple calculus" ,
bibdate    =    "Fri Mar 22 11:07:53 1991" ,
owner    =    "suchen" ,
)

@article    ( GOGOLLA91,
key    =    "Gogolla91" ,
author    =    "Gogolla, M. and Hohenstein, U." ,
title    =    "Towards a Semantic View of an Extended
Entity-Relationship Model" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "16" ,
number    =    "3" ,
month    =    "september" ,
year    =    "1991" ,
pages    =    "369-416" ,
abstract=    "Nearly all query languages discussed recently for
the Entity-Relationship (ER) model do not possess a formal semantics.
Languages are often defined by means of examples only. The reason for
this phenomenon is the essential gap between features of query
languages and theoretical foundations like algebras and calculi. Known
languages offer arithmetic capabilities and allow for aggregates, but
algebras and calculi defined for ER models do not. This paper
introduces an extended ER model concentrating nearly all aspects of
known so-called semantic data models in a few syntactical constructs.
Moreover, we provide our extended ER model with a formal mathematical
semantics. On this basis a well-founded calculus is developed taking
into account data operations on arbitrary user-defined data types and
aggregate functions. We pay special attention to arithmetic
operations, as well as multivalued terms allowing nested queries, in a
uniform and consistent manner. We prove our calculus only allows the
formulation of safe terms and queries yeilding a finite result, and to
be (at least) as expressive as the relational calculi." ,
bibdate    =    "Mon Nov  4 11:26:00 1991" ,
owner    =    "kline" ,
)

@techreport    ( GOLDBERG92,
key    =    "Goldberg et al." ,
author    =    "Goldberg, D. and Nichols, D. and Oki, B. and
Terry, D." ,
title    =    "Using Collaborative Filtering to Weave an
Information Tapestry" ,
number    =    "CSL-92-10" ,
institution=    "parc" ,
address    =    "Palo Alto, California" ,
year    =    "1992" ,
month    =    "sep" ,
pages    =    "18" ,
keywords=    "continuous query; information filtering; active
database; query rewrite; bounding monotonic query; incremental query;
query language" ,
abstract=    "Tapestry is an experimental system that manages an
incoming stream of electronic documents, including electronic mail,
news wire stories and NetNews articles. In common with some recent
mail systems, Tapestry uses filtering to cope with large volumes of
incoming documents. Where Tapestry differs from these systems is in
its philosophy that humans provide the most reliable evaluation of
documents, and so it uses collaborative filtering, which it implements
by having users annotate documents, and then allowing filtering using
those annotations. Because annotations are not known at the time that
document arrive, Tapestry filters must not only test incoming
documents, but must also run repeatedly over the entire database of
documents. This paper is a report on the Tapestry design and the
status of its implementation." ,
bibdate    =    "Thu Jan 28 11:16:45 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( GOLDMAN85,
key    =    "Goldman et al." ,
author    =    "Goldman, K.J. and Goldman, S.A. and Kanellakis,
P.C. and Zdonik, S.B." ,
title    =    "ISIS: Interface for a Semantic Information System" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "328--342" ,
bibdate    =    "Wed Jun 12 11:44:18 1985" ,
)

@techreport    ( GOLDSTEIN80A,
key    =    "Goldstein" ,
author    =    "Goldstein, B.S." ,
title    =    "Constraints on Null Values in Relational Databases" ,
number    =    "80/015" ,
institution=    "Department of Computer Science" ,
address    =    "SUNY at Stony Brook" ,
year    =    "1980" ,
month    =    "nov" ,
pages    =    "1--26" ,
abstract=    "If null values are allowed in a database, the
database designer may want to restrict where they occur. Two
constructs are presented for specifying where null values may occur in
a relational database. Several examples demonstrate the use of these
two techniques. The two constructs are shown to be almost equivalent.
Implementing the enforcement of restrictions specified by these
constructs is shown to be fairly easy." ,
bibdate    =    "Thu Jan 15 15:12:57 1987" ,
owner    =    "manning" ,
)

@techreport    ( GOLDSTEIN80B,
key    =    "Goldstein" ,
author    =    "Goldstein, B.S." ,
title    =    "Constraints on Null Values in Relational Databases" ,
number    =    "80/015" ,
institution=    "SUNY at Stony Brook" ,
year    =    "1980" ,
month    =    "nov" ,
abstract=    "If null values are allowed in a database, the
database designer may want to restrict where they occur. Two
constructs are presented for specifying where null values may occur in
a relational database. Several examples demonstrate the use of these
two techniques. The two constructs are shown to be almost equivalent;
a criterion for exact equivalence is given. Under the same criterion,
interesting special cases of both constructs are also shown to be
equivalent. Implementing the enforcement of restrictions specified by
these constructs is shown to be fairly easy." ,
bibdate    =    "Thu Apr 11 15:39:20 1985" ,
)

@inproceedings    ( GONNET82,
key    =    "Gonnet \& Larson" ,
author    =    "Gonnet, G. and Larson, P." ,
title    =    "External hashing with limited internal storage" ,
booktitle=    "pods" ,
year    =    "1982" ,
pages    =    "256--261" ,
bibdate    =    "Thu Jun  6 22:23:44 1985" ,
)

@inproceedings    ( GRAAFF93,
key    =    "Graaff et al." ,
author    =    "Graaff, J. M. and Veldwijk, R. J. and Boogaard, M." ,
title    =    "Logical Data Independence Via Views: A
Misapprehension ?" ,
booktitle=    "The 3rd International Symposium on Database
Systems for Advanced Applications" ,
address    =    "Taejon, Korea" ,
month    =    "apr" ,
year    =    "1993" ,
bibdate    =    "Thu Jan 28 19:07:55 1993" ,
owner    =    "bassili" ,
)

@article    ( GRAEFE86,
key    =    "Graefe" ,
author    =    "Graefe, G." ,
title    =    "Software Modularization with the EXODUS Optimizer
Generator" ,
journal    =    "Database Engineering" ,
publisher=    "ieee" ,
volume    =    "9" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1986" ,
pages    =    "37--43" ,
abstract=    "In this paper, we describe the outline of the
rules and procedures that need to be written to create a query
optimizer in the extensible database system EXODUS. The emphasis is
put on the support the EXODUS optimizer generator architecture
provides for software modularity and incremental evolution of the data
model and the query optimizer." ,
bibdate    =    "Mon Jun  6 16:45:16 1988" ,
owner    =    "manning" ,
)

@inproceedings    ( GRAEFE87,
key    =    "Graefe \& DeWitt" ,
author    =    "Graefe, G. and DeWitt, D.J." ,
title    =    "The EXODUS Optimizer Generator" ,
booktitle=    "Proceedings of the ACM SIGMOD Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "160--172" ,
abstract=    "This paper presents the design and an initial
performance evaluation of the query optimizer generator designed for
the EXODUS extensible database system. Algebraic transformation rules
are translated into an executable query optimizer, which transforms
query trees and selects methods for executing operations according to
cost functions associated with the methods. The search strategy avoids
exhaustive search and it modifies itself to take advantage of past
experience. Computational results show that an optimizer generated for
a relational system produces access plans almost as good as those
produced by exhaustive search, with the search time cut to a small
fraction." ,
bibdate    =    "Fri Jul 24 14:39:58 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( GRAEFE89,
key    =    "Graefe" ,
author    =    "Graefe, G." ,
title    =    "Relational Division: Four Algorithms and Their
Performance" ,
booktitle=    "Proceedings of the Fifth International Conference
on Data Engineering" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1989" ,
pages    =    "94--101" ,
abstract=    "We outline three known algorithms for relational
division, the algebra operator used to express universal
quantification (for-all conditions), and a new algorithm called
hash-division. By comparing the algorithms analytically and
experimentally, we show that the new algorithm provides performance
competitive or superior to techniques used to-date, namely techniques
using sorting or aggregate functions. Furthermore, the new algorithm
can eliminate duplicates in the divisor on the fly, ignores duplicates
in the dividend, and allows two kinds of partitioning, either of which
can be used to resolve hash table overflow or to efficiently implement
the algorithm on a multi-processor system." ,
bibdate    =    "Fri Jan 12 09:49:52 1990" ,
owner    =    "robyn" ,
)

@techreport    ( GRAEFE91,
key    =    "Graefe et al." ,
author    =    "Graefe, G. and Linville, A. and Shapiro, L. D." ,
title    =    "Sort versus Hash Revisited" ,
type    =    "Technical report" ,
number    =    "CU-CS-534-91" ,
institution=    "University of Colorado at Boulder" ,
year    =    "1991" ,
month    =    "jul" ,
pages    =    "25" ,
abstract=    "Many query processing operations can be
implemented using sort or hash-based algorithms, e.g., join,
intersection, and duplicate elimination. In the early relational
database systems, only sort-based algorithms were employed. In the
last decade, hash-based algorithms have gained acceptance and
popularity, and are frequently considered generally superior to
sort-based algorithms such as merge join. In this report, we compare
sort and hash-based query processing algorithms using the Volcano
query execution engine and conclude that (a) many dualities exist
between the two types of algorithms, (b) their costs differ mostly by
percentages rather than factors, (c) special cases exist that favor
one or the other choice, and (d) there is a strong reason why both
sort and hash-based algorithms should be available in a query
processing system." ,
bibdate    =    "Tue Oct 27 20:02:46 1992" ,
owner    =    "soo" ,
)

@techreport    ( GRAEFE92,
key    =    "Graefe" ,
author    =    "Graefe, G." ,
title    =    "Query Processing Techniques for Large Databases" ,
number    =    "CU-CS-579-92" ,
institution=    "Department of Computer Science" ,
address    =    "University of Colorado at Boulder" ,
year    =    "1992" ,
month    =    "jan" ,
pages    =    "87" ,
keywords=    "Relational, Extensible, and Object-Oriented
Database Systems; Query Execution Architecture; Iterators; Complex
Query Evaluation Plans; Set Matching Algorithms; Sort-Hash Duality;
Dynamic Query Evaluation Plans; Operator Model of Parallelization;
Parallel Algorithms; Emerging Database Application Domains." ,
abstract=    "Database management systems will continue to
manage large data volumes. Thus, efficient algorithms for accessing
and manipulating large sets and sequences will be required to provide
competitive performance. The advent of object-oriented and extensible
database systems will not solve the problem; on the contrary, modern
data models exacerbate the problem. In order to manipulate large sets
of complex objects as efficiently as today's database systems
manipulate simple records, query processing algorithms and software
will become more complex, and a solid understanding of algorithm and
architectural issues is essential for the designer of database
mangement software. The survey provides foundation for the design and
implementation of query execution facilities in new database
management systems. It describes a wide array of practical query
evaluation technique for both relational and post-relational database
systems, including iterative execution of complex query evaluation
plans, the duality of sort- and hash-based set matching algorithms,
types of parallel query execution and their implementation, and
special operators for emerging database application domains." ,
bibdate    =    "Sat Nov 14 11:38:03 1992" ,
owner    =    "bassili" ,
)

@article    ( GRAEFE93,
key    =    "Graefe" ,
author    =    "Graefe, G." ,
title    =    "Query Evaluation Techniques for Large Databases" ,
journal    =    "compsurv" ,
volume    =    "25" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1993" ,
pages    =    "73--170" ,
abstract=    "Database management systems will continue to
manage large data volumes. Thus, efficient algorithms for accessing
and manipulating large sets and sequences will be required to provide
acceptable performance. The advent of object-oriented and extensible
database systems will not solve this problem. On the contrary, modern
data models exacerbate the problem: In order to manipulate large sets
of complex objects as efficiently as today's database systems
manipulate simple records, query processing algorithms and software
will become more complex, and a solid understanding of algorithm and
architectural issues is essential for the designer of database
management software. This survey provides a foundation for the design
and implementation of query execution facilities in new database
management systems. It describes a wide array of practical query
evaluation techniques for both relational and postrelational database
systems, including iterative execution of complex query evaluation
plans, the duality of sort- and hash-based set-matching algorithms,
types of parallel query execution and their implementation, and
special operators for emerging database application domains." ,
bibdate    =    "Tue Sep 21 14:01:23 1993" ,
owner    =    "soo" ,
)

@article    ( GRAEFE93A,
key    =    "Graefe \& Davison" ,
author    =    "Graefe, G. and Davison, D.~L." ,
title    =    "Encapsulation of Parallelism and
Architecture-Independence in Extensible Database Query Execution" ,
journal    =    "tse" ,
publisher=    "ieee" ,
volume    =    "19" ,
number    =    "8" ,
month    =    "aug" ,
year    =    "1993" ,
pages    =    "749--764" ,
keywords=    "Architecture-independence; distributed memory;
encapsulation of parallelism; extensible database systems;
hierarchical memory; iterators; query execution; shared memory" ,
abstract=    "Emerging database application domains demand not
only high functionality but also high performance. To satisfy these
two requirements, the Volcano query execution engine combines the
efficient use of parallelism on a wide variety of computer
architecture with an extensible set of query processing operators that
can be nested into arbitrarily complex query evaluation plans.
Volcano's novel exchange operator permits designing, developing,
debugging, and tuning data manipulation operators in single-process
environments but executing them in various forms of parallelism. The
exchange operator shields the data manipulation operators from all
parallelism issues, including process allocation, inter-process
communication, and flow control. It also hides the machine's
architecture, which can be a single-processor, shared-memory, or
distributed-memory design. It can even be hierarchical, i.e., an
interconnected group of shared-memory machines. In this paper, we
detail design and implementation of the recently generalized exchange
operator, justify our decision to support hierarchical architectures,
and argue that the exchange operator offers a significant advantage
for development and maintenance of database query processing software.
We also discuss the integration of bit vector filtering into the
exchange operator paradigm with only minor modifications." ,
bibdate    =    "Tue Nov 23 22:59:36 1993" ,
owner    =    "daisyc" ,
)

@article    ( GRAEFE93B,
key    =    "Graefe" ,
author    =    "Graefe, Goetz" ,
title    =    "Options in Physical Database Design" ,
journal    =    "SIGMOD Record" ,
publisher=    "ACM" ,
volume    =    "22" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1993" ,
pages    =    "76--83" ,
abstract=    "A conerstone of modern database systems is
physical data independence, i.e., the seperation of a type and its
associated operations from its physical representation in memory and
on storage media. Users manipulate and query data at the logical
level; the DBMS translates these logical operations to operations on
files, indices, records, and disks. The efficiency of these physical
operations depends very much on the choice of data representations.
Choosing a physical representation for a logical database is called
physical database design. The number of possible choices in physical
database design is very large; moreover, they very often interact with
each other. We attempt to list and classify these choices and to
explore their interactions. The purpose of this paper is to provide an
overview of possible options to the DBMS developer and some guidance
to the DBMS administrator and user. While much of our discussion will
draw in the relational data model, physical database design is of even
more importance for object-oriented and extensible systems. The
reasons are simple: First, the number of logical data types and their
operations is larger, requiring and permitting more choices for their
representation. Second, the state of the art in query optimization for
these systems is much less developed than for relational systems,
making careful physical database design even more imperative for
object-oriented database systems." ,
bibdate    =    "Tue Nov 29 20:33:38 1994" ,
owner    =    "kevin" ,
)

@article    ( GRAEFE94,
key    =    "Graefe" ,
author    =    "Graefe, Goetz" ,
title    =    "Volcano---An Extensible and Parallel Query
Evaluation System" ,
journal    =    "tkde" ,
publisher=    "IEEE" ,
volume    =    "6" ,
number    =    "1" ,
month    =    "feb" ,
year    =    "1994" ,
pages    =    "120--135" ,
keywords=    "Dynamic query evaluation plans; extensible
database systems; iterators; operator model of parallelization; query
execution" ,
abstract=    "To investigate the interactions of extensibility
and parallelism in database query processing, we have developed a new
dataflow query execution system called Volcano. The Volcano effort
provides a rich environment for research and education in database
systems design, heuristics for query optimization, parallel query
execution, and resource allocation. Volcano uses a standard interface
between algebra operators, allowing easy additionof new operators and
operator implementations. Operations on individual items, e.g.,
predicates, are imported into the query processing operators using
support functions. The semantics of support functions is not
prescribed; any data type including complex objects and any operation
can be realized. Thus, Volcano is extensible with new operators,
algorithms, data types, and type-specific methods. Volcano includes
two novel meta-operators. The choose-plan meta-operator supports
dynamic query evaluation plans that allow delaying selected
optimization decisions until run-time, e.g., for embedded queries with
free variables. The exchange meta-operator supports intra-operator
parallelism on partitioned datasets and both vertical and horizontal
inter-operator parallelism, translating between demand-driven dataflow
within processes and data-driven dataflow between processes. All
operators, with the exception of the exchange operator, have been
designed and implemented in a single-process environment, and
parallelized using the exchange operator. Even operators not yet
designed can be parallelized using this new operator if they use and
provide the interator interface. Thus, the issues of data manipulation
and parallelism have become orthogonal, making Volcano the first
implemented query execution engine that effectively combines
extensibility and parallelism." ,
bibdate    =    "Tue Nov 29 19:31:56 1994" ,
owner    =    "kevin" ,
)

@article    ( GRAEFE94A,
key    =    "Graefe et al." ,
author    =    "Graefe, Goetz and Linville, Ann and Shapiro,
Leonard D." ,
title    =    "Sort vs. Hash Revisited" ,
journal    =    "tkde" ,
publisher=    "IEEE" ,
volume    =    "6" ,
number    =    "6" ,
month    =    "dec" ,
year    =    "1994" ,
pages    =    "934--944" ,
keywords=    "Database query processing; value-matching;
performance; sorting; merge-join; hashing; hash join; hybrid hash
join; comparison; duality" ,
abstract=    "Efficient algorithms for processing large volumes
of data are very important both for relational and new object-oriented
database systems. Many query-proccessing operations can be implemented
using sort- or hash-based algorithms, e.g., intersection, join, and
duplicate elimination. In the early relational database systems, only
sort-based algorithms were employed. In the last decade, hash-based
algorithms have gained acceptance and popularity, and are often
considered generally superior to sort-based algorithms such as
merge-join. In this article, we compare the concepts behind sort- and
hash-based query-processing algorithms and conclude that 1) many
dualities exist between the two types of algorithms, 2) their costs
differ mostly by percentages rather than factors, 3) several special
cases exist that favor one or the other choice, and 4) there is a
strong reason why both hash- and sort-based algorithms should be
available in a query-processing system. Our conclusions are supported
by experiments performed using the Volcano query execution engine." ,
bibdate    =    "Sat Dec  3 18:36:51 1994" ,
owner    =    "kevin" ,
)

@article    ( GRANDI93D,
key    =    "Grandi \& Scalas" ,
author    =    "Grandi, F. and Scalas, M.~R." ,
title    =    "Block Access Estimation for Clustered Data Using a
Finite LRU Buffer" ,
journal    =    "tse" ,
publisher=    "ieee" ,
volume    =    "19" ,
number    =    "7" ,
month    =    "jul" ,
year    =    "1993" ,
pages    =    "641--660" ,
keywords=    "Block accesses; buffer management; databases; data
clustering; indexed access; performance evaluation; physical design;
query optimization; relational database" ,
abstract=    "Data access cost evaluation is fundamental in the
design and management of database systems. When some data items have
duplicates, a clustering effect which can heavily influence access
costs is observed. The availability of a finite amount of buffer
memory in real systems has an even more dramatic impact. In this paper
a comprehensive cost model for clustered data retrieval by an index
using a finite buffer is presented. Our approach combines and extends
previous models based either on finite buffer or on uniform data
clustering assumptions. The computational cost of the formulas we
propose in this work is independent of the data size or of the query
cardinality and need only a single statistics per search key, the
clustering factor, to be maintained by the system. The predictive
power and the accuracy of the model are shown in comparison with
actual costs resulting from simulations." ,
bibdate    =    "Tue Nov 23 23:13:29 1993" ,
owner    =    "daisyc" ,
)

@techreport    ( GRANT80,
key    =    "Grant \& Minker" ,
author    =    "Grant, J. and Minker, J." ,
title    =    "On optimizing the evaluation of a set of
expressions" ,
institution=    "University of Maryland, Department of Computer
Science" ,
number    =    "TR-916" ,
month    =    "jul" ,
year    =    "1980" ,
bibdate    =    "Mon Oct 23 08:40:45 1989" ,
owner    =    "robyn" ,
)

@article    ( GRANT92,
key    =    "Grant \& Minker" ,
author    =    "Grant, J. and Minker, J." ,
title    =    "The Impact of Logic Programming on Databases" ,
journal    =    "cacm" ,
volume    =    "35" ,
number    =    "3" ,
month    =    "mar" ,
year    =    "1992" ,
pages    =    "66--82" ,
abstract=    "none given" ,
bibdate    =    "Wed Apr  1 15:20:41 1992" ,
owner    =    "curtis" ,
)

@techreport    ( GRAY75,
key    =    "Gray et al." ,
author    =    "Gray, J.N. et al." ,
title    =    "Granularity of Locks and Degrees of Consistency in
a Relational Database" ,
institution=    "IBM San Jose, RJ 1654" ,
month    =    "sep" ,
year    =    "1975" ,
)

@inbook        ( GRAY78,
key    =    "Gray" ,
author    =    "Gray, J.N." ,
title    =    "Notes on Database Operating Systems" ,
booktitle=    "Operating Systems-An Advanced Course" ,
publisher=    "Springer-Verlag" ,
year    =    "1978" ,
series    =    "Lecture Notes in Computer Science" ,
volume    =    "60" ,
pages    =    "393--481" ,
bibdate    =    "Thu Jan 15 15:08:12 1987" ,
owner    =    "manning" ,
)

@article    ( GRAY81,
key    =    "Gray et al." ,
author    =    "Gray, J. and McJones, P. and Blasgen, M. and
Lindsay, B. and Lorie, R. and Price, T. an and Putzolu, F. and
Traiger, I." ,
title    =    "The Recovery Manager of the System R Database
Manager" ,
journal    =    "comsurv" ,
publisher=    "acm" ,
volume    =    "13" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1981" ,
pages    =    "223--242" ,
keywords=    "Transactions; database; recovery; reliability" ,
abstract=    "The recovery subsystem of an experimental data
management system is described and evaluated. The transaction concept
allows application programs to commit, abort, or partially undo their
effects. The DO-UNDO-REDO protocol allows new recoverable types and
operations to be added to the recovery system. Application programs
can record data in the transaction log to facilitate
application-specific recovery. Transaction undo and redo are based on
records kept in a transaction log. The checkpoint mechanism is based
on differential files (shadows). The recovery log is recorded on disk
rather than tape." ,
bibdate    =    "Thu Jan 15 13:46:27 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( GRAY83,
key    =    "Gray" ,
author    =    "Gray, Jim" ,
title    =    "Practical Problems in Data Management - A position
paper" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "acm" ,
address    =    "PO Box 64145, Baltimore, MD 21264" ,
editor    =    "DeWitt, David J., Gardarin, Georges" ,
month    =    "may" ,
year    =    "1983" ,
pages    =    "3" ,
bibdate    =    "Tue Nov 20 14:47:44 1984" ,
)

@inproceedings    ( GRAY87,
key    =    "Gray \& Putzolu" ,
author    =    "Gray, J. and Putzolu, F." ,
title    =    "The 5 Minute Rule for Trading memory for Disc
Accesses" ,
booktitle=    "Proceedings of the SIGMod 1987 Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "395--398" ,
abstract=    "If an item is accessed frequently enough, it
should be main memory resident. For current technology, ``frequently
enough'' means about every five minutes. Along a similar vein, one can
frequently trade memory space for cpu time. For example, bits can be
packed in a byte at the expense of extra instructions to extract the
bits. It makes economic sense to spend ten bytes of main memory to
save one instruction per second. These results depend on current price
ratios of processors, memory and disc accesses. These ratios are
changing and hence the constants in the rules are changing." ,
bibdate    =    "Fri Sep  4 13:36:08 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( GRAY87A,
key    =    "Gray \& Anderton" ,
author    =    "Gray, J.N. and Anderton, M." ,
title    =    "Distributed Computer Systems: Four Case Studies" ,
booktitle=    "Proceedings of the IEEE, Special Issue on
Distributed Databases" ,
organization=    "ieee" ,
publisher=    "ieee" ,
volume    =    "75" ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "719--726" ,
abstract=    "Distributed computer applications built from
off-the-shelf hardware and software are increasingly common. This
paper examines four such distributed systems with contrasting degrees
of decentralized hardware, control, and redundancy. The first is a
one-site system, the second is a node-replicated system at a remote
site for disaster backup, the third is a multi-site system with
central control, and the fourth is a multi-site system with node
autonomy. The application, design rationale, and experience of each of
these systems are briefly sketched." ,
bibdate    =    "Fri Mar  4 12:49:26 1988" ,
owner    =    "manning" ,
)

@article    ( GREMILLION82,
key    =    "Gremillion" ,
author    =    "Gremillion, L." ,
title    =    "Designing a Bloom Filter for Differential File
Access" ,
journal    =    "cacm" ,
volume    =    "25" ,
number    =    "9" ,
month    =    "sep" ,
year    =    "1982" ,
pages    =    "600--604" ,
bibdate    =    "Fri Apr 26 23:25:06 1985" ,
)

@unpublished    ( GRIFFITHS80,
key    =    "Griffiths" ,
author    =    "Griffiths, Patricia" ,
title    =    "A Heuristic Algorithm for Routing Queries in a
Distributed Data Base" ,
year    =    "1980" ,
)

@article    ( GUENTHER90,
key    =    "Guenther \& Buchmann" ,
author    =    "Guenther, O. and Buchmann, A." ,
title    =    "Research Issues in Spatial Databases" ,
journal    =    "sigmod" ,
volume    =    "19" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1990" ,
pages    =    "61--68" ,
bibdate    =    "Sun Jan 19 20:49:13 1992" ,
owner    =    "soo" ,
)

@article    ( GUNTHER91,
key    =    (G\"{u}nther \& Bilmes) ,
author    =    (G\"{u}nther, O. and Bilmes, J.) ,
title    =    "Tree--Based Access Methods for Spatial Databases:
Implementation and Performance Evaluation" ,
journal    =    "tkde" ,
publisher=    "IEEE" ,
volume    =    "3" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1991" ,
pages    =    "342--356" ,
abstract=    "The cell tree is a new dynamic access method for
spatial databases. All data objects in the database are represented as
unions of convex point sets (cells). The cell tree is a balanced tree
structure whose leaves contain the cells and whose interior nodes
correspond to a hierarchy of nested convex polyhedra. This index
structure allows quick access to the cells ( and therefore to the data
objects) that occupy a given location in space. Furthermore, the cell
tree is designed for paged secondary memory to minimize the number of
disk accesses occurring during a tree search. Point and range searches
can therefore be carried out very efficiently using the cell tree.
This paper reports our experiences with the implementation of the cell
tree and presents the results of an experimental performance
comparison with two related structures: the R-tree by Guttman and the
R+-tree by Sellis et al. Although the cell tree often requires more
storage space and more CPU time to answer a search query, it usually
obtains the results with a lower number of disk accesses than the two
rival structures." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( GUPTA95A,
key    =    "Gupta \& Mumick" ,
author    =    "Gupta, Ashish and Mumick, Inderpal Singh" ,
title    =    "Maintenance of Materialized Views: Problems,
Techniques, and Applications" ,
journal    =    "IEEE Data Engineering" ,
volume    =    "18" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1995" ,
pages    =    "3--18" ,
bibdate    =    "Thu Nov  9 17:52:46 1995" ,
owner    =    "bib" ,
)

@inproceedings    ( GUTIERREZ94,
key    =    "Gutierrez et al." ,
author    =    "Gutierrez, Alejandro and Pucheral, Philippe and
Steffen, Hermann and Thevenin, Jean-Marc" ,
title    =    "Database Graph Views: A Practical Model to Manage
Persistent Graphs" ,
booktitle=    "vldb" ,
publisher=    "Morgan Kauffman" ,
month    =    "sep" ,
year    =    "1994" ,
bibdate    =    "Wed Sep 21 13:11:05 1994" ,
owner    =    "kevin" ,
)

@techreport    ( GUTTMAN83,
key    =    "Guttman \& Stonebraker" ,
author    =    "Guttman and Stonebraker" ,
title    =    "R-Trees: A Dynamic Index Structure for Spatial
Searching" ,
number    =    "M83/64" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1983" ,
bibdate    =    "Mon Nov  2 10:48:54 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( GUTTMAN84,
key    =    "Guttman" ,
author    =    "Guttman, A." ,
title    =    "R-Trees: A Dynamic Index Structure For Spatial
Searching" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Yormack, B." ,
address    =    "Boston, MA" ,
month    =    "jun" ,
year    =    "1984" ,
pages    =    "47--57" ,
abstract=    "In order to handle spatial data efficiently, as
required in computer aided design and geo-data applications, a
database system needs an index mechanism that will help it retrieve
data items quickly according to their spatial locations. However,
traditinal indexing methods are not well suited to data objects of
non-zero size located in multidimensional spaces. In this paper we
describe a dynamic index structure called an R-tree which meets this
need, and give algorithms for searching and updating it. We present
the results of a series of tests which indicate that the structure
performs well, and conclude that it is useful for current database
systems in spatial applications." ,
bibdate    =    "Mon Oct  1 09:17:53 1984" ,
)

@inproceedings    ( GYSSENS88,
key    =    "Gyssens \& Van Gucht" ,
author    =    "Gyssens, Marc and Van Gucht, Dirk" ,
title    =    "The Powerset Algebra as a Result of Adding
Programming Constructs to the Nested Relational Algebra" ,
booktitle=    "Proceedings of the ACM SIGMOD '88" ,
year    =    "1988" ,
pages    =    "225--232" ,
month    =    "" ,
)

@article    ( HAAS90,
key    =    "Haas et al." ,
author    =    "Haas, L., Chang, W., Lohman, G., McPherson, M.,
Wilms, P., Lapis, G., Lindsay, B., Pirahesh, H., Carey, M., and
Shekita, E. " ,
title    =    "Starburst Mid-Flight: As The Dust Clears" ,
journal    =    "tkde" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "Mar" ,
year    =    "1990" ,
pages    =    "143--160" ,
keywords=    " data structures, extensibility, plan
optimization, query processing, relational database system, rule
systems." ,
abstract=    " The Starburst project, at IBM's Almaden Research
Center, is improving the design of relational database management
systems and enhancing their performance, while building an extensible
system to better support nontraditional applications (such as
engineering, geographic, office, etc.), and to serve as a testbed for
future improvements in database technology. As of November 1989, we
have an initial prototype of our system up and running. In this paper,
we reflect on the design and implementation of the Starburst system to
date. We examine some key design decisions, and how they affect the
goal of improved structure and performance. We also examine how well
we have met our goal of extensibility: what aspects of the system are
extensible, how extensions can be done. and how easy it is to add
extensions. We discuss some actual extensions to the system, including
the experiences of our first real customizers." ,
bibdate    =    "Sun Aug  4 22:03:18 1991" ,
owner    =    "suchen" ,
)

@inproceedings    ( HAAS92,
key    =    "Haas \& Swami" ,
author    =    "Haas, P. J. and Swami, A. N." ,
title    =    "Sequential Sampling Procedures for Query Size
Estimation" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "San Diego, California" ,
editor    =    "Stonebraker, M." ,
volume    =    "21" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "341--350" ,
abstract=    "We provide a procedure, based on random sampling,
for estimation of the size of a query result. The procedure is
sequential in that sampling terminates after a random number of steps
according to a stopping rule that depends upon the observations
obtained so far. Enough observations are obtained so that, with a
prespecified probability, the estimate differs from the true size of
the query result by no more than a prespecified amount. Unlike
previous sequential estimation procedures for queries, our procedure
is asymptotically efficient and requires no ad hoc pilot sample or a
priori assumptions about data characteristics. In addition to
establishing the asymptotic properties of the estimation procedure, we
provide techniques for reducing undercoverage at small sample sizes
and show that the sampling cost of the procedure can be reduced
through stratified sampling techniques." ,
bibdate    =    "Mon Jan 25 13:47:51 1993" ,
owner    =    "bassili" ,
)

@article    ( HAAS95,
key    =    "Haas \& Swami" ,
author    =    "Haas, P. J. and Swami, A. N." ,
title    =    "Sampling-Based Selectivity Estimation for Joins
Using Augmented Frequent Value Statistics" ,
journal    =    "ieee" ,
year    =    "1995" ,
pages    =    "522--531" ,
bibdate    =    "Fri Nov 17 13:53:52 1995" ,
abstract=    "We compare empirically the cost of estimating the
selectivity of a star join using the sampling-based t_cross procedure
to the cost of computing the join and obtaining the exact answer. The
relative cost of sampling can be excessive when a join attribute value
exhibits 'heterogeneos skew'. To alleviate this problem, we propose
Algorithm TCM, a modified version of t_cross that incorporates
'augmented frequent value' (AFV) statistics. We provide a
sampling-based method for estimating AFV statistics that does not
require indexes on attribute values, requires only one pass though
each relation, and uses an amount of memory much smaller than the size
of a relation. Our experiments show that the use of estimated AFV
statistics can reduce the relative cost of sampling by orders of
magnitude. We also show that use of estimated AFV statistics can
reduce the relative error of the classical System R selectivity
formula." ,
owner    =    "jeff" ,
)

@article    ( HABERHAUER90,
key    =    "Haberhauer" ,
author    =    "Haberhauer, Franz" ,
title    =    "Physical Database Design Aspects of Relational
DBMS Implementations" ,
journal    =    "Information Systems" ,
year    =    "1990" ,
volume    =    "15" ,
number    =    "3" ,
pages    =    "375--389" ,
month    =    "" ,
)

@article    ( HAC85,
key    =    "Hac" ,
author    =    "Hac, A." ,
title    =    "Distributed File Systems - A Survey" ,
journal    =    "opsysrev" ,
volume    =    "19" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1985" ,
pages    =    "15--18" ,
bibdate    =    "Wed Mar  6 11:05:20 1985" ,
)

@inproceedings    ( HACHEM89,
key    =    "Hachem \& Berra" ,
author    =    "Hachem, N. I. and Berra, B. P." ,
title    =    "Key-Sequential Access Methods for Very Large Files
Derived from Linear Hashing" ,
booktitle=    "Proceedings of the Fifth International Conference
on Data Engineering" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1989" ,
pages    =    "305--312" ,
abstract=    "In this paper a new class of order preserving
dynamic hashing structures is introduced and analyzed. The access
method is referred to as dynamic random-sequential access method
(DRSAM) and is derived from linear hashing. With respect to previous
methods DRSAM presents the following characteristics: 1) the structure
captures the hashed order in consecutive storage areas so that order
preserving schemes result in performance improvements for range
queries and sequential processing. 2) It adapts elastic buckets
[LOM87] for the control of file growth. This approach outperforms the
partial expansion method previously proposed by Larson [LAR82]. The
file structure is also extended with proper control mechanisms to cope
with non-uniform distributions. The outcome is a multi-level trie
stored as a two-level sequentially allocated file." ,
bibdate    =    "Fri Jan 12 10:45:11 1990" ,
owner    =    "robyn" ,
)

@article    ( HACHEM92,
key    =    "Hachem \& Berra" ,
author    =    "Hachem, N.I. and Berra, P.B." ,
title    =    "New Order Preserving Access Methods for Very Large
Files Derived from Linear Hashing" ,
journal    =    "tkde" ,
volume    =    "4" ,
number    =    "1" ,
month    =    "feb" ,
year    =    "1992" ,
pages    =    "68--82" ,
keywords=    "Access method, consecutive retrieval, dynamic file
structures, management of very large files, order preserving hashing,
random and sequential files, searching" ,
abstract=    "In this paper a new class of order preserving
dynamic hashing structures is introduced and analyzed. The access
method is referred to as dynamic random-sequential access method
(DRSAM) and is derived from linear hashing. We propose a new logical
to physical mapping based on sequential bucket allocations in hash
order. With respect to previous methods this allocation technique has
the following characteristics: 1) the structure captures the hashed
order in consecutive storage areas so that order preserving (OPH)
schemes should result in performance improvements for range queries
and sequential processing. 2) It adapts elastic buckets for the
control of growth. Under specific conditions, this approach
outperforms the partial expansion method previously proposed by
Larson." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( HADERLE84,
key    =    "Haderle \& Jackson" ,
author    =    "Haderle, D. J., R. D. Jackson" ,
title    =    "IBM Database2 Overview" ,
journal    =    "IBM Syst. J." ,
volume    =    "23" ,
number    =    "2" ,
year    =    "1984" ,
pages    =    "p112--125" ,
bibdate    =    "Sat Mar 23 21:08:05 1991" ,
owner    =    "suchen" ,
)

@article    ( HAERDER78,
key    =    "Haerder" ,
author    =    "Haerder, T." ,
title    =    "Implementing a Generalized Access Path Structure
for a Relational Database System" ,
journal    =    "tods" ,
volume    =    "3" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1978" ,
pages    =    "285--298" ,
bibdate    =    "Sat Apr 27 22:53:42 1985" ,
)

@unpublished    ( HAERDER82,
key    =    "Haerder \& Reuter" ,
author    =    "Haerder, T. and Reuter, A." ,
title    =    "Principles of transaction-oriented database
recovery" ,
year    =    "1982" ,
bibdate    =    "Fri Mar  1 14:01:22 1985" ,
)

@inproceedings    ( HAERDER87,
key    =    "Haerder \& Rothermel" ,
author    =    "Haerder, T. and Rothermel, K." ,
title    =    "Concepts for Transaction Recovery in Nested
Transactions" ,
booktitle=    "Proceedings of the SIGMod 1987 Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, Ca" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "239--248" ,
abstract=    "The concept of nested transactions offers more
decomposable execution units and finer grained control over recovery
and concurrency as compared to 'flat' transactions. To exploit these
advantages, especially transaction recovery has to be refined and
adjusted to the requirements of the control structure. In this paper,
we investigate transaction recovery for nested transactions.
Therefore, a model for nested transaction is introduced allowing for
synchronous and asynchronous transaction invocation as well as single
call and conversational interfaces. For the resulting four parameter
combinations, the properties and dependencies of transaction recovery
are explored if a transaction is 'unit of recovery' and if savepoints
within transactions are used to gain finer recovery units." ,
bibdate    =    "Thu Sep  3 11:31:33 1987" ,
owner    =    "manning" ,
)

@incollection    ( HALL76,
key    =    "Hall et al." ,
author    =    "Hall, P. and Owlett, J. and Todd, S. J. P." ,
title    =    "Relations and Entities" ,
booktitle=    "Modelling in Data Base Management Systems" ,
publisher=    "North-Holland" ,
year    =    "1976" ,
editor    =    "Nijssen, G. M." ,
pages    =    "201--220" ,
)

@article    ( HALL76A,
key    =    "Hall" ,
author    =    "Hall, P.A.V." ,
title    =    "Optimization of Single Expressions in a Relational
Data Base System" ,
journal    =    "IBM Journal of Research and Development" ,
volume    =    "20" ,
number    =    "3" ,
month    =    "may" ,
year    =    "1976" ,
pages    =    "244--257" ,
abstract=    "This paper examines optimization within a
relational data base system. It considers the optimization of a single
query defined by an expression of the relational algebra. The
expression is transformed into an equivalent expression or sequence of
expressions that cost less to evaluate. Alternative transformations,
and combinations of several transformations, are anlayzed.
Measurements on an experimental data base showed improvements,
especially in cases where the original expression would be
impracticably slow in its execution. A small overhead was incurred,
which would be negligible for large data bases." ,
bibdate    =    "Thu Nov 19 20:36:36 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( HALL84,
key    =    "Hall" ,
author    =    "Hall, P.A.V." ,
title    =    "Relational Algebras, Logic, and Functional
Programming" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Yormark, B." ,
address    =    "Boston, MA" ,
month    =    "jun" ,
year    =    "1984" ,
pages    =    "326--333" ,
abstract=    "Relational algebras as developed by Codd and his
followers are extended by noting an equivalence with functional
languages. This leads to higher order relations, recursive definitions
of relations, and the use of higher order relations are recursive data
structures. This equivalence on the one hand enables the technology of
databases to be used within the context of applicative languages, and
on the other hand removes the adhoc mechanisms used for higher order
operations in relational databases. This leads from 4th to 5th
generation data management, exploiting the mathematical foundations of
functional languages and logic programming, and the technology of
relational databse." ,
annote    =    "What I have done is develop or reapproachment
between Relational Algebras, Logic programming and Functional
Programming. The correspondence between relational databases and logic
has been known for a long time and led to fruitful result. The
correspondence of these two with functional programming languages is
the interesting one. For logic programming the correspondence with a
higher-order relational algebra may suggest a way of moving logic
programming into higher order logics, as desired by Kowonlski. The
next step in this line of development of databases must be the
incorporation of update and time. [from the conclusion.]" ,
bibdate    =    "Mon Oct  1 10:03:25 1984" ,
)

@inproceedings    ( HAMMER78,
key    =    "Hammer \& Sarin" ,
author    =    "Hammer, M. and Sarin, S. K." ,
title    =    "Efficient monitoring of database assertions" ,
booktitle=    "sigmod" ,
address    =    "Austin, TX" ,
year    =    "1978" ,
pages    =    "159" ,
bibdate    =    "Tue Nov  7 15:26:38 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( HAMMER80,
key    =    "Hammer \& Zdonik" ,
author    =    "Hammer, Michael and Zdonik Jr., Stanley B." ,
title    =    "Knowledge-Based Query Processing" ,
booktitle=    "Proceedings of the Sixth International Conference
on Very Large Data Bases" ,
year    =    "1980" ,
pages    =    "137--147" ,
month    =    "" ,
)

@article    ( HAMMER81,
key    =    "Hammer \& McLeod" ,
author    =    "Hammer, M. and McLeod, D." ,
title    =    "Database Description with SDM: A Semantic Database
Model" ,
journal    =    "tods" ,
year    =    "1981" ,
month    =    "sep" ,
volume    =    "6" ,
number    =    "3" ,
pages    =    "351--386" ,
)

@article    ( HAMMER95A,
key    =    "Hammer et al." ,
author    =    "Hammer, Joachim and Garcia-Molina, Hector and
Widom, Jennifer and Labio, Wilburt and Zhuge, Yue" ,
title    =    "The Stanford Data Warehousing Project" ,
journal    =    "IEEE Data Engineering" ,
volume    =    "18" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1995" ,
pages    =    "41--48" ,
bibdate    =    "Thu Nov  9 17:47:03 1995" ,
owner    =    "bib" ,
)

@inproceedings    ( HAN87,
key    =    "Han \& Henschen" ,
author    =    "Han, Jiawei and Henschen, Lawrence J." ,
title    =    "Handling Redundancy in the Processing of Recursive
Database Queries" ,
booktitle=    "Proceedings of the ACM SIGMOD '87" ,
year    =    "1987" ,
pages    =    "73--81" ,
month    =    "" ,
)

@mastersthesis    ( HANSON84A,
key    =    "Hanson" ,
author    =    "Hanson, E.N." ,
title    =    "User-Defined Aggregates in the Relational Database
System INGRES" ,
school    =    "ucbcsd" ,
month    =    "dec" ,
year    =    "1984" ,
abstract=    "This report describes the design of a facility
that allows the definition of new aggregates in the INGRES database
management system. Two methods for defining aggregates are presented.
The first is a flexible interface allowing expert users to tailor
efficient aggregates to their needs using a small set of C
subroutines. The second allows non-programmers to define new
aggregates using only QUEL*, an extension of the QUEL query language.
The query processing algorithms necessary to compute aggregates
defined with these interfaces are also discussed, along with several
optimizations which allow more efficient processing of both
user-defined and built-in aggregates." ,
bibdate    =    "Fri Nov 20 15:50:15 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( HANSON87,
key    =    "Hanson" ,
author    =    "Hanson, E.N." ,
title    =    "A Performance Analysis of View Materialization
Strategies" ,
booktitle=    "Proceedings of the ACM SIGMOD Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "440--453" ,
abstract=    "The conventional way to process commands for
relational views is to use query modification to translate the
commands into ones on the base relations. An alternative approach has
been proposed recently, whereby materialized copies of views are kept,
and incrementally updated immediately after each modification of the
database. A related scheme exists, in which update of materialized
views is deferred until just before data is retrieved from the view. A
performance analysis is presented comparing the cost of query
modification, immediate view maintenance, and deferred view
maintenance. Three different models of the structure of views are
given: a simple selection and projection of one relation, the natural
join of two relations, and an aggregate (e.g., the sum of values in a
column) over a selection-projection view. The results show that the
choice of the most efficient view maintenance method depends heavily
on the structure of the database, the view definition, and the type of
query and update activity present." ,
bibdate    =    "Fri Jul 24 16:29:04 1987" ,
owner    =    "manning" ,
)

@phdthesis    ( HANSON87B,
key    =    "Hanson" ,
author    =    "Hanson, E.N." ,
title    =    "Efficient Support for Rules and Derived Objects in
Relational Database Systems" ,
school    =    "ucbcsd" ,
month    =    "aug" ,
year    =    "1987" ,
abstract=    "This thesis presents the design and analysis of a
collection of algorithms to support triggers, inference rules, and
derived data objects (e.g., views) in relational database systems. A
basic component of algorithms for testing rule conditions is known as
rule indexing. Given a collection of rule conditions and a database
record, a rule indexing algorithm finds all the conditions that are
satisfied by that record. A rule indexing technique called basic
locking has been previously proposed. Basic locking is known as a
lock-based algorithm because it places special locks on data records
and in conventional indexes. Two other lock-based rule indexing
methods, reduced basic locking and mark intersection are proposed
here, and the performance all three algorithms is analyzed. A vew
maintenance algorithm is a method for maintaining and incrementally
updating a physically stored copy of a database view. A new view
maintenance algorithm called Rete view maintenance (RVM) is proposed
in this thesis. RVM is based on the Rete Network, a type of
discrimination network used to test rule conditions in
forward-chaining rule interpreters. Methods are discussed for
improving the performance of view maintenance algorithms by utilizing
rule indexing techniques. A collection of algorithms is also proposed
to allow maintenance of materialized aggregates and aggregate
functions. By keeping a stored copy of a view up-to-date using a view
maintenance algorithm, it is possible to process view queries directly
using the copy. The conventional way to process queries against views
is to use query modification, whereby a view query is translated into
an equivalent query that refers only to the base relations. A
performance analysis is presented which compares the average cost of a
view query for these two alternatives for different view types,
including a simple selection from one relation, the join of two
relations, and an aggregate over one relation. A related performance
analysis is also presented comparing the costs of different algorithms
for querying database procedures. The database procedures analyzed are
made up of one or more database queries stored in the field of a
record. The value of a database procedure is the result of executing
the query or queries in its definition. Three different algorithms for
processing queries against database procedures are evaluated. The
first algorithm is to always execute the queries in the procedure. The
second algorithm requires caching the last value returned by executing
the queries in the procedure; if the cached value is valid when the
procedure is queried, the value from the cache is returned. Otherwise,
the procedure value is recomputed, and written to refresh the cache.
The third algorithm is to use a view maintenance method to keep a
stored copy of the procedure result up-to-date at all times, and
return the result whenever itis requested. As in the case for views,
the average query cost for each algorithm is compared." ,
bibdate    =    "Sun Nov 22 14:15:58 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( HANSON88,
key    =    "Hanson" ,
author    =    "Hanson, E.N." ,
title    =    "Processing Queries Against Database Procedures: A
Performance Analysis" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
address    =    "Chicago, IL" ,
month    =    "jun" ,
year    =    "1988" ,
pages    =    "295--302" ,
abstract=    "A database procedure is a collection of queries
stored in the database. Several methods are possible for processing
queries that retrieve the value returned by a database procedure. The
conventional algorithm is to execute the queries in a procedure
whenever it is accessed. A second strategy requires caching the
previous value returned by the database procedure. If the cached value
is valid at the time of a query, the value is returned immediately. If
the cached value has been invalidated by an update, the value is
recomputed, stored back into the cache, and then returned. A third
strategy uses a differential view maintenance algorithm to maintain an
up-to-date copy of the value returned by the procedure. This paper
compares the performance of these three alternatives. The results show
that which algorithm is preferred depends heavily on the database
environment, particularly the frequence of updates and the size of
objects retrieved by database procedures." ,
bibdate    =    "Fri Jul 22 16:16:23 1988" ,
owner    =    "" ,
)

@proceedings    ( HANSON91,
key    =    "Hanson, et al." ,
title    =    "Experiences in DBMS Implementation Using an
Object-Oriented Persistent Programming Language and a Database Toolkit" ,
publisher=    "OOPSLA'91" ,
author    =    "Hanson, et al." ,
year    =    "1991" ,
month    =    "Oct" ,
abstract=    "The EXODUS database tookit, and in particular the
E persistent programming language, ahve been used in two substantial
database system implementation efforts by the authors (the Ariel
database rule system and the Triton nested relation DBMS). Observed
advantages of using a persistent programming language for database
system implementation include ease of implementation of special
purpose persistent objects used by the DBMS such as catalogs, data
indexes, rule indexes, and nested relational structures. Other
advantages of using E (a persistent version of C++) that are
independent of the persistence issue are the usefulness of
object-oriented programming in developing large software systems, and
the utility of the collection abstraction in E. Observed disadvantages
include (1) the inability to map the type system of the DBMS to the
type system of the underlying programming language while still retaing
good performace for ad-hoc queries, and (2) software engineering
difficulties due to the distinction in E between database types and
main-memory types." ,
bibdate    =    "Thu Oct 31 16:43:07 1991" ,
owner    =    "suchen" ,
)

@inproceedings    ( HANSON92,
key    =    "Hanson" ,
author    =    "Hanson, E. N." ,
title    =    "Rule Condition Testing and Action Execution in
Ariel" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "San Diego, California" ,
editor    =    "Stonebraker, M." ,
volume    =    "21" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "49--58" ,
abstract=    "This paper describes testing of rules conditions
and execution of rule actions in Ariel active DBMS. The Ariel rule
system is tightly coupled with query and update processing. Ariel
rules can have conditions based on a mix of patterns, events, and
transitions. For testing rule conditions, Ariel makes use of a
discrimination network composed of a special data structure for
testing single-relation selection conditions efficiently, and a
modified version of TREAT algorithm, called A-TREAT, for testing join
conditions. The key modification to TREAT (which could also be used in
the Rete algorithm) is the use of virtual alpha-memory nodes which
save storage since they contain only the predicate associated with the
memory node instead of copies of data matching the predicate. The
rule-action executor in Ariel binds the data matching a rule's
condition to the action of the rule at rule fire time, and executes
the rule action using the query processor." ,
bibdate    =    "Mon Jan 25 13:31:29 1993" ,
owner    =    "bassili" ,
)

@article    ( HARDER88,
key    =    "Harder" ,
author    =    "Harder, Theo" ,
title    =    "Handling Hot Spot Data in DB-Sharing Systems" ,
journal    =    "Information Systems" ,
year    =    "1988" ,
volume    =    "13" ,
number    =    "2" ,
pages    =    "155--166" ,
month    =    "" ,
)

@article    ( HARDER93,
key    =    "Harder \& Rothermel" ,
author    =    "Harder, T. and Rothermel, K." ,
title    =    "Concurrency Control Issues in Nested Transactions" ,
journal    =    "The VLDB Journal" ,
publisher=    "VLDB Endowment" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1993" ,
pages    =    "39--74" ,
keywords=    "Nested transactions; concurrency control; locking;
object hierarchies" ,
abstract=    "The concept of nested transactions offers more
decomposable execution units and finer-grained control over
concurrency and recovery than 'flat' transactions. Furthermore, it
supports the decomposition of a 'unit of work' into subtasks and their
appropriate distribution in a computer system as a prerequisite of
intratransaction parallelism. However, to exploit its full potential,
suitable granules of concurrency control as well as access modes for
shared data are necessary. In this article, we investigate various
issues of concurrency control as well as access modes for share data
are necessary. In this article, we investigate various issues of
concurrency control for nested transactions. First, the mechanisms for
cooperation and communication within nested transactions should not
impede parallel execution of transactions among parent and children or
among siblings. Therefore, a model for nested transactions is proposed
allowing for effective exploitation of intra-transaction parallelism.
Starting with a set of basic locking rules, we introduce the concept
of 'downward inheritance of locks' to make data manipulated by a
parent available to its children. To support supervised and restricted
access, this concept is refined to 'controlled downward inheritance'.
The initial concurrency control scheme was based on S-X locks for
'flat', non-overlapping data objects. In order to adjust this scheme
for practical applications, a set of concurrency control rules is
derived for generalized lock modes described by a compatibility
matrix. Also, these rules are combined with a hierarchical locking
scheme to improve selective access to data granules of varying sizes.
After having tied together both types of hierarchies (transaction and
object), it can be shown how 'controlled downward inheritance' for
hierarchical objects is achieved in nested transactions. Finally,
problems of deadlock detection and resolution in nested transactions
are considered." ,
bibdate    =    "Tue Mar  9 20:52:18 1993" ,
owner    =    "bassili" ,
)

@article    ( HARDWICK87,
key    =    "Hardwick \& Spooner" ,
author    =    "Hardwick, Martin and Spooner, David L." ,
title    =    "Comparison of Some Data Models for Engineering
Objects" ,
journal    =    "IEEE CG \& E" ,
year    =    "1987" ,
volume    =    "" ,
number    =    "" ,
pages    =    "56--66" ,
month    =    "July" ,
)

@techreport    ( HARDWICK89,
key    =    "Hardwick et al." ,
author    =    "Hardwick, Martin and Downie, Blair and Hvannberg,
Ebba and Spooner, David and Loffredo, David" ,
title    =    "The Rose File Object Protocol for Concurrent
Engineering Applications" ,
institution=    "Rensslaer Design Research Center" ,
year    =    "1989" ,
type    =    "" ,
number    =    "" ,
address    =    "RPI, Troy NY 12180" ,
month    =    "" ,
note    =    "Submitted to 2nd International Conference on Data
and Knowledge Systems for Manufacturing and Engineering" ,
)

@inproceedings    ( HARDWICK90,
key    =    "Hardwick et al." ,
author    =    "Hardwick, M. and Spooner, D. and Hvannberg, E. and
Downie, B. and Faulstich, A. and Loffredo, D. and Mehta, A. and
Sanderson, D." ,
title    =    "{\it ROSE\/} A Database System for Concurrent
Engineering Applications" ,
booktitle=    "Proceedings of the Second Conference on Concurrent
Engineering" ,
publisher=    "CERC" ,
address    =    "West Virginia University" ,
month    =    "feb" ,
year    =    1990 ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@techreport    ( HARDWICK91,
key    =    "Hardwick et al." ,
author    =    "Hardwick, M. and Spooner, D. and {\it The ROSE
Group\/}" ,
title    =    "{\it ROSE 3.0\/} Reference Manual" ,
institution=    "Rensselaer Design Research Center" ,
address    =    " Troy, NY" ,
year    =    "1991" ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( HARLAND87,
key    =    "Harland \& Beloff" ,
author    =    "Harland, D.M. and Beloff, B." ,
title    =    "OBJEKT: A Persistent Object Store With An
Integrated Garbage Collector" ,
journal    =    "sigplan" ,
publisher=    "acm" ,
volume    =    "22" ,
number    =    "4" ,
month    =    "apr" ,
year    =    "1987" ,
pages    =    "70--79" ,
abstract=    "This paper describes OBJEKT, a single-level
persistent storage system desgined for the REKURSIV architecture. It
will be shown that OBJEKT can be microcoded to implement ``objects''
efficiently, and that data integrity can be guaranteed by provision of
an object oriented instruction set. Particular attention will be paid
to its facilities for type and range checking, to its object by object
paging strategy and to ways of enchancing parallelism during garbage
collection." ,
bibdate    =    "Thu Apr  9 12:03:30 1987" ,
owner    =    "manning" ,
)

@article    ( HARTZBAND85,
key    =    "Hartzband \& Maryanski" ,
author    =    "Hartzband, David J. and Maryanski, Fred J." ,
title    =    "Enhancing Knowledge Representation in Engineering
Databases" ,
journal    =    "IEEE" ,
year    =    "1985" ,
volume    =    "" ,
number    =    "" ,
pages    =    "39--48" ,
month    =    "September" ,
)

@article    ( HARVEY90,
key    =    "Harver" ,
author    =    "Harvey, David A." ,
title    =    "State of the Media" ,
journal    =    "Byte" ,
year    =    "1990" ,
volume    =    "" ,
number    =    "" ,
pages    =    "275--282" ,
month    =    "November" ,
)

@article    ( HARVEY91,
key    =    "Harvey et al." ,
author    =    "Harvey, T. and Schnepf, C. and Roth, M." ,
title    =    "The Design of the Triton Nested Relational
Database System" ,
journal    =    "sigmod" ,
publisher=    "ACM" ,
volume    =    "20" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1991" ,
pages    =    "62--72" ,
abstract=    "Unique database requirements of applications such
as computer-aided design (CAD), computer-aided software engineering
(CASE), and office information systems (OIS) have driven the
development of new data models and database systems based on these new
models. In particular, the goal of these new database systems is to
exploit the advantages of complex data models that are more efficient
(in terms of time and space) than their relational counterparts. In
this paper, we describe the design and implementation of the Triton
nested relational database system, a prototype system based on the
nested relational data model. Triton is intended to be used as the
backend storage and access component of the aforementioned
applications. This paper describes the architecture of the Triton
system, and compares the performance of the nested relational model
versus the relational model using Triton. In addition, this paper
evaluates the EXODUS extensible database toolkit used in the
development of the Triton system including key features of the
persistent programming language E and the EXODUS storage manager." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( HASKIN82A,
key    =    "Haskin \& Lorie" ,
author    =    "Haskin, R.L. and Lorie, R.A." ,
title    =    "On Extending the Functions of a Relational
Database System" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
address    =    "Orlando, FL" ,
editor    =    "Schkolnick, M." ,
month    =    "jun" ,
year    =    "1982" ,
pages    =    "207--212" ,
abstract=    "Relational database systems are attracting great
interest from potential users outside the traditional areas in which
such systems have been employed. Features of modern relational systems
such as powerful query facilities, data and device independence,
concurrency control, and recovery are useful in applications such as
engineering design, office automation, and graphics. However, such
applications place demands on the system that it must be extended to
handle. This paper identifies three of these demands: storing
non-coded information of arbitrary length within the database, dealing
with aggregate objects as a unit, and improving support for
interactive access. Additions to System R, a prototype relational
system, are introduced to satisfy these demands: long fields, for
storing non-coded data, and complex objects, which declare the
semantic relationship among data items and provide a means for
adequately supporting interactive access." ,
bibdate    =    "Thu Nov 19 20:54:29 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( HAWTHORN79,
key    =    "Hawthorn \& Stonebraker" ,
author    =    "Hawthorn, P. and Stonebraker, M." ,
title    =    "Performance Analysis of a Relational Data Base
Management System" ,
booktitle=    "sigmod" ,
volume    =    "9" ,
year    =    "1979" ,
pages    =    "1--12" ,
bibdate    =    "Fri Apr 26 14:23:30 1985" ,
)

@article    ( HEERJEE88,
key    =    "Heerjee \& Sadeghi" ,
author    =    "K. B. Heerjee and R. Sadeghi" ,
title    =    "Rapid Implementation of SQL: A Case Study Using
YACC and LEX" ,
journal    =    "Inf. Softw. Technol. (UK)" ,
volume    =    "30" ,
number    =    "4" ,
month    =    "May" ,
year    =    "1988" ,
pages    =    "228 -- 236" ,
keywords=    "SQL YACC LEX" ,
bibdate    =    "Fri Mar 22 11:45:56 1991" ,
owner    =    "suchen" ,
)

@inproceedings    ( HEILER90,
key    =    "Heiler \& Zdonik" ,
author    =    "Heiler, Sandra and Zdonik, Stanley" ,
title    =    "Object Views: Extending the Vision" ,
booktitle=    "Proceedings of the Sixth International Conference
on Data Engineering" ,
year    =    "1990" ,
pages    =    "86--93" ,
month    =    "February" ,
)

@inproceedings    ( HELD75,
key    =    "Held et al." ,
author    =    "Held, G.D. and Stonebraker, M. and Wong, E." ,
title    =    "INGRES--A Relational Data Base Management System" ,
booktitle=    "ncc" ,
address    =    "Anaheim, CA" ,
month    =    "may" ,
year    =    "1975" ,
pages    =    "409--416" ,
publisher=    "AFIPS Press" ,
volume    =    "44" ,
bibdate    =    "Wed Dec 29 16:58:59 1982" ,
)

@phdthesis    ( HELD75A,
key    =    "Held" ,
author    =    "Held, G.D." ,
title    =    "Storage Structures for Relational Data Base
Management Systems" ,
school    =    "University of California" ,
address    =    "Berkeley, CA" ,
month    =    "dec" ,
year    =    "1975" ,
abstract=    "Storage structures are examined which allow
efficient access to information in a relational data base management
system. The major areas investigated are: 1) storage structures for
data relations, 2) storage structures for auxiliary information to
speed access to data, and 3) a strategy for selecting structures based
on query statistics. First, a large class of possible storage
structures for data relations is examined. A generalized directory
structure is defined and is shown to provide better performance than
either normal directories or simple order preserving functions. An
algorithm for constructing generalize directories is described with
complexity which is linear in file size and results of experiments
using the algorithm are given. Tradeoffs between dynamic directories
(i.e. continously reorganizing) and static directories (i.e.
periodically reorganizing) are discussed. Static directories are shown
to be preferred on the basis of secondary index, concurrency, and
directory size considerations. Next, several types of auxiliary
storage structures are considered. Secondary indices on functions of
attributes are introduced and a method for reusing aggregation
information is presented. Finally, a general strategy for making
storage structure choices is presented. The query model previously
used for key selection is extended to provide more accurate choice of
key domains. The strategy selects data relation storage structures,
primary key domains and auxiliary structures." ,
bibdate    =    "Thu Jan 15 13:06:40 1987" ,
owner    =    "manning" ,
)

@article    ( HELD78,
key    =    "Held" ,
author    =    "Held, G. and Stonebraker, M." ,
title    =    "B-trees Re-examined" ,
journal    =    "cacm" ,
volume    =    "21" ,
number    =    "2" ,
month    =    "feb" ,
year    =    "1978" ,
pages    =    "139--143" ,
bibdate    =    "Fri Apr 26 23:48:13 1985" ,
)

@article    ( HELD89,
key    =    "Held \& Carlis" ,
author    =    "Held, J. P. and Carlis, J. V." ,
title    =    "The Applicative Data Model" ,
journal    =    "Information Sciences" ,
year    =    "1989" ,
pages    =    "249--283" ,
abstract=    "The applicative data model is a conceptual-level
model designed to support the data modeling of expert systems. It was
developed using the same modeling methodology we advocate for other
applications, by designing a metaschema using its data definition
language, and so it is self-descriptive. Its metaschema incorporates
both types and instances of data (including itself), removing the
arbitrary distinction between schema and data. The model includes a
functional, extendible data manipulation language and constraint
definition language. The emphasis of this model is on providing a
small set of orthogonal constructs that can be combined in regular
ways to model data." ,
bibdate    =    "Thu Jan 11 10:24:47 1990" ,
owner    =    "robyn" ,
)

@article    ( HENSCHEN84,
key    =    "Henschen \& Shamim" ,
author    =    "Henschen, L.J. and Shamim, A.N." ,
title    =    "On Compiling Queries Recursive First-Order
Databases" ,
journal    =    "jacm" ,
volume    =    "31" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1984" ,
pages    =    "47--85" ,
keywords=    " algorithms; languages; theory; logic and
databases; recursively defined relations; logic program compilation" ,
abstract=    "A first-order database is defined as a
function-free, first-order theory in which the ground units serve as
the extensional database and the proper nonlogical axioms serve as the
intensional database. The following problem is addressed: ``Given a
recursive nonlogical axiom and the form of a potential query, can one
describe a set of database retrieval requests that gives the correct
answers and is guaranteed to terminate.'' The solution uses
resolution-proof techniques over connection graphs to derive a program
of relational database operations that gives all the answers to a
query and has a well-defined termination condition. " ,
bibdate    =    "Fri Feb 15 10:51:32 1985" ,
)

@inproceedings    ( HERBST94,
key    =    "Herbst" ,
author    =    "Herbst, A." ,
title    =    "Long-Term Database Support for EXPRESS Data" ,
booktitle=    "Seventh International Conference on Scientific and
Statistical Database Management" ,
address    =    "Charlottesville, VA" ,
month    =    "sep" ,
year    =    "1994" ,
bibdate    =    "Thu Aug 10 16:35:38 1995" ,
owner    =    "jeff" ,
abstract=    "The data modeling language STEP/EXPRESS enjoys a
spreading popularity beyond engineering. Its structural object
orientation, for instance, is appropriate for scientific and
statistical database (SSDB) modeling as well. As our database
prototype illustrates, EXPRESS can also be used for data definition.
Following the STEP approach, data manipulation is done via SDAI
(Standard Data Access Interface). Besides increasing awareness of
evolving STEP technology, this paper elaborates on a common issue of
both engineering databases and SSDBs: the long-term retention of vast
amounts of data. The storage of massive data over decades imposes
serious problems on any DBMS. Application-oriented database archiving
helps solve them. We indicate how to exploit and enhance SDAI to make
it an archive interface." ,
)

@incollection    ( HEWITT84,
key    =    "Hewitt" ,
author    =    "Hewitt, Carl" ,
title    =    "An Artificial Intelligence Perspective" ,
booktitle=    "On Conceptual Modelling" ,
publisher=    "Springer Verlag" ,
year    =    "1984" ,
editor    =    "Michael J. Brodie and John Mylopoulos and Joachim
W. Schmidt" ,
chapter    =    "17" ,
pages    =    "453--455" ,
)

@article    ( HEYTENS89,
key    =    "Heytens \& Nikhil" ,
author    =    "Heytens, M. and Nikhil, R." ,
title    =    "GESTALT: An Expressive Database Programming System" ,
journal    =    "sigmod" ,
volume    =    "18" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1989" ,
pages    =    "54--67" ,
abstract=    "Many new database applications require
computational and data modelling power simply not present in
conventional database management systems. Developers are forced to
design complex encodings of complex data into a limited set of
database types, and to embed DML commands into a host programming
language, a notoriously tricky and error-prone enterprise. In this
paper, we describe the design and implementation of GESTALT, a system
and methodology for organizing and for organizing and interfacing to
multiple heterogeneous, existing database systems. Application
programs are written in a supported programming language (currently C
and Lisp) using high-level data and control abstractions native to the
language. The system is flexible in that the underlying database
systems can easily be replaced/upgraded/augmented without affecting
existing application programs. We also describe our experience with
the system: GESTALT has been in daily operational use at MIT for over
a year, supporting an information system for CAF, a research facility
for the automation of semiconductor fabrication." ,
bibdate    =    "Mon Oct 23 10:59:44 1989" ,
owner    =    "robyn" ,
)

@article    ( HINRICHS85,
key    =    "Hinrichs" ,
author    =    "Hinrichs, K." ,
title    =    "Implementation of the Grid File: Design Concepts
and Experience" ,
journal    =    "bit" ,
volume    =    "25" ,
year    =    "1985" ,
pages    =    "569--592" ,
abstract=    "The grid file is an adaptable, symmetric multikey
file structure. It stores highly dynamic sets of multidimensional data
in such a way that different types of queries can be performed using
few disk accesses. We present the design concepts underlying our
implementation of the grid file and describe applications of the grid
file system." ,
bibdate    =    "Thu Jan 15 13:13:12 1987" ,
owner    =    "manning" ,
)

@phdthesis    ( HINRICHS85A,
key    =    "Hinrichs" ,
author    =    "Hinrichs, K.H." ,
title    =    "The Grid File System: Implementation and Case
Studies of Applications" ,
school    =    "Swiss Federal Institute of Technology Zurich" ,
address    =    "Zurich" ,
year    =    "1985" ,
number    =    "Diss.ETH Nr. 7734" ,
abstract=    "The grid file, introduced by Nievergelt et al., is
an adaptable, symmetric multikey file structure. It organizes highly
dynamic sets of multidimensional data on secondary storage in such a
way that differnet types of queries can be performed using few disk
accesses. We present the grid file system, a portable software package
for storing multidimensional data on secondary storage which is based
on the grid file concept. We describe the design concepts underlying
the grid file system and offer solutions to some problems which have
been left open in the original grid file concept. The grid file system
allows the user to perform several types of queries on the data stored
in a collection of grid files. We describe algorithms for query
evaluation. Although the grid file has been designed primarily for
storing points in multidimensional space it can also be used for
storing geometric data. We describe how spatial objects can be
transformed into points in higher-dimensional spaces and stored in
grid files. Case studies of applications justify the design concepts
underlying the grid file system. Some of these applications show that
the grid file system is well suited for applications involving large
sets of geometric data such as computer-aided design, geographic
information systems or VLSI design. The logic programming language
Prolog is especially well suited as a query language for data bases. A
Prolog front end to the grid file system is described which allows the
user to work interactively with the data stored in grid files and
makes available the full power of Prolog." ,
bibdate    =    "Mon Feb  2 10:54:32 1987" ,
owner    =    "manning" ,
)

@article    ( HIRSCHHEIM89,
key    =    "Hirschheim \& Klein" ,
author    =    "Hirschheim, Rudy and Klein, Heinz K." ,
title    =    "Four Paradigms of Information Systems Development" ,
journal    =    "Communications of the ACM" ,
year    =    "1989" ,
volume    =    "32" ,
number    =    "10" ,
pages    =    "1199--1216" ,
month    =    "October" ,
)

@article    ( HO89,
key    =    "Ho et al" ,
author    =    "Ho, P. and Yang, W. and Hsu, M." ,
title    =    "Concurrent Operations in Multi-Dimensional
Extendible Hashing" ,
journal    =    "Journal of Information and Engineering" ,
volume    =    "5" ,
year    =    "1989" ,
pages    =    "51--72" ,
keywords=    "Concurrency control; extendible hashing;" ,
abstract=    "An algorithm for synchronizing concurrent
operations on multi-dimensional extendible hash files is presented.
The algorithm is deadlock free and allows the search and partial-match
operations to proceed concurrently with the insertion operations
without having to acquire any locks. It also allows concurrent
insertion/deletion operations to proceed without having to acquire
locks on the directory entries. The algorithm combines the notion of
verification, the principle of the optimistic concurrency control
algorithm, and the special and known semantics of operations in
multi-dimensional extendible hash files. A correctness argument for
the proposed algorithm is also presented." ,
bibdate    =    "Mon Sep 25 15:00:07 1989" ,
owner    =    "robyn" ,
)

@article    ( HOAGLAND85,
key    =    "Hoagland" ,
author    =    "Hoagland, A.S." ,
title    =    "Information Storage Technology A Look at the
Future" ,
journal    =    "Computer" ,
volume    =    "18" ,
number    =    "7" ,
month    =    "jul" ,
year    =    "1985" ,
pages    =    "60--67" ,
bibdate    =    "Thu Jul 25 14:17:50 1985" ,
)

@inproceedings    ( HOEL92,
key    =    "Hoel \& Samet" ,
author    =    "Hoel, E. G. and Samet, H." ,
title    =    "A Qualitative Comparison Study of Data Structures
for Large Line Segment Databases" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "San Diego, California" ,
editor    =    "Stonebraker, M." ,
volume    =    "21" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "205--214" ,
abstract=    "A qualitative comparative study is performed of
the performance of three popular spatial indexing methods - the
R*-tree, R+tree, and the PMR quadtree - in the context of processing
spatial queries in large line segment database. The data is drawn from
the TIGER/Line files used by the Bureau of the Census to deal with the
road networks in the US. The goal is not to find the best data
structure as this is not generally possible. instead, their
comparability is demonstrated and an indication is given as to when
and why their performance differs. Tests are conducted with a number
of large datasets and performance is tabulated in terms of the
complexity of the disk activity in building them, their storage
requirements, and the complexity of the disk activity for a number of
tasks that include point and window queries, as well as finding the
nearest line segment to a given point and an enclosing polygon." ,
bibdate    =    "Mon Jan 25 13:39:50 1993" ,
owner    =    "bassili" ,
)

@techreport    ( HONG89,
key    =    "Hong \& wong" ,
author    =    "Hong, Wei and Wong, Eugene" ,
title    =    "Multiple Query Optimization Through State
Transition and Decomposition" ,
institution=    "Electronics Research Laboratory, College of
Engineering, University of California at Berkeley" ,
year    =    "1989" ,
type    =    "Memorandum," ,
number    =    "UCB/ERL M89/25" ,
address    =    "Berkeley, California 94720" ,
month    =    "March" ,
)

@techreport    ( HONG92,
key    =    "Hong et al." ,
author    =    "Hong, D. and Johnson, T. and Chakravarthy, S." ,
title    =    "Real-Time Transaction Scheduling: A Cost Conscious
Approach" ,
number    =    "UF-CIS-TR-92-043" ,
institution=    "University of Florida" ,
address    =    "Department of Computer and Information Sciences" ,
year    =    "1992" ,
month    =    "nov" ,
pages    =    "21" ,
abstract=    "Real-time databases are an increasingly important
component of embedded real-time systems. In a real-time database
context, transactions must not only maintain the consistency
constraints of the database but must also satisfy the timing
constraints specified for each transaction. Although several
approaches have been proposed to integrate real-time scheduling and
database concurrency control methods, none of them take into account
the dynamic cost of scheduling a transaction. In this paper, we
propose a new cost conscious real-time transaction scheduling
algorithm which considers both static and dynamic costs associated
with a transaction. Our dynamic priority assignment algorithm adapts
to changes in the system load without causing excessive numbers of
transaction restarts. Our simulations show its superiority over EDF-HP
algorithm." ,
bibdate    =    "Tue Jan 19 13:15:18 1993" ,
owner    =    "bassili" ,
)

@techreport    ( HORWITZ86A,
key    =    "Horwitz" ,
author    =    "Horwitz, S.B." ,
title    =    "Adding Relational Databases to Existing Software
Systems: Implicit Relations and a New Relational Query Evaluation
Method" ,
number    =    "674" ,
institution=    "Computer Sciences Department, University of
Wisconsin" ,
address    =    "Madison, WI" ,
year    =    "1986" ,
month    =    "nov" ,
abstract=    "Interactive software systems should include query
handlers. Query handlers based on the relational database model are
attractive because the model provides a uniform, non-procedural
approach to query writing. Standard relational database systems
require that all information be stored in relations; however, the data
structures used by existing software systems are generally
non-relational, and it is impractical to replace them with relations.
A new kind of relations, implicit relations, and a new approach to
query evaluation based on the use of access functions allow software
systems to include relational query facilities without giving up
existing non-relational data structures. The new query-evaluation
method can also be used in traditional relational databases, and may
be more efficient than traditional evaluation methods when applied to
queries that use set operators. " ,
bibdate    =    "Thu Feb 19 12:08:40 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( HOU89,
key    =    "Hou, et al." ,
author    =    (Hou, W.-C. and \"{O}zsoyo\v{g}lu, G. and Taneja,
B.K.) ,
title    =    "Processing Aggregate Relational Queries with Hard
Time Constraints" ,
booktitle=    "sigmod" ,
organization=    "ACM SIGMOD" ,
month    =    "may" ,
year    =    "1989" ,
pages    =    "68--77" ,
abstract=    "We consider those database environments in which
queries have strict timing constraints, and develop a time-constrained
query evaluation methodology. For aggregate relational algebra
queries, we describe a time constrained query evaluation algorithm.
The algorithm, which is implemented in our prototype DBMS, iteratively
samples from input relations, and evaluates the associated estimators
developed in our previous work, until a stopping criterion (e.g., a
time quota or a desired error range) is satisfied. To determine sample
sizes at each stage of the iteration (so that the time quota will not
be overspent) we need to have (a) accurate sample selectivity
estimations of the RA operators in the query, (b) precise time cost
formulas, and (c) good time-control strategies. To estimate the sample
selectivities of RA operators, we use a run-time sample selectivity
estimation and improvement approach which is flexible. For query time
estimations, we use time-cost formulas which are adaptive and precise.
To use the time quota efficiently, we propose statistical and
heuristic time-control strategies to control the risk of overspending
the time quota. Preliminary evaluation of the implemented prototype is
also presented." ,
)

@article    ( HOU91,
key    =    (Hou \& \"{O}zsoyo\v{g}lu) ,
author    =    (Hou, Wen-Chi and Gultekin \"{O}zsoyo\v{g}lu) ,
title    =    "Statistical Estimators for Aggregate Relation
Algebra Queries" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "16" ,
number    =    "4" ,
month    =    "Dec" ,
year    =    "1991" ,
pages    =    "600--654" ,
keywords=    "Algorithm, management, performance, theory,
relational algebra, ssampling, selectivity, simple random sampling,
statistical estimators" ,
abstract=    "This paper discusses the estimation of COUNT(E)
queries by sampling, where E is an arbitrary relational algebra
expression. Consistent and unbiased statistical estimators for
COUNT(E) are proposed without any assumptions on the distributions of
attribute values or the orderings of tuples in the operand relations
of E. We present a set of COUNT(E)estimator evaluation algorithms, all
based on simple random sampling, and each suitable for a different
type of relational algebra expression E. To improve the efficiency,
propose three enhancements, and revise the estimator evaluation
algorithems to incorporate the enhancements. One of the enhancements
is the use of cluster sampling. Estimator evaluation algorithm with
the enhancements ahve been incorporated into a prototype DBMS. We
present the performance evaluation of the estimators using the
implemented prototype DBMS." ,
bibdate    =    "Thu Jan 16 16:04:55 1992" ,
owner    =    "suchen" ,
)

@article    ( HOU93,
key    =    "Hou \& Ozsoyoglu" ,
author    =    "Hou, W. and Ozsoyoglu, G." ,
title    =    "Processing Time-Constrained Aggregate Queries in
CASE-DB" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "18" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1993" ,
pages    =    "224--261" ,
keywords=    "Estimation; relational algebra; risk of
overspending; sampling; selectivity; time constraints" ,
abstract=    "In this paper, we present an algorithm to strictly
control the time to process an estimator for an aggregate relational
query. The algorithm implemented in a prototype database management
system, called CASE-DB, iteratively samples from input relations, and
evaluates the associated estimator until the time quota expires. In
order to estimate the time cost of a query, CASE-DB uses adaptive time
cost formulas. The formulas are adaptive in that the parameters of the
formulas can be adusted at run timeto better fit the characteristics
of a query. To control the use of time quota, CASE-DB adopts the
one-at-a-time-interval time control strategy to make a tradeoff
between the risks of overspending and the overhead finally,
experimental evaluation of the methodology is presented." ,
bibdate    =    "Wed Jul 21 23:01:37 1993" ,
owner    =    "daisyc" ,
)

@article    ( HSIAO70,
key    =    "Hsiao \& Harary" ,
author    =    "Hsiao, D. and Harary, F." ,
title    =    "A Formal System for Information Retrieval from
Files" ,
journal    =    "cacm" ,
volume    =    "13" ,
number    =    "2" ,
month    =    "feb" ,
year    =    "1970" ,
pages    =    "67--73" ,
bibdate    =    "Sun May  5 17:15:03 1985" ,
)

@article    ( HSIAO89,
key    =    "Hsiao \& Kamel" ,
author    =    "Hsiao, D. and Kamel, M." ,
title    =    "Heterogeneous Databases: Proliferation, Issues,
and Solutions" ,
journal    =    "tkde" ,
volume    =    1 ,
pages    =    "45--62" ,
month    =    "mar" ,
year    =    1989 ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( HSIAO92,
key    =    "Hsiao" ,
author    =    "Hsiao, D." ,
title    =    "Federated Databases and Systems: Part II -- A
Tutorial on Their Resource Consolidation" ,
journal    =    "The VLDB Journal" ,
publisher=    "VLDB Endowment" ,
volume    =    "1" ,
number    =    "2" ,
month    =    "oct" ,
year    =    "1992" ,
pages    =    "285--310" ,
keywords=    "Interoperability of heterogeneous databases and
systems (attribute-based, hierarchical, network, relational,
object-oriented); data-sharing techniques (database conversion, schema
transformation, transaction translation,
data-model-and-language-to-data-model-and-language mappings)" ,
abstract=    "The issues and solutions for the interoperability
of a class of heterogeneous databases and their database systems are
expounded in two parts. Part I presented the data-sharing issues in
federated databases and systems (Hsiao, 1992). The present article
explores resource-consolidation issues. Interoperability in this
context refers to data sharing among heterogeneous databases, and to
resource consolidation of computer hardware, system software, and
support personnel. Resource consolidation requires the presence of a
database system architecture which supports the heterogeneous system
software, thereby eliminating the need for various computer hardware
and support personnel. The class of heterogeneous databases and
database systems expounded herein termed federated, meaning that they
are joined in order to meet certain organizational requirements and
because they require their respective application specifications,
integrity constraints, and security requirements to be upheld.
federated databases and systems are new. While there are no
technological solutions, there has been considerable research towards
their development. This tutorial is aimed at exposing the need for
such solutions. A taxonomy is introduced in our review of existing
research undertakings and exploratory developments. With this
taxonomy, we contrast and compare various approaches to federating
databases and systems." ,
bibdate    =    "Thu Jan 28 11:57:31 1993" ,
owner    =    "bassili" ,
)

@article    ( HSIAO92A,
key    =    "Hsiao" ,
author    =    "Hsiao, D." ,
title    =    "Federated Databases and Systems: Part I -- A
Tutorial on Their Data Sharing" ,
journal    =    "VLDB Journal" ,
publisher=    "VLDB Endowment" ,
volume    =    "1" ,
number    =    "1" ,
month    =    "jul" ,
year    =    "1992" ,
pages    =    "127--179" ,
keywords=    "interoperability of heterogeneous databases and
systems (attribute-based, hierarchical, network, relational,
object-oriented); data-sharing techniques (database conversion, schema
transformation, transaction translation,
data-model-and-language-to-data-model-and-language mappings)" ,
abstract=    "The issues and solutions for the interoperability
of a class of heterogeneous database and their database systems are
expounded in two parts. Part I presents the data-sharing issues in
federated databases and systems. Part II, which will appear in a
future issue, explores resource-consolidation issues. Interoperability
in this context refers to data sharing among heterogeneous databases,
and to resource consolidation of computer hardware, system software,
and support personnel. Resource consolidation requires the presence of
a database system architecture which supports the heterogeneous system
software, thereby eliminating the need for various computer hardware
and support personnel. The class of heterogeneous databases and
database systems expounded herein is termed federated, meaning that
they are joined in order to meet certain organizational requirements
and because they require their respective application specificities,
integrity constraints, and security requirements to be upheld.
Federated databases and systems are new. While there are no
technological solutions, there has been considerable research towards
their development. This tutorial is aimed at exposing the need for
such solutions. A taxonomy is introduced in our review of existing
research undertakings ad exploratory developments. With this taxonomy,
we contrast and compare various approaches to federated databases and
systems." ,
bibdate    =    "Thu Jan 28 18:57:42 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( HSU85,
key    =    "Hsu \& Imielinski" ,
author    =    "Hsu, A. and Imielinski, T." ,
title    =    "Integrity Checking For Multiple Updates" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "152--168" ,
bibdate    =    "Tue Jun 11 12:01:43 1985" ,
)

@techreport    ( HSU89A,
key    =    "Hsu \& Rattner" ,
author    =    "Hsu, C. and Rattner, L." ,
title    =    "Information Modeling for Computerized
Manufacturing" ,
number    =    "37-89-191" ,
institution=    "Rensselaer Polytechnic Institute Decision Sciences
and Engineering Systems Department" ,
year    =    1989 ,
annote    =    "Early work that was evolve into GIRD, good
presentation of TSER" ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( HSU90,
key    =    "Hsu et al." ,
author    =    "Hsu, C. and Bouziane, M. and Rattner, L. and Yee,
L." ,
title    =    "{\it GIRD} A Meta-database Structure for
Heterogeneous Distributed Environments" ,
booktitle=    "Proceedings Second International Conference on
Computer Integrated Manufacturing" ,
publisher=    "IEEE Press" ,
address    =    "New York" ,
year    =    1990 ,
annote    =    "The major paper on GIRD, which involves
translation by matching of specification denoted in the TSER model.
TSER is a Two Stage ER approach, the first stage modeling overall
semantics and behavior, the next stage more concrete specifications." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( HSU92A,
key    =    "Hsu et al." ,
author    =    "Hsu, I.-M. and Singhal, M. and Liu, M.T." ,
title    =    "Distributed Rule Processing in Active Databases" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "ieee" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Alamitos, CA" ,
editor    =    "Golshani, F." ,
volume    =    "8" ,
month    =    "feb" ,
year    =    "1992" ,
pages    =    "106--113" ,
abstract=    "Processing rules in a distributed active database
involves three design issues: how to decompose rules, how to
distribute rules to sites, and how to evaluate distributed rules
correctly. In this paper, we study these three issues for complicated
rules, which are complex and time-consuming to evaluate. We propose a
new relational operator, AND, and the associated algebraic
manipulations of this operator to find independent parts of rule
query, which can be distributed among sites. Due to geographical
dispersion in a distributed system, correct evaluation of distributed
rules is not trival. We propose a distributed evaluation algorithm
which guarantees the correctness of the evaluation result of the
distributed rule by collecting consistent local results from sites to
form a global view." ,
bibdate    =    "Sat Aug 29 15:21:19 1992" ,
owner    =    "leoso" ,
)

@article    ( HSU93,
key    =    "Hsu \& Snodgrass" ,
author    =    "Hsu, S.H. and Snodgrass, R." ,
title    =    "Optimal Block Size for Set-Valued Attributes" ,
journal    =    "Information Processing Letters" ,
year    =    "1993" ,
bibdate    =    "Wed Oct 21 11:17:35 1992" ,
owner    =    "rts" ,
)

@article    ( HUDSON89,
key    =    "Hudson \& King" ,
author    =    "Hudson, S. E. and King, R." ,
title    =    "Cactis: A Self-Adaptive, Concurrent Implementation
of an Object-Oriented Database Management System" ,
journal    =    "tods" ,
volume    =    "14" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1989" ,
pages    =    "291--321" ,
keywords=    "Algorithms; Design; Performance; Buffer
management; derived data; object-oriented database systems;
self-adapted optimization" ,
abstract=    "Cactis is an object-oriented, multiuser DBMS
developed at the University of Colorado. The system supports
functionally-defined data and uses techniques based on attributed
graphs to optimize the maintenance of functionally-defined data. The
implementation is self-adaptive in that the physical organization and
the update algorithms dynamically change in order to reduce disk
access. The system is also concurrent. At any given time there are
some number of computations that must be performed to bring the
database up to date; these computations are scheduled independently
and are performed when the expected cost to do so is minimal. The DBMS
runs in the Unix/C Sun workstation environment. Cactis is designed to
support applications that require rich data modeling capabilities and
the ability to specify functionally-defined data, but that also demand
good performance. Specifically, Cactis is intended for use in the
support of such applications as VLSI and PCB design, and software
environments." ,
bibdate    =    "Tue Nov  7 13:36:38 1989" ,
owner    =    "robyn" ,
)

@techreport    ( HUDSON90,
key    =    "Hudson" ,
author    =    "Hudson, S." ,
title    =    "Space Efficient Object-Level Statistics for
Self-Adaptive Optimization" ,
number    =    "90-20" ,
institution=    "University of Arizona" ,
address    =    "Tucson, AZ" ,
year    =    "1990" ,
month    =    "may" ,
pages    =    "1--10" ,
abstract=    "This paper considers techniques for maintaining
object-level statistics useful in self-adaptive optimization of
object-oriented databases. These techniques allow approximate counts
to be maintained in very little space -- typically 3 to 5 bits each.
This allows statistics to be maintained for each relationship or
pointer at the object level without dramatically increasing the size
of each object. Two probabilistic techniques for approximate counting
are presented and compared. An object-oriented database simulation is
used to explore the performance of these techniques in the context of
a self-adaptive clustering optimization." ,
bibdate    =    "Thu Aug 16 07:28:39 1990" ,
owner    =    "robyn" ,
)

@article    ( HULL87,
key    =    "Hull \& King" ,
author    =    "Hull, R. and King, R." ,
title    =    "Semantic Database Modeling: Survey, Applications
and Research Issues" ,
journal    =    "compsurv" ,
volume    =    19 ,
pages    =    "201--260" ,
month    =    "sep" ,
year    =    1987 ,
annote    =    "A good overview of semantics and data models. It
draws contrasts between different types of semantic models, and
between OO and semantic extensions to DBMS. A tutorial on the basic
concepts is also presented. Also considered is the relations between
semantic data models an AI constructs." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@techreport    ( IOANNIDIS85,
key    =    "Ioannidis" ,
author    =    "Ioannidis" ,
title    =    "Bounded Resursion in Deductive Data Bases" ,
number    =    "M85/6" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1985" ,
bibdate    =    "Mon Nov  2 10:51:36 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( IOANNIDIS85B,
key    =    "Ioannidis" ,
author    =    "Ioannidis, Y.E." ,
title    =    "A Time Bound on the Materialization of Some
Recursively Defined Views" ,
booktitle=    "vldb" ,
address    =    "Stockholm, Sweden" ,
editor    =    "Pirotte, A. and Vassiliou, Y." ,
month    =    "aug" ,
year    =    "1985" ,
pages    =    "219--226" ,
abstract=    "A virtual relation ( or view) can be defined with
a recursive statement that is a function of one or more base
relations. In general, the number of times such a statement must be
applied in order to retrieve all the tuples in the virtual relation
depends on the contents of the base relations involved in the
definition. However, there exist statements for which there is an
upper bound on the number of applications necessary to form the
virtual relation, independent of the contents of the base relations.
Considering a restricted class of recursive statements, we give
necessary and sufficient conditions for statements in the class to
have this bound." ,
bibdate    =    "Thu Nov 19 21:15:39 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( IOANNIDIS86C,
key    =    "Ioannidis" ,
author    =    "Ioannidis, Y.E." ,
title    =    "On the Computation of the Transitive Closure of
Relational Operations" ,
booktitle=    "vldb" ,
address    =    "Kyoto, Japan" ,
editor    =    "Kambayashi, Y." ,
month    =    "aug" ,
year    =    "1986" ,
pages    =    "403--411" ,
abstract=    "Query processing in the presence of recursively
defined views usually involves some form of iteration. For example,
computing the transitive closure of a tree involves iterating N times,
where N is the depth of the tree, each time computing pairs of
vertices that are one edge further apart than the pairs produced in
the previous iteration. Applying a divide and conquer technique we
devise algorithms that need a logarithmic number of iterations.
Assuming that we are looking for complete materializations of the
recursively defined relations we show both through analytical and
experimental results that this approach is in many cases superior in
performance than the N-iteration algorithm." ,
bibdate    =    "Fri Nov 20 13:42:24 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( IOANNIDIS87,
key    =    "Ioannidis \& Wong" ,
author    =    "Ioannidis Yannis E. and Wong, Eugene" ,
title    =    "An Algebraic Approach to Recursive Inference" ,
booktitle=    "Proceedings from the First International
Conference on Expert Database Systems" ,
year    =    "1987" ,
pages    =    "209--223" ,
month    =    "" ,
)

@inproceedings    ( IOANNIDIS88,
key    =    "Ioannidis et al." ,
author    =    "Ioannidis, Yannis E. and Chen, Joanna and
Friedman, Mark A. and Tsangaris, Manolis M." ,
title    =    "Bermuda - An Architectural Perspective on
Interfacing Prolog to a Database Machine" ,
booktitle=    "Proceedings from the Second International
Conference on Expert Database Systems" ,
year    =    "1988" ,
pages    =    "91--105" ,
month    =    "" ,
)

@article    ( IOANNIDIS89,
key    =    "Ioannidis \& Livny" ,
author    =    "Ioannidis, Y.E and Livny, M." ,
title    =    "Moose: Modeling Objects in a Simulation
Environment" ,
journal    =    "ipl" ,
year    =    "1989" ,
pages    =    "821--826" ,
abstract=    "DeLab is a simulation laboratory currently under
construction, that aims to provide programmers and system analysts
with support for the construction of complex simulators and the
management of long term simulation studies. The size of the data
generated by such studies makes a Database Management System an
important module of the laboratory. In this paper, we describe the
salient features of MOOSE (MOdeling Objects in a Simulation
Environment), which is the model we have developed to capture the
semantics of simulation data. MOOSE supports complex objects, object
sharing (controlled by user-defined structural constraints), and
specialization by rules. Every MOOSE schema has a straightforward
graphical representation, thus facilitating a graphics interface to
the database." ,
bibdate    =    "Wed May  2 15:18:39 1990" ,
owner    =    "robyn" ,
)

@techreport    ( IOANNIDIS90,
key    =    "Ioannidis \& Kang" ,
author    =    "Ioannidis, Y.E. and Kang, Y." ,
title    =    "Randomized Algorithms for Optimizing Large Join
Queries" ,
institution=    "University of Wisconsin" ,
address    =    "Madison, Wisconsin" ,
year    =    "1990" ,
abstract=    "Query optimization for relational database systems
is a combinatorial optimization problem, which makes exhaustive search
unacceptable as the query size grows. Randomized algorithms, such as
Simulated Annealing and Iterative Improvement, are viable alternatives
to exhaustive search. We have adapted these algorithms to the
optimization of project-select-join queries. We have tested them on
large queries of various types with different databases. The study of
the shape of the cost function over the solution space associated with
such queries and the analysis of the behavior of these algorithms have
inspired a new Hybrid algorithm, which is a combination of Simulated
Annealing and Iterative Improvement. Experimental results show that
Hybrid outperforms the original algorithms in terms of both output
quality and running time." ,
bibdate    =    "Thu May  3 15:46:53 1990" ,
owner    =    "robyn" ,
)

@article    ( IOANNIDIS92,
key    =    "Ioannidis" ,
author    =    "Ioannidis, Y.E." ,
title    =    "Advanced User Interfaces for Database Systems" ,
journal    =    "sigmod" ,
publisher=    "acm" ,
volume    =    "21" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1992" ,
page    =    "4" ,
bibdate    =    "Sat Oct 31 23:34:21 1992" ,
owner    =    "leoso" ,
)

@article    ( IOANNIDIS93A,
key    =    "Ioannidis et al." ,
author    =    "Ioannidis, Y. and Ramakrishnan, R. and Winger, L." ,
title    =    "Transitive Closure Algorithms Based on Graph
Traversal" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "18" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1993" ,
pages    =    "512--576" ,
keywords=    "Depth-first search; node reachability; path
computations; transitive closure" ,
abstract=    "Several graph-based algorithms have been proposed
in the literature to compute the transitive closure of a directed
graph. We develop two new algorithms ($Basic_TC$ and $Global_DFTC$)
and compare the performance of their implementations in a disk-based
environment with a well-known graph-based algorithm proposed by
Schmitz. Our algorithms use depth-first search to traverse a graph and
a technique called marking to avoid processing some of the arcs in the
graph. They compute the closure by processing nodes in reverse
topological order, building descendent sets by adding the descendent
sets of children. While the details of these algorithms differ
considerably, one important difference among them is the time at which
descendent set additions are performed. $Basic_TC$ performs a separate
depth-first traversal to obtain the topological order of nodes and
does additions in a second pass. $Global_DFTC$ performs additions
whenever two sets that must be added are in memory, thereby
eliminating the need to bring these sets in again later. The Schmitz
algorithm is intermediate in this respect, deferring the addition of
the descendent set of a child to that of a parent until the root of
the strong component containing the parent is identified. Contrary to
our expectations, deferring additions as much as possible, as in
$Basic_TC$, results in superior performance. The first reason is that
early additions result in larger descendent set sizes on the average
over the duration of the execution, thereby causing more I/O; very
often this turns out to more than offset the gains of not having to
fetch certain sets again to add them. The second reason is that
information collected in the first pass can be used to apply several
optimization in the second pass. To the extent possible, we also adapt
these algorithms to perform path computations. Again, our performance
comparison confirms the trends seen in reachability queries. Taken in
conjunction with another performance study our results indicate that
all graph-based algorithms significantly outperform other types of
algorithm such as Seminaive and Warren." ,
bibdate    =    "Tue Nov 23 18:06:27 1993" ,
owner    =    "daisyc" ,
)

@article    ( JAEGER95,
key    =    "Jaeger \& Freytag" ,
author    =    "Jaeger, U. and Freytag, J. C." ,
title    =    "An Annotated Bibliography on Active Databases" ,
journal    =    "sigmod" ,
publisher=    "ACM Press" ,
volume    =    "24" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1995" ,
pages    =    "58--69" ,
bibdate    =    "Wed Nov 22 13:01:33 1995" ,
owner    =    "jeff" ,
)

@inproceedings    ( JAESCHKE82,
key    =    "Jaeschke \& Schek" ,
author    =    "Jaeschke, G. and Schek, H.J." ,
title    =    "Remarks on the Algebra of Non First Normal Form
Relations" ,
booktitle=    "pods" ,
year    =    "1982" ,
abstract=    "Usually, the first normal form condition of the
relational model of data is imposed. Presently, a broader class of
data base applications like office information systems is considered
where this restriction is not convenient. Therefore, an extension of
the relational model is proposed consisting of Non First Normal Form
(NF 2) relations. The relational algebra is enriched mainly by so
called nest and unnest operations which transform between NF 2
relations and the usual ones. We state some properties of these
operations and some rules which occur in combination with the
operations of the usual relational algebra. Since we propose to use
the NF 2 model also for the internal data model these rules are
important not only for theoretical reasons but also for a practical
implementation." ,
bibdate    =    "Tue Jan 20 12:46:58 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( JAGADISH88,
key    =    "Jagadish" ,
author    =    "Jagadish, H. V." ,
title    =    "A Compressed Transitive Closure Technique for
Efficient Fixed Point Query Processing" ,
booktitle=    "Proceedings of the xth Conference on Expert
Database Systems" ,
year    =    "1988" ,
pages    =    "423--446" ,
month    =    "" ,
)

@article    ( JAJODIA83,
key    =    "Jajodia \& Ng" ,
author    =    "Jajodia, S. and Ng, A." ,
title    =    "On representation of relational structures by
entity relationship diagrams" ,
journal    =    "Entity Relationship Approach to Software
Engineering" ,
year    =    "1983" ,
bibdate    =    "Tue Nov  7 10:28:44 1989" ,
owner    =    "robyn" ,
)

@article    ( JAJODIA89,
key    =    "Jajodia \& Mutchler" ,
author    =    "Jajodia, S. and Mutchler, D." ,
title    =    "A Pessimistic Consistency Control Algorithm for
Replicated Files which Achieves High Availability" ,
journal    =    "tse" ,
publisher=    "ieee" ,
volume    =    "15" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1989" ,
pages    =    "39--46" ,
keywords=    "Consistency control algorithm; dynamic voting;
file replication; network partitioning; pessimistic algorithm; voting" ,
abstract=    "In this paper, we describe a consistency control
algorithm for managing replicated files in the face of network
partitioning due to node or communication link failures. It adopts a
pessimistic approach in that mutual consistency among copies of a file
is maintained by permitting files to be accessed only in a single
partition at any given time. Our algorithm simplifies the
Davcev-Burkhard 'dynamic voting' algorithm and also improves its
availability by adding the notion of 'linearly ordered copies'. We
also give a proof that any pessimistic algorithm with fresh reads is
one-copy serializable." ,
bibdate    =    "Sun Apr 11 15:38:04 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( JARKE84,
key    =    "Jarke et al." ,
author    =    "Jarke, M. and Clifford, J. and Vassiliou, Y." ,
title    =    "An Optimizing Prolog Front-End To A Relational
Query System" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Yormack, B." ,
publisher=    "acm" ,
address    =    "Boston, MA" ,
month    =    "jun" ,
pages    =    "296--306" ,
year    =    "1984" ,
abstract=    "An optimizing translation mechanism for the
dynamic interaction between a logic-based expert system written in
PROLOG and a relational database accessible through SQL is presented.
The mechanism makes use of an intermediate language that decompose the
optimization problem and makes the proposed approach target-langauge
independent. It can either facilitate expert system - database
interaction, e.g., when integrating expert systems into business
systems, or augment existing databases with (external) deductive
capabilities." ,
bibdate    =    "Mon Oct  1 10:00:45 1984" ,
)

@article    ( JARKE84A,
key    =    "Jarke \& Koch" ,
author    =    "Jarke, M. and Koch, J." ,
title    =    "Query Optimization in Database Systems" ,
journal    =    "compsurv" ,
publisher=    "acm" ,
volume    =    "16" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1984" ,
pages    =    "111--152" ,
keywords=    "Algorithms; performance; database implementation;
query optimization; query simplification" ,
abstract=    "Efficient methods of processing unanticipated
queries are a crucial prerequisite for the success of generalized
database management systems. A wide variety of approaches to improve
the performance of query evaluation algorithms have been proposed:
logic-based and semantic transformations, fast implementations of
basic opertions, and combinatorial or heuristic algorithms for
generating alternative access plans and choosing among them. These
methods are presented in the framework of a general query evaluation
procedure using the relational calculus representation of queries. In
addition, nonstandard query optimization issues such as higher level
query evaluation, query optimization in distributed databases, and use
of database machines are addressed. The focus, however, is on query
optimization in centralized database systems." ,
bibdate    =    "Thu Jan 15 13:19:39 1987" ,
owner    =    "manning" ,
)

@incollection    ( JARKE84C,
key    =    "Jarke et al." ,
author    =    "Jarke, Matthias and Koch, Jurgen and Schmidt,
Joachim W." ,
title    =    "Introduction to Query Processing" ,
booktitle=    "Query Processing in Database Systems" ,
publisher=    "Springer Verlag" ,
year    =    "1984" ,
editor    =    "Kim, Won and Reiner, David S. and Batory, Don S." ,
chapter    =    "1" ,
pages    =    "3--28" ,
)

@incollection    ( JARKE84D,
key    =    "Jarke" ,
author    =    "Jarke, Matthias" ,
title    =    "Common Subexpression Isolation in Multiple Query
Optimization" ,
booktitle=    "Query Processing in Database Systems" ,
publisher=    "Springer Verlag" ,
year    =    "1984" ,
editor    =    "Kim, Won and Reiner, David S. and Batory, Don S." ,
pages    =    "191--205" ,
)

@article    ( JARKE85,
key    =    "Jarke et al." ,
author    =    "Jarke, M. and Turner, J.A. and Stohr, E.A. and
Vassiliou, Y. and White, N.H. and Michielsen, K." ,
title    =    "A Field Evaluation of Natural Language for Data
Retrieval" ,
journal    =    "tse" ,
volume    =    "SE-11" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1985" ,
pages    =    "97--114" ,
keywords=    "human-machine interaction; interface design;
language evaluation; natural language query; query languages" ,
abstract=    "Although a large number of natural language
database interfaces have been developed, there have been few empirical
studies of their practical usefulness. This paper presents the design
and results of a field evaluation of a natural language system - NLS -
used for data retrieval. A balanced multifactorial design comparing
NLS to a reference retrieval language SQL is desribed. The data are
analyzed on two levels: work task (n=87) and query (n=1080). SQL
performed better than NLS on a variety of measures, but NLS requires
less effort to use. Subjects performed much poorer than expected based
on the results of laboratory studies. This finding is attributed to
the complexity of the field setting and to optimism in grading
laboratory experiments. The methodology developed for studying
computer languages in real work settings was successful in
consistently measuring differences in treatments over a variety of
conditions." ,
bibdate    =    "Wed Mar  6 10:51:32 1985" ,
)

@article    ( JARKE85A,
key    =    "Jarke \& Vassiliou" ,
author    =    "Jarke, M. and Vassiliou, Y." ,
title    =    "A Framework for Choosing a Database Query Language" ,
journal    =    "compsurv" ,
publisher=    "ACM" ,
volume    =    "17" ,
number    =    "3" ,
month    =    "sept" ,
year    =    "1985" ,
pages    =    "313--340" ,
keywords=    "Databases; language evaluation; query language;
user classification" ,
abstract=    "This paper presents a systematic approach to
matching cate- gories of query language interfaces with the
requirements of certain user types. The method is based on a trend
model of query language development on the dimensions of functional
capabilities and query languages, a criterion hierarchy for query
language evaluation, a comprehensive classification scheme of query
language users and their requirements, and preliminary recommendations
for allocating language classes to user types. The method integrates
the results of existing human factors studies and provides a
structured framework for future research in this area. Current and
expected developments are exemplified by the description of ``new
generation'' database query languages. In a preselecting suitable
query language types; the final selection decision will also depend on
organization-specific factors, such as the available database
management system, hardware and software strategies, and financial
system costs." ,
bibdate    =    "Tue Aug 26 11:28:14 1986" ,
owner    =    "manning" ,
)

@article    ( JARKE90,
key    =    "Jarke" ,
author    =    "Jarke, M." ,
title    =    "DAIDA: Conceptual Modeling and Knowledge-Based
Support of Information Systems Development Processes" ,
journal    =    "Techinque et Science Informatiques" ,
volume    =    "9" ,
number    =    "2" ,
year    =    "1990" ,
abstract=    "ESPRIT project 892 (DAIDA) has investigated
organizational principles and interactive support tools for
knowledge-based information systems engineering environments. The
DAIDA methodology formally derives quality-assured information systems
software from object-oriented designs. These designs are seen as
conceptual objects which are themselves embedded in a formal,
multi-perspective requirements model. To facilitate maintenance and
reusability, DAIDA emphasizes structuring and documentation of the
design decisions that occur during software processes." ,
bibdate    =    "Mon Sep 10 10:40:52 1990" ,
owner    =    "robyn" ,
)

@techreport    ( JENSEN89C,
key    =    "Jensen et al." ,
author    =    "Jensen, C.S. and Mark, L. and Roussopoulos, N. and
Sellis, T." ,
title    =    "A Framework for Efficient Query Processing Using
Caching, Cache Indexing, and Differential Techniques in the Relational
Model Extended with Transaction Time" ,
institution=    "The University of Aalborg" ,
year    =    "1989" ,
type    =    "Technical report," ,
number    =    "R-89-45" ,
address    =    "Institute of Electronic Systems. Dept.\ of Math.\
and Comp.\ Sci., Frederik Bajers Vej 7E, DK-9220 Aalborg {\O}st,
Denmark" ,
month    =    "December" ,
note    =    "" ,
)

@inproceedings    ( JHINGRAN88,
key    =    "Jhingran" ,
author    =    "Jhingran, A." ,
title    =    "A Performance Study of Query Optimization
Algorithms on a Database System Supporting Procedures" ,
booktitle=    "Proceedings of the Fourteenth International
Conference on Very Large Data Bases" ,
year    =    "1988" ,
pages    =    "88--99" ,
)

@techreport    ( JOHNSON93,
key    =    "Johnson et al." ,
author    =    "Johnson, R. G. and Martin, N. J. and Zhao, X." ,
title    =    "Parallel Database Management - the ADEPT Project" ,
institution=    "Birkbeck College" ,
address    =    "University of London" ,
year    =    "1993" ,
pages    =    "14" ,
bibdate    =    "Thu Jan 28 11:19:51 1993" ,
owner    =    "bassili" ,
)

@article    ( JOSEPH88,
key    =    "Joseph \& Cardenas" ,
author    =    "Joseph, T. and Cardenas, A.F." ,
title    =    "PICQUERY: A High Level Query Language for
Pictorial Database Management" ,
journal    =    "tse" ,
publisher=    "ieee" ,
volume    =    "14" ,
number    =    "5" ,
month    =    "may" ,
year    =    "1988" ,
pages    =    "630--638" ,
keywords=    "database management; heterogeneous data; pictorial
data; pictorial data accessing and processing; pictorial query
language" ,
abstract=    "A reasonably comprehensive set of data accessing
and manipulation operations that should be supported by a generalized
pictorial database management system-PDBMS-is proposed. A
corresponding high level query language, PICQUERY, is presented and
illustrated through examples. PICQUERY has been designed with a flavor
similar to QBE as the highly nonprocedural and conversational language
for pictorial database management system PICDMS, designed and
developed at UCLA. PICQUERY and a relation QBE-like language would
form the language by which a user may access conventional relational
data bases and at the same time pictorial databases managed by PICDMS
and other robust PDBMS. This language interface is part of an
architecture toward data heterogeneity transparency over pictorial and
nonpictorial databases." ,
bibdate    =    "Fri Jul 15 11:11:43 1988" ,
owner    =    "payne" ,
)

@inproceedings    ( KAHLER87,
key    =    "Kahler \& Risnes" ,
author    =    "Kahler, B and Risnes, O." ,
title    =    "Extending Logging for Database Snapshot Refresh" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
editor    =    "Hammersley, P." ,
month    =    "sep" ,
year    =    "1987" ,
pages    =    "389--398" ,
abstract=    "A database snapshot mechanism represents a cost
effective substitute for replicated data in a distributed database.
The contents of a database snapshot can be periodically refreshed to
reflect the current state of the database. In a distributed database
system it is significant to reduce the cost of snapshot refresh. This
can be obtained by a differential refresh strategy in which
modifications to the base tables involved are detected. The paper
proposes two methods based on using a separate table for logging the
modifications made to a base table; a sequential and a condensed
logging approach. The methods have been compared for various update
frequency and composition. The sequential log performs well for single
snapshots if the modification set is small relative to the base table
size, or if the snapshot is restrictive. In the case of large
modification sets and replicated snapshots, the condensed logging
method is to be preferred." ,
bibdate    =    "Thu Apr 28 15:20:13 1988" ,
owner    =    "" ,
)

@article    ( KAISER91,
key    =    "Kaiser \& Perry" ,
author    =    "Kaiser, Gail E. and Dewaune E. Perry" ,
title    =    "Making Progress in Cooperative Transaction Models" ,
journal    =    "Data Engineering" ,
volume    =    "14" ,
number    =    "1" ,
month    =    "Mar" ,
year    =    "1991" ,
pages    =    "19--23" ,
bibdate    =    "Sat Sep 21 16:30:08 1991" ,
owner    =    "suchen" ,
)

@techreport    ( KAISER91B,
key    =    "Kaiser \& Calton" ,
author    =    "Kaiser, G. E. and Calton, P." ,
title    =    "Dynamic Restructuring of Transactions" ,
number    =    "CUCS-012-91" ,
institution=    "Department of Computer Science, Columbia
University" ,
address    =    "500 West 120th Street, New York, NY 10027" ,
year    =    "1991" ,
month    =    "apr" ,
pages    =    "27" ,
abstract=    "Open-ended activities are characterized by
uncertain duration, unpredictable developments, and interactions with
other concurrent activities. Like other database applications, they
require consistent concurrent access and fault-tolerance, but their
unconventional characteristics are incompatible with the conventional
database mechanisms of concurrency and failure atomicity. We present
the split-transaction and join-transaction operations for
restructuring in-progress transactions, as an approach to consistent
concurrent access and fault-tolerant for open-ended activities.
Split-transaction divides an on-going transaction into two or more
transactions that are serializable with respect to each other and all
other transactions, and each of the new transactions is later
committed or aborted independently of the others. Join-transactions
merges two or more transactions that are serializable with respect to
each other into a single transaction as if they had always been part
of the same transaction, and all their work is now committed or
aborted together. split-transaction is useful for committing some work
early on dividing on-going work among several co-workers.
join-transaction allows to hand over results to a co-worker to
integrate into his or her own ongoing task. The transaction manager
enforces that the new transaction(s) will in fact be serializable, and
does not permit the split or join otherwise." ,
bibdate    =    "Fri Nov 13 13:58:25 1992" ,
owner    =    "bassili" ,
)

@inbook        ( KAISER92A,
key    =    "Kaiser \& Pu" ,
author    =    "Kaiser, G.E. and Pu, C." ,
title    =    "Dynamic Restructuring of Transactions" ,
booktitle=    "Database Transaction Models for Advanced
Applications" ,
publisher=    "Morgan Kaufmann Publishers" ,
address    =    "San Mateo, CA" ,
year    =    "1992" ,
series    =    "Data Management Systems" ,
chapter    =    "8" ,
pages    =    "266--295" ,
abstract=    "Open-ended are characterized by uncertain
duration, unpredictable developments, and interactions with other
concurrent activities. Like other database applications, they require
consistent concurrent access and fault-tolerance, but their
unconventional characteristics are incompatible with the conventional
database mechanisms of concurrency and failure atomicity. We present
the split-transaction and join-transaction operations for
restructuring in-progress transactions, as an approach to consistent
concurrent access and fault-tolerance for open-ended.
Split-transaction divides an on-going transaction into two or more
transactions that are serializable with respect to each other and all
other transactions, and each of the new transactions is later
committed or aborted independently of the others. Join-transactions
merges two or more transactions that are serializable with respect to
each other into a single transaction as if they had always been part
of the same transaction, and all their work is now committed or
aborted together. Split-transaction is useful for committing some work
early or dividing on-going work among several co-workers.
Join-transaction allows to hand over results to a co-worker to
integrate into his or her own ongoing task. The transaction manager
enforces that the new transaction(s) will in fact be serializable, and
does not permit the split or join otherwise." ,
bibdate    =    "Thu Sep 17 00:14:31 1992" ,
owner    =    "leoso" ,
)

@inproceedings    ( KAMEL85,
key    =    "Kamel \& King" ,
author    =    "Kamel, N. and King, R." ,
title    =    "A Model of Data Distribution Based on Texture
Analysis" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "319--325" ,
bibdate    =    "Wed Jun 12 11:42:42 1985" ,
)

@article    ( KAMEL92,
key    =    "Kamel \& King" ,
author    =    "Kamel, N. and King, R." ,
title    =    "Intelligent Database Caching Trough the Use of
Page-Answers and Page-Traces" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "17" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1992" ,
pages    =    "601--646" ,
keywords=    "Artificial Intelligence, databases, page access" ,
abstract=    "In this paper a new method to improve the
utilization of main memory systems is presented. The new method is
based on prestoring in main memory a number of query answers, each
evaluated out of a single memory page. To this end, the idea of
page-answers and page-traces are formally described and their
properties analyzed. The query model used here allows for selection,
projection, join, recursive queries as well as arbitrary combinations.
We also show how to apply the approach under update traffic. This
concept is especially useful in managing the main memories of an
important class of applications. This class includes the evaluation of
triggers and alerters, performance improvement of rule-based systems,
integrity constraints checking, and materialized views. These
applications are characterized by the existence at compile time of a
predetermined set of queries, by a slow but persistent update traffic,
and by their need to repetitively reevaluate the query set. The new
approach represents a new type of intelligent database caching, which
contrasts with traditional caching primarily in that the cache
elements are derived data and as a consequence, they overlap
arbitrarily and do not have a fixed length. The contents of the main
memory cache are selected based on the data distribution within the
database, the set of fixed queries to preprocess, and the paging
characteristics. Page-answers and page-traces are used as the smallest
indivisible units in the cache. An efficient heuristic to select a
near optimal set of page-answers and page-traces to populate the main
memory has developed, implemented, and tested. Finally, quantitative
measurements of performance benefits are reported." ,
bibdate    =    "Fri Jan 22 12:31:49 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( KAMEL94,
key    =    "Kamel \& Faloutsos" ,
author    =    "Kamel, Ibrahhim and Faloutsos, Christos" ,
title    =    "Hilbert R-tree: An Improved R-tree using fractals" ,
booktitle=    "vldb" ,
publisher=    "Morgan Kauffman" ,
month    =    "sep" ,
year    =    "1994" ,
bibdate    =    "Wed Sep 21 13:13:41 1994" ,
owner    =    "kevin" ,
)

@techreport    ( KAMIMURA87,
key    =    "Kamimura" ,
author    =    "Kamimura, Misako" ,
title    =    "Caching Query Results - A Survey Based on the
Simulation of Caching Query Results in a Database" ,
institution=    "University of Maryland. Department of Computer
Science" ,
year    =    "1987" ,
type    =    "course project" ,
address    =    "College Park, MD 20742" ,
)

@inproceedings    ( KANG87,
key    =    "Kang \& Roussopoulos" ,
author    =    "Kang, H. and Roussopoulos, N." ,
title    =    "Using 2-way Semijoins in Distributed Query
Processing" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1987" ,
pages    =    "644--651" ,
abstract=    "In distributed query processing, the semijoin has
been used as an effective operator in reducing relations referenced in
the query to reduce the total amount of data transmission. In this
paper, we propose a new relational algebra operator, 2-way semijoin,
which is an extended version of the semijoin, for more cost-effective
distributed query processing. The 2-way semijoin is compared to the
semijoin in terms of the reduction power and the propagation of
reduction effects. We show that the 2-way semijoin has more reduction
power than the semijoin and that the propagation of reduction effects
by the 2-way semijoin is further than by the semijoin" ,
bibdate    =    "Thu Apr 28 15:33:04 1988" ,
owner    =    "" ,
)

@article    ( KARABEG91,
key    =    "karabeg91" ,
author    =    "Karabeg, D. and Vianu, V." ,
title    =    "Simplification Rules and Complete Axiomatization
for Relational Update Transactions" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "16" ,
number    =    "3" ,
month    =    "september" ,
year    =    "1991" ,
pages    =    "439-475" ,
abstract=    "Relational update transactions consisting of line
programs of inserts, deletes and modifications are studied with
respect to equivalence and simplification. A sound and complete set of
axioms for proving transaction equivalence is exhibited. The axioms
yield a set of simplification rules that can be used to optimize
efficently a large class of transactions of practical interest. The
simplification rules are particularly well suited to a dynamic
environment where transactions are presented in an on-line fashion,
and where the time available for optimization may consist of
arbitrarily short and sparse intervals." ,
bibdate    =    "Mon Nov  4 11:39:26 1991" ,
owner    =    "kline" ,
)

@article    ( KARL88,
key    =    "Karl \& Lockeman" ,
author    =    "Karl, Stefan and Lockeman, Peter C." ,
title    =    "Design of Engineering Databases: A Case for More
Varied Semantic Modelling Concepts" ,
journal    =    "Information Systems" ,
year    =    "1988" ,
volume    =    "13" ,
number    =    "4" ,
pages    =    "335--357" ,
month    =    "" ,
)

@article    ( KARR78,
key    =    "Karr \& Loveman III" ,
author    =    "Karr, Michael and Loveman III, David B." ,
title    =    "Incorporation of Units into Programming Languages" ,
journal    =    "Communications of the ACM" ,
year    =    "1978" ,
volume    =    "21" ,
number    =    "5" ,
pages    =    "385--391" ,
month    =    "May" ,
)

@article    ( KATO92,
key    =    "Kato \& Masuda" ,
author    =    "Kato, K. and Masuda, T." ,
title    =    "Persistent Caching: An Implementation Technique
for Complex Objects with Object Identity" ,
journal    =    "tse" ,
publisher=    "ieee" ,
volume    =    "18" ,
number    =    "7" ,
month    =    "jul" ,
year    =    "1992" ,
pages    =    "631--645" ,
keywords=    "Caching; complex objects; delayed update
propagation; object identity; object-oriented database; persistent
objects" ,
abstract=    "Database systems that can efficiently manage
complex objects are increasingly needed in many different fields, such
as office automation, knowledge processing, CAD, CAM, CASE, etc. A lot
of recent complex object database systems support the concepts of
object identity and object identifier. Following an object identifier
to access the referenced object is called navigation operation and is
an essential operation in dealing with complex objects. Navigation
operation is a difficult operation to implement efficiently since
every navigation operation inherently causes one disk access
operation. This paper proposes a scheme to notably accelerate the
navigation operation among a sea of complex objects, by increasing the
effective number of objects in one disk page. The main concept of the
presented technique is threefold. The first idea is to store a cache
value within a complex object that is referencing another complex
object. The second is that when the referenced object is to be updated
the update propagation is delayed until the time when the cached value
is referenced. The third is to utilize a hashed table on main memory
to efficiently validate the consistency between the cached values and
the original values." ,
bibdate    =    "Mon Oct  5 19:16:31 1992" ,
owner    =    "leoso" ,
)

@phdthesis    ( KATZ80,
author    =    "Katz, R." ,
title    =    "Database Design and Translation for Multiple Data
Models" ,
school    =    "Department of Computer Science UC Berkeley" ,
address    =    "Berkeley CA" ,
month    =    "jun" ,
year    =    1980 ,
annote    =    "A design and implementation of a translator for
both DBMS and their accessing programs. Well developed ideas. Based on
the Network and Relational models mostly." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( KATZ82,
key    =    "Katz" ,
author    =    "Katz, R." ,
title    =    "A Database Approach for Managing VLSI Design Data" ,
booktitle=    "19th Design Automation Conference" ,
organization=    "IEEE" ,
year    =    "1982" ,
pages    =    "274--282" ,
bibdate    =    "Wed Nov  6 23:27:44 1985" ,
)

@article    ( KATZ85C,
key    =    "Katz" ,
author    =    "Katz, R.H." ,
title    =    "Computer-Aided Design Databases" ,
journal    =    "Design \& Test" ,
publisher=    "IEEE Computer Society Press" ,
year    =    "1985" ,
month    =    "feb" ,
volume    =    "2" ,
number    =    "1" ,
pages    =    "70--74" ,
abstract=    "Designing anything as complicated as a
state-of-the-art integrated system cannot be attempted without a full
complement of computer-based design aids. This tutorial focuses on
information management tools, one of the most important and least
understood components of design systems. After defining basic terms
and reviewing data management in existing systems, the author
discusses and evaluates emerging trends in research systems." ,
bibdate    =    "Wed Jul 16 14:37:55 1986" ,
owner    =    "manning" ,
)

@incollection    ( KATZ86A,
key    =    "Katz \& Bobrow" ,
author    =    "Katz, R. H. and Bobrow, D. G." ,
title    =    "Context Structures/Versioning" ,
booktitle=    "On Knowledge Base Mangement Systems" ,
publisher=    "Springer Verlag" ,
year    =    "1986" ,
editor    =    "Brodie, Michael J. and Mylopoulos, John" ,
chapter    =    "30" ,
pages    =    "453--459" ,
)

@article    ( KATZ88,
key    =    "Katz et al." ,
author    =    "Katz, R.H. and Ousterhout, J.K. and Patterson,
D.A. and Stonebraker, M.R." ,
title    =    "A Project on High Performance I/O Subsystems" ,
journal    =    "Database Engineering" ,
publisher=    "ieee" ,
volume    =    "11" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1988" ,
pages    =    "40--47" ,
owner    =    "manning" ,
bibdate    =    "Tue Jun  7 14:58:12 1988" ,
)

@inproceedings    ( KAWAGOE85,
key    =    "Kawagoe" ,
author    =    "Kawagoe, K." ,
title    =    "Modified Dynamic Hashing" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "201--213" ,
bibdate    =    "Tue Jun 11 13:23:07 1985" ,
)

@inproceedings    ( KELLER85B,
key    =    "Keller" ,
author    =    "Keller, A.M." ,
title    =    "Algorithms for Translating View Updates to
Database Updates for Views Involving Selections, Projections, and
Joins" ,
booktitle=    "pods" ,
organization=    "acm" ,
month    =    "mar" ,
year    =    "1985" ,
bibdate    =    "Thu Aug  4 19:48:52 1988" ,
owner    =    "" ,
)

@inproceedings    ( KELLER86B,
key    =    "Keller" ,
author    =    "Keller, A.M." ,
title    =    "Choosing a View Update Translator by Dialog at
View Definition Time" ,
booktitle=    "vldb" ,
address    =    "Kyoto, Japan" ,
editor    =    "Kambayashi, Y." ,
month    =    "aug" ,
year    =    "1986" ,
pages    =    "467--474" ,
keywords=    "relational databases, database theory, view update" ,
abstract=    "We consider the problem of updating databases
through views composed of selections, projections, and joins of a
series of Boyce-Codd Normal Form relations. This involves translating
updates expressed against the view to updates expressed against the
database. Previously, we enumerated all translations of view updates
into database updates that satisfy five criteria. This enumeration
shows that the problem of translating view updates to database updates
is inherently ambiguous. We give examples of structurally similar
views that should have different translations because of the real
world semantics. We propose that these semantics be obtained at view
definition time. We show how this can be done through a structured
dialog with the database administrator to choose a view update
translator at view definition time. The questions asked during this
dialog are based on the view definition, database structural schema
information, and the answers to earlier questions in the dialog. Based
on these questions a specific translator is chosen. Using this
translator, user-specified view updates can be translated into
database updates without the need for any disambiguating dialog.
However, dialog with the user may be desired to confirm that the
(view) side effects resulting from the user's view update request are
acceptable." ,
bibdate    =    "Wed Aug 19 22:09:43 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( KEMPER87,
key    =    "Kemper et al." ,
author    =    "Kemper, A. and Lockemann, P.C. and Wallrath, M." ,
title    =    "An Object-Oriented Database System for Engineering
Applications" ,
booktitle=    "Proceedings of the ACM SIGMOD Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "299--310" ,
abstract=    "One of the most promising approaches to database
support of engineering applications is the concept of object-oriented
database management. Object-orientation is usually approached from
either a behavioral or structural viewpoint. The former emphasizes the
application-specific manipulation of technical objects while hiding
their structural details whereas the latter concentrates on the
structural aspects and their efficient implementation. The thesis of
the paper is that the two viewpoints may enter into a fruitful
symbiosis where a behaviorally object-oriented system is implemented
on tope of a structurally object-oriented database system, thereby
combining ease of use by the engineer with high database system
performance. The thesis will be demonstrated in the paper by a
user-friendly interface based on user-definable abstract datatypes and
its implementation using a prototype for the non-first-normal-form
(NF2) relational model, and will be supported by an engineering
example application from off-line robot programming." ,
bibdate    =    "Fri Jul 24 15:49:09 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( KEMPER93,
key    =    "Kemper \& Kossmann" ,
author    =    "Kemper, A. and Kossmann, D." ,
title    =    "Adaptable Pointer Swizzling Strategies in Object
Bases" ,
booktitle=    "The Ninth IEEE International Conference on Data
Engineering" ,
address    =    "Vienna, Austria" ,
month    =    "apr" ,
year    =    "1993" ,
bibdate    =    "Mon May  3 20:58:48 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( KEMPER93A,
key    =    "Kemper \& Kossmann" ,
author    =    "Kemper, A. and Kossmann, D." ,
title    =    "Adaptable Pointer Swizzling Strategies in Object
Bases" ,
booktitle=    "Ninth International Conference on Data Engineering" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "Vienna, Austria" ,
month    =    "apr" ,
year    =    "1993" ,
pages    =    "155--162" ,
abstract=    "In this paper we will classify and evaluate
different approaches to optimizing the access to main memory resident
objects -- techniques which are commonly referred to as 'pointer
swizzling'. To speed up the access along inter-object references, the
persistent pointers are transformed (swizzled) into main memory
pointers (addresses). We will evaluate four different pointer
swizzling techniques allowing the displacement of objects from the
buffer before the end of an application and contrast them with the
performance of an object manager using no pointer swizzling. Our
quantitative evaluation proved that there is no one superior strategy
for all application profiles. Consequently, we will suggest an
adaptable system that uses the full range of pointer swizzling
strategies." ,
bibdate    =    "Mon May 17 18:31:25 1993" ,
owner    =    "bassili" ,
)

@article    ( KENT81,
key    =    "Kent" ,
author    =    "Kent, W." ,
title    =    "Consequences of Assuming a Universal Relation" ,
journal    =    "ACM Transactions on Database Systems" ,
year    =    "1981" ,
volume    =    "6" ,
number    =    "4" ,
pages    =    "539--556" ,
month    =    "December" ,
)

@inproceedings    ( KENT82,
key    =    "Kent" ,
author    =    "Kent, William" ,
title    =    "Choices in Practical Data Design" ,
booktitle=    "Proceedings of the Eighth International Conference
on Very large Data Bases" ,
year    =    "1982" ,
pages    =    "165--180" ,
month    =    "September" ,
)

@article    ( KENT83,
key    =    "Kent" ,
author    =    "Kent, W." ,
title    =    "A Simple Guide to five Normal Farms in Relational
Database Theory" ,
journal    =    "cacm" ,
volume    =    "26" ,
number    =    "2" ,
month    =    "February" ,
year    =    "1983" ,
pages    =    "120--125" ,
abstract=    "The concepts behind the five principal normal
forms in relational database theory are presented in simple terms." ,
bibdate    =    "Thu Sep 13 09:42:29 1984" ,
)

@article    ( KENT83A,
key    =    "Kent" ,
author    =    "Kent, William" ,
title    =    "The Universal Relation Revisited" ,
journal    =    "ACM Transactions on Database Systems" ,
year    =    "1983" ,
volume    =    "8" ,
number    =    "4" ,
pages    =    "644--648" ,
month    =    "December" ,
)

@article    ( KENT88,
key    =    "Kent \& Garcia-Molina" ,
author    =    "Kent, J. and Garcia-Molina, H." ,
title    =    "Optimizing Shadow Recovery Algorithms" ,
journal    =    "tose" ,
publisher=    "ieee" ,
volume    =    "14" ,
number    =    "2" ,
month    =    "feb" ,
year    =    "1988" ,
pages    =    "155--168" ,
keywords=    "crash recovery; disk utilization; logging; page
table; performance; shadows; transaction" ,
abstract=    "Experiments conducted on a database testbed at
Princeton indicate excessive page-table I/O is the major performance
drawback of shadow recovery. In light of this, we propose a method for
parametrizing shadow recovery that minimizes page-table I/O without
sacrificing too much disk utilization. Using a simple, model, we
analyze and evaluate our mechanism, comparing it to two conventional
ones." ,
bibdate    =    "Mon Feb 22 17:38:08 1988" ,
owner    =    "manning" ,
)

@article    ( KENVILLE82,
key    =    "Kenville" ,
author    =    "Kenville, R.F." ,
title    =    "Optical Disk Data Storage" ,
journal    =    "Computer" ,
volume    =    "15" ,
number    =    "7" ,
month    =    "jul" ,
year    =    "1982" ,
pages    =    "27--35" ,
abstract=    "RCA has recently completed two systems that
establish the feasibility of optical disks as a high data-rate digital
recording medium. The results of these programs are being used to
design operational data storage hardware. The systems can record 5E10
bits of data on one side of an optical disk at rates exceeding 100M
bits per second. They have provided a bit error rate of one in 1E8 and
can access any block of data in less than 0.5 seconds." ,
bibdate    =    "Wed Sep 26 10:52:16 1984" ,
)

@inproceedings    ( KERSCHBERG89,
key    =    "Kerschberg" ,
author    =    "Kerschberg, L." ,
title    =    "The Role of Loose Coupling In Expert Database
System Architectures" ,
booktitle=    "Proceedings of the 5th International Conference on
Data Engineering, Los Angeles, California" ,
year    =    "1989" ,
pages    =    "255--256" ,
month    =    "" ,
)

@techreport    ( KERSTEN86,
key    =    "Kersten" ,
author    =    "Kersten, M. L. and Schippers, F. H." ,
title    =    "Using the Guardian Programming Paradigm to Support
Database Evolution" ,
institution=    "Centre for Mathematics and Computer Science" ,
year    =    "1986" ,
type    =    "CS" ,
number    =    "R8631" ,
address    =    "P. O. Box 4079, 1009 AB Amsterdam, The Netherlands" ,
month    =    "" ,
note    =    "Perhaps a Proceeding article" ,
)

@article    ( KHOSHAFIAN85,
key    =    "Khoshafian et al." ,
author    =    "Khoshafian, Setrag N. and Bates, Douglas M. and De
Witt, David J." ,
title    =    "Efficient Support of Statistical Operations" ,
journal    =    "IEEE Transactions on Software Engineering" ,
year    =    "1985" ,
volume    =    "SE-11" ,
number    =    "10" ,
pages    =    "1058--1070" ,
month    =    "October" ,
)

@inproceedings    ( KHOSHAFIAN86,
key    =    "Khoshafian \& Copeland" ,
author    =    "Khoshafian, S.N. and Copeland, G.P." ,
title    =    "Object Identity" ,
booktitle=    "Proceedings of the Conference on Object-Oriented
Programming Systems, Languages and Applications" ,
organization=    "ACM" ,
address    =    "Portland, OR" ,
editor    =    "Meyrowitz, N." ,
volume    =    "21" ,
month    =    "nov" ,
year    =    "1986" ,
pages    =    "406--416" ,
abstract=    "Identity is that property of an object which
distinguishes each object from all others. Identity has been
investigated almost independently in general-purpose programming
languages and database languages. Its importance is growing as these
two environments evolve and merge. We describe a continuum between
weak and strong support of identity, and argue for the incorporation
of the strong notion of identity at the conceptual level in languages
for general purpose programming, database systems and their hybrids.
We define a data model that can directly describe complex objects, and
show that identity and argue that a surrogate-based implementation
scheme is needed to support the strong notion of identity." ,
bibdate    =    "Mon Nov 10 12:05:41 1986" ,
owner    =    "manning" ,
)

@article    ( KHOSHAFIAN90,
key    =    "Khoshafian et al." ,
author    =    "Khoshafian, Setrag and Franklin, Michael J. and
Carey, Michael J." ,
title    =    "Storage Management for Persistent Complex Objects" ,
journal    =    "Information Systems" ,
year    =    "1990" ,
volume    =    "15" ,
number    =    "3" ,
pages    =    "303--320" ,
month    =    "" ,
)

@techreport    ( KIESSLING84,
key    =    "Kiessling" ,
author    =    "Kiessling, W." ,
title    =    "SQL-Like and Quel-like Correlation Queries with
Aggregates Revisited" ,
number    =    "UCB/ERL Memo 84/75" ,
institution=    "Electronics Research Laboratory" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1984" ,
month    =    "sep" ,
bibdate    =    "Fri Jul 24 14:05:20 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( KIESSLING84A,
key    =    "Kiessling" ,
author    =    "Kiessling, W." ,
title    =    "Tuneable Dynamic Filter Algorithms for High
Performance Database Systems" ,
booktitle=    "Proceedings of the International Workshop on
High-Level Computer Architecture" ,
address    =    "Los Angeles, CA" ,
month    =    "may" ,
year    =    "1984" ,
abstract=    "Based on the selection of on-the-shelf hardware
the re-design of a modern database architecture is sketched, which is
an evolution of a conventional DBMS. For query evaluation the notion
of data filtering is put into a general framework called dynamic
filters. Dynamic filter types can be selected dependent on the
DB-architecture and can be tuned to the performance figures of
employed retrieval units. As one application we present join
evaluation algorithms utilizing dynamic filters. Dynamic filters are
supposed to be a general tool which enables a systematic design of
efficient query evaluation algorithms, also with respect to new
DB-applications for complex objects." ,
bibdate    =    "Wed Mar  9 13:53:31 1988" ,
owner    =    "manning" ,
)

@inproceedings    ( KIESSLING85A,
key    =    "Kiessling" ,
author    =    "Kiessling, W." ,
title    =    "On Semantic Reefs and Efficient Processing of
Correlation Queries with Aggregates" ,
booktitle=    "vldb" ,
address    =    "Stockholm, Sweden" ,
editor    =    "Pirotte, A. and Vassiliou, Y." ,
month    =    "aug" ,
year    =    "1985" ,
pages    =    "241--250" ,
abstract=    "Recent transformation algorithms for speeding up
processing of nested SQL-like queries with aggregates are reviewed
with respect to the correctness of aggregates over empty sets. It
turns out that for a particular subset of such queries these
algorithms fail to compute consistent answers. Unfortunately there
seems to be no uniform way to do these transformations efficiently and
correctly under all circumstances. Also the algorithms for QUEL are
reexamined regarding their correctness. It is shown that for a
specific subset of QUEL-queries with aggregates a clearer semantics
can be associated. Finally, benchmark results for Ingres show that
considerable performance advantages may be gained for such query types
by using dynamic filters. The consequence of all these observations is
that more research is required to integrate correlation queries with
aggregates into a unified operator tree model." ,
bibdate    =    "Thu Nov 19 21:28:14 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( KIFER89,
key    =    "Kifer \& Lausen" ,
author    =    "Kifer, M. and Lausen, G." ,
title    =    " F-Logic A Higher-Order Language for Reasoning
about Objects, Inheritance and Scheme." ,
booktitle=    "sigmod" ,
pages    =    "134--146" ,
year    =    1989 ,
annote    =    "An extension to Maier's O-logic that is designed
to work in an OO paradigm. The basic concept is that of logic as a
query language." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( KIFER92,
key    =    "Kifer et al." ,
author    =    "Kifer, M. and Kim, W. and Sagiv, Y." ,
title    =    "Querying Object-Oriented Databases" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "San Diego, California" ,
editor    =    "Stonebraker, M." ,
volume    =    "21" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "393--402" ,
bibdate    =    "Mon Jan 25 13:50:29 1993" ,
owner    =    "bassili" ,
)

@proceedings    ( KILPATRICK91,
key    =    "Kilpatrick \& Schwan" ,
author    =    "Kilpatrick, Carol and Karsten Schwan" ,
title    =    "ChaosMoON --- Application-Specific Monitoring and
Display of Performance Information for Parallel and Distributed
Systems" ,
publisher=    "acm" ,
month    =    "May" ,
year    =    "1991" ,
abstract=    "Understanding parallel program performance often
requires the use of a variety of performance metrics and models. Some
meterics and analyses are broadly useful for many parallel
applications, others are application and application-class specific.
This research offers a framework that wupports the use of i)
alternative performance evaluation models and ii) a hierarchy of
performance model for performance analysis. The ideas incorporated in
the framework are realized in chaosMON, a system for the capture and
graphical presentation of program performance information." ,
bibdate    =    "Thu Jan 16 16:50:48 1992" ,
owner    =    "suchen" ,
)

@article    ( KIM79,
key    =    "Kim" ,
author    =    "Kim, W." ,
title    =    "Relational Database Systems" ,
journal    =    "compsurv" ,
volume    =    "11" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1979" ,
pages    =    "186--211" ,
abstract=    "This paper first surveys all the relational
database systems which have been reported, highlighting their most
noteworthy features and concepts. It then surveys and classifies
proposals for implementing each of the requisite functional components
of a hypothetical, comprehensive relational database system. It
concludes with some general observations about user responses to
relational systems." ,
keywords=    "relational database; relational model of data;
relational interface optimization; user views; snapshots; selective
access control; integrity control; integrity assertions;concurrency
control; recovery from crashes; relational algebra; relational
calculus; distributed database; cellular associative processor;
natural language interface" ,
bibdate    =    "Tue Jun 26 16:30:16 1984" ,
)

@techreport    ( KIM81,
key    =    "Kim" ,
author    =    "Kim, W." ,
title    =    "On Optimizing SQL-like nested queries" ,
number    =    "RJ 3063" ,
institution=    "ibm" ,
year    =    "1981" ,
address    =    "San Jose, CA" ,
bibdate    =    "Sat Jan  1 11:55:52 1983" ,
)

@article    ( KIM82,
key    =    "Kim" ,
author    =    "Kim, W." ,
title    =    "On Optimizing an SQL-like Nested Query" ,
journal    =    "tods" ,
volume    =    "7" ,
number    =    "3" ,
month    =    "sept" ,
year    =    "1982" ,
pages    =    "443--469" ,
keywords=    "algorithms; languages; relational database; nested
query; join; divide; aggregate function; predicate" ,
abstract=    "SQL is a high-level nonprocedural data language
which has received wide recognition in relational databases. One of
the most interesting features of SQL is the nesting of query blocks to
an arbitrary depth. An SQL-like query nested to an arbitrary depth is
shown to be composed of five basic types of nesting. Four of them have
not been well understood and more work needs to be done to improve
their execution efficiency. Algorithms are developed that transform
queries involving these basic types of nesting into semantically
equivalent queries that are amenable to efficient processing by
existing query-processing subsystems. These algorithms are then
combined into a coherent strategy for processing a general nested
query of arbitrary complexity. " ,
bibdate    =    "Mon May 20 15:54:52 1985" ,
)

@article    ( KIM84,
key    =    "Kim et al." ,
author    =    "Kim, W. and Gajski, D. and Kuck, D.J." ,
title    =    "A Parallel Pipelined Relational Query Processor" ,
journal    =    "tods" ,
volume    =    "9" ,
number    =    "2" ,
month    =    "june" ,
year    =    "1984" ,
pages    =    "214--242" ,
keywords=    "Algorithms; Design; Relational model; SQL" ,
abstract=    "This paper presents the design of a relational
query processor. The query processor consists of only four processing
PIPEs and a number of random-access memory modules. Each PIPE
processes tuples of relations in a bit-serial, tuple-parallel manner
for each of the primitive database operations which comprise a complex
relational query. The design of the query processor meets three major
objectives: the query processor must be manufacturable using existing
and near-term LSI (VLSI) technology: it must support in a uniform
manner both the numeric and nonnumeric processing requirements a
high-level user interface like SQL presents; and it must support the
query-processing strategy derived in the query optimizer to satisfy
certain system-wide performance optimality criteria." ,
annote    =    "The result of each operation is written back to
disk before the next operation commences. This paper describes the
high level organization of the four modules: single-relation query
pipe (32 chips), aggregation pipe (1 chip), sorting pipe (8 chips),
and join pipe (32 chips). VLSI implementation of portions of some of
the chips is ``in progress''." ,
bibdate    =    "Mon Feb 11 08:19:47 1985" ,
)

@inproceedings    ( KIM84A,
key    =    "Kim et al." ,
author    =    "Kim, W. and Lorie, R. and McNabb, D. and Plouffe,
W." ,
title    =    "A Transaction Mechanism for Engineering Databases" ,
booktitle=    "vldb" ,
year    =    "1984" ,
pages    =    "355--362" ,
volume    =    "10" ,
bibdate    =    "Thu Jan  8 11:47:00 1987" ,
owner    =    "manning" ,
)

@inbook        ( KIM84B,
key    =    "Kim" ,
author    =    "Kim, W." ,
title    =    "Global Optimization of Relational Queries: A First
Step" ,
booktitle=    "Query Processing in Database Systems" ,
publisher=    "Springer-Verlag" ,
address    =    "Berlin" ,
year    =    "1984" ,
series    =    "Topics in Information Systems" ,
chapter    =    "12" ,
pages    =    "206--216" ,
bibdate    =    "Wed Nov  2 13:43:59 1988" ,
owner    =    "" ,
)

@inproceedings    ( KIM87,
key    =    "Kim et al." ,
author    =    "Kim, W. and Woelk, D. and Garza, J. and Chou,
H.-T. and Banerjee, J. and Ballou, N." ,
title    =    "Enhancing the Object-oriented Concepts for
Database Support" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1987" ,
pages    =    "291--292" ,
abstract=    "In this paper, we elaborate on three major
enhancements to the conventional object-oriented data model, namely,
schema evolution, composite objects, and versions. Schema evolution is
the ability to dynamically make changes to the class definitions and
the structure of the class lattice. Composite objects are recursive
collections of exclusive components that are treated as units of
storage, retrieval, and integrity enforcement. Versions are variations
of the same object that are related by the history of their
derivation. These additional features are strongly motivated by data
management requirements of object-oriented applications from the AI,
CAD/CAM, and OIS (office information systems with multimedia
documents) domains. An object-oriented data model, with these
enhancements, has been incorporated into ORION, a prototype database
system developed at MCC as a vehicle of research into object-oriented
databases." ,
bibdate    =    "Thu Apr 28 15:42:25 1988" ,
owner    =    "" ,
)

@inproceedings    ( KIM87A,
key    =    "Kim et al." ,
author    =    "Kim, W. and Banerjee, J. and Chou, H.-T. and
Garza, J.~F. and Woelk, D." ,
title    =    "Composite Object Support in an Object-Oriented
Database System" ,
booktitle=    "OOPSLA '87 Proceedings" ,
year    =    "1987" ,
pages    =    "118--125" ,
month    =    "October" ,
)

@article    ( KIM88A,
key    =    "Kim et al." ,
author    =    "Kim. H.-J. and Korth, H.F. and Silberschatz and A." ,
title    =    "PICASSO: A Graphical Query Language" ,
journal    =    "Software-Practice and Experience" ,
publisher=    "John Wiley \& Sons, Ltd" ,
volume    =    "18" ,
number    =    "3" ,
month    =    "mar" ,
year    =    "1988" ,
pages    =    "169--203" ,
abstract=    "PICASSO- PICture Aided Sophisticated Sketch Of
database queries- is graphics-based database query language designed
for use with a universal relation database system. The primary
objective of PICASSO is ease of use. Graphics are used to provide a
simple method of expressing queries and to provide visual feedback to
the u ser about the system's interpretation of the query.
Inexperienced users can use the graphical feedback to aid them in
formulating queries whereas experienced users can ignore the feedback.
Inexperienced users can pose queries without knowing the details of
underlying database schema and without learning the formal syntax of
SQL-like query language. This paper presents the syntax of PICASSO
queries and compares PICASSO queries with similar queries in standard
relational query languages. Comparisons are also made with System/U, a
non-graphical universal relation system on which PICASSO is based. The
hypergraph semantics of the universal relation are used as the
foundation for PICASSO and their integration with a graphical
workstation enhances the usability of database systems." ,
bibdate    =    "Mon Mar 20 09:13:50 1989" ,
owner    =    "payne" ,
)

@inproceedings    ( KIM88B,
key    =    "Kim \& Korth" ,
author    =    "Kim, H.J. and Korth, H.F." ,
title    =    "PSYCHO: A Graphical Language for Supporting Schema
Evolution in Object-Oriented Databases, Extended Abstract" ,
booktitle=    "Proceedings of Third User System Interface
Conference-USICON88" ,
address    =    "Austin, TX" ,
month    =    "feb" ,
year    =    "1988" ,
bibdate    =    "Fri Mar 31 14:10:23 1989" ,
owner    =    "payne" ,
)

@inproceedings    ( KIM88C,
key    =    "Kim \& Chou" ,
author    =    "Kim, W. and Chou, H.T." ,
title    =    "Versions of Schema in OODB" ,
booktitle=    "vldb" ,
address    =    "Long Beach, CA" ,
year    =    "1988" ,
bibdate    =    "Fri Mar 31 14:12:39 1989" ,
owner    =    "payne" ,
pages    =    "148--159" ,
)

@techreport    ( KIM88D,
key    =    "Kim \& Chou" ,
author    =    "Kim, W. and Chou, H.-T." ,
title    =    "Versions of Schema for Object-Oriented Databases" ,
institution=    "MCC" ,
address    =    "Austin, TX" ,
year    =    "1988" ,
pages    =    "1--25" ,
annote    =    "Also appeared in VLDB '88" ,
abstract=    "Version control is one of the important database
requirements for design environments. Various models of versions has
been focused exclusively on versioning single design objects. In a
multi-user design environment where the schema definition of the
design objects may undergo dynamic changes, it is important to be able
to version the schema, as well as version the single design objects.
In this paper, we propose a model of versions of schema by extending
our model of versions of single objects. In particular, we present the
semantics of our model of versions of schema for object-oriented
databases, explore issues in implementing the model, and examine a few
alternatives to our model of versions of schema." ,
bibdate    =    "Fri Apr  7 13:19:34 1989" ,
owner    =    "payne" ,
)

@article    ( KIM88E,
key    =    "Kim et al." ,
author    =    "Kim, W. and Chou, H.-T. and Banerjee, J." ,
title    =    "Operations and Implementation of Complex Objects" ,
journal    =    "IEEE Transactions on Software Engineering" ,
year    =    "1988" ,
volume    =    "14" ,
number    =    "7" ,
pages    =    "985--996" ,
month    =    "July" ,
)

@article    ( KIM89A,
key    =    "Kim" ,
author    =    "Kim, H.J." ,
title    =    "Logical Design of Object-Oriented Database Schema" ,
journal    =    "Object-Oriented Databases with Applications to
CA/CAM, CASE, VLSI, Network Management" ,
publisher=    "Prentice Hall" ,
year    =    "1989" ,
annote    =    "To appear" ,
bibdate    =    "Fri Mar 31 14:11:47 1989" ,
owner    =    "payne" ,
)

@techreport    ( KIM89B,
key    =    "Kim \& Korth" ,
author    =    "Kim, H.-J. and Korth, H.F." ,
title    =    "Schema Versions and DAG Rearrangement Views in
Object-Oriented Databases" ,
institution=    "ICS; Department of Computer Science" ,
address    =    "Georgia Institute of Technology, Atlanta, GA;
University of Texas, Austin, TX" ,
year    =    "1989" ,
month    =    "mar" ,
pages    =    "1--29" ,
annote    =    "to be submitted soon" ,
abstract=    "An important requirement of non-traditional
database applications such as computer aided design, artificial
intelligence, and office information systems with multimedia documents
is the support of application evolution. Application evolution
includes evolution of object schemas as well as evolution of objects
in the application. As such, the ability of representing variants and
alternatives of objects and their schemas is required in
object-oriented databases. In this paper, we propose two mechanisms
schema versions and DAG rearrangement views as the solution of
representing variants and alternatives of object schemas in
object-oriented databases. First, we present a technique that enables
users to explicitly manipulate schema versions and maintain schema
evolution histories. We also present the semantics of operations for
schema versioning. Second, we identify new types of views, called DAG
rearrangement views, of composite objects and class hierarchies
respectively. We identify sets of composite object views with the
property that queries on the views are processable on instances of the
original composite object schema. We also discuss how instances would
be viewed and reorganized in DAG rearrangement views of class
hierarchies." ,
bibdate    =    "Mon Mar 20 08:47:33 1989" ,
owner    =    "payne" ,
)

@inproceedings    ( KIM89D,
key    =    "Kim" ,
author    =    "Kim, W." ,
title    =    "Composite Objects Revisited" ,
booktitle=    "sigmod" ,
pages    =    "337--347" ,
month    =    "jun" ,
year    =    1989 ,
annote    =    "The paper discusses details of the ORION system.
Specifically the version control, authorization and locking
procedures. It also goes into a fair amount of detail on the semantics
of the objects, and their composites." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@book        ( KIM89E,
key    =    "Kim et al." ,
author    =    "Kim, W. and Ballou, N. and Chou, H.~T. and Garza,
J.~F. and Woelk, D." ,
editor    =    "W. Kim and F. Lochovsky" ,
title    =    "Features of the Orion Object-Oriented Database
System" ,
publisher=    "ACM Press" ,
address    =    "New York" ,
year    =    "1989" ,
bibdate    =    "Wed Mar 29 14:51:46 1995" ,
owner    =    "jeff" ,
)

@article    ( KIM90,
key    =    "Kim et al." ,
author    =    "Kim, W. and J.~F. Garza and N. Ballou and D. Woelk" ,
title    =    "Architecture of the ORION Next-Generation Database
System" ,
journal    =    "tkde" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "Mar" ,
year    =    "1990" ,
pages    =    "109--124" ,
keywords=    "Cache validation, composite objects, language and
database integration, next-generation database system, object-oriented
database system, query porcessing, schema evolution, storage
management, transaction management, version management." ,
abstract=    "ORION is a series of next-generation database
systems which have been prototyped at MCC as vehicles for research
into the next-generation database architecture and into the
integration of programmin languages and databases. The ORION series
includes three systems: the ORION-1 single processor system, the
ORION-1SX object server on a network of computers, and the ORION-2
fully distributed system. The ORION systems support a rich set of
database features for the next-generation data-intensive application
environments. These include an object-oriented data model, transaction
management, queries and automatic query optimization, version control,
change notification, composite objects, and multimedia data
management. In this paper, we describe verious architectural
somponents of ORION-1 and ORION-1SX, and where appropriate, provide a
retrospection on the current implementation." ,
bibdate    =    "Sun Aug  4 21:40:14 1991" ,
owner    =    "suchen" ,
)

@article    ( KIM90A,
key    =    "Kim" ,
author    =    "Kim, W." ,
title    =    " Object-Oriented Databases: Definition and
Research Directions" ,
journal    =    "tkde" ,
volume    =    2 ,
pages    =    "327--341" ,
month    =    "sep" ,
year    =    1990 ,
annote    =    "Overview of the OODBMS field it contains good
definitions of basic OO concepts and describes research areas in
OODBMS. It makes a good argument for the need of DBMS translators." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( KIM91,
key    =    "Kim \& Seo" ,
author    =    "Kim, W. and Seo, J." ,
title    =    "Classifying Schematic and Data Heterogeneity in
Multi Database Systems" ,
journal    =    "IEEE Computer" ,
volume    =    24 ,
pages    =    "12--18" ,
publisher=    "IEEE Press" ,
month    =    "dec" ,
year    =    1991 ,
annote    =    "Discussion of the overall problem, good solution
approaches when the heterogeneity is only schema based. Calls for work
on the problem when heterogeneous modules are involved." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@techreport    ( KIM93,
key    =    "Kim" ,
author    =    "Kim, W." ,
title    =    "On Object-Oriented Database Technology" ,
institution=    "UniSQL, Inc." ,
address    =    "Austin, TX" ,
year    =    "1993" ,
bibdate    =    "Fri Jan  7 11:27:35 1994" ,
owner    =    "rts" ,
)

@article    ( KIM95,
key    =    "Kim \& March" ,
author    =    "Kim, Y. and March, S. T." ,
title    =    "Comparing Data Modeling Formalisms" ,
journal    =    "cacm" ,
publisher=    "ACM Press" ,
volume    =    "38" ,
number    =    "6" ,
month    =    "jun" ,
year    =    "1995" ,
pages    =    "103--112" ,
bibdate    =    "Mon Nov 27 12:34:14 1995" ,
owner    =    "jeff" ,
)

@inproceedings    ( KING81,
key    =    "King" ,
author    =    "King, Jonathan J." ,
title    =    "QUIST: A System for Semantic Query Optimization in
Relational Databases" ,
booktitle=    "Proceedings of the Seventh International
Conference on Very Large Data Bases" ,
year    =    "1981" ,
pages    =    "510--517" ,
month    =    "" ,
)

@incollection    ( KING89,
key    =    "King" ,
author    =    "King, R." ,
title    =    "My Cat is Object Oriented" ,
editor    =    "Kim, W. and Lochovsky, H." ,
booktitle=    "Object Oriented Concepts, Databases and
Applications" ,
pages    =    "23--29" ,
publisher=    "ACM Press" ,
address    =    "New York" ,
year    =    1989 ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( KINSLEY79,
key    =    "Kinsley \& Driscoll" ,
author    =    "Kinsley, Kathryn C. and Driscoll, James R." ,
title    =    "Dynamic Derived Relations Within the RAQUEL II
DBMS" ,
booktitle=    "Proceedings of the 1979 ACM Annual Conference" ,
year    =    "1979" ,
pages    =    "69--80" ,
month    =    "October" ,
)

@inproceedings    ( KINSLEY84,
key    =    "Kinsley \& Driscoll" ,
author    =    "Kinsley, Kathryn C. and Driscoll, James R." ,
title    =    "A Generalized Method for Maintaining Views" ,
booktitle=    "Proceedings of the National Computer Conference" ,
year    =    "1984" ,
pages    =    "587--593" ,
)

@article    ( KITSUREGAWA83,
key    =    "Kitsuregawa et al." ,
author    =    "Kitsuregawa, M. and Tanaka, H. and Moto-oka, T." ,
title    =    "Application of Hash to Database Machine and Its
Architecture" ,
journal    =    "New Generation Computing" ,
volume    =    "1" ,
number    =    "1" ,
year    =    "1983" ,
bibdate    =    "Mon May 31 21:07:24 1993" ,
owner    =    "soo" ,
)

@inproceedings    ( KITSUREGAWA89,
key    =    "Kitsuregawa et al." ,
author    =    "Kitsuregawa, M. and Harada, L. and Takagi, M." ,
title    =    "Join Strategies on KD-Tree Indexed Relations" ,
booktitle=    "Proceedings of the Fifth International Conference
on Data Engineering" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1989" ,
pages    =    "85--93" ,
abstract=    "In this paper we present efficient join algorithms
on very large relations indexed by KD-trees. There are previous works
proposing the join on multi-attribute clustered relations based on
hashing and also on grid-partitioning, whose shortcomings are
non-order preservation and low load-factor, respectively. KD-tree
indexed relations are characterized by preserving data order and
maintaining high load-factors. However, KD-tree indexing has the
disadvantage of generating clusters which are overlapped in the join
attribute domain, what causes a very high I/O cost for naive join
algorithms. Here we analyze strategies to deal with this problem and
introduce efficient algorithms to join two non-resident relations
indexed by KD-trees. First we introduce the concept of wave, which is
a set of pages that is the object of join processing and that
propagates over the relation space in the direction of the join
attribute axis. Based on this new concept, we present five join
algorithms and also four extended algorithms with a garbage collection
mechanism to increase the effective space of the main memory. We
extensively evaluate these join algorithms with analytical formulas
and simulation results. It is shown that the join of very large
relations indexed by KD-trees can be performed with one scan of the
relations." ,
bibdate    =    "Fri Jan 12 09:43:55 1990" ,
owner    =    "robyn" ,
)

@inproceedings    ( KJELLBERG84,
key    =    "Kjellberg \& Zahle" ,
author    =    "Kjellberg, P. and Zahle, T." ,
title    =    "Cascade Hashing" ,
booktitle=    "vldb" ,
month    =    "aug" ,
year    =    "1984" ,
pages    =    "481--492" ,
bibdate    =    "Fri Jun  7 17:49:34 1985" ,
)

@article    ( KLAHOLD85A,
key    =    "Klahold et al." ,
author    =    "Klahold, P. and Schlageter, G. and Unland, R. and
Wilkes, W." ,
title    =    "A transaction model supporting complex
applications in integrated information systems" ,
journal    =    "Proceedings of ACM-SIGMOD 1985 International
Conference on Management of Data" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "388--401" ,
abstract=    "The use of database systems in new applications,
e.g. computer aided design, software engineering, etc, leads to new
requirements for the transaction management. Main characteristics of
such environments are long duration of transactions and teamwork. In
this paper we introduce a concept for long transactions which
especially supports the cooperative work of groups on a common set of
data. The transaction model has two levels: on the one hand the team
has to be protected from the outside world, on the other hand
mechanisms are required which allow controlled teamwork on common
objects. In the latter case rigid synchronisation mechanisms as used
in database systems are not applicable. A main concept for the support
of teamwork and for design databases in genereal is a user-oriented
version mechanism. This paper presents such a mechanism and its
integration into the transaction model." ,
bibdate    =    "Wed Jun 12 15:00:39 1985" ,
)

@inproceedings    ( KLAUSNER85A,
key    =    "Klausner \& Goodman" ,
author    =    "Klausner, A. and Goodman, N." ,
title    =    "Multirelations --- Semantics and Languages" ,
booktitle=    "vldb" ,
address    =    "Stockholm, Sweden" ,
editor    =    "Pirotte, A. and Vassiliou, Y." ,
month    =    "aug" ,
year    =    "1985" ,
pages    =    "251--258" ,
abstract=    "We argue that a multirelation (relation with
duplicates) is not a semantically independent data object, but rather
it should be viewed as a subset of columns within a larger relation
that has no duplicates. Consequently, at the level of the conceptual
database, duplicates in base relations or in views are not allowed,
nor are operations on multirelations. Multirelations as query output
can be specified by designing a subset of some relation's columns for
output, while ``hiding'' the rest of the columns. Similarily,
aggregate functions are applied to multirelations by applying them to
a column within a relation. Our approach can be applied to extend any
query language in a consistent way to have full multirelational
expressiveness, and such an extension for the query language QUEL is
detailed." ,
bibdate    =    "Thu Nov 19 21:35:28 1987" ,
owner    =    "mckenzie" ,
)

@techreport    ( KLEBANOFF74,
key    =    "Klebanoff et al." ,
author    =    "Klebanoff, J. and Lochovsky, F. and Rozitis, A.
and Tsichritzis, D." ,
title    =    "Educational Data Base System User's Manual" ,
number    =    "CSRG-40" ,
institution=    "Computer Systems Research Group, University of
Toronto" ,
year    =    "1974" ,
month    =    "sept" ,
abstract=    "The Educational Data Base System (EDBS) is an
interactive data base management system designed for educational use.
The system implements both the relational and hierarchic views of
data. EDBS is written in and accessed from APL PLUS. A student user
oriented description of the EDBS information structures and data
manipulation language is presented. This is followed by a number of
suggested exercises and games to be used with EDBS in a course." ,
bibdate    =    "Fri Apr 12 09:07:15 1985" ,
)

@article    ( KLUG82,
key    =    "Klug" ,
author    =    "Klug, A." ,
title    =    "Equivalence of Relational Algebra and Relational
Calculus Query Languages Having Aggregate Functions" ,
journal    =    "jacm" ,
volume    =    "29" ,
number    =    "3" ,
month    =    "jul" ,
year    =    "1982" ,
pages    =    "699--717" ,
abstract=    "Aggregate functions in relational query languages
allow intricate reports to be written. In this paper aggregate
functions are precisely defined. The definition does not use the
notion of 'duplicates'. Relational algebra and relational calculus are
extended in a general and natural fashion to include aggregate
functions. It is shown that the languages so extended have equivalent
expressive power." ,
bibdate    =    "Thu Sep 29 13:07:52 1983" ,
)

@inproceedings    ( KLUG82B,
key    =    "Klug" ,
author    =    "Klug, A." ,
title    =    "Access Paths in the ``Abe'' Statistical Query
Facility" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Schkolnick, M." ,
month    =    "jun" ,
year    =    "1982" ,
pages    =    "161--173" ,
keywords=    "aggregates, access paths" ,
address    =    "Orlando, FL" ,
abstract=    "An increasingly inportant part of information
processing today involves the taking of counts, sums, averages, and
other statistical or aggregate quantities. The ``Abe'' query language
is designed to make formulation of complicated aggregations simple.
Access path selection in Abe finds efficient ways to execute these
complicated queries. Access paths for Abe queries perform ``aggregate
joins,'' that is, they compute aggregate quantities at the same time
as they join subqueries with parent queries. This can be done using
index scans or merging scans depending on how many ``partitions'' need
to be accessed." ,
bibdate    =    "Wed Aug 19 18:50:40 1987" ,
owner    =    "mckenzie" ,
)

@techreport    ( KOBAYASHI92A,
key    =    "Kobayashi" ,
author    =    "Kobayashi, I." ,
title    =    "Complex Values, Structured Terms and Aggregate
Functions" ,
institution=    "Sanno Institute" ,
address    =    "Kanagawa, Japan" ,
year    =    "1992" ,
pages    =    "17" ,
abstract=    "Dealing with complex values in the database
environment is an old but still a growing requirement. The first
normal form restriction, which Codd assumed in his first proposal of
relational model, certainly enables us, in particular, to evolve a
simple and beautiful database design theory; however, on the other
hand, relational database systems applications have been much
ennarrowed because of the first normal form restriction. Various
conventional devices have been integrated in the existing relational
databases systems to deal with some complex values like sets of some
special types. However, few systems are equipped with formal methods
like extensible data types of defining new types of complex values.
This paper proposes a formal way of dealing with complex values, which
can be implemented on classical relational database systems. As a
syntactical counterpart of complex values, it is necessary to allow
structured terms in describing database queries. Aggregate functions
are described as functions on intensionally defined multisets." ,
bibdate    =    "Sat Oct 10 19:41:48 1992" ,
owner    =    "bassili" ,
)

@techreport    ( KOBAYASHI92B,
key    =    "Kobayashi" ,
author    =    "Kobayashi, I." ,
title    =    "First-Order Queries and Relational Algebra on
Unnormalized Relations" ,
institution=    "Sanno Institute" ,
address    =    "Kanagawa, Japan" ,
year    =    "1992" ,
pages    =    "18" ,
abstract=    "In many database applications, it is very
desirable to store and manipulate complex values as they are. Because
of the first normal form restriction, relational database systems are
not capable of dealing with complex values though they are powerful in
many other points. In a previous paper, the author studied properties
of the underlying domain containing complex values, and discussed the
possibility of extending first-order syntax rules to include
structural terms. Now, it becomes necessary to extend relational query
languages so that they can deal with complex values and structured
terms so far introduced. First-order queries, relational algebra,
tuple (relational) calculus and DATALOG can be thought as four major
query languages. This paper is to study extension applied to the first
two, first-order queries and relational algebra, and to compare their
expressive power before and after the extension. First-order predicate
calculus is used throughout the discussion but several new notions
regarding finite evaluability of query formulas are introduced to
accord with the database environment. This paper is a revised version
of the paper with the same title appeared in Proceedings of the First
European-Japanese Seminar on Information Modelling and Knowledge
Bases, Hakone, Japan, 1991." ,
bibdate    =    "Sat Oct 10 19:37:23 1992" ,
owner    =    "bassili" ,
)

@techreport    ( KOBAYASHI92C,
key    =    "Kobayashi" ,
author    =    "Kobayashi, I." ,
title    =    "Equivalence and Non-Equivalence Transformations of
Predicate Systems" ,
institution=    "Sanno Institute" ,
address    =    "Kanagawa, Japan" ,
year    =    "1992" ,
pages    =    "16" ,
abstract=    "Expressive power of a database system is
determined by its database schema and integrity constraints defined on
it, which are corresponding to a set of predicates and a set of rules
defined on it, respectively, in formal logic. In this paper, we call a
predicate set and a set of rules defined on it collectively a
predicate system. A predicate system may represent more states of the
real world than another predicate system; a predicate system may
express more facts in a real world state than another predicate
system. Two predicate systems are said to be equivalent if they can
express the same collection of real world states and the same
collection of facts in each real world state. Given a transformation
from a predicate set to another predicate set, it is possible to find
a rule set on each of the two predicate sets such that the given
transformation becomes an equivalence transformation between the two
predicate systems. Once such an equivalence transformation has been
established, it is possible not only to rewrite a database of one
predicate system into that of another predicate system but also to
convert rules and queries on one predicate system into those on
another predicate system. Discussions exploited there can also be
applied to examining properties of non-equivalence transformations
among predicate systems. The theory may serve not only as a general
foundation of database design methodology including normal form
decomposition but also as a tool to solve some problems in schema
evolution, view support and data translation." ,
bibdate    =    "Sat Oct 10 19:44:28 1992" ,
owner    =    "bassili" ,
)

@techreport    ( KOBAYASHI92D,
key    =    "Kobayashi" ,
author    =    "Kobayashi, I." ,
title    =    "Tuple Calculus on Unnormalized Relations" ,
institution=    "Sanno Institute" ,
address    =    "Kanagawa, Japan" ,
year    =    "1992" ,
month    =    "apr" ,
pages    =    "19" ,
abstract=    "Most of the existing relational query languages
are based on tuple calculus queries. Tuple calculus queries are more
intuitive than first-order queries in the sense that the real world
objects are basically represented by tuples in relational databases
and their properties are expressed by attribute values of these
tuples. In many advanced database applications, we have to deal with
objects with complex attribute values. Since such objects are
represented by tuples in unnormalized relations, we need some extended
query languages defined on them. This paper is to discuss an extension
of tuple calculus queries that allows the use of evaluable predicates
defined on complex values, functions and structured terms. Its
expressive power is compared with that of (extended) first-order
queries and relational algebra." ,
bibdate    =    "Sat Oct 10 19:46:20 1992" ,
owner    =    "bassili" ,
)

@inproceedings    ( KOENIG81A,
key    =    "Koenig \& Paige" ,
author    =    "Koenig, S. and Paige, R." ,
title    =    "A Transformational Framework for the Automatic
Control of Derived Data" ,
booktitle=    "vldb" ,
address    =    "Cannes, France" ,
editor    =    "Zaniolo, C. and Delobel, C." ,
month    =    "sep" ,
year    =    "1981" ,
pages    =    "306--318" ,
keywords=    "functional data model, finite differencing,
incremental, integrity control, triggers, derived data" ,
abstract=    "This paper investigates the specification,
implementation and application of derived data in the context of a
functional/binary association data model. A framework for the
automatic maintenance of derived data is presented. This framework is
based on the transformational techniques of finite differencing in
which repeated costly computations are replaced by more efficient
incremental counterparts. Applications of this approach to summary
data, integrity control and triggers are discussed." ,
bibdate    =    "Wed Aug 19 17:00:49 1987" ,
owner    =    "mckenzie" ,
)

@article    ( KORTH84A,
key    =    "Korth et al." ,
author    =    "Korth, H.F. and Kuper, G.M. and Feigenbaum, J. and
Gelder, A.V. and Ullman, J.D." ,
title    =    "System/U: A Database System Based on the Universal
Relation Assumption" ,
journal    =    "tods" ,
volume    =    "9" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1984" ,
pages    =    "331--347" ,
abstract=    "System/U is a universal relation database system
under development at Stanford University which uses the language C on
UNIX. The system is intended to test the use of the universal view, in
which the entire database is seen as one relation. This paper
describes the theory behind System/U, in particular the theory of
maximal objects and the connection between a set of attributes. We
also describe the implementation of the DDL (Data Description
Language) and the DML (Data Manipulation Language), and discuss in
detail how the DDL finds maximal objects and how the DML determines
the connection between the attributes that appear in a query." ,
bibdate    =    "Mon Oct 15 10:08:39 1984" ,
)

@techreport    ( KORTH87A,
key    =    "Korth \& Roth" ,
author    =    "Korth, H.F. and Roth, M.A." ,
title    =    "Query Languages for Nested Relational Databases" ,
number    =    "TR-87-45" ,
institution=    "Department of Computer Sciences" ,
address    =    "University of Texas, Austin, TX" ,
year    =    "1987" ,
month    =    "dec" ,
pages    =    "1--15" ,
abstract=    "The nested relational model has proven useful in
modeling databases of complex objects. In this paper, we consider
query languages designed specifically to exploit the power of this
model. First, formal query languages are considered: a relational
calculus defining the desired power of nested relational languages,
and a relational algebra that provides a procedural language suitable
for query optimization. Next, two higher-level languages are discussed
and compared, SQL/NF, and Heidelberg Data Base Language-HDBL. Two
extensions of these languages are considered. X-SQL/NF is a role-join
extended version of SQL/NF that incorporates an ISA hierarchy into the
semantics of the language. A recursive version of HDBL allows the
definition of a transitive closure operation on nested relations." ,
bibdate    =    "Thu May 19 15:40:45 1988" ,
owner    =    "manning" ,
)

@techreport    ( KORTH87B,
key    =    "Korth \& Speegle" ,
author    =    "Korth, H.F. and Speegle, G." ,
title    =    "Formal Model of Correctness without
Serializability" ,
number    =    "TR-87-47" ,
institution=    "Department of Computer Sciences" ,
address    =    "University of Texas, Austin, TX" ,
year    =    "1987" ,
month    =    "dec" ,
pages    =    "1--19" ,
abstract=    "In the classical approach to transaction
processing, a concurrent execution is considered to be correct if it
is equivalent to a non-concurrent schedule. This notion of correctness
is called serializability. Serializability has proven to be a highly
useful concept for transaction systems for data-processing style
applications. Recent interest in applying database concepts to
applications in computer-aided design, office information system, etc.
has resulted in transactions of relatively long duration. For such
transactions, there are serious consequences to requiring
serializability as the notion of correctness. Specifically, such
systems either impose long-duration waits or require the abortion of
long transactions. In this paper, we define a transaction model that
allows for several alternative notions of correctness without the
requirement of serializability. After introducing the model, we
investigate classes of schedules for transactions in the model. We
show that these classes are richer than analogous classes under the
classical model. Finally, we show the potential practicality of our
model by describing protocols that permit a transaction manager to
allow non-serializable executions that are correct under our model." ,
bibdate    =    "Thu May 19 15:47:44 1988" ,
owner    =    "manning" ,
)

@article    ( KOSTER76,
key    =    "Koster" ,
author    =    "Koster, Cornelis H. A." ,
title    =    "Visibility and Types" ,
journal    =    "Sigplan Notices" ,
year    =    "1976" ,
volume    =    "11" ,
number    =    "" ,
pages    =    "179--190" ,
month    =    "" ,
)

@inproceedings    ( KOSTER87,
key    =    "Koster" ,
author    =    "Koster, A." ,
title    =    "Parallel Processing of Relational Databases on a
Cellular Tree Machine" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1987" ,
pages    =    "200--207" ,
abstract=    "This paper investigates the use of a cellular tree
computer, the FFP machine, for parallel processing of relational
databases. This machine directly executes Formal Functional
Programming (FFP) code. A method to embed SQL statements in FFP
programs is described. Schemes for parallel implementation of simple
retrieval statements are presented for different I/O architectures.
Then techniques for parallel implementation of more complex retrieval
statements are given. Because the FFP machine can accommodate the
almost unbounded parallelism of FFP programs, execution time analysis
shows potential for highly efficient execution of relational database
queries on this machine. Modifications of the FFP machine to speed up
input/output operations are discussed." ,
bibdate    =    "Thu Apr 28 16:17:57 1988" ,
owner    =    "" ,
)

@techreport    ( KOUBARAKIS89,
key    =    "Koubarakis et al." ,
author    =    "Koubarakis, M. and Mylopoulos, J. and Stanley, M.
and Borgida, A." ,
title    =    "Telos: Features and Formalization" ,
number    =    "KRR-TR-89-4" ,
institution=    "University of Toronto" ,
address    =    "Toronto, Ontario, Canada" ,
year    =    "1989" ,
month    =    "feb" ,
pages    =    "84" ,
abstract=    "It has been argued that the first step in the
development of an information system should be the description of the
environment within which the system is intended to function together
with the role of the information system will eventually play within
the environment. This is called the requirements modelling phase in
information system development. In this report, we present the
features and the formalization of Telos, a knowledge representation
language for requirements modeling. Telos supports a structurally
object-oriented representational framework which encourages the
organization of knowledge. Moreover, the framework treats attributes
as objects in their own right and provides representational facilities
for time and assertions. As with other representation systems,
assertions can either serve as constraints on the knowledge base or
rules from which new facts can be derived. Interaction with the
knowledge base is achieved through ASKing and TELLing operations in
the spirit of KRYPTON. The formal semantics of the language is
provided by providing a translation scheme from Telos knowledge bases
to theories in a many sorted first order language. These theories
include axioms that reflect the nature of objects, time and the
knowledge organization mechanisms supported by Telos. Then knowledge
base operations are essentially treated as mappings between theories." ,
bibdate    =    "Sat Mar  6 19:12:20 1993" ,
owner    =    "bassili" ,
)

@techreport    ( KRISHNAMURTHY83,
key    =    "Krishnamurthy et al." ,
author    =    "Krishnamurthy, R. and Morgan, S.P. and Zloof, M.M." ,
title    =    "Query-by-Example: Operations on Piecewise
Continuous Data" ,
type    =    "research report" ,
number    =    "RC 9928 (44026)" ,
institution=    "IBM Thomas J. Watson Research Center" ,
address    =    "Yorktown Heights, NY" ,
year    =    "1983" ,
month    =    "apr" ,
pages    =    "1--17" ,
abstract=    "In this paper, we extend the conventional concept
of a database as a set of discrete relations to include a set of
piecewise continuous functions. We extend the features of
Query-by-Example to operations on this piecewise continuous data.
Further, we include the concept of iteration in the language, which
enhances its capabilities to that of a general programming language.
These extensions are accomplished without loss of the simplicity that
is usually attributed to Query-by-Example; furthermore, Query-
by-Example retains its table-like view of data over these new
piecewise continuous functions. Finally, we present an argument for
Query-by-Example's completeness, which shows the capability of
expressing queries in Query-by- Example which cannot be expressed in
other user-friendly languages such as SEQUEL, QUEL, etc." ,
bibdate    =    "Tue Jan 20 13:17:07 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( KRISHNAMURTHY84,
key    =    "Krishnamurthy \& Hochgesang" ,
author    =    "Krishnamurthy, R. and Hochgesang, G.T." ,
title    =    "Architecture for an Universal Office System" ,
booktitle=    "JCIT" ,
address    =    "Jerusalem" ,
year    =    "1984" ,
abstract=    "The concept of user friendliness has been a
nebulous idea in office systems and we question the universality of
this concept among all users. It is our claim here that for any office
system to be widely acceptable by a wide variety of users, it must
support many user interfaces. Such a multi-user interface system is
termed an Universal Office System. We propose an architecture of an
universal office system that is capable of supporting any office
languge that is casual and unambiguous. We present a trichotomous
organization for the system where the user universe is captured in a
conceptual schema and each individual user interface is mapped to the
conceptual schema. We argue that any office language can be mapped
into the conceptual schema using a modified QBE language presented
here, thus arguing the simplicity of supporting a new interface. This
paper shows the feasibility of this approach from the point of view of
existence of the system. One advantage of this system is that many
user interfaces are supported while guaranteeing the compatibility of
the data and other shared resources among all the users. This has
another benefit of enabling the user to migrate from one interface to
another. Finally, we discuss some future research problems. " ,
bibdate    =    "Tue Jan 20 13:10:17 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( KRISHNAMURTHY86A,
key    =    "Krishnamurthy et al." ,
author    =    "Krishnamurthy, R. and Boral, H. and Zaniolo, C." ,
title    =    "Optimization of Nonrecursive Queries" ,
booktitle=    "vldb" ,
address    =    "Kyoto, Japan" ,
editor    =    "Kambayashi, Y." ,
month    =    "aug" ,
year    =    "1986" ,
pages    =    "128--137" ,
abstract=    "State-of-the-art optimization approaches for
relational database systems, e.g., those used in systems such as QBE,
SQL/DS, and commercial INGRES, when used for queries in
non-traditional database applications, suffer from two problems.
First, the time complexity of their optimization algorithms, being
combinatoric, is expronential in the number of relations to be joined
in the query. Their cost is therefore prohibitive in situations such
as deductive databases and logic oriented languages for knowledge
bases, where hundreds of joins may be required. The second problem
with the traditional approaches is that, albeit effective in their
specific domain, it is not clear whether they can be generalized to
different scenarios (e.g., parallel evaluation) since they lack a
formal model to define the assumptions and critical factors on which
their validity depends. This paper proposes a solution to these
problems by presenting (i) a formal model and a precise statement of
the optimization problem that delineates the assumptions and
limitations of the previous approaches, and (ii) a quadratic-time
algorithm that determines the optimum join order for acyclic queries.
The approach proposed is robust; in particular, it is shown that it
remains heuristically effective for cyclic queries as well." ,
bibdate    =    "Fri Nov 20 10:56:53 1987" ,
owner    =    "mckenzie" ,
)

@techreport    ( KUMAR87,
key    =    "Kumar \& Stonebraker" ,
author    =    "Kumar and Stonebraker" ,
title    =    "Performance Evaluation of an Operating System
Transaction Manager" ,
number    =    "M87/15" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1987" ,
bibdate    =    "Mon Nov  2 10:56:42 1987" ,
owner    =    "manning" ,
)

@techreport    ( KUMAR87A,
key    =    "Kumar \& Stonebraker" ,
author    =    "Kumar and Stonebraker" ,
title    =    "Alternative Strategies for a Semantics-Based
Operating System Transaction Manager" ,
number    =    "M87/19" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1987" ,
bibdate    =    "Mon Nov  2 10:57:19 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( KUMAR87B,
key    =    "Kumar" ,
author    =    "Kumar, V." ,
title    =    "An Analysis of the Roll-back and Blocking
Operations of Three Concurrency Control Mechanisms" ,
booktitle=    "ncc" ,
publisher=    "AFIPS Press" ,
address    =    "Chicago, IL" ,
month    =    "jun" ,
year    =    "1987" ,
pages    =    "485--497" ,
abstract=    "Transactions in database systems are run
concurrently to achieve optimal resource utilization. Concurrent
execution of transactions is managed by concurrency control mechanisms
for maintaining the database consistency. These mechanisms use
activities like transaction roll-backs and transaction blockings for
serializing the concurrent execution, and they have significant effect
on the performance of database systems; however, their relationship
with throughput, workload, and other aspects of the system is unclear.
Further it is not clear how the read:write ratio affects the
performance. This paper attempts to show the effect of roll-back,
blocking, and read:write ratio on the performance of database systems
under several different types of workloads. We have used detailed and
realistic simulation models to conduct our investigation; and, unlike
other performance studies, we have avoided simplifying assumptions as
far as possible to include most of the attributes of real database
systems. In this study we show that neither a roll-back nor a blocking
scheme is consistently better for all types of workloads; they are
rather workload sensitive. We also show that it is not the write-only
transactions but the read-only transactions that need special
treatment for efficient processing. We report that transaction
wait-time does not have significant effect on the throughput and the
effect of read:write ratio is very short lived. We have introduced a
new term Domain of Efficiency (DoE) to explain the behavior of these
mechanisms." ,
bibdate    =    "Wed Apr 27 19:17:03 1988" ,
owner    =    "" ,
)

@inproceedings    ( KUMAR87C,
key    =    "Kumar \& Stonebraker" ,
author    =    "Kumar, A. and Stonebraker, M." ,
title    =    "Performance Evaluation of an Operating System
Transaction Manager" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
year    =    "1987" ,
pages    =    "473--481" ,
abstract=    "A conventional transaction manager implemented by
a database management system (DBMS) is compared against one
implemented within an operating system (OS) in a variety of simulated
situations. Models of concurrency control and crash recovery were
constructed for both environments, and the results of a collection of
experiments are presented in this paper. The results indicate that an
OS transaction manager incurs a severe performance disadvantage and
appears to be feasible only in special circumstances." ,
bibdate    =    "Fri Jan 19 10:58:20 1990" ,
owner    =    "robyn" ,
)

@article    ( KUMAR87D,
key    =    "Kumar \& Stonebraker" ,
author    =    "Kumar, Akhil and Stonebraker, Michael" ,
title    =    "The Effect of Join Selectivities on Optimal
Nesting Order" ,
journal    =    "ACM SIGMOD Record" ,
year    =    "1987" ,
volume    =    "16" ,
number    =    "1" ,
pages    =    "28--41" ,
month    =    "March" ,
)

@inproceedings    ( KUMAR89,
key    =    "Kumar \& Segev" ,
author    =    "Kumar, A. and Segev, A." ,
title    =    "Optimizing and Evaluating Algorithms for
Replicated Data Concurrency Control" ,
booktitle=    "9th International Conference on Distributed
Computing Systems" ,
year    =    "1989" ,
annote    =    "Also Technical Report LBL-25435" ,
abstract=    "A large number of algorithms for replicated data
concurrency control are based on voting methods. Voting-type
algorithms guarantee strict serializability and are also resilient to
network partitions. Techniques for optimizing vote assignments are
presented here. Our optimization model is based on minimizing
communications cost subject to a given availability constraint. We
describe a semi-exhaustive algorithm for solving this model. The
algorithm utilizes a novel signature-based method for identifying
equivalent vote combinations, and also an efficient technique for
computing availability. The algorithms were implemented and compared
against an `equal vote' assignment to estimate the extent of possible
savings in communications costs. The nice feature of our techniques is
that they can be used by all voting-type algorithms." ,
bibdate    =    "Wed Mar 29 20:34:41 1989" ,
owner    =    "payne" ,
)

@techreport    ( KUNG84D,
key    =    "Kung et al." ,
author    =    "Kung and Hanson, E. and Ioannidis and Sellis, T.
and Shapiro and Stonebraker, M." ,
title    =    "Heuristic Search in Data Base Systems" ,
number    =    "M84/58" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1984" ,
bibdate    =    "Mon Nov  2 10:50:43 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( KUPER85,
key    =    "Kuper \& Vardi" ,
author    =    "Kuper, G.M. and Vardi, M.Y." ,
title    =    "On the Expressive Power of the Logical Data Model
Preliminary Report" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "180--187" ,
bibdate    =    "Tue Jun 11 13:20:57 1985" ,
)

@article    ( KUPER93,
key    =    "Kuper \& Vardi" ,
author    =    "Kuper, G.~M. and Vardi, M.~Y." ,
title    =    "The Logical Data Model" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "18" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1993" ,
pages    =    "379--413" ,
keywords=    "Algebra; database schema; logic; relational
datebase; tuple calculus" ,
abstract=    "We propose an object-oriented data model that
generalizes the relational, hierarchical, and network models. A
database schema in this model is a directed graph, whose leaves
represent data and whose internal nodes represent connections among
the data. Instances are constructed from objects, which have separate
names and values. We define a logic for the model, and describe a
nonprocedural query language that is based on the logic. We also
describe an algebraic query language and show that it is equivalent to
the logical language." ,
bibdate    =    "Tue Nov 23 17:26:45 1993" ,
owner    =    "daisyc" ,
)

@inproceedings    ( KUSPERT87,
key    =    "Kuspert et al." ,
author    =    "Kuspert, K. and Dadam, P. and Gunauer, J." ,
title    =    "Cooperative Object Buffer Management in the
Advanced Information Management Prototype" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
year    =    "1987" ,
pages    =    "483--492" ,
abstract=    "In the CAD, CAM, and Robotics environment the
on-line construction and manipulation of data objects is very often
done at dedicated workstations rather than at host systems. As the
storage space of workstations is usually not that large and as large
designs are also not performed by a single designer but by a group of
designers, in general, one would like to use host database systems as
central servers to store, to retrieve, and to 'communicate' data
objects. Current database management systems, however, have mainly
been designed for business administration purposes where much simpler
structured data objects occur. But even if the server database system
offers adequate complex object support, the question remains how
workstations and server database system should work together. That is,
how the changes performed at the workstation should be communicated
backt to the server such that a new version of an object can be
created at the host site in an efficient and storage saving way. In
this paper the approach implemented in the Advanced Information
Management Prototype (AIM-P) at the IBM Heidelberg Scientific Center
is described. The AIM-P database management system is based on NF2
(Non First Normal Form) relations and follows the strategy of a
multi-level cooperation/communication between workstation and server
database system in order to reduce redundant work at both sides as
much as possible." ,
bibdate    =    "Fri Jan 19 11:04:47 1990" ,
owner    =    "robyn" ,
)

@article    ( LAFORTUNE86,
key    =    "Lafortune \& wong" ,
author    =    "Lafortune, Stephane and Wong, Eugene" ,
title    =    "A State Transition Model for Distributed Query
Processing" ,
journal    =    "ACM Transactions on Database Systems" ,
year    =    "1986" ,
volume    =    "11" ,
number    =    "3" ,
pages    =    "294--322" ,
month    =    "September" ,
)

@inproceedings    ( LAFUE82,
key    =    "Lafue" ,
author    =    "Lafue, Gilles M. E." ,
title    =    "Semantic Integrity Dependencies and Delayed
Integrity Checking" ,
booktitle=    "Proceedings of the Eighth International Conference
on Very Large Data Bases" ,
year    =    "1982" ,
pages    =    "292--299" ,
month    =    "September" ,
)

@article    ( LAHTI90,
key    =    "Lahti \& McCarrond" ,
author    =    "Lahti, Walter and McCarron, Dean" ,
title    =    "Store Data in a Flash" ,
journal    =    "Byte" ,
year    =    "1990" ,
volume    =    "" ,
number    =    "" ,
pages    =    "311--318" ,
month    =    "November" ,
)

@techreport    ( LAI86,
key    =    "Lai \& Yang" ,
author    =    "Lai, T.H. and Yang, T.H." ,
title    =    "On Distributed Snapshots" ,
number    =    "OSU-CISAC-86TR1THL" ,
institution=    "Computer and Information Science Research Center" ,
address    =    "Ohio State University, Columbus, OH" ,
year    =    "1986" ,
pages    =    "1--11" ,
keywords=    "distributed system; stable property; snapshot
algorithm; deadlock detection; termination detection" ,
abstract=    "This paper studies the notion of distributed
snapshots as proposed by Chandy and Lamport. We present conditions
that are necessary and sufficient for a distributed snapshot to be
meaningful. Such conditions are useful in checking if a snapshot
algorithm always generates meaningful distributed snapshots. We also
develop an efficient snapshot algorithm that requires 0 |P| control
messages, where P is the process set, and that does not require
messages to be received in the order they were sent. Finally, we show
that many stable properties-e.g., termination, deadlock- can be detect
with randomly-taken not-necessarily-meaningful distributed snapshots.
For such stable properties, our snapshot algorithm can be further
simplified." ,
bibdate    =    "Mon Feb 22 17:54:36 1988" ,
owner    =    "manning" ,
)

@inproceedings    ( LAM89,
key    =    "Lam et al." ,
author    =    "Lam, H. and Su, S. and Alashqur, A." ,
title    =    " Integrating the Concepts and Techniques of
Semantic Modeling and the Object Oriented Paradigm " ,
booktitle=    "Proceedings of the 15th International Computer
Software and Applications Conference " ,
pages    =    "209--217" ,
publisher=    "IEEE" ,
month    =    "sep" ,
year    =    1989 ,
annote    =    "Overview of OSAM and OSAM*, in depth description
of the OSAM model Motivation for OSAM*'s various constructs are
presented." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@techreport    ( LAMB88,
key    =    "Lamb" ,
author    =    "Lamb, D.A." ,
title    =    "Benign Side Effects" ,
type    =    "External" ,
number    =    "ISSN 0836-0227-88-219" ,
institution=    "Department of Computing and Information Science" ,
address    =    "Queen's University, Kingston, Ontario, Canada" ,
year    =    "1988" ,
month    =    "apr" ,
pages    =    "1--8" ,
abstract=    "Many people interested in programming language
design believe that functions should not have side effects. However,
some side effects, such as incrementing a count of the number of calls
on a function, are crucial for debugging and performance monitoring.
Discussions of how to allow such benign side effects has foundered
trying to find a suitable characterisation of ``benign''. One possible
solution is to associate more than one interface with a module, and to
say that a side effect is benign with respect to an interface if it is
invisible if clients of a module limit themselves to that interface.
We show how to use trace specifications to prove that a side effect is
benign in this sense." ,
owner    =    "payne" ,
bibdate    =    "Tue Jun 14 12:10:31 1988" ,
)

@article    ( LAMB91,
key    =    "Lamb et al." ,
author    =    "Lamb, Charles and Gordon Landis and Jack Orenstein
and Dan Weinreb" ,
title    =    "The Objectstore Database System" ,
journal    =    "cacm" ,
volume    =    "34" ,
number    =    "10" ,
month    =    "Oct" ,
year    =    "1991" ,
pages    =    "50 -- 63" ,
abstract=    "ObjectStore is an objected-oriented database
management system (OODBMS) that provides a tightly integrated language
intergace to the traditional DBMS features of persistent storage,
transaction management (concurrency control and recovery), distributed
data access, and associative queries. ObjectStore was designed to
provide a unified programmatic interface to both persistently
allocated data (i.e., data that lives beyond the execution of an
application program) and transiently allocated data (i.e., data that
does not survive beyond an application's execution), with
object-access speed for persistent data usually equal to that of an
in-memory dereference of a pointer to transient data." ,
bibdate    =    "Sun Nov  3 23:23:56 1991" ,
owner    =    "suchen" ,
)

@inproceedings    ( LANG86,
key    =    "Lang et al." ,
author    =    "Lang, S.D. and Driscoll, J.R. and Jou, J.H." ,
title    =    "Improving the Differential File Technique via
Batch Operations for Tree Structured File Organizations" ,
booktitle=    "Proceeding of the International Conference on Data
Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1986" ,
pages    =    "524--532" ,
abstract=    "This paper presents a combined algorithm to
perform batch insertion, deletion, and update for tree structured
files. The efficiency of the algorithm is analyzed for performing
updates only and insertions only. A cost analysis example is reviewed
to demonstrate that batch operations for tree structured files achieve
the advantages of a differential database representation and, at the
same time, avoid the drawbacks previously attributed to the use of
differential files." ,
bibdate    =    "Mon Aug 10 15:27:12 1987" ,
owner    =    "manning" ,
)

@article    ( LANGWORTHY86,
key    =    "Langworthy" ,
author    =    "Langworthy, George" ,
title    =    "Mass Storage" ,
journal    =    "Digital Review" ,
year    =    "1986" ,
volume    =    "3" ,
number    =    "9" ,
pages    =    "85--91" ,
month    =    "June" ,
)

@article    ( LARSEN92,
key    =    "Larsen et al." ,
author    =    "Larsen, K.S. and Schwartzbach, M.I. and Schmidt,
E.M." ,
title    =    "A new formalism for relational algebra" ,
journal    =    "Information Processing Letters" ,
publisher=    "Elsevier Science Publishers" ,
volume    =    "41" ,
number    =    "3" ,
month    =    "mar" ,
year    =    "1992" ,
pages    =    "163--168" ,
keywords=    "Databases; relational algebra; query languages" ,
bibdate    =    "Sat Oct 10 19:28:31 1992" ,
owner    =    "bassili" ,
)

@article    ( LARSON78,
key    =    "Larson" ,
author    =    "Larson, P." ,
title    =    "Dynamic Hashing" ,
journal    =    "BIT" ,
volume    =    "18" ,
year    =    "1978" ,
pages    =    "184--201" ,
bibdate    =    "Fri May 24 15:41:03 1985" ,
)

@inproceedings    ( LARSON80,
key    =    "Larson" ,
author    =    "Larson, P." ,
title    =    "Linear Hashing with Partial Expansions" ,
booktitle=    "vldb" ,
year    =    "1980" ,
pages    =    "224--232" ,
bibdate    =    "Thu May 23 21:12:35 1985" ,
)

@article    ( LARSON81,
key    =    "Larson" ,
author    =    "Larson, P." ,
title    =    "Analysis of Index-Sequential Files with Overflow
Chaining" ,
journal    =    "tods" ,
volume    =    "6" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1981" ,
pages    =    "671--680" ,
bibdate    =    "Sat Apr 27 22:46:26 1985" ,
)

@article    ( LARSON82,
key    =    "Larson" ,
author    =    "Larson, P." ,
title    =    "Performance Analysis of Linear Hashing with
Partial Expansions" ,
journal    =    "tods" ,
volume    =    "7" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1982" ,
pages    =    "566--587" ,
bibdate    =    "Fri Apr 26 23:16:51 1985" ,
)

@article    ( LARSON83,
key    =    "Larson" ,
author    =    "Larson, P." ,
title    =    "Analysis of Uniform Hashing" ,
journal    =    "jacm" ,
volume    =    "30" ,
number    =    "4" ,
month    =    "oct" ,
year    =    "1983" ,
pages    =    "805--819" ,
bibdate    =    "Sat Apr 27 22:58:25 1985" ,
)

@article    ( LARSON84B,
key    =    "Larson \& Kajla" ,
author    =    "Larson, P. and Kajla, A." ,
title    =    "File Organization: Implementation of a Method
Guaranteeing Retrieval in One Access" ,
journal    =    "cacm" ,
volume    =    "27" ,
number    =    "7" ,
month    =    "jul" ,
year    =    "1984" ,
pages    =    "670--677" ,
bibdate    =    "Sat Apr 27 00:21:26 1985" ,
)

@inproceedings    ( LARSON85,
key    =    "Larson \& Ramakrishna" ,
author    =    "Larson, P. and Ramakrishna, M.V." ,
title    =    "External Perfect Hashing" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "190--200" ,
bibdate    =    "Tue Jun 11 13:22:14 1985" ,
)

@inproceedings    ( LARSON85B,
key    =    "Larson \& Yang" ,
author    =    "Larson, P.-A. and Yang, H.Z." ,
title    =    "Computing Queries from Derived Relations" ,
booktitle=    "vldb" ,
address    =    "Stockholm, Sweden" ,
editor    =    "Pirotte, A. and Vassiliou, Y." ,
month    =    "aug" ,
year    =    "1985" ,
pages    =    "259--269" ,
abstract=    "Assume that a set of derived relations are
available in stored form. Given a query (or subquery), can it be
computed from the derived relations and, if so, how? Variants of this
problem arise in several areas of query processing. Relation fragments
stored at a site in a distributed database system, database snapshots,
and intermediate results obtained during the processing of a query are
all examples of stored, derived relations. In this paper we give
necessary and sufficient conditions for when a query is computable
from a single derived relation. It is assumed that both the query and
the derived relation are defined by PSJ-expressions, that is,
relational algebra expressions involving only projections, selections,
and joins, in any combination. The solution is constructive: not only
does it tell whether the query is computable or not, but it also shows
how to compute it." ,
bibdate    =    "Thu Nov 19 21:46:40 1987" ,
owner    =    "mckenzie" ,
)

@article    ( LARSON85C,
key    =    "Larson" ,
author    =    "Larson, P." ,
title    =    "Linear Hashing with Overflow-Handling by Linear
Probing" ,
journal    =    "tods" ,
volume    =    "10" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1985" ,
pages    =    "75--89" ,
bibdate    =    "Wed Jun 12 21:50:25 1985" ,
)

@article    ( LARSON86,
key    =    "Larson" ,
author    =    "Larson, J.A." ,
title    =    "A Visual Approach to Browsing in a Database
Environment" ,
journal    =    "Computer" ,
publisher=    "IEEE Computer Society" ,
volume    =    "19" ,
number    =    "6" ,
month    =    "jun" ,
year    =    "1986" ,
pages    =    "62--71" ,
abstract=    "A visual approach to browsing in a database
environment is one way for users to access database contents easily
and conveniently. People relate better to visual representations of
the logical database than to other representation. Users perform four
basic operations when browsing a database: structuring, choosing a
structure of the objects to be examined; filtering, selecting
instances of the objects to be examined; panning, examining
neighboring object instances; and zooming, determining the level of
detail for examining object instances. My approach consists of four
very flexible steps corresponding to each of the four basic
operations. Each step uses visual representations to present
information to the users. By manipulating these visual
representations, users can structure, filter, pan, and zoom. Users may
revise decisions and choices made during any of the four steps. Most
database management systems require users to formulate a complex
specification describing the data that they wish to access. In order
to do this, they must be familiar with the logical structure of the
database; they must know the names of the types of objects to be
accessed and how these objects are related. They must also be able to
specify which occurrences of the objects are to be accessed by
describing the criteria accessed occurrences must satisfy. This is
difficult for many users because of their unfamiliarity with the
syntax used to formulate request, or because they have only a vague
notion of what data they desire to access." ,
bibdate    =    "Thu Jul 24 12:18:12 1986" ,
owner    =    "manning" ,
)

@article    ( LARSON88,
key    =    "Larson" ,
author    =    "Larson, P.-A." ,
title    =    "Linear Hashing with Separators --- A Dynamic
Hashing Scheme Achieving One-Access Retrieval" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "13" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1988" ,
pages    =    "366--388" ,
keywords=    "dynamic hashing schemes; extendible hashing;
linear probing; one-access retrieval; open addressing" ,
abstract=    "A new dynamic hashing scheme is presented. Its
most outstanding feature is that any record can be retrieved in
exactly one disk access. This is achieved by using a small amount of
supplemental internal stroage that stores enough information to
uniquely determine the current location of any record. The amount of
internal storage required is small: typically one byte for each page
of the file. The necessary address computation, insertion, and
expansion algorithms are presented and the performance is studied by
means of simulation. The new method is the first practical method
offering one-access retrieval for large dynamic files." ,
bibdate    =    "Mon Oct 26 20:37:42 1992" ,
owner    =    "leoso" ,
)

@article    ( LARSON89,
key    =    "Larson et al." ,
author    =    "Larson, J.A. and Navathe, S.B. and Elmasri, R." ,
title    =    "A Theory of Attribute Equivalence in Databases
with Application to Schema Integration" ,
journal    =    "tose" ,
publisher=    "ieee" ,
volume    =    "15" ,
number    =    "4" ,
month    =    "apr" ,
year    =    "1989" ,
pages    =    "449--463" ,
keywords=    "attributes; database design; database integration;
data equivalence; schema integration" ,
abstract=    "Schema integration is necessary in designing a
logical database schema or a conceptual schema from multiple views.
Schema integration is also necessary to define a global schema that
describes all of the data in several existing databases participating
in a distributed database management system. This paper unifies our
previous work in schema integration. That work described how to
integrate groups of entity sets and groups of relationship sets from
different schemas specified using the entity-relationship data model.
We present a common foundation for integrating pairs of entity sets,
pairs of relationship sets, and an entity set with a relationship set.
This common foundation is based on the basic principle of integrating
attributes. Any pair of objects whose identifying attributes can be
integrated can themselves be integrated. Several definitions of
attribute equivalence are presented. These definitions can be used to
specify the exact nature of the relationship between a pair of
attributes. Based on these definitions, several strategies for
attribute integration are presented and evaluated." ,
bibdate    =    "Tue Apr 11 09:57:24 1989" ,
owner    =    "payne" ,
)

@proceedings    ( LBL81,
key    =    "LBL" ,
title    =    "Proceedings of the First International Workshop on
Statistical Database Management" ,
publisher=    " " ,
editor    =    "Wong, H.K." ,
year    =    "1981" ,
bibdate    =    "Fri Mar 14 13:47:44 1986" ,
owner    =    "rts" ,
)

@proceedings    ( LBL83,
key    =    "LBL" ,
title    =    "Proceedings of the Second International Workshop
on Statistical Database Management" ,
publisher=    " " ,
editor    =    "McCarthy, J." ,
year    =    "1983" ,
bibdate    =    "Fri Mar 14 13:48:29 1986" ,
owner    =    "rts" ,
)

@article    ( LEE87,
key    =    "Lee" ,
author    =    "Lee, Tony T." ,
title    =    "An Information-Theoretic Analysis of Relational
Databases-Part II: Information Structures of Database Schemas" ,
journal    =    "IEEE Transactions on Software Engineering" ,
year    =    "1987" ,
volume    =    "SE-13" ,
number    =    "10" ,
pages    =    "1062--1072" ,
month    =    "October" ,
)

@article    ( LEFF91,
key    =    "Leff \& Pu" ,
author    =    "Leff, A. \& Pu, C." ,
title    =    "A Classification of Transaction Processing Systems" ,
journal    =    "Computer" ,
publisher=    "ieee" ,
volume    =    "24" ,
number    =    "6" ,
month    =    "jun" ,
year    =    "1991" ,
pages    =    "63--76" ,
abstract=    "none given" ,
bibdate    =    "Sun Apr  7 17:11:20 1991" ,
owner    =    "curtis" ,
)

@book        ( LEFKOVITZ74,
key    =    "Lefkovitz" ,
author    =    "Lefkovitz, D." ,
title    =    "Data Management for On-Line Systems" ,
publisher=    "Hayden Book Co." ,
address    =    "NJ" ,
year    =    "1974" ,
bibdate    =    "Wed Jul 18 13:57:22 1984" ,
)

@phdthesis    ( LEHMAN84,
key    =    "Lehman" ,
author    =    "Lehman, P.L." ,
title    =    "Systolic Arrays for Rapid Processing of Simple
Database Transactions" ,
school    =    "Carnegie-Mellon University" ,
month    =    "may" ,
year    =    "1984" ,
abstract=    "This dissertation is an exploration of a method of
using the computational power available from Very Large Scale
Integration (VLSI) to solve an important database management problem.
In many of the largest commercial database systems, most types of
transactions have two characteristics in common: simplicity (for
example, cashing a check in a banking database requires very few
database operations) and high frequency of execution (a bank may need
to execute thousands of similar simple transactions per second.) A
systolic array design is proposed for rapid execution of simple
relational database transactions. The simple query array is intended
for use as a componenet of a high- performance relational database
machine. Transaction fragments from a batch of similar transactions
are executed simultaneously by passing a database relation through the
array. This scheme produces a substantial reduction in the amount of
input-output necessary to process the transactions. Several simple
query arrays are arranged as stages of a pipeline to allow concurrent
processing of several multi-relation transaction batches. Consistency
problems may arise from concurrent transaction execution. The problem
of finding the optimal consistent schedule for the simple query
pipeline is NP-complete. However, several fast heuristics produce
near-optimal schedules, and exhibit a tradeoff between work performed
(by the scheduler) and resulting schedule quality (throughput).
Variations on the basic architecture are also explored; these include
relations of different sizes, asynchronous stages, and buffered
stages. These enhancements produce a slight improvement over the
initial design. A basic architecture is proposed that employs the
simple query pipeline. A projection of the performance of this design
shows a large improvement over the best currently-available
conventional systems for this task. The scheme described uses
tremendous parallelism and reduced input-output requirements to
achieve high throughput for programmable simple database transactions,
while maintaining database consistency. From a database perspective,
this is the first use of special purpose hardware to tackle the
specific problems of many commercial databases. From a systolic
perspective, this is one of the first designs used for simultaneous
execution of a large number of small (but useful) tasks - instead of
one large, computation-intensive problem - resulting in are more
parallelism than is obtainable from a conventional multiprocessor." ,
bibdate    =    "Wed Oct 16 11:28:06 1985" ,
)

@inproceedings    ( LEHMAN86A,
key    =    "Lehman \& Carey" ,
author    =    "Lehman, T.J. and Carey, M.J." ,
title    =    "A Study of Index Structures for Main Memory
Database Management Systems" ,
booktitle=    "vldb" ,
address    =    "Kyoto, Japan" ,
editor    =    "Kambayashi, Y." ,
month    =    "aug" ,
year    =    "1986" ,
pages    =    "294--303" ,
abstract=    "One approach to achieving high performance in a
database management system is to store the database in main memory
rather than on disk. One can then design new data structures and
algorithms oriented towards making efficient use of CPU cycles and
memory space rather than minimizing disk accesses and using disk space
efficiently. In this paper we present some results on index structures
from an ongoing study of main memory database management systems. We
propose a new index structure, the T Tree, and we compare it to
existing index structures in a main memory database environment. Our
results indicate that the T Tree provides good overall performance in
main memory." ,
bibdate    =    "Fri Nov 20 11:25:41 1987" ,
owner    =    "mckenzie" ,
)

@article    ( LEHMAN92,
key    =    "Lehman et al." ,
author    =    "Lehman, T. J. and Shekita, E. J. and Cabrera, L." ,
title    =    "An Evaluation of Starburst's Memory Resident
Storage Component" ,
journal    =    "tdke" ,
publisher=    "ieee" ,
volume    =    "4" ,
number    =    "6" ,
month    =    "dec" ,
year    =    "1992" ,
pages    =    "555--566" ,
keywords=    "Main memory database; memory resident database;
performance; Starburst" ,
abstract=    "As part of the Starburst extensible database
project, we have designed and implemented a memory resident storage
component that can coexist along side traditional disk-oriented
storage components. The memory resident storage component shares the
code of Starburst's common services, such as query optimization, plan
generation, query evaluation, record manipulation, and transaction
management. In this paper, we describe the design of Starburst's
memory resident storage component, contrast it with the Starburst's
default disk-oriented storage component, and compare the performance
of the two storage components using the Wisconsin Benchmarks. Our
results show that a memory resident storage component can perform
significantly better tan a disk-oriented storage component, even when
the disk-oriented storage component has all of its data cached in
memory. The benchmark results show that, by using memory resident
techniques, overall query execution can be improved by up to a factor
of four." ,
bibdate    =    "Wed Jan 27 04:45:12 1993" ,
owner    =    "bassili" ,
)

@techreport    ( LEMOT91A,
key    =    "Lemot \& Salzberg" ,
author    =    "Lemot, David and Betty Salzberg" ,
title    =    "Concurrency and Recovery for Index Trees" ,
number    =    "NU-CCS-91-15" ,
institution=    "Computer of Computer Science, Northeastern
University" ,
year    =    "1991" ,
month    =    "Aug" ,
pages    =    "32" ,
keywords=    "Comcurrency, recovery, indexing, access methods,
B-trees" ,
abstract=    " Providing high concurrency in B+-trees has been
studied extensively. But few efforts ahve been documented for
combining concurrency methods with a recovery scheme that preserves
well-formed trees across system crashes. We describe an approach for
this that works for a class of index trees that is a generalization of
the B-link-tree. A major feature of our method is that it works with a
range of different recovery methods. It achieves this by decomposing
structure changes in an index tree into a sequence of atomic actions,
each one leaving the tree well-formed and each working on separate
level of the tree. All atomic actions on levels of the tree abouve the
leaf level are independent of database transactions, and so are of
short duration." ,
bibdate    =    "Wed Dec 11 09:53:28 1991" ,
owner    =    "suchen" ,
)

@article    ( LENAT89,
key    =    "Lenat" ,
author    =    "Lenat, Douglas B." ,
title    =    "Ontological Versus Knowledge Engineering" ,
journal    =    "IEEE Transactions on Knowledge and Data
Engineering" ,
year    =    "1989" ,
volume    =    "1" ,
number    =    "1" ,
pages    =    "84--88" ,
month    =    "March" ,
)

@inproceedings    ( LENZERINI85,
key    =    "Lenzerini" ,
author    =    "Lenzerini, M." ,
title    =    "{\it SERM\/} Semantic Entity Relationship Model" ,
booktitle=    "Proceedings 1985 International Conference on the
Entity Relationship Approach" ,
pages    =    "270--278" ,
publisher=    "IEEE Press" ,
address    =    "New York" ,
year    =    1985 ,
annote    =    "Basic work that eventually lead to things like EER" ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( LERNER90A,
key    =    "Lerner \& Habermann" ,
author    =    "Lerner, B.S. and Habermann, A.N." ,
title    =    "Beyond Schema Evolution to Database Reorganization" ,
booktitle=    "Proceedings of ECOOP/OOPSLA '90" ,
address    =    "Ottawa, Canada" ,
year    =    "1990" ,
bibdate    =    "Fri Aug 24 17:28:37 1990" ,
owner    =    "rts" ,
)

@inproceedings    ( LEU86,
key    =    "Leu \& Bhargava" ,
author    =    "Leu, P.-J. and Bhargava, B." ,
title    =    "Multidimensional Timestamp Protocols for
Concurrency Control" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1986" ,
pages    =    "482--489" ,
keywords=    "Classes; concurrency control algorithms; fully
dimensional timestamp ordering; multidimensional timestamp ordering;
serializability; time stamps; transactions" ,
abstract=    "We propose multidimensional timestamp protocols
where each transaction has a timestamp vector of multiple elements.
The timestamp vectors need not be distinct but do define a partial
order. The serializability order among the transactions is determined
by any topological sort of their timestamp vectors. The timestamp in
our protocols is constructed dynamically, not just based on the
starting/finishing time as in conservative and optimistic timestamp
methods, and thus the concurrency control can be enforced based on
more precise dependency information derived from the operations of the
transactions. Several classes of logs have been identified based on
the degree of concurrency which represents the number of logs accepted
by a concurrency controller. The class for our protocols is different
from any previously known classes such as two phase locking (2PL),
D-serializable (DSR), strictly serializable (SSR), timestamp ordering
(TO), which have beeen defined in [5,9,12,13]. If the dimension of the
timestamp vector is one, then our protocols recognize the class
timestamp ordering (TO). We will briefly discuss the implementaion of
the concurrency control algorithm for the new class." ,
bibdate    =    "Mon Aug 10 15:23:39 1987" ,
owner    =    "manning" ,
)

@article    ( LIEBEHERR93,
key    =    "Liebeherr et al." ,
author    =    "Liebeherr, J. and Omiecinski, E. and Akyildiz, I.
F." ,
title    =    "The Effect of Index Partitioning Schemes on The
Performance of Distributed Query Processing" ,
journal    =    "tdke" ,
publisher=    "ieee" ,
year    =    "1993" ,
keywords=    "Distributed Databases System; Query Processing;
Indexing Scheme; Partioned Global Index; Partial Index; Conjunctive
Queries; Simulation; Performance Evaluation" ,
abstract=    "The benefit of using indexes for processing
conjunctive queries in a database system is well known. The use of
indexes in distributed database systems is equally justified. In a
distributed database environment a relation may be horizontally
partitioned across the nodes of the system and indexes may be created
for the fragment of the relation that resides at each node. However,
as an alternative, one might construct each index on the entire
relation, i.e., global indexes, and then partition each index between
the nodes. An approach is presented for processing such an index
partitioning scheme in response to a conjunctive range query. The
performance of these schemes is evaluated in terms of the response
time of a query and the utilization of the processors, disk, and
communication network while varying the number of nodes and query mix." ,
bibdate    =    "Fri Jan 29 13:33:21 1993" ,
owner    =    "bassili" ,
)

@article    ( LIEN80,
key    =    "Lien" ,
author    =    "Lien, Y. A." ,
title    =    "On the semantics of the entity-relationship model" ,
journal    =    "Entity-Relationship Approach to Systems Analysis
and Design" ,
year    =    "1980" ,
bibdate    =    "Tue Nov  7 10:39:28 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( LIEUWEN92,
key    =    "Lieuwen \& DeWitt" ,
author    =    "Lieuwen, D. F. and DeWitt, D. J." ,
title    =    "A Transformation-Based Approach to Optimizing
Loops in Database Programming Languages" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "San Diego, California" ,
editor    =    "Stonebraker, M." ,
volume    =    "21" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "91--100" ,
abstract=    "Database programming languages like O2, E, and O++
include the ability to iterate through a set. Nested iterations can be
used to express joins. This paper describes compile-time optimizations
similar to relational transformations like join reordering for such
programming constructs. This paper also shows how to use a standard
transformation-based optimizer to optimize these joins. An optimizer
built using the EXODUS Optimizer Generator [GRAE87] was added to the
Bell Labs O++ [AGRA89] compiler. We used the resulting optimizing
compiler to experimentally validate the ideas in this paper. The
experiments show that this technique can significantly improve the
performance of database programming languages." ,
bibdate    =    "Mon Jan 25 13:34:56 1993" ,
owner    =    "bassili" ,
)

@article    ( LILIEN84,
key    =    "Lilien \& Bhargava" ,
author    =    "Lilien, L. and Bhargava, B." ,
title    =    "A Scheme for Batch Verification of Integrity
Assertions in a Database System" ,
journal    =    "tse" ,
volume    =    "SE-10" ,
number    =    "6" ,
month    =    "nov" ,
year    =    "1984" ,
pages    =    "664--680" ,
keywords=    "Approximation algorithms; database crash and
recovery; database systems; design for error control; directed
traveling salesman problem; NP-completeness; semantic database
integrity; software reliability" ,
abstract=    "A database management system can ensure the
semantic integrity of a database via an integrity control subsystem. A
technique for implementation of such a subsystem is proposed. After a
database is updated by transactions, its integrity must be verified by
evaluation of a set of semantic integrity assertions. For evaluation
of an integrity assertion a number of database pages need to be
transferred from the secondary storage to the fast memory. Since
certain pages may be required for evaluation of different integrity
assertions, the order of the evaluation of the integrity assertions
determines the total number of pages fetched from the secondary
storage. Hence, the schedule for the evaluation determines the cost of
the database verification process. We show that the search for an
optimal schedule is an NP-hard problem. Four approximation algorithms
that find suboptimal schedules are proposed. They are based on the
utilization of intersections among sets of pages required for the
evaluation of different integrity assertions. The theoretical worst
case behaviors of these algorithms are studied. Finally, the
algorithms are compared via a simulation study to a naive, random
order verification approach. The methods proposed for minimizing the
costs of the batch integrity verification also apply to other problems
that can be abstracted to the directed traveling salesman optimization
problem. For example, the methods are applicable to multiple-query
optimization and to concurrency control via the predicate locks." ,
bibdate    =    "Mon Feb 11 09:01:36 1985" ,
)

@inproceedings    ( LIN83B,
key    =    "Lin \& Nolte" ,
author    =    "Lin, W.-T. K. and Nolte, J." ,
title    =    "Basic Timestamping, Multiple Version Timestamp,
and Two-Phase Locking" ,
booktitle=    "Ninth Conference on Very Large Databases" ,
organization=    "IEEE" ,
address    =    "Florence, Italy" ,
year    =    "1983" ,
pages    =    "109--119" ,
abstract=    "Using simulation, we compare the performance of
the Basic Timestamp, the Multiple Version Timestamp, and the Two-Phase
Locking concurrency control algorithms. We find that in every system
configuration we have simulated the Multiple Version Timestamp
algorithm performs only marginally better than the Basic Timestamp
algorithm. In addition, we find that when the average transacttion
size is small, both timestamp algorithms outperform the Two-Phase
Locking algorithm. But when the average transaction size is large, the
Two-Phase Locking algorithm outperforms both timestamp algorithms." ,
bibdate    =    "Thu Oct 22 15:59:29 1987" ,
owner    =    "manning" ,
)

@techreport    ( LIN88,
key    =    "Lin et al." ,
author    =    "Lin, Chih-Chen and Mark, Leo and Sellis, Timos and
Faloutsos, Christos" ,
title    =    "Performance Issues in the Binary Relationship
Model" ,
institution=    "Institute for Advanced Computer Studies and
Department of Computer Science, University of Maryland" ,
year    =    "1988" ,
type    =    "Technical report," ,
number    =    "UMIACS-TR-88-21" ,
address    =    "College Park, MD 20742" ,
month    =    "March" ,
)

@techreport    ( LIN90,
key    =    "Lin et al." ,
author    =    "Lin, E. T. and Omiecinski, E. and Yalamanchili, S." ,
title    =    "Large Join Optimization on a Hypercube
Multiprocessor" ,
institution=    "College of Computing, Georgia Institute of
Technology" ,
year    =    "1990" ,
month    =    "oct" ,
pages    =    "34" ,
abstract=    "Optimizing large join queries that consist of many
joins has been recognized as NP-hard. Most of the previous work
focuses on a uni-processor environment. In a multiprocessor, the
location of each join adds another dimension to the complexity of the
problem. In this paper, we examine the feasibility of exploiting the
inherent parallelism in optimizing large join queries, on a hypercube
multiprocessor. This includes not only using the multiprocessor to
answer the large join query, but also to optimize it. We propose an
algorithm to estimate the cost of a parallel large join plan. Three
heuristics are provided for generating an initial solution, which is
further optimized by an iterative local-improvement method. The entire
process of parallel query optimization and execution is simulated on
an Intel iPSC/2 hypercube machine. Our experimental results show that
the performance of each heuristic depends on the characteristics of
the query. We find the results obtained from our experiments to be
very encouraging. We conclude that the use of parallelism in query
optimization is definitely viable. This work is believed to provide a
framework for parallel query optimization and the results can be
applied to a more general context." ,
bibdate    =    "Tue Aug 11 14:00:46 1992" ,
owner    =    "soo" ,
)

@inproceedings    ( LINDGREEN82A,
key    =    "Lindgreen" ,
author    =    "Lindgreen, P." ,
title    =    "The Information Graph" ,
booktitle=    "Proceedings of the First Scandinavian Research
Seminar on Information Modelling and Database Management" ,
organization=    "University of Tampere" ,
month    =    "jan" ,
year    =    "1982" ,
pages    =    "103--127" ,
bibdate    =    "Fri Jun  7 12:12:40 1991" ,
owner    =    "rts" ,
)

@article    ( LINDGREEN83,
key    =    "Lindgreen" ,
author    =    "Lindgreen, P." ,
title    =    "Entity Sets and Their Description" ,
journal    =    "Entity-Relationship Approach to Software
Engineering" ,
year    =    "1983" ,
pages    =    "91--110" ,
abstract=    "In order to be meaningful, a proposal of a new
application system must include a description of its interaction with
the surrounding user system - a so-called functional systems
specification. The interaction involves transactions to and results
from the proposed system conveying information about specified sets of
entities in the user system. The paper presents the notation and the
conceptual foundation for a part of a declarative systems
specification language for defining and describing entity sets as a
part of the functional systems specification. In order to aid humans
better to understand the formalism, the design of the language has
been inspired by the natural language in two ways: the syntax has been
chosen to resemble the language structures known as relative clauses,
the concepts of the underlying information modeling scheme are
directly reflected in the main grammatical elements of the natural
language. The approach is still in tis experimental stage, but so far
it appears to be viable and useful - not only because of the
naturalness in real world descriptions, but also because it seems that
the awkward use of free variables known from predicate calculus type
declarative languages can be completely avoided." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( LINDSAY84,
key    =    "Lindsay et al." ,
author    =    "Lindsay, B.G. and Haas, L.M. and Mohan, C. and
Wilms, P.F. and Yost, R.A." ,
title    =    "Computation and Communication in R*: A Distributed
Database Manager" ,
journal    =    "tocs" ,
publisher=    "acm" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "feb" ,
year    =    "1984" ,
pages    =    "24--38" ,
keywords=    "Distributed computation; site autonomy;
distributed recovery protocols" ,
abstract=    "This paper presents and discusses the computation
and communication model used by R*, a prototype distributed database
management system. An R* computation consists of a tree of processes
connected by virtual circuit communication paths. The process
management and communication protocols used by R* enable the system to
provide reliable, distributed transactions while maintaining adequate
levels of performance. Of particular interest is the use of processes
in R* to retain user context from one transaction to another, in order
to improve the system performance and recovery characteristics." ,
bibdate    =    "Thu Jan 15 14:54:15 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( LINDSAY86A,
key    =    "Lindsay et al." ,
author    =    "Lindsay, B. and Haas, L. and Mohan, C. and
Pirahesh, H. and Wilms, P." ,
title    =    "A Snapshot Differential Refresh Algorithm" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
address    =    "Washington, DC" ,
editor    =    "Zaniolo, C." ,
month    =    "may" ,
year    =    "1986" ,
pages    =    "53--60" ,
abstract=    "This article presents an algorithm to refresh the
contents of database snapshots. A database snapshot is a read-only
table whose contents are extracted from other tables in the database.
The snapshot contents can be periodically refreshed to reflect the
current state of the database. Snapshots are useful in many
applications as a cost effective substitute for replicated data in a
distributed database system. When the snapshot contents are a simple
restriction and projection of a single base table, differential
refresh techniques can reduce the message and update costs of the
snapshot refresh operation. The algorithm presented annotates the base
table to detect the changes which must be applied to the snapshot
table during snapshot refresh. The cost of maintaining the base table
annotations is minimal and the amount of data transmitted during
snapshot refresh is close to optimal in most circumstances." ,
bibdate    =    "Mon Oct 19 12:41:57 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( LINDSAY87,
key    =    "Lindsay et al." ,
author    =    "Lindsay, B. and McPherson, J. and Pirahesh, H." ,
title    =    "A Data Management Extension Architecture" ,
booktitle=    "Proceedings of the SIGMod 1987 Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, Ca" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "220--226" ,
abstract=    "A database management system architecture is
described that facilitates the implementation of data management
extensions for relational database systems. The architecture defines
two classes of data management extensions: alternative ways of storing
relations called relation ``storage methods''; and access paths,
integrity constraints, or triggers which are ``attachments'' to
relations. Generic sets of operations are defined for storage methods
and attachments, and these operations must be provided in order to add
a new storage method or attachment type to the system. The data
management extension architecture also provides common services for
coordination of a storage method and attachment execution. This
article describes the data management extension architecture along
with some implementation issues and techniques." ,
bibdate    =    "Thu Sep  3 11:22:40 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( LINDSAY87A,
key    =    "Lindsay" ,
author    =    "Lindsay, B.G." ,
title    =    "A Retrospective of R*: A Distributed Database
Management System" ,
booktitle=    "Proceedings of the IEEE, Special Issue on
Distributed Databases" ,
organization=    "ieee" ,
publisher=    "ieee" ,
volume    =    "75" ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "668--673" ,
abstract=    "This paper discusses the experience gained during
the implementation of a prototype distributed database management
system. The R* prototype supports transparent distribution of a
relational database which is accessed using the SQL language for data
definition and manipulation. While supporting autonomy among the
participating sites, R* also emphasizes good performance for the R*
prototype, we were guided by a few key objectives and encountered
several interesting problems. This paper will discuss the guiding
objectives of the R* effort, as well as several areas of the
implementation which presented special difficulties or were simplified
by design decisions." ,
bibdate    =    "Fri Mar  4 12:37:07 1988" ,
owner    =    "manning" ,
)

@techreport    ( LING92,
key    =    "Ling \& Lee" ,
author    =    "Ling, T. and Lee, M." ,
title    =    "View Update in Entity-Relationship Based Database
Management Systems" ,
number    =    "DISCS-TRD/92" ,
institution=    "Department of Information Systems and Computer
Science, National University of Singapore" ,
year    =    1992 ,
annote    =    "Mostly Concerned with the merging of multiple ER
views of a single schema. Some interesting equivalences noted." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( LING92A,
key    =    "Ling \& Sun" ,
author    =    "Ling, Y. and Sun, W." ,
title    =    "A Supplement to Sampling-Based Methods for Query
Size Estimation in a Database System" ,
journal    =    "sigmod" ,
publisher=    "Acm Press" ,
volume    =    "21" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1992" ,
pages    =    "12--15" ,
abstract=    "Sampling-based methods for estimating relation
sizes after relational operators such as selections, joins and
projections have been intensively studied in recent years. Methods of
this type can achieve high estimation accuracy and efficiency. Since
the dominating overhead involved in a sampling-based method is the
sampling cost, different variants of sampling methods are proposed so
as to minimize the sampling percentage (thus reducing the sampling
cost) while maintaining the estimation accuracy in terms of the
confidence level and relative error (to be precisely defined later in
section 2). In order to determine the minimal sampling percentage, the
overall characteristics of the data such as the mean and variance are
needed. Currently, the representative sampling-based methods in
literature are based on the assumption that overall characteristics of
data are unavailable, and thus a significant amount of effort is
dedicated to estimating these characteristics so as to approach the
optimal (minimal) sampling percentage. The estimation for these
characteristics incurs cost as well as suffers the estimation error.
In this short essay, we point out that the exact values of these
characteristics of data can be kept track of in a database system at a
negligible overhead. As a result, the minimal sampling percentage
while ensuring the specified relative error and confidence level can
be precisely determined." ,
bibdate    =    "Wed Jan 27 04:37:52 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( LING95,
key    =    "Ling \& Sun" ,
author    =    "Ling, Y. and Sun, W." ,
title    =    "An Evaluation of Sampling-Based Size Estimation
Methods for Selections in Database Systems" ,
booktitle=    "International Conference on Database Engineering" ,
organization=    "ieee" ,
year    =    "1995" ,
pages    =    "532--539" ,
bibdate    =    "Wed Nov 22 12:48:36 1995" ,
abstract=    "The results of a performance study of the
representative sampling-based size estimation methods in database
management systems are reported in this paper. Major performance
measurement includes estimation accuracy, the amount of sample taken,
and the coverage. The impact of skewed data on the performance is also
discussed. These results allows a better understanding and assessment
of sampling estimation methods and determine the suitability of
different methods under different situations." ,
owner    =    "jeff" ,
)

@inproceedings    ( LINGAT87A,
key    =    "Lingat et al." ,
author    =    "Lingat, J. Y. and Nobecourt, P. and Rolland, C." ,
title    =    "Behaviour Management in Database Applications" ,
booktitle=    "vldb" ,
year    =    "1987" ,
pages    =    "185--196" ,
abstract=    "Behavioural aspects of Information Systems are now
taken into account in a lot of Conceptual Models. However, the
behavioural concepts of these Models have rarely implemented in DBMS.
RUBIS is an extended Relational DBMS which supports an extended
relational schema (including event and operation concepts) and
automatic control of the dynamic aspects, i.e. event recognition,
operation triggering and time handling. After a short presentation of
the basic concepts and the specification language used for the
extended Schema, we focus on two internal mechanisms: - the Temporal
Processor, which manages the temporal aspects of the of specification
and recognizes temporal events, - the Event Processor, which manages
events treatment and synchronization. These two mechanisms permit an
automatic execution of the extended schema and so provide rapid
prototyping capabilities." ,
bibdate    =    "Thu Apr 22 11:52:03 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( LINNEMANN87,
key    =    "Linnemann" ,
author    =    "Linnemann, V." ,
title    =    "Non First Normal Form Relations and Recursive
Queries: An SQL-Based Approach" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1987" ,
pages    =    "591--598" ,
abstract=    "The work presented in this paper is an attempt to
combine two different but closely related research areas in the data
base field, namely the quite heavily investigated question of
recursive queries in relational data bases on the one hand and the
introduction of non first normal form relations on the other. This
paper proposes the integration of recursive queries and non first
normal form relations by providing a recursion mechanism which can be
nested according to the structure of a non first normal form relation.
It is shown by examples that this method can be used to formulate
queries which are rather cumbersome if only flat relations are used.
Especially, in some cases the problem of performing a selection on a
recursively defined relation disappears. This question has been the
topic of several research papers recently. Moreover, many queries can
be formulated in a more natural way than in the world of flat tuples.
Therefore, nested recursive queries in combination with non first
normal form relations provide a contribution to the problem of
modelling complex data." ,
bibdate    =    "Thu Apr 28 16:11:56 1988" ,
owner    =    "" ,
)

@article    ( LION90,
key    =    "Lion" ,
author    =    "Lion, Karina" ,
title    =    "DAT's a Solution" ,
journal    =    "Byte" ,
year    =    "1990" ,
volume    =    "" ,
number    =    "" ,
pages    =    "323--328" ,
month    =    "November" ,
)

@inproceedings    ( LIPECK88,
key    =    "Lipeck \& Feng" ,
author    =    "Lipeck, U. and Feng, D." ,
title    =    "Construction of Deterministic Transition Graphs
from Dynamic Integrity Constraints" ,
booktitle=    "Proceedings of the 14th International Workshop on
Graph-Theoretic Concepts in Computer Science" ,
month    =    "jun" ,
year    =    "1988" ,
pages    =    "1--16" ,
abstract=    "Here systems, in particular database systems, are
considered whose dynamic behaviour is characterized by state sequences
that evolve stepwise, and whose integrity constraints are specified by
means of temporal logic. Monitoring temporal formulae in state
sequences can be reduced to following paths in transition graphs by
only checking nontemporal edge labels in each state. This paper
presents an algorithm how to construct deterministic transition graphs
from temporal formulae in a bottom-up way corresponding to the
formulae structure. These graphs ensure at least provisional
admissibility of system behaviour up to a present state and at most
potential admissibility of future behaviour. Moreover deterministic
graphs have considerable advantages over general transition graphs." ,
bibdate    =    "Mon Oct 23 14:24:42 1989" ,
owner    =    "robyn" ,
)

@article    ( LITTLE91,
key    =    "Little et al." ,
author    =    "Little, T. D. C. and A. Ghafoor and C.Y.R. Chen
and C.S. Chang and P.B. Berra" ,
title    =    "Multimedia Synchronization" ,
journal    =    "Data Engineering" ,
publisher=    "IEEE" ,
volume    =    "14" ,
number    =    "3" ,
month    =    "Sept" ,
year    =    "1991" ,
pages    =    "26--35" ,
abstract=    (Multimedia synchronization has been recognized by
many researchers as a significant requirement for applications using
time-dependent media. The orchestration of static data elements such
as images and text, and the "lip-sync" of audio and video are examples
of such synchronization. In this paper, many aspects of multimedia
sunchronization are reviewed at the physical, service, and human
interface levels of integration. Applicable areas include temporal
modeling with intervals and abstractions, conceptual and physical
models for databases, and systems support for synchronization
including real-time scheduling and communications protocols.) ,
bibdate    =    "Wed Dec 11 11:25:29 1991" ,
owner    =    "suchen" ,
)

@inproceedings    ( LITWIN78,
key    =    "Litwin" ,
author    =    "Litwin, W." ,
title    =    "Virtual Hashing: A Dynamically Changing Hashing" ,
booktitle=    "vldb" ,
year    =    "1978" ,
pages    =    "517--523" ,
bibdate    =    "Thu May 23 21:09:01 1985" ,
)

@inproceedings    ( LITWIN80,
key    =    "Litwin" ,
author    =    "Litwin, W." ,
title    =    "Linear Hashing: A New Tool For File And Table
Addressing" ,
booktitle=    "vldb" ,
year    =    "1980" ,
pages    =    "212--223" ,
bibdate    =    "Thu May 23 21:10:59 1985" ,
)

@inproceedings    ( LITWIN81,
key    =    "Litwin" ,
author    =    "Litwin, W." ,
title    =    "Trie Hashing" ,
booktitle=    "sigmod" ,
volume    =    "11" ,
year    =    "1981" ,
pages    =    "19--29" ,
bibdate    =    "Fri Apr 26 23:57:57 1985" ,
)

@inproceedings    ( LITWIN86,
key    =    "Litwin \& Lomet" ,
author    =    "Litwin, W. and Lomet, D.B." ,
title    =    "The Bounded Disorder Access Method" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering," ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
volume    =    "IEEE Computer Society Order Number 655" ,
month    =    "feb" ,
year    =    "1986" ,
pages    =    "38--47" ,
abstract=    "A new key associative access method, called the
bounded disorder method, is described. The method uses a combination
of hashing and tree indexing. The method has very good random access
performance, being comparable to the best hashing methods if its small
index is stored entirely in main memory. The method's advantage
compared with hashing is that range searches are possible while
searching only a portion of the file proportional to the size of the
range. It is possible to control index size by controlling node size.
Node size can be increased without increasing the amount of data
transferred during a random probe. Further, increasing node size has
only a minor effect on key sequential access performance. Even quite
large nodes, so long as they can be read into memory in their
entirety, have good key sequential performance. The bounded disorder
method is the only one of the methods employing large nodes that can
cope well with arbitrary key distributions. These properties make the
bounded disorder method a good choice as the only access method of a
database system." ,
bibdate    =    "Wed Jul 16 15:12:56 1986" ,
owner    =    "manning" ,
)

@article    ( LITWIN88,
key    =    "Litwin \& Tirri" ,
author    =    "Litwin, W. and Tirri, H." ,
title    =    "Flexible Concurrency Control using Value Dates" ,
journal    =    "IEEE Distributed Processing Technical Committee
Newsletter, Special Issue on Heterogeneous Distributed Databases" ,
publisher=    "ieee" ,
volume    =    "10" ,
number    =    "2" ,
month    =    "nov" ,
year    =    "1988" ,
pages    =    "42--49" ,
abstract=    "A new paradigm for the concurrency control is
proposed based on the concept of a value date. A data entity value is
officially valid after its value date, and uncertain otherwise. We
show that among the family of value date based concurrency control
policies there exists an application independent method, VDAS, which
guarantees that transaction executions are serializable as well as
deadlock and livelock free, independently of the transaction
semantics. Then, we show that without changing the value date paradigm
scheduler design may take into account the specific properties of a
particular class of applications thus enhancing the efficiency of the
concurrent processing within this class. After studying the
relationship between value date method and classical methods, we show
that locking, timestamp based methods and the time warp mechanism can
all be derived from this same concept. Value dates exhibit also an
interesting relationship to the concept of commitment as they provide
an implicit commit operation without any special negotiation
protocols. All these properties and the simplicity of the
implementation make the paradigm very attractive." ,
bibdate    =    "Mon May  8 12:20:47 1989" ,
owner    =    "payne" ,
)

@techreport    ( LITWIN89A,
key    =    "Litwin et al." ,
author    =    "Litwin, W. and Mark, L. and Roussopoulos, N." ,
title    =    "Interoperability of Multiple Autonomous Databases" ,
number    =    "SRC-TR-89-12, UMIACS-TR-89-10, CS-TR-2188" ,
institution=    "INRIA; Systems Research Center, Department of
Computer Science" ,
address    =    "78150 Le Chesnay France; University of Maryland,
College Park, MD 20742" ,
year    =    "1989" ,
pages    =    "1--46" ,
abstract=    "Database systems were a solution to the problem of
shared access to heterogeneous files created by multiple autonomous
applications. To make the data usage easier, one proposed to replace
the autonomous files by a globally integrated collection of data
called a database. The idea was successful to a large extent and there
are now many databases distributed over local and longhaul networks
and frequently even on the same larger computer. Unavoidably, users
now need shared access to multiple autonomous databases. The question
arose as to what the corresponding principles should be. Should one
reapply the database approach principles one level up or should new
methodologies be introduced? We show that new methodologies have
appeared, defined specifically for the management of multiple
autonomous databases. They lead to a new type of systems, called
multidatabase systems or federated systems. These systems make
databases interoperable, i.e. manipulable together in a non-procedural
way, without global integration. They also preserve the autonomy of
each database to satisfy first its own needs. Systems of that type
will be of basic importance, especially for distributed databases and
we analyze the corresponding reasons. We also present the
methodologies proposed for their design and discuss their
relationship. We further show that the evolution towards multidatabase
systems is already on the way, as major commercial relational database
systems are becoming of this type. We also show industrial prototypes
and the standardization issues. Finally, we present some research
issue." ,
bibdate    =    "Mon May  8 15:20:52 1989" ,
owner    =    "payne" ,
)

@techreport    ( LITWIN89B,
key    =    "Litwin et al." ,
author    =    "Litwin, W. and Roussopoulos, N. and Levy, G. and
Wang, H." ,
title    =    "Trie Hashing with Controlled Load" ,
number    =    "UMIACS-TR-89-11, CS-TR-2189, SRC-TR-89-13" ,
institution=    "INRIA; Institute for Advanced Computer Studies and
Systems Research Center, Department of Computer Science" ,
address    =    "78150 Le Chesnay France; University of Maryland,
College Park, MD 20742" ,
year    =    "1989" ,
month    =    "feb" ,
pages    =    "1--29" ,
abstract=    "Trie hashing is an access methods to primary key
ordered dynamic files. The key address is computed through a trie. Key
search needs usually one disk access since the trie may be in core and
need two accesses for very large files, when the trie h as to be on
the disk. We present a new variant of the method that allows to set up
an arbitrary load factor for ordered insertions. In particular, one
may create compact files, loaded up to 100\%. We show that the
capabilities of trie hashing make the method preferable to a B-tree by
most of criteria that motivated the latter method supremacy over the
database world." ,
bibdate    =    "Mon May  8 15:25:45 1989" ,
owner    =    "payne" ,
)

@article    ( LITWIN91,
key    =    "Litwin et al." ,
author    =    "Litwin, W. and Ketabchi, M. and Krishnamurthy, R." ,
title    =    "First Order Normal Form for Relational Databases
and Multidatabases" ,
journal    =    "sigmod" ,
volume    =    "20" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1991" ,
pages    =    "74--76" ,
abstract=    "none given" ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( LIU90,
key    =    "Liu \& Sunderraman" ,
author    =    "Liu, K and Sunderraman, R." ,
title    =    "Indefinite and Maybe Information in Relational
Databases" ,
journal    =    "tods" ,
volume    =    "15" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1990" ,
pages    =    "1--39" ,
keywords=    "first-order logic; incomplete information;
indefinite databases; indefinite/disjunctive information; maybe
information; query; relational algebra; relational database" ,
abstract=    "This paper extends the relational model to
represent indefinite and maybe kinds of incomplete information. A data
structure, called I-table, which is capable of representing indefinite
and maybe facts is introduced. The information content of I-tables is
precisely defined, and an operator to remove redundant facts is
presented. The relational algebra is then extended in a semantically
correct way to operate on I-tables. Queries are posed in the same way
as in conventional relational algebra; however, the user may now
expect indefinite as well as maybe answers." ,
bibdate    =    "Tue Apr 10 13:33:56 1990" ,
owner    =    "robyn" ,
)

@article    ( LIU91,
key    =    "Liu \& Sunderraman" ,
author    =    "Liu, Ken-Chih and Rajshekhar Sunderraman" ,
title    =    "A Generalized Relational Model for Indefinite and
Maybe Information" ,
journal    =    "tkde" ,
volume    =    "3" ,
number    =    "1" ,
month    =    "Mar" ,
year    =    "1991" ,
pages    =    "65--77" ,
keywords=    "Database, incomplete information, indefinite
database, maybe information, query, relational algebra, relational
model." ,
abstract=    "This paper generalizes the relational model to
represent indefinite and maybe kinds of incomplete information. A data
structure, called M-table, is introduced which is capable of
representing disjunctive/indefinite and maybe facts. The notion of
redundancy in the contex of indefinite and maybe information is
studied. The information content of an M-table is precisely defined.
The relatiional algebra is then generalized in a semantically correct
manner to operate on M-tables. Two additional operators, R-projection
and merge, are introduced. Queries are posed in the same manner as in
the conventional relational algebra, however the user may now expect
indefinite as well as maybe answers." ,
bibdate    =    "Tue Aug  6 16:42:13 1991" ,
owner    =    "suchen" ,
)

@techreport    ( LOCHOVSKY74,
key    =    "Lochovsky \& Tsichritzis" ,
author    =    "Lochovsky, F. and Tsichritzis, D." ,
title    =    "An Educational Data Base management System" ,
number    =    "CSRG-33" ,
institution=    "Computer Systems Research Group, University of
Toronto" ,
year    =    "1974" ,
month    =    "may" ,
abstract=    "The rapid growth of data base management systems
in recent years has resulted in a shortage of personnel trained in
data base concepts. What is needed at the present time is a flexible,
inexpensive, and accessible tool for teaching data base concepts. This
paper proposes such a tool (Educational Data Base System) consisting
of a data base management system embedded in the host language APL.
The system supports two logical data organizations - hierarchical and
relational - imposed on the same storage structure. Software tables
map the logical data structure unto the physical storage structure and
provide the ability to access and manipulate the same logical data
base using either hierarchic or relational data base commands. " ,
bibdate    =    "Fri Apr 12 09:02:39 1985" ,
)

@inproceedings    ( LOHMAN86,
key    =    "Lohman " ,
author    =    "G. M. Lohman" ,
title    =    "Do semantically equivalent SQL queries perform
differently?" ,
booktitle=    "International Conference on Data Engineering" ,
organization=    "IEEE computer sockety" ,
address    =    "LA, CA USA" ,
month    =    "5 -7 Feb" ,
year    =    "1986" ,
pages    =    "p225--226" ,
bibdate    =    "Mon Mar 25 09:53:54 1991" ,
owner    =    "suchen" ,
)

@techreport    ( LOHMAN90,
key    =    "Lohman \& Ono" ,
author    =    "Lohman, G.; Ono, K." ,
title    =    "Measuring the Complexity of Join Enumeration in
Query Optimization" ,
institution=    "IBM" ,
address    =    "San Jose, California" ,
year    =    "1990" ,
month    =    "oct" ,
pages    =    "1--12" ,
abstract=    "Since relational database management systems
typically support only diadic join operators as primitive operations,
a query optimizer must choose the 'best' sequence of two-way joins to
achieve the N-way join tables requested by a query. The computational
complexity of this optimization process is dominated by the number of
such possible sequences that must be evaluated by the optimizer. This
paper describes and measures the performance of the Starburst join
enumerator, which can parameterically adjust for each query the space
of join sequences that are evaluated by the optimizer to allow or
disallow (1) composite tables (i.e., tables that are themselves the
result of a join) as the inner operand of a join and (2) joins between
two tables having no join predicate linking them (i.e., Cartesian
products). To limit the size of their optimizer's search space, most
earlier systems excluded both of these types of plans, which can
execute significantly faster for some queries. By experimentally
varying the parameters of the Starburst join enumerator, we have
validated analytic formulas for the number of join sequences under a
variety of conditions, and have proven their dependence upon the
'shape' of the query. Specifically, 'linear' queries, in which tables
are connected by binary predicates in a straight line, can be
optimized in polynomial time. Hence the dynamic programming techniques
of System R and R* can still be used to optimize linear queries of as
many as 100 tables in a reasonable amount of time!" ,
bibdate    =    "Mon Mar  4 14:03:44 1991" ,
owner    =    "robyn" ,
)

@article    ( LOHMAN91,
key    =    "Lohman et al." ,
author    =    "Lohman, Guy M. and Bruce Lindsay and Hamid
Pirahesh and K. Bernhard Schiefer" ,
title    =    "Extensions to Starburst: Objects, Types, Fuctions,
and Rules" ,
journal    =    "cacm" ,
volume    =    "34" ,
number    =    "10" ,
month    =    "Oct" ,
year    =    "1991" ,
pages    =    "94 -- 109" ,
bibdate    =    "Sun Nov  3 23:39:41 1991" ,
owner    =    "suchen" ,
)

@inproceedings    ( LOMET81,
key    =    "Lomet" ,
author    =    "Lomet, D." ,
title    =    "Digital B-Trees" ,
booktitle=    "vldb" ,
month    =    "sep" ,
year    =    "1981" ,
pages    =    "333--344" ,
bibdate    =    "Thu Jun 13 12:38:58 1985" ,
)

@article    ( LOMET83,
key    =    "Lomet" ,
author    =    "Lomet, D." ,
title    =    "Bounded Index Exponential Hashing" ,
journal    =    "tods" ,
volume    =    "8" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1983" ,
pages    =    "136--165" ,
bibdate    =    "Wed Jun  5 22:15:52 1985" ,
)

@article    ( LOMET87,
key    =    "Lomet" ,
author    =    "Lomet, D.B." ,
title    =    "Partial Expansions for File Organizations with an
Index" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "12" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1987" ,
pages    =    "65--84" ,
keywords=    "Algorithms; design; performance; B-trees; dynamic
files; indexed files; partial expansions; storage management; storage
utilization" ,
abstract=    "A new way to increase file space in dynamically
growing files is introduced in which substantial improvement in file
utilization can be achieved. It makes use of partial expansions in
which, instead of doubling the space associated with some part of the
file, the space grows at a slower rate. Unlike previous versions of
partial expansion in which the number of buckets involved in file
growth is increased by less than a factor of two, the new method
expands file space by increasing bucket size via ``elastic buckets''.
This permits partial expansions to be used with a wide range of
indexed files, including B-trees. The results of using partial
expansions are analyzed, and the analysis confirmed by a simulation
study. The analysis and simulation demonstrate that the file
utilization gains are substantial and that fears of excessive
insertion cost resulting from more frequent file growth are unfounded." ,
bibdate    =    "Wed May  6 17:53:01 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( LOMET89,
key    =    "Lomet \& Salzberg" ,
author    =    "Lomet, D. B. and Salzberg, B." ,
title    =    "A Robust Multi-Attribute Search Structure" ,
booktitle=    "Proceedings of the Fifth International Conference
on Data Engineering" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1989" ,
pages    =    "296--304" ,
abstract=    "A new multiattribute index structure called the
hB-tree is introduced. The hB-tree inter-node search and growth
processes are precisely analogous to the corresponding processes in
B-trees. The intra-node processes are unique. A k-d tree is used as
the structure within nodes for very efficient searching. Node
splitting requires that this k-d tree be split. This produces nodes
which do no represent brick-like regions in k-space but that can be
characterized as holey bricks, bricks in which sub-regions have been
extracted. We present results that guarantee hB-tree users decent
storage utilization, reasonable size index terms, and good search and
insert performance regardless of key distribution." ,
bibdate    =    "Fri Jan 12 10:36:14 1990" ,
owner    =    "robyn" ,
)

@article    ( LOMET90B,
key    =    "Lomet \& Salzberg" ,
author    =    "Lomet, D.; Salzberg, B." ,
title    =    "the hB-Tree: A Multiattribute Indexing Method with
Good Guaranteed Performance" ,
journal    =    "tods" ,
volume    =    "15" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1990" ,
pages    =    "625--658" ,
keywords=    "access methods; B-trees; dynamic files;
multiattribute indexing" ,
abstract=    "A new multiattribute index structure called the
hB-tree is introduced. It is derived from the K-D-B-tree of Robinson
[15] but has additional desirable properties. The hB-tree internode
search and growth processes are precisely analogous to the
corresponding processes in B-trees [1]. The intranode processes are
unique. A k-d tree is used as the structure within nodes for very
efficient searching. Node splitting requires this k-d tree be split.
This produces nodes which no longer represent brick-like regions in
k-space, but that can be characterized as holey bricks, bricks in
which subregions have been extracted. We present results that
guarantee hB-tree users decent storage utilization, reasonable size
index terms, and good search and insert performance. These results
guarantee that the hB-tree copes well with arbitrary distributions of
keys." ,
bibdate    =    "Thu Mar  7 14:01:03 1991" ,
owner    =    "robyn" ,
)

@inproceedings    ( LOMET91,
key    =    "Lomet" ,
author    =    "Lomet, D." ,
title    =    "Grow and Post Index Trees: Role, Techniques and
Future Potential" ,
booktitle=    "Proc. of the Second Symposium on Large Spatial
Databases" ,
year    =    "1991" ,
abstract=    "Grow and post (GP) access methods, e.g., B+trees,
are the dominant form of index tree access method because of
properties not strictly related to search performance. GP methods fit
well with the rest of a database system, and indeed profit from their
inclusion, e.g., search performance is improved by caching index
nodes. Enhancements to GP methods have increased their utility. GP
methods solve the multi-attribute point search problem and, more
speculatively, the spatial search problem. Their simplicity and
flexibility make GP methods applicable in several interesting new
areas. This paper examines these topics from the author's personal
perspective." ,
bibdate    =    "Wed Oct  2 11:05:31 1991" ,
owner    =    "soo" ,
)

@techreport    ( LOMET91A,
key    =    "Lomet" ,
author    =    "Lomet, D." ,
title    =    "MLR: A Recovery Method for Multi-level Systems" ,
number    =    "CRL 91/7" ,
institution=    "Digital Equipment Corporation" ,
address    =    "Cambridge Research Lab" ,
year    =    "1991" ,
month    =    "jul" ,
keywords=    "multi-level transactions, logging, recovery,
hierarchical systems" ,
abstract=    "To achieve high concurrency in a database system
has meant building a system that copes well with important special
cases. Recent work on multi-level systems suggest a systematic way of
providing high concurrency. A multi-level system using locks permits
restrictive low level locks of a sub-transaction to be replaced with
less restrictive high level locks when a sub-transaction commits,
hence enhancing concurrency. This is possible because sub-transactions
can be undone by executing high level compensation actions rather than
by restoring a prior lower level state. We describe a recovery scheme,
called Multi-Level Recovery (MLR) that logs this high level undo
operation with the commit record for the subtransaction that it
compensates, posting log records to only a single log. A variant of
the method copes with nested transactions, and both nested and
multi-level transactions can be treated in a unified fashion." ,
bibdate    =    "Sun Oct 27 11:43:53 1991" ,
owner    =    "curtis" ,
)

@techreport    ( LOMET91B,
key    =    "Lomet \& Salzberg" ,
author    =    "Lomet, D. and Salzberg, B." ,
title    =    "Concurrency and Recovery for Index Trees" ,
number    =    "CRL 91/8" ,
institution=    "Digital Equipment Corporation" ,
address    =    "Cambridge Research Lab" ,
year    =    "1991" ,
month    =    "aug" ,
keywords=    "concurrency, recovery, indexing, access methods,
B-trees" ,
abstract=    "Providing high concurrency in $B^+$-trees has been
studied extensively. But few efforts have been documented for
combining concurrency methods with a recovery scheme that preserves
well-formed trees across system crashes. We describe an approach for
this that works for a class of index trees that is a generalization of
the $B^{link}$-tree. A major feature of our method is that it works
with a range of different recovery methods. It achieves this by
decomposing structure changes in an index tree into a sequence of
atomic actions, each one leaving the tree well-formed and each working
on a separate level of the tree. All atomic actions on levels of the
tree above the leaf level are independent of database transactions,
and so are of short duration." ,
bibdate    =    "Sun Oct 27 11:43:53 1991" ,
owner    =    "curtis" ,
)

@techreport    ( LOMET92,
key    =    "Lomet et al." ,
author    =    "Lomet, D. and Anderson, R. and Rengarajan, T.K.
and Spiro, P." ,
title    =    "How the Rdb/VMS Data Sharing System Became Fast" ,
number    =    "CRL 92/4" ,
institution=    "dec" ,
address    =    "One Kendall Square, Cambridge, MA 02139" ,
year    =    "1992" ,
month    =    "may" ,
pages    =    "26" ,
keywords=    "database performance; locking; buffering;
recovery; commit processing" ,
bibdate    =    "Thu Aug 27 21:21:57 1992" ,
owner    =    "leoso" ,
abstract=    "Recent versions of Rdb/VMS have shown dramatic
performance increases compared with earlier versions. Performance
enhancements have culminated in an 80% improvement between Rdb/VMS
V3.0 and Rdb/VMS V4.1 when executing on the same hardware. This has
vaulted Rdb/VMS to an industry leadership position in $/TPS and to a
very competitive position in peak TPS. While code paths have been
shortened, the primary means of achieving this performance gain has
been through reducing I/O accesses and distributed locks. This paper
outlines how this was done." ,
)

@article    ( LOMET92A,
key    =    "Lomet" ,
author    =    "Lomet, D." ,
title    =    "A Review of Recent Work on Multi-attribute Access
Methods" ,
journal    =    "sigmod" ,
publisher=    "acm" ,
volume    =    "21" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1992" ,
pages    =    "56--63" ,
abstract=    "Most database systems provide database designers
with single attribute indexing capability via some form of B+-tree.
Multi-attribute search structures are rare, and are mostly found in
systems specialized to some more narrow application area, e.g.,
geographic databases. The reason is that no multi-attribute search
structure has been demonstrated, with high confidence, to be effective
for a broad range of applications. Multi-attribute search is an active
area of research. This paper reviews the state of this field and some
of the difficult problems, and reviews some recent notable papers." ,
bibdate    =    "Wed Oct 28 13:58:17 1992" ,
owner    =    "rts" ,
)

@techreport    ( LOMET92B,
key    =    "Lomet" ,
author    =    "Lomet, D." ,
title    =    "Private Lock Management" ,
number    =    "CRL 92/9" ,
institution=    "dec" ,
address    =    "Cambridge Research Lab" ,
year    =    "1992" ,
month    =    "nov" ,
pages    =    "26" ,
keywords=    "concurrency control, locking, covering, private
locking, multigranularity locks, multi-level transactions, database
cache management" ,
abstract=    "For a data sharing database system, substantial
coordination cost is incurred to cope with the global (distributed)
locking needed by these systems. Lock covering is a way to permit
component systems to perform private (local) locking. Two forms of
covering locks are discussed, together with intention locks, needed to
prevent covering violations. Intention lock give permission for lower
level locking to be used, but require that this locking be global. The
protocol between local lock manager and its principles is defined to
permit information needed for local locking to be conveyed. Principles
are notified when lock demotion may change local locks to global ones.
New lock modes are defined that provide exclusion without being
covering locks. These locks facilitate cache management and private
logical locking, permitting exclusion with high concurrency, and
providing improved concurrency vs overhead trade-offs." ,
bibdate    =    "Tue Jan 19 13:17:33 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( LOMET92C,
key    =    "Lomet \& Salzberg" ,
author    =    "Lomet, D. and Salzberg, B." ,
title    =    "Access Method Concurrency with Recovery" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "San Diego, California" ,
editor    =    "Stonebraker, M." ,
volume    =    "21" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "351--360" ,
abstract=    "Providing high concurrency in B+-trees has been
studied extensively. But few efforts have been documented for
combining concurrency methods with a recovery scheme that preserves
well-formed trees across system crashes. We describe approach for this
that works for a class of index trees that is a generalization of the
B link-tree. A major feature of our method is that it works with a
range of different recovery methods. It achieves this by decomposing
structure changes in an index tree into a sequence of atomic actions,
each one leaving the tree well-formed and each working on a separate
level of the tree. All atomic actions on levels of the tree above the
leaf level are independent of database transactions, and so are of
short duration." ,
bibdate    =    "Mon Jan 25 13:49:27 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( LORENTZOS88,
key    =    "Lorentzos \& Johnson" ,
author    =    "Lorentzos, N.A. and Johnson, R.G." ,
title    =    "An Extension of the Relational Model to Support
Generic Intervals" ,
booktitle=    "Extending Data Base Technology 88" ,
address    =    "Venice, Italy" ,
month    =    "mar" ,
year    =    "1988" ,
abstract=    "A consistent extension of the relational model is
defined, which allows the recording and manipulation of generic
intervals. Two new relational algebra operations are defined, which
are closed. The proposed model has a wide range of applications areas,
such as engineering, CAD, cartography, version modelling, temporal
databases, soil information systems, mathematics, the management of
spatial data and many others." ,
bibdate    =    "Tue Mar  1 11:49:14 1988" ,
owner    =    "manning" ,
)

@article    ( LORIE77,
key    =    "Lorie" ,
author    =    "Lorie, R.A." ,
title    =    "Physical Integrity in a Large Segmented Database" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1977" ,
pages    =    "91--104" ,
bibdate    =    "Thu Jan 15 15:01:55 1987" ,
owner    =    "manning" ,
)

@techreport    ( LORIE83,
key    =    "Lorie \& Plouffe" ,
author    =    "Lorie, R. and Plouffe, W." ,
title    =    "Relational Databases for Engineering Data" ,
type    =    "Computer Science Research Report" ,
number    =    "RJ 3847 (43914)" ,
institution=    "IBM Research Laboratory" ,
address    =    "San Jose, CA" ,
year    =    "1983" ,
month    =    "apr" ,
pages    =    "1--12" ,
abstract=    "Relational database systems can be used to store
engineering data. The principal advantages of relational systems over
other database systems are their ability to access data based on value
relationships, a higher level of data independence, and a
nonprocedural user interface. However, relational database systems
were developed to support data processing, and require some
enhancements for the engineering environment. Five enhancements are
discussed: long fields, complex objects, long transactions, versions
and alternatives, and abstract data types." ,
bibdate    =    "Wed Jul 16 14:24:30 1986" ,
owner    =    "manning" ,
)

@inproceedings    ( LORIE86,
key    =    "Lorie and Daudenarde" ,
author    =    "Lorie, R.A. and Daudenarde, J-J.P." ,
title    =    "On Extending the Realm of Application of
Relational Systems" ,
booktitle=    "Information Processing 86, Proceedings of the IFIP
10th World Computer Congress" ,
organization=    "ifip" ,
publisher=    "Elsevier Science Publishers B.V. (North-Holland)" ,
address    =    "Dublin, Ireland" ,
editor    =    "Kugler, H.-J." ,
month    =    "sep" ,
year    =    "1986" ,
pages    =    "889--894" ,
abstract=    "Database systems, mostly developed to support
business environments, have generally not met the requirements of
other types of applications. Even the newer generation of relational
systems is encountering some difficulties in that area. This paper
presents a synthesis of the work done at IBM Research, San Jose, to
address this problem. It reviews some enhancements that were
introduced in a prototype called XSQL (eXtended SQL), such as long
fields, complex objects, long term consistency controlans discusues
such as integrity co." ,
bibdate    =    "Wed Sep  2 17:18:12 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( LOUIS82,
key    =    "Louis \& Pirotte" ,
author    =    "Louis, Georges and Pirotte, Alain" ,
title    =    "A Denotational Definition of the Semantics of DRC,
A Domain Relational Calculus" ,
booktitle=    "Proceedings of the Eighth International Conference
on Very large Data Bases" ,
year    =    "1982" ,
pages    =    "348--356" ,
month    =    "September" ,
)

@inproceedings    ( LOW92,
key    =    "Low et al." ,
author    =    "Low, C. C. and Ooi, B. C. and Hongjun, L." ,
title    =    "H-trees: A Dynamic Associative Search Index for
OODB" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "San Diego, California" ,
editor    =    "Stonebraker, M." ,
volume    =    "21" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "134--143" ,
abstract=    "The support of superclass-subclass concept in
object-oriented database (OODB) makes an instance of a subclass also
an instance of its superclass. As a result, the access scope of a
query against a class in general includes the access scope of all its
subclasses, unless specified otherwise. To support the
superclass-subclass relationship, efficiently, The index must achieve
two objectives. First, the index must support efficient retrieval of
instances from a single class. Second, it must also support efficient
retrieval of instances from classes in a hierarchy of classes. In this
paper, we propose a new index called the H-tree that supports
efficient retrieval of instances of a single class as well as
retrieval of instances of a class and its subclasses. The unique
feature of H-trees is that they capture the superclass-subclass
relationships. A performance analysis is conducted and both
experimental and analytical results indicate that the H-tree is an
efficient indexing structure for OODB." ,
keywords=    "OODB; indexing structures; query retrieval" ,
bibdate    =    "Mon Jan 25 13:37:41 1993" ,
owner    =    "bassili" ,
)

@article    ( LU82,
key    =    "Lu" ,
author    =    "Lu, D.J." ,
title    =    "Watch-Dog Processors and Structural Integrity
Checking" ,
journal    =    "tc" ,
month    =    "july" ,
year    =    "1982" ,
bibdate    =    "Tue Mar  5 10:05:33 1985" ,
)

@article    ( LUK83B,
key    =    "Luk" ,
author    =    "Luk, W." ,
title    =    "On Estimating Block Accesses In Database
Organizations" ,
journal    =    "cacm" ,
volume    =    "26" ,
number    =    "11" ,
month    =    "nov" ,
year    =    "1983" ,
pages    =    "945--947" ,
bibdate    =    "Sat Apr 27 00:19:23 1985" ,
)

@article    ( LUK86,
key    =    "Luk \& Kloster" ,
author    =    "Luk, W.S. and Kloster, S." ,
title    =    "ELFS: English Language from SQL" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "11" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1986" ,
pages    =    "447--472" ,
keywords=    "Human factors; languages; natural language
feedback; SQL; user interface" ,
abstract=    "In this paper we describe a system which, given a
query in SQL-like relational database language, will display its
meaning in clear, unambiguous natural language. The syntax-driven
translation mechanism is independent of the application domain. It has
direct applications in designing computer-based SQL tutorial systems
and program debugging systems. The research results obtained in the
paper will also be useful in query optimization and design of a more
user-friendly language front-end for casual users." ,
bibdate    =    "Fri Feb 20 12:43:09 1987" ,
owner    =    "manning" ,
)

@article    ( LUM71,
key    =    "Lum et al." ,
author    =    "Lum, V. and Yuen, P. and Dodd, M." ,
title    =    "Key-to-Address Transform Techniques: A Fundamental
Study on Large Existing Formatted Files" ,
journal    =    "cacm" ,
volume    =    "14" ,
number    =    "4" ,
month    =    "apr" ,
year    =    "1971" ,
pages    =    "228--239" ,
bibdate    =    "Wed Jun  5 22:10:36 1985" ,
)

@article    ( LUM76,
key    =    "Lum et al." ,
author    =    "Lum, V. and Shu, N. and Housel, B." ,
title    =    "A General Methodology for Data Conversion and
Restructuring" ,
journal    =    "IBM Journal of Research and Development" ,
pages    =    "483--497" ,
publisher=    "IBM" ,
month    =    "sep" ,
year    =    1976 ,
annote    =    "Translated by changing to a 'Linear' format.
Worked on the correspondence of this to relational format. Two
languages, one defines the Schema, the other converts between schemas
that have these descriptions attached." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( LUM85,
key    =    "Lum et al." ,
author    =    "Lum, V. and Dadam, P. and Erbe, R. and Guenauer,
J. and Pistor, P. and Walch, G. and Werner, H. and Woodfill, J." ,
title    =    "Design of an Integrated DBMS to Support Advanced
Applications" ,
booktitle=    "Proceedings of the Conference on Foundation of
Data Organization" ,
address    =    "Kyoto, Japan" ,
month    =    "may" ,
year    =    "1985" ,
abstract=    "New applications of DBMS's in areas of sciences,
engineering and offices have produced new requirements that are not
satisfied in current DBMS's. Included among these requirements are
support for both the normalized and non-normalized models directly at
the system interface level, support for text processing, and support
of the temporal domain. To provide these supports, one can try to
build additional functions on top of or into an existing DBMS. This
approach has been deemed to be inefficient. It is believed that much
can be gained by designing a new system to satisfy the new
requirements more directly. This paper describes the specific design
of a DBMS directed to satisfy the three requirements just cited. The
authors first discuss the overall architecture before proceeding to
discuss some aspects of its internal data management. Included here is
the internal data structure and how they are used to provide the
necessary supports. Summarized in the conclusion are the features of
the system that are not available generally in current DBMS's. In
addition, the status and planned enhancements are also outlined." ,
bibdate    =    "Mon Apr 22 09:29:25 1985" ,
)

@article    ( LUNT90,
key    =    "Lunt \& Fernandez" ,
author    =    "Lunt, T. and Fernandez, E." ,
title    =    "Database Security" ,
journal    =    "sigmod" ,
volume    =    "19" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1990" ,
pages    =    "90--97" ,
bibdate    =    "Sun Jan 19 21:08:09 1992" ,
owner    =    "soo" ,
)

@inproceedings    ( LYNGBAEK83,
key    =    "Lyngb\ae{}k \& McLead" ,
author    =    "Lyngb\ae{}k, P. and McLeod, D." ,
title    =    "An Approach to Object Sharing in Distributed
Database Systems" ,
booktitle=    "vldb" ,
address    =    "Florence, Italy" ,
month    =    "oct" ,
year    =    "1983" ,
abstract=    "This paper describes DODM, a simple model for
object sharing in distributed database systems. The model provides a
small set of operations for object definition, manipulation, and
retrieval in a distributed environment. Relationships among objects
can be established across database boundaries, objects are relocatable
within the distributed environment, and mechanisms are provided for
object sharing among individual databases. An object naming convention
supports location transparent object references; that is, objects can
be referenced by user-defined names rather than by address. The
primitive operations introduced can be used as the basis for the
specification and stepwise development of database models and database
systems of increasing complexity. An example is provided to illustrate
the use of DODM in the design of a distributed database system
supporting a semantically expressive database model." ,
bibdate    =    "Wed Aug 22 09:52:12 1984" ,
)

@article    ( LYNGBAEK84,
key    =    "Lyngb\ae{}k \& McLeod" ,
author    =    "Lyngb\ae{}k, P. and McLeod, D." ,
title    =    "Object Sharing in Distributed Information Systems" ,
journal    =    "tois" ,
publisher=    "acm" ,
volume    =    "2" ,
number    =    "2" ,
month    =    "apr" ,
year    =    "1984" ,
pages    =    "96--122" ,
bibdate    =    "Tue May 26 08:55:25 1987" ,
owner    =    "manning" ,
)

@techreport    ( LYNGBAEK91,
key    =    "Lyngb\ae{}k" ,
author    =    "Lyngb\ae{}k, P." ,
title    =    "OSQL: A Language for Object Databases" ,
number    =    "HPL-DTD-91-4" ,
institution=    "Hewlett-Packard Laboratories" ,
address    =    "Palo Alto, CA" ,
year    =    "1991" ,
month    =    "jan" ,
bibdate    =    "Mon Mar 15 14:48:50 1993" ,
owner    =    "rts" ,
)

@inproceedings    ( MACKERT86,
key    =    "Mackert \& Lohman" ,
author    =    "Mackert, L.F. and Lohman, G.M." ,
title    =    "R* Optimizer Validation and Performance Evaluation
for Distributed Queries" ,
booktitle=    "Proceedings of the Twelfth International
Conference on Very Large Data Bases" ,
address    =    "Kyoto, Japan" ,
month    =    "aug" ,
year    =    "1986" ,
pages    =    "149--159" ,
abstract=    "Few database query optimizer models have been
validated against actual performance. This paper extends an earlier
optimizer valiation and performance evaluation of R* to distributed
queries, i.e., single SQL statements having tables at multiple sites.
Actual R* message, I/O and CPU resources consumed - and the
corresponding costs estimated by the optimizer- were written to
database tables using new SQL commands, permitting automated control
from application programs for collecting, reducing, and comparing test
data. A number of tests were run over a wide variety of
dynamically-created test databases, SQL queries, and system
parameters. Both high-speed networks -comparable to a local area
network- and medium-speed long-haul networks -for linking
geographically dispersed hosts- were evaluated. The tests confirmed
the accuracy of R*'s message cost model and the significant
contribution of local -CPU and I/O- costs, even for a medium-speed
network. Although distributed queries consume more resources overall,
the response time for some execution strategies improves
disproportionately by exploiting both concurrency and reduced
contention for buffers. For distributed joins in which a copy of the
inner table must be transferred to the join site, shipping the whole
inner table dominated the strategy of fetching only those inner tuples
that matched each outer -table value, even though the former strategy
may require additional I/O. Bloomjoins -hashed semijoins- consistently
performed better than semijoins and the best R* strategies." ,
bibdate    =    "Tue Aug 25 11:47:20 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( MACKERT86B,
key    =    "Mackert \& Lohman" ,
author    =    "Mackert, L.F. and Lohman, G.M." ,
title    =    "R* Optimizer Validation and Performance Evaluation
for Local Queries" ,
booktitle=    "sigmod" ,
organization=    "ACM" ,
address    =    "Washington, D.C." ,
editor    =    "Zaniolo, C." ,
month    =    "may" ,
year    =    "1986" ,
pages    =    "84--95" ,
bibdate    =    "Wed Nov  2 14:54:26 1988" ,
owner    =    "" ,
)

@article    ( MACKERT89,
key    =    "Mackert \& Lohman" ,
author    =    "Mackert, L. F. and Lohman G. M." ,
title    =    "Index Scans Using a Finite LRU Buffer: A Validated
I/O Model" ,
journal    =    "tods" ,
volume    =    "14" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1989" ,
pages    =    "401--424" ,
keywords=    "Measurement; performance; random access; B-tree;
buffer management; database performance; file access; index;
information retrieval; inverted file organization; query optimization" ,
abstract=    "Indexes are commonly employed to retrieve a
portion of a file or to retrieve its records in a particular order. An
accurate performance model of indexes is essential to the design,
analysis, and tuning of file management and database systems, and
particularly to database query optimization. Many previous studies
have addressed the problem of estimating the number of disk page
fetches when randomly accessing k records out of given records stored
on T disk pages. This paper generalizes these results, relaxing tow
assupmtion that usually do not hold in practice: unlimited buffer and
unique records for each key value. Experiments show that the
performance of an index scan is very sensitive to buffer size
limitations and multiple records per key value. A model for these more
practical situations is presented and a formula derived for estimating
the performance of an index scan. We also give a closed-form
approximation that is easy to compute. The theoretical results are
validated using the R* distributed relational database system.
Although we use database terminology throughout the paper, the model
is more generally applicable whenever random accesses are made using
keys." ,
bibdate    =    "Tue Nov  7 14:41:55 1989" ,
owner    =    "robyn" ,
)

@article    ( MAHANTI85,
key    =    "Mahanti \& Bagchi" ,
author    =    "Mahanti, A. and Bagchi, A." ,
title    =    "AND/OR Graph Heuristic Search Methods" ,
journal    =    "Journal of the ACM" ,
year    =    "1985" ,
volume    =    "32" ,
number    =    "1" ,
pages    =    "28--51" ,
month    =    "January" ,
)

@inproceedings    ( MAIER82,
key    =    "Maier" ,
author    =    "Maier, D." ,
title    =    "Using Write-Once Memory for Database Storage" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "acm" ,
year    =    "1982" ,
pages    =    "239--246" ,
bibdate    =    "Tue Mar  5 15:50:19 1985" ,
)

@book        ( MAIER83,
key    =    "Maier" ,
author    =    "Maier, D." ,
title    =    "The Theory of Relational Databases" ,
publisher=    "Computer Science Press" ,
address    =    "Rockville, MD" ,
year    =    "1983" ,
bibdate    =    "Thu Dec 29 14:27:54 1983" ,
)

@article    ( MAIER85,
key    =    "Maier et al." ,
author    =    "Maier, David and Otis, Allen and Purdy, Alan" ,
title    =    "Object-Oriented Database Development at Servio
Logic" ,
journal    =    "Database Engineering. Special Issue on
Object-Oriented Systems" ,
year    =    "1985" ,
volume    =    "8" ,
number    =    "4" ,
pages    =    "58--65" ,
month    =    "December" ,
)

@inproceedings    ( MAIER86B,
key    =    "Maier et al." ,
author    =    "Maier, D. and Stein, J. and Otis, A. and Purdy, A." ,
title    =    "Development of an Object-Oriented DBMS" ,
booktitle=    "First Annual Conference on Object-Oriented
Programming Systems, Languages and Applications" ,
organization=    "ACM" ,
address    =    "Portland, OR" ,
month    =    "sep" ,
year    =    "1986" ,
pages    =    "472--482" ,
abstract=    "We describe the results of developing the GemStone
object- oriented database server, which supports a model of objects
similar to that of Smalltalk-80. We begin with a summary of the goals
and requirements for the system: an extensible data model that
captures behavioral semantics, no artificial bounds on the number or
size of database objects, database amenities-concurrency,
transactions, recovery, associative access, authorization- and an
interactive development environment. Object-oriented languages,
Smalltalk in particular, answer some of these requirements in an
object oriented context, and report briefly on the status of the
development efforts. This paper is directed at an audience familiar
with object-oriented languages and their implementation, but perhaps
unacquainted with the difficulties and techniques of database system
development. It updates the original report on the project [CM], and
expands upon a more recent article [MDP]. " ,
bibdate    =    "Wed Sep  3 14:13:14 1986" ,
owner    =    "manning" ,
)

@inproceedings    ( MAKINOUCHI81,
key    =    "Makinouchi et al." ,
author    =    "Makinouchi, A. and Tezuka, M. and Kitakami, H. and
Adachi, S." ,
title    =    "The Optimization Strategy for Query Evaluation in
RDB/V1" ,
booktitle=    "Proceedings of the Seventh International
Conference on Very Large Data Bases" ,
year    =    "1981" ,
pages    =    "518--529" ,
month    =    "" ,
)

@article    ( MALHOTRA83,
key    =    "Malhotra et al." ,
author    =    "Malhotra, A. and Markowitz, H.M. and Pazel, D.P." ,
title    =    "EAS-E: An Integrated Approach to Application
Development" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "8" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1983" ,
pages    =    "515--542" ,
keywords=    "Languages; entity relationship model" ,
abstract=    "EAS-E (pronounced EASY) is an experimental
programming language integrated with a database management system now
running on VM/370 at the IBM Thomas J. Watson Research Center. The
EAS-E programming language is built around the entity, attribute, and
set (EAS) view of application development. It provides a means for
translating operations on EAS structures directly into executable
code. EAS-E commands have an English-like syntax, and thus EAS-E
programs are easy to read and understand. EAS-E programs are also more
compact than equivalent programs in other database languages. The
EAS-E database management system allows many users simultaneous access
to the database. It supports locking and deadlock detection and is
capable of efficiently supporting network databases of various sizes
including very large databases, consisting of several millions of
entities stored on multiple DASD extents. Also available is a
nonprocedural facility that allows a user to browse and update the
database without writing programs." ,
bibdate    =    "Tue Jan 20 12:35:51 1987" ,
owner    =    "manning" ,
)

@techreport    ( MALHOTRA85,
key    =    "Malhotra et al" ,
author    =    "Malhotra, A. and Pazel, D. P. and Burns, L. M." ,
title    =    "BROWSER: A visual, interactive database interface" ,
institution=    "IBM Thomas J. Watson Research Center" ,
address    =    "Yorktown Heights, NY" ,
year    =    "1985" ,
month    =    "jan" ,
bibdate    =    "Tue Nov  7 15:48:13 1989" ,
owner    =    "robyn" ,
)

@article    ( MALHOTRA89,
key    =    "Malhotra et al" ,
author    =    "Malhotra, A. and Markowitz, H. M. and Tsalalikhin,
Y. and Pazel, D. P. and Burns, L. M." ,
title    =    "An Entity-Relationship Programming Language" ,
journal    =    "tse" ,
volume    =    "15" ,
number    =    "9" ,
month    =    "sep" ,
year    =    "1989" ,
pages    =    "1120--1130" ,
keywords=    "data manipulation language; entity relationship
model; integrated programming language; language syntax; run time
environment" ,
abstract=    "This paper presents syntax for an integrated
Entity Relationship (E-R) programming language. We envision this
syntax being used to extend a general purpose programming language
such as Cobol, PL/1, Pascal, or C to provide facilities for working
with E-R data. We start by discussing the problems that arise in
providing data manipulation facilities by embedding a query language
in a general purpose programming language and argue that an integrated
approach is superior. We then state the requirements for such a
language followed by a syntax. The syntax provides data manipulation
capabilities for the E-R model in which entity sets are assumed to be
mutually disjoint and each entity set has a unique, perhaps
multiattribute, key. The syntax also covers the extended entity
relationship (E-E-R) model which allows relationships between
relationships. In an integrated language, database objects are
automatically brought into main memory when they are referred to. To
keep track of these objects and their references a run-time
environment must be provided and bound to the user program. We discuss
the design of this run time environment in some detail. If the E-R
model is restricted to binary relationships between entity types and
without attributes then the syntax can be considerably simplified. We
discuss this syntax which has been implemented in a language called
ERLANG (12). Finally, we discuss briefly some implementation
consideration as well as a simple facility for defining an E-R
database." ,
bibdate    =    "Wed Sep 27 08:41:22 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( MALLEY87,
key    =    "Malley \& Zdonik" ,
author    =    "Malley, Christopher V. and Stanley B. Zdonik" ,
title    =    "A Knowledge-Based Approach to Query Optimization" ,
booktitle=    "Proceedings from the First International
Conference on Expert Database Systems" ,
year    =    "1987" ,
pages    =    "243--257" ,
month    =    "" ,
)

@article    ( MALVESTUTO86,
key    =    "Malvestuto" ,
author    =    "Malvestuto, Francesco M." ,
title    =    "Statistical Treatment of the Information Content
of a Database" ,
journal    =    "Information Systems" ,
year    =    "1986" ,
volume    =    "11" ,
number    =    "3" ,
pages    =    "211--223" ,
month    =    "" ,
)

@techreport    ( MANNILA87,
key    =    "Mannila \& Raiha" ,
author    =    "Mannila, H. and Raiha, K.-J." ,
title    =    "Automatic Generation of Test Data for Relational
Queries" ,
number    =    "A-1987-2" ,
institution=    "Department of Computer Science" ,
address    =    "University of Tampere, Tampere, Finland" ,
year    =    "1987" ,
month    =    "feb" ,
pages    =    "1--16" ,
abstract=    "An automatic technique for generating a
comprehensive test database for a given query is studied. The test
database is large enough to illustrate the effect of each operation
appearing in the query. On the other hand, the database attempts to do
this in a minimal way. The method can be applied in the testing of
queries, e.g. as an aid in learning a new query language. The basis of
the construction is the definition of an adequate test case. We
characterize this concept using Armstrong relations and discuss the
existence of such databases. We also give a general construction for
select-project-join queries with no selections based on equality." ,
bibdate    =    "Wed May  4 14:40:48 1988" ,
owner    =    "manning" ,
)

@article    ( MANNINO88,
key    =    "Mannino" ,
author    =    "Mannino, Michael V." ,
title    =    "Statistical Profile Estimation in Database Systems" ,
journal    =    "ACM Computing Surveys" ,
year    =    "1988" ,
volume    =    "20" ,
number    =    "3" ,
pages    =    "191--221" ,
month    =    "September" ,
)

@article    ( MANNINO89,
key    =    "Mannino \& Rivera" ,
author    =    "Mannino, Michael V. and Rivera, Angel" ,
title    =    "An Extensible Model of Selectivity Estimation" ,
journal    =    "Information Sciences" ,
year    =    "1989" ,
volume    =    "49" ,
number    =    "1" ,
pages    =    "225--247" ,
month    =    "October" ,
)

@article    ( MANNINO90,
key    =    "Mannino et al." ,
author    =    "Mannino. M. and Choi, I. and Batory, D." ,
title    =    "The Object-Oriented Functional Data Language" ,
journal    =    "tse" ,
volume    =    "16" ,
number    =    "11" ,
month    =    "nov" ,
year    =    "1990" ,
pages    =    "1258--1272" ,
keywords=    "database programming language; functional
programming; object-oriented databases; type inference" ,
abstract=    "The Object Oriented Functional Data Language
(O2FDL) is an interactive strongly-typed database programming language
that integrates the object-oriented and functional programming
paradigms. It was designed for advanced applications such as
computer-aided design, statistical computing, and multimedia systems
that require a powerful and uniform database programming language
supporting the software engineering principles of these two paradigms.
To this end, the O2FDL supports inheritance and encapsulation of
object-oriented languages and an equational notation and strong typing
of functional programming. Strong typing is extended with type
restrictions to constrain the instantiations of type variables in
function interfaces, while inheritance is augmented with a monotonic
subtype rule for function redefinition. To facilitate convenient and
concise expressions for both database and general purpose computation,
the O2FDL supports novel features including 1) functions of indefinite
nesting levels that simplify nested list processing; 2) system-defined
functions that provide a concise and convenient notation for
filtering, aggregating, and combining objects; and 3) path expressions
that allow a flexible graphical correspondence for database queries.
We define these feature informally through examples and formally
through a two part semantics. For the core of the 02FDL we provide
denotational semantics based on an extended lambda calculus. For
selected system-defined functions, we provide an operational semantics
and demonstrate that a subset of the O2FDL is at least as expressive
as the relational algebra." ,
bibdate    =    "Tue Dec  4 08:59:45 1990" ,
owner    =    "robyn" ,
)

@inproceedings    ( MANOLA86,
key    =    "Manola \& Orenstein" ,
author    =    "Manola, F. and Orenstein, J.A." ,
title    =    "Toward a General Spatial Data Model for an
Object-Oriented DBMS" ,
booktitle=    "vldb" ,
address    =    "Kyoto, Japan" ,
editor    =    "Kambayashi, Y." ,
month    =    "aug" ,
year    =    "1986" ,
pages    =    "328--335" ,
abstract=    "This paper describes the development of a general
spatial data model for PROBE, a knowledge-oriented DBMS being
developed at CCA. The data model, called PDM, is an extension to the
Daplex functional data model. The paper first describes the approach
taken to defining spatial semantics in the model, and how these
semantics were incorporated into the non- spatial aspects of the
model. Second, some implementation aspects are discussed." ,
bibdate    =    "Thu Jul 24 11:30:57 1986" ,
owner    =    "manning" ,
)

@article    ( MARCH77,
key    =    "March \& Severance" ,
author    =    "March, D. and Severance, D." ,
title    =    "The Determination of Efficient Record
Segmentations and Blocking Factors for Shared Files" ,
journal    =    "tods" ,
volume    =    "2" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1977" ,
pages    =    "279--296" ,
bibdate    =    "Mon Jun  2 16:01:45 1986" ,
owner    =    "ahn" ,
)

@inproceedings    ( MARCH78,
key    =    "March \& Severance" ,
author    =    "March, D. and Severance, D." ,
title    =    "A Mathematical Modeling Approach to the Automatic
Selection of Database Designs" ,
booktitle=    "sigmod" ,
volume    =    "8" ,
year    =    "1978" ,
pages    =    "52--65" ,
bibdate    =    "Fri May  3 17:25:42 1985" ,
)

@inbook        ( MARCH85,
key    =    "March \& Carlis" ,
author    =    "March, S. and Carlis, J." ,
title    =    "Physical Database Design: Techniques for Improved
Database Performance" ,
booktitle=    "Query Processing Database Systems" ,
publisher=    "Springer-Verlag" ,
year    =    "1985" ,
pages    =    "279--296" ,
bibdate    =    "Wed Nov  6 22:29:56 1985" ,
)

@article    ( MARK86,
key    =    "Mark \& Roussopoulos" ,
author    =    "Mark, L. and Roussopoulos, N." ,
title    =    "Metadata Management" ,
journal    =    "Computer" ,
publisher=    "IEEE" ,
volume    =    "19" ,
number    =    "12" ,
month    =    "dec" ,
year    =    "1986" ,
pages    =    "26--36" ,
bibdate    =    "Thu Jan  8 11:35:33 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( MARK86B,
key    =    "Mark et al." ,
author    =    "Mark, L. and Roussopoulos, N. and Chu, B." ,
title    =    "Update Dependencies" ,
booktitle=    "Proceedings of the IFIP WG 2.6 Working Conference
on Data Semantics (DS-1)" ,
organization=    "IFIP" ,
address    =    "Hasselt, Belgium" ,
editor    =    "Steel, T.B. and Meersman, R." ,
month    =    "jan" ,
year    =    "1985" ,
pages    =    "303--319" ,
abstract=    "We introduce update dependencies as a means to
specify and and control the semantics of a database under update. A
set of update dependencies give a declarative specification of an
update on one relation and its set of implied updates on other
relations, and specifies the conditions under which the implied
updates must succeed for the original one to suceed. User interaction
may be required to provide additional information which is either
external to the database or requires human decision making. A
collection of update dependencies constitutes a production system
which helps and guides the user through a database transaction once he
has taken the first step. The major difference between this approach
and conventional approaches to integrity rule spectification and
enforcement is, that rather than specifying a set of rules for what
are the valid states of the database, we specify a set of rules for
how the database can evolve from one valid state to another." ,
bibdate    =    "Sun Sep 11 20:32:00 1988" ,
owner    =    "" ,
)

@article    ( MARK87,
key    =    "Mark \& Roussopoulos" ,
author    =    "Mark, L. and Roussopoulos, N." ,
title    =    "Information Interchange between Self-Describing
Databases" ,
journal    =    "Data Engineering" ,
publisher=    "ieee" ,
volume    =    "10" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1987" ,
pages    =    "46--52" ,
abstract=    "Within the framework of a Self-Describing Database
System we describe a set of Data Management Tools and a Data
Dictionary supporting Information Interchange. The concepts are based
on our experience from a project on standardized information
interchange in NASA." ,
owner    =    "manning" ,
bibdate    =    "Thu Jun  9 10:06:07 1988" ,
)

@unpublished    ( MARK88,
key    =    "Mark" ,
author    =    "Mark, Leo" ,
title    =    "Object Oriented Data Model. Concepts and
Questions. version 2" ,
month    =    "June" ,
year    =    "1988" ,
)

@article    ( MARK92A,
key    =    "Mark et al." ,
author    =    "Mark, Leo and Roussopoulos, Nick and Newsome, Tina
and Laohapipattana, Piriya" ,
title    =    "Incrementally Maintained Network -> Relational
Database Mapping" ,
journal    =    "spe" ,
volume    =    "22" ,
month    =    "dec" ,
year    =    "1992" ,
pages    =    "1099--1131" ,
keywords=    "Database mapping; Database conversion; Incremental
database mapping; Database gateway" ,
abstract=    "An incrementally maintained mapping from a network
to a relational database is presented. This mapping may be established
either to support the efficient retrieval of data from a network
database through a relational interface, or as the first step in a
gradual conversion of data and applications from a network to a
relational database system. After the mapping has been established,
the only data mapped from the network to the relational database are
the increments resulting from updates on the network database. The
mapping is therefore an efficient alternative to mappings that
repeatedly map the results of retrievals through the relational
interface from the network database to the relational database. This
is in particular the case when the two databases reside on different
hosts. Applications on the network database may, under certain
restrictions, gradually be moved to the relational database, while the
mapping incrementally maintains the relational database for the
applications that remain on the network database. A detailed, but
generic, account of how to build such a mapping from a network to a
relational database is given, including all the algorithms needed and
examples of their use." ,
bibdate    =    "Mon Nov 14 10:57:45 1994" ,
owner    =    "kevin" ,
)

@article    ( MARK92B,
key    =    "Mark \& Cochrane" ,
author    =    "Mark, Leo and Cochrane, Roberta" ,
title    =    "Grammars and Relations" ,
journal    =    "tse" ,
publisher=    "IEEE" ,
volume    =    "18" ,
number    =    "9" ,
month    =    "sep" ,
year    =    "1992" ,
pages    =    "840--849" ,
abstract=    "Context-free grammars provide the basis for many
useful tools such as parser-generators, compiler-compilers and
syntax-directed editors. This paper demonstrates the potential
benefits obtained when context-free grammars are used to define
complex objects in the relational model. The grammar formalism
facilitates relational queries on the hierarchical structure of these
objects and promotes the use of grammar-based tools as front ends to
relational database systems." ,
bibdate    =    "Mon Nov 14 10:43:35 1994" ,
owner    =    "kevin" ,
)

@article    ( MARKOWITZ84,
key    =    "Markowitz et al." ,
author    =    "Markowtiz, H.M. and Malhotra, A. and Pazel, D.P." ,
title    =    "The EAS-E Appliction Development System:
Principles and Language Summary" ,
journal    =    "cacm" ,
publisher=    "acm" ,
volume    =    "27" ,
number    =    "8" ,
month    =    "aug" ,
year    =    "1984" ,
pages    =    "785--799" ,
bibdate    =    "Tue Jan 20 12:37:42 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( MARKOWITZ87,
key    =    "Markowitz \& Makowsky" ,
author    =    "Markowitz, V.M. and Makowsky, J.A." ,
title    =    "Incremental Reorganization of Relational Databases" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
editor    =    "Hammersley, P." ,
month    =    "sep" ,
year    =    "1987" ,
pages    =    "127--135" ,
abstract=    "The evolution of an information system is
reflected in data modeling by database reorganization.
Entity-Relationship(ER) consistency expresses the capability of
relational databases to model information oriented systems. A
relational schema consisting of relation schemes, together with key
and inclusion dependencies, is said to be ER-consistent if it complies
with an entity-relationship structure, meaning that it is
representable by an ER-Diagram. For ER-consistent schemas the basic
restructuring manipulations are the addition and removal of relation
schemes, coupled with the modification of the key and inclusion
dependencies. Recently we have defined a set of incremental and
reversible schema restructuring manipulations as the translates of a
set of vertex-oriented ER-Diagram transformations. For non-empty
database states the schema restructuring manipulations must be
associated with state mappings, and this leads us to the definition of
database reorganization operations; database reorganization operations
consist of compatible pairs of incremental restructuring manipulations
and entity-bounded state mappings. For the specification of
ER-consistent database state mappings, we propose an
Entity-Relationship Calculus." ,
bibdate    =    "Thu Apr 28 12:22:24 1988" ,
owner    =    "" ,
)

@inproceedings    ( MARKOWITZ87A,
key    =    "Markowitz \& Makowsky" ,
author    =    "Markowitz, V. M. and Makowsky, J. A." ,
title    =    "Incremental Reorganization of Relational Databases" ,
booktitle=    "vldb" ,
address    =    "Brighton" ,
year    =    "1987" ,
pages    =    "127--135" ,
abstract=    "The evolution of an information system is
reflected in data modeling by database reorganization.
Entity-Relationship (ER) consistency expresses the capability of
relational databases to model information oriented systems. A
relational schema consisting of relation schemes, together with key
and inclusion dependencies, is said to be ER-consistent if it complies
with an entity-relationship structure, meaning that it is
representable by an ER-diagram. For ER-consistent schemas the basic
reconstructing manipulations are the addition and removal of relation
schemes, couples with the modification of the key and inclusion
dependencies. Recently we have defined a set of incremental and
reversible schema restructuring manipulations as the translates of a
set of vertex-oriented ER-Diagram transformations. For non-empty
database states the schema restructuring manipulations must be
associated with state mapping, and this leads us to the definition of
database reorganization operations; database reorganization operations
consist of compatible pairs of incremental restructuring manipulations
and entity-bounded state mappings. For the specifications of
ER-consistent database state mappings, we propose an
Entity-Relationship Calculus." ,
bibdate    =    "Tue May 18 16:59:23 1993" ,
owner    =    "bassili" ,
)

@article    ( MARKOWITZ92,
key    =    "Markowitz \& Shoshani" ,
author    =    "Markowitz, V.M. and Shoshani, A." ,
title    =    "Representing Extended Entity-Relationship
Structures in Relational Databases: A Modular Approach" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "17" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1992" ,
pages    =    "423--464" ,
keywords=    "database design; extended entity-relationship
model; relational data model; schema translation; semantic data model" ,
abstract=    "A common approach to database design is to
describe the structures and constraints of the database application in
terms of a semantic data model, and then represent the resulting
schema using the data model of a commercial database management
system. Often, in practice, Extended Entity-Relationship (EER) schemas
are translated into equivalent relational schemas. This translation
involves different aspects: representing the EER schema using
relational constructs, assigning names to relational attributes,
normalization, and merging relations. Considering these aspects
together, as is usually done in the design methodologies proposed in
the literature, is confusing and leads to inaccurate results. We
propose to treat separately these aspects and split the translation
into four stages (modules) corresponding to the four aspects mentioned
above. We define criteria for both evaluating the correctness of and
characterizing the relationship between alternative relational
representations of EER schemas." ,
bibdate    =    "Mon Oct 26 20:49:27 1992" ,
owner    =    "leoso" ,
)

@techreport    ( MAYER91,
key    =    "Mayer" ,
author    =    "Mayer, P." ,
title    =    "Final Project Report: Knowledge based Information
Model Integration" ,
number    =    "ISI 9060808" ,
institution=    "NSF" ,
year    =    1991 ,
annote    =    "Report from a company looking into the commercial
viability of using semantic information in translation. The major
'research' contribution is their infon algebra a 4 valued logic system
in which a given fact for a given object is either true, false, not
applicable or unknown" ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( MAYS91,
key    =    "Mays et al." ,
author    =    "Mays, Eric and Sitaram Lanka and Bob Dionne and
Robert Weida" ,
title    =    "A Persistent Store for Large Shared Knowledge
Bases" ,
journal    =    "tkde" ,
volume    =    "3" ,
number    =    "1" ,
month    =    "Mar" ,
year    =    "1991" ,
pages    =    "33--41" ,
keywords=    "Database, fully-persistent, knowledge base,
knowledge engineering, knowledge representation, versioning" ,
abstract=    "We propose a knowledge base management system
(KBMS) with the following goals: 1) to allow a knowledge engineer to
update a knowledge base and have these updaates persist on secondary
sotrage, 2)to allow multiple knowledge engineers to have shared access
to a knowledge base and modify the knowledge base concurrently, and 3)
to maintain consistency of the shared knowledge base as it evolves.
Ath the heart of the KBMS is the version store which is a persistent
storage structure which maintains multiple versions of a knowledge
base. Retrieve and update iperations have been defined on the version
store to efficiently access and modify any version. Objects in the
version store are clustered so as to support efficient access of an
entire version or some subparts of it. To store the effects of an
update requires space proportional to the size of the updaye and which
is independent of the size of the knowledge base. That is beyond our
concerns with overall efficiency, the additional cost of maintaining
multiple versions is within a small constant factor of maintaing a
single version." ,
bibdate    =    "Tue Aug  6 16:20:39 1991" ,
owner    =    "suchen" ,
)

@inproceedings    ( MCAULIFFE95,
key    =    "McAuliffe \& Solomon" ,
author    =    "McAuliffe, M. L. and Solomon, M. H." ,
title    =    "A Trace-Based Simulation of Pointer Swizzling
Techniques" ,
booktitle=    "International Conference on Database Engineering" ,
organization=    "ieee" ,
year    =    "1995" ,
pages    =    "52--61" ,
bibdate    =    "Mon Nov 20 12:21:47 1995" ,
abstract=    "Persistent object-oriented applications that
traverse large object graphs can improve their performance by caching
objects in main memory while they are being used. While caching offers
large performance benefits, the techniques used to locate these cached
objects in memory can still impede the application's performance. We
present the results of a trace-based simulation study of pointer
swizzling techniques, techniques for reducing the cost of access to
cached objects. We used traces derived from actual persistent programs
to find a class of swizzling techniques that performs well, yet
permits changes to the contents of in-memory object caches over the
lifetime of an application. Our study demonstrates the superiority of
a class of techniques known as 'indirect swizzling' for a variety of
workloads and system configurations." ,
owner    =    "jeff" ,
)

@techreport    ( MCC89,
key    =    "MCC" ,
author    =    " MCC" ,
title    =    " An Introduction to {\it EXTRACT\/} A Declarative
Data Conversion Environment." ,
institution=    "MCC" ,
year    =    1989 ,
annote    =    "EXTRACT is a project to allow for conversion
between Databases at MCC. It is to be extensible, and applicable to
all DBMS models, including OODBMS. It is to be a commercial project." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( MCGRODDY90,
key    =    "McGroddy" ,
author    =    "McGroddy, James C." ,
title    =    "Systems, Technology, and Intrastructure: Linkage
and Risks" ,
booktitle=    "ACM Eighteenth Annual Computer Science Conference" ,
year    =    "1990" ,
pages    =    "" ,
month    =    "February" ,
)

@article    ( MCGUCKIN91,
key    =    "McGuckin" ,
author    =    " McGuckin, P." ,
title    =    " Rites of Passage" ,
journal    =    "UNIX Review" ,
pages    =    "48--54" ,
month    =    "aug" ,
year    =    1989 ,
annote    =    "Presents a very superficial view of translation,
some details on a DB2 to ORACLE link." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( MCLEOD82,
key    =    "McLeod" ,
author    =    "McLeod, Dennis and King, Roger" ,
title    =    "The Event Database Specification Model" ,
booktitle=    "From the proceedings of the Second International
Conference on Databases: Improving Usability and Responsiveness, June
22-24, 1982, Jerusalem, Israel." ,
organization=    "Department of Computer Science University of
Southern California" ,
address    =    "Los Angeles, California" ,
month    =    "June" ,
year    =    "1982" ,
pages    =    "1--24" ,
abstract=    "The event database specification model (event
model) provides a unified approach to the life-cycle of a database by
providing conceptual schema design, data manipulation, and schema
evolution constructs within an integrated framework. The event model
includes a prescriptive, stepwise logical database design and
evolution methodology, the purpose of which is to guide a database
designer in the complex task of specifying and maintaining a
semantically-expressive schema. The event model provides a foundation
for structured database design and documentation, as well as
establishing a basis for a (partially) automated database
specification system. A prototype database specification system has
been implemented and is in use on an experimental basis." ,
bibdate    =    "Mon Jul 14 13:01:44 1986" ,
owner    =    "manning" ,
)

@inproceedings    ( MCLEOD83,
key    =    "McLeod et al" ,
author    =    "McLeod, D. and Narayanaswamy, K. and Bapa Rao, K.
V." ,
title    =    "An Approach to Information Management for CAD/VLSI
Applications" ,
booktitle=    "Proceedings of the ACM-SIGMOD International
Conference on the Management of Data" ,
address    =    "San Jose, CA" ,
month    =    "may" ,
year    =    "1983" ,
abstract=    "CAD/VLSI and software engineering are
representatives of a class of application environments that present
challenging information management problems. A generalized view of the
CAD/VLSI design process is taken, allowing arbitrary design
iterations. This leads to a need to maintain alternate realizations of
functional specifications over the entire developmental life cycle of
a chip. The specific information management requirements of such an
environment are analyzed in detail. A conceptual schema for a database
to meet these requirements, using a semantic database model is
described. The implementation of such a database using a relational
database management system (DBMS) is examined. Conclusions are
presented regarding the suitability of semantic database models and
the relational model as tools to meet the information management
requirements characteristics of the CAD/VLSI environment." ,
bibdate    =    "Wed Dec 13 10:37:07 1989" ,
owner    =    "robyn" ,
)

@article    ( MCLEOD85,
key    =    "McLeod \& Widjojo" ,
author    =    "McLeod, Dennis and Widjojo, Surjatini" ,
title    =    "Object Management and Sharing in Autonomous,
Distributed Data/Knowledge Bases" ,
journal    =    "Database Engineering. Special Issue on
Object-Oriented Systems" ,
year    =    "1985" ,
volume    =    "8" ,
number    =    "4" ,
pages    =    "83--89" ,
month    =    "December" ,
)

@inproceedings    ( MCLEOD89,
key    =    "McLeod" ,
author    =    "McLeod, D." ,
title    =    "Panel on Future Directions in DBMS Research" ,
booktitle=    "Proc. Int. Conf. on Very Large Data Bases" ,
month    =    "mar" ,
year    =    "1989" ,
pages    =    "27--30" ,
bibdate    =    "Mon Oct 23 10:51:26 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( MEIER83,
key    =    "Meier \& Lorie" ,
author    =    "Meier, Andreas and Lorie, Raymond A." ,
title    =    "A Surrogate Concept for Engineering Databases" ,
booktitle=    "Proceedings of the Eighth International Conference
on Very large Data Bases" ,
year    =    "1983" ,
pages    =    "30--32" ,
month    =    "September" ,
)

@techreport    ( MELDAL91,
key    =    "Meldal et al" ,
author    =    "Meldal, Sigurd and Sriram Sankar and James Vera" ,
title    =    "Exploiting Locality in Maintaining Potential
Causality" ,
number    =    "CSL-TR-91-466" ,
institution=    "Computer systems Laboratory Stanford University" ,
year    =    "1991" ,
month    =    "Apr" ,
pages    =    "22" ,
keywords=    "Distributed computing, event-based simulation,
potential causality, partial order, vector time, locality" ,
abstract=    "In distributed systems it is opften important to
be able to determine the temporal relationships between events
generated by different processes. An alogrithm to determine such
relationships is presented in [3] and [5]. This algorithm has many
favorable attributes such as it allows for any kind of interprocess
communication, and it requires no extra synchronization messages,
aditional communication links or central timestamping autority. The
algorithm, however, requires O(n) space for each process ( where n is
the number of processes). i.e., it requires an overal space of O(n^2).
This can be a large overhead especially when there are a very large
number of processes. By cutting down on this generality, we can
significantly decreaase the amount of space requirements by assuming
that the communication links between processes is static and known
ahead of time; and also that one is interested only in determining the
temporal ordering between messages arriving at the same process. We
argue that these assumptions are reasonable to make for a large calss
of problems." ,
bibdate    =    "Mon Nov 25 09:54:13 1991" ,
owner    =    "suchen" ,
)

@manual        ( MELTON90,
key    =    "Melton" ,
title    =    "Solicitation of Comments: Database Language SQL2" ,
author    =    "Melton, J. (ed.)" ,
year    =    "1990" ,
month    =    "jul" ,
organization=    "American National Standards Institute" ,
address    =    "Washington, DC" ,
keywords=    "standard" ,
bibdate    =    "Mon Jun 24 21:35:56 1991" ,
owner    =    "bib" ,
)

@book        ( MELTON93,
key    =    "Melton \& Simon" ,
author    =    "Melton, J. and Simon, A. R." ,
title    =    "Understanding the New SQL: A Complete Guide" ,
publisher=    "Morgan Kaufmann Publishers, Inc." ,
address    =    "San Mateo, CA" ,
year    =    "1993" ,
bibdate    =    "Mon Oct 28 08:45:34 1991" ,
owner    =    "curtis" ,
)

@article    ( MENDELSON80,
key    =    "Mendelson" ,
author    =    "Mendelson, H." ,
title    =    "A New Approach to the Analysis of Linear Probing
Schemes" ,
journal    =    "jacm" ,
volume    =    "27" ,
number    =    "2" ,
month    =    "jul" ,
year    =    "1980" ,
pages    =    "474--483" ,
bibdate    =    "Sat Apr 27 22:59:49 1985" ,
)

@article    ( MENDELSON82,
key    =    "Mendelson" ,
author    =    "Mendelson, H." ,
title    =    "Analysis of Extensible Hashing" ,
journal    =    "tse" ,
volume    =    "8" ,
number    =    "6" ,
month    =    "nov" ,
year    =    "1982" ,
pages    =    "611--619" ,
bibdate    =    "Fri May 24 15:37:34 1985" ,
)

@article    ( MERCURO90,
key    =    "Mercuro et al." ,
author    =    "Mercuro, V. J. and Meyers, B. F. and Nisbet, A. M.
and Radin, G." ,
title    =    "AD/Cycle Strategy and Architecture" ,
journal    =    "IBM Systems Journal" ,
publisher=    "ibm" ,
volume    =    "29" ,
number    =    "2" ,
year    =    "1990" ,
pages    =    "170--188" ,
bibdate    =    "Tue May 18 17:28:50 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( MERRETT77,
key    =    "Merrett" ,
author    =    "Merrett, T." ,
title    =    "Database Cost Analysis: A Top-Down Approach" ,
booktitle=    "sigmod" ,
volume    =    "7" ,
month    =    "aug" ,
year    =    "1977" ,
pages    =    "135--143" ,
bibdate    =    "Fri Apr 26 23:47:05 1985" ,
)

@article    ( MERRETT88,
key    =    "Merrett \& Hamel" ,
author    =    "Merrett, T.H. and Hamel, L." ,
title    =    "Dynamic Multipaging in Even Less Space" ,
journal    =    "SIGMod Record" ,
publisher=    "acm" ,
volume    =    "17" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1988" ,
pages    =    "56--61" ,
keywords=    "disk storage; file organization; multiattribute
search; orthogonal range queries" ,
abstract=    "We present an improvement to the directory
structure of dynamic multipaging which reduces the overall storage
requirements from the outstanding advantage of multipaging is that it
provides multiattribute access to a database file using directories of
negligible size. The present improvment make the directory size even
more negligible and the addressing algorithm easier." ,
bibdate    =    "Wed Feb  8 10:48:48 1989" ,
owner    =    "payne" ,
)

@inproceedings    ( MEYDEN92,
key    =    "van der Meyden" ,
author    =    "van der Meyden, R." ,
title    =    "The Complexity of Querying Indefinite Data about
Linearly Ordered Domains (Preliminary Version)" ,
booktitle=    "pods" ,
address    =    "San Diego, CA" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "331--345" ,
abstract=    "In applications dealing with ordered domains, the
available data is frequently indefinite. While the domain is actually
linearly ordered, only some of all the order relations holding between
points in the data are known. Thus, the data provides only a partial
order, and query answering involves determining what holds under all
the compatible linear orders. In this paper we study the complexity of
evaluating queries in logical databases containing such indefinite
information. This problem is related to the problem of containment of
relational queries containing inequalities. One of our results implies
that the latter is $\Pi_2^p$-complete, solving an open problem. In
general, even data complexity is intractable. We identify a number of
tractable (PTIME) sub-problems. Data complexity in the case of monadic
predicates is one of these PTIME problems, but for disjunctive queries
the proof is nonconstructive, using well-quasi-order techniques." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@phdthesis    ( MISHKIN84,
key    =    "Mishkin" ,
author    =    "Mishkin, N. W." ,
title    =    "Managing Permanent Objects" ,
school    =    "Yale University" ,
year    =    "1984" ,
abstract=    "This work describes a programming system that
facilitates the management of data objects that live across multiple
invocations of programs that read and modify those objects; we call
such data objects 'permanent objects'. Typically, programmers needing
to save data objects permanently do so either (1) by writing an ad hoc
set of procedures that convert their data from some internal
representation to some external representation (and back), or (2) by
interfacing their programs with an existing database system. We
discuss the problems encountered by a programmer adopting either of
these strategies, and we describe our system whose design is an
attempt to strike a balance between the flexibility of the ad hoc
approach and the rigidity of the approach that employs a database. A
key goal of our work is the design and implementation of a system that
makes the manipulation of permanent objects nearly as easily and
flexible as the manipulation of 'transient' objects -- i.e. the memory
resident data structures that programmers are accustomed to dealing
with. We wish to hide the details associated with the fact that
permanent objects must have their permanent home in a disk file
system. Our system is written in T, a dialect of Scheme, which is in
turn a dialect of Lisp and runs on the Apollo workstation. The system
provides tools to make it relatively easy to write T programs that
manipulate these permanent objects. A secondary goal of our work is to
support distributed computing by allowing multiple processors to have
access to permanent objects. While the system does not address all the
issues associated with distributed computing, we believe that the
mechanisms provided can be effectively used in the course of solving
certain problems in a distributed way." ,
bibdate    =    "Tue Mar  9 20:49:52 1993" ,
owner    =    "bassili" ,
)

@article    ( MISHRA92,
key    =    "Mishra \& Eich" ,
author    =    "Mishra, P. and Eich, M." ,
title    =    "Join Processing in Relational Databases" ,
journal    =    "compsurv" ,
volume    =    "24" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1992" ,
pages    =    "63--113" ,
abstract=    "The join operation is one of the fundamental
relational database query operations. It facilitates the retrieval of
information from two different relations based on a Cartesian product
of the two relations. The join is one of the most difficult operations
to implement efficiently, as no predefined links between relations are
required to exist (as they are with network and hierarchical systems).
The join is the only relational algebra operation that allows the
combining of related tuples from relations on different attribute
schemes. Since it is executed frequently and is expensive, much
research effort has been applied to the optimization of join
processing. In this paper, the different kinds of joins and the
various implementation techniques are surveyed. These different
methods are classified based on how they partition tuples from
different relations. Some require that all tuples from one be compared
to all tuples from another; other algorithms only compare some tuples
from each. In addition, some techniques perform an explicit
partitioning, whereas others are implicit." ,
keywords=    "algorithms, database machines, distributed
processing, join, parallel processing, relational algebra" ,
bibdate    =    "Sun May  3 20:06:21 1992" ,
owner    =    "soo" ,
)

@article    ( MISHRA92A,
key    =    "Mishra \& Eich" ,
author    =    "Mishra, P. and Eich, M." ,
title    =    "Functional Completeness in Object-Oriented
Databases" ,
journal    =    "sigmod" ,
volume    =    "21" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1992" ,
pages    =    "71--83" ,
abstract=    "A definition of completeness in the context of
Object Oriented Databases (OODBs) is proposed in this paper. It takes
into account the existence of various categories of functions in
OODBs, each of which must be complete in itself. The functionality of
an OODB can be divided into sets of related functions. For example,
functions needed to perform all schema evolution operations or all
version management operations belong in two distinct sets. Further,
each set of functions must include all functions needed to perform all
operations defined for that set. Thus, for an OODB to be functionally
complete, it must support a certain number of sets (or categories) of
functions and each such set must be complete in itself. The purpose of
this paper is not to give a precise definition of the categories of
functions but rather to define a framework within which such
categories should be examined. This paper contains a working
definition of functional completeness. We would welcome any feedback
on our proposal." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@techreport    ( MITCHELL91,
key    =    "Mitchell et al" ,
author    =    "Mitchel, John and Sigurd Meldal and Neel Madhav" ,
title    =    "An extension of Standard ML modules with subtyping
and inheritance" ,
number    =    "CSL-TR-91-472" ,
institution=    "Computer Systems Laboratory, Departments of
Electrical Engineering and Computer Science Standford University" ,
year    =    "1991" ,
month    =    "May" ,
pages    =    "18" ,
keywords=    "Abstract daya type, class, higher-order type,
implemetation, inheritance, module, object, object-oriented,
polymorphism, signature, specificaiton, Standard ML, subtype, type." ,
abstract=    (We describe a general module language integrating
abstract data types, specifications and object-oriented concepts.. The
framework is based on the Standard ML module system, with three main
extensions: subtyping, a form of object derived from ML structures,
and inheritance primtives. The language aims at supporting a range of
programming styles, including mixtures of object-oriented programming
and programs built around specified algebraic or higher-order abstract
data types. We separate specification from implementation, and provide
independent inheritance mechanisms for each. In order to support
binary operations on objects within this framework, we introduce
"internal interfaces" which govern the way that function components of
one structure may access components of another. The language design
has been tested by writing a number of program examples; an
implementation is under development in the context of a laarger
project.) ,
bibdate    =    "Thu Nov 21 15:16:23 1991" ,
owner    =    "suchen" ,
)

@inproceedings    ( MITTAL81,
key    =    "Mittal \& Chandrasekaran" ,
author    =    "Mittal, S. and Chandrasekaran, B." ,
title    =    "Software Design of Knowledge Directed Database
Systems" ,
booktitle=    "Proceedings of the 1st Conference on Foundation of
Software Technology and Theoretical Computer Science" ,
address    =    "Bangalore, India" ,
editor    =    "Shyamasundar, R.K. and Joseph, M." ,
month    =    "dec" ,
year    =    "1981" ,
pages    =    "87--98" ,
abstract=    "The complexity of designing software for managing
'real world' databases has made it essential to look for ways to
incorporate more knowledge about the application domain in the data
model. We are developing a methodology for incorporating domain
knowledge in performing the following data management tasks:
acquisition and processing of data; retrieval and inference of data;
and design of application-oriented query specialists. Some aspects of
this methodology are discussed by considering the design and
performance of a medical data base system called PATREC. This system
has extensive knowledge about the relevant medical data entities and
uses this knowledge to acquire and organize data about patients and to
answer a variety of questions such as those typically asked by
attending physicians. Most importantly it uses inferential knowledge
embedded in the underlying knowledge base to make 'reasonable'
assumptions during the acquisition of data and to generate answers
when corresponding data are not explicitly stored in the data base.
While this data base system is an experimental vehicle using a variety
of state-of-the-art AI representational techniques, it is in fact
extensively used by an automated diagnosis system called MDX." ,
bibdate    =    "Mon Mar 25 13:06:19 1985" ,
)

@article    ( MITTAL84,
key    =    "Mittal et al." ,
author    =    "Mittal, S. and Chandrasekaran, B. and Sticklen, J." ,
title    =    "Patrec: A Knowledge-Directed Database for a
Diagnostic Expert System" ,
journal    =    "Computer" ,
volume    =    "17" ,
number    =    "9" ,
month    =    "September" ,
year    =    "1984" ,
pages    =    "51--58" ,
abstract=    "Patrec is one component in a cluster of
knowledge-based medical expert systems developed at Ohio State
University. This system holds extensive knowledge on relevant medical
data entries: it uses this knowledge to acquire and organize data
about patients and to answer questions about patient data needed for
diagnostic reasoning. The most important feature of Patrec is its
underlying knowledge base, to generate answers when corresponding data
are not explicitly stored in the database. In addition, Patrec can
handle some temporal aspects of the data and answer questions
regarding the temporal relationships of events." ,
annote    =    "The temporal component of Patrec uses the ideas of
(1) event cluster, where several events are collapsed into one point
in time; (2) domain-specific key events; and, (3) imprecisions.
Securities are used to answer 3 forms of questions: (1) When did event
occur? (2) Did patient have Y during temporal description of time
duration? (3) Did Y occur within interval T of 7?" ,
bibdate    =    "Thu Sep 20 13:05:28 1984" ,
)

@inproceedings    ( MOERKOTTE93,
key    =    "Moerkotte \& Zachmann" ,
author    =    "Moerkotte, G. and Zachmann, A." ,
title    =    "Toward More Flexible Schema Management in Object
Bases" ,
booktitle=    "Ninth International Conference on Data Engineering" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "Vienna, Austria" ,
month    =    "apr" ,
year    =    "1993" ,
pages    =    "174--181" ,
abstract=    "There exists a current trend in database
technology to make databases more extensible and flexible, or even to
generate databases for specific customer needs. So far, schema
management and especially schema evolution have been excluded from
this trend. In this paper, we propose a new approach to schema
management and topics centered around it, like schema consistency and
schema evolution. This approach allows easy tailoring of schema
management, high-level specification of schema consistency and
development of advanced tools supporting the user during schema
evolution." ,
bibdate    =    "Mon May 17 18:32:50 1993" ,
owner    =    "bassili" ,
)

@techreport    ( MOHAN84,
key    =    "Mohan" ,
author    =    "Mohan, C." ,
title    =    "Recent and Future Trends in Distributed Data Base
Management" ,
type    =    "Research Report" ,
number    =    "RJ 4240" ,
institution=    "IBM" ,
year    =    "1984" ,
month    =    "may" ,
abstract=    "Distributed data base systems promise better
functionality and performance than conventional centralized data base
systems. Distributed data base management technology has reached a
mature state, especially during the last five years. We are at a stage
where we can hope to see the fruits of this research reflected in the
product offerings of the commercial arena in the next five years. In
this paper, I present comparative analyses of different features of
many distributed data base management system prototypes, and
algorithms for distributed query processing. I discuss some of the
trends in the research on distributed data base management. I make an
attempt to predict what might happen in the coming years." ,
bibdate    =    "Tue Mar  5 09:41:28 1985" ,
)

@article    ( MOHAN86,
key    =    "Mohan et al." ,
author    =    "Mohan, C. and Lindsay, B. and Obermarck, R." ,
title    =    "Transaction Management in the R* Distributed
Database Management System" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "11" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1986" ,
pages    =    "378--396" ,
keywords=    "Algorithms; design; reliability; commit protocols;
deadlock victim selection" ,
abstract=    "This paper deals with the transaction management
aspects of the R* distributed database system. It concentrates
primarily on the description of the R* commit protocols, Presumed
Abort (PA) and Presumed Committ (PC). PA and PC are extensions of the
well-known, two-phase (2P) commit protocol. PA is optimized for
read-only transactions and a class of multisite update transactions,
and PC is optimized for other classes of multisite update
transactions. The optimizations result in reduced intersite message
traffic and log writes, and consequently, a better response time. The
paper also discusses R*'s approach toward distributed deadlock
detection and resolution." ,
bibdate    =    "Fri Feb 20 12:38:16 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( MOHAN92,
key    =    "Mohan et al." ,
author    =    "Mohan, C. and Pirahesh, H. and Lorie, R." ,
title    =    "Efficient and Flexible Methods for Transient
Versioning of Records to Avoid Locking by Read-Only Transactions" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "San Diego, California" ,
editor    =    "Stonebraker, M." ,
volume    =    "21" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "124--133" ,
abstract=    "We present efficient and flexible methods which
permit read-only transactions that do not mind reading a possibly
slightly old, but still consistent, version of the data base to
execute without acquiring locks. This approach avoids the undesirable
interferences between such queries and the typically shorter update
transactions that cause unnecessary and costly delays. Indexed access
by such queries is also supported, unlike by the earlier methods. Old
versions of records are maintained only in a transient fashion. Our
methods are characterized by their flexibility (number of version
maintained and the timing of version switches, supporting partial
rollbacks, and different recovery and buffering methods) and their
efficiency (logging, garbage collection, version selection, and
incremental, record-level versioning). Distributed data base
environments are also supported, including commit protocols with the
read-only optimization. We also describe efficient methods for garbage
collecting unneeded older versions." ,
bibdate    =    "Mon Jan 25 13:35:57 1993" ,
owner    =    "bassili" ,
)

@inbook        ( MONTAGUE73,
key    =    "Montague" ,
author    =    "Montague, R." ,
title    =    "The proper treatment of quantification in ordinary
English" ,
publisher=    "D. Reidel Publishing Co." ,
address    =    "Dordrecht, Holland" ,
year    =    "1973" ,
booktitle=    "Approaches to Natural Language" ,
bibdate    =    "Fri Oct  7 22:58:59 1983" ,
)

@article    ( MORRIS68,
key    =    "Morris" ,
author    =    "Morris, R." ,
title    =    "Scatter Storage Techniques" ,
journal    =    "cacm" ,
volume    =    "11" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1968" ,
pages    =    "38--43" ,
bibdate    =    "Mon Jun  2 16:07:31 1986" ,
owner    =    "ahn" ,
)

@inproceedings    ( MOSS87,
key    =    "Moss" ,
author    =    "Moss, J. E. B." ,
title    =    "Log-Based Recovery for Nested Transactions" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
year    =    "1987" ,
pages    =    "427--432" ,
abstract=    "Techniques similar to shadow pages have been
suggested for use in rollback and crash recovery for nested
transactions. However, undo/redo log methods have not been presented,
though undo/redo logs are widely used for transaction recovery, and
perhaps preferable to shadow methods. We develop a scheme of log-based
recovery for nested transactions. The resulting design is promising
because it requires a relatively small number of extensions to a
similar scheme of recovery for single-level transactions." ,
bibdate    =    "Fri Jan 19 10:32:05 1990" ,
owner    =    "robyn" ,
)

@techreport    ( MOSS89,
key    =    "Moss" ,
author    =    "Moss, J. E. B." ,
title    =    "Addressing Large Distributed Collections of
Persistent Objects: The Mneme Project's Approach" ,
type    =    "Coins Technical Report" ,
number    =    "89-68" ,
institution=    "University of Massachusetts at Amherst" ,
address    =    "Amherst, MA 01003" ,
year    =    "1989" ,
month    =    "jun" ,
abstract=    "The Mneme persistent object store project has as
one of its primary goals to support cooperative, concurrent, and
reliable use of large, distributed collections of objects. In our
case, distribution is intended to mean not only physical dispersion,
but also some autonomy or independence of subcollections of
objects---that is, the object space is under some degree of
decentralized management. Providing independence of subcollections of
objects has interesting implications as to how to address and retrieve
objects efficiently. Here we describe the need for and benefits of
independent subcollections of objects, examine the addressing
implications, and show how these implications have affected the design
of Mneme. Most particularly, we argue against the appropriateness of a
large flat store of bytes or even of object identifiers, and in favor
of richer, more flexible, structures. We also contend that comparable
performance can be acheived by careful implementation of the richer
structures, with considerably more functionality and flexibility than
flat structures provide. The cost is increased complexity of the
supporting software." ,
bibdate    =    "Mon Oct  7 15:11:30 1991" ,
owner    =    "soo" ,
)

@techreport    ( MOSS89A,
key    =    "Moss" ,
author    =    "Moss, J." ,
title    =    "The Mneme Persistent Object Store" ,
type    =    "Coins Technical Report" ,
number    =    "89-107" ,
institution=    "University of Massachusetts, Amherst" ,
year    =    "1989" ,
month    =    "oct" ,
abstract=    "The Mneme project is an investigation of
techniques for integrating programming language and database features
to provide better support for cooperative, information-intensive tasks
such as computer aided software engineering. We report here on the
Mneme persistent object store, discussing the original design, the
construction of the initial prototype, and approaches being considered
for the next prototype. Mneme stores objects, with a simple and
general format, and preserves the identity of the objects and their
structural relationships. Mneme's goals include portability,
extensibility (especially with respect to object management policies),
and low overhead. The model of memory that Mneme aims to present is a
single, cooperatively shared heap, distributed across a collection of
networked computers." ,
bibdate    =    "Sun Nov 17 20:00:02 1991" ,
owner    =    "soo" ,
)

@inproceedings    ( MOTRO84,
key    =    "Motro" ,
author    =    "Motro, A." ,
title    =    "Browsing in a Loosely Structured Database" ,
booktitle=    "Proceedings of the ACM SIGMOD '84" ,
year    =    "1984" ,
pages    =    "197--207" ,
month    =    "" ,
)

@inproceedings    ( MOTRO84B,
key    =    "Motro 1984" ,
author    =    "Motro, A." ,
title    =    "Query Generalization: A Technique for Handling
Query Failure" ,
booktitle=    "Proceedings of the First International Workshop on
Expert Database Systems" ,
month    =    "oct" ,
year    =    "1984" ,
pages    =    "314--325" ,
bibdate    =    "Wed May 17 17:02:21 1995" ,
owner    =    "rts" ,
)

@inproceedings    ( MOTRO86,
key    =    "Motro" ,
author    =    "Motro, A." ,
title    =    "Completeness Information and Its Application to
Query Processing" ,
booktitle=    "Proceedings of the Twelfth International
Conference on Very Large Data Bases" ,
year    =    "1986" ,
pages    =    "170--178" ,
month    =    "August" ,
)

@inproceedings    ( MOTRO86A,
key    =    "Motro" ,
author    =    "Motro, A." ,
title    =    "Query Generalization: A Method for Interpreting
Null Answers" ,
booktitle=    "Expert Database Systems" ,
year    =    "1986" ,
pages    =    "597--616" ,
)

@article    ( MOTRO87,
key    =    "Motro" ,
author    =    "Motro, A." ,
title    =    "Superviews: Virtual Integration of Multiple
Databases" ,
journal    =    "tose" ,
publisher=    "ieee" ,
volume    =    "SE-13" ,
number    =    "7" ,
month    =    "jul" ,
year    =    "1987" ,
pages    =    "785--798" ,
keywords=    "Database; database integration; database view;
multidatabase environment; query mapping; superview; virtual database" ,
abstract=    "An important advantage of a database system is
that it provides each application with a custom view of the data. The
issue addressed in this paper is how to provide such custom views to
applications that access multiple databases. The paper describes a
formal method that generates such superviews, in an interactive
process of schema editing operations. A mapping of the superview into
the individual databases is derived from the editing process, and is
stored together with the superview as a virtual database. When this
database is interrogated, the mapping is used to decompose each query
into a set of queries against the individual databases, and recompose
the answers to form an answer to the original query. As this process
is transparent to the user, virtual databases may be regarded as a
more general type of databases. A prototype database system, that
allows users to construct virtual databases and interrogate them, has
been developed." ,
bibdate    =    "Wed Jul  1 14:41:40 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( MOTRO88,
key    =    "Motro" ,
author    =    "Motro, A. and D'Atri, A. and Tarantino, L." ,
title    =    "The Design of KIVIEW: An Object-Oriented Browser" ,
booktitle=    "Proceedings from the Second International
Conference on Expert Database Systems (NB. check this one)" ,
year    =    "1988" ,
pages    =    "107--131" ,
)

@article    ( MOTRO90,
key    =    "Motro" ,
author    =    "Motro, A." ,
title    =    "FLEX: A Tolerant and Cooperative User Interface to
Databases" ,
journal    =    "tkde" ,
volume    =    "2" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1990" ,
pages    =    "231--246" ,
abstract=    "FLEX is a user interface to relational databases
that can be used satisfactorily by users with different levels of
expertise. FLEX is based on a formal query language, but is tolerant
of incorrect input. It never rejects queries; instead, it adapts
flexibly and transparently to their level of correctness and
well-formedness, providing interpretations of corresponding accuracy
and specificity. The most prominent design feature of FLEX is the
smooth concatenation of several independent mechanisms, each capable
of handling input of decreasing level of correctness and
well-formedness. Each input is 'cascaded' through this series of
mechanisms, until an interpretation if found. FLEX is also
cooperative. It never delivers empty answers without explanation or
assistance. By following up each failed query with a set of more
general queries, FLEX determines whether an empty answer is genuine
(it then suggests related queries that have nonempty answers), or
whether it reflects erroneous presuppositions on behalf of the user
(it then explains them)" ,
bibdate    =    "Tue Nov 27 10:15:37 1990" ,
owner    =    "robyn" ,
)

@article    ( MUCK89,
key    =    (M\"{u}ck \& G\"{u}nther ) ,
author    =    (M\"{u}ck, Thomas and Vinek, G\"{u}nther) ,
title    =    "Modeling Dynamic Constraints Using Augmented Place
Transition Nets" ,
journal    =    "Information Systems" ,
year    =    "1989" ,
volume    =    "14" ,
number    =    "4" ,
pages    =    "327--340" ,
month    =    "" ,
)

@article    ( MUECK95,
key    =    "Mueck \& Schauer" ,
author    =    "Mueck, T. A. and Schauer, M. J." ,
title    =    "Optimizing Sort Order Query Execution in Balanced
and Nested Grid Files" ,
journal    =    "tkde" ,
publisher=    "ieee" ,
volume    =    "7" ,
number    =    "2" ,
month    =    "apr" ,
year    =    "1995" ,
pages    =    "246--260" ,
bibdate    =    "Wed Jan 10 16:30:02 1996" ,
abstract=    "Disk input/output (I/O) efficient query execution
is an important topic with respect to DBMS performance. In this
context, we elaborate on the construction of disk access plans for
sort order queries in balanced and nested grid files. The key idea is
to use the order information contained in the directory of the
multiattribute search structure. The presented algorithms are shown to
yield a significant decrease in the number of disk I/O operations by
appropriate use of the order information. Two algorithms for the
construction of appropriate disk access plans are proposed, namely a
greedy approach and a heuristic divide-and-conquer approach. Both
approaches yield considerable I/0 savings compared to straightforward
query processing without consideration of any directory order
information. The former performs well for small buffer page
allocations, i.e., for a small number of buffer pages relative to the
number of data buckets processed in the query. The latter is superior
to the greedy algorithm with respect to the total number of I/O
operations and with respect to the overall maximum of buffer pages
needed to achieve the minimal number of disk I/0 operations. Both
approaches rely on a binary trie as a temporary data structure. This
trie is used as an explicit representation of the order information.
The storage consumption of the temporary data structure is shown to be
negligible in realistic cases. Even for pathological cases with
respect to degenerated balanced and nested grid files, reasonable
upper bounds can be given." ,
owner    =    "jeff" ,
)

@inproceedings    ( MUELLER83A,
key    =    "Mueller et al." ,
author    =    "Mueller, E.T. and Moore, J.D. and Popek, G.J." ,
title    =    "A Nested Transaction Mechanism for LOCUS" ,
booktitle=    "sosp" ,
organization=    "acm" ,
publisher=    "acm" ,
address    =    "Bretton Woods, NH" ,
month    =    "oct" ,
year    =    "1983" ,
pages    =    "71--89" ,
abstract=    "Atomic transactions are useful in distributed
systems as a means of providing reliable operation in the face of
hardware failures. Nested transactions are a generalization of
traditional transaction in which transactions may be composed of other
transactions. The programmer may initiate several transactions from
within a transaction, and serializability of the transactions is
guaranteed even if they are executed concurrently. In addition,
transactions invoked from within a given transaction fail
independently of their invoking transaction and of one another,
allowing use of alternate transactions to accomplish the desired task
in the event that the original should fail. Thus nested transactions
are the basis for a general-purpose reliable programming environment
in which may be composed freely. A working implementation of nested
transactions has been produced for LOCUS, an integrated distributed
operating system which provides a high degree of network transparency.
Several aspects of our mechanism are novel. First, the mechanism
allows a transaction to access objects directly without regard to the
location of the object. Second, processes running on behalf of a
single transaction may be located at many sites. Thus there is no need
to invoke a new transaction to perform processing or access objects at
a remote site. Third, unlike other environments, LOCUS allows
replication of data objects at more than one site in the network, If
the copy of an object that is currently being accessed becomes
unavailable, it is possible to continue work by using another one of
the replicated copies. Finally, an efficient orphan removal algorithm
is presented, and the problem of providing continued operation during
network partitions is addressed in detail." ,
bibdate    =    "Fri Feb  1 13:06:47 1985" ,
)

@article    ( MUKKAMALA91,
key    =    "Mukkamala91" ,
author    =    "Mukkamala, R. and Jajodia, S." ,
title    =    "Technical Note: A Note on Estimating the
Cardinality of the Projection of a Database Relation" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "16" ,
number    =    "3" ,
month    =    "september" ,
year    =    "1991" ,
pages    =    "564-566" ,
abstract=    "The paper by Ahad et al. derives an analytical
expression to estimate the cardinality of the projection of a database
relation. In this note, we propose to show that this expression is in
error even when all the parameters are assumed to be constant. We
derive the correct formula for this expression." ,
bibdate    =    "Mon Nov  4 11:50:02 1991" ,
owner    =    "kline" ,
)

@inproceedings    ( MULLEN84,
key    =    "Mullen" ,
author    =    "Mullen, J." ,
title    =    "Unified Dynamic Hashing" ,
booktitle=    "vldb" ,
month    =    "aug" ,
year    =    "1984" ,
pages    =    "473--480" ,
bibdate    =    "Fri Jun  7 17:48:15 1985" ,
)

@techreport    ( MURALIKRISHNA88,
key    =    "Muralikrishna \& DeWitt" ,
author    =    "Muralikrishna, M. and DeWitt, D.J." ,
title    =    "Optimization of Multiple-Relation
Multiple-Disjunct Queries" ,
number    =    "740" ,
institution=    "Computer Science Department" ,
address    =    "University of Wisconsin-Madison" ,
year    =    "1988" ,
month    =    "jan" ,
pages    =    "1--17" ,
abstract=    "In this paper we discuss the optimization of
multiple-relation multiple-disjunct queries in a relational database
system. Since optimization techniques for conjunctive-single
disjunct-queries in relational databases are well known [Smith75,
Wong76, Selinger79, Yao79 Youssefi79], the natural way to evaluate a
multiple-disjunct query was to execute each disjunct independently
[Bernstein81, Kerschberg82]. However, evaluating each disjunct
independently may be very inefficient. In this paper, we develop
methods that merge two or more disjuncts to form a term. The advantage
of merging disjuncts to form terms lies in the fact that each term can
be evaluated with a single scan of each relation that is present in
the term. In addition, the number of times a join is performed will
also be reduced when two or more disjuncts are merged. The criteria
for merging a set of disjuncts will be presented. As we will see, the
number of times each relation in the query is scanned will be equal to
the number of terms. Thus, minimizing the number of terms will
minimize the number of scans for each relation. We will formulate the
problem of minimizing the number of scans as one of covering a merge
graph by a minimum number of complete merge graphs which are a
restricted class of cartesian product graphs. In general, the problem
of minimizing the number of scans is NP-complete. We present
polynomial time algorithms for special classes of merge graphs. We
also present a heuristic for general merge graphs. Throughout this
paper, we will assume that no relations have any indices on them and
that we are only concerned with reducing the number of scans for each
relation present in the query. What about relations that have indices
on them? It turns out that our performance metric of reducing the
number of scans is beneficial even in the case that there are indices.
In [Muralikrishna88] we demonstrate that when optimizing
single-relation multiple-disjunct queries, the cost-measured in terms
of disk accesses) may be reduced if all the disjuncts are optimized
together rather than individually. Thus, our algorithm for minimizing
the number of terms is also very beneficial in cases where indices
exist." ,
bibdate    =    "Thu Jul 14 17:12:19 1988" ,
owner    =    "payne" ,
)

@techreport    ( MURALIKRISHNA88A,
key    =    "Muralikrisha" ,
author    =    "Muralikrishna, M." ,
title    =    "Optimization of Multiple-Disjunct Queries in a
Relational Database System" ,
number    =    "750" ,
institution=    "Department of Computer Science" ,
address    =    "University of Wisconsin-Madison" ,
year    =    "1988" ,
month    =    "feb" ,
pages    =    "1--116" ,
abstract=    "In this thesis, we describe the optimization of
arbitrarily complex queries expressed in relational calculus. The
qualification list is allowed to be any complex boolean expression
involving both ANDs and ORs. In other words, the qualification list
may have an arbitrary number of disjuncts. The query graph of each
disjunct may also have any number of components. Optimizing the
various disjuncts independently of each other can be very inefficient.
Considerable savings in cost can be achieved by optimizing the various
disjuncts together. In a multiple-relation multiple-disjunct query, it
may be possible to combine two or more disjuncts into one term. This
will cut down the number of scans on each relation and also the number
of times each join is performed. The objective will be to merge the
disjuncts into the minimum number of terms. Minimizing the number of
terms can be formulated as the problem of covering a merge graph with
the minimum number of complete merge graphs, which are a restricted
class of cartesian product graphs. The problem of minimizing the
number of terms is NP-complete. We present polynomial time algorithms
for special classes of merge graphs. We provide a heuristic for
general merge graphs. For single-relation multiple-disjunct queries
involving more than one attribute, an optimal access path might
consist of more than one index. The cost in our optimization model,
for single relation queries, is measured in terms of the number of
pages fetched from disk. We will formulate the problem of finding a
set of optimal access paths for a single-relation multiple-disjunct
query as one of finding a minimum weighted vertex cover in a
hypergraph. Finding the cheapest vertex cover in a hypergraph is
NP-complete. We present a new approximation algorithm that gives near
optimal vertex covers for random hypergraphs over a wide range of edge
probabilities. We also demonstrate the usefulness of equi-depth
multi-dimensional histograms in optimizing queries using
multi-dimensional indices." ,
bibdate    =    "Fri Jul 15 10:55:27 1988" ,
owner    =    "payne" ,
)

@article    ( MYLOPOULOS80,
key    =    "Mylopoulos et al." ,
author    =    "Mylopoulos, J. and Bernstein, P.A. and Wong,
H.K.T." ,
title    =    "A Language Facility for Designing Interactive
Database-Intensive Applications" ,
journal    =    "tods" ,
publisher=    "acm" ,
month    =    "jun" ,
year    =    "1980" ,
bibdate    =    "Mon Feb  2 13:52:19 1987" ,
owner    =    "manning" ,
)

@article    ( NAKANO90,
key    =    "Nakano" ,
author    =    "Nakano, R." ,
title    =    " Translation with Optimization from Relational
Calculus to Relational Algebra Having Aggregate Functions" ,
journal    =    "tods" ,
volume    =    "15" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1990" ,
pages    =    "518--557" ,
keywords=    " aggregate function; null value; query languages;
query optimization; relational algebra; relational calculus;
translation" ,
abstract=    " Most of the previous translations of relational
calculus to relational algebra aimed at proving that the two languages
have the equivalent expressive power, thereby generating very
complicated relational algebra expressions, especially when aggregate
functions are introduced. This paper presents a rule-based translation
method from relational calculus expressions. Thus, logical
optimization is carried out through translation. The translation
method comprises two parts: the translation of the relational calculus
kernel and the translation of aggregate functions. The former uses the
familiar step-wise rewriting strategy, while the latter adopts a
two-phase rewriting strategy via standard aggregate expressions. Each
translation proceeds by applying a heuristic rewriting rule in
preference to a basic rewriting rule. After introducing SQL-type null
values, their impact on the translation is thoroughly investigated,
resulting in several extensions of the translation. A translation
experiment with many queries shows that the proposed translation
method generates optimized relational algebra expressions. It is shown
that heuristic rewriting rules play an essential role in the
optimization. The correctness of the present translation is also
shown." ,
bibdate    =    "Thu Mar  7 14:17:17 1991" ,
owner    =    "robyn" ,
)

@inproceedings    ( NAQVI86A,
key    =    "Naqvi" ,
author    =    "Naqvi, S.A." ,
title    =    "Some Extensions to the Closed World Assumption in
Databases" ,
booktitle=    "Proceedings of the International Conference on
Database Theory" ,
publisher=    "Springer-Verlag" ,
address    =    "Rome, Italy" ,
editor    =    "Ausiello, G. and Atzeni, P." ,
month    =    "sep" ,
year    =    "1986" ,
pages    =    "341--348" ,
abstract=    "Reiter's Closed World Assumption (CWA) allows one
to assume a ground negative atomic formula in Horn databases. Minker
generalizes this result to allow the assumption of ground negative
atomic formulas in first-order databases. We extend Minker's results
in two differenct directions; firstly, to allow the assumption of a
non-atomic and ground formula, and secondly for non-ground (and
non-atomic) formulas. The CWA is a form of non-monotonic reasoning and
also provides a basis for negation in logic programming and logic
based systems. we expect our extensions to be of theoretical interest
to researchers in these areas." ,
bibdate    =    "Wed Sep  2 15:05:49 1987" ,
owner    =    "mckenzie" ,
)

@article    ( NARASIMHALU89,
key    =    "Narasimhalu" ,
author    =    "Narasimhalu, A. D." ,
title    =    "Database Group At ISS" ,
journal    =    "sigmod" ,
volume    =    "18" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1989" ,
pages    =    "44--49" ,
bibdate    =    "Fri Dec 29 15:39:25 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( NARAYANASWAMY88,
key    =    "Narayanaswamy \& Bapa Rap" ,
author    =    "Narayanaswamy,K. and Bapa Rao, K. V." ,
title    =    "An Incremental Mechanism for Schema Evolution in
Engineering Domains" ,
booktitle=    "Proceedings of the Fourth International Conference
on Data Engineering" ,
year    =    "1988" ,
pages    =    "294--301" ,
month    =    "February" ,
)

@article    ( NAVATHE76,
key    =    "Navathe \& Fry" ,
author    =    "Navathe, S.B. and Fry, J.P." ,
title    =    "Restructuring for Large Databases: Three Levels of
Abstraction" ,
journal    =    "tods" ,
publisher=    "ACM" ,
volume    =    "1" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1976" ,
pages    =    "138--158" ,
keywords=    "Database; data restructing; data definition; data
translation; database management systems; logical restructuring" ,
abstract=    "The development of a powerful restructuring
function involves two important components-the unambiguous
specification of the restructuring opertions and the realization of
these operations in a software system. This paper is directed to the
first component in the belief that a precise specification will
provide a firm foundation for the development of restructuring
algorithms and, subsequently, their implementation. The paper
completely defines the semantics of the restructuring of tree
structured databases. The delineation of the restructuring function is
accomplished by formulating three different levels of abstraction,
with each level of abstraction representing successively more detailed
semantics of the function. At the first level of abstraction, the
schema modification, three types are identified-naming, combining, and
relating; these three types are further divided into eight schema
operations. The second level of abstraction, the instance operations,
constitutes the transformations on the data instances; they are
divided into group operations such as replication, factoring, union,
etc., and group relation operations such as collapsing, refinement,
fusion, etc. The final level, the item value operations, includes the
actual item operations, such as copy value, delete value, or create a
null value." ,
bibdate    =    "Thu Nov 20 14:24:10 1986" ,
owner    =    "manning" ,
)

@article    ( NAVATHE80,
key    =    "Navathe" ,
author    =    "Navathe, S.B." ,
title    =    "Schema Analysis for Database Restructuring" ,
journal    =    "tods" ,
publisher=    "ACM" ,
volume    =    "5" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1980" ,
pages    =    "157--184" ,
keywords=    "Database; schema; data structure; data model; data
semantics; database design; database restructuring; stored data;
graphical representation of data; data relationships; database
management systems" ,
abstract=    "The problem of generalized restructuring of
databases has been addressed with two limitations: first, it is
assumed that the restructuring user is able to describe the source and
target databases in terms of the implicit data model of a particular
methodology; second, the restructuring user is faced with the task of
judging the scope and applicability of the defined types of
restructuring to his database implementation and then of actually
specifying his restructuring needs by translating them into the
restructuring operations on a foreign data model. A certain amount of
analysis of the logical and physical structure of databases must be
performed, and the basic ingredients for such an analysis are
developed here. The distinction between hierarchical and
nonhierarchical data relationships is discussed, and a classification
for database schemata is proposed. Examples are given to illustrate
how these schemata arise in the conventional hierarchical and network
systems. Application of the schema analysis methodology to
restructuring specification is also discussed. An example is presented
to illustrate the different implications of restructuring three
seemingly identical database structures." ,
bibdate    =    "Thu Nov 20 10:30:48 1986" ,
owner    =    "manning" ,
)

@article    ( NAVATHE86A,
key    =    "Navathe et al." ,
author    =    "Navathe, S. and Batini, C. and Lenzerini, M." ,
title    =    " A Comparative Analysis of Methodologies for
Database Schema Integration" ,
journal    =    "compsurv" ,
volume    =    18 ,
pages    =    "323--364" ,
month    =    "dec" ,
year    =    1986 ,
annote    =    "A very good comparison of different approaches to
schema migration. Formal treatment of the semantics is given.
Definitions of concepts of equivalence of schemas created.
Categorization of problems in Schema integration. Overview and metrics
of existing systems." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( NAVATHE92,
key    =    "Navathe" ,
author    =    "Navathe, S. B." ,
title    =    "Evolution of Data Modeling for Databases" ,
journal    =    "cacm" ,
publisher=    "Acm Press" ,
volume    =    "35" ,
number    =    "9" ,
month    =    "sep" ,
year    =    "1992" ,
pages    =    "112--123" ,
bibdate    =    "Tue Nov 17 19:56:05 1992" ,
owner    =    "bassili" ,
)

@article    ( NEGRI89,
key    =    "Negri \& Pelagatti" ,
author    =    "M. Negri and G. Pelagatti" ,
title    =    "Semantic and Problems of Universal Quantification
in SQL." ,
journal    =    "comput. J. " ,
volume    =    "32" ,
number    =    "1" ,
month    =    "Feb." ,
year    =    "1989" ,
pages    =    "91--92" ,
keywords=    "SQL semantic" ,
bibdate    =    "Fri Mar 22 11:40:07 1991" ,
owner    =    "suchen" ,
)

@article    ( NEGRI91,
key    =    "negri91" ,
author    =    "Negri, M. and Pelagatti, S. and Sbattella, L." ,
title    =    "Formal Semantics of SQL Queries" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "16" ,
number    =    "3" ,
month    =    "september" ,
year    =    "1991" ,
pages    =    "513-534" ,
abstract=    "The semantics of SQL queries is formally defined
by stating a set of rules that determines a syntax-driven translation
of an SQL query to a formal model. The target model, called Extended
Three Valued Predicate Calculus (E3VPC), is largely based on a set of
well-known mathematical concepts. The rules which allow the
transformation of a general E3VPC expression to a Canonical Form,
which can be manipulated using traditional, two-valued predicate
calculus are also given; in this way, problems like eqiuvalence
analysis of SQL queries are completely solved. Finally, the fact that
reasoning about the equivalence of SQL queries using two-valued
predicate calculus, without taking care of the real semantics can lead
to errors is shown, and the reasons for this are analyzed." ,
bibdate    =    "Mon Nov  4 11:30:42 1991" ,
owner    =    "kline" ,
)

@article    ( NEGRI91A,
key    =    "Negri \& Pelagatti" ,
author    =    "Negri, M. and G. Pelagatti" ,
title    =    "Distributive Join: A New Algorithm for Joining
Relations" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "16" ,
number    =    "4" ,
month    =    "Dec" ,
year    =    "1991" ,
pages    =    "655--669" ,
keywords=    "Algorithm, Performance, buffer, hashing, join,
merging scan, nested scan, sort" ,
abstract=    "This paper describes a new algorithm for
performing joins in the absence of access paths. This alogirthm is
shown to perform better than the merging scan algorithm, which can be
considered the paradigm of join algorithms. Finally this algorithm is
compared with another recent sub-sort-merge algorithm." ,
bibdate    =    "Thu Jan 16 16:10:28 1992" ,
owner    =    "suchen" ,
)

@techreport    ( NESTOR86A,
key    =    "Nestor" ,
author    =    "Nestor, J.R." ,
title    =    "Toward a Persistent Object Base" ,
number    =    "SEI-86-TM-8" ,
institution=    "Software Engineering Institute" ,
address    =    "Carnegie-Mellon University, Pittsburgh, PA" ,
year    =    "1986" ,
month    =    "jul" ,
pages    =    "1--25" ,
abstract=    "To better understand the needs of future
programming environments, two current technologies that support
persistant data in programming environments are considered: file
systems and data base systems. This paper presents a set of weaknesses
present in these current technologies. These weaknesses can be viewed
as a checklist of issues to be considered when evaluating or designing
programming environments." ,
bibdate    =    "Thu Jan  8 11:30:00 1987" ,
owner    =    "manning" ,
)

@techreport    ( NETTLES91,
key    =    "Nettles \& Wing" ,
author    =    "Nettles, S.M. and Wing, J.M." ,
title    =    "Persistence + Undoability = Transactions" ,
number    =    "CMU-CS-91-173" ,
institution=    "cmucsd" ,
address    =    "Pittsburgh, PA" ,
year    =    "1991" ,
month    =    "aug" ,
pages    =    "27" ,
keywords=    "persistence; recoverability; transactions;
databases; Standard ML" ,
abstract=    "Persistence means objects live potentially
forever. Undoability means that any change to a program's store can
potentially be undone. In our design and implementation of support for
single-threaded nested transactions in Standard ML of New Jersey
(SML/NJ), we provide persistence and undoability as orthogonal
features and combine them in a simple and elegant manner. We provide
support for persistence through an SML interface that lets users
manipulate a set of persistent roots and provides a save function that
causes all data reachable from the persistent roots to be moved into
the persistent heap. We implement the interface through simple
extensions to SML's generational garbage collector and maintain the
persistent heap using CMU's Recoverable Virtual Memory system. We
provide support for undoability through an SML interface that exports
two functions: checkpoint, which checkpoints the current store, and
restore, which undoes all changes all changes made to the previously
checkpointed store. The implementation takes advantage of the simple
runtime representation of data in SML and, as for persistence, extends
the existing garbage collector scheme. SML's ``mostly'' functional
nature allows us to implement this abstraction without undue
performance penalty. Finally we combine these capabilities to support
single-threaded nested transactions by defining a higher-order
function transact that guarantees the permanence of effects of
committed transactions. We succintly define transact completely in
terms of the interfaces for persistence and undoability. Unlike other
transaction-based programming languages like Argus or Avalon/C++, we
need not add new control structures; moreover, we handle aborts of
nested or top-level transactions using SML's exception mechanism." ,
bibdate    =    "Mon Oct 12 22:56:54 1992" ,
owner    =    "leoso" ,
)

@article    ( NEUHOLD89,
key    =    "Neuhold \& Bernstein" ,
author    =    "Neuhold, E. and Bernstein, P." ,
title    =    "Future Directions in DBMS Research" ,
journal    =    "sigmod" ,
volume    =    "18" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1989" ,
pages    =    "17--26" ,
abstract=    "On February 4-5, 1988, the International Computer
Science Institute sponsored a two day workshop at which 16 senior
members of the data base research community discussed future research
topics in the DBMS area. This paper summarizes the discussion which
took place." ,
bibdate    =    "Mon Oct 23 10:47:14 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( NEUHOLD89A,
key    =    "Neuhold" ,
author    =    "Neuhold, Erich J." ,
title    =    "Coupling Knowledge Based Systems with Large Data
Stores" ,
booktitle=    "Proceedings of the 5th International Conference on
Data Engineering, Los Angeles, California" ,
year    =    "1989" ,
pages    =    "257--258" ,
month    =    "" ,
)

@inproceedings    ( NG90,
key    =    "NG" ,
author    =    "Ng, P. Tony" ,
title    =    "Propagating Updates in Highly Replicated Database" ,
booktitle=    "Proceedings of the Sixth International Conference
on Data Engineering" ,
year    =    "1990" ,
pages    =    "529--536" ,
month    =    "February" ,
)

@techreport    ( NGUYEN89,
key    =    "Nguyen \& Rieu" ,
author    =    "Nguyen, G. and Rieu, D." ,
title    =    "Schema Change Propagation in Object-Oriented
Databases" ,
number    =    "1045" ,
institution=    "INRIA-Rocquencourt" ,
address    =    "Rocquencourt, FRANCE" ,
year    =    "1989" ,
month    =    "jun" ,
pages    =    "1--10" ,
abstract=    "This paper gives an overview of current research
efforts directed towards evolving data definitions in object-oriented
database systems. The emphasis is on their ability to support two
complementary aspects: supporting evolving schemas, and propagating
the changes on the object instances. Several projects are analyzed:
Cadb, Encore, GemStone, Orion, and Sherpa. Current results indicate
that if most of them provide schema evolution facilities, they seldom
support automatic propagation mechanisms. A proposal is described that
enables Sherpa to fully support the propagation of changes and the
dynamic classification of the instances whose class definitions are
modified. This approach is an extension of techniques used in
artificial intelligence for knowledge representation. It extends
previous classification mechanisms with a dynamic capability which
adequately supports evolving class definitions." ,
keywords=    "classes; objects; evolving schemas;
classification; modifications; propagation" ,
bibdate    =    "Tue Nov 27 10:46:51 1990" ,
owner    =    "robyn" ,
)

@proceedings    ( NGUYEN89A,
key    =    "NGUYEN \& RIEU" ,
title    =    "Schema Change Propagation in Object-Oriented
database" ,
publisher=    "IFIP" ,
author    =    "Nguyen, G. and Rieu, D." ,
year    =    "1989" ,
bibdate    =    "Wed May 22 15:02:45 1991" ,
owner    =    "suchen" ,
)

@techreport    ( NICHOLS89,
key    =    "Nichols \& Demurjian" ,
author    =    "Nichols, Greg and Steven A. Demurjian" ,
title    =    "Ozone: A Software-development Environment with
Object-Oriented Database Support" ,
number    =    "CSE-TR-89-30" ,
institution=    "University of Connecticut Dept. of Computer
Science and Engineering" ,
year    =    "1989" ,
pages    =    "20" ,
abstract=    "The software-development process requires the
corrdination of many different activities, including software
specification and design, editing programs, testing and debugging,
locating software for reuse, the preparation of documentation, and
long-term maintenance. The goal of a software-development
environment(SDE) is to provide support for all aspects of this
process. Managing the information and automating the development
process using a SDE results in a number of advantages, such as
increased productivity, and better management of changes. SDEs must
manage large quantities of data consisting of a broad variety of data
types, including programs in various forms, design documents, test
plans, ttest data, and softeware libraries. A database management
system would provide many services to the SDE, including sharing of
the data between tools and individuals, efficient access of large
amounts of data, and the ability to query data that spans the SDE. The
latter is achieved through the development of a program questioning
tool would answeer questions about the software being developed. This
paper presents issues invloved in the support of a SDE with an
object-oriented database, investigating methods of providing advanced
capabilities in a versatile and extensible SDE. The focus of this work
is a prototype SDE called Ozone, designed and constructed to evalute
solutions to problems posed by the support of an integrated SDE with
an object-oriented database system. This paper discusses issues for
developing Ozone and SDEs in general, requirements for the Ozone
environment, and the representation and management of the data
describing the software being developed within Ozone." ,
bibdate    =    "Thu Oct  3 15:12:44 1991" ,
owner    =    "suchen" ,
)

@techreport    ( NICHOLS89A,
key    =    "Nichols \& Demurjian" ,
author    =    "Nichols, Greg and Steven A. Demurjian" ,
title    =    "Object-Oriented Database Design for the Ozone
Software Development Environment" ,
number    =    "CSE-TR-89-37" ,
institution=    "University of Connecticut Dept. of Computer
Science and Engineering" ,
address    =    "Box U155,260 Glenbrook Road Storrs, CT 06269-3155" ,
year    =    "1989" ,
pages    =    "20" ,
abstract=    "There are a number of significant issues that
arise when the fields of software-development environments(SDEs) with
database support and the object-oriented paradigm are combined, such
as: support for a myriad of data types(i.e., source code, control-flow
diagrams, parse trees, symbol tables, designs, specifications, etc.),
the availability of a clear, concise public interface for tool
designers and via dat encapsulationand information hiding, and the
ability to support extensibility by modifying both the public
interface (i.e., data and methods available to users) and the private
implementation of the environment data. Thess isues are currently
under investigation as part of the design and prototypeing of Ozone,
and SDE for C programs with object-oriented database support. Ozone is
being developed to support tools for project editing, text editing,
compilation, and program questioning for querying the program
information that is stored within the environment. This paper presents
a significant portion of an object-oriented database design for the
environment data required by Ozone for supporting its tools. Along
with the explanation of the object-oriented design, the extent to
which Ozone supports extensibility, tool integration,
software-methodology and programming-language independence, and tool
development, are also addressed." ,
bibdate    =    "Thu Oct  3 15:23:59 1991" ,
owner    =    "suchen" ,
)

@article    ( NICOL93,
key    =    "Nicol et al." ,
author    =    "Nicol, J.R. and Wilkes, T.C. and Manola, F.A." ,
title    =    "Object Orientation in Heterogeneous Distributed
Computing Systems" ,
journal    =    "IEEE Computer" ,
publisher=    "ieee" ,
volume    =    "26" ,
number    =    "6" ,
month    =    "jun" ,
year    =    "1993" ,
pages    =    "57--67" ,
bibdate    =    "Wed Jun 30 15:19:23 1993" ,
owner    =    "daisyc" ,
)

@article    ( NIERSTRASZ85,
key    =    "Nierstrasz" ,
author    =    "Nierstrasz, O. M." ,
title    =    "Hybrid: A Unified Object-Oriented System" ,
journal    =    "Database Engineering. Special Issue on
Object-Oriented Systems" ,
year    =    "1985" ,
volume    =    "8" ,
number    =    "4" ,
pages    =    "49--57" ,
month    =    "December" ,
)

@article    ( NIEVERGELT84,
key    =    "Nievergelt et al." ,
author    =    "Nievergelt, J. and Hinterberger, H. and Sevcik, K.
C." ,
title    =    "The Grid File: An Adaptable, Symmetric Multikey
File Structure" ,
journal    =    "tods" ,
volume    =    "9" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1984" ,
pages    =    "38--71" ,
bibdate    =    "Sat Apr 27 00:02:52 1985" ,
)

@book        ( NIJSSEN89,
key    =    "Nijssen \& Halpin" ,
author    =    "Nijssen, G. and Halpin, T." ,
title    =    "Conceptual Schema and Relational Database Design:
A Fact Oriented Approach" ,
publisher=    "Prentice-Hall" ,
address    =    "New York" ,
year    =    1989 ,
annote    =    "Introduction to th NIAM methodology for Schema
Design. A 9 step procedure for going from facts, to a variant of ER
diagrams. A couple of chapters on schema transformations (10,13) are
relevant to translation." ,
)

@inproceedings    ( NILSSON85,
key    =    "Nilsson" ,
author    =    "Nilsson, E." ,
title    =    "The Translation of a {COBOL} Data Structure to an
Entity Relationship type Conceptual Schema" ,
booktitle=    "Proceedings 1985 International Conference on the
Entity Relationship Approach" ,
pages    =    "170--277" ,
publisher=    "IEEE Press" ,
address    =    "New York" ,
year    =    1985 ,
annote    =    "Fairly basic system, mostly concerned with using
cardinalities to represent repeating groups." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( NIXON87,
key    =    "Nixon et al." ,
author    =    "Nixon, B. and Chung, L. and Lauzon, D. and
Borgida, A. and Mylopoulos, J. and Stanley, M." ,
title    =    "Implementation of a Compiler for a Semantic Data
Model: Experiences with Taxis" ,
booktitle=    "Proceedings of the ACM SIGMOD Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "118--131" ,
abstract=    "The features of a compiler for the Taxis design
language are described and discussed. Taxis offers an entity-based
framework for designing interactive information systems and supports
generalisation, classification and aggregation as abstraction
mechanisms. Its features include multiple inheritance of attributes,
isA hierarchies of transactions, metaclasses, typed attributes, a
procedural exception-handling mechanism and an iteration construct
based on the abstraction mechanisms supported. Developing a compiler
for the language involved dealing the problems of efficiently
representing and accessing a large collection of entities, performing
(static) type checking and representing isA hierarchies of
transactions." ,
bibdate    =    "Fri Jul 24 14:34:54 1987" ,
owner    =    "manning" ,
)

@article    ( NODINE92,
key    =    "Nodine \& Zdonik" ,
author    =    "Nodine, M. and Zdonik, S." ,
title    =    "Cooperative Transaction Hierarchies" ,
journal    =    "VLDB Journal" ,
publisher=    "VLDB Endowment" ,
volume    =    "1" ,
number    =    "1" ,
month    =    "jul" ,
year    =    "1992" ,
pages    =    "41--80" ,
keywords=    "Cooperation; design transactions; transactions
hierarchies; non-serializability; transaction synchronization;
deadlock detection; version management" ,
abstract=    "Traditional atomic and nested transactions are not
always well-suited to cooperative applications, such as design
applications. Cooperative applications place requirements on the
database that may conflict with the serializability requirement. They
require transactions to be long, possibly nested, and able to interact
with each other in a structured way. We define a transaction
framework, called a cooperative transaction hierarchy, that allows us
to relax the requirement for atomic, serializable transactions to
better support cooperative applications. In cooperative transaction
hierarchies, we allow the correctness specifications for groups of
designers to be tailored to the needs of the application. we use
patterns and conflicts to specify the constraints imposed on a group's
history for it to be correct. We also provide some primitives to
smooth the operation of the members. We characterize deadlocks in a
cooperative transaction hierarchy, and provide mechanisms for deadlock
detection and resolution. We examine issues associated with failure
and recovery." ,
bibdate    =    "Thu Jan 28 18:53:56 1993" ,
owner    =    "bassili" ,
)

@article    ( OHARE89,
key    =    "O'hare \& Sheth" ,
author    =    "O'Hare, Anthony B. and Sheth, Amit P." ,
title    =    "The Interpreted-Compiled Range of AI/DB Systems" ,
journal    =    "ACM SIGMOD Record" ,
year    =    "1989" ,
volume    =    "18" ,
number    =    "1" ,
pages    =    "32--42" ,
month    =    "March" ,
)

@inproceedings    ( OHORI88,
key    =    "Ohori" ,
author    =    "Ohori, A." ,
title    =    " Semantics of Types for database Objects" ,
booktitle=    "ICDT 88 Second International Conference on
Database Theory" ,
pages    =    "240--251" ,
publisher=    "Springer-Verlag" ,
address    =    "New York" ,
month    =    "sep" ,
year    =    1988 ,
annote    =    "A very detailed abstract semantic model for an
object oriented system is presented. The basis for the system is an
extension to an existing relational model. " ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( OLKEN86,
key    =    "Olken et al." ,
author    =    "Olken, F. and Rotem, D. and Shoshani, A. and Wong,
H.K.T." ,
title    =    "Scientific and Statistical Data Management
Research at LBL" ,
booktitle=    "Proceedings of the Third International Workshop on
Statistical and Scientific Database Management" ,
address    =    "Luxemburg" ,
month    =    "jul" ,
year    =    "1986" ,
pages    =    "1--20" ,
abstract=    "This paper is a review of scientific and
statistical data management research at LBL in recent years in the
areas of: logical modeling and user interfaces, database operators,
and physical organization and access methods. In the area of logical
modeling and user interfaces we discuss: SUBJECT, a system for
organizing multi-dimensional data, GUIDE, a graphical query system,
and logical modeling of temporal data. In database operators we
discuss sampling from relational databases, and transposition of
compressed data. In the area of physical DB organization and access
methods we discuss: header data compression, batched interpolation
search, bit transposed file organization, techniques for controlling
overflow from multi-dimensionsal data structures (e.g. grid files),
and data structures for temporal data." ,
bibdate    =    "Tue Jun 24 15:05:52 1986" ,
owner    =    "manning" ,
)

@article    ( OMIECINSKI89,
key    =    "Omiecinski \& Lin" ,
author    =    "Omiecinski, E. and Lin, E. T." ,
title    =    "Hash-Based and Index-Based Join Algorithms for
Cube and Ring Connected Multicomputers" ,
journal    =    "IEEE Transactions on Data and Knowledge
Engineering" ,
volume    =    "1" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1989" ,
pages    =    "329--343" ,
keywords=    "Hashing; hypercube; join index; join operator;
parallel algorithms; relational database; ring" ,
abstract=    "The goal of this paper is to compare the
performance of two different join algorithms on both cube and ring
interconnections for message-based multicomputers, and to investigate
the effects that the number of processors and the type of
interconnection scheme have on the performance. First, the parallel
Hybrid-Hash [5], [15] join algorithm and the parallel Join-Index [22]
join algorithm for both the cube and ring connected multicomputers are
presented. The performance of these algorithms is then compared
through analytical cost modeling. The result shows that the Join-Index
join algorithm gives good performance only when the join selectivity
is very small, and the Hybrid-Hash join algorithm performs
consistently well under most situations. Our result also shows that
the cube topology yields better execution time than the same algorithm
on the ring topology. Furthermore, increasing the number of processors
has a more significant improvement on the execution time for the cube
than the ring configuration. The applicability of join indexes on the
parallel database algorithms is also discussed in this paper." ,
bibdate    =    "Fri Dec  8 11:58:00 1989" ,
owner    =    "robyn" ,
)

@article    ( OMIECINSKI89A,
key    =    "Omiecinski" ,
author    =    "Omiecinski, Edward" ,
title    =    "Concurrent File Conversion Between B+ tree and
Linear Hash Files" ,
journal    =    "Information system" ,
volume    =    "14" ,
number    =    "5" ,
year    =    "1989" ,
pages    =    "371--383" ,
abstract=    "The motivation for this paper is to show that the
conversion of a B+ tree file into a lliner hash file and the
conversion of a linear hash file into a B+ tree file can be done
concurrently with user-transaction processing. The conversion process,
in general is motivated by a change in database processing
requirements. For the first case, efficient sequential access and
direct access are originally needed but now only efficient direct
access is needed. for the second case, the opposite is true. This is
quite reasonable for a database system which accommodates new and
changing applications. Several existing database systems allow an
off-line reorganization to support thee changes. We devise an
algorithm which performs a concurrent conversion for both cases and
[present an analytic model of the conversion process for each. We also
employ a typical database simulation model to evaluate the
reorganization scheme. The results from the analytic model for Case 1
are within 3% (on average) of the observed simulation results and for
Case 2 are within 4% (on average) of the observed simulation results. " ,
bibdate    =    "Thu Jan 16 16:33:33 1992" ,
owner    =    "suchen" ,
)

@article    ( OMIECINSKI89B,
key    =    "Omiecinski" ,
author    =    "Omiecinski, E." ,
title    =    "Heuristics for Join Processing Using Nonclustered
Indexes" ,
journal    =    "tse" ,
publisher=    "ieee" ,
volume    =    "15" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1989" ,
pages    =    "18--25" ,
keywords=    "Bipartite graphs; heuristics; join operator; query
processing; relational database; secondary indexes" ,
abstract=    "Finding efficient procedure for implementing
relational database operations, such as the join, is an important
database problem. In this paper, we examine join processing when the
access paths available are nonclustered indexes on the joining
attribute(s) for both relations involved in the join. We use a
bipartite graph model to represet the pages from the two relations
which contain tuples that are to be joined. We are interested in
minimizing the number of page accesses needed to compute a join in our
database environment. We explore this problem from two perspectives.
The first is to reduce the maximum buffer size so that no page is
accessed more than once and the second is to reduce the number of page
accesses for a fixed buffer size. We have developed heuristics and
another method which recently appeared in the literature. The results
show that one particular heuristics performs very well for addressing
the problem from either perspective." ,
bibdate    =    "Sun Apr 11 15:36:28 1993" ,
owner    =    "bassili" ,
)

@article    ( OMIECINSKI90,
key    =    "Omiecinski et al." ,
author    =    "Omiecinski, Edward and Wei Liu and Ian Akyildiz" ,
title    =    "ANALYSIS OF A DERERRED AND INCREMENTAL UPDATE
STRATEGY FOR SECONDARY INDEXES" ,
journal    =    "Informaiton System" ,
year    =    "1990" ,
pages    =    "1-12" ,
keywords=    "Expert vision system, quadtree, relational data
model, spatial dtabase, spatial data modeling, spatial knowldege
representation, spatial manipulation." ,
abstract=    "Many relational database systems use secondary
ndexes to reduce the access cost of retrieving data in response to a
user's query. However, a secondary index incurs an additional cost due
to the update maintenance of the index. In some cases, this cost may
be greater than the cost to update the desirdd tuples. This paper
examines a deferred index update strategy which does an incremental
update of the index. The approach introduced, which uses a
differential file, can reduce the cost of updating a secondary index
by s lightly increasing the cost that will be associated with
searching the secondary indexs. This is true as long as the
differential file size does not becone too large. As such, A model is
presented for solving the distribution of the size of the differential
file. The maximum size of the differential file is predicted by
interpreting this distribution. In addition, the analytical results
are compared with simulation results. " ,
bibdate    =    "Tue Aug  6 17:00:14 1991" ,
owner    =    "suchen" ,
)

@article    ( OMIECINSKI90A,
key    =    "Omiecinski \& Scheuermann" ,
author    =    "Omiecinski, Edward and Peter Scheuermann" ,
title    =    "A Parallel Algorithm for Record Clustering" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "15" ,
number    =    "4" ,
month    =    "Dec" ,
year    =    "1990" ,
pages    =    "599-624" ,
keywords=    "Algorithms, experimentatiaon, performance" ,
abstract=    "We present an efficient heuristic algorithm for
record clustering that can run on a SIMD machine. We introduce the
P-tree, and its associated numbering scheme, which in the split phase
allows each processor independently to compute the unique cluster
number of a record satisfying an arbitrary query. we show that by
restricting ourselves in the merge phase to combining only sibling
clusters, we obtain a parallel algorithm whose speedup ratio is
optimal in the number of processors used. Finally, we report on
experiments showing that our method produces substantial savings in an
environment with relatively little overlap amoung the queries." ,
bibdate    =    "Thu Jan 16 16:41:57 1992" ,
owner    =    "suchen" ,
)

@article    ( OMIECINSKI90B,
key    =    "Omiecinski" ,
author    =    "Omiecinski, E." ,
title    =    "A Parallel Algorithm for Relational Database
Normalization" ,
journal    =    "IEEE Transactions on Parallel and Distributed
Systems" ,
volume    =    "1" ,
number    =    "4" ,
month    =    "oct" ,
year    =    "1990" ,
pages    =    "415--423" ,
abstract=    "We examine the problem of database normalization
in a parallel environment. Generating relation schemes in third normal
form is straightforward when given a set of functional dependencies
that is a reduced cover. In this paper, we show how a reduced cover
for a set of functional dependencies can be produced in parallel. The
correctness of the algorithm is based on two important theorems. We
also show that the companion third normal form algorithm can be easily
translated into a parallel version. In addition, the performance of
these two algorithms is compared to the performance of their serial
counterparts." ,
keywords=    "Functional dependency, minimal cover, parallel
algorithms, performance analysis, relational database, third normal
form" ,
bibdate    =    "Mon Jan 20 13:18:40 1992" ,
owner    =    "soo" ,
)

@inproceedings    ( OMIECINSKI91,
key    =    "Omiecinski" ,
author    =    "Omiecinski, E." ,
title    =    "Performance Analysis of a Load Balancing
Hash-Jpoin Algorithm for a Shared Memory Multiprocessor" ,
booktitle=    "vldb" ,
year    =    "1991" ,
abstract=    "Within the last several years, there has been a
growing interest in applying general multiprocessor systems to
relational database query processing. Eficient parallel algorithms
have been designed for the join operation but usually have been
failing in that their performance deteriorates greatly when the data
is nonuniform. In this paper, we propose a new version of the
hash-based join algorithm that balances the load between the
processors, for any given bucket, in a shared everything environment.
We develop an analytical model of the cost of the algorithm and
implement the algorithm on a shared memory multiprocessor machine. We
also perform a number of experiments comparing our model with our
empirical results." ,
bibdate    =    "Tue Jan 21 16:48:14 1992" ,
owner    =    "soo" ,
)

@techreport    ( OMIECINSKI91A,
key    =    "Omiecinski \& Lin" ,
author    =    "Omicinski, E. and Lin, E. T." ,
title    =    "The Adaptive-Hash Join Algorithm for a Hypercube
Multicomputer" ,
institution=    "School of Information and Computer Science,
Georgia Institute of Technology" ,
abstract=    "The goal of this research is to design efficient
relational join algorithms for large databases on a hypercube
multicomputer in which data and processing power are distributed. The
Cube Hybrid-Hash join algorithm was shown to outperform other
algorithms in our previous research. Unfortunately, its performance
greatly deteriorates when bucket overflow occurs in the inner rlation
of the join operation. In this paper, we present the Cube
Adaptive-Hash join algorithm, which is designed to combine the merits
of Nested-Loop and Hybrid-Hash. The performance of these algorithms
are compared through analytical cost modeling. The non-uniform data
value distribution of the inner relation is shown to have a greater
impact than that of the outer relation. The Cube Adaptive-Hash join
algorithm outperforms the Cube Hybrid-Hash algorithm when bucket
overflow occurs. In the worst case, this algorithm converges to the
Cube Nested-Loop-Hash join algorithm. When there is no hash table
overflow, the Cube Adaptive-Hash join algorithm converges to the Cube
Hybrid-Hash join algorithm. Since the Cube Adaptive-Hash join
algorithm adapts itself depending on the characteristics of the
relations, it is relatively immune to the data distribution. We
believe that the Cube Adaptive-Hash join algorithm should be the
algorithm of choice to perform the relational join operator for large
databases on the hypercube multicomputer. " ,
year    =    "1991" ,
pages    =    "30" ,
bibdate    =    "Tue Aug 11 14:14:02 1992" ,
owner    =    "soo" ,
)

@inproceedings    ( OMIECINSKI91B,
key    =    "Omiecinski" ,
author    =    "Omiecinski, E." ,
title    =    "Performance Analysis of a Load Balancing Hash-Join
Algorithm for a Shared Memory Multiprocessor" ,
booktitle=    "vldb" ,
address    =    "Barcelona, Spain" ,
editor    =    "Lohman, G. M." ,
month    =    "sep" ,
year    =    "1991" ,
pages    =    "375--385" ,
abstract=    "Within the last several years, there has been a
growing interest in applying general multiprocessor system to
relational database query processing. Efficient parallel algorithms
have been designed for the join operation but usually have a failing
in that their performance deteriorates greatly when the data is
nonuniform. In this paper, we propose a new version of the hash-based
join algorithm that balances the load between the processors, for any
given bucket, in a shared everything environment. We develop an
analytical model of the cost of the algorithm and implement the
algorithm on a shared memory multiprocessor machine. We also perform a
number of experiments comparing our model with our empirical results." ,
bibdate    =    "Fri Jan 29 13:36:59 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( OMIECINSKI92,
key    =    "Omiecinski et al." ,
author    =    "Omiecinski, E. and Lee, L. and Scheuermann, P." ,
title    =    "Concurrent File Reorganization for Record
Clustering: A Performance Study" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "ieee" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Alamitos, CA" ,
editor    =    "Golshani, F." ,
volume    =    "8" ,
month    =    "feb" ,
year    =    "1992" ,
pages    =    "265--272" ,
abstract=    "This paper presents a performance analysis of a
concurrent file reorganization algorithm. We examine the effect of (i)
buffer size, (ii) degree of reorganization and (iii) write probability
of transactions on system throughput. The problem of file
reorganization which we consider involves altering the placement of
records on pages of a secondary storage device. In addition, we want
this reorganization to be done in-place, i.e., using the file's
original storage space for the newly reorganized file. Our approach is
also appropriate for a non in-place reorganization as well. The
motivation for such a physical change, i.e., record clustering, is to
improve the database system's performance, i.e., minimizing the number
of page accesses made in answering a set of queries. In this work we
show through simulation that our algorithm, when run concurrently with
user transactions, provides an acceptable level of overall database
system performance." ,
bibdate    =    "Sat Aug 29 15:24:17 1992" ,
owner    =    "leoso" ,
)

@article    ( OMIECINSKI92A,
key    =    "Omiecinski \& Lin" ,
author    =    "Omiecinski, E. and Lin, E. T." ,
title    =    "The Adaptive-Hash Join Algorithm for a Hypercube
Multicomputer" ,
journal    =    "IEEE Transactions on Parallel and Distributed
Systems" ,
publisher=    "ieee" ,
volume    =    "3" ,
number    =    "3" ,
month    =    "may" ,
year    =    "1992" ,
pages    =    "334--349" ,
keywords=    "Analytical modeling; data skew; hash join
algorithms; hypercube multiprocessor; nested loop algorithm;
performance; relational join operator" ,
abstract=    "The goal of this research is to design efficient
relational join algorithms for large databases on a hypercube
multicomputer in which data and processing power are distributed. The
Cube Hybrid-Hash join algorithm was shown to outperform other
algorithms in our previous research. Unfortunately, its performance
greatly deteriorates when bucket overflow occurs in the inner relation
of the join operation. In this paper, we present the Cube
Adaptive-Hash join algorithm, which is designed to combine the merit
of Nested-Loop and Hybrid-Hash. The performance of these algorithms
are compared through analytical cost modeling. The nonuniform data
value distribution of the inner relation is shown to have a greater
impact than that of the outer relation. The Cube Adaptive-Hash join
algorithm outperforms the Cube Hybrid-Hash join algorithm when bucket
overflow occurs. In the worst case, this algorithm converges to the
Cube Nested-Loop-Hash join algorithm. When there is no hash table
overflow, the Cube Adaptive-Hash join algorithm converges to the Cube
Hybrid-Hash join algorithm. Since the Cube Adaptive-Hash join
algorithm adapts itself depending on the characteristics of the
relations, it is relatively immune to the data distribution. We
believe that the Cube Adaptive-Hash join algorithm should be the
algorithm of choice to perform the relational join operator for large
databases on the hypercube multicomputer." ,
bibdate    =    "Thu Jan 28 19:14:12 1993" ,
owner    =    "bassili" ,
)

@article    ( OMIECINSKI93,
key    =    "Omiecinski \& Scheuermann" ,
author    =    "Omiecinski, E. and Lee, L. and Scheuermann, P." ,
title    =    "Performance Analysis of a Concurrent File
Reorganization Algorithm for Record Clustering" ,
journal    =    "tdke" ,
publisher=    "ieee" ,
year    =    "1993" ,
keywords=    "Concurrent reorganization; performance analysis;
record clustering; simulation" ,
abstract=    "This paper presents a simulation based performance
analysis of a concurrent file reorganization algorithm. We examine the
effect on throughput of (i) buffer size, (ii) degree of
reorganization, (iii) write probability of transactions, (iv)
multiprogramming level and (v) degree of clustered transactions. The
problem of file reorganization which we consider involves altering the
placement of records on pages of a secondary storage device. In
addition, we want this reorganization to be done in-place, i.e., using
the file's original storage space for the newly reorganized file. Our
approach is also appropriate for a non in-place reorganization as
well. The motivation for such a physical change, i.e., record
clustering, is to improve the database system's performance, i.e.,
minimizing the number of page accesses made in answering a set of
queries. There are numerous record clustering algorithms, but they
usually do not solve the entire problem, i.e., they do not specify how
to efficiently reorganize the file to reflect the clustering
assignment which they determine. In previous work, we have presented
an algorithm that is a companion to general record clustering
algorithms, i.e., it actually transforms the file. In this work we
show through simulation that our algorithm, when run concurrently with
user transactions, provides an acceptable level of overall database
system performance." ,
bibdate    =    "Fri Jan 29 13:31:45 1993" ,
owner    =    "bassili" ,
)

@article    ( ONEIL89,
key    =    "O'Neil" ,
author    =    "O'Neil, P.E." ,
title    =    "Revisiting DBMS Benchmarks" ,
journal    =    "Datamation" ,
volume    =    "35" ,
number    =    "18" ,
month    =    "sep" ,
year    =    "1989" ,
pages    =    "47---54" ,
abstract=    "The role of queries in database evaluations is
often ignored. Here's a benchmark to consistently measure their effect
on database performance." ,
bibdate    =    "Thu Nov 16 12:17:19 1989" ,
owner    =    "rts" ,
)

@mastersthesis    ( ONG82,
key    =    "Ong" ,
author    =    "Ong, J.C." ,
title    =    "Implementation of Abstract Data Types in the
Relational Database System INGRES" ,
school    =    "University of CA" ,
month    =    "sep" ,
year    =    "1982" ,
bibdate    =    "Wed Feb 20 15:42:31 1985" ,
)

@article    ( ONG84,
key    =    "Ong et al." ,
author    =    "Ong, J. and Fogg, D. and Stonebraker, M." ,
title    =    "Implementation Of Data Abstraction In The
Relational Database System INGRES" ,
journal    =    "sigmod" ,
volume    =    "14" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1984" ,
pages    =    "1--14" ,
abstract=    "This paper discusses the design and implementation
of an abstract data type (ADT) facility which was added to the INGRES
database manager. Our implementation of ADTs allows a user to register
ADTs and ADT operators with the run-time database manager, declare
column values of relations to be instances of ADTs, and formulate
queries containing references to ADTs and ADT operators. The user
view, implementation, performance, and possible extensions to this new
facility are described." ,
bibdate    =    "Wed Feb 20 13:53:49 1985" ,
)

@techreport    ( ONG90,
key    =    "Ong \& Goh" ,
author    =    "Ong, Lay-Peng and Goh, Jeffrey K. S." ,
title    =    "A Unified Framework for Version Modeling using
Production Rules in a Database System" ,
institution=    "Electronics Research Laboratory, College of
Engineering, University of California" ,
year    =    "1990" ,
type    =    "Memorandum," ,
number    =    "UCB/ERL M90/33" ,
address    =    "Berkeley, CA 94720" ,
month    =    "April" ,
note    =    "" ,
)

@proceedings    ( OODS86,
key    =    "Oods" ,
title    =    "Proceedings of the 1986 International Workshop on
Object-Oriented Database Systems" ,
organization=    "ACM/IEEE" ,
publisher=    "IEEE Computer Society" ,
address    =    "Asilomar Conference Center, Pacific Grove, CA" ,
editor    =    "Dittrich, K. and Dayal, U." ,
year    =    "1986" ,
month    =    "sep" ,
bibdate    =    "Tue Nov 18 16:34:23 1986" ,
owner    =    "rts" ,
)

@manual        ( ORACLE87,
key    =    "Oracle" ,
author    =    "Oracle Computer, Inc." ,
title    =    "ORACLE Terminal User's Guide" ,
year    =    "1987" ,
organization=    "Oracle Corporation" ,
bibdate    =    "Mon Jun 24 19:31:11 1991" ,
owner    =    "soo" ,
)

@inproceedings    ( OREN85,
key    =    "Oren" ,
author    =    "Oren, O." ,
title    =    "Integrity Constraints in the Conceptual Schema
Language {SYSDOC}" ,
booktitle=    "Proceedings 1985 International Conference on the
Entity Relationship Approach" ,
pages    =    "270--278" ,
publisher=    "IEEE Press" ,
address    =    "New York" ,
year    =    1985 ,
annote    =    "Early work in using constraints to start adding
semantics. Distinction drawn between semantic and structural
constraints." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@techreport    ( ORENSTEIN85,
key    =    "Orenstein" ,
author    =    "Orenstein, J. A." ,
title    =    "Spatial Query Processing in PROBE" ,
institution=    "Computer Corporation of America" ,
year    =    "1985" ,
month    =    "dec" ,
pages    =    "1--87" ,
bibdate    =    "Fri Dec 22 14:28:24 1989" ,
owner    =    "robyn" ,
)

@article    ( ORENSTEIN88,
key    =    "Orenstein \& Manola" ,
author    =    "Orenstein, J.A. and Manola, F.A." ,
title    =    "PROBE Spatial Data Modeling and Query Processing
in an Image Database Application" ,
journal    =    "tse" ,
publisher=    "ieee" ,
volume    =    "14" ,
number    =    "5" ,
month    =    "may" ,
year    =    "1988" ,
pages    =    "611--629" ,
keywords=    "object-oriented database system; spatial data;
spatial query" ,
abstract=    "The PROBE research project has produced results in
the areas of data modeling, spatial/temporal query processing,
recursive query processing, and database system architecture for
``nontraditional'' application areas, many of which involve spatial
data and data with complex structure. PROBE provides the point set as
a construct for modeling spatial data. This abstraction is compatible
with notions of spatial data found in a wide variety of applications.
PROBE is extensible and supports a generalization hierarchy, so it is
possible to incorporate application-specific implementations of the
point set abstraction. PROBE's query processor supports point sets
with the geometry filter, an optimizer of spatial queries. Spatial
queries are processsed by decomposing them into 1- a set-at-a-time
portion that is evaluated efficiently by the geometry filter and 2- a
portion that involves detailed manipulations of individual spatial
objects by functions supplied with the application-specific
representation. The output from the first step is an approximate
answer, which is refined in the second step. The data model and the
geometry filter are valid in all dimensions, and they are compatible
with a wide variety of representations. PROBE's spatial data model and
geometry filter are described, and it is shown how these facilities
can be used to support image database applications." ,
bibdate    =    "Fri Jul 15 11:05:40 1988" ,
owner    =    "payne" ,
)

@inproceedings    ( OSBORN88,
key    =    "Osborn" ,
author    =    "Osborn, S." ,
title    =    " Identity Equality and Query Optimization" ,
booktitle=    "Advances in Object Oriented Database Systems 2nd
International Workshop on Object Oriented Database Systems" ,
pages    =    "346--351" ,
publisher=    "Springer-Verlag" ,
address    =    "New York" ,
month    =    "sep" ,
year    =    1988 ,
annote    =    "The major thrust of the paper is to introduce an
abstract notion of an object, and class hierarchy, and then define a
set of algebraic operators on this model, which are similar to the
relational algebra. A distinction is made between object that are
identical and equal. She defines 3 operations for objects that are
sets (Union, Intersection, Subtraction), and operators that are
operate on any objects; Combine Partition, and Choose. The actions of
the operators are explained, and their commutative and distributive
behavior outlined." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( OTOO85,
key    =    "Otoo" ,
author    =    "Otoo, E.J." ,
title    =    "A Multidimensional Digital Hashing Scheme for
Files With Composite Keys" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "214--229" ,
bibdate    =    "Tue Jun 11 13:24:13 1985" ,
)

@inproceedings    ( OUKSEL83,
key    =    "Ouksel \& Scheuermann" ,
author    =    "Ouksel, M. and Scheuerman, P." ,
title    =    "Storage Mappings For Multidimensional Linear
Dynamic Hashing" ,
booktitle=    "Proceedings of Data Systems" ,
organization=    "acm" ,
publisher=    "acm" ,
year    =    "1983" ,
pages    =    "90--105" ,
bibdate    =    "Tue Mar  5 15:20:49 1985" ,
)

@article    ( OZSOYOGLOU87,
key    =    "Ozsoyoglou et al." ,
author    =    "Ozsoyoglou, G. and Ozsoyoglou, Z.~M. and Matos, V." ,
title    =    "Extending Relational Algebra and Relational
Calculus with Set-Valued Attributes and Aggregate Functions" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "12" ,
number    =    "4" ,
year    =    "1987" ,
pages    =    "566--592" ,
bibdate    =    "Tue Jul 20 17:11:56 1993" ,
owner    =    "bib" ,
)

@inproceedings    ( OZSOYOGLU83B,
key    =    (\"{O}zsoyo\v{g}lu \& \"{O}zsoyo\v{g}lu) ,
author    =    (\"{O}zsoyo\v{g}lu, Z.M. and \"{O}zsoyo\v{g}lu, G.) ,
title    =    "An Extension of Relational Algebra for Summary
Tables" ,
booktitle=    "Proc. of the Second Intl. Workshop on SDB
Management" ,
year    =    "1983" ,
abstract=    "A Summary table is one of the useful data
structures used in statistical databases. For an algebraic summary
table manipulation language, we first extend relational algebra for
nested relations and aggregate functions, then propose a summary table
manipulation language based on the extended algebra. A new operator,
called aggregation-by-template is introduced, and other operators of
the relational algebra are modified to apply to nested relations.
Properties of these operators and algebraic rules involving
aggregation-by-template and other operators of the relational algebra
are stated. A special case of summary tables, called primitive summary
table, is distinguished since it can be directly represented by a
nested relation. Primitive summary tables are viewed as building
blocks of summary tables. Operators for constructing and manipluating
summary tables, and their properties are also discussed." ,
address    =    "Los Altos, CA" ,
month    =    "sep" ,
pages    =    "202--212" ,
bibdate    =    "Tue Nov 21 10:33:04 1989" ,
owner    =    "rts" ,
)

@inproceedings    ( OZSOYOGLU84A,
key    =    (\"{O}zsoyo\v{g}lu \& \"{O}zsoyo\v{g}lu) ,
author    =    (\"{O}zsoyo\v{g}lu, Z.M. and \"{O}zsoyo\v{g}lu, G.) ,
title    =    "Summary-Table-By-Example: A Database Query
Language for Manipulating Summary Data" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
month    =    "apr" ,
year    =    "1984" ,
pages    =    "193--202" ,
abstract=    "In this paper we introduce the notion of summary
table and a hgh level nonprocedural language, Summary-Table-By-Example
(STBE) to manipulate summary data in databases. STBE is similar to
Query-by-Example in that it uses graphical two-dimensional objects
such as relations and summary tables in formulating a relational
database query. STBE is an extension of the Aggregates-by-example
database language. STBE may be used in general-purpose databases and
statistical databases to extract and format summary data in a tabular
form. It is believed to be user-friendly and sufficiently powerful to
be used in application areas such as medical research, health
planning, energy production and consumption, scientific experiments,
political planning and office automation. STBE is relatively complete,
i.e., its expressive power is at least that of the relational calculus
extended to allow set-valued attributes and aggregate functions." ,
bibdate    =    "Wed Sep  2 14:28:13 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( OZSOYOGLU84B,
key    =    (\"{O}zsoyo\v{g}lu \& \"{O}zsoyo\v{g}lu) ,
author    =    (\"{O}zsoyo\v{g}lu, Z.M. and \"{O}zsoyo\v{g}lu, G.) ,
title    =    "Summary-Table-By-Example: A Database Query
Language for Manipulating Summary Data" ,
booktitle=    "Proceedings of the COMPDEC Conference" ,
organization=    "IEEE" ,
address    =    "Chicago" ,
month    =    "nov" ,
year    =    "1984" ,
abstract=    "In this paper we introduce the notion of summary
table and a high level nonprocedural language,
Summary-table-By-Example (STBE) to manipulate summary data in
databases. STBE is similar to Query-by-Example in that it uses
graphical two-dimensional objects such as relations and summary tables
in formulating a relational database query. STBE is an extension of
the Aggregates-by-example database language. STBE may be used in
general-purpose databases and statistical databases to extract and
format summary data in a tablular furm. It is believed to be
user-friendly and sufficiently powerful to be used in application
areas such as medical research, health planning, energy production and
consumption, scientific experiments, political planning and office
automation. STBE is relationally complete, i.e., its expresive power
is at least that of the relational calculus extended to allow
set-valued attributes and aggregate functions." ,
bibdate    =    "Tue Nov 21 10:40:14 1989" ,
owner    =    "rts" ,
)

@inproceedings    ( OZSOYOGLU85,
key    =    (\"{O}zsoyo\v{g}lu et al.) ,
author    =    (\"{O}zsoyo\v{g}lu, G. and \"{O}zsoyo\v{g}lu, Z.M.
and Mata, F.) ,
title    =    "A Language and a Physical Organization Technique
for Summary Tables" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "3--16" ,
abstract=    "A summary table is a tabular representation of
summary data, and is a useful data structure for statistical
databases. Primitive summary tables are basic building blocks of
summary tables, and can be represented as relations with set-valued
attributes. In this paper, we propose a set of summary table
manipulation operators that, together with an algebra of set-valued
relations, form an algebraic language for manipulating set-valued
relations and arbitrary summary tables. We then describe a physical
organization technique for summary tables, and discuss an
implementation for summary table operators utilizing this technique." ,
bibdate    =    "Tue Jun 11 11:10:02 1985" ,
)

@article    ( OZSOYOGLU85A,
key    =    (\"{O}zsoyo\v{g}lu \& \"{O}zsoyo\v{g}lu) ,
author    =    (\"{O}zsoyo\v{g}lu, G. and \"{O}zsoyo\v{g}lu, Z.) ,
title    =    "Statistical Database Query Languages" ,
journal    =    "tse" ,
volume    =    "SE-11" ,
number    =    "10" ,
pages    =    "1071--1081" ,
month    =    "oct" ,
year    =    "1985" ,
bibdate    =    "Thu Nov  8 11:41:04 1990" ,
owner    =    "robyn" ,
)

@techreport    ( OZSOYOGLU86A,
key    =    (\"{O}zsoyo\v{g}lu et al.) ,
author    =    (\"{O}zsoyo\v{g}lu, G. and \"{O}zsoyo\v{g}lu, Z.M.
and Matos, V.) ,
title    =    "Extending Relational Algebra and Relational
Calculus with Set-Valued Attributes and Aggregate Functions" ,
institution=    "Department of Computer Engineering and Science,
Case Western Reserve University" ,
address    =    "Cleveland, OH" ,
year    =    "1986" ,
bibdate    =    "Fri Mar 14 13:53:24 1986" ,
owner    =    "rts" ,
)

@inproceedings    ( OZSOYOGLU87B,
key    =    (\"{O}zsoyo\v{g}lu \& Yuan) ,
author    =    (\"{O}zsoyo\v{g}lu, Z.~M. and Yuan, L.-Y.) ,
title    =    "A Design Method for Nested Relational Databases" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, Ca" ,
month    =    "feb" ,
year    =    "1987" ,
pages    =    "599--608" ,
abstract=    "Recently, several researchers have discussed the
advantages of extending the relational model by allowing nested
relations (i.e., nonfirst-normal form relations). The authors address
the problem of designing a database with nested relations with respect
to semantic integrity constraints so that a better model of the real
world can be obtained. They first define a normal form for nested
relations, called nested normal form, utilizing functional and
nultivalued dependencies, and then give an algorithm to obtain such a
database scheme." ,
bibdate    =    "Fri Oct  2 13:19:50 1987" ,
owner    =    "mckenzie" ,
)

@article    ( OZSOYOGLU87C,
key    =    (\"{O}zsoyo\v{g}lu et al.) ,
author    =    (\"{O}zsoyo\v{g}lu, G. and \"{O}zsoyo\v{g}lu, Z.
and Matos, V.) ,
title    =    "Extending Relational Algebra and Relational
Calculus with Set-Valued Attributes and Aggregate Functions" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "12" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1987" ,
pages    =    "566--592" ,
keywords=    "Languages; theory; aggregation; extended
relational algebra and calculus, set-valued relations" ,
abstract=    "In commercial database management systems,
set-valued fields and aggregate functions are commonly supported.
However, the relational database model, as defined by Codd, does not
include set-valued attributes or aggregate functions. Recently, Klug
extended the relational model by incorporating aggregate functions and
by defining relational algebra and calculus languages. In this paper,
relational algebra and relational calculus database query languages,
as defined by Klug, are extended to manipulate set-valued attributes
and to utilize aggregate functions. The algebra with three new
operators, namely, pack, unpack, and aggregation-by-template. The
extended languages form a theoretical framework for statistical
database query languages." ,
bibdate    =    "Tue Jan 26 14:15:55 1988" ,
owner    =    "manning" ,
)

@article    ( OZSOYOGLU89,
key    =    (\"{O}zsoyo\v{g}lu \& Wang) ,
author    =    (\"{O}zsoyo\v{g}lu, G. and Wang, H.) ,
title    =    "A Relational Calculus with Set Operators, Its
Safety, and Equivalent Graphical Languages" ,
journal    =    "tse" ,
volume    =    "15" ,
number    =    "9" ,
month    =    "sep" ,
year    =    "1989" ,
pages    =    "1038--1052" ,
keywords=    "Databases; query languages; relational calculus;
safety" ,
abstract=    "This paper proposes a relational calculus (RC/S)
which uses set comparison and set manipulation operators to replace
universal quantifiers and negations (with the exception of formulas of
type R(x), i.e., 'x is not in R'). We argue that, compared to the
relational calculus (RC) of Codd, RC/S queries are easier to construct
and equivalent to the expressive power of RC/S, and give algorithms
for translating an RC query into an RC/S query and vice versa. We
define a safe RC/S query as one that has finite output and that can be
evaluated in finite time. We then define a subset of RC/S queries,
called RC/S*, and prove that RC/S* is safe. RC/S* is compared to the
existing largest safe subsets of RC, i.e., the evaluable formulas and
the allowed formulas. We give algorithms to transform any evaluable
formula into an RC/S* query. Also, some RC/S* formulas that are not
evaluable are given. RC/S* queries can be directly implemented using a
graphical language similar to Query-by-Example (QBE). We briefly
describe two different graphical languages that are equivalent to the
RC/S* in expressive power, and compare these languages to the QBE." ,
bibdate    =    "Mon Sep 25 15:13:17 1989" ,
owner    =    "robyn" ,
)

@article    ( OZSOYOGLU89A,
key    =    (\"{O}zsoyo\v{g}lu et al.) ,
author    =    (\"{O}zsoyo\v{g}lu, G. and Matos, V. and
\"{O}zsoyo\v{g}lu, Z.M.) ,
title    =    "Query Processing Techniques in the
Summary-Table-by-Example Database Query Language" ,
journal    =    "tods" ,
volume    =    "14" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1989" ,
pages    =    "526--573" ,
keywords=    "Extended relational algebra; STBE; statistical
database management systems" ,
abstract=    "Summary-Table-by-Example (STBE) is a graphical
language suitable for statistical database applications. STBE queries
have a hierarchical subquery structure and manipulate summary tables
and relations with set-valued attributes. The hierarchical arrangement
of STBE queries naturally implies a tuple-by-tuple subquery evaluation
strategy (similar to the nested loops join implementation technique)
which may not be the best query processing strategy. In this paper we
discuss the query processing techniques used in STBE. We first convert
an STBE query into an 'extended' relational algebra (ERA) expression.
Two transformations are introduced to remove the hierarchical
arrangement of subqueries so that query optimization is possible. To
solve the 'empty partition' problem of aggregate function evaluation,
directional join (one-sided outer-join) is utilized. We give the
algebraic properties of the ERA operators to obtain an 'improved' ERA
expression. Finally we briefly discuss the generation of alternative
implementations of a given ERA expression. STBE is implemented in a
prototype statistical database management system. We discuss the
STBE-related features of the implemented system." ,
bibdate    =    "Thu Feb  1 14:26:50 1990" ,
owner    =    "robyn" ,
)

@article    ( OZSOYOGLU90A,
key    =    (\"{O}zsoyo\v{g}lu \& \"{O}zsoyo\v{g}lu) ,
author    =    (\"{O}zsoyo\v{g}lu, G. and \"{O}zsoyo\v{g}lu, Z.M.) ,
title    =    "Statistical Database Query Languages" ,
journal    =    "tse" ,
publisher=    "IEEE" ,
year    =    "1990" ,
abstract=    "Databases that are mainly used for statistical
analysis are called statistical databases (SDB). A statistical
database management system (SDBMS) may be defined as a database
management system that provides capabilities (i) to model, store and
manipulate data in a manner suitable for the needs of SDB users, and
(ii) to apply statistical data analysis techniques that range from
simple summary statistics to advanced procedures. This paper surveys
the existing and proposed SDB data definition and data manipulation
(i.e., query) languages." ,
bibdate    =    "Tue Nov 21 10:48:00 1989" ,
owner    =    "rts" ,
)

@article    ( OZSOYOGLU93,
key    =    "Ozsoyoglu \& Wang" ,
author    =    "Ozsoyoglu, G. and Wang, H." ,
title    =    "Example-Based Graphical Database Query Languages" ,
journal    =    "IEEE Computer" ,
publisher=    "ieee" ,
volume    =    "26" ,
number    =    "5" ,
month    =    "may" ,
year    =    "1993" ,
pages    =    "25--38" ,
bibdate    =    "Thu Jul  8 22:00:09 1993" ,
owner    =    "daisyc" ,
)

@article    ( OZSOYOVGLU82,
key    =    (\"{O}zsoyo\v{g}lu \& Chin) ,
author    =    (\"{O}zsoyo\v{g}lu, Gultekin and Chin, Francis Y.) ,
title    =    "Enhancing the Security of Statistical Databases
with a Question-Answering System and a Kernel Design" ,
journal    =    "IEEE Transactions on Software Engineering" ,
year    =    "1982" ,
volume    =    "SE-8" ,
number    =    "3" ,
pages    =    "223--234" ,
month    =    "May" ,
)

@inproceedings    ( PAEPCKE89,
key    =    "Paepcke" ,
author    =    "Paepcke, A." ,
title    =    "PCLOS: A Critical Review" ,
booktitle=    "OOPSLA'89 Conference Proceedings -- Special issue
of Sigplan Notices" ,
publisher=    "Acm Press" ,
address    =    "New Orleans" ,
volume    =    "24" ,
month    =    "oct" ,
year    =    "1989" ,
pages    =    "221--237" ,
abstract=    "This paper uses the persistent object system PCLOS
to survey some problems and benefits of object persistence. The system
is analyzed along several relevant dimensions. PCLOS provides object
persistence for an object-oriented language. The insights gained on
desirable and detrimental components of the system are presented. The
intent is to outline some of the expected and unexpected problems
encountered in the construction of support for object persistence." ,
bibdate    =    "Thu Apr 22 15:56:28 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( PAGE85,
key    =    "Page et al." ,
author    =    "Page, Jr., T.W. and Weinstein, M.J. and Popek,
G.J." ,
title    =    "Genesis: A Distributed Database Operating System" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "374--387" ,
bibdate    =    "Wed Jun 12 11:50:17 1985" ,
)

@techreport    ( PALLEY76,
key    =    "Palley et al." ,
author    =    "Palley, N. A. et al." ,
title    =    "CLINFO User's Guide: release one" ,
number    =    "R-1543-1-NIH" ,
institution=    "Rand Corporation" ,
year    =    "1976" ,
address    =    "Santa Monica, CA" ,
bibdate    =    "Thu Oct  6 22:48:56 1983" ,
)

@article    ( PALLEY87,
key    =    "Pallet \& Simonoff" ,
author    =    "Pallet, M. and Simonoff, J." ,
title    =    "The Use of Regression Methodology for the
Compromise of Confidential Information in Statistical Databases" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "12" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1987" ,
pages    =    "593--608" ,
keywords=    "Management; security; compromise; confidentiality;
disclosure; inference controls; privacy; synthetic database; U.S.
Census database" ,
abstract=    "A regression methodology based technique can be
used to compromise confidentiality in a statistical database. This
holds true even when the DBMS prevents application of regression
methodology to the database. Existing inference controls, including
cell restriction, perturbation, and table restriction approaches, are
shown to be generally inefffective against this compromise technique.
The effect of incomplete supplemental knowledge on the regression
methodology based compromise technique is examined. Finally, some
potential complicators of this disclosure scheme are introduced." ,
bibdate    =    "Tue Jan 26 14:20:59 1988" ,
owner    =    "manning" ,
)

@techreport    ( PANG88,
key    =    "Pang" ,
author    =    "Pang, Y." ,
title    =    "Buffering and Disk Accesses" ,
number    =    "UIUC-ENG-88-1737" ,
institution=    "Department of Computer Science" ,
address    =    "University of Illinois at Urbana-Champaign" ,
year    =    "1988" ,
month    =    "may" ,
pages    =    "1--22" ,
abstract=    "We present an algorithm and approximate formulas
for estimating disk accesses while accessing a file randomly with
buffering. We discuss the derivation of the algorithm and formulas. We
also did extensive simulations and compared the results with our
formulas. The formulas are accurate enough for many applications such
as performance evaluation and query optimization." ,
owner    =    "payne" ,
bibdate    =    "Mon Jul 25 15:33:59 1988" ,
)

@article    ( PARENT85,
key    =    "Parent \& Spaccapietra" ,
author    =    "Parent, C. and Spaccapietra, S." ,
title    =    "An Algebra for a General Entity-Relationship Model" ,
journal    =    "tse" ,
publisher=    "IEEE" ,
volume    =    "SE-11" ,
number    =    "7" ,
month    =    "jul" ,
year    =    "1985" ,
pages    =    "634--643" ,
keywords=    "Algebra; algebraic operators; completeness; data
manipulation language; data model; entity-relationship model" ,
abstract=    "Although many data manipulation languages (DML's)
have been proposed for the entity-relationship (ER) model, there is no
agreement on what are the basic manipulations that any ER DML must
offer. Moreover, there is no DML which fully supports all the
capabilities of a general ER model with n-ary relationships,
relationships with attributes, optional, complex, and multivalued
attributes. This paper consequently proposes a definition of a set of
algebraic operators to be applied on a general ER database. The
algebra is said to be complete through equivalence with the usual
definition of completeness for relational data manipulation languages.
This work is intended to provide a sound basis for the definition of
complete entity-relationship DML's, an essential feature to make the
ER model fully operational." ,
bibdate    =    "Tue Jan 20 12:29:00 1987" ,
owner    =    "manning" ,
)

@article    ( PARISH90,
key    =    "Parish" ,
author    =    "Parish, Tom" ,
title    =    "Crystal Clear Storage" ,
journal    =    "Byte" ,
year    =    "1990" ,
volume    =    "" ,
number    =    "" ,
pages    =    "283--288" ,
month    =    "November" ,
)

@inproceedings    ( PARK88A,
key    =    "Park \& Segev" ,
author    =    "Park, J. and Segev, A." ,
title    =    "Using common subexpression to optimize multiple
queries" ,
booktitle=    "Proc. 4th Int. Conf. Data Eng." ,
organization=    "ieee" ,
month    =    "feb" ,
year    =    "1988" ,
pages    =    "311--319" ,
bibdate    =    "Mon Oct 23 13:57:30 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( PARKER89,
key    =    "Parker et al." ,
author    =    "Parker, D. S. and Muntz, R. R. and Chau, H. L." ,
title    =    "The Tangram Stream Query Processing System" ,
booktitle=    "Proceedings of the Fifth International Conference
on Data Engineering" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1989" ,
pages    =    "556--563" ,
abstract=    "Modeling applications routinely generate large
quantities of simulation data, and analysis of this data requires a
system that differs in significant ways from existing database
systems. The data often takes the form of time series, and query
processing requires both stream processing techniques and heavy
numerical computations. Tangram is an environment for modeling under
development at UCLA. One of the driving concepts behind Tangram has
been the combination of large-scale data access and data reduction
with a powerful programming environment. The Tangram environment is
based on Prolog, extending it with a number of features, including
process management, distributed database access, and generalized
stream processing. This paper describes the Tangram Stream Processor
(TSP), the part of the Tangram environment performing query processing
on large streams of data. The paradigm of transducers on streams is
used throughout this system, providing a 'database-flow' computation
capability." ,
bibdate    =    "Fri Jan 12 11:08:12 1990" ,
owner    =    "robyn" ,
)

@article    ( PARRISH89,
key    =    "Parrish" ,
author    =    "Parrish, Edward A." ,
title    =    "A Foreword to Knowledge and Data Engineering" ,
journal    =    "IEEE Transactions on Knowledge and Data
Engineering" ,
year    =    "1989" ,
volume    =    "1" ,
number    =    "1" ,
pages    =    "5--7" ,
month    =    "March" ,
)

@inproceedings    ( PATHAK89,
key    =    "Pathak et al" ,
author    =    "Pathak, G., Joseph, J. Ford, S." ,
title    =    "Object eXchange Service for an Object-Oriented
Database System" ,
booktitle=    "Proceedings of the Fifth International Conference
on Data Engineering" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1989" ,
pages    =    "27--34" ,
abstract=    "This article describes an Object eXchange Service
(OXS) and an EXTernal Object Representation (EXTOR) in the context of
a distributed object-oriented database. EXTOR is the common
representation which facilitates the sharing of information among a
network of machines. This work is guided by the desire to represent
complex structured information in an efficient external form and to
provide maximal sharing of information among computing sessions. OXS
is a service which, together with the concepts of object boundary,
global objects, and object closure, provides the exchange of
information via EXTOR. The article also contains a brief description
of the distributed object-oriented system which utilizes this service,
the performance results of OXS, and the future directions for the
design of generalized object exchange services in heterogeneous
computing environments. The work described here is part of Zeitgeist,
a Distributed Object-Oriented Database system which is being developed
at the Computer Science Center of Texas Instruments, Dallas." ,
bibdate    =    "Fri Jan 12 09:33:03 1990" ,
owner    =    "robyn" ,
)

@inproceedings    ( PAUL87,
key    =    "Paul et al." ,
author    =    "Paul, H.-B. and Schek, H.-J. and Scholl, M. and
Weikum, G. and Deppisch, U." ,
title    =    "Architecture and Implementation of the Darmstadt
Database Kernel System" ,
booktitle=    "sigmod" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
volume    =    "14" ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "196--207" ,
abstract=    "The multi-layered architeture of the DArmStadt
Data Base System (DASDBS) for advanced applications is introduced.
DASDBS is conceived as a family of application-specific database
systems on top of a common database kernel system. The main design
problem considered here is: What features are common enough to be
integrated into the kernel and what feaures are rather
application-specific? Kernel features must be simple enough to be
efficiently implemented and to serve a broad class of clients, yet
powerful enough to form a convenient basis for application-oriented
layers. Our kernel provides mechanisms to efficiently store
hierarchically structured complex objects, and offers operations which
are set-oriented and can be processed in a single scan through the
objects. To achieve high concurrency in a layered system, a
multi-level transaction methodology is applied. First experiences with
our current implementation and some lessons we have learned from it
are reported." ,
bibdate    =    "Sun Nov 17 20:06:56 1991" ,
owner    =    "soo" ,
)

@article    ( PAZEL83,
key    =    "Pazel et al." ,
author    =    "Pazel, D.P. and Malhotra, A. and Markowitz, H.M." ,
title    =    "The System Architecture of EAS-E: An Integrated
Programming and Data Base Language" ,
journal    =    "IBM Systems Journal" ,
publisher=    "IBM" ,
volume    =    "22" ,
number    =    "3" ,
month    =    "mar" ,
year    =    "1983" ,
pages    =    "188--198" ,
bibdate    =    "Tue Jan 20 13:00:57 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( PENNEY87,
key    =    "Penney et al." ,
author    =    "Penney, D.J. and Stein, J. and Maier, D." ,
title    =    "Is the Disk Half Full or Half Empty?: Combining
Optimistic and Pessimistic Concurrency Mechanisms in a Shared,
Persistent Object Base" ,
booktitle=    "Workshop on Persistent Object Systems" ,
address    =    "Appin Scotland" ,
month    =    "aug" ,
year    =    "1987" ,
abstract=    "GemStone is a server for shared, persistent
objects. Its language interface, OPAL, attempts to give the programmer
a simple view of the database: a private workshop of objects with no
explicit distinction between persistent and temporary objects. Since
GemStone is a multi-user system, this illusion cannot be complete:
other users can be concurrently modifying the database in conflicting
ways. In order to guarantee serializability of updates, GemStone uses
transactions governed by an optimistic concurrency control mechanism.
While optimistic concurrency control has several advantages, it has
the disadvantage that a transaction can lose arbitrary amounts of work
when it attempts to commit and is prevented from doing so by a
conflict. This paper considers various means of providing pessimistic
concurrency control in addition to our optimistic mechanism. While
pessimistic control is more intrusive on the private workspace view,
it does prevent loss of work, and can be made optional. We examine
some of the design decisions that arise in adding pessimistic control,
locking modes, acquisition and release of locks, and conflict
resolution between optimistic and pessimistic transactions. After
discussing alternate solutions to each of these areas, we present a
plan for adding pessimistic concurrency control to the GemStone
system." ,
bibdate    =    "Wed Mar 29 19:48:55 1989" ,
owner    =    "payne" ,
)

@inproceedings    ( PENNEY87A,
key    =    "Penney \& Stein" ,
author    =    "Penney, D.J. and Stein, J." ,
title    =    "Class Modification in the GemStone Object-oriented
DBMS" ,
booktitle=    "oopsla" ,
organization=    "ACM" ,
year    =    "1987" ,
pages    =    "111--117" ,
bibdate    =    "Tue Mar 16 11:11:15 1993" ,
owner    =    "rts" ,
)

@inproceedings    ( PIATETSKY84,
key    =    "Piatetsky-Shapiro \& Connell" ,
author    =    "Piatetsky-Shapiro, G. and Connell, C." ,
title    =    "Accurate Estimation of the Number of Tuples
Satisfying a Condition" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Yormark, B." ,
publisher=    "acm" ,
address    =    "Boston, MA" ,
month    =    "jun" ,
pages    =    "256--276" ,
year    =    "1984" ,
abstract=    "We present a new method for estimating the number
of tuples satisfying a condition of the type attribute rel constant,
where rel is one of . Our method gives highly accurate yet easy to
compute estimates. We store information about attribute values as a
list of distribution steps (histograms where buckets, instead of
having equal width, have equal height). These distribution steps
provide an upper bound on the error when estimating the number of
tuples satisfying a condition. The estimation error can be arbitrarily
reduced by increasing the number of steps. We analyze desirable
conditions that such estimates should satisfy. Based ont he
distribution steps, we derive a set of estimation formulas which
mimimize the worst-case error. We also present another set of
forumulas which reduce the average-case error. Finally, we show how to
use sampling to compute a close approximation of the distribution
steps very quickly. The major applications of our method are in query
optimization and in answering statistical queries." ,
bibdate    =    "Mon Oct  1 15:48:14 1984" ,
)

@article    ( PIATETSKYSHAPIRO83,
key    =    "Piatetsky-Shapiro" ,
author    =    "Piatetsky-Shapiro, Gregory" ,
title    =    "The Optimal Selection of Secondary Indices is
NP-Complete" ,
journal    =    "ACM SIGMOD Record" ,
year    =    "1983" ,
volume    =    "13" ,
number    =    "2" ,
pages    =    "72--75" ,
month    =    "January" ,
)

@inproceedings    ( PIRAHESH92,
key    =    "Pirahesh et al." ,
author    =    "Pirahesh, H. and Hellerstein, J. M. and Hassan, W." ,
title    =    "Extensible/Rule Based Query Rewrite Optimization
in Starburst" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "San Diego, California" ,
editor    =    "Stonebraker, M." ,
volume    =    "21" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "39--48" ,
abstract=    "This paper describes the Query Rewrite facility of
the Starburst extensible database system, a novel phase of query
optimization. We present a suite of rewrite rules used in Starburst to
transform queries into equivalent queries for faster execution, and
also describe the production rule engine which is used by Starburst to
choose and execute these rules. Examples are provided demonstrating
that these Query Rewrite transformations lead to Query execution time
improvements of orders of magnitude, suggesting that Query Rewrite in
general -- and these rewrite rules in particular -- are an essential
step in query optimization for modern database systems." ,
bibdate    =    "Mon Jan 25 13:30:29 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( PISTOR86A,
key    =    "Pistor \& Anderson" ,
author    =    "Pistor, P. and Andersen, F." ,
title    =    "Designing a Generalized NF2 Model with an SQL-Type
Language Interface" ,
booktitle=    "vldb" ,
address    =    "Kyoto, Japan" ,
editor    =    "Kambayashi, Y." ,
month    =    "aug" ,
year    =    "1986" ,
pages    =    "278--285" ,
abstract=    "Because of its small set of data types, the
relational model is constrained to simply structured data management
tasks. For more advanced applications like engineering databases in
the CAD/CAM area even a powerful extension like the NF2 model is
insufficient, yet: Important concepts like order and duplicates are
not supported appropriately, and the free usage of composite items is
prohibited by inherent asymmetries. These drawbacks can be removed by
a data model which supports atomic data, list, multisets, and tuples
in an orthogonal fashion. The necessary operations can be provided in
an SQL-like framework. Compared with existing approaches, the
expressive power could considerably be increased; nevertheless, the
proposed SQL dialect has not become more complicated for comparable
tasks, but more consistent and easier to understand." ,
bibdate    =    "Fri Nov 20 11:12:25 1987" ,
owner    =    "mckenzie" ,
)

@techreport    ( PLOUFFE83,
key    =    "Plouffe et al." ,
author    =    "Plouffe, W. and Kim, W. and Lorie, R. and McNabb,
D." ,
title    =    "Versions in an Engineering Database System" ,
type    =    "IBM Research Report" ,
number    =    "RJ4085" ,
institution=    "IBM Research" ,
address    =    "San Jose, CA" ,
year    =    "1983" ,
month    =    "oct" ,
bibdate    =    "Fri Jan  7 15:27:37 1994" ,
owner    =    "rts" ,
)

@proceedings    ( POPOVICH91,
key    =    "Popovich et al." ,
title    =    "An Object-Based Approach to Implementing
Distributed Concurrency Control" ,
organization=    "IEEE" ,
publisher=    "The 11th International conference on Distributed
Computing Systems" ,
author    =    "Popovich, Steven S. and Shyhtsun F. Wu and Gail E.
Kaiser" ,
year    =    "1991" ,
month    =    "may" ,
abstract=    "We have implemented distributed concurrency
control by representing in-progress transactions as simulated objects,
called transaction objects, that use normal mesage passing facilities.
We have completed the implementation of an optimistic mechanism using
transaction objects and have designed a two-phase locking mechanism.
We discuss the tradeoffs make and lessons learned, dealing with
transactions both on objects and as objects." ,
bibdate    =    "Sat Sep 21 16:35:13 1991" ,
owner    =    "suchen" ,
)

@article    ( PREMERLANI90,
key    =    "Premerlani et al." ,
author    =    "Premerlani, W. and Blaha, M. and Rumbaugh, J. and
Varwig, T." ,
title    =    " An Object Oriented Relational Database" ,
journal    =    "cacm" ,
volume    =    33 ,
pages    =    "99--109" ,
month    =    "nov" ,
year    =    1990 ,
annote    =    "A proposal for an implementation of a 'OODBMS' by
having the SQL calls to an RDB embedded in the procedures of a class.
The most interesting feature is a buffering of the requests to create
and manipulate objects in memory before sending them to the DB to cut
down on the number of calls to the RDB procedures." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( PU88A,
key    =    "Pu" ,
author    =    "Pu, C." ,
title    =    " Superdatabases for Composition of Heterogeneous
Databases" ,
booktitle=    "Proceedings Fourth International Conference on
Data Engineering" ,
pages    =    "548--555" ,
publisher=    "IEEE" ,
address    =    "New York " ,
month    =    "feb" ,
year    =    1988 ,
annote    =    "The proposal is to nest heterogeneous systems in a
tree like structure with each node containing a global schema for
itself, and all its child nodes. Thus the schema itself is
distributed. The main interest seems to being how this can aid in
concurrency control." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@techreport    ( PUGH88,
key    =    "Pugh" ,
author    =    "Pugh, William Worthington" ,
title    =    "Incremental Computation and the Incremental
Evaluation of Functional Programs" ,
institution=    "Cornell University" ,
year    =    "1988" ,
type    =    "Ph.D. Dissertation," ,
number    =    "" ,
address    =    "" ,
month    =    "" ,
)

@article    ( PURDY87,
key    =    "Purdy et al." ,
author    =    "Purdy, A. and Schuchardt, B. and Maier, D." ,
title    =    "Integrating An Object Server with Other Worlds" ,
journal    =    "tois" ,
publisher=    "acm" ,
volume    =    "5" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1987" ,
pages    =    "27--47" ,
keywords=    "GemStone; object-oriented environment; object
server; Smalltalk-80" ,
abstract=    "Object-oriented database servers are beginning to
appear on the commercial market in response to a demand by application
developers for increased modeling power in database systems. Before
these new servers can enhance the productivity of application
designers, systems designers must provide simple interfaces to them
from both procedural and object-oriented languages. This paper first
describes a successful interface between an object server and two
procedural languages-C and Pascal. Because C and Pascal do not support
the object-oriented paradigm application, designers using these
languages must deal with database objects in less than natural ways.
Fortunately, workstations supporting object-oriented languages have
the potential for interacting with database objects in a much more
integrated manner. To integrate these object-oriented workstations
with an object server, we provide a design framework based on the
notion of workstation agent objects representing principal objects in
the database. We distinguish two types of agents-proxies, which
forward most messages to the principal objects, and deputies, which
can cache state for their principal and act with more autonomy. The
interaction of cache, transaction and message management strategies
makes the implementation of deputies a nontrival problem. The agent
metaphor is being used currently to integrate an object server with a
Smalltalk-80 workstation." ,
bibdate    =    "Wed Mar 29 19:41:06 1989" ,
owner    =    "payne" ,
)

@article    ( QIAN90,
key    =    "Qian" ,
author    =    "Qian, X." ,
title    =    "An Axiom System for Database Transactions" ,
journal    =    "Information Processing Letters" ,
publisher=    "Elsevier Science Publishers" ,
year    =    "1990" ,
pages    =    "183--189" ,
keywords=    "databases; formal semantics; program correctness;
program specifications; transaction verification; database integrity;
data manipulation language" ,
bibdate    =    "Tue Feb 26 10:31:43 1991" ,
owner    =    "robyn" ,
)

@article    ( QIAN91,
key    =    "Qian \& Widerhold" ,
author    =    "Qian, X. and Widerhold, G." ,
title    =    "Incremental Recomputation of Active Relational
Expressions" ,
journal    =    "tkde" ,
publisher=    "IEEE" ,
volume    =    "3" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1991" ,
pages    =    "337--341" ,
abstract=    "Database updates are small and incremental
compared to database contents. It is therefore desirable that
recomputations of active relational expressions-such as views, derived
data, integrity constraints, active queries, and monitors-can be
performed incrementally as well. We present an efficient algorithm for
the incremental recomputation of active relational expressions based
on finite differencing techniques. Database updates are modeled as
incremental changes to database relations, and the algorithm derives,
by update propagation, the minimal incremental relational expressions
that need recomputation. The algorithm has applications in the
maintenance of materialized views and derived data, the checking of
integrity constraints, and the evaluation of active queries and
monitors." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( RAMAKRISHNAN89,
key    =    "Ramakrishnan \& Emer" ,
author    =    "Ramakrishnan, K.K. and Emer, J.S." ,
title    =    "Performance Analysis of Mass Storage Service
Alternatives for Distributed Systems" ,
journal    =    "tose" ,
publisher=    "ieee" ,
volume    =    "15" ,
number    =    "2" ,
month    =    "feb" ,
year    =    "1989" ,
pages    =    "120--133" ,
keywords=    "closed queueing; network models; disk services;
distributed systems; file services; performance measurement and
modeling, remote mass storage" ,
abstract=    "In this paper, we consider the performance of
alternative mass storage services for a client-server style
distributed system. Some qualitative arguments are presented on the
ramifications of implementations of mass storage services at various
levels of the storage semantics hierarchy. This paper concentrates, in
particular, on contrasting disk and files services. The functionality
of disk and file services are distinguished by their primitive
operations- individual disk block access, for the disk service; and
individual file block access, for the file service. This difference
results in different partitionings of the computation between the
client and server, as well as different network communication
requirements. To understand the ramifications of such differences
between services, this paper presents performance estimiates for basic
disk and file services. To provide a commensurate comparison of the
performance of the two services, a uniform closed queueing network
model was developed that accurately portrayed this
computation-communication tradeoff. Detailed parameterization of the
model was done through measurements of prototype systems. The workload
applied to the mass storage service is based on measurements of
timesharing systems performed in earlier studies. In addition to the
basic comparisons, performance estimates for several design
alternatives are also presented. Some of these performance enhancing
alteratives were caching of file-disk blocks and file-opens,
kernal-based services, and using a network interface able to do gather
write to eliminate data copies." ,
bibdate    =    "Fri Jan 20 19:18:21 1989" ,
owner    =    "payne" ,
)

@article    ( RAMAMOHANARAO82,
key    =    "Ramamohanarao \& Lloyd" ,
author    =    "Ramamohanarao, K. and Lloyd, J." ,
title    =    "Dynamic Hashing Schemes" ,
journal    =    "The Computer Journal" ,
volume    =    "25" ,
number    =    "4" ,
year    =    "1982" ,
pages    =    "478--485" ,
bibdate    =    "Thu Jun  6 22:28:31 1985" ,
)

@article    ( RAMAMOHANARAO84,
key    =    "Ramamohanarao \& Sacks-Davis" ,
author    =    "Ramamohanarao, K. and Sacks-Davis, R." ,
title    =    "Recursive Linear Hashing" ,
journal    =    "tods" ,
volume    =    "9" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1984" ,
pages    =    "369--391" ,
bibdate    =    "Sat Apr 27 22:48:16 1985" ,
)

@mastersthesis    ( RAPOSO81,
key    =    "Raposo" ,
author    =    "Raposo, I.C." ,
title    =    "Analytic Modeling of Data Base Systems: The Design
of a System 2000 Performance Predictor" ,
school    =    "University of Toronto" ,
address    =    "Toronto, Canada" ,
month    =    "jul" ,
year    =    "1981" ,
abstract=    "This thesis presents a design of performance
prediction software for System 2000 data bases. The proposed software
is intended to interface with a generalized queueing network package
for performance predictions in terms of transaction throughputs, mean
response times, and device utilizations. A model is described which
can characterize System 2000 data base design, the physical data base
structure, the data base activity, and various other design decisions.
The model is based on a layered framework which distinguishes several
levels of physical and logical data base decisions that influence
performance. The design has followed the guidelines of a generalized
analytic model of physical data bases which decomposes the physical
data bases into collections of simple files and linksets." ,
bibdate    =    "Fri Aug  8 14:30:41 1986" ,
owner    =    "manning" ,
)

@article    ( RASH88,
key    =    "Rash" ,
author    =    "Rash Jr., Wayne" ,
title    =    "A Quintet of Worms" ,
journal    =    "BYTE" ,
year    =    "1988" ,
volume    =    "" ,
number    =    "" ,
pages    =    "146--151" ,
month    =    "February" ,
)

@inproceedings    ( RATHMANN84A,
key    =    "Rathmann" ,
author    =    "Rathmann, P." ,
title    =    "Dynamic Data Structures on Optical Disks" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
month    =    "apr" ,
year    =    "1984" ,
pages    =    "175--180" ,
abstract=    "Current data structures for online secondary
storage depend on the ability ot alter data once it is written. On an
optical disk such modification is not possible, so new approaches are
needed. In this paper, data structures which allow additions, logical
deletions, and rapid access to data stored on optical disks are
proposed and analyzed." ,
bibdate    =    "Wed Sep  2 14:32:45 1987" ,
owner    =    "mckenzie" ,
)

@article    ( REINHARDT90,
key    =    "Reinhardt" ,
author    =    "Reinhardt, Andrew" ,
title    =    "Playing Catch-Up" ,
journal    =    "Byte" ,
year    =    "1990" ,
volume    =    "" ,
number    =    "" ,
pages    =    "279--279" ,
month    =    "November" ,
)

@techreport    ( REINWALD95,
key    =    "Reinwald et al." ,
author    =    "Reinwald, B. and Dessloch, S. and Carey, M. and
Lehman, T. and Pirahesh, H." ,
title    =    "Making Real Data Persistent: Experiences with SMRC" ,
type    =    "IBM Research Report" ,
number    =    "9928" ,
institution=    "IBM Research Division" ,
address    =    "San Jose, CA" ,
year    =    "1995" ,
month    =    "jan" ,
pages    =    "17" ,
bibdate    =    "Wed Nov 15 13:54:53 1995" ,
abstract=    "The Shared Memory-Resident Cache (SMRC) &cility
under development at IBM Almaden enables persistent C++ data
structures to reside in a relational database by utilizing its binary
large object (BLOB) facilities. Through SMRC, persistent C+ data then
can be accessed both programmatically and through relational queries.
Testing and refinement of the SMRC persistence facility has been
driven by the early adoption of a challenging application, 'graphical
explain,' which provides support for the storage and visualization of
optimized relational query plans. The purpose of this paper is to
report on our early experiences with this application, as it has been
enlightening with respect to the sorts of C++ data structures and
programming practices that must be dealt with in order to make 'real'
C++ data persistent." ,
owner    =    "jeff" ,
)

@inproceedings    ( REISNER75,
key    =    "Reisner et al." ,
author    =    "Reisner, P. and Boyce, R.F. and Chamberlin, D.D." ,
title    =    "Human factors evaluation of two data base query
languages--Square and Sequel" ,
booktitle=    "ncc" ,
publisher=    "AFIPS Press" ,
address    =    "Arlington, VA" ,
year    =    "1975" ,
pages    =    "447--452" ,
bibdate    =    "Mon Jun 17 10:17:47 1991" ,
owner    =    "rts" ,
)

@article    ( REISNER81,
key    =    "Reisner" ,
author    =    "Reisner, P." ,
title    =    "Human Factors Studies of Database Query Languages:
A Survey and Assessment" ,
journal    =    "compsurv" ,
volume    =    "13" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1981" ,
pages    =    "13--31" ,
keywords=    "human factors; behavioral science; database
systems; query languages; data models; procedurality; ;syntax;
evaluation of ease-of-use; improving language design" ,
abstract=    "Empirical studies have been undertaken to measure
the ease-of-use of a query language, compare two or more such
languages for ease-of-use, study controversial issues in query
language design, and provide feedback to designers for improving a
language. Some primitive attempts at constructing abstract models
related to query languages also exist. This paper discusses some of
the techniques that have been used and results obtained. A primary
goal is to show the reader unfamiliar with behavioral research what
the results do and do not mean." ,
bibdate    =    "Wed Apr 24 10:31:40 1985" ,
)

@inbook        ( REITER78A,
key    =    "Reiter" ,
author    =    "Reiter, R." ,
title    =    "On closed world data bases" ,
publisher=    "Plenum Press" ,
address    =    "New York" ,
year    =    "1978" ,
booktitle=    "Logic and Databases" ,
bibdate    =    "Wed Dec 29 21:31:19 1982" ,
)

@article    ( REUTER84,
key    =    "Reuter \& Kinzinger" ,
author    =    "Reuter, A. and Kinzinger, H." ,
title    =    "Automatic Design of the Internal Schema for a
CODASYL Database System" ,
journal    =    "tse" ,
volume    =    "SE-10" ,
number    =    "4" ,
month    =    "july" ,
year    =    "1984" ,
pages    =    "358--375" ,
keywords=    "Analytic modeling; CODASYL; heuristic
optimization; performance prediction; physical database design;
simulation" ,
abstract=    "This paper describes the concepts and
implementation of a design aid for the internal schema of an existing
CODASYL-like database system. It allows for tailoring the storage
structure level to a given logical schema and a specified workload.
According to the 1978 CODASYL report, our DBMS provides two levels of
schema declaration, the DDL-level for logical schema description and a
DSDL-like level for specifying the storage structures to implement the
objects of the logical schema. The repertoire of storage structures
supported by our system is briefly sketched. The performance
predictions our tool uses for finding a good internal schema are
basically heuristic. This approach is justified by weighing its
advantages and shortcomings against those of analytic models and
simulation. Finally, some preliminary user experiences with a pilot
version are related." ,
bibdate    =    "Mon Feb 11 13:50:30 1985" ,
)

@inproceedings    ( RICHARD80,
key    =    "Richard" ,
author    =    "Richard, P." ,
title    =    "Evaluation of the Size of a Query Expressed in
Relational Algebra" ,
booktitle=    "sigmod" ,
volume    =    "10" ,
month    =    "may" ,
year    =    "1980" ,
pages    =    "155--163" ,
bibdate    =    "Fri Apr 26 23:22:05 1985" ,
)

@article    ( RICHARD91,
key    =    "Richard" ,
author    =    "Richard, P." ,
title    =    "Research at Altair" ,
journal    =    "sigmod" ,
volume    =    "20" ,
number    =    "1" ,
month    =    "Mar" ,
year    =    "1991" ,
pages    =    "53--59" ,
bibdate    =    "Wed Mar 20 00:38:50 1991" ,
owner    =    "soo" ,
)

@article    ( RICHARD91A,
key    =    "Richard" ,
author    =    "Richard, P." ,
title    =    "Research at Altair" ,
journal    =    "sigmod" ,
publisher=    "Acm Press" ,
volume    =    "20" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1991" ,
pages    =    "53--59" ,
bibdate    =    "Thu Apr 22 12:02:43 1993" ,
owner    =    "bassili" ,
)

@techreport    ( RICHARDSON86,
key    =    "Richardson \& Carey" ,
author    =    "Richardson, J.E. and Carey, M.J." ,
title    =    "Programming Constructs for Database System
Implementation in EXODUS" ,
institution=    "Computer Sciences Department" ,
address    =    "University of Wisconsin, Madison, WI" ,
year    =    "1986" ,
pages    =    "1--27" ,
abstract=    "The goal of the EXODUS extensible DBMS project to
is enable the rapid development of a wide spectrum of
high-performance, application-specific database systems. EXODUS
provides certain kernel facilities for use by all applications and a
set of tools to aid the database implementor (DBI) in generating new
database system software. Some of the DBI's work is supported by
EXODUS tools which generate database components form a specification.
However, components such as new abstract data types, access methods,
and database operations must be explicitly coded by the DBI. This
paper analyzes the major programming problems faced by the DBI,
describing the collection of programming language constructs that
EXODUS provides for simplifying the DBI's task. The E programming
language, a derivative of C designed specifically for implementing
DBMS software, provides these constructs." ,
bibdate    =    "Mon Feb  2 11:35:02 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( RICHARDSON87,
key    =    "Richardson \& Carey" ,
author    =    "Richardson, J.E. and Carey, M.J." ,
title    =    "Programming Constructs for Database System
Implementation in EXODUS" ,
booktitle=    "Proceedings of the ACM SIGMOD Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "208--219" ,
abstract=    "The goal of the EXODUS extensible DBMS project is
to enable the rapid development of a wide spectrum of
high-performance, application- specific database systems. EXODUS
provides certain kernel facilities for use by all applications and a
set of tools to aid the database implementor (DBI) in generating new
database system software. Some of the DBI's work is supported by
EXODUS tools which generate database components from a specification.
However, components such as new abstract data types, access methods,
and database operations must be explicitly coded by the DBI. This
paper analyzes the major programming problems faced by the DBI,
describing the collection of programming language constructs that
EXODUS provides for simplifying the DBI's task. These constructs have
been embedded in the E programming language, an extension of C++
designed specifically for implementing DBMS software." ,
bibdate    =    "Fri Jul 24 15:28:53 1987" ,
owner    =    "manning" ,
)

@techreport    ( RICHARDSON88,
key    =    "Richardson \& Carey" ,
author    =    "Richardson, J.E. and Carey, M.J." ,
title    =    "Persistence in the E Language: Issues and
Implementation" ,
type    =    "Computer Science Technical Report" ,
number    =    "791" ,
institution=    "Computer Sciences Department" ,
address    =    "University of Wisconsin, Madison, WI" ,
year    =    "1988" ,
month    =    "sep" ,
pages    =    "1--42" ,
abstract=    "E is an extension of C++ providing, among other
features, database types and persistent objects. In a language
offering persistence, there are many important design and
implementation issues which must be resolved. This paper discusses
some of these issues, comparing the approach taken in the E
programming language with other persistent systems. The basis of
persistence in E is a new storage class of variables, and physical I/O
is based on a load/store model of the long-term storage layer. In
addition to discussing the issues and E's general approach, this paper
also details the current implementation." ,
bibdate    =    "Tue Apr 11 09:33:51 1989" ,
owner    =    "payne" ,
)

@article    ( RICHARDSON93,
key    =    "Richardson et al." ,
author    =    "Richardson, J.E. and Carey, M.J. and Schuh, D.T." ,
title    =    "The Design of the E Programming Language" ,
journal    =    "toplas" ,
publisher=    "acm" ,
volume    =    "15" ,
number    =    "3" ,
month    =    "jul" ,
year    =    "1993" ,
pages    =    "494--534" ,
keywords=    "Extensible database systems; persistent object
management" ,
abstract=    "E is an extension of C++ designed for writing
software systems to support persistent applications. Originally
designed as a language for implementing database systems, E has
evolved into a general persistent programming language. E was the
first C++ extension to support transparent persistence, the first C++
implementation to support generic classes, and remains the only C++
extension to provide general-purpose iterators. In addition to its
contributions to the C++ programming domain, work on E has made
several contributions to the field of persistent languages in general,
including several distinct implementations of persistence. This paper
describes the main features of E and shows through examples how E
addresses many of the problems that arise in building persistent
systems." ,
bibdate    =    "Mon Jul 26 18:23:16 1993" ,
owner    =    "daisyc" ,
)

@inproceedings    ( RISHE85A,
key    =    "Rishe" ,
author    =    "Rishe, N." ,
title    =    "On Denotational Semantics of Data Bases" ,
booktitle=    "Proceedings of the International Conference on
Mathematical Foundations of Programming Semantics" ,
publisher=    "Springer-Verlag" ,
address    =    "Manhattan, KA" ,
editor    =    "Melton, A." ,
month    =    "apr" ,
year    =    "1985" ,
pages    =    "249--274" ,
abstract=    "A method of denotational formalization of data
bases, of data base management systems, and of related structures is
proposed, aiming to improve their understanding, specification and
rigorous investigation. The method provides a uniform treatment of
different information layers: from instantaneous data bases (the first
layer), via schemata and integrity rules, to classes of data base
models. It unifies in one mathematical notion the apparently different
notions of the semantics of stored data, semantics of data base
processes, conceptual semantics of data bases, integrity semantics of
data bases and denotational semantics of languages. The unification is
based on hierarchies of domains of continuous mappings between
different representations of information (from ``less semantic''
representations into ``more semantic'' ones)." ,
bibdate    =    "Fri Sep  4 20:14:13 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( RISHE85B,
key    =    "Rishe" ,
author    =    "Rishe, N." ,
title    =    "Postconditional Semantics of Data Base Queries" ,
booktitle=    "Proceedings of the International Conference on
Mathematical Foundations of Programming Semantics" ,
publisher=    "Springer-Verlag" ,
address    =    "Manhattan, KA" ,
editor    =    "Melton, A." ,
month    =    "apr" ,
year    =    "1985" ,
pages    =    "275--295" ,
bibdate    =    "Fri Sep  4 20:15:43 1987" ,
owner    =    "mckenzie" ,
)

@article    ( RISSANEN77,
key    =    "Rissanen" ,
author    =    "Rissanen, J." ,
title    =    "Independent Components of Relations" ,
journal    =    "tods" ,
volume    =    "2" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1977" ,
pages    =    "317--325" ,
bibdate    =    "Wed Jul 22 00:52:30 1992" ,
owner    =    "soo" ,
)

@inproceedings    ( ROBINSON81,
key    =    "Robinson" ,
author    =    "Robinson, J.T." ,
title    =    "The K-D-B-Tree: A Search Structure for Large,
Multi-dimensional, Dynamic Indices" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
address    =    "Ann Arbor, MI" ,
month    =    "may" ,
year    =    "1981" ,
bibdate    =    "Fri Feb 22 14:17:31 1985" ,
)

@techreport    ( ROBINSON89,
key    =    "Robinson \& Devarakonda" ,
author    =    "Robinson, John T. and Devarakonda, Murthy V." ,
title    =    "Data Cache Management Using Frequency-Based
Replacement" ,
institution=    "IBM Research Division. T. J. Watson Research
Center" ,
year    =    "1989" ,
type    =    "Technical report," ,
number    =    "981" ,
address    =    "P. O. Box 704, Yorktown Heights, NY 10598" ,
)

@inproceedings    ( ROGERS87,
key    =    "Rogers \& Cattell" ,
author    =    "Rogers, T. R. and Cattell, R. G. G." ,
title    =    "Entity-relationship database user interfaces" ,
booktitle=    "Proc. 6th Int. Conf. Entity-relationship Approach" ,
address    =    "New York" ,
year    =    "1987" ,
pages    =    "323--336" ,
bibdate    =    "Tue Nov  7 10:59:43 1989" ,
owner    =    "robyn" ,
)

@article    ( ROGERS88,
key    =    "Rogers \& Cattell" ,
author    =    "Rogers, T.R. and Cattell, R.G.G." ,
title    =    "Entity-Relationship Database User Interfaces" ,
journal    =    "Data Engineering" ,
publisher=    "ieee" ,
volume    =    "11" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1988" ,
pages    =    "44--53" ,
keywords=    "entity-relationship, ease-of-use" ,
abstract=    "We report on experience with database user
interfaces that are entity-relationship oriented, rather than
relation-oriented, and provide a new level of ease-of-use for
information management. Our goal is to allow technical workers with
little or no knowledge of database systems, query languages, or
relational terminology to use databases to solve simple information
management problems. Our tools also provide new capabilities for
expert users, such as database browsing using a mouse and database
display using bitmap graphics" ,
owner    =    "payne" ,
bibdate    =    "Fri Jun 17 11:10:10 1988" ,
)

@article    ( ROSENBERG81,
key    =    "Rosenberg" ,
author    =    "Rosenberg, A." ,
title    =    "Time- and Space-Optimality in B-Trees" ,
journal    =    "tods" ,
volume    =    "6" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1981" ,
pages    =    "174--183" ,
bibdate    =    "Wed Jun  5 22:20:03 1985" ,
)

@article    ( ROSENKRANTZ78,
key    =    "Rosenkrantz et al." ,
author    =    "Rosenkrantz, D.J. and Stearns, R.E. and Lewis,
P.M." ,
title    =    "System Level Concurrency Control for Distributed
Database Systems" ,
journal    =    "tods" ,
volume    =    "3" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1978" ,
pages    =    "178--198" ,
bibdate    =    "Mon Feb  2 10:33:14 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( ROSENTHAL84,
key    =    "Rosenthal \& Reiner" ,
author    =    "Rosenthal, A. and Reiner, D." ,
title    =    "Extending the Algebraic Framework of Query
Processing to Handle Outerjoins" ,
booktitle=    "Proceedings of the Tenth International Conference
on Very Large Data Bases" ,
address    =    "Singapore" ,
month    =    "aug" ,
year    =    "1984" ,
abstract=    "A crucial part of relational query optimization is
the reordering of query processing for more efficient query
evaluation. The reordering may be explicit or implicit. Our major goal
in this paper is to describe manipulation rules for queries that
include outerjoins, and view for nested subqueries. By expressing
queries and processing strategies in terms of relational algebra, one
can use the ordinary mechanisms of query optimization and view
substitution with a mimimum of disruption. We also briefly examine
aggregate operators, universal quantifiers, and sorting." ,
bibdate    =    "Wed Mar  9 13:57:45 1988" ,
owner    =    "manning" ,
)

@article    ( ROSENTHAL94,
key    =    "Rosenthal \& Reiner" ,
author    =    "Rosenthal, Arnon and Reiner, David" ,
title    =    "Tools and Transformations---Rigorous and
Otherwise---for Practical Database Design" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "19" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1994" ,
pages    =    "167--211" ,
abstract=    "We describe the tools and theory of a
comprehensive system for database design, and show how they work
together to support multiple conceptual and logical design processes.
The Database Design and Evaluation Workbench (DDEW) system uses a
rigorous, information-content-preserving approach to schema
transformation, but combines it with heuristics, guess work, and user
interactions. The main contribution lies in illustrating how theory
was adapted to a practical system, and how the consistency and power
of a design system can be increased by use of theory. First, we
explain why a design system needs multiple data models, and how
implementation over a unified underlying model reduces redundancy and
inconsistency. Second, we present a core set of small but fundamental
algorithms that rearrange a schema without changing its information
content. From these reusable components, we easily built larger tools
and transformations that were still formally justified. Third, we
describe heuristic tools that attempt to improve a schema, often by
adding missing information. In these tools, unreliable techniques such
as normalization and relationship inference are bolstered by
system-guided user interactions to remove errors. We present a
rigorous criterion for identifying unnecessary relationships, and
discuss an interactive view integrator. Last, we examine the relevance
of database theory to building these practically motivated tools and
contrast the paradigms of system builders with those of theoreticians." ,
bibdate    =    "Wed Sep 21 13:41:12 1994" ,
owner    =    "kevin" ,
)

@techreport    ( ROTH84A,
key    =    "Roth et al." ,
author    =    "Roth, M.A. and Korth, H.F. and Silberschatz, A." ,
title    =    "Extended Algebra and Calculus for Non-1NF
Relational Databases" ,
type    =    "Technical Report" ,
number    =    "TR-84-36" ,
institution=    "Department of Computer Sciences, University of
Texas at Austin" ,
address    =    "Austin, TX" ,
year    =    "1984" ,
month    =    "dec" ,
abstract=    "Relaxing the assumption that relations are always
in First-Normal-Form (1NF) necessitates a re-examination of the
fundamentals of relational database theory. In this paper we take a
first step towards unifying the various theories of Non-1NF databases.
We start by determining an appropriate model to couch our formalisms
in. We then define an extended relational calculus as the theoretical
basis for our Non-1NF database query language. We define a minimum
extended relational algebra and prove its equivalence to the Non-1NF
relational calculus. We define a class of Non-1NF relations with
certain ``good'' properties and extend our algebra operators to work
within this domain. We prove certain desirable algebraic equivalences
that hold only if we restrict our language to this domain." ,
bibdate    =    "Fri Nov 20 15:07:53 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( ROTH87,
key    =    "Roth \& Korth" ,
author    =    "Roth, Mark A. and Korth, Henry F." ,
title    =    "The Design of $\neg$NF Relational Databases into
Nested Normal Form" ,
booktitle=    "Proceedings of the ACM SIGMOD '87" ,
year    =    "1987" ,
pages    =    "143--159" ,
month    =    "" ,
)

@article    ( ROTH87A,
key    =    "Roth et al." ,
author    =    "Roth, M. A. and Korth, H. F. and Batory, D. S." ,
title    =    "SQL/NF: A Query Language for non-1NF Relational
Databases" ,
journal    =    "Information Systems" ,
volume    =    "12" ,
number    =    "1" ,
year    =    "1987" ,
pages    =    "99--114" ,
keywords=    "relational databases, non-first-normal-form, SQL,
relation-valued attributes" ,
abstract=    "There is growing interest in abandoning the
first-normal-form assumption on which the relational database model is
based. This interest has developed from a desire to extend the
applicability of the relational model beyond traditional
data-processing application. In this paper, we extend one of the most
widely used relational query languages, SQL, to operate on
non-first-normal-form relations, In this framework, we allow
attributes to be relation-valued as well as atomic-valued (e.g.,
integer or character). A relation which occurs as the value of an
attribute in a tuple of another relation is said to be nested. Our
extended language, called SQL/NF, includes all of the power of
standard SQL as well as the ability to difine nested relations in the
data definition language and query these relations directly in the
extended data manipulation language. A variety of improvements are
made to SQL; the syntax is simplified and useless constructs and
arbitrary restrictions are removed." ,
bibdate    =    "Wed Aug 19 20:22:50 1987" ,
owner    =    "mckenzie" ,
)

@article    ( ROTH88,
key    =    "Roth et al." ,
author    =    "Roth, Mark A. and Korth, Henry F. and
Silberschatz, Abraham" ,
title    =    "Extended Algebra and Calculus for Nested
Relational Databases" ,
journal    =    "ACM Transactions on Database Systems" ,
year    =    "1988" ,
volume    =    "13" ,
number    =    "4" ,
pages    =    "389--417" ,
month    =    "dec" ,
keywords=    "extended algebra and calculus, nested relations,
non-first normal form, partitioned normal form" ,
abstract=    "Relaxing the assumption that relations are always
in First-Normal-Form (1NF) necessitates a reexamination of the
fundamentals of relational database theory. In this paper we take a
first step towards unifying the various theories of $\not$1NF
databases. We start by determining an appropriate model to couch our
formalisms in. We then define an extended relational calculus as the
theoretical basis for our $\not$1NF relational calculus. We define a
class of $\not$1NF relations with certain ``good'' properties and
extend our algebra operators to work within this domain. We prove
certain desirable equivalences that hold only if we restrict our
language to this domain." ,
bibdate    =    "Tue Aug  6 10:07:11 1991" ,
owner    =    "curtis" ,
)

@article    ( ROTHCHILD83,
key    =    "Rothchild" ,
author    =    "Rothchild, Edward" ,
title    =    "Optical-Memory Media" ,
journal    =    "BYTE" ,
year    =    "1983" ,
volume    =    "" ,
number    =    "" ,
pages    =    "86--106" ,
month    =    "March" ,
)

@article    ( ROTHNIE74,
key    =    "Rothnie \& Lozano" ,
author    =    "Rothnie, J. and Lozano, T." ,
title    =    "Attribute Based File Organization in a Paged
Memory Environment" ,
journal    =    "cacm" ,
volume    =    "17" ,
number    =    "2" ,
month    =    "feb" ,
year    =    "1974" ,
pages    =    "63--69" ,
bibdate    =    "Fri Apr 26 23:34:25 1985" ,
)

@article    ( ROUSSOPOULOS82,
key    =    "Roussopoulos" ,
author    =    "Roussopoulos, N." ,
title    =    "View Indexing in Relational Databases" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "7" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1982" ,
pages    =    "258--290" ,
keywords=    "algorithms, performance, index selection" ,
abstract=    "The design and maintenance of a useful database
system requires efficient optimization of the logical access paths
which demonstrate repetitive usage patterns. View (classes of queries
given by a query model) are an appropriate intermediate logical
representation for databases. Frequently accessed views of databases
need to be supported by indexing to enhance retrieval. This paper
investigates the problem of selecting an optimal index set of views
and describes an efficient algorithm for the selection." ,
bibdate    =    "Thu Feb  5 15:15:24 1987" ,
owner    =    "manning" ,
)

@article    ( ROUSSOPOULOS82B,
key    =    "Roussopoulos" ,
author    =    "Roussopoulos, N." ,
title    =    "The Logical Access Path Schema of a Database" ,
journal    =    "tse" ,
publisher=    "ieee" ,
volume    =    "SE-8" ,
number    =    "6" ,
month    =    "nov" ,
year    =    "1982" ,
pages    =    "563--573" ,
keywords=    "aggregation hierarchy, external logical subschema,
generalization hierarchy, logical access path, propositional calculus,
views" ,
abstract=    "A new schema which models the usage of the logical
access paths of the database is proposed. The schema models all
database activities (i.e., retrievals and updates), and integrates
their logical access paths by recognizing common subpaths and
increasing the ``weight'' of the shared subpaths. The logical access
path schema provides a comprehensive picture of the logical access
paths, and the cumulative usage of the shared subpaths and/or
intermediate results. The schema serves a dual purpose. Firstly, it is
used as a model of the access requirements during the database design,
and secondly, as the basis for optimization during the operation of
the database." ,
bibdate    =    "Fri Oct 16 15:23:00 1987" ,
owner    =    "mckenzie" ,
)

@article    ( ROUSSOPOULOS84,
key    =    "Roussopoulos \& Yeh" ,
author    =    "Roussopoulos, N. and Yeh, R.T." ,
title    =    "An Adaptable Methodlogy for Database Design" ,
journal    =    "Computer" ,
month    =    "may" ,
year    =    "1984" ,
pages    =    "64--80" ,
bibdate    =    "Thu Nov  1 10:00:09 1984" ,
)

@article    ( ROUSSOPOULOS85A,
key    =    "Roussopoulos \& Bader" ,
author    =    "Roussopoulos, N. and Bader, C." ,
title    =    "Dynamic Access Control for Relational Views" ,
journal    =    "Information Systems" ,
volume    =    "10" ,
number    =    "3" ,
month    =    "aug" ,
year    =    "1985" ,
pages    =    "361--369" ,
abstract=    "This article describes an authorization model for
a relational database system. Authorization for dynamically created
views is inferred from the entries in a security catalog using the
principles of the lattice model for information flow. The complexity
of the model is reduced by introducing the concepts of user-groups and
user-privileges. The Model has been implemented in the database system
ADMS." ,
bibdate    =    "Thu Feb  5 15:16:40 1987" ,
owner    =    "manning" ,
)

@article    ( ROUSSOPOULOS85C,
key    =    "Roussopoulos \& Mark" ,
author    =    "Roussopoulos, N. and Mark, L." ,
title    =    "Schema Manipulation in Self-Describing and
Self-Documenting Data Models" ,
journal    =    "International Journal of Computer and Information
Sciences" ,
volume    =    "14" ,
number    =    "1" ,
month    =    "jan" ,
pages    =    "1--28" ,
year    =    "1985" ,
abstract=    "This paper integrates data, schema and meta-schema
into a uniform model and provides one data language to manipulate and
modify both data and schema. The modifications on the schema are then
propagated to the schema's extension via propagation rules. The
integration and the schema modification are all developed within the
framework of self-describing and self-documenting models of data and
they are fundamental in capturing the evolution of the database, which
includes not only data changes, but schema changes as well." ,
bibdate    =    "Thu Feb  5 15:21:32 1987" ,
owner    =    "manning" ,
)

@article    ( ROUSSOPOULOS86,
key    =    "Roussopoulos \& Kang" ,
author    =    "Roussopoulos, N. and Kang, H." ,
title    =    "Principles and Techniques in the Design of ADMS" ,
journal    =    "Computer" ,
publisher=    "IEEE" ,
volume    =    "19" ,
number    =    "12" ,
month    =    "dec" ,
year    =    "1986" ,
pages    =    "19--25" ,
bibdate    =    "Thu Jan  8 11:34:28 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( ROUSSOPOULOS86B,
key    =    "Roussopoulos \& Kang" ,
author    =    "Roussopoulos, N. and Kang, H." ,
title    =    "Preliminary Design of ADMS: A
Workstation-Mainframe Integrated Architecture for Database Management
Systems" ,
booktitle=    "vldb" ,
address    =    "Kyoto, Japan" ,
editor    =    "Kambayashi, Y." ,
month    =    "aug" ,
year    =    "1986" ,
pages    =    "355--364" ,
keywords=    "databases, architecture, differential files,
deferred updates, derived relations" ,
abstract=    "This paper presents a new architecture that fully
integrates local and global database management in a transparent for
the user fashion. The architecture utilizes the workstation's local
processing and uses the global mainframe for sharing and maintenance
of consistency. Two access path distribution protocols distribute data
and processing by localizing uncommon paths to their requesting
workstations while avoiding repetition of globally shared paths in
workstations. A new concurrency control protocol is used which has its
foundation on the deferred update strategy, the concept of
differential files, and a new lock for derived objects." ,
bibdate    =    "Wed Aug 19 22:34:57 1987" ,
owner    =    "mckenzie" ,
)

@techreport    ( ROUSSOPOULOS87A,
key    =    "Roussopoulos" ,
author    =    "Roussopoulos, N." ,
title    =    "Overview of ADMS: A High Performance Database
Management System" ,
institution=    "University of Maryland" ,
year    =    "1987" ,
abstract=    "This paper presents ADMS, a high performance
Relational Database Management System that supports intelligent cache
techniques for access paths in the database. ADMS improves the
database access performance by building an integrated memory of search
paths and short-cuts. This is based on a new concept of incremental
learning that allows the system to acquire knowledge about access
obtained from previous search. Benchmork results comparing the speeds
of conventional DBMSs and ADMS are included." ,
bibdate    =    "Thu Oct 22 14:40:08 1987" ,
owner    =    "mckenzie" ,
)

@article    ( ROUSSOPOULOS88,
key    =    "Roussopoulos et al." ,
author    =    "Roussopoulos, N. and Faloutsos, C. and Sellis, T." ,
title    =    "An Efficient Pictorial Database System for PSQL" ,
journal    =    "tse" ,
publisher=    "ieee" ,
volume    =    "14" ,
number    =    "5" ,
month    =    "may" ,
year    =    "1988" ,
pages    =    "639--650" ,
keywords=    "cartographic databases; k-D-B-trees;
multidimensional trees; relational query languages; R-trees; spatial
objects; spatial search" ,
abstract=    "Pictorial databases require efficient and direct
spatial search based on the analog form of spatial objects and
relationships instead of search based on some cumbersome alphanumeric
encodings of the pictures. This paper briefly describes PSQL, a query
language which allows pictorial domains to be presented to the user in
their analog form and allows him to do direct manipulation on the
objects found on those domains. Direct spatial search and computation
on the pictures is done using efficient data structures, R- and
R+-trees;multidimensional B-trees; which are excellent devices for
searching spatial objects and relationships found on pictures." ,
bibdate    =    "Fri Jul 15 11:17:45 1988" ,
owner    =    "payne" ,
)

@article    ( ROUSSOPOULOS89,
key    =    "Roussopoulos et al." ,
author    =    "Roussopoulos, Nick and Mark, Leo and Sellis, Timos
and Faloutsos, Christos" ,
title    =    "High Performance Engineering Information Systems" ,
journal    =    "Submitted for publication" ,
year    =    "1989" ,
volume    =    "" ,
number    =    "" ,
pages    =    "1--27" ,
month    =    "" ,
)

@techreport    ( ROUSSOPOULOS89B,
key    =    "Roussopoulos" ,
author    =    "Roussopoulos, Nick" ,
title    =    "The Incremental Access Method of View Cache:
Concept, Algorithms, and Cost Analysis" ,
institution=    "Department of Computer Science, University of
Maryland" ,
year    =    "1989" ,
type    =    "Technical report," ,
number    =    "UMIACS-TR-89-15, CS-TR-2193" ,
address    =    "College Park, MD 20742" ,
month    =    "February" ,
note    =    "" ,
)

@techreport    ( ROUSSOPOULOS90,
key    =    "Roussopoulos et al." ,
author    =    "Roussopoulos, Nick and Economou, Nikos and
Stamenas, Anthony" ,
title    =    "ADMS: A Testbed for Incremental Access Methods" ,
institution=    "Institute for Advanced Computer Studies,
Department of Computer Science, and Systems Research Center,
University of Maryland" ,
year    =    "1990" ,
type    =    "Technical report," ,
number    =    "UMIACS-TR-90-103, CS-TR-2514" ,
address    =    "College Park, MD 20742" ,
month    =    "July" ,
note    =    "" ,
)

@article    ( ROUSSOPOULOS91,
key    =    "Roussopoulos" ,
author    =    "Roussopoulos, N." ,
title    =    "An Incremental Access Method for ViewCache:
Concept, Algorithms, and Cost Analysis" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "16" ,
number    =    "3" ,
month    =    "september" ,
year    =    "1991" ,
pages    =    "535-563" ,
abstract=    "A ViewCache is a stored collection of pointers
pointing to records of underlying relations needed to materialize a
view. This paper presents an Incremental Access Method (IAM) that
amortizes the maintenance cost of ViewCaches over a long time period
or indefinitely. Amortization is based on deferred and other update
propogation strategies. A deferred update strategy allows a ViewCache
to remain outdated until a query needs to selectively or exhaustively
materialize the view. At this point, an incremental update of the
ViewCache is performed. This paper defines a set of conditions under
which incremental access to the ViewCache is cost effective. The
decision criteria are based on some dynamically maintained cost
parameters, which provide accurate information but require inexpensive
booking. The IAM capitalizes on the ViewCache storage organization for
performing the update and the materialization of the ViewCaches in an
interleaved mode using one-pass algorithms. Compared to the standard
technique for supporting views that requires reexecution of the
definition of the view, the IAM offers significant performance
advantages. We will show that under favorable accesses of the views,
most of which depend on the size of the incremental access method
outperforms query modification. Performance gains are higher for
multilevel ViewCaches because all the I/O and CPU for handling
intermediate results are avoided." ,
bibdate    =    "Mon Nov  4 11:46:59 1991" ,
owner    =    "kline" ,
)

@article    ( ROUSSOPOULOS91B,
key    =    "Roussopoulos et al." ,
author    =    " Roussopoulos, N.; Mark, L.; Sellis, T.;
Faloutsos, C." ,
title    =    " An Architecture for High Performance Engineering
Information Systems" ,
journal    =    "tse" ,
volume    =    "17" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1991" ,
pages    =    "22--33" ,
abstract=    "Commercially available database systems do not
meet the information and processing needs of design and manufacturing
environments. A new generation of systems--engineering information
systems--must be built to meet these needs. In this paper, we address
the architectural and computational aspects of such systems and
propose solutions. We argue that a mainframe-workstation architecture
is needed to provide distributed functionality while ensuring high
availability and low communication overhead, that explicit control of
meta-knowledge is needed to support extendibility and evolution, that
large rule bases are needed to make the knowledge of the systems
active, and that incremental computation models are needed to achieve
the required performance of such engineering information systems." ,
bibdate    =    "Mon Feb 25 10:36:25 1991" ,
owner    =    "robyn" ,
)

@article    ( ROUSSOPOULOS91C,
key    =    "Roussopoulos" ,
author    =    "Roussopoulos, N. and Delis, A." ,
title    =    "Modern Client--Server DBMS Architectures" ,
journal    =    "sigmod" ,
publisher=    "ACM" ,
volume    =    "20" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1991" ,
pages    =    "52--61" ,
abstract=    "In this paper, we describe three Client-Server
DBMS architectures. We discuss their functional components and provide
an overview of their performance characteristics." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( ROUSSOPOULOS93,
key    =    "Roussopoulos et al." ,
author    =    "Roussopoulos, N. and Economou, N. and Stamenas, A." ,
title    =    "ADMS: A Testbed for Incremental Access Methods" ,
journal    =    "tkde" ,
publisher=    "ieee" ,
volume    =    "5" ,
number    =    "5" ,
month    =    "oct" ,
year    =    "1993" ,
pages    =    "762--774" ,
keywords=    "Access path; client-server architectures; gateway
access; incremental access methods; interoperability of heterogeneous
DBMS's; job index; view index" ,
abstract=    "ADMS is an advanced database management system
developed to experiment with incremental access methods for large and
distributed databases. It has been developed over the past eight years
at the University of Maryland. The purpose of this paper is to provide
an overview of ADMS, and to describe its capabilities and the
performance attained by its incremental access methods. This paper
also describes an enhanced client-server architecture that allows an
incremental gateway access to manipulate heterogeneous commercial
database management systems." ,
bibdate    =    "Sun Nov 28 15:00:09 1993" ,
owner    =    "daisyc" ,
)

@article    ( ROUSSOPOULOS95A,
key    =    "Roussopoulos et al." ,
author    =    "Roussopoulos, Nick and Chen, Chungmin and Kelley,
Stephen and Delis, Alex and Papakonstantinou, Yannis" ,
title    =    "The Maryland ADMS Project: Views R Us" ,
journal    =    "IEEE Data Engineering" ,
volume    =    "18" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1995" ,
pages    =    "19--28" ,
bibdate    =    "Thu Nov  9 17:43:38 1995" ,
owner    =    "bib" ,
)

@inproceedings    ( ROWE82,
key    =    "Rowe \& Shoens" ,
author    =    "Rowe, L.A. and Shoens, K.A." ,
title    =    "A Form Application Development System" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
year    =    "1982" ,
abstract=    "This paper describes FADS-a Form Application
Development System which is an interactive system for the development
of form-based database applications. FADS reduces the amount of work
required to implement a forms application by suppressing much of the
detail which would be required by conventional tools (e.g., a screen
definition system, a database system, and a programming language).
FADS provides direct access to a relational database, a standard model
of the user interface, built-in form constructs, and an integrated
development and debugging environment. Using FADS form applications
can be developed quickly and the resulting systems are easy to modify.
A prototype implementation of the FADS kernel has been completed." ,
bibdate    =    "Tue Jan 20 12:58:25 1987" ,
owner    =    "manning" ,
)

@article    ( ROWE85,
key    =    "Rowe" ,
author    =    "Rowe, Neil C." ,
title    =    "Antisampling for Estimation" ,
journal    =    "IEEE Transactions on Software Engineering" ,
year    =    "1985" ,
volume    =    "SE-11" ,
number    =    "10" ,
pages    =    "1081--1091" ,
month    =    "October" ,
)

@techreport    ( ROWE86A,
key    =    "Rowe" ,
author    =    "Rowe, L." ,
title    =    "A Shared Object Hierarchy" ,
number    =    "M86/40" ,
edition    =    "revised" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1986" ,
bibdate    =    "Mon Nov  2 10:53:06 1987" ,
owner    =    "manning" ,
)

@techreport    ( ROWE87,
key    =    "Rowe et al." ,
author    =    "Rowe, L. and Danzig and Choi" ,
title    =    "A Visual Shell Interface to a Database" ,
number    =    "M87/2" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1987" ,
bibdate    =    "Mon Nov  2 10:54:41 1987" ,
owner    =    "manning" ,
)

@techreport    ( ROWE87A,
key    =    "Rowe \& Stonebraker" ,
author    =    "Rowe, L. and Stonebraker, M." ,
title    =    "The POSTGRES Data Model" ,
number    =    "M87/13" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1987" ,
bibdate    =    "Mon Nov  2 10:56:00 1987" ,
owner    =    "manning" ,
)

@techreport    ( ROWE87B,
key    =    "Rowe" ,
author    =    "Rowe, L." ,
title    =    "Object FADS Project Status Report" ,
number    =    "M87/20" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1987" ,
bibdate    =    "Mon Nov  2 10:57:54 1987" ,
owner    =    "manning" ,
)

@techreport    ( ROWE87C,
key    =    "Rowe \& Williams" ,
author    =    "Rowe, L. and Williams" ,
title    =    "An Object-Oriented Database Design for Integrated
Circuit Fabrication" ,
number    =    "M87/43" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1987" ,
bibdate    =    "Mon Nov  2 10:59:35 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( ROWE87D,
key    =    "Rowe \& Stonebraker" ,
author    =    "Rowe, L.A. and Stonebraker, M.R." ,
title    =    "The POSTGRES Data Model" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
editor    =    "Hammersley, P." ,
month    =    "sep" ,
year    =    "1987" ,
pages    =    "83--96" ,
abstract=    "The design of the POSTGRES data model is
described. the data model is a relational model that has been extended
with abstract data types including user-defined operators and
procedures, relation attributes of type procedure, and attribute and
procedure inheritance. These mechanism can be used to simulate a wide
variety of semantic and object-oriented data modeling constructs
including aggregation and generalization, complex objects with shared
subobjects, and attributes that reference tuples in other relations." ,
bibdate    =    "Thu Apr 28 11:25:26 1988" ,
owner    =    "" ,
)

@techreport    ( ROWE87F,
key    =    "Rowe \& Stonebraker" ,
author    =    "Rowe L.A. and Stonebraker, M.R. (eds.)" ,
title    =    "The Postgres Papers" ,
institution=    "University of California" ,
year    =    "1987" ,
type    =    "Memorandum," ,
number    =    "UCB/ERL M86/85" ,
address    =    "Electronics Research Laboratory, College of
Engineering, University of California, Berkeley, CA 94720" ,
month    =    "June" ,
note    =    "" ,
)

@inproceedings    ( RUBENSTEIN87,
key    =    "Rubenstein et al." ,
author    =    "Rubenstein, W.B. and Kubicar, M.S. and Cattell,
R.G.G." ,
title    =    "Benchmarking Simple Database Operations" ,
booktitle=    "Proceedings of the ACM SIGMOD Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "387--394" ,
abstract=    "There are two widely-known benchmarks for database
management systems: the TPI benchmarks (Anon et al. [1985]), designed
to measure transaction throughput, and the Wisconsin benchmarks
(Bitton, Dewitt \& Turbyfil [1984]), designed to measure the
performance of a relational query processor. In our work with
databases on engineering workstations, we found neither of these
benchmarks a suitable measure for our applications' needs. Instead,
our requirements are for response time for simple queries. We propose
benchmark measurements to measure response time, specifically designed
for the simple, object-oriented queries that engineering database
applications perform. We report results from running this benchmark
against some database systems we use ourselves, mark measurements on
other relational, object- oriented, or specialized database systems.
We discuss a number of factors that make an order of magnitude
improvement in benchmark performance: caching the entire database in
main memory, avoiding query optimization overhead, using physical
links for prejoins, and using an alternative to the generally-
accepted database ``server'' architecture on distributed networks." ,
bibdate    =    "Fri Jul 24 16:08:40 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( RUBENSTEIN87A,
key    =    "Rubenstein" ,
author    =    "Rubenstein, W.B." ,
title    =    "A Database Design for Musical Information" ,
booktitle=    "Proceedings of the ACM SIGMOD Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "479--490" ,
abstract=    "As part of our research into a general purpose
data management system for musical information, a major focus has been
the development of tools to support a data model for music. This paper
first outlines the various types of information that fall under the
purview of our proposed data manager. We consider extensions to the
entity-relationship data model to implement the notion of hierarchical
ordering, commonly found in musical data. We then present examples
from our schema for representing musical notation in a database,
taking advantage of these extensions." ,
bibdate    =    "Fri Jul 24 16:37:24 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( RUMBAUGH87,
key    =    "Rumbaugh" ,
author    =    "Rumbaugh, J." ,
title    =    " Relations as semantic constructs in an object
oriented language" ,
booktitle=    "1987 ACM Conference on Object-Oriented Systems,
Languages, and Applications" ,
publisher=    "ACM" ,
address    =    "New York " ,
month    =    "dec" ,
year    =    1987 ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( RUNDENSTEINER92,
key    =    "Rundensteiner \& Bic" ,
author    =    "Rundensteiner, E.A. and Bic, L." ,
title    =    "Set Operations in New Generation Data Models" ,
journal    =    "tkde" ,
volume    =    "??" ,
number    =    "??" ,
month    =    "summer" ,
year    =    "1992" ,
pages    =    "??--??" ,
keywords=    "data models, data manipulation language" ,
abstract=    "Query languages designed for traditional database
system [sic], such as the relational model, generally support set
operations. However, the semantics of these set operations are not
adequate for richer data models of new generation database systems
that include object-oriented and semantic data modeling concepts. the
reason is that precise semantics of set operations on complex objects
require a clear distinction between the dual notions of a set and a
type, both of which are present in the class construct found in new
generation data models. In fact, class creation by set operations has
largely been ignored in the literature. Our paper fills this gap by
presenting a framework for executing set-theoretic operations on the
class construct. The proposed set operations, including set
difference, union, intersection and symmetric difference, determine
both the type description of the derived class as well as its set
membership. For the former, we develop inheritance rules for property
characteristics such as single- versus multi-valued and required
versus optional. For the latter, we borrow the object identity concept
from data modeling research. Our framework allows for property
inheritance among classes that are not necessarily is-a related." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( RUSCHITZKA89,
key    =    "Ruschitzka \& Clevenger" ,
author    =    "Ruschitzka, M. and Clevenger, J." ,
title    =    " Heterogeneous Data Translation based on
Environment Grammars" ,
journal    =    "tse" ,
volume    =    15 ,
pages    =    "1236--1251" ,
month    =    "oct" ,
year    =    1989 ,
annote    =    "Good theoretical discussion of the issues involved
in building translators. Formal proofs of the environment grammars are
given. A two level grammar is defined." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( RYAN90,
key    =    "Ryan" ,
author    =    "Ryan, Bob" ,
title    =    "Entering a New Phase" ,
journal    =    "Byte" ,
year    =    "1990" ,
volume    =    "" ,
number    =    "" ,
pages    =    "289--296" ,
month    =    "November" ,
)

@article    ( RYAN90A,
key    =    "Ryan" ,
author    =    "Ryan, Bob" ,
title    =    "The Once and Future King" ,
journal    =    "Byte" ,
year    =    "1990" ,
volume    =    "" ,
number    =    "" ,
pages    =    "301--306" ,
month    =    "November" ,
)

@article    ( RYBINSKI87A,
key    =    "Rybinski" ,
author    =    "Rybinski, H." ,
title    =    "On First-Order-Logic Databases" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "12" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1987" ,
pages    =    "325--349" ,
keywords=    "design, languages, theory, completeness, database
language, database logic, semantic model, soundness" ,
abstract=    "The use of first-order logic as database logic is
shown to be powerful enough for formalizing and implementing not only
relational but also hierarchical and network-type databases. It
enables one to treat all the types of databases in a uniform manner.
This paper focuses on the database language for heterogeneous
databases. The language is shown to be general enough to specify
constraints for a particular type of database, so that a specification
of database type can be ``translated'' to the specification given in
the database language, creating a ``logical environment'' for
different views that can be defined by users. Owing to the fact that
any database schema is seen as a first-order theory expressed by a
finite set of sentences, the problems concerned with completeness and
compactness of the database logic discussed by Jacobs (``On Database
Logic,'' J. ACM 29, 2 (Apr. 1982), 310-332) are avoided." ,
bibdate    =    "Wed Oct 14 13:41:42 1987" ,
owner    =    "mckenzie" ,
)

@techreport    ( SACCA83,
key    =    "Sacca \& Wiederhold" ,
author    =    "Sacca, D. and Wiederhold, G." ,
title    =    "Database Partitioning in a Cluster of Processors" ,
type    =    "Research Report" ,
number    =    "RJ 4076 (45454)" ,
institution=    "IBM Research Laboratory" ,
year    =    "1983" ,
month    =    "oct" ,
abstract=    "In a distributed database system the partitioning
and allocation of database over the processor nodes of the network can
be a critical aspect of database design effort. In this paper we
develop and evaluate algorithms which perform this task in a
computationally feasible manner. The network we consider may have a
high communication bandwidth but limited processing and input output
capacity in its processors. A poor distribution can lead to higher
loads and hence higher costs in the nodes or in the communication
network, so that the system cannot handle the required set of
transactions. Our approach is to first split the database into
fragments which constitute appropriate units for allocation. The
fragments to be allocated are selected based on maximal benefit
criteria using a greedy heuristic. The assignment to processor nodes
uses a first-fit algorithm. The complete algorithm is stated in a
procedural form. The complexity of the problem and of its candidate
solutions are analyzed and several interesting relationships are
proven. Alternate benefit metrics are considered, since the execution
cost varies by orders of magnitude with the benefit evaluation. A
mixed benefit evaluation strategy is eventually proposed. A model for
evaluation is presented. Two of the strategies are experimentally
evaluated and the reported results support the discussion." ,
bibdate    =    "Mon Oct 14 13:49:13 1985" ,
)

@inproceedings    ( SACCA87,
key    =    "Sacca \& Zaniolo" ,
author    =    "Sacca, D. and Zaniolo, C." ,
title    =    "Magic Counting Methods" ,
booktitle=    "Proceedings of the ACM SIGMOD Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "49--59" ,
abstract=    "The problem considered is that of implementing
recursive queries, expressed in a logic-based language, by efficient
fixpoint computations. In particular, the situation is studied where
the initial bindings in the recursive predicate can be used to
restrict the search space and ensure safety of execution. Two key
techniques previously proposed to solve this problem are (i) the
highly efficient counting method, and (ii) the magic set method which
is safe in a wider range of situations that (i). In this paper, we
present a family of methods, called the magic counting methods, that
combines the advantages of (i) and (ii). This is made possible by the
similarity of the strategies used by the counting method and the magic
set method for propagating the bindings. This computational
complexity, and illustrates the trade-offs between the family members
and their superiority with respect to the old methods." ,
bibdate    =    "Fri Jul 24 14:26:32 1987" ,
owner    =    "manning" ,
)

@article    ( SACKSDAVIS87,
key    =    "Sacks-Davis et al." ,
author    =    "Sacks-Davis, R. and Kent, A. and Ramamohanarao, K." ,
title    =    "Multikey Access Methods Based on Superimposed
Coding Techniques" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "12" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1987" ,
pages    =    "655--696" ,
keywords=    "Design; performance; descriptors; hashing; partial
match retrieval; record signatures; superimposed coding" ,
abstract=    "Both single-level and two-level indexed descriptor
schemes for multikey retrieval are presented and compared. The
descriptors are formed using superimposed coding techniques and stored
using a bit-inversion technique. A fast-batch insertion algorithm for
which the cost of forming the bit-inverted file is less than one disk
access per record is presented. For large data files, it is how that
the two-level implementation is generally more efficient for queries
with a small number of matching records. For queries that specify two
or more values, there is a potential problem with the two-level
implementation in that costs may accure when blocks of records match
the query but individual records within these blocks do not. One
approach to overcoming this problem is to set bits in the descriptors
based on pairs of indexed terms. This approach is presented and
analyzed." ,
bibdate    =    "Tue Jan 26 14:49:21 1988" ,
owner    =    "manning" ,
)

@phdthesis    ( SADRI80,
key    =    "Sadri" ,
author    =    "Sadri, F." ,
title    =    "Data Dependencies in the Relational Model of Data:
A Generalization" ,
school    =    "Princeton University" ,
month    =    "oct" ,
year    =    "1980" ,
bibdate    =    "Thu Jul 23 16:40:10 1992" ,
owner    =    "soo" ,
)

@article    ( SADRI82,
key    =    "Sadri \& Ullman" ,
author    =    "Sadri, F. and Ullman, J." ,
title    =    "Template Dependencies: A Large Class of
Dependencies in Relational Databases and Its Complete Axiomatization" ,
journal    =    "jacm" ,
volume    =    "29" ,
number    =    "2" ,
month    =    "apr" ,
year    =    "1982" ,
bibdate    =    "Wed Jul 22 01:11:59 1992" ,
owner    =    "soo" ,
)

@phdthesis    ( SALEM88,
key    =    "Salem" ,
author    =    "Salem, K." ,
title    =    "Failure Recovery in Memory-Resident Transaction
Processing Systems" ,
school    =    "Princeton University" ,
month    =    "dec" ,
year    =    "1988" ,
number    =    "CS-TR-188-88" ,
abstract=    "A main memory transaction processing system holds
a complete copy of its database in semiconductor memory. We present
and compare, in a common framework, a number of strategies for
recovery management in main memory transaction processing systems.
These include strategies for asynchronously checkpointing the primary
(main memory) database copy, and for maintaining a transaction log.
Though they are not directly concerned with recovery management, we
also consider strategies for updating the primary database, since they
affect the performance of the recovery manager. The recovery
strategies are compared using an analytic performance model and a
testbed implementation. The model computes two performance metrics:
processor overhead and recovery time. Processor overhead measures the
impact of a recovery strategy during normal operation, i.e., the cost
of preparing to recover from a failure. Recovery time is a measure of
the cost of recovery once a failure has occurred. Generally, it is
possible to reduce processor overhead by increasing recovery time, and
vice versa. The model captures this tradeoff, the exact nature of
which depends on which recovery strategies are used. Many of the
recovery strategies have been implemented in a testbed, a working
transaction processing system. The testbed allows recovery strategies
to be combined and tested. It has been used to verify the performance
model and to study other aspects of performance not considered in the
model, such as data contention and transaction response times. The
testbed runs on a large-memory VAX11/785 using services provided by
the Mach operating system. Our results indicate that the selection of
a checkpointing strategy is the most critical decision in designing a
recovery manager. In most situations, fuzzy, or unsynchronized,
checkpointing strategies outperform highly synchronized alternatives.
This is true even when synchronized checkpoints are combined with
efficient logical logging strategies, which cannot be used with fuzzy
checkpoints." ,
bibdate    =    "Wed May 19 23:05:02 1993" ,
owner    =    "bassili" ,
)

@article    ( SALEM90,
key    =    "Salen \& Garcia-Molina" ,
author    =    "Salem, Kenneth and Hector Garcia-Molina" ,
title    =    "System M: A Transaction Procressing Testbed for
Memory Resident Data" ,
journal    =    "tkde" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "Mar" ,
year    =    "1990" ,
pages    =    "161--172" ,
keywords=    "Checkpointing, crach recovery, database management
system, logging, memory resident, performance evaluation, transaction
processing." ,
abstract=    "System M is an experimential transaction
processing testbed that runs on top of the Mach operating system. Its
database is stored in primary menory. This paper describes the
structure and algorithms used in System M. The checkpointer is the
component that periodically sweeps memory and propagates updates to a
backup database copy on disk. Several different checkpointing (and
logging) algorithms were implemented and their performance was
experimentally evaluated." ,
bibdate    =    "Sun Aug  4 22:18:39 1991" ,
owner    =    "suchen" ,
)

@article    ( SALEM94,
key    =    "Salem et al." ,
author    =    "Salem, K. and Garcia-Molina, H. and Shands, J." ,
title    =    "Altruistic Locking" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "19" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1994" ,
pages    =    "117--165" ,
keywords=    "algorithms, performance, atomicity, locking,
scheduling, serializability" ,
bibdate    =    "Thu Mar 31 16:49:06 1994" ,
owner    =    "kline" ,
)

@article    ( SALTON78,
key    =    "Salton \& Wong" ,
author    =    "Salton, G. and Wong, A." ,
title    =    "Generation and Search of Clustered Files" ,
journal    =    "tods" ,
volume    =    "3" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1978" ,
pages    =    "321--346" ,
bibdate    =    "Sat Apr 27 22:52:24 1985" ,
)

@article    ( SALZBERG86,
key    =    "Salzberg" ,
author    =    "Salzberg, B." ,
title    =    "Third Normal Form Made Easy" ,
journal    =    "sigmod" ,
publisher=    "ACM" ,
volume    =    "15" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1986" ,
pages    =    "2--18" ,
abstract=    "Third normal form is defined in different
inequivalent ways in elementary data base textbooks. The method given
in many of these books for decomposing a file into third normal form
is non-algorithmic, depends on human recognition of a pattern, and has
severe limitations and unexplained complexities. This is not
necessary. There is an excellent algorithmic method available which is
easy to learn, and which can be programmed. The objective of this
paper is to examine the differences concerning how third normal form
is presented in various textbooks, and to present an easy way of
introducing it to students." ,
bibdate    =    "Tue Jan  6 17:17:43 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( SALZBERG89,
key    =    "Salzberg \& Lomet" ,
author    =    "Salzberg, B. J. and Lomet, D." ,
title    =    "Access Methods for Multiversion Data" ,
booktitle=    "Proceedings of the ACM SIGMOD '89" ,
year    =    "1989" ,
pages    =    "315--324" ,
month    =    "June" ,
)

@techreport    ( SALZBERG91,
key    =    "Salzberg \& Dimock" ,
author    =    "Salzberg, Betty and Allyn Dimock" ,
title    =    "Record Level Concurrent Reorganization" ,
number    =    "TR NU-CCS-91-6" ,
institution=    "Northeastern University" ,
year    =    "1991" ,
month    =    "may" ,
pages    =    "1--14" ,
bibdate    =    "Thu Jun 20 09:38:10 1991" ,
owner    =    "suchen" ,
)

@article    ( SALZBERG91A,
key    =    "Salzberg \& Lomet" ,
author    =    "Salzberg, B. and Lomet, D." ,
title    =    "Spatial Database Access Methods" ,
journal    =    "sigmod" ,
publisher=    "ACM" ,
volume    =    "20" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1991" ,
pages    =    "5--15" ,
abstract=    "This paper compares the holey brick tree, a
spatial database access method with worst case guarantees for space
utilization in data and index pages, fanout and exact match search
time, with other proposed spatial access methods. It points out the
difficulties encountered in designing such a method. It describes both
the holey brick tree and bit interleaving using a B+-tree, another
spatial access method with analytic guarantees." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@techreport    ( SALZBERG95,
key    =    "Salzberg \& Reuter" ,
author    =    "Salzberg, B. and Reuter, A." ,
title    =    "Indexing for Aggregation" ,
institution=    "College of Computer Science, Northeastern
University" ,
address    =    "Boston, MA" ,
year    =    "1995" ,
pages    =    "7" ,
bibdate    =    "Wed Nov 15 14:52:24 1995" ,
owner    =    "jeff" ,
)

@unpublished    ( SAMSON87A,
key    =    "Samson et al." ,
author    =    "Samson, W.B. and Deen, S.M. and Wakelin, A.W. and
Sadeghi, R." ,
title    =    "Formalising the Relational Algebra --- Some
Specifications, Observations, Problems, and Suggestions" ,
year    =    "1987" ,
abstract=    "A number of different specifications, with varying
closeness to actual implementations of the operators of the relational
algebra are proposed. The specifications of individual operators are
compared with their implementations in a real query language and it is
demonstrated that while a relatively simple specification can
encapsulate the fundamental ideas involved in the operators, a much
more complex specification is needed if the semantics of a real query
language is to be approached." ,
bibdate    =    "Mon Nov 16 14:20:27 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( SANDERSON91,
key    =    "Sanderson" ,
author    =    "Sanderson, D." ,
title    =    "Position paper: Data exchange issues for
standardization" ,
booktitle=    "Computer Standards and Interfaces" ,
pages    =    "305--309" ,
publisher=    "North-Holland" ,
address    =    "New York " ,
year    =    1991 ,
annote    =    "A proposal for an active form of data importation
in OO systems. There would exist special classes in OO hierarchies
whose sole purpose was to create local objects from foreign ones." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( SARIN87,
key    =    "Sarin \& Lynch" ,
author    =    "Sarin, S. and Lynch, N. A." ,
title    =    "Discarding Obsolete Information in a Replicated
Database System" ,
journal    =    "tse" ,
volume    =    "SE-13" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1987" ,
pages    =    "39--47" ,
keywords=    "Distributed databases; distributed snapshots;
mutual consistency; network partitions; replicated data; timestamps" ,
abstract=    "A replicated database architecture is described in
which updates processed at a site must be saved to allow
reconcilliation of newly arriving updates in a way that preserves
mutual consistency. The storage space occupied by the saved updates
increases indefinitely, and periodic discarding of old updates is
needed to avoid running out of storage. A protocol is described which
allows sites in the system to agree that updates older than a given
timestamp are no longer needed and can be discarded. This protocol
uses a ``distributed snapshot'' algorithm of Chandy and Lamport and
represents a parctical application of that algorithm. A protocol for
permanent removal of sites is also described, which will allow the
discarding of updates to continue when one or more sites crash and are
expected not to recover." ,
bibdate    =    "Tue Jan  6 17:29:21 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( SATOH85A,
key    =    "Satoh et al." ,
author    =    "Satoh, K. and Tsuchida, M. and Nakamura, F. and
Oomachi, K." ,
title    =    "Local and Global Query Optimization Mechanisms for
Relational Databases" ,
booktitle=    "vldb" ,
address    =    "Stockholm, Sweden" ,
editor    =    "Pirotte, A. and Vassiliou, Y." ,
month    =    "aug" ,
year    =    "1985" ,
pages    =    "405--417" ,
abstract=    "In a relational database management system (DBMS),
query optimization is essential since the DBMS must produce candidate
internal access strategies from a high level query and select the
optimal one. The goals of implementing a good optimization mechanism
are: (a) to maximize the performance of selected access strategies and
(b) to minimize the optimization overhead. We have developed an
optimization mechanism, built it in a relational DBMS product at
Hitachi. The mechanism can estimate precise tuple selectivity of
predicates in queries for optimal access strategy selection, and
employs a new method, called the cascade method, for optimization
overhead reduction. This paper also proposes a global optimization
mechanism which executes optimization over mutiple database queries." ,
bibdate    =    "Thu Nov 19 20:26:20 1987" ,
owner    =    "mckenzie" ,
)

@phdthesis    ( SATYANARAYANAN83,
key    =    "Satyanarayanan" ,
author    =    "Satyanarayanan, M." ,
title    =    "A Methodology for Modelling Storage Systems and
its Application to a Network File System" ,
school    =    "cmucsd" ,
month    =    "mar" ,
year    =    "1983" ,
bibdate    =    "Wed May  1 14:26:09 1985" ,
)

@article    ( SATYANARAYANAN93,
key    =    "Satyanarayanan \& Agrawal" ,
author    =    "Satyanarayanan, O.~T. and Agrawal, D." ,
title    =    "Efficient Execution of Read-Only Transactions in
Replicated Multiversion Databases" ,
journal    =    "tkde" ,
publisher=    "ieee" ,
volume    =    "5" ,
number    =    "5" ,
month    =    "oct" ,
year    =    "1993" ,
pages    =    "859--871" ,
keywords=    "Concurrency control; multiversion databases;
read-only transactions; replicated data" ,
abstract=    "Multiple versions of data are used in database
systems to increase concurrency. The higher concurrency results since
read-only transactions can be executed without any concurrency control
overhead and, therefore, read-only transactions do not interfere with
the execution of update transactions. Availability of data in a
distributed environment is improved by data replication. We propose a
protocol for managing data in a replicated multiversion environment,
where execution of read-only transactions or queries becomes
completely independent of the underlying concurrency control and
replica control mechanisms, and the data availability for read-only
transactions increases significantly since they can be executed as
long as any one copy of the object is available in the system. In
order to validate the feasibility of our approach, we developed a
simple prototype to measure the performance improvement in the
response times of queries. The results clearly establish the viability
of the approach as a useful paradigm for the design of efficient and
fault-tolerant distributed systems." ,
bibdate    =    "Sun Nov 28 15:43:35 1993" ,
owner    =    "daisyc" ,
)

@article    ( SCHATZ91,
key    =    "Schatz" ,
author    =    "Schatz, Bruce R." ,
title    =    "Building an Electronic community system" ,
journal    =    "Journal of management Information Systems" ,
volume    =    "Winter 1991/1992 Special Issue" ,
year    =    "1991" ,
keywords=    "Electronic community systems, electronic
communities, sicentific applications, information spaces, telesophy,
organizational memory" ,
abstract=    "An electronic community system encodes and
manipulates the range of knowledge and values necessary to function
effectively in a community or organization. The knowledge includes
both format data and literature and infornal results and news. The
namipulaation includes both browsing through the available knowledge
and recording and shareing interrelationships between the items. A
large-scale experiment is underway to build an electronic community
system for the community of scientists studying the nematode worm C.
elegans, a model organism in molecular biology. This paper discusses a
model for community systems and previous such systems in science, the
biology experiment and previous system, the enabling technology for
handling the knowledge, teh enabling mechanisms for handlling the
values, the state of the prototype, and speculations on future
applications in supporting organizational memory." ,
bibdate    =    "Mon Nov 25 09:43:17 1991" ,
owner    =    "suchen" ,
)

@article    ( SCHEK86A,
key    =    "Schek \& Scholl" ,
author    =    "Schek, H.-J., Scholl, M.H." ,
title    =    "The Relational Model with Relation-valued
Attributes" ,
journal    =    "Information Systems" ,
volume    =    "11" ,
number    =    "2" ,
year    =    "1986" ,
pages    =    "137--147" ,
keywords=    "non-first-normal-form, relation-valued attributes,
relational algebra" ,
abstract=    "Motivated by new applications of database systems
we introduce relations which may have relation-valued attributes and
propose a related algebra. Formal definitions for this extended
relational model can be given by applying usual notions recursively.
The main problem considered in this paper is the formal definition of
an appropriate relational algebra for these non-first-normal-form
relations. We allow the application of the basic relational operators
to any relation-valued attribute within a relation. This leads to a
(hierarchically) nested relational algebra." ,
bibdate    =    "Wed Aug 19 20:53:15 1987" ,
owner    =    "mckenzie" ,
)

@article    ( SCHEK90,
key    =    "Schek et al." ,
author    =    "Schek Hans-Joerg and Paul Heinz-Benard and Marc H.
School and Gerhard Weikum" ,
title    =    "The DASDBS Project: Objectives, Experiences, and
Future Prospects" ,
journal    =    "tkde" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1990" ,
pages    =    "25-43" ,
keywords=    "Database system architecture, extensibility,
nested relations, object buffering, performance evaluation, query
optimization, transaction management." ,
abstract=    "This paper is a retrospective on the Darmstadt
database system project, also know as DASDBS. The project aimed at
providing data management support for advanced applications such as
geoscientific information systems and office automation. Similar to
the dichotomy of RSS and RDS an System R, We pursued a layered
architechural approach: a storage managemant kernel serves as the
lowest common demoninator of the requirements of the various
application classes, and a family of application-orient frontends
provides semantically richer functions on top of the kernel. Here we
discuss the lessons that learned from building the DASDBS system,
particul.arly the following issues: the role of nested relations, the
experiences with using object buffers for coupling the system with the
programming-language environment, and the learning process in
implementing multilevel transactions. " ,
bibdate    =    "Sun Aug  4 13:29:32 1991" ,
owner    =    "bib" ,
)

@techreport    ( SCHENCK88,
key    =    "Schenck \& Wenzel" ,
author    =    "Schenck, D. and Wenzel, B." ,
title    =    " Information Modeling Language {\it EXPRESS}" ,
number    =    "ISO TC184/SC4/WG1 N224 DRAFT" ,
institution=    "ISO" ,
month    =    "apr" ,
year    =    1988 ,
annote    =    "The first Draft of the EXPRESS manual, it has a
very thorough introductory section that explains the basic concepts
and goals of EXPRESS." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@techreport    ( SCHENCK90,
key    =    "Schenck" ,
author    =    "Schenck, D." ,
title    =    " The {\it EXPRESS\/} Language Reference Manual" ,
number    =    "ISO TC184/SC4/WG1 N466 Working Document" ,
institution=    "ISO" ,
month    =    "mar" ,
year    =    1990 ,
annote    =    "The latest Draft of the EXPRESS manual." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( SCHEUERMANN77,
key    =    "Scheuermann" ,
author    =    "Scheuermann, P." ,
title    =    "Concepts of a data base simulation language" ,
booktitle=    "sigmod" ,
volume    =    "7" ,
month    =    "aug" ,
year    =    "1977" ,
pages    =    "145--155" ,
bibdate    =    "Tue Apr 23 22:44:58 1985" ,
)

@inbook        ( SCHEUERMANN80,
key    =    "Scheuermann et al." ,
author    =    "Scheuermann, P. and Schiffner, G. and Weber, H." ,
title    =    "Abstraction Capabilities And Invariant Properties
Modelling Within The Entity-Relationship Approach" ,
booktitle=    "Entity-Relationship Approach to Systems Analysis
and Design" ,
publisher=    "North-Holland Publishing Company" ,
year    =    "1980" ,
pages    =    "121--140" ,
abstract=    "The E-R model provides a good framework for the
modelling of a conceptual schema for a database. One drawback of the
orignal model was its lack of capability to express abstractions. We
show in this paper that not only aggregates and generalization, but
also relationships between relationships, can be incorporated quite
naturally in the original model. Next, we further enhance the E-R
model with a number of intensional constructs necessary to express
several elementary integrity constraints. In this class of intensional
constructs, we include partial and total relationships and weak
relationships of two types. Associated with these intensional
constructs are different invariant properties which must be preserved
during update operations. We show that the type of update operation
and the type of invariant property (i.e. intensional construct)
uniquely determine the way updates may propagate through the database.
Finally, we show that within the module concept where data and
operations are defined together, we also have the capability to
automatically enforce the sequence of operations due to invariant
properties." ,
bibdate    =    "Tue Mar  5 09:30:30 1985" ,
)

@article    ( SCHEUERMANN82,
key    =    "Scheuermann \& Ouksel" ,
author    =    "Scheuermann, P. and Ouksel, M." ,
title    =    "Multidimensional B-Trees For Associative Searching
In Database Systems" ,
journal    =    "Information Systems" ,
volume    =    "7 " ,
number    =    "2" ,
year    =    "1982" ,
pages    =    "123--137" ,
abstract=    "A new method for multiple attribute indexing, the
Multidimensional B-Tree (MBDT), is developed. This method is well
suited for dynamic databases, since it handles several types of
associative queries efficiently and requires low-cost maintenance.
Algorithms and search strategies for exact match, partial match, and
range queries are presented and statistical procedures are given to
estimate the average and worst case retrieval times. The applicability
of our organization to practical databases is discussed and analytical
tradeoffs with regard to index organizations based on k-d trees are
established." ,
bibdate    =    "Wed Mar  6 09:53:01 1985" ,
)

@article    ( SCHEUERMANN90,
key    =    "Scheuermann et al." ,
author    =    "Scheuermann, P. and Yu, C." ,
title    =    "Report on the Workshop on Heterogeneous Database
Systems" ,
journal    =    "sigmod" ,
volume    =    "19" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1990" ,
pages    =    "23--31" ,
bibdate    =    "Sun Jan 19 20:29:49 1992" ,
owner    =    "soo" ,
)

@article    ( SCHIEL88,
key    =    "Schiel" ,
author    =    "Schiel, U." ,
title    =    "The Problem of Identification" ,
journal    =    "SIGMod Record" ,
publisher=    "acm" ,
volume    =    "17" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1988" ,
pages    =    "31--36" ,
bibdate    =    "Wed Feb  8 10:59:57 1989" ,
owner    =    "payne" ,
)

@inproceedings    ( SCHKOLNICK78,
key    =    "Schkolnick" ,
author    =    "Schkolnick, M." ,
title    =    "A Survey of Physical Database Design Methodology
and Techniques" ,
booktitle=    "vldb" ,
year    =    "1978" ,
pages    =    "474--487" ,
bibdate    =    "Sun May  5 17:21:37 1985" ,
)

@article    ( SCHKOLNICK85,
key    =    "Schkolnick \& Tiberio" ,
author    =    "Schkolnick, M. and Tiberio, P." ,
title    =    "Estimating the Cost of Updates in a Relational
Database" ,
journal    =    "tods" ,
volume    =    "10" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1985" ,
pages    =    "163--179" ,
keywords=    "design; performance; relational database; index
selection; query optimization; B-tree; access methods; data and index
update" ,
abstract=    "In this paper, cost formulas are derived for the
updates of data and indexes in a relational database. The costs depend
on the data scan type and the predicates involved in the update
statements. We show that update costs have a considerable influence,
both in the context of the physical database design program and in
access path selection in query optimization for relational DBMSs." ,
bibdate    =    "Mon Nov 11 09:01:58 1985" ,
)

@article    ( SCHMIDT77,
key    =    "Schmidt" ,
author    =    "Schmidt, J." ,
title    =    "Some High Level Language Constructs for Data of
Type Relation" ,
journal    =    "tods" ,
publisher=    "ACM" ,
volume    =    "2" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1977" ,
pages    =    "247--261" ,
bibdate    =    "Mon May  9 14:22:30 1988" ,
owner    =    "" ,
)

@inproceedings    ( SCHMIDT87,
key    =    "Schmidt \& Paredaens" ,
author    =    "Schmidt, J. and Paredaens, J." ,
title    =    " Database Models, where are the going now. Summary
of the Panel Discussion" ,
booktitle=    "MFDBS 87 First Symposium on Mathematical
Fundamentals of Database Systems" ,
pages    =    "239--240" ,
publisher=    "Springer-Verlag" ,
address    =    "New York" ,
year    =    1987 ,
annote    =    "The paper examines the existing models, and
presents reasons for development of new models. Both the semantic and
OO models are seen as promising. The panel encouraged research into
really conceptually new models, not just minor alterations of existing
ones." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( SCHOLL81,
key    =    "Scholl" ,
author    =    "Scholl, M." ,
title    =    "New File Organizations Based on Dynamic Hashing" ,
journal    =    "tods" ,
volume    =    "6" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1981" ,
pages    =    "194--211" ,
bibdate    =    "Wed Jun  5 22:14:50 1985" ,
)

@inproceedings    ( SCHOLL86A,
key    =    "Scholl" ,
author    =    "Scholl, M.H." ,
title    =    "Theoretical Foundation of Algebraic Optimization
Utilizing Unnormalized Relations" ,
booktitle=    "Proceedings of the International Conference on
Database Theory" ,
publisher=    "Springer-Verlag" ,
address    =    "Rome, Italy" ,
editor    =    "Ausiello, G. and Atzeni, P." ,
month    =    "sep" ,
year    =    "1986" ,
pages    =    "380--396" ,
abstract=    "Unnormalized relations, not conforming to the
first normal form condition (1NF) of the relational model have been
proposed recently for a variety of new applications. In this paper we
extend unnormalized relational theory in a way that it becomes
possible to use unnormalized relations as storage structures for
conventional 1NF relational database interfaces. Physical clustering
of precomputed joins can be achieved this way without introducing
redundancy. However, applying transformation rules to internal
relations straightforwardly, will still yield unnecessary join
operations. With the equivalence rules introduced here we prove that
efficient algebraic optimization can be performed using standard (1NF)
techniques. Particularly, all redundant joins can be properly removed." ,
bibdate    =    "Wed Sep  2 15:15:57 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( SCHOLL87,
key    =    "Scholl, et al." ,
author    =    "Scholl, M.H. and Paul, H.-B. and Schek, H.-J." ,
title    =    "Supporting Flat Relations by a Nested Relational
Kernel" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
editor    =    "Hammersley, P." ,
month    =    "sep" ,
year    =    "1987" ,
pages    =    "137--146" ,
abstract=    "While a variety of sophisticated physical database
design techniques has been devised in research, only very limited
capabilities are available in practice. This is mostly due to the
fact, that designing internal layouts differing from the logical view
is not transparent to the user. we present a more general two-level
solution: Our database kernel offers hierarchical clustering expressed
as nested (NF2) relations. Flat relations, resulting from logical
database design, are then mapped to this internal kernel interface. We
shoe, how the various physical structuring approaches can be expressed
in this model. Physical database design for a flat relational
front-end can then be described formally within the (NF2) relational
model. The important aspect of join support is pursued by
materializing some joins in nested relations without any redundancy.
Select-project-join queries on the logical schema can be transformed
to efficiently processible internal queries by applying algebraic
optimization techniques, known e.g. from view optimization.
Preliminary performance evaluations are reported that were carried out
on commercially available systems and solicited our expectations." ,
bibdate    =    "Thu Apr 28 17:22:03 1988" ,
owner    =    "" ,
)

@inproceedings    ( SCHREFL84A,
key    =    "Schrefl et al." ,
author    =    "Schrefl, M. and Tjoa, A.M. and Wagner, R.R." ,
title    =    "Comparison-Criteria for Semantic Data Models" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
month    =    "apr" ,
year    =    "1984" ,
pages    =    "120--125" ,
abstract=    "This paper classifies a collection of semantic
data models within a framework consisting of the following
comparison-criteria: classification, aggregation, generalization and
association (resp. cover aggregation)." ,
bibdate    =    "Wed Sep  2 15:31:39 1987" ,
owner    =    "mckenzie" ,
)

@article    ( SCHULTZ87,
key    =    "Schultz \& Cardenas" ,
author    =    "Schultz, R.D. and Cardenas, A.F." ,
title    =    "An Approach and Mechanism for Auditable and
Testable Advanced Transaction Processing Systems" ,
journal    =    "tse" ,
publisher=    "ieee" ,
volume    =    "SE-13" ,
number    =    "6" ,
month    =    "jun" ,
year    =    "1987" ,
pages    =    "666--676" ,
keywords=    "Audit; auditability; audit definition language;
audit hook; audit probe; quality control; software testing;
transaction processing system" ,
abstract=    "An architectural approach and a software mechanism
is presented to enhance the auditability and testability of advanced
transaction processing EDP systems. A high degree of auditability can
be achieved through integrated support of auditability mechanisms as
opposed to the traditional after-the-fact, ad hoc, add-on audit probe
is presented and its major features outlined. Audit hooks are proposed
as standard probe interfaces for audit software. An overview of a high
level audit-oriented audit probe definition language (APDL) for
specifying the evidence gathering requirements for audit is
highlighted. Audit test concurrent with the normal operation of the
system and the capability of filtering only selected audit data are
advocated. An example is presented illustrating the use of APDL and
its value to auditing and quality control. The thrust of the proposal
matches audit technology as closely as possible to the modern
technology used in the advanced systems which are to be audited, i.e.,
on-line, sophisticated transaction processing, based on highly
integrated databases managed by database management system, based on
telecommunications. It is the author's view that the audit probe
architecture and underlying mechanisms can be used to meet the
auditability and testability requirements of the advanced systems of
today and the future. These systems otherwise will be largely
unauditable with current approaches." ,
bibdate    =    "Wed Jul 29 12:15:05 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( SCHWARZ86A,
key    =    "Schwarz et al." ,
author    =    "Schwarz, P.M. and Chang, W. and Freytag, J.C. and
Lohman, G.M. and McPherson, J. and Mohan, C. and Pirahesh, H." ,
title    =    "Extensibility in the Starburst Database System" ,
booktitle=    "Proceedings of the International Workshop on
Object-Oriented Database Systems" ,
organization=    "IEEE" ,
address    =    "Asilomar, CA" ,
month    =    "sep" ,
year    =    "1986" ,
bibdate    =    "Wed Nov  2 12:51:46 1988" ,
owner    =    "" ,
)

@techreport    ( SEGEV88C,
key    =    "Segev \& Fang" ,
author    =    "Segev, A. and Fang, W." ,
title    =    "Optimal Update Policies for Distributed
Materialized Views" ,
number    =    "LBL-26104" ,
institution=    "School of Business Administration, Industrial
Engineering, Operations Research, Information and Computing Sciences
Division" ,
address    =    "Lawrence Berkeley Laboratories, University of
California, Berkeley, CA" ,
year    =    "1988" ,
month    =    "nov" ,
pages    =    "1--21" ,
abstract=    "In this paper, we present an analytical analysis
of the problem of determining optimal policies for updating
distributed materialized views. We defined the concept of materialized
view currency and allow a query to specify its currency requirement,
and allow a materialized view to be updated from either a base
relation or another materialized view. This flexibility provides an
opportunity for further reduction in the cost of maintaining
distributed materialized view. We model the problem of optimal update
policies to capture currency and policy constraints, replicated data,
and various view update policies. The optimization incorporates a
minimum-cost objective function as well as user's response time
constraints." ,
bibdate    =    "Wed Mar 29 20:29:07 1989" ,
owner    =    "payne" ,
)

@article    ( SEGEV89A,
key    =    "Segev \& Park" ,
author    =    "Segev, A. and Park, J." ,
title    =    "Updating Distributed Materialized Views" ,
journal    =    "tokde" ,
publisher=    "ieee" ,
year    =    "1989" ,
keywords=    "distributed databases; materialized views;
snapshots; query optimization; differential files; replicated data" ,
abstract=    "This paper deals with the problem of updating
materialized views in distributed database systems. We prescribe an
architecture and detailed procedures to update a collection of remote
views with arbitrary refresh times by using a single differential
file. The efficiency of the update procedure is enhanced by adopting a
multiple-query optimization approach, and by introducing a powerful
pre-screening procedure to eliminate differential tuples. We show that
even for a single remote view there are many instances where our
update procedure performs better-with respect to total I/O and
communication costs-than a base table approach." ,
bibdate    =    "Wed Mar 29 20:12:15 1989" ,
owner    =    "payne" ,
)

@techreport    ( SEGEV89C,
key    =    "Segev \& Fang" ,
author    =    "Segev, A. and Fang, W." ,
title    =    "Optimal update policies for distributed
materialized views" ,
institution=    "Dep. Comput. Sci. Res. Lawrence Berkeley Lab., CA" ,
number    =    "TR-26104" ,
year    =    "1988" ,
bibdate    =    "Mon Oct 23 08:31:34 1989" ,
owner    =    "robyn" ,
)

@techreport    ( SEGEV89F,
key    =    "Segev \& Fang" ,
author    =    "Segev, Arie and Fang, Weiping" ,
title    =    "Currency-based Updates to Distributed Materialized
Views" ,
institution=    "Computer Science Research Department, Lawrence
Berkeley Laboratory" ,
year    =    "1989" ,
type    =    "Technical report," ,
number    =    "LBL-27359" ,
address    =    "1 Cyclotron Road, Berkeley, California 94720" ,
)

@inproceedings    ( SEGEV89G,
key    =    "Segev \& Park" ,
author    =    "Segev, Arie and Park, Jooseok" ,
title    =    "Maintaining Materialized Views in Distributed
Databases" ,
booktitle=    "Proceedings of the Fifth International Conference
on Data Engineering" ,
year    =    "1989" ,
pages    =    "262--270" ,
month    =    "February" ,
)

@inproceedings    ( SELINGER79A,
key    =    "Selinger et al." ,
author    =    "Selinger, P.G. and Astrahan, M.M. and Chamberlin,
D.D. and Lorie, R.A. and Price, T.G." ,
title    =    "Access Path Selection in a Relational Database
Management System" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
address    =    "Boston, MA" ,
editor    =    "Bernstein, P.A." ,
year    =    "1979" ,
pages    =    "23--34" ,
abstract=    "In a high level query and data manipulation
language such as SQL, requests are stated non-procedurally, without
reference to access paths. This paper describes how System R chooses
access paths for both simple (single relation) and complex queries
(such as joins), given a user specification of desired data as a
boolean expression of predicates. System R is an experimental database
management system developed to carry out research on the relational
model of data. system R was designed and built by members of the IBM
San Jose Research Laboratory." ,
bibdate    =    "Fri Sep  4 19:07:35 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( SELLIS85,
key    =    "Sellis \& Shapiro" ,
author    =    "Sellis, T.K. and Shapiro, L." ,
title    =    "Optimization Of Extended Database Query Languages" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "424--436" ,
abstract=    "In this paper we examine the problem of query
optimization for extended data manipulation languages. We propose a
set of tactics that can be used in optimizing sequences of data base
operations and describe the corresponding transformation procedures.
These transformations result in new equivalent sequences with better
space and time performance. The proposed techniques are especially
useful in artificial intelligence and engineering applications where
sequences of commands are executed over high volume databases." ,
bibdate    =    "Wed Jun 12 15:27:35 1985" ,
)

@inproceedings    ( SELLIS86A,
key    =    "Sellis" ,
author    =    "Sellis, T.K." ,
title    =    "Global Query Optimization" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
address    =    "Washington, DC" ,
editor    =    "Zaniolo, C." ,
month    =    "may" ,
year    =    "1986" ,
pages    =    "191--205" ,
abstract=    "In some recently proposed extensions to relational
database systems as well as in deductive databases, a database system
is presented with a collection of queries to process instead of just
one. It is an interesting problem then, to come up with algorithms
that process these queries together instead of one query at a time. We
examine the problem of multiple (global) query optimization in this
paper. A hierarchy of algorithms that can be used for global query
optimization is exhibited and analyzed. These algorithms range from an
arbitrary serial execution without any sharing of common results among
the queries to an exhaustive search of all possible ways to process
all queries." ,
bibdate    =    "Fri Oct 16 20:16:29 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( SELLIS87,
key    =    "Sellis" ,
author    =    "Sellis, T.K." ,
title    =    "Efficiently Supporting Procedures in Relational
Dataabase Systems" ,
booktitle=    "Proceedings of the SIGMod 1987 Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "278--291" ,
abstract=    "We examine an extended relational database system
which supports database procedures as full fledged objects. In
particular, we focus on the problems of query prrocessing and
efficient support for database procedures. First, a variation to the
original INGRES decomposition algorithm is presented. Then, we examine
the idea of storing results of previously processed procedures in
secondary storage-caching. Using a cache, the cost of processing a
query can be reduced by preventing multiple evaluations of the same
procedure. Problems associated with cache organizations, such as
replacement policies and validation schemes are examined. Another
means for reducing the execution cost of queries is indexing. A new
indexing scheme for cached results, Partial Indexing, is proposed and
analyzed." ,
bibdate    =    "Fri Sep  4 13:02:02 1987" ,
owner    =    "manning" ,
)

@techreport    ( SELLIS87A,
key    =    "Sellis et al" ,
author    =    "Sellis, T. and Roussopoulos, N. and Mark, L. and
Faloutsos, C." ,
title    =    "High Performance Expert Database Systems:
Efficient Support for Engineering Environments" ,
institution=    "Department of Computer Science, University of
Maryland" ,
address    =    "College Park, MD" ,
year    =    "1987" ,
month    =    "apr" ,
pages    =    "1--23" ,
abstract=    "Manufacturing and engineering processes use both
large scale data and knowledge bases, and the use of expert systems in
such environments has become a necessity. Expert Database Systems have
evolved from conventional database systems to meet the requirements of
current Artificial Intelligence applications. However, future Expert
Database Systems will contain knowledge bases of significant size
which makes main memory insufficient and the use of a database system
a necessity. We propose an effective way of building High Performance
Expert Database Systems to support manufacturing and engineering
environments. These systems are based on Incremental Computation
Models(ICMs); such models utilize results of previous computations by
merging them with newly derived results of computations on small
increments representing changes in the database. Our system will be
able to support very large knowledge bases by utilizing novel
structures and access methods and by using a very sophisticated
inference engine based on incremental computation methods." ,
bibdate    =    "Wed Nov 22 08:16:34 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( SELLIS87B,
key    =    "Sellis et al." ,
author    =    "Sellis, T. and Roussopoulos, N. and Faloustos, C." ,
title    =    "The R+ -Tree: A Dynamic Index For
Multi-dimensional Objects" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
year    =    "1987" ,
pages    =    "507--518" ,
abstract=    "The problem of indexing multidimensional objects
is considered. First, a classification of existing methods is given
along with a discussion of the major issues involved in
multidimensional data indexing. Second, a variation to Guttman's
R-trees (R+ -trees) that avoids overlapping rectangles in intermediate
nodes of the tree is introduced. Algorithms for searching, updating,
initial packing and reorganization of the structure are discussed in
detail. Finally, we provide analytical results indicating that R+
-trees achieve up to 50\% savings in disk accesses compared to an
R-tree when searching files of thousands of rectangles." ,
bibdate    =    "Fri Jan 19 11:24:43 1990" ,
owner    =    "robyn" ,
)

@article    ( SELLIS88,
key    =    "Sellis" ,
author    =    "Sellis, T." ,
title    =    "Intelligent Caching and Indexing Techniques For
Relational Database Systems" ,
journal    =    "Information Systems" ,
volume    =    "13" ,
number    =    "2" ,
year    =    "1988" ,
pages    =    "175--185" ,
abstract=    "Recent developments in the design of database
systems include proposals for several extensions to the basic model of
relational database systems. In this paper we present some ideas on
the design of intelligent support mechanisms for large databases where
procedures in the form of database commands are stored in relation
fields. First, we examine the idea of storing results of previously
processed procedures in secondary storage (caching). Problems
associated with cache organizations, such as replacement policies and
validation schemes, are examined in depth. Another means for reducing
the execution cost of queries is indexing. Conventional indexing
techniques assume that all values are known, such schemes cannot be
used effectively. As a solution to that problem, a new indexing
scheme, Partial Indexing, is proposed and analyzed. Uses of partial
indexes in conventional database systems are also described." ,
bibdate    =    "Tue Oct 24 10:21:59 1989" ,
owner    =    "robyn" ,
)

@article    ( SELLIS88A,
key    =    "Sellis" ,
author    =    "Sellis, Timos K." ,
title    =    "Multiple-Query Optimization" ,
journal    =    "ACM Transactions on Database Systems" ,
year    =    "1988" ,
volume    =    "13" ,
number    =    "1" ,
pages    =    "23--52" ,
month    =    "March" ,
)

@inproceedings    ( SELLIS88B,
key    =    "Sellis \& Roussopoulos" ,
author    =    "Sellis, Timos K. and Roussopoulos, Nicholas" ,
title    =    "Deep Compilation of Large Rule Bases" ,
booktitle=    "Proceedings from the Second International
Conference on Expert Database Systems" ,
year    =    "1988" ,
pages    =    "277--288" ,
month    =    "" ,
)

@article    ( SELLIS89,
key    =    "Sellis et al." ,
author    =    "Sellis, Timos and Lin, Chih-Chen and Raschid,
Louiga" ,
title    =    "Data Intensive Production Systems: The DIPS
Approach" ,
journal    =    "ACM SIGMOD Record" ,
year    =    "1989" ,
volume    =    "18" ,
number    =    "3" ,
pages    =    "52--58" ,
month    =    "September" ,
)

@article    ( SELLIS90,
key    =    "Sellis \& Ghosh" ,
author    =    "Sellis, T. and Ghosh, S." ,
title    =    "On the Multiple-Query Optimization Problem" ,
journal    =    "tkde" ,
volume    =    "2" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1990" ,
pages    =    "262--266" ,
abstract=    "Some recently proposed extensions to relational
database systems, as well as deductive database systems, require
support for multiple-query processing. In this paper, we examine the
complexity of the multiple-query optimization problem in database
management systems. We show that the problem is NP-hard. Then we
examine the performance of a heuristic algorithm to solve the
multiple-query optimization problem and suggest some heuristics for
query ordering which improves the efficiency of the algorithm
considerably. The paper also presents some experimental results on the
performance of various heuristics." ,
bibdate    =    "Tue Nov 27 10:37:17 1990" ,
owner    =    "robyn" ,
)

@article    ( SELLIS91,
key    =    "Sellis \& Shapiro" ,
author    =    "Sellis, T.; Shapiro, L." ,
title    =    " Query Optimization for Nontraditional Database
Applications" ,
journal    =    "tse" ,
volume    =    "17" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1991" ,
pages    =    "77--86" ,
abstract=    " In this paper we study database query languages
and their use for programming nontraditional applications, such as
engineering and artificial intelligence applications. In such
environments, database programs are used to code applications that
work over large data sets residing in databases. Optimizing such
programs then becomes a necessity. We look at various optimization
techniques and suggest transformations to be used for improving the
performance of database programs. These transformations result in new
equivalent database programs with better space and time performance.
Several of these techniques apply to classical query languages,
although the primary focus of this paper is on extended query
languages which include an iteration operator." ,
bibdate    =    "Mon Feb 25 11:07:37 1991" ,
owner    =    "robyn" ,
)

@inproceedings    ( SEVCIK81,
key    =    "Sevcik" ,
author    =    "Sevcik, K." ,
title    =    "Data Base System Performance Prediction Using An
Analytical Model" ,
booktitle=    "vldb" ,
year    =    "1981" ,
pages    =    "182--198" ,
bibdate    =    "Sun May  5 17:23:03 1985" ,
)

@article    ( SEVERANCE75,
key    =    "Severance" ,
author    =    "Severance, D." ,
title    =    "A Parametric Model of Alternative File Structures" ,
journal    =    "Information Systems" ,
volume    =    "1" ,
number    =    "2" ,
year    =    "1975" ,
pages    =    "51--55" ,
bibdate    =    "Sun May  5 19:24:29 1985" ,
)

@article    ( SEVERANCE76A,
key    =    "Severance \& Lohman" ,
author    =    "Severance, D.G. and Lohman, G.M." ,
title    =    "Differential Files: Their Application to the
Maintenance of Large Databases" ,
journal    =    "tods" ,
volume    =    "1" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1976" ,
pages    =    "256--267" ,
keywords=    "database maintenance, data sharing, backup and
recovery, differential files" ,
abstract=    "The representation of a collection of data in
terms of its differences from some preestablished point of reference
is a basic storage compaction technique which finds wide
applicability. This paper describes a differential database
representation which is shown to be an efficient method for storing
large and volatile databases. The technique confines database
modifications to a relatively small area of physical storage and as a
result offers two significant operational advantages. First, because
the ``reference point'' for the database is inherently static, it can
be simply and efficiently stored. Second, since all modifications to
the database are physically localized, the process of backup and the
process of recovery are relatively fast and inexpensive." ,
bibdate    =    "Fri Sep  4 19:19:52 1987" ,
owner    =    "mckenzie" ,
)

@article    ( SEVERANCE77,
key    =    "Severance \& Carlis" ,
author    =    "Severance, D. and Carlis, J." ,
title    =    "A Practical Approach to Selecting Record Access
Paths" ,
journal    =    "compsurv" ,
volume    =    "9" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1977" ,
pages    =    "259--272" ,
bibdate    =    "Fri May  3 17:30:15 1985" ,
)

@article    ( SHAHABI95,
key    =    "Shahabi \& Ghandeharizadeh" ,
author    =    "Shahabi, C. and Ghandeharizadeh, S." ,
title    =    "Continuous Display of Presentations Sharing Clips" ,
journal    =    "ACM Multimedia Systems Journal" ,
publisher=    "ACM Press" ,
year    =    "1995" ,
pages    =    "33" ,
bibdate    =    "Wed Jan 10 15:27:41 1996" ,
abstract=    "Databases were introduced to remove redundancy
from conventional file systems to encourage sharing of information.
The same idea is extended in this study to support sharing for
continuous media data types (i.e., video and audio). Sharing in
conventional databases results in update anomalies when information is
modified. With presentations (movies) sharing clips (sequence of
frames), continuous display becomes challenging as well. To ensure a
continuous display, a system should retrieve data at a pre-specified
rate. Otherwise, a display might suffer from disruptions or delays,
termed hiccups. To ensure a continuous display using a multi-disk
hardware platform, a video object is striped into a number of
subobjects. The system enforces a regular schedule on retrieval of
each subobject by controlling the placement of the subobjects across
the disks. Now if different presentations share subobjects, each
presentation will enforce its own restrictions on the placement of the
data. This might result in irregular schedules for alternative
presentations, resulting in hiccups. One approach to this problem is
to replicate the shared subobjects as many times as they appear in
different presentations. An alternative is to maintain these
subobjects memory resident. Due to read-only characteristic of the
application, flash memory is appropriate for storing these subobjects.
These alternative approaches result in different storage costs. In
this paper we investigate each approach as well as a wide spectrum of
hybrid approaches that minimize the storage cost while ensuring a
continuous display. In addition, this study investigates two
alternative paradigms to support multiple users: Demand and Data
driven. In the former, the display of a DAG starts once a request
references it. In the latter, all possible paths of a DAG are
displayed periodically. A price analysis is provided for each paradigm
in order to configure the cheapest storage structure." ,
owner    =    "jeff" ,
)

@article    ( SHAPIRO86,
key    =    "Shapiro" ,
author    =    "Shapiro, Leonard D." ,
title    =    "Join Processing in Database Systems with Large
Main Memories" ,
journal    =    "ACM Transactions on Database Systems" ,
year    =    "1986" ,
volume    =    "11" ,
number    =    "3" ,
pages    =    "239--264" ,
month    =    "September" ,
)

@article    ( SHEARD89,
key    =    "Sheard \& Stemple" ,
author    =    "Sheard, T. and Stemple, D." ,
title    =    "Automatic Verification of Database Transaction
Safety" ,
journal    =    "tods" ,
volume    =    "14" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1989" ,
pages    =    "322--368" ,
keywords=    "Theory; Verification; Constraint maintenance;
database integrity" ,
abstract=    "Maintaining the integrity of databases is one of
the promises of database management systems. This includes assuring
that integrity constraints are invariants of database transactions.
This is very difficult to accomplish efficiently in the presence of
complex constraints and large amounts of data. One way to minimize the
amount of processing required to maintain database integrity over
transaction processing is to prove at compile-time that transactions
cannot, if run atomically, disobey integrity constraints. We report on
a system that performs such verification for a robust set of
constraint and transaction classes. The system accepts database
schemas written in a more or less traditional style and accepts
programs in a high-level programming language. Automatic verification
fast enough to be effective on current workstation hardware is
performed." ,
bibdate    =    "Tue Nov  7 13:49:41 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( SHEKHAR92,
key    =    "Shekhar \& Yang" ,
author    =    "Shekhar, S. and Yang, T.A." ,
title    =    "MoBiLe Files and Efficient Processing of Path
Queries on Scientific Data" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "ieee" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Alamitos, CA" ,
editor    =    "Golshani, F." ,
volume    =    "8" ,
month    =    "feb" ,
year    =    "1992" ,
pages    =    "78--85" ,
abstract=    "Observational scientific data is collected by
measuring a system's (e.g., atmosphere) properties over space and
time. Path queries represent frequent scientific computations for
tracking a dynamic pheomenon (e.g., storm), statistical computation,
and collecting boundary conditions for differential equations. An
integrated management of spatial and temporal attributes of data is
required for efficiency and consistency. Euclidean proximity and
continuity relationships must be preserved over integrated space-time
domain. A path specifies spatial attributes of a phenomenon as a
function of time. New abstract data types are needed for specifying
path queries. New access methods are needed to capture continuity in
integrated space-time domain for processing path queries. We propose a
representation of path queries and an access method, MoBiLe files, to
capture space-time continuity. We validate the proposed methods via
performance evaluation." ,
bibdate    =    "Sat Aug 29 15:17:46 1992" ,
owner    =    "leoso" ,
)

@article    ( SHENOY89,
key    =    (Shenoy \& \"{O}zsoyo\v{g}lu) ,
author    =    (Shenoy, S. and \"{O}zsoyo\v{g}lu, Z.) ,
title    =    "Design and Implementation of a Semantic Query
Optimizer" ,
journal    =    "IEEE Transactions on Data and Knowledge
Engineering" ,
volume    =    "1" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1989" ,
pages    =    "344--361" ,
keywords=    "Algorithms; graph theory; heuristics; implication
integrity constraints; query optimization; redundancy; relational
databases; secondary index; semantic rules; subset integrity
constraints" ,
abstract=    "In this paper we describe a scheme to utilize
semantic knowledge in optimizing a user specified query. The semantics
is represented as function-free clauses in predicate logic. The scheme
uses a graph theoretic approach to identify redundant joins and
restrictions present in a given query. An optimization algorithm is
presented which eliminates redundant nonprofitable specifications from
a query while adding additional profitable specifications to it.
Dynamic and heuristic interaction of three entities-schema, semantics,
and query--forms the basis of the algorithm. The implementation
architecture of the algorithm and test results on a representative set
of data are presented. Issues associated with updating of semantic
constraints are addressed and an algorithm for semantic maintenance is
introduced." ,
bibdate    =    "Fri Dec  8 13:54:22 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( SHETH89,
key    =    "Sheth" ,
author    =    "Sheth, Amit P." ,
title    =    "Does Loose AI-DBMS Coupling Stand a Chance?" ,
booktitle=    "Proceedings of the 5th International Conference on
Data Engineering, Los Angeles, California" ,
year    =    "1989" ,
pages    =    "252--254" ,
month    =    "" ,
)

@article    ( SHETH90,
key    =    "Sheth \& Larson" ,
author    =    "Sheth, A. and Larson, J." ,
title    =    "Federated Database Systems for Managing
Heterogeneous and Autonomous Databases" ,
journal    =    "compsurv" ,
volume    =    22 ,
pages    =    "183--235" ,
month    =    "sep" ,
year    =    1990 ,
annote    =    "The paper reviews the various problem areas in
federated systems. Specifically schema translation, access control,
and schema integration. Also considered are the issues of query
translation for the various nodes in the system. The paper also
contains a good introductory section on the federated model of DDBMS." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( SHIN85,
key    =    "Shin \& Irani" ,
author    =    "Shin, D.G. and Irani, K.B." ,
title    =    "Partitioning A Relational Database Horizontally
Using A Knowledge-Based Approach" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "95--105" ,
bibdate    =    "Tue Jun 11 11:40:42 1985" ,
)

@article    ( SHIN94,
key    =    "Shin \& Meltzer" ,
author    =    "Shin, D. K. and Meltzer, A. C." ,
title    =    "A New Join Algorithm" ,
journal    =    "sigmod" ,
publisher=    "ACM Press" ,
volume    =    "23" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1994" ,
pages    =    "13--18" ,
bibdate    =    "Wed Nov 22 13:09:26 1995" ,
abstract=    "This paper introduces a new efficient join
algorithm to increase the speed of the join relational operation.
Using a divide and conquer strategy, stack oriented filter technique
in the new join algorithm filters unwanted tuples as early as possible
while none of the currently existing join algorithms takes advantage
of any filtering concept. Other join algorithms may carry the
unnecessary tuples up to the last moment of join atribute comparisons.
Four join algorithms are described and discussed in this paper: the
nested-loop join algorithm, the sort-merge join algorithm, the hash
join algorithm, and the new join algorithm." ,
owner    =    "jeff" ,
)

@article    ( SHIPMAN81,
key    =    "Shipman" ,
author    =    "Shipman, D.W." ,
title    =    "The Functional Data Model and the Data Language
DAPLEX" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "6" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1981" ,
pages    =    "140--173" ,
keywords=    "Database; language; functional data model" ,
abstract=    "DAPLEX is a database language which incorporates:
(1) a formulation of data in terms of entities; (2) a functional
representation for both actual and virtual data relationships; (3) a
rich collection of language constructs for expressing entity selection
criteria; (4) a notion of subtype/supertype relationship. This paper
presents and motivates the DAPLEX language and the underlying data
model on which it is based." ,
bibdate    =    "Thu Apr  2 10:11:50 1987" ,
owner    =    "manning" ,
)

@incollection    ( SHIPMAN88,
key    =    "Shipman" ,
author    =    "Shipman, D." ,
editor    =    "Stonebreaker, M." ,
title    =    " The Functional Data Model and the Data Language
{\it DAPLEX\/}" ,
booktitle=    "Readings in Database Systems" ,
pages    =    "388--404" ,
publisher=    "Morgan Kaufman" ,
address    =    "San Mateo" ,
year    =    1988 ,
annote    =    "The basic work on the DAPLEX model that was based
on keys and functions on the keys. " ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( SHMUELI84,
key    =    "Shmueli \& Atai" ,
author    =    "Shmueli, O. and Itai, A." ,
title    =    "Maintenance of Views" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Yormark, B." ,
publisher=    "ACM Press" ,
address    =    "Boston, MA" ,
month    =    "jun" ,
pages    =    "240--255" ,
year    =    "1984" ,
abstract=    "In relational databases a view definition is a
query against the database, and a view materialization is the result
of applying the view definition to the current database. A view
materialization over a database may change as relations in the
database undergo modifications. In this paper a mechanism is proposed
in which the view is materialized at all times. The problem which this
mechanism addresses is how to quickly update the view in response to
database changes. A structure is maintained which provides information
useful in minimizing the amount of work caused by updates. Methods are
presented for handling both general databases and the much simpler
tree databases (also called acyclic database). In both cases adding or
deleting a tuple can be performed in polynomial time. For tree
databases the degree of the polynomial is independent of the schema
structure while for cyclic databases the degree depends on the schema
structure. The cost of a sequence of tuple additions (deletions) is
also analyzed." ,
bibdate    =    "Mon Oct  1 15:43:38 1984" ,
)

@article    ( SHNEIDERMAN82,
key    =    "shnerderman \& Thomas" ,
author    =    "Shneiderman, Ben and Thomas, Glenn" ,
title    =    "An Architecture for Automatic Relational Database
System Conversion" ,
journal    =    "ACM Transaction on Database Systems" ,
year    =    "1982" ,
volume    =    "7" ,
number    =    "2" ,
pages    =    "235--257" ,
month    =    "June" ,
)

@inproceedings    ( SHOSHANI82,
key    =    "Shoshani" ,
author    =    "Shoshani, Arie" ,
title    =    "Statistical Databases: Characteristics, Problems,
and Some Solutions" ,
booktitle=    "Proceedings of the Eighth International Conference
on Very Large Data Bases" ,
year    =    "1982" ,
pages    =    "208--222" ,
month    =    "September" ,
)

@inproceedings    ( SHOSHANI84,
key    =    "Shoshani et al." ,
author    =    "Shoshani, Arie and Olken, Frank and Wong, Harry K.
T." ,
title    =    "Characteristics of Scientific Databases" ,
booktitle=    "Proceedings of the Tenth International Conference
on Very Large Data Bases" ,
year    =    "1984" ,
pages    =    "147--160" ,
month    =    "August" ,
)

@article    ( SHOSHANI85,
key    =    "Shoshani \& Wong" ,
author    =    "Shoshani, Arie and Wong, Harry K. T." ,
title    =    "Statistical and Scientific Database Issues" ,
journal    =    "IEEE Transactions on Software Engineering" ,
year    =    "1985" ,
volume    =    "SE-11" ,
number    =    "10" ,
pages    =    "1040--1047" ,
month    =    "October" ,
)

@inproceedings    ( SHRUFI94,
key    =    "Shrufi" ,
author    =    "Shrufi, Adel" ,
title    =    "Performance of Clustering Policies in Object Bases" ,
booktitle=    "Proceedings of the Conference on Information and
Knowledge Management" ,
address    =    "Gaithersburg, Maryland" ,
volume    =    "3" ,
month    =    "nov" ,
year    =    "1994" ,
bibdate    =    "Thu Dec  1 10:53:00 1994" ,
owner    =    "kevin" ,
)

@article    ( SHU77,
key    =    "Shu et al." ,
author    =    "Shu, N.C. and Housel, B.C. and Taylor, R.W. and
Ghosh, S.P. and Lum, V.Y." ,
title    =    "EXPRESS: A Data EXtraction, Processing, and
REStructuring System" ,
journal    =    "tods" ,
publisher=    "ACM" ,
volume    =    "2" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1977" ,
pages    =    "134--174" ,
keywords=    "Data translation; data conversion; file
conversion; data restructuring; program generation; very high level
languages; dta description languages; dta manipulation languages" ,
abstract=    "EXPRESS is an experimental prototype data
translation system which can access a wide variety of data and
restructure it for new uses. The system is driven by two very high
level nonprocedural languages: DEFINE for data description and CONVERT
for data restructuring. Program generation and cooperating process
techniques are used to achieve efficient operation. This paper
describes the design and implementation of EXPRESS. DEFINE and CONVERT
are summarized and the implementation architecture presented. The
DEFINE description is compiled into a customized PL/1 program for
accessing source data. The restructuring specified in CONVERT is
compiled into a set of customized PL/1 procedures to derive multiple
target files from multiple input files. Job steps and job control
statements are generated automatically. During execution, the
generated procedures run under control of a process supervisor, which
coordinates buffer management and handles file allocation,
deallocation, and all input/output requests. The architecture of
EXPRESS allows efficiency in execution by avoiding unnecessary
secondary storage references while at the same time allowing the
individual procedures to be independent of each other. Its modular
structure permits the system to be extended or transferred to another
environment easily." ,
bibdate    =    "Thu Nov 20 14:41:31 1986" ,
owner    =    "manning" ,
)

@inproceedings    ( SHU87A,
key    =    "Shu" ,
author    =    "Shu, N.C." ,
title    =    "Automatic Data Transformation and Restructuring" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1987" ,
pages    =    "173--180" ,
abstract=    "Data restructuring is often an improtant part of
information processing. This paper describes an automatic data
restructurer which takes over, from the user, the `thinking and
coding' process normally associated with writing algorithms for data
restructuring. The `thinking and coding' process is accomplished in
two stages. In the first stage, the differences in the input and
output data structures are recognized and the applicability of various
transformation rules are analyzed. The result is a plan for mapping
the specified input(s) to the desired output. In the second stage,
construction begins. Embedded knowledge on the target language and the
run time efficiency considerations are utilized to implement the plan.
The result is an executable program, tailored for the task at hand." ,
bibdate    =    "Wed Apr 27 20:01:27 1988" ,
owner    =    "" ,
)

@unpublished    ( SHULTZ86,
key    =    "Shultz" ,
author    =    "Shultz, Roger" ,
title    =    "Controlling Testbed Database Characteristics" ,
year    =    "1986" ,
month    =    "Jul" ,
pages    =    "27" ,
abstract=    "Described in this paper is a testbed database
generator (TBDBG) for generating database extensions with controlled
attribute value distributions. TBDBG is useful for testing and
benchmarking database systems, coputer architectures and application
programs. Use of a supporting database management system allows easy
maintenance and expansion of the system. Experiments matching the join
cardinalities of generated relations with an analytically computed
expected join cardinality valildate TBDBG implementatiaon. Utility of
TBDBG is exhibited by benchmarking a database management system
executing queries on generated data. By timing the execution of
retrieval and join operations on synthetic relations it is shown that
join timings with both keys distributed normally have larger jumps in
stnadard deviation than join timings with randomly distributed keys." ,
bibdate    =    "Tue Jan  7 11:40:27 1992" ,
owner    =    "suchen" ,
)

@inproceedings    ( SHULTZ87,
key    =    "Shultz \& Miller" ,
author    =    "Shultz, R. and Miller, I." ,
title    =    "Tree Structured Multiple Processor Join Methods" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1987" ,
pages    =    "190--199" ,
abstract=    "This paper summarizes the execution cost of join
operations performed by parallel executing processors. Four different
parallel join algorithms are proposed for execution on multiple
processing nodes, interconnected on a tree structured communication
network. Secondary storage is accessed in parallel by leaf nodes. An
average execution cost analysis is presented for the multiple
processor join methods. For a reasonable ratio of result to operand
cardinality, joins which use hashing for semi-join of operands at the
leaf node secondary storage interface are predicted to perform better
than nested-loop and sort-merge joins. Both node memory capacity and
join result cardinality have a large influence on the relative
performance of the join methods. This analysis method forms a basis
for selecting among alternative processing methods for statically
linked, multiple processor computer architectures." ,
bibdate    =    "Thu Apr 28 16:28:28 1988" ,
owner    =    "" ,
)

@inproceedings    ( SIBLEY85,
key    =    "Sibley" ,
author    =    "Sibley, E.H." ,
title    =    "The Pragmatics of Database Management Outline of
the Panel Discussion" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "232--234" ,
bibdate    =    "Tue Jun 11 13:26:29 1985" ,
)

@inproceedings    ( SIDLE80,
key    =    "Sidle" ,
author    =    "Sidle, T.W." ,
title    =    "Weaknesses of Commercial Database Management
Systems in Engineering Applications" ,
booktitle=    "17th Design Automation Conference" ,
address    =    "Minneapolis, MN" ,
month    =    "jun" ,
year    =    "1980" ,
pages    =    "57--61" ,
bibdate    =    "Thu Jan  8 11:51:53 1987" ,
owner    =    "manning" ,
)

@article    ( SIEGEL92,
key    =    "Siegel et al." ,
author    =    "Siegel, M. and Sciore, E. and Salveter, S." ,
title    =    "A Method for Automatic Rule Derivation to Support
Semantic Query Optimization" ,
journal    =    "tods" ,
volume    =    "17" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1992" ,
pages    =    "563--600" ,
keywords=    "Integrity constraints; learning; transformation
heuristic" ,
abstract=    "The use of inference rules to support intelligent
data processing is an increasingly important tool in many areas of
computer science. In database systems, rules are used in semantic
query optimization as a method for reducing query processing costs.
The savings is dependent on the ability of experts to supply a set of
useful rules and the ability of the optimizer to quickly find the
appropriate transformations generated by these rules. Unfortunately,
the most useful rules are not always those that would or could be
specified by an expert. This paper describes the architecture of a
system having two interrelated components: a combined
conventional/semantic query optimizer, and an automatic rule deriver.
Our automatic rule derivation method uses intermediate results from
the optimization process to direct the search for learning new rules.
Unlike a system employing only user-specified rules, a system with an
automatic capability can derive rules that may be true only in the
current state of the database and can modify the rule set to reflect
changes in the database and its usage pattern. This system has been
implemented as an extension of the EXODUS conventional query optimizer
generator. We describe the implementation, and show how semantic query
optimization is an extension of conventional optimization in this
context." ,
bibdate    =    "Fri Jan 22 12:30:10 1993" ,
owner    =    "bassili" ,
)

@article    ( SILBERSCHATZ90,
key    =    "Silberschatz et al." ,
author    =    "Silberschatz, A. and Stonebraker, M. and Ullman,
J." ,
title    =    "Database Systems: Achievements and Opportunities" ,
journal    =    "sigmod" ,
volume    =    "19" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1990" ,
pages    =    "6--22" ,
keywords=    "Lagunita report" ,
bibdate    =    "Sun Jan 19 20:27:29 1992" ,
owner    =    "soo" ,
)

@article    ( SILBERSCHATZ91,
key    =    "Silberschatz et al." ,
author    =    "Silberschatz, Avi and Michael Stonebraker and Jeff
Ullman" ,
title    =    "Database Systems: Achievements and Opportunities" ,
journal    =    "cacm" ,
volume    =    "34" ,
number    =    "10" ,
month    =    "Oct" ,
year    =    "1991" ,
pages    =    " 110 -- 120" ,
bibdate    =    "Sun Nov  3 23:42:23 1991" ,
owner    =    "suchen" ,
)

@article    ( SILBERSHATZ90,
key    =    "Silbershatz et al." ,
author    =    "Silbershatz, Avi and Stonebraker, Michael and
Ullman, Jeffrey D. (editors)" ,
title    =    "Database Systems: Achievements and Opportunities" ,
journal    =    "ACM SIGMOD Record" ,
year    =    "1990" ,
volume    =    "19" ,
number    =    "4" ,
pages    =    "6--22" ,
month    =    "December" ,
note    =    (The "Lagunita" Report of the NSF Invitational
Workshop on the Future of Database Systems Research, held in Palo
Alto, California, February 22-23, 1990) ,
)

@article    ( SILER76,
key    =    "Siler" ,
author    =    "Siler, K." ,
title    =    "A Stochastic Evaluation Model for Database
Organizations in Data Retrieval Systems" ,
journal    =    "cacm" ,
volume    =    "19" ,
number    =    "2" ,
month    =    "feb" ,
year    =    "1976" ,
pages    =    "84--95" ,
bibdate    =    "Fri Apr 26 23:39:07 1985" ,
)

@inproceedings    ( SINHA85,
key    =    "Sinha et al." ,
author    =    "Sinha, M.K. and Nandikar, P.D. and Mehndiratta,
S.L." ,
title    =    "Timestamp Based Certification Schemes for
Transactions in Distributed Database Systems" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "402--411" ,
abstract=    "Two certification schemes for transactions in
distributed database systems are proposed. The schemes do not
construct any conflict graph but use system-wide unique timestamps to
serialize certification requests of concurrent transactions. In the
first scheme, the distributed certification scheme, transactions are
assigned timestamp when they request for certification. A transaction
get certified if, at no site, its certification request conflict with
that of a transaction with higher timestamp. In the second scheme, the
negotiated certification scheme, the system negotiates with
participating data items, and comes up with a timestamp, if possible,
with which the transaction will not face any conflict with concurrent
transactions and will get certified. The two-phase commit protocol can
very easily be integrated with either of the two certification
schemes, and it is shown that the schemes do not need any extra
message cost to guarantee failure atomicity." ,
bibdate    =    "Wed Jun 12 15:19:07 1985" ,
)

@inproceedings    ( SIVASANKARAN95,
key    =    "Sivasankaran et al." ,
author    =    "Sivasankaran, R. and Ramamritham, K. and
Stankovic, J. and Towsley, D." ,
title    =    "Data Placement, Logging, and Recovery in Real-Time
Active Databases" ,
booktitle=    "International Workshop on Active and Real-Time
Database Systems" ,
organization=    "University of Skovde, Sweden" ,
address    =    "Sweden" ,
month    =    "jun" ,
year    =    "1995" ,
bibdate    =    "Thu Aug 10 16:24:14 1995" ,
owner    =    "jeff" ,
)

@inproceedings    ( SKARRA86,
key    =    "Skarra \& Zdonik" ,
author    =    "Skarra, A.H. and Zdonik, S.B." ,
title    =    "The Management of Changing Types in an
Object-Oriented Database" ,
booktitle=    "Proceedings of the Conference on Object-Oriented
Programming Systems, Languages and Applications" ,
organization=    "ACM" ,
address    =    "Portland, OR" ,
editor    =    "Meyrowitz, N." ,
volume    =    "21" ,
month    =    "nov" ,
year    =    "1986" ,
pages    =    "483--495" ,
abstract=    "We examine the problem of type evolution in an
object- oriented database environment. Type definitions are persistent
objects in the database and as such may be modified and shared. The
effects of changing a type extend to objects of the type and to
programs that use objects of the type. We propose a solution to the
problem through an extension of the semantic data model. A change in
the interface defined by a type may result in errors when programs use
new or old objects of the type. Through the use of an abstraction of
the type over time, timestamping and error handling mechanisms provide
support for the type designer in creating compatible version of the
type. The mechanisms are incorporated into the behavior defined by the
type and are inherited via the type-lattice." ,
bibdate    =    "Mon Nov 10 12:34:59 1986" ,
owner    =    "manning" ,
)

@inproceedings    ( SKARRA86B,
key    =    "Skarra et al." ,
author    =    "Skarra, A.H. and Zdonik, S.B. and Reiss, S.P." ,
title    =    "An Object Server for an Object-Oriented Database
System" ,
booktitle=    "Proceedings of the 1986 International Workshop on
Object-Oriented Database Systems" ,
organization=    "ACM; IEEE" ,
publisher=    "Computer Society Press" ,
address    =    "Pacific Grove, CA" ,
editor    =    "Dittrich, K. and Dayal, U." ,
month    =    "sep" ,
year    =    "1986" ,
pages    =    "196--204" ,
abstract=    "This paper summarizes the interface,
implementation, and use of a server process that is used as a back-end
by an object-oriented database system. This server is responsible for
managing objects on secondry storage, managing transactions, and
implementing a simple form of trigger. We sketch the interface of this
system and point out some of the more interesting implementation
issues that were encountered in building it. Client processes
communicate asynchronously with the server by message sending. The
system is designed to be as efficient as possible since one of its
clients is the GARDEN system, an object-oriented programming
environment. GARDEN views both static and dynamic program pieces as
objects. Our back-end server provides persistent and sharable storage
for GARDEN. The paper includes an extended example of how GARDEN makes
use of this resource." ,
bibdate    =    "Thu Nov 20 11:15:16 1986" ,
owner    =    "manning" ,
)

@inbook        ( SKARRA87,
key    =    "Skarra \& Zdonik" ,
author    =    "Skarra, A.H. and Zdonik, S.B." ,
title    =    "Type Evolution in an Object-Oriented Database" ,
booktitle=    "Research Directions in Object-Oriented Programming" ,
publisher=    "MIT Press" ,
address    =    "Cambridge, MA" ,
year    =    "1987" ,
series    =    "Computer Systems Series" ,
chapter    =    "Part 3" ,
pages    =    "393--415" ,
abstract=    "We address the problem of maintaining consistency
between a set of persisten objects and a set of type definitions that
can change. The context of the problem is an object-oriented database
system. Our objective is to make a type's changes transparent with
respect to programs that use the type. The solution involves the use
of a version control mechanism and a set of error handlers associated
with the versions of a type. We describe the structure of the
version-control and error-handling mechanisms and demonstrate their
use." ,
bibdate    =    "Tue Mar 28 13:56:47 1989" ,
owner    =    "payne" ,
)

@inbook        ( SKARRA91,
key    =    "Skarra et al." ,
author    =    "Skarra, A.H. and Zdonik, S.B. and Reiss, S.P." ,
title    =    "ObServer: An Object Server for an Object-Oriented
Database System" ,
booktitle=    "On Object-Oriented Database Systems" ,
publisher=    "Springer-Verlag" ,
address    =    "Berlin Heidelberg" ,
year    =    "1991" ,
chapter    =    "17" ,
pages    =    "275--290" ,
abstract=    "ObServer is a server process that manages
persistent objects in an object-oriented database system. The system
is implemented under UNIX 4.3 BSD on a network of workstations with
the server and its data residing on a single node. Clients communicate
asynchronously with ObServer from possibly remote and dissimilar
machines by messages sent according to interprocess communication
(IPC) protocols. ObServer manages secondary storage, transactions, and
concurrent access to objects in a multiuser environment in which
transactions are interactive and probably long. The implementation
emphasizes efficiency in the transfer of objects through the potential
bottlenecks of IPC and file access. ObServer needs minimal semantic
knowledge of the objects it manages, and thus can support application
programs built on arbitrary type systems. The paper describes the
model, interface, and implementation of ObServer and discusses some of
the more interesting issues that were encountered during its design.
ObServer is currently in use as an object server for two different
systems: ENCORE, an object-oriented database system with multiple
inheritance, and GARDEN, a graphical programming environment. An
extended example of GARDEN as an ObServer client is presented." ,
bibdate    =    "Fri Aug 28 16:36:58 1992" ,
owner    =    "leoso" ,
)

@inproceedings    ( SLONIM87A,
key    =    "Slonim et al." ,
author    =    "Slonim, J. and Henshaw, J. and Schonbach, A. and
Bauer, M." ,
title    =    "Transaction Processing Systems on Future
Workstations: A Feasibility Study" ,
booktitle=    "ncc" ,
publisher=    "AFIPS Press" ,
address    =    "Chicago, IL" ,
month    =    "jun" ,
year    =    "1987" ,
pages    =    "359--366" ,
abstract=    "An account of a benchmark test to evaluate the
performance of a relational database management system, INGRES, in the
context of a library circulation system. The results suggest that,
within a couple of years, relational database systems running on
microcomputers within distributed environments will be performance-
and cost-effective in supporting transaction processing systems." ,
bibdate    =    "Wed Apr 27 19:22:16 1988" ,
owner    =    "" ,
)

@article    ( SMITH75B,
key    =    "Smith \& Chang" ,
author    =    "Smith, J.M. and Chang, P.Y-T." ,
title    =    "Optimizing the Performance of a Relational Algebra
Database Interface" ,
journal    =    "cacm" ,
volume    =    "18" ,
number    =    "10" ,
month    =    "oct" ,
year    =    "1975" ,
pages    =    "568--579" ,
bibdate    =    "Wed Dec 29 19:54:10 1982" ,
)

@article    ( SMITH77B,
key    =    "Smith \& Smith" ,
author    =    "Smith, J.M. and Smith, D.C.P." ,
title    =    "Database Abstractions: Aggregation and
Generalization" ,
journal    =    "tods" ,
volume    =    "2" ,
year    =    "1977" ,
number    =    "2" ,
month    =    "jun" ,
pages    =    "105--133" ,
)

@inproceedings    ( SMITH85A,
key    =    "Smith et al." ,
author    =    "Smith, J.M. and Chan, A. and Danberg, S. and Fox,
S. and Nori, A." ,
title    =    "A Tool Kit For Database Programming In Ada" ,
booktitle=    "Proceedings of the Ada International Conference on
Ada in Use" ,
organization=    "ACM" ,
publisher=    "Cambridge University Press" ,
address    =    "Paris" ,
editor    =    "Barnes, J.G.P. and Fisher, Jr. G.A." ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "41--57" ,
abstract=    "This paper describes an Ada-compatible database
application development environment being designed and prototyped at
Computer Corporation of America. This environment is intended to
provide uniform access to centralized, homogeneously distributed, and
heterogeneously distributed databases. There are two key interfaces:
an interactive interface called Daplex which is based on a
semantically rich data model and a powerful access language, and an
application program interface called Adaplex which consists of an
expression level integration of Daplex with Ada. The objective of this
paper is to explain our rationale for designing Adaplex and to
describe its support environment." ,
bibdate    =    "Tue Sep 10 13:35:59 1985" ,
)

@article    ( SMITH85C,
key    =    "Smith" ,
author    =    "Smith, H.C." ,
title    =    "Database Design: Composing Fully Normalized Tables
>From A Rigorous Dependency Diagram" ,
journal    =    "Computing Practices" ,
volume    =    "28" ,
number    =    "8" ,
month    =    "aug" ,
year    =    "1985" ,
pages    =    "826--838" ,
abstract=    "A new simplified methodology for
relational-database design overcomes the difficulties associated with
nonloss decomposition. It states dependencies between data fields on a
dependency list and then depicts them unambiguously as interlinked
bubbles and doublebubbles on a dependency diagram. From the dependency
diagram, a set of fully normalized tables is derived." ,
bibdate    =    "Tue Sep 10 13:26:40 1985" ,
)

@inproceedings    ( SMITH87,
key    =    "Smith \& Zdonik" ,
author    =    "Smith, Karen E. and Zdonik, Stanley B." ,
title    =    "Intermedia: A Case Study of the Differences
Between Relational and Object-Oriented Database Systems" ,
booktitle=    "OOPSLA '87 Proceedings" ,
year    =    "1987" ,
pages    =    "452--465" ,
month    =    "October" ,
)

@techreport    ( SMITH89,
key    =    "Smith" ,
author    =    "Smith, B." ,
title    =    " Product Data Exchange: The {\it PDES\/} Project -
Status and Objectives" ,
number    =    "NIST Document NBSIR 89-4166" ,
institution=    "NIST" ,
year    =    1989 ,
annote    =    "A history of IGES and PDES. A discussion of STEP
and PDES, and an outline of the NIST participation in PDES." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@techreport    ( SMITH89A,
key    =    "Smith" ,
author    =    "Smith, B." ,
title    =    " External Representation of Product Definition
Data " ,
number    =    "NIST Document NBSIR 89-4165" ,
institution=    "NIST" ,
year    =    1989 ,
annote    =    "A status report from NIST, on the STEP initiative." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( SOCKUT79,
key    =    "Sockut \& Goldberg" ,
author    =    "Sockut, G.H. and Goldberg, R.P." ,
title    =    "Database Reorganization - Principles and Practice" ,
journal    =    "compsurv" ,
volume    =    "11" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1979" ,
pages    =    "371--395" ,
keywords=    "database, database management, reorganization,
restructuring, file maintenance" ,
abstract=    "Database reorganization can be defined as changing
some aspect of the way in which a database is arranged logically
and/or physically. An example is changing from a one-to-one to a
one-to-many relationship. Reorganization is a necessary function in a
database system. This paper introduces the basic concepts of
reorganization, including why it is performed. Many types of
reorganization are described and classified into logical/physical
levels. Then pragmatic issues such as reorganization strategies, a
survey of several commerical reorganization facilities, case studies,
and database administration considerations are coverd. Finally,
several research efforts are surveyed." ,
)

@article    ( SOCKUT88,
key    =    "Sockut \& Malhotra" ,
author    =    "Sockut, G. H. and Malhotra, A." ,
title    =    "A full-screen facility for defining relational and
entity-relationship schemas" ,
journal    =    "IEEE Software" ,
month    =    "nov" ,
year    =    "1988" ,
bibdate    =    "Tue Nov  7 11:38:21 1989" ,
owner    =    "robyn" ,
)

@article    ( SOLOIEV92,
key    =    "Soloiev" ,
author    =    "Soloiev, V." ,
title    =    "An Overview of Three Commercial Object Oriented
Database Management Systems: ONTOS, ObjectStore, and O$_2$" ,
journal    =    "sigmod" ,
volume    =    21 ,
pages    =    "93--104" ,
month    =    "mar" ,
year    =    1992 ,
annote    =    "A good overview and comparison of the features of
these three models" ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( SOLOVIEV92,
key    =    "Soloviev" ,
author    =    "Soloviev, V." ,
title    =    "An Overview of Three Commercial Object-Oriented
Database Management Systems: ONTOS, ObjectStore, and ${\rm O}_2$" ,
journal    =    "sigmod" ,
volume    =    "21" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1992" ,
pages    =    "93--104" ,
abstract=    "We present an analysis of three current
object-oriented DBMS products: ONTOS, ObjectStore, and O2, as
described by their available documentation. The most attractive
feature of ONTOS and ObjectStore is their use of C++ as a user
interface -- a widespread object-oriented language. They also provide
persistent data implementation, transaction and recovery mechanisms,
and modern application development tool sets following the
recommendations of [Atkinson et al. 92]. O2 was chosen for a
well-developed data type system and end-user interface and for its
reputation from the literature." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( SOLOVIEV93,
key    =    "Soloviev" ,
author    =    "Soloviev, V." ,
title    =    "A Truncating Hash Algorithm for Processing
Band-Join Queries" ,
booktitle=    "Ninth International Conference on Data Engineering" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "Vienna, Austria" ,
month    =    "apr" ,
year    =    "1993" ,
pages    =    "419--427" ,
abstract=    "A non-equijoin of relations R and S is a based
join if the join predicate requires values in the join attribute of R
to fall within a specified band about the values in the join
attributes of S. This paper describes a new algorithm, termed a
truncating-hash band join, for evaluating band joins. This algorithm
is based on the idea of truncating join attribute values in order to
execute band joins in a way similar to hash join algorithms for
equijoins. Unlike previously proposed algorithms for band joins, it
does not sort either of the input relations during its execution. We
present a comparison between the truncating-hash band join algorithm
and previous algorithms for band joins using an analytical model. The
model also compares an evaluation of band join algorithms for parallel
implementation on a 'shared-nothing' multiprocessor system. The
results show that the truncating-hash band join algorithm outperforms
the other band algorithms because of a significantly lower CPU cost." ,
bibdate    =    "Mon May 17 18:34:53 1993" ,
owner    =    "bassili" ,
)

@article    ( SON88,
key    =    "Son" ,
author    =    "Son, S.H." ,
title    =    "Replicated Data Management in Distribution
Database Systems" ,
journal    =    "SIGMod Record" ,
publisher=    "acm" ,
volume    =    "17" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1988" ,
pages    =    "62--69" ,
abstract=    "Replication is the key factor in improving the
availability of data in distributed systems. Replicated data is stored
at multiple sites so that it can be accessed by the user even when
some of the copies are not available due to site failures. A major
restriction to using replication is that replicated copies must behave
like a single copy, i.e., mutual consistency as well as internal
consistency must be preserved. Synchronization techniques for
replicated data in distributed database systems have been studied in
order to increase the degree of concurrency and to reduce the
possiblity of transaction rollback. In this paper, we classify
different synchronization methods by underlying mechanisms and the
type of information they use in ordering the operations of
transactions, and survey some of the replication management methods
appeared in the literature." ,
bibdate    =    "Wed Feb  8 10:53:34 1989" ,
owner    =    "payne" ,
)

@inproceedings    ( SON90,
key    =    "Son \& Haghighi" ,
author    =    "Son, Sang H. and Haghighi, Navid" ,
title    =    "Performance Evaluation of Multiversion Database
Systems" ,
booktitle=    "Proceedings of the Sixth International Conference
on Data Engineering" ,
year    =    "1990" ,
pages    =    "129--136" ,
month    =    "February" ,
)

@article    ( SON90A,
key    =    "Son" ,
author    =    "Son, S.H." ,
title    =    "Real-Time Database Systems: A New Challenge" ,
journal    =    "IEEE Data Engineering" ,
publisher=    "ieee" ,
volume    =    "13" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1990" ,
pages    =    "51--57" ,
abstract=    "The design and implementation of real-time
database systems presents many new and challenging problems. Compared
with traditional databases, real-time database systems have a distinct
feature: they must satisfy timing constraints associated with
transactions. Transactions in real-time database systems should be
scheduled considering both data consistency and timing constraints. In
addition, a real-time database system must adapt to changes in the
operating environment and guarantee the completion of critical
transactions. In this paper we address the issues associated with
transaction modeling, scheduling and concurrency control, consistency,
and predictability requirements for real-time systems." ,
bibdate    =    "Thu Jul  8 22:37:54 1993" ,
owner    =    "daisyc" ,
)

@article    ( SORDI84,
key    =    "Sordi" ,
author    =    "J. J. Sordi" ,
title    =    "Query Management Facility" ,
journal    =    "IBM Syst. J." ,
volume    =    "23" ,
number    =    "2" ,
year    =    "1984" ,
pages    =    "126--150" ,
bibdate    =    "Sat Mar 23 21:11:57 1991" ,
owner    =    "suchen" ,
)

@article    ( SPACCAPIETRA92,
key    =    "Spaccapietra et al." ,
author    =    "Spaccapietra, S. and Parent, C. and Dupont, Y." ,
title    =    "Model Independent Assertions for Integration of
Heterogeneous Schemes" ,
journal    =    "VLDB Journal" ,
publisher=    "VLDB Endowment" ,
volume    =    "1" ,
number    =    "1" ,
month    =    "jul" ,
year    =    "1992" ,
pages    =    "81--126" ,
keywords=    "Database design and integration; distributed
databases; federated databases; heterogeneous databases; schema
integration; conceptual modeling" ,
abstract=    "Due to the proliferation of database applications,
the integration of existing databases into a distributed or federated
system is one of the major challenges in responding to enterprises'
information requirements. Some proposed integration techniques aim at
providing database administrators (DBAs) with a view definition
language they can use to build the desired integrated schema. These
techniques leave to the DBA the responsibility of appropriately
restructuring schema elements from existing local schemas and of
solving inter-schema conflicts. This paper investigates the
assertion-based approach, in which the DBA's action is limited to
pointing out corresponding elements in the schemas and to defining the
nature of the correspondence in between. This methodology is apable
of: ensuring better integration by taking into account additional
semantic information (assertions about links); automatically solving
structural conflicts; building the integrated schema without requiring
conforming of initial schemas; applying integration rules to a variety
of data models; and performing view as well as database integration.
This paper presents the basic ideas underlying our approach and
focuses on resolution of structural conflicts." ,
bibdate    =    "Thu Jan 28 18:56:00 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( SPOONER84A,
key    =    "Spooner" ,
author    =    "Spooner, D.L." ,
title    =    "Database Support for Interactive Computer Graphics" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Yormark, B." ,
publisher=    "acm" ,
address    =    "Boston, MA" ,
month    =    "jun" ,
year    =    "1984" ,
pages    =    "90--99" ,
abstract=    "Software applications involving interactive
computer graphics are made up of several components. One of these is a
data modeling component. This data modeling component is often
appliction dependent and therefore difficult to integrate with the
data model of other related applications. One solution to this problem
is to interfact a DBMS with data model dependency and increase sharing
of data. This also has the advantage of allowing novice users to use
computer graphics by eliminating the need for the user to write
complex programs invoking the graphics system. This paper explores
these ideas by discussing the implementation of a prototype interface
between a relational DBMS and an interactive computer graphics system.
It presents both the database structures used to manage the data and
the techniques used to design the interface. It concludes by
discussing an approach for making the interface portable. " ,
bibdate    =    "Mon Oct  1 09:37:17 1984" ,
)

@article    ( SPOONER84B,
key    =    "Spooner \& Gudes" ,
author    =    "Spooner, D.L. and Gudes, E." ,
title    =    "A Unifying Approach to the Design of a Secure
Database Operating System" ,
journal    =    "tse" ,
volume    =    "SE-10" ,
number    =    "3" ,
month    =    "may" ,
year    =    "1984" ,
pages    =    "310--319" ,
keywords=    "authorization models and capabilities and database
management; operating system interface; data security; objects" ,
bibdate    =    "Sun May 27 15:50:04 1984" ,
)

@inproceedings    ( SPOONER89,
key    =    "Spooner et al." ,
author    =    "Spooner, D. and Sanderson, D. and Charalambous, G." ,
title    =    " A Data translation Tool for Engineering Systems" ,
booktitle=    "Proceedings 2nd International Conference on Data
and Knowledge Systems for Manufacturing and Engineering" ,
publisher=    "IEEE Computer Society Press" ,
month    =    "oct" ,
year    =    1989 ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( SPRATT83,
key    =    "Spratt" ,
author    =    "Spratt, L.L." ,
title    =    "The Transaction Resolution Journal: Extending the
Before Journal" ,
journal    =    "opsysrev" ,
volume    =    "19" ,
number    =    "3" ,
month    =    "jul" ,
year    =    "1985" ,
pages    =    "55--62" ,
bibdate    =    "Mon Aug  5 14:47:00 1985" ,
)

@article    ( SPRUGNOLI77,
key    =    "Sprugnoli" ,
author    =    "Sprugnoli, R." ,
title    =    "Perfect hash functions: A single probe retrieving
method for static sets" ,
journal    =    "cacm" ,
volume    =    "20" ,
number    =    "11" ,
month    =    "nov" ,
year    =    "1977" ,
pages    =    "841--850" ,
bibdate    =    "Fri Jun  7 17:58:34 1985" ,
)

@article    ( SPYRATOS87,
key    =    "Spyratos" ,
author    =    "Spyratos, N." ,
title    =    "The Partition Model: A Deductive Database Model" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "12" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1987" ,
pages    =    "1--37" ,
keywords=    "Theory; database semantics; database state
transitions" ,
abstract=    "We present a new database model in which each
attribute is modeleed by a family of disjoint subsets of an underlying
population of objects. Such a family is called a partitioning, and the
set of all partitioning is turned into a lattice by appropriately
defining product and sum. A database is seen as a function from a
sublattice into the lattice of partitionings. The model combines the
following features: (1) syntactic simplicity (essentially that of the
relational model), (2) powerful means for the specification of
semantic information (in the form of lattice equations), and (3)
deductive capability (essentially that of set theory). The relational
model of data and the basic constructs of semantic modeling can be
embedded into our model in a simple and straightforward manner." ,
bibdate    =    "Wed May  6 17:35:13 1987" ,
owner    =    "manning" ,
)

@techreport    ( SQL81,
key    =    "IBM" ,
author    =    "IBM" ,
title    =    "SQL/Data-System, Concepts and Facilities" ,
number    =    "GH24-5013-0" ,
institution=    "IBM" ,
year    =    "1981" ,
month    =    "jan" ,
bibdate    =    "Wed Nov  7 11:11:04 1984" ,
)

@manual        ( SQLDS81,
key    =    "SQL/DATA-SYSTEM" ,
title    =    "SQL/DATA-SYSTEM, Concepts and Facilities" ,
year    =    "1981" ,
organization=    "IBM" ,
month    =    "jan" ,
bibdate    =    "Sat May 11 13:27:44 1985" ,
)

@techreport    ( SQUIER90,
key    =    "Squier" ,
author    =    "Squier, B." ,
title    =    " Business Case for Harmonization of Product Data
Standards" ,
institution=    "Computer Aided Manufacturing International" ,
address    =    "Arlington Texas" ,
month    =    "jan" ,
year    =    1990 ,
annote    =    "A discussion of the problems inherent in
harmonizing these standards, and a discussion of the proposed work
with NIST and PDES for defining how these various systems can be
integrated together." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( SRINIVASAN92,
key    =    "Srinivasan \& Carey" ,
author    =    "Srinivasan, V. and Carey, M." ,
title    =    "Compensation-Based On-Line Query Processing" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "San Diego, California" ,
editor    =    "Stonebraker, M." ,
volume    =    "21" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "331--340" ,
abstract=    "It is well known that using conventional
concurrency control techniques for obtaining serializable answers to
long-running queries leads to an unacceptable drop in system
performance. As a result, more current DBMSs execute such queries
under a reduced degree of consistency, thus providing non-serializable
answers. In this paper, we present a new and highly concurrent
approach for processing large decision support queries in relational
databases. In this new approach, called compensation-based query
processing, concurrent updates to any data participating in a query
are communicated to the query's on-line query processor, which then
compensates for these updates so that the final answer reflects
changes caused by the updates. Very high concurrency is achieved by
locking data only briefly, while still delivering
transaction-consistent answers to queries." ,
bibdate    =    "Mon Jan 25 13:46:48 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( SRIPADA94,
key    =    "Sripada \& Wuthrich" ,
author    =    "Sripada, S. and Wuthrich, B." ,
title    =    "Cumulative Updates" ,
booktitle=    "vldb" ,
address    =    "Santiago, Chile" ,
volume    =    "20" ,
month    =    "sep" ,
year    =    "1994" ,
bibdate    =    "Thu Dec  1 10:39:58 1994" ,
owner    =    "kevin" ,
)

@techreport    ( SRIVASTAVA88,
key    =    "Srivastava \& Rotem" ,
author    =    "Srivastava, Jaideep and Rotem, Doron" ,
title    =    "Analytical Modeling of Materialized View
Maintenance" ,
institution=    "Computer Science Research, Lawrence Berkeley
Laboratories. University of California" ,
year    =    "1988" ,
type    =    "Technical report" ,
address    =    "Berkeley, CA 94720" ,
month    =    "February" ,
)

@techreport    ( STAELIN90,
key    =    "Staelin \& Garcia Molina" ,
author    =    "Staelin, C.; Garcia Molina, H." ,
title    =    "Clustering Active Disk Data To Improve Disk
Performance" ,
number    =    "283--90" ,
institution=    "Princeton University" ,
address    =    "Princeton, NJ" ,
year    =    "1990" ,
month    =    "sep" ,
pages    =    "17" ,
abstract=    "We show that clustering the active data of a file
system in the center of the disk is a viable and effective means of
improving system I/O performance. We demonstrate that it can reduce
the average seek delay and in the presence of disk queues it can also
reduce the average rotational delay. We also present experimental
results which show that file access patterns are strongly skewed, and
that file activity levels are relatively stable over time, making them
a good predictor of future file activity levels. Using simulations, we
investigate two techniques for reorganizing the disk data, and we
measure sensitivity to imperfect predictions of future file activity
due to drifting file activity levels. We demonstrate significant
performance improvements over a full spectrum of file system use, from
lightly loaded systems through heavily loaded systems with large disk
queues, with performance benefits increasing as the system load
increases." ,
bibdate    =    "Mon Feb 11 09:24:14 1991" ,
owner    =    "robyn" ,
)

@techreport    ( STAMENAS89,
key    =    "Stamenas" ,
author    =    "Stamenas, Antonios G." ,
title    =    "High Performance Incremental Relational Databases" ,
institution=    "Department of Computer Science, University of
Maryland" ,
year    =    "1989" ,
type    =    "Technical report," ,
number    =    "UMIACS-TR-89-49, CS-TR-2245" ,
address    =    "College Park, MD 20742" ,
month    =    "May" ,
)

@mastersthesis    ( STAMENAS89A,
key    =    "Stamenas" ,
author    =    "Stamenas, A.G." ,
title    =    "High Performance Incremental Relational Databases" ,
school    =    "Department of Computer Science, University of
Maryland" ,
address    =    "College Park, MD" ,
month    =    "may" ,
year    =    "1989" ,
abstract=    "Query processing in relational databases can be
sped up by maintaining views as stored sets of pointers, called {\it
view caches}, pointing to those tuples in the underlying relations
needed to materialize the views. In this method, a view represents a
permanent collection of hierarchical access paths to the underlying
base relations, where the real data is stored. The multilevel,
interrelational redirection of the pointers that define the access
paths necessitates the clustering of view caches to achieve suboptimal
performance. This thesis explores clustering methods, describes and
analyzes an implementation towards the solution of efficiently
accessing and maintaining materialized views. The deferred update
strategy is adopted to refresh outdated view caches. Differential
files are used to record the updates and powerful screening algorithms
are presented to eliminate duplicate differential tuples and yield the
set of net updates to be reflected to the view cache. One pass
incremental algorithms are presented to retrieve while simultaneously
updating the view caches. Experimental results are given,
demonstrating the performance gains." ,
bibdate    =    "Thu Jul  1 03:18:52 1993" ,
owner    =    "daisyc" ,
)

@inproceedings    ( STEARNS76,
key    =    "Stearns et al." ,
author    =    "Stearns, R.E. and Lewis, P.M. and Rosenkrantz,
D.J." ,
title    =    "Concurrency Control for Database Systems" ,
booktitle=    "Proceedings of the 17th Symposium on Foundations
of Computer Science" ,
organization=    "IEEE" ,
year    =    "1976" ,
pages    =    "19--32" ,
bibdate    =    "Mon Feb  2 10:36:39 1987" ,
owner    =    "mckenzie" ,
)

@article    ( STEFIK86,
key    =    "Stefik et al." ,
author    =    "Stefik, M. and Bobrow, D. and Kahn, K." ,
title    =    "Integrating Access-oriented Programming into a
Multiparadigm Environment" ,
journal    =    "IEEE Software" ,
volume    =    "3" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1986" ,
pages    =    "10--18" ,
bibdate    =    "Mon Mar 15 14:54:38 1993" ,
owner    =    "rts" ,
)

@inproceedings    ( STEMPLE87,
key    =    "Stemple et al." ,
author    =    "Stemple, D. and Mazumdar, S. and Sheard, T." ,
title    =    "On the Modes and Meaning of Feedback to
Transaction Designers" ,
booktitle=    "Proceedings of the ACM SIGMOD Annual Conference" ,
organization=    "acm" ,
publisher=    "ACM Press" ,
address    =    "San Francisco, CA" ,
editor    =    "Dayal, U. and Traiger, I." ,
month    =    "may" ,
year    =    "1987" ,
pages    =    "374--386" ,
abstract=    "An analysis of database transactions in the
presence of database integrity constraints can lead to several modes
of feedback to transaction designers. The different kinds of feedback
include tests and updates that could be added to the transaction to
make it obey the integrity constraints, as well as predicates
representing post-conditions guaranteed by a transaction's execution.
We discuss the various modes, meanings, and uses of feedback. We also
discuss methods of generating feedback from integrity constraints,
transaction details and theorems constituting both generic knowledge
of database systems and specific knowledge about a particular
database. Our methods are based on a running system that generates
tailored theories about database systems from their schemas and uses
these theories to prove that transactions obey integrity constraints." ,
bibdate    =    "Fri Jul 24 16:00:15 1987" ,
owner    =    "manning" ,
)

@article    ( STERLING75,
key    =    "Seterling et al." ,
author    =    "Sterling, T. and Lum, V. and Shu, N. and Housel,
B." ,
title    =    " {\it CONVERT:\/} A High Level Translation
Definition Language for Data Conversion" ,
journal    =    "cacm" ,
volume    =    8 ,
pages    =    "557--567" ,
month    =    "oct" ,
year    =    1975 ,
annote    =    "A full description of the CONVERT language is
given. It is fairly complete, and dealt well with record oriented
systems. A good set of examples is given." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( STERLING90,
key    =    "Sterling \& Weinkam" ,
author    =    "Sterling, T. and Weinkam, J." ,
title    =    " Sharing Scientific Data" ,
journal    =    "cacm" ,
volume    =    33 ,
pages    =    "113--119" ,
month    =    "aug" ,
year    =    1990 ,
annote    =    "Overview of the problems in data sharing, mostly
deals with the non-computer issues. A bit of a side issue is the
problems in sharing computerized files." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( STONE87A,
key    =    "Stone" ,
author    =    "Stone, H.S." ,
title    =    "Parallel Querying of Large Databases: A Case Study" ,
journal    =    "Computer" ,
publisher=    "ieee" ,
volume    =    "20" ,
number    =    "10" ,
month    =    "oct" ,
year    =    "1987" ,
pages    =    "11--21" ,
bibdate    =    "Mon Oct 12 16:32:20 1987" ,
owner    =    "manning" ,
)

@article    ( STONE90,
key    =    "Stone \& Hentchel" ,
author    =    "Stone, C. and Hentchel, D." ,
title    =    " Database Wars Revisited" ,
journal    =    "Byte" ,
pages    =    "233--242" ,
month    =    "oct" ,
year    =    1990 ,
annote    =    "Good discussion of the issues involved in the 3rd
Generation versus OO-Manifesto argument. Comparisons drawn to the
older Relational versus Network-Hierarchical debates." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( STONEBRAKER75A,
key    =    "Stonebraker" ,
author    =    "Stonebraker, M." ,
title    =    "Implementation of Integrity Constraints and Views
by Query Modification" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
address    =    "San Jose, CA" ,
month    =    "jun" ,
year    =    "1975" ,
bibdate    =    "Sun Nov 22 17:32:35 1987" ,
owner    =    "mckenzie" ,
)

@article    ( STONEBRAKER76A,
key    =    "Stonebraker et al." ,
author    =    "Stonebraker, M. and Wong, E. and Kreps, P. and
Held, G." ,
title    =    "The Design and Implementation of Ingres" ,
journal    =    "tods" ,
volume    =    "1" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1976" ,
pages    =    "189--222" ,
)

@techreport    ( STONEBRAKER76B,
key    =    "Stonebraker \& Neuhold" ,
author    =    "Stonebraker, M. and Neuhold, E." ,
title    =    "A Distributed Data Base Version of INGRES" ,
type    =    "Memorandum" ,
number    =    "ERL-M612" ,
institution=    "Electronics Research Laboratory, University of
California, Berkeley" ,
month    =    "sep" ,
year    =    "1976" ,
)

@inproceedings    ( STONEBRAKER80,
key    =    "Stonebraker \& Keller" ,
author    =    "Stonebraker, M. and Keller, K." ,
title    =    "Embedding Experts and Hypothetical Data Bases in a
Relational Data Base System" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
address    =    "Santa Monica, CA" ,
month    =    "may" ,
year    =    "1980" ,
bibdate    =    "Thu Sep 29 22:08:05 1983" ,
)

@article    ( STONEBRAKER81,
key    =    "Stonebraker" ,
author    =    "Stonebraker, M." ,
title    =    "Operating System Support for Database Management" ,
journal    =    "cacm" ,
volume    =    "24" ,
number    =    "7" ,
month    =    "jul" ,
year    =    "1981" ,
pages    =    "412--418" ,
abstract=    "Several operating system services are examined
with a view toward their applicability to support of database
management functions. These services include buffer pool management;
the file system; scheduling, process management, and interprocess
communication; and consistency control." ,
bibdate    =    "Sat Oct 22 18:26:33 1983" ,
)

@inproceedings    ( STONEBRAKER81B,
key    =    "Stonebraker" ,
author    =    "Stonebraker, M." ,
title    =    "Hypothetical Data Bases as Views" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
address    =    "Ann Arbor, Michigan" ,
editor    =    "Lien, Y.E." ,
year    =    "1981" ,
pages    =    "224--229" ,
bibdate    =    "Wed Oct  1 17:04:36 1986" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( STONEBRAKER81C,
key    =    "Stonebraker" ,
author    =    "Stonebraker, M." ,
title    =    "Hypothetical Data Bases as Views" ,
booktitle=    "Proceedings of the ACM Sigmod Conference" ,
organization=    "acm" ,
publisher=    "acm" ,
month    =    "may" ,
year    =    "1981" ,
pages    =    "224--229" ,
abstract=    "In this paper we show that hypothetical data bases
can be effectively supported by slight extensions to conventional view
support mechanisms. Moreover, we argue that the resulting structure
may well be quite efficient and that there are advantages to making
hypothetical data bases central to the operation of a DBMS." ,
bibdate    =    "Mon Mar  4 08:57:58 1985" ,
)

@techreport    ( STONEBRAKER82A,
key    =    "Stonebraker et al." ,
author    =    "Stonebraker, M. and Stettner and Kalash and
Guttman and Lynn" ,
title    =    "Document Processing in a Relational Data Base
System" ,
number    =    "M82/32" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1982" ,
bibdate    =    "Mon Nov  2 10:43:49 1987" ,
owner    =    "manning" ,
)

@techreport    ( STONEBRAKER82B,
key    =    "Stonebraker \& Rowe" ,
author    =    "Stonebraker, M. and Rowe, L." ,
title    =    "Database Portals: A New Application Program
Interface" ,
number    =    "M82/80" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1982" ,
bibdate    =    "Mon Nov  2 10:48:08 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( STONEBRAKER83,
key    =    "Stonebraker" ,
author    =    "Stonebraker, Michael" ,
title    =    "DBMS and AI: Is there any common point of view?" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "acm" ,
address    =    "PO Box 64145, Baltimore, MD 21264" ,
editor    =    "DeWitt, David J., Gardarin, Georges" ,
month    =    "may" ,
year    =    "1983" ,
pages    =    "134" ,
bibdate    =    "Tue Nov 20 14:48:45 1984" ,
)

@inproceedings    ( STONEBRAKER83B,
key    =    "Stonebraker et al." ,
author    =    "Stonebraker, M. et al." ,
title    =    "Application of Abstract Data Types and Abstract
Indices to CAD Data Bases" ,
booktitle=    "ACM-IEEE Data Base Week Proceedings" ,
organization=    "acm" ,
address    =    "San Jose, CA" ,
month    =    "may" ,
year    =    "1983" ,
bibdate    =    "Fri Feb 22 14:20:54 1985" ,
)

@inproceedings    ( STONEBRAKER84A,
key    =    "Stonebraker et al." ,
author    =    "Stonebraker, M. and Anderson, E. and Hanson, E.
and Rubenstein, B." ,
title    =    "Quel As A Data Type" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Yormark, B." ,
publisher=    "acm" ,
address    =    "Boston, MA" ,
month    =    "jun" ,
year    =    "1984" ,
pages    =    "208--214" ,
abstract=    "This paper explores the use of commands in a query
language as an abstract data type (ADT) in data base management
systems. Basically, an ADT facility allows new data types, such as
polygons, lines, money, time, arrays of floating point numbers, bit
vectors, etc., to supplement the built-in data types in a data base
system. In this paper we demonstrate the power of adding a data type
corresponding to commands in a query language. We also propose three
extensions to the query langauge. QUEL to enhance its power in this
augmented environment." ,
annote    =    "This paper has proposed a novel use of abstract
data types and extended QUEL with three additional features. These
extensions support addedpower, referential integrity, variant records,
data base procedure, generalization and aggregation in a single
facility. Our proposal has points in common with GEM which supports
new data types corresponding to 'pointer to a tuple' and 'set of
values'. Moreover, generalization hierarchies are supported and range
variables can conveniently be defined over entities in this hierarchy.
Our proposal effectively supports both of GEMs new data types as
special cases of the QUEL ADT. Moreover, generalization is cleanly
supported. Only GEM's use of range variable is not contained in our
proposal. [from the conclusion]. Areas for future research include how
to optimize QUEl commands extended with new operators, how to
integrate the new functions into query processing leuristics, and the
design of a programming language interface supporting the objects
generated by this proposal." ,
bibdate    =    "Mon Oct  1 09:55:37 1984" ,
)

@article    ( STONEBRAKER84B,
key    =    "Stonebraker" ,
author    =    "Stonebraker, M." ,
title    =    "Virtual Memory Transaction Management" ,
journal    =    "opsysrev" ,
volume    =    "18" ,
number    =    "2" ,
month    =    "apr" ,
year    =    "1984" ,
pages    =    "8--16" ,
abstract=    "In this paper we examine the consequences of an
operating system providing transaction management in an environment
where files are bound into a user's address space. The discussion
focuses on inherent limitations in providing concurrency control and
crash recovery services in this environment and on hardware extensions
needed to overcome these deficiencies." ,
bibdate    =    "Tue Jun 12 16:01:01 1984" ,
)

@techreport    ( STONEBRAKER84C,
key    =    "Stonebraker et al." ,
author    =    "Stonebraker, M. and DuBourdieux, D. and Edwards,
W." ,
title    =    "Problems in Supporting Data Base Transactions in
an Operating System Transaction Manager" ,
number    =    "UCB/ERL M84/87" ,
institution=    "Electronics Research Laboratory, University of
California" ,
address    =    "Berkeley, CA" ,
year    =    "1984" ,
month    =    "oct" ,
pages    =    "1--9" ,
abstract=    "This paper reports on the experience of the
authors in attempting to support data base transactions on top of an
existing operating system transaction manager. It will be seen that
significant modifications to both the example data base system and the
example operating system are required to support the concept. The
conclusion to be drawn is that operating system transaction managers
will have to be designed more generally than is now suggested and that
application programs (such as data base systems) will have to
participate in the transaction management process." ,
bibdate    =    "Mon Jul 28 12:11:48 1986" ,
owner    =    "manning" ,
)

@inproceedings    ( STONEBRAKER84D,
key    =    "Stonebraker \& Rowe" ,
author    =    "Stonebraker, M. and Rowe, L." ,
title    =    "Database Portals: A New Application Program
Interface" ,
booktitle=    "vldb" ,
month    =    "aug" ,
year    =    "1984" ,
address    =    "Singapore" ,
bibdate    =    "Mon May  9 14:18:37 1988" ,
owner    =    "" ,
)

@incollection    ( STONEBRAKER84E,
key    =    "Stonebraker" ,
author    =    "Stonebraker, Michael" ,
title    =    "A Database Perspective" ,
booktitle=    "On Conceptual Modelling" ,
publisher=    "Springer Verlag" ,
year    =    "1984" ,
editor    =    "Michael J. Brodie and John Mylopoulos and Joachim
W. Schmidt" ,
chapter    =    "18" ,
pages    =    "457--458" ,
)

@article    ( STONEBRAKER85,
key    =    "Stonebraker et al." ,
author    =    "Stonebraker, M. and DuBourdieux, D. and Edwards,
W." ,
title    =    "Problems In Supporting Data Base Transactions In
An Operating System Transaction Manager" ,
journal    =    "opsysrev" ,
volume    =    "19" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1985" ,
pages    =    "6--14" ,
abstract=    "This paper reports on the experience of the
authors in attempting to support data base transactions on top of an
existing operating system transaction manager. It will be seen that
significant modifications to both the example data base system and the
example operating system are required to suppport the concept. The
conclusion to be drawn is that operating system transaction managers
will have to be designed more generally than is now suggested and that
application programs (such as data base systems) will have to
participate in the transaction management process." ,
bibdate    =    "Wed Mar  6 11:04:21 1985" ,
)

@inproceedings    ( STONEBRAKER86,
key    =    "Stonebraker" ,
author    =    "Stonebraker, M." ,
title    =    "Inclusion of New Types in Relational Data Base
Systems" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering," ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
volume    =    "IEEE Computer Society Order Number 655" ,
month    =    "feb" ,
year    =    "1986" ,
pages    =    "262--269" ,
abstract=    "This paper explores a mechanism to support
user-defined data types for columns in a relational data base system.
Previous work suggested how to support new operators and new data
types. The contribution of this work is to suggest ways to allow query
optimization on commands which include new data types and operators
and ways to allow access methods to be used for new data types." ,
bibdate    =    "Wed Jul 16 15:17:41 1986" ,
owner    =    "manning" ,
)

@inproceedings    ( STONEBRAKER86B,
key    =    "Stonebraker" ,
author    =    "Stonebraker, M." ,
title    =    "Object Management in POSTGRES Using Procedures" ,
booktitle=    "Proceedings of the 1986 International Workshop on
Object-Oriented Database Systems" ,
organization=    "ACM Special Interest Group on Management of Data,
IEEE CS Technical Committee on Database Engineering" ,
publisher=    "IEEE" ,
address    =    "Pacific Grove, CA" ,
month    =    "sep" ,
year    =    "1986" ,
pages    =    "66--72" ,
abstract=    "This paper presents the object management
facilities being designed into a next-generation data manager,
POSTGRES. This system is unique in that it does not invent a new data
model for support of objects but chosses instead to extend the
relational model with a powerful abstract data typing capability and
procedures as full-fledged data base objects. The reasons to remain
with the relational model are indicated in this paper along with the
POSTGRES relational extensions." ,
bibdate    =    "Fri Nov 14 12:30:02 1986" ,
owner    =    "manning" ,
)

@techreport    ( STONEBRAKER86C,
key    =    "Stonebraker et al." ,
author    =    "Stonebraker, M. and Hanson, E. and Hong" ,
title    =    "The Design of the POSTGRES Rules System" ,
number    =    "M86/80" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1986" ,
bibdate    =    "Mon Nov  2 10:54:06 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( STONEBRAKER86D,
key    =    "Stonebraker et al" ,
author    =    "Stonebraker, M. and Sellis, T. and Hanson, E." ,
title    =    "An analysis of indexing implementations in data
base systems" ,
booktitle=    "Proc. Annu. Expert Database Syst." ,
month    =    "apr" ,
year    =    "1986" ,
bibdate    =    "Mon Oct 23 13:47:58 1989" ,
owner    =    "robyn" ,
)

@article    ( STONEBRAKER87A,
key    =    "Stonebraker et al." ,
author    =    "Stonebraker, M. and Anton, J. and Hanson, E." ,
title    =    "Extending a Database System with Procedures" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "12" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1987" ,
pages    =    "350--376" ,
keywords=    "design, languages, extended DBMS, object-oriented
DBMS, procedures, relational database" ,
abstract=    "This paper suggest that more powerful database
systems (DBMS) can be built by supporting database procedures as
full-fledged database objects. In particular, allowing fields of a
database to be a collection of queries in the query language of the
system is shown to allow the natural expression of complex data
relationships. Moreover, many of the features present in
object-oriented systems and semantic data models can be supported by
this facility. In order to implement this construct, extensions to a
typical relational query language must be made, and considerable work
on the execution engine for the underlying DBMS must be accomplished.
This paper reports on the extensions for one particular query language
and data manager and then gives performance figures for a prototype
implementation. Even though the performance of the prototype is
competitive with that of a conventional system, suggestions for
improvement are presented" ,
bibdate    =    "Wed Oct 14 13:50:04 1987" ,
owner    =    "mckenzie" ,
)

@techreport    ( STONEBRAKER87B,
key    =    "Stonebraker" ,
author    =    "Stonebraker, M." ,
title    =    "The Design of the POSTGRES Storage System" ,
number    =    "M87/6" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1987" ,
bibdate    =    "Mon Nov  2 10:55:15 1987" ,
owner    =    "manning" ,
)

@techreport    ( STONEBRAKER87C,
key    =    "Stonebraker \& Hanson" ,
author    =    "Stonebraker, M. and Hanson, E." ,
title    =    "A Rule Manager for Relational Database Systems" ,
number    =    "M87/38" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1987" ,
bibdate    =    "Mon Nov  2 10:58:37 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( STONEBRAKER87D,
key    =    "Stonebraker" ,
author    =    "Stonebraker, M." ,
title    =    "The Design of the POSTGRES Storage System" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
editor    =    "Hammersley, P." ,
month    =    "sep" ,
year    =    "1987" ,
pages    =    "289--300" ,
abstract=    "This paper presents the design of the storage
system for the POSTGRES data base system under construction at
Berkeley. It is novel in several ways. First, the storage manager
supports transaction management but does so without using a
conventional write ahead log (WAL). In fact, there is no code to run
at recovery time, and consequently recovery from crashes is
essentially instantaneous. Second, the storage manager allows a user
to optionally keep the entire past history of data base objects by
closely integrating an archival storage system to which historical
records are spooled. Lastly, the storage manager is consciously
constructed as a collection of asynchronous processes. Hence, a large
monolithic body of code is avoided and opportunities for parallelism
can be exploited. The paper concludes with an analysis of the storage
system which suggests that it is performance competitive with WAL
systems in many situations." ,
bibdate    =    "Thu Apr 28 15:12:05 1988" ,
owner    =    "" ,
)

@inproceedings    ( STONEBRAKER87E,
key    =    "Stonebraker et al." ,
author    =    "Stonebraker, M. and Hanson, E. and Hong, C.-H." ,
title    =    "The Design of the POSTGRES Rules System" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1987" ,
pages    =    "365--374" ,
abstract=    "This paper explains the rules subsystem that is
being implemented in the POSTGRES DBMS. It is novel in several ways.
First, it gives to users the capability of defining rules as well as
data to a DBMS. Moreover, depending on the scope of each rule defined,
optimization is handled differently. This leads to good performance
both in the case that there are many rules each of small scope and a
few rules each of large scope. In addition, rules provide either a
forward chaining control flow or a backward chaining one, and the
system will choose the control mechanism that optimizes performance in
the cases that it is possible. Furthermore, priority rules can be
defined, thereby allowing a user to specify rules systems that have
conflicts. This use of exceptions seems necessary in many
applications. Lastly, our rule system can support an implementation of
views, protection and integrity control, simply by applying the rules
system in a particular way. Consequently, no special purpose code need
be included to handle these tasks." ,
bibdate    =    "Thu Apr 28 16:00:18 1988" ,
owner    =    "" ,
)

@article    ( STONEBRAKER88,
key    =    "Stonebraker \& Hanson" ,
author    =    "Stonebraker, Michael and Hanson, Eric N. and
Potamianos, Spyros" ,
title    =    "The Postgres Rule Manager" ,
journal    =    "IEEE Transactions on Software Engineering" ,
year    =    "1988" ,
volume    =    "14" ,
number    =    "7" ,
pages    =    "897--907" ,
month    =    "July" ,
)

@article    ( STONEBRAKER89,
key    =    "Stonebraker" ,
author    =    "Stonebraker, M." ,
title    =    "The Case For Partial Indexes" ,
journal    =    "sigmod" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1989" ,
pages    =    "4--11" ,
volume    =    "18" ,
abstract=    "Current data managers support secondary and/or
primary indexes on columns of relations. In this paper we suggest the
advantages that result from indexes which contain only some of the
possible values in a column of a relation." ,
bibdate    =    "Fri Dec 29 15:35:30 1989" ,
owner    =    "robyn" ,
)

@techreport    ( STONEBRAKER89A,
key    =    "Stonebraker et al" ,
author    =    "Stonebraker, Michael and Jhingran, Anant and Goh,
Jeffrey and Potamianos, Spyros" ,
title    =    "On Rules, Procedures, Caching and Views in Data
Base Systems" ,
institution=    "University of California at Berkeley, Department
of Computer Science" ,
year    =    "1989" ,
type    =    "Technical report," ,
number    =    "UCB/ERL M89/119" ,
address    =    "Berkeley, CA 94720" ,
month    =    "October" ,
)

@article    ( STONEBRAKER89B,
key    =    "Stonebraker" ,
author    =    "Stonebraker, Michael" ,
title    =    "Future Trends in Database Systems" ,
journal    =    "IEEE Transactions on Knowledge and Data
Engineering" ,
year    =    "1989" ,
volume    =    "1" ,
number    =    "1" ,
pages    =    "33--44" ,
month    =    "March" ,
)

@techreport    ( STONEBRAKER90,
key    =    "Stonebraker et al." ,
author    =    "Stonebraker, M. and Rowe, L. and Lindsay, B. and
Gray, J. and Carey, M. and Brodie, M. and Bernstein, P. and Beech, D." ,
title    =    "Third-Generation Data Base System Manifesto" ,
institution=    "University of California, Berkeley" ,
address    =    "Berkeley, California" ,
year    =    "1990" ,
month    =    "apr" ,
pages    =    "28" ,
abstract=    "We call the older hierarchical and network systems
first generation database systems and refer to the current collection
of relational systems as the second generation. In this paper we
consider the characteristics that must be satisfied by the next
generation of data managers, which we call third generation database
systems. Our requirements are collected into three basic tenets along
with 13 more detailed propositions." ,
bibdate    =    "Mon Jun 25 13:46:00 1990" ,
owner    =    "robyn" ,
)

@article    ( STONEBRAKER90B,
key    =    "Stonebraker et al." ,
author    =    "Stonebraker, M. and L. Rowe and M. Hirohama" ,
title    =    "The Implementation of POSTGRES" ,
journal    =    "tkde" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "Mar" ,
year    =    "1990" ,
pages    =    "125--142" ,
keywords=    "Extensible databases, next-generation DBMS's,
nooverwrite storage managers, object-oriented databases, rule systems." ,
abstract=    (Currently, POSTGRES is about 90 000 lines of code
in C and is being used by assorted "bold and brave" early users. The
system has been constructed by a tean of five part-time students led
by a full-time chief programmer over the last three years. During this
period, we have made a large number of design and implementation
choices. Moreover, in some areas we would do things qutie differently
if we were to start from scratch again. The purpose of this paper is
to reflect on the design and implementation decisions wwe made and to
offer advice to implementors who might follow some fo our paths. In
the paper, we restrict our attention to the DBMS"backend" functions.
In another paper, some of us trat Picasso, the application develppment
environment that is being built on top POSTRGRES.) ,
bibdate    =    "Sun Aug  4 21:47:14 1991" ,
owner    =    "suchen" ,
)

@article    ( STONEBRAKER90C,
key    =    "Stonebraker" ,
author    =    "Stonebraker, M." ,
title    =    "Architecture Of Future Data Base Systems" ,
journal    =    "IEEE Data Engineering" ,
publisher=    "ieee" ,
volume    =    "13" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1990" ,
pages    =    "18--23" ,
abstract=    "This paper explores the architecture of future
DBMSs by posing a collection of questions that affect the construction
of DBMSs and associated application development systems. These
questions are grouped into ones which impact basic DBMS function, ones
that impact operating systems, ones that deal with distributed data
bases, and ones that consider user interface issues." ,
bibdate    =    "Thu Jul  8 22:27:00 1993" ,
owner    =    "daisyc" ,
)

@article    ( STONEBRAKER91,
key    =    "Stonebraker \& Kemnitz" ,
author    =    "Stonebraker, Michael and Greg Kemnitz" ,
title    =    "The Postgres Next Generation Database Management
System" ,
journal    =    "cacm" ,
volume    =    "34" ,
number    =    "10" ,
month    =    "Oct" ,
year    =    "1991" ,
pages    =    "78 -- 93" ,
bibdate    =    "Sun Nov  3 23:33:40 1991" ,
owner    =    "suchen" ,
)

@article    ( STONEBRAKER92,
key    =    "Stonebraker" ,
author    =    "Stonebraker, M." ,
title    =    "The Integration of Rule Systems and Database
Systems" ,
journal    =    "tdke" ,
publisher=    "ieee" ,
volume    =    "4" ,
number    =    "5" ,
month    =    "oct" ,
year    =    "1992" ,
pages    =    "415--423" ,
abstract=    "This paper explores the integration of rule
systems into database management systems. One major theme is a survey
of the research activities in this area over the past decade. The
focus is on prototype systems that have been completely specified and
the implementation issues encountered. The second thrust is to present
a research agenda which should be addressed by the research community
over the next few years." ,
bibdate    =    "Tue Jan 19 13:19:27 1993" ,
owner    =    "bassili" ,
)

@article    ( STRAUBE95,
key    =    "Straube \& Ozsu" ,
author    =    "Straube, D. D. and Ozsu, M. T." ,
title    =    "Query Optimization and Execution Plan Generation
in Object-Oriented Database Systems" ,
journal    =    "tkde" ,
publisher=    "ieee" ,
volume    =    "7" ,
number    =    "2" ,
month    =    "apr" ,
year    =    "1995" ,
pages    =    "210--227" ,
bibdate    =    "Wed Jan 10 16:28:10 1996" ,
abstract=    "The generation of execution plans for
object-oriented database queries is a new and challenging area of
study. Unlike the relational algebra, a common set of object algebra
operators has not been defined. Similarly, a standardized object
manager interface analogous to storage manager interfaces of
relational subsystems does not exist. We define the interface to an
object manager whose operations are the executable elements of query
execution plans. Parameters to the object manager interface are
streams of tuples of object identifiers. The object manager can apply
methods and simple predicates to the objects identified in a tuple.
Two algorithms for generating such execution plans for queries
expressed in an object algebra are presented. The first algorithm runs
quickly but may produce inefficient plans. The second algorithm
enumerates all possible execution plans and presents them in an
efficient, compact representation." ,
owner    =    "jeff" ,
)

@incollection    ( SU89,
key    =    "Su et al." ,
author    =    "Su, S. and Krishnamurthy, V. and Lam, H." ,
title    =    "An Object Oriented Semantics Association Model
({\it OSAM*)*\/}" ,
booktitle=    "Artificial Intelligence: Manufacturing Theory and
Practice" ,
pages    =    "463--493" ,
publisher=    "Industrial Engineering and Management Press" ,
address    =    "Nocross, Georgia" ,
year    =    1989 ,
annote    =    " Definition of OSAM*" ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( SU90,
key    =    "Su \& Lam" ,
author    =    "Su, S. and Lam, H." ,
title    =    " Object Oriented Technology for Improving
Productivity and Competitiveness in Manufacturing" ,
booktitle=    "Proceedings of the NSF Design and Manufacturing
Systems Conference" ,
pages    =    "161--167" ,
publisher=    "Society of manufacturing Engineers Press" ,
address    =    "Detroit" ,
month    =    "jan" ,
year    =    1990 ,
annote    =    "Overview of OSAM and OSAM*, and general
description of the work at UF." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( SU93C,
key    =    "Su et al." ,
author    =    "Su, S.~Y.~W. and Guo, M. and Lam, H." ,
title    =    "Association Algebra: A Mathematical Foundation for
Object-Oriented Databases" ,
journal    =    "tkde" ,
publisher=    "ieee" ,
volume    =    "5" ,
number    =    "5" ,
month    =    "oct" ,
year    =    "1993" ,
pages    =    "775--798" ,
keywords=    "Access path; client-server architectures; gateway
access; incremental access methods; interoperability of heterogeneous
DBMS's; job index; view index" ,
abstract=    "The application of the object-oriented (O-O)
paradigm in the database management field has gained much attention in
recent years. Several experimental and commercial O-O database
management systems have become available. However, the existing O-O
DBMS's still lack a solid mathematical foundation for the manipulation
of O-O databases, the optimization of queries, and the design and
selection of storage structures for supporting O-O database
manipulations. This paper presents an association algebra (A-algebra)
to serve as a mathematical foundation for processing O-O databases,
which is analogous to the relational algebra used for processing
relational databases. In this algebra, objects and their associations
in an O-O database are uniformly represented by association patterns
which are manipulated by a number of operators to produce other
association patterns. Different from the relational algebra, in which
set operations operate on relations with union-compatible structures,
the A-algebra operators can operate on association patterns of
homogeneous and heterogeneous structures. Different from the
traditional record-based relational processing, the A-algebra allows
very complex patterns of object association to be directly
manipulated. In this paper, the pattern-based query formulation and
the A-algebra operators are described. Some mathematical properties of
the algebraic operators are presented together with their application
in query decomposition and optimization. The completeness of the
A-algebra is also defined and proven. The A-algebra has been used as
the basis for the design and implementation of an object-oriented
query language, OQL, which is the query language used in a prototype
Knowledge Base Management System OSAM*.KBMs." ,
bibdate    =    "Sun Nov 28 15:03:17 1993" ,
owner    =    "daisyc" ,
)

@article    ( SUBIETA87A,
key    =    "Subieta" ,
author    =    "Subieta, K." ,
title    =    "Denotational Semantics of Query Languages" ,
journal    =    "Information Systems" ,
volume    =    "12" ,
number    =    "1" ,
year    =    "1987" ,
pages    =    "69--82" ,
keywords=    "query languages, denotational semantics, network
model" ,
abstract=    "A denotational semantics approach to formal
description of query languages is proposed. It allows us to equip most
database models (relational, hierarchical, network, semantic and so
on) with powerful query languages possessing clear, formal and precise
semantics. It avoids semantic anomalies induced by other apporaches
and it is immediately directed towards implementation. The paper
discusses semantic aspects of key concepts related to query languages:
database instances, states and semantic domains related to database
queries, operators occurring in queries, transitive closures, and
implementation issues. The presentation is illustrated by examples in
NETUL, a query/manipulation language for network databases, based on
the proposed approach." ,
bibdate    =    "Wed Aug 19 20:32:11 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( SUBIETA87B,
key    =    "Subieta \& Rzeczkowski" ,
author    =    "Subieta, K and Rzeczkowski, W." ,
title    =    "Query Optimization by Stored Queries" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
editor    =    "Hammersley, P." ,
month    =    "sep" ,
year    =    "1987" ,
pages    =    "369--380" ,
abstract=    "A stored query is a pair (query, response), where
`response' is the query meaning for the current database state. When a
collection of stored queries is available responses to some queries
may be obtained easily. Stored queries give a possibility of
improvement of database system response time regardless of the
complexity of user request and the data model assumed. The method is a
generalization of methods based on indices. Its main properties and
problems are outlined, particularly the problem of updating stored
queries. The presented solutions are based on detecting whether the
response associated with a query is influenced by a database update,
and on correcting the response after an update. the methods concern
NETUL, a user-friendly query language, with the power of programming
languages, for network/semantic data models." ,
bibdate    =    "Thu Apr 28 17:32:04 1988" ,
owner    =    "" ,
)

@inproceedings    ( SUBIETA87C,
key    =    "Subieta \& Missala" ,
author    =    "Subieta, K. and Missala, M." ,
title    =    "Data Manipulation in NETUL" ,
booktitle=    "Proc. 6th Int. Conf. Entity-Relationship Approach" ,
address    =    "New York, NY" ,
month    =    "nov" ,
year    =    "1987" ,
bibdate    =    "Tue Nov  7 10:41:34 1989" ,
owner    =    "robyn" ,
)

@article    ( SULL92,
key    =    "Sull \& Kashyap" ,
author    =    "Sull, K. and Kashyap, L." ,
title    =    "A Self Organizing Knowledge Representation Scheme
for Extensible Heterogeneous Information Environment" ,
journal    =    "tkde" ,
volume    =    4 ,
pages    =    "185--191" ,
month    =    "apr" ,
year    =    1992 ,
annote    =    "Talks about the use of directed graphs to show the
equivalence of OO schemas in different models. Builds somewhat on the
work of Kim's taxonomy, and Elmasri's concept of the 4 types of class
to class relations. There is a profound weakness in their use of one
way only maps from relational to OO schemas, but two way among OO
models." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( SUN89,
key    =    "Sun et al." ,
author    =    "Sun, X. and Kamel, N. and Ni, L." ,
title    =    "Processing Implication on Queries" ,
journal    =    "tse" ,
volume    =    "15" ,
number    =    "10" ,
month    =    "oct" ,
year    =    "1989" ,
pages    =    "1168--1175" ,
keywords=    "database; derivability problem; directed graph;
implication problem; mathematical logic; NP-hard; project-select-join
queries; satisfiability" ,
abstract=    "The ability to quickly determine how to derive a
given query from a set of presorted fragments is highly demanded in
many database applications, especially in distributed database
systems, where the communication cost is a major concern. The main
difficulty in solving this problem lies in the implication
problem--given two predicates sigmaQ and sigmaT, can sigmaQ imply
sigmaT(sigmaQ-->)? The implication problem has been solved by
converting it into a satisfiability problem. No detailed study of the
implication problem on its own has been presented. In this paper, we
study the general implication problem in which all six comparison
operators: =, not equal, <, >, less than or equal to, greater than or
equal to, as well as conjunctions and disjunctions are allowed. We
proved that the general implication problem is NP-hard. In the case
when 'not equal' operators are not allowed in sigmaQ and disjunctions
are not allowed in sigmaT, a polynomial time algorithm is proposed to
solve this restricted implication problem. The influence of the 'not
equal' operator and disjunctions are studied. Our theoretical results
show that for some special cases the polynomial complexity algorithm
can solve the implication problem which allows the 'not equal'
operator or disjunctions in the predicates. Necessary conditions for
detecting when the 'not equal' operator and disjunctions are allowed
are also given. These results are very useful in creating heuristic
methods." ,
bibdate    =    "Fri Oct  6 10:53:15 1989" ,
owner    =    "robyn" ,
)

@techreport    ( SUNDARESH90,
key    =    "Sundaresh \& Hudak" ,
author    =    "Sundaresh, R. S. and Hudak, Paul" ,
title    =    "A Theory of Incremental Computation and its
Application" ,
institution=    "Yale University, Department of Computer Science" ,
year    =    "1990" ,
type    =    "Technical report," ,
number    =    "YALEU/DCS/RR-770" ,
address    =    "Box 2158 Yale Station, New Haven, CT 06520" ,
month    =    "March" ,
note    =    "" ,
)

@inproceedings    ( SUTHERLAND89,
key    =    "Sutherland" ,
author    =    "Sutherland, J. V." ,
title    =    "Is a Persistent Object Store a Database?" ,
booktitle=    "OOPSLA'89 Conference Proceedings -- Special issue
of Sigplan Notices" ,
publisher=    "Acm Press" ,
address    =    "New Orleans" ,
volume    =    "24" ,
month    =    "oct" ,
year    =    "1989" ,
pages    =    "499--503" ,
bibdate    =    "Thu Apr 22 16:00:17 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( TAMMINEN82,
key    =    "Tamminen" ,
author    =    "Tamminen, M." ,
title    =    "Efficient Spatial Access To A Data Base" ,
booktitle=    "sigmod" ,
volume    =    "12" ,
year    =    "1982" ,
pages    =    "200--206" ,
bibdate    =    "Thu Jun  6 22:25:30 1985" ,
)

@techreport    ( TANAKA87,
key    =    "Tanaka et al." ,
author    =    "Tanaka, Katsumi and Yoshikawa, Masatoshi and
Ishihara, Kozo" ,
title    =    "Schema Design, Views and Incomplete Information in
Object-oriented Databases" ,
institution=    "Kobe University and Kyoto Sangyo University" ,
year    =    "1987" ,
type    =    "Research Report KSU/ICS" ,
number    =    "87-01" ,
address    =    "" ,
month    =    "February" ,
note    =    "" ,
)

@inproceedings    ( TANAKA88,
key    =    "Tanaka \& Yoshikawa" ,
author    =    "Tanaka, K. and Yoshikawa, M." ,
title    =    " Towards Abstracting Complex Database Objects:
Generalization Reduction, and Unification of Set-type Objects" ,
booktitle=    "ICDT 88 Second International Conference on
Database Theory" ,
pages    =    "253--266" ,
publisher=    "Springer-Verlag" ,
address    =    "New York" ,
month    =    "sep" ,
year    =    1988 ,
annote    =    "A general theory regarding the use of super/sub
types in a class hierarchy along with the Smith and Smith Aggregation
and generalization model is presented. The sorts of operations that
are possible/ beneficial are discussed, and their semantics defined." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( TANAKA91,
key    =    "Tanaka et al." ,
author    =    "Tanaka, A. and Navathe, S. and Chakravarthy, S.
and Karlapalem, K." ,
title    =    "ER-R: An Enhanced ER Model with Situation-Action
Rules to Capture Application Semantics" ,
booktitle=    "Proceedings 1991 International Conference on the
Entity Relationship Approach" ,
publisher=    "IEEE Press" ,
address    =    "New York" ,
year    =    1991 ,
annote    =    "An extension to ER designed to allow for
'behavior' in the ER model. The idea is to add the concept of a
trigger which can be associated with relationships, attributes or
entities." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@manual        ( TANDEMDDL83,
key    =    "Tandem" ,
title    =    "DDL Programming Manual" ,
year    =    "1983" ,
organization=    "Tandem Computers, Inc" ,
address    =    "Cupertino, CA" ,
month    =    "apr" ,
bibdate    =    "Wed Oct  5 19:06:37 1983" ,
)

@techreport    ( TAYLOR85A,
key    =    "Taylor et al." ,
author    =    "Taylor, R.N. and Clarke, L. and Osterweil, L.J.
and Wileden, J.C. and Young, M." ,
title    =    "Arcadia: A Software Development Environment
Research Project" ,
number    =    "85-31" ,
institution=    "Department of Information and Computer Science" ,
address    =    "University of California, Irvine, CA" ,
year    =    "1985" ,
month    =    "nov" ,
pages    =    "1--28" ,
abstract=    "The research objectives of the Arcadia project are
two-fold: discovery and development of environment architecture
principles and creation of novel software development tools,
particularly powerful analysis tools, which will function within an
environment built upon these architectural principles. Work in the
architecture area is concerned with providing the framework to support
integration while also supporting the often conflicting goal of
extensibility. Thus, this area of research is directed toward
achieving external integration by providing a consistent, uniform
userr interface while still admitting customization and addition of
new tools and interface functions. In an effort to also attain
internal integration, research is aimed at developing mechanisms for
structuring and managing the tools and data objects that populate a
software development environment, while facilitating the insertion of
new kinds of tools and new classes of objects. The unifying theme of
work in the tools area is support for effective analysis at every
stage of a software development project. Research is directed toward
tools suitable for analyzing pre-implementation descriptions of
software, software itself, and towards the production of testing and
debugging tools. In many cases, these tools are specifically tailored
for applicability to concurrent, distributed, or real-time software
systems. The initial focus of Arcadia research is on creating a
prototype environment, embodying the architectural principles, which
supports Ada software development. This prototype environment is
itself being developed in Ada. Arcadia is being developed by a
consortium of researchers from the University of California at Irvine,
the University of Colorado at Boulder, the University of Massachusetts
at Amherst, TRW, Incremental Systems Corporation, and The Aerospacee
Corporation. This paper delineates the research objectives and
describes the approaches being taken, the organization of the research
endeavor, and current status of the work." ,
bibdate    =    "Mon Oct  5 14:52:35 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( TEEUW93,
key    =    "Teeuw et al." ,
author    =    "Teeuw, W. B. and Rich, C. and Scholl, M. and
Blanken, H." ,
title    =    "An Evaluation of Physical Disk I/Os for Complex
Object Processing" ,
booktitle=    "Ninth International Conference on Data Engineering" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "Vienna, Austria" ,
month    =    "apr" ,
year    =    "1993" ,
pages    =    "363--371" ,
abstract=    "In order to obtain the performance required for
non-standard database environments, we need suitable storage
structures for complex objects. In this paper we use an hierarchical
complex object model with object references. We describe several
storage models for these complex objects, as well as a benchmark to
evaluate their performance. We develop a cost model for analytical
performance evaluation, and validate the analytical results by means
of measurements on the DASDBS complex object storage system. The
results show which storage structures for complex objects are the most
efficient under which circumstances." ,
bibdate    =    "Mon May 17 18:33:44 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( TEOREY76,
key    =    "Teorey \& Das" ,
author    =    "Teorey, T. and Das, K." ,
title    =    "Application of an analytical model to evaluate
storage structures" ,
booktitle=    "sigmod" ,
volume    =    "6" ,
month    =    "jun" ,
year    =    "1976" ,
pages    =    "9--19" ,
bibdate    =    "Tue Apr 23 22:46:50 1985" ,
)

@article    ( TEOREY80,
key    =    "Teorey \& Fry" ,
author    =    "Teorey, T.J. and Fry, J.P." ,
title    =    "The Logical Record Access Approach to Database
Design" ,
journal    =    "Compsurv" ,
volume    =    "12" ,
number    =    "2" ,
month    =    "june" ,
year    =    "1980" ,
pages    =    "179--211" ,
keywords=    "database management systems; database design;
performance evaluation; requirements analysis; analytical models;
database administrator" ,
abstract=    "Database management systems have evolved to the
point of general acceptance and wide application; however a major
problem still facing the user is the effective utilization of these
systems. Important to achieving effective database usability and
responsiveness is the design of the database. This paper presents a
practical stepwise database design methodology that derives a
DBMS-processable database structure from a set of user information and
processing requirements. Although the methodology emphasizes the
logical design step, the activities of requirements analysis and
physical design are also addressed. The methodology is illustrated
with a detailed example. Performance trade-offs among multiple users
of a single integrated database are considered, and the relationship
between short-term design and design for flexibility to changing
requirements is discussed. Many steps in the database design process
can be assisted with proper use of computer modeling techniques and
other tools, such as requirements analysis software. The example
design problem and its solution steps serve to point out when and
where current technology can be effectively used." ,
bibdate    =    "Fri May  3 11:09:05 1985" ,
)

@book        ( TEOREY82,
key    =    "Teorey \& Fry" ,
author    =    "Teorey, T. and Fry, J." ,
title    =    "Design of Database Structures" ,
publisher=    "Prentice-Hall, Inc." ,
year    =    "1982" ,
bibdate    =    "Thu May  2 02:23:35 1985" ,
)

@article    ( TEOREY86,
key    =    "Teorey et al." ,
author    =    "Teorey, T.J. and Yang, D. and Fry, J.P." ,
title    =    "A Logical Design Methodology for Relational
Databases Using the Extended Entity-Relationship Model" ,
journal    =    "compsurv" ,
publisher=    "acm" ,
volume    =    "18" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1986" ,
pages    =    "197--222" ,
keywords=    "Databases; design; entity-relationship model;
integrity; logical design; relational databases" ,
abstract=    "A database design methodology is defined for the
design of large relational databases. First, the data requirements are
conceptualized using an extended entity-relationship model, with thhe
extensions being additional semantics such as ternary relationships,
optional relationships, and the generalization abstraction. The
extended entity-relationship model is then decomposed according to a
set of basic entity-relationship constructs, and these are transformed
into candidate relations. A set of basic transformations has been
developed for the three types of relations: entity relations, extended
entity relations, and relationship relations. Candidate relations are
further analyzed and modified to attain the highest degree of
normalization desired. The methodology produces database designs that
are not only accurate representations of reality, but flexible enough
to accommodate future processing requirements. It also reduces the
number of data dependencies that must be analyzed, using the extended
ER model conceptualization, and maintains data integrity through
normalization. This approach can be implemented manually or in a
simple software package as long as a ``good'' solution is acceptable
and absolute optimality is not required." ,
bibdate    =    "Tue Mar  3 13:47:56 1987" ,
owner    =    "manning" ,
)

@inproceedings    ( TERRY92,
key    =    "Terry et al." ,
author    =    "Terry, D. and Goldberg, D. and Nichols, D. and
Oki, B." ,
title    =    "Continuous Queries over Append-Only Databases" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "San Diego, California" ,
editor    =    "Stonebraker, M." ,
volume    =    "21" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "321--330" ,
abstract=    "In a database to which data is continually added,
users may wish to issue a permanent query and be notified whenever
data matches the query. If such continuous queries examine only single
records, this can be implemented by examining each record as it
arrives. This is very efficient because only the incoming record needs
to be scanned. This simple approach does not work for queries
involving joins or time. The Tapestry system allows users to issue
such queries over a database of mail and bulletin board messages. The
user issues a static query, such as 'show me all messages that have
been replied to by Jones,' as though the database were fixed and
unchanging. Tapestry converts the query into an incremental query that
efficiently finds new matches to the original query as new messages
are added to the database. This paper describes the techniques used in
Tapestry, which do not depend on triggers and thus be implemented on
any commercial database that supports SQL. Although Tapestry is
designed for filtering mail and news messages, its techniques are
applicable to any depend-only database." ,
bibdate    =    "Mon Jan 25 13:45:31 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( THATTE87,
key    =    "Thatte" ,
author    =    "Thatte, S.M." ,
title    =    "Report on the Object-Oriented Database Workshop:
Implementation Aspects" ,
booktitle=    "OOPSLA87-Addendum to the Proceedings" ,
organization=    "acm" ,
publisher=    "acm" ,
address    =    "New York, NY" ,
editor    =    "Leigh Power and Zvi Weiss" ,
month    =    "oct" ,
year    =    "1987" ,
pages    =    "73--88" ,
volume    =    "23" ,
bibdate    =    "Tue Mar 28 13:46:59 1989" ,
owner    =    "payne" ,
)

@article    ( THATTE91,
key    =    "Thatte" ,
author    =    "Thatte, S. M." ,
title    =    "A Modular and Open Object-Oriented Database System" ,
journal    =    "sigmod" ,
volume    =    "20" ,
number    =    "1" ,
month    =    "Mar" ,
year    =    "1991" ,
pages    =    "47--52" ,
bibdate    =    "Wed Mar 20 00:38:06 1991" ,
owner    =    "soo" ,
)

@inbook        ( THATTE91A,
key    =    "Thatte" ,
author    =    "Thatte, S.M." ,
title    =    "Persistent Memory: A Storage System for
Object-Oriented Databases" ,
booktitle=    "On Object-Oriented Database Systems" ,
publisher=    "Springer-Verlag" ,
address    =    "Berlin Heidelberg" ,
year    =    "1991" ,
chapter    =    "16" ,
pages    =    "255--273" ,
abstract=    "Object-oriented databases are needed to support
database objects with a wide variety of types and structures.
Object-oriented techniques, such as abstraction and inheritance
mechanisms, which are widely used in symbolic processing, can be very
useful in object-oriented databases. The advent of automatically
managed, garbaged-collected virtual memory was crucial to the
development of today's symbolic processing. No analogous capability
has yet been developed in the domain of persistent objects managed by
a file or database system. A persistent memory provides a storage
system for long-term, reliable retention of objects with rich types
and structures in virtual memory itself. Because no separate file
system is assumed for long-term, reliable storage of objects, the
system requires a crash recovery scheme at the level of virtual
memory, which is a major contribution of the paper. The persistent
memory system is based on a uniform memory abstraction, which
eliminates the distinction between transient objects (data structures)
and persistent objects (files and databases), and therefore, allows
the same set of powerful and flexible operations to be applied with
equal efficiency on both transient and persistent object from a
programming language such as Lisp or Prolog. A persistent object
manager implemented on top of the persistent memory manages named
persistent objects with rich structure. It is expected that the
persistent memory system will lead to significant simplifications in
implementing applications such as object-oriented databases. " ,
bibdate    =    "Fri Aug 28 16:56:33 1992" ,
owner    =    "leoso" ,
)

@article    ( THATTE91B,
key    =    "Thatte" ,
author    =    "Thatte, S. M." ,
title    =    "A Modular and Open Object-Oriented Database System" ,
journal    =    "sigmod" ,
publisher=    "Acm Press" ,
volume    =    "20" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1991" ,
pages    =    "47--52" ,
bibdate    =    "Thu Apr 22 12:01:54 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( THIEMAN86,
key    =    "Thieman \& King" ,
author    =    "Thieman, J. and King, J." ,
title    =    "{\it NASA/NSSDC\/} Central Online Data Directory
{\it (CODD)\/}" ,
booktitle=    "Computer Handling and Dissemination of Data CODATA
86" ,
pages    =    "25--29" ,
publisher=    "North-Holland" ,
address    =    "New York " ,
month    =    "jul" ,
year    =    1986 ,
annote    =    "The Large distributed data environment at NASA is
discussed, and the current on-line access to it. The key point is that
in this case the data is best accessed in raw chunks, and the most
efficient way to deal with it is to define one standard form of
indexing, and then only put the indexes on-line for querying, make the
data request a separate action." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( THOM86A,
key    =    "Thom et al." ,
author    =    "Thom, J.A. and Ramamohanarao, K. and Naish, L." ,
title    =    "A Superjoin Algorithm for Deductive Databases" ,
booktitle=    "vldb" ,
address    =    "Kyoto, Japan" ,
editor    =    "Kambayashi, Y." ,
month    =    "aug" ,
year    =    "1986" ,
pages    =    "189--196" ,
abstract=    "This paper describes a join algorithm suitable for
deductive and relational databases which are accessed by computers
with large main memories. Using multi-key hashing and appropriate
buffering, joins can be performed on very large relations more
efficiently than with existing methods. Furthermore, this algorithm
fits naturally into top-down Prolog computations and can be made very
flexible by incorporating additional Prolog features." ,
keywords=    "partial match retrieval, Prolog, hashing, joins,
optimization, database, relational, deductive" ,
bibdate    =    "Fri Nov 20 11:03:46 1987" ,
owner    =    "mckenzie" ,
)

@article    ( THOMAS79A,
key    =    "Thomas" ,
author    =    "Thomas, R.H." ,
title    =    "A Majority Consensus Approach to Concurrency
Control for Multiple Copy Databases" ,
journal    =    "tods" ,
publisher=    "ACM" ,
volume    =    "4" ,
number    =    "2" ,
year    =    "1979" ,
pages    =    "180--209" ,
bibdate    =    "Sun Oct 30 14:24:55 1988" ,
owner    =    "" ,
)

@techreport    ( THOMAS79B,
key    =    "Thomas \& Shneiderman" ,
author    =    "Thomas, G. and Shneiderman, B." ,
title    =    " {\it Automatic Database System Conversion II:\/}
A Transformation Language" ,
institution=    "Computer Science Department, University of
Maryland" ,
address    =    "College Park MD" ,
month    =    "nov" ,
year    =    1979 ,
number    =    "TR-821" ,
annote    =    "Proposal for a system for data translation.
Proposes Data-Loss versus Non-Data-Loss paradigm. Full set of
primitives is defined. The system pre-dates OODBMS and is record
oriented." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( THOMASIAN95,
key    =    "Thomasian" ,
author    =    "Thomasian, A." ,
title    =    "Checkpointing for Optimistic Concurrency Control
Methods" ,
journal    =    "tkde" ,
publisher=    "ieee" ,
volume    =    "7" ,
number    =    "2" ,
month    =    "apr" ,
year    =    "1995" ,
pages    =    "332--339" ,
bibdate    =    "Wed Jan 10 16:32:59 1996" ,
abstract=    "Restart-oriented concurrency control ICCI methods,
such as optimistic CC, outperform blocking-oriented methods, such as
standard two-phase locking in a high data contention environment, but
this is at the cost of wasted processing due to restarts. Volatile
savepoints are considered in this study as a method to reduce this
wasted processing and to improve response time. There is the usual
tradeoff between the checkpointing overhead and the wasted processing
when a transaction is restarted. Our study shows that in a system
where objects are accessed and updated uniformly during the lifetime
of transactions, significant improvement in performance at high data
conflict levels are attainable only when checkpointing cost is low.
This implies few optimally placed checkpoints per transaction. It is
observed that checkpointing may result in a significant improvement in
performance when accesses to database hot-spots are deferred to the
final steps of transaction execution. The parametric studies reported
in this paper are facilitated by closed form analytic solutions
expressing system performance, as well as an iterative solution which
takes into account hardware resource contention in addition to data
contention." ,
owner    =    "jeff" ,
)

@article    ( THURAISINGHAM95,
key    =    "Thuraisingham \& Ford" ,
author    =    "Thuraisingham, B. and Ford, W." ,
title    =    "Security Constraint Processing in a Multilevel
Secure Distributed Database Management System" ,
journal    =    "tkde" ,
publisher=    "ieee" ,
volume    =    "7" ,
number    =    "2" ,
month    =    "apr" ,
year    =    "1995" ,
pages    =    "274--293" ,
bibdate    =    "Wed Jan 10 16:31:40 1996" ,
abstract=    "In a multilevel secure distributed database
management system, users cleared at different security levels access
and share a distributed database consisting of data at different
sensitivity levels. An approach to assigning sensitivity levels, also
called security levels, to data is one which utilizes constraints or
classification rules. Security constraints provide an effective
classification policy. They can be used to assign security levels to
the data based on content, context, and time. In this paper we extend
our previous work on security constraint processing in a centralized
multilevel secure database management system by describing techniques
for processing security constraints in a distributed environment
during query, update, and database design operations." ,
owner    =    "jeff" ,
)

@article    ( TODD76,
key    =    "Todd" ,
author    =    "Todd, S. J. P." ,
title    =    "The Peterlee relational test vehicle--a system
overview" ,
journal    =    "ibmsj" ,
volume    =    "15" ,
number    =    "4" ,
year    =    "1976" ,
pages    =    "285--308" ,
keywords=    "ISBL" ,
bibdate    =    "Wed Jan 18 14:07:35 1984" ,
)

@article    ( TOMPA88,
key    =    "Tompa \& Blakeley" ,
author    =    "Tompa, F. W. and Blakeley, J. A." ,
title    =    "Maintaining Materialized Views Without Accessing
Base Data" ,
journal    =    "Information Systems" ,
volume    =    "13" ,
number    =    "4" ,
year    =    "1988" ,
pages    =    "393--406" ,
keywords=    "Relational databases; query processing; conceptual
relations; stored relations; pre-joined relations materialized views;
snapshots" ,
abstract=    "Access to a database through a user view can be
serviced quickly when the view is materialized, i.e. the transformed
data is explicitly stored. In the presence of database updates,
however, the materialized view can become costly to maintain; often it
must be completely rederived from the base data using the view
definition. Under some conditions the view can be updated directly
given only the view definition, the current contents of the
materialized view, and the update operation (still expressed against
the base data), without accessing the base data itself. In this paper,
we consider relational views defined by projection, selection, and
join. We present necessary and sufficient conditions on the view
definition, contents, and update operations for insertions and
deletions to be reflected in the view without reference to base data.
Because the possibility of such view-based updating is dependent on
the current contents of view, we call the update conditionally
autonomously computable." ,
bibdate    =    "Wed Nov 22 07:43:32 1989" ,
owner    =    "robyn" ,
)

@article    ( TORN84,
key    =    "Torn" ,
author    =    "Torn, A." ,
title    =    "Hashing With Overflow Indexing" ,
journal    =    "BIT" ,
volume    =    "24" ,
year    =    "1984" ,
pages    =    "317--332" ,
bibdate    =    "Fri May 24 15:40:07 1985" ,
)

@inproceedings    ( TOYAMA86A,
key    =    "Toyama" ,
author    =    "Toyama, M." ,
title    =    "Parameterized View Definition and Recursive
Relations" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1986" ,
pages    =    "707--712" ,
abstract=    "The concept of parameterized view definition
mechanism for relational database systems is presented. Primarily, it
makes a single view definition serving for several different view
instances according to the supplied actual parameters. Dynamic binding
of parameters for the view allows the definition of recursive
relations, such as transitive closure, without using extended
operators or procedural constructs such as loops. In this paper,
upward compatible syntax for SQL that incorporates view
parameterization is proposed." ,
bibdate    =    "Wed Sep  2 14:40:16 1987" ,
owner    =    "mckenzie" ,
)

@inproceedings    ( TOYAMA86B,
key    =    "Toyama" ,
author    =    "Toyama, M." ,
title    =    "Data Organizations and Query Processing in
Database Systems" ,
booktitle=    "vldb" ,
address    =    "Kyoto, Japan" ,
editor    =    "Kambayaski, Y." ,
month    =    "aug" ,
year    =    "1986" ,
pages    =    "25--32" ,
abstract=    "On eof the features possessed only by relational
database systems is their powerful query processing. Today, when
relational database systems are widely populated, optimization of
query evaluation procedures is becoming even more important. Much more
efficient query processing is expected on interactive inquiry and on
view realization. Query processing should take full advantage of
physical organization of the given database. To achieve higher
performance, physical database organization must be tuned. This
tutorial overviews the recent development of dynamic hash based file
organizations and discusses their applicability to relational
databases." ,
bibdate    =    "Sun Sep 11 19:34:12 1988" ,
owner    =    "" ,
)

@techreport    ( TSANGARIS91,
key    =    "Tsangaris \& Naughton" ,
author    =    "Tsangaris, M. and Naughton, J." ,
title    =    "A Stochastic Approach for Clustering in Object
Sores" ,
number    =    "1017" ,
institution=    "University of Wisconsin" ,
year    =    "1991" ,
month    =    "mar" ,
abstract=    "Object clustering has long been recognized as
important to the performance of object bases, but in most work to
date, it is not clear exactly what is being optimized or how optimal
are the solutions obtained. We give a rigorous treatment of a
fundamental problem in clustering: given an object base and a
probabilistic description of the expected access patterns, what is an
optimal object clustering, and how can this optimal clustering be
found or approximated? We present a system model for the clustering
problem and discuss two models for access patterns in the system. For
the first, exact optimal clustering strategies can be found; for the
second, we show that the problem is NP--complete, but that it is an
instance of a well--studied graph partitioning problem. We propose a
new clustering algorithm based upon Kernighan's heuristic graph
partitioning algorithm, and present an experimental comparison of this
new clustering algorithm with several previously proposed clustering
algorithms." ,
bibdate    =    "Tue Sep 17 13:51:26 1991" ,
owner    =    "soo" ,
)

@techreport    ( TSANGARIS92,
key    =    "Tsangaris \& Naughton" ,
author    =    "Tsangaris M.M. and Naughton, J.F." ,
title    =    "On the Performance of Object Clustering Techniques" ,
number    =    "1090-1992" ,
institution=    "Department of Computer Sciences, University of
Wisconsin-Madison" ,
year    =    "1992" ,
month    =    "may" ,
pages    =    "32" ,
abstract=    "We investigate the performance of some of the
best-known object clustering algorithms on four different workloads
based upon the Tektronix benchmark. For all four workloads, stochastic
clustering gave the best performance for a variety of performance
metrics. Since stochastic clustering is computationally expensive, it
is interesting that for every workload there are at least one cheaper
clustering algorithm that matched or almost matched stochastic
clustering. Unfortunately, for each workload, the algorithm that
approximated stochastic clustering was different. Our experiments also
demonstrated that even when the workload and object graph are fixed,
the choice of the clustering algorithm depends upon the goals of the
system. For example, if the goal is to perform well on traversals of
small portions of the database starting with a cold cache, the
important metric is the per-traversal expansion factor, and a
well-chosen placement tree will be nearly optimal; if the goal is to
achieve a high steady-state performance with a reasonably large cache,
the appropriate metric is the number of pages to which the clustering
algorithm maps the active portion of the database. For this metric,
the PRP clustering algorithm, which only uses access probabilities
achieves nearly optimal performance." ,
bibdate    =    "Sat Oct 31 23:27:51 1992" ,
owner    =    "leoso" ,
)

@inproceedings    ( TSANGARIS92A,
key    =    "Tsangaris \& Naughton" ,
author    =    "Tsangaris, M. M. and Naughton, J. F." ,
title    =    "On the Performance of Object Clustering Techniques" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
publisher=    "Acm Press" ,
address    =    "San Diego, California" ,
editor    =    "Stonebraker, M." ,
volume    =    "21" ,
month    =    "jun" ,
year    =    "1992" ,
pages    =    "144--153" ,
abstract=    "We investigate the performance of some of the best
known object clustering algorithms on four different workloads based
upon the Tektronix benchmark. For all four workloads, stochastic
clustering gave the best performance for a variety of performance
metrics. Since stochastic clustering is computationally expensive, it
is interesting that for every workload there was at least one cheaper
algorithm that matched or almost matched stochastic clustering.
Unfortunately, for each workload, the algorithm that approximated
stochastic clustering was different. Our experiments also demonstrated
that even when the workload and object graph are fixed, the choice of
the clustering algorithm depends upon the goals of the system. For
example, if the goal is to perform well on traversals of small
portions of the database starting with a cold cache, the important
metric is the pre-traversal expansion factor, and a well-chosen
placement tree will be nearly optimal; if the goal is to achieve a
high steady-state performance with a reasonably large cache, the
appropriate metric is the number of pages to which the clustering
algorithm maps the active portion of the database. For this metric,
the PRP clustering algorithm, which only uses access probabilities
achieves nearly optimal performance." ,
bibdate    =    "Mon Jan 25 13:38:50 1993" ,
owner    =    "bassili" ,
)

@article    ( TSICHRITZIS85,
key    =    "Tsichritzis" ,
author    =    "Tsichritzis, D" ,
title    =    "Object Species" ,
journal    =    "Database Engineering. Special Issue on
Object-Oriented Systems" ,
year    =    "1985" ,
volume    =    "8" ,
number    =    "4" ,
pages    =    "2--13" ,
month    =    "December" ,
)

@article    ( TSICHRITZIS87,
key    =    "Tsichritzis et al." ,
author    =    "Tsichritzis, D. and Fiume, E. and Gibbs, S. and
Nierstrasz, O." ,
title    =    "KNOs: KNowledge Acquisition, Dissemination, and
Manipulation Objects" ,
journal    =    "ACM Transactions on Office Information Systems" ,
year    =    "1987" ,
volume    =    "5" ,
number    =    "1" ,
pages    =    "96--112" ,
month    =    "January" ,
)

@article    ( TSUDA91,
key    =    "Tsuda et al." ,
author    =    "Tsuda, K. and Yamamota, K. and Hirakawa, M. and
Tanake, M. and Ichikawa, T." ,
title    =    "MORE: An Object Oriented Data Model with a
Facility for Changing Object Structures" ,
journal    =    "tkde" ,
volume    =    3 ,
pages    =    "444--460" ,
month    =    "dec" ,
year    =    1991 ,
annote    =    "A system designed to promote polymorphism, they
come up with a good set of requirements for the changes that must be
supported in object definition." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( TSUR84,
key    =    "Tsur \& Zaniolo" ,
author    =    "Tsur, S. and Zaniolo, C." ,
title    =    "An Implementation of GEM - Supporting a semantic
Data Model on a Relational Back-End" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Yormark, B." ,
publisher=    "acm" ,
address    =    "Boston, MA" ,
month    =    "jun" ,
year    =    "1984" ,
pages    =    "286--295" ,
abstract=    "This paper presents a simple approach for
extending the relational system INGRES into one supporting a semantic
data model. It describes a DBMS consisting of (i) a user-friendly
front-end, supporting the GEM semantic data model and query language
under the UNIX time-sharing system, and (ii) a dedicated back-end
processor providing efficient support for database transactions,
concurrency control and recovery. GEM extends the relational model to
support the notions of entities with surrogates, the relationships of
aggregation and generalization, null values and set- valued
attributes, and provides simple extensions of QUEL to handle these new
constructs. In this proposed implementation of GEM, the relational
database processor IDM 500 by Britton-Lee is used as the back-end
machine." ,
annote    =    "Differs from Codd in the handling of null values.
in Codd a value is assumed to exist although it is unknown; here it is
a placeholder for a value that perhaps doesn't exist or is otherwise
unknown." ,
bibdate    =    "Mon Oct  1 16:21:53 1984" ,
)

@article    ( TSUR90,
key    =    "Tsur" ,
author    =    "Tsur, S." ,
title    =    "Data Dredging" ,
journal    =    "IEEE Data Engineering" ,
publisher=    "ieee" ,
volume    =    "13" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1990" ,
pages    =    "58--63" ,
abstract=    "Data dredging is a paradigm of the next-generation
DBMS applications. It involves inductive learning by the controlled
scanning of large volumes of low-level historical data so as to
formulate and verify certain high-level hypotheses. In this short
paper we review some of the issues related to this problem area,
formulate some of the requirements of a technology to support it and
briefly elaborate on a data dredging example." ,
bibdate    =    "Thu Jul  8 22:43:12 1993" ,
owner    =    "daisyc" ,
)

@article    ( TURBYFILL88,
key    =    "Turbyfill" ,
author    =    "Turbyfill, C." ,
title    =    "Disk Performance and Access Patterns for Mixed
Database Workloads" ,
journal    =    "Database Engineering" ,
publisher=    "ieee" ,
volume    =    "11" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1988" ,
pages    =    "48--54" ,
owner    =    "manning" ,
bibdate    =    "Tue Jun  7 14:59:04 1988" ,
)

@article    ( TURNER85,
key    =    "Turner \& Lowden" ,
author    =    "Turner, R. and Lowden, B.G.T." ,
title    =    "An Introduction to the Formal Specification of
Relational Query Languages" ,
journal    =    "The Computer Journal" ,
volume    =    "28" ,
number    =    "2" ,
year    =    "1985" ,
pages    =    "162--169" ,
abstract=    "An introduction is given to the use of formal
semantics as a means of both specifying relational query languages and
of establishing a conceptual basis for their analysis. The approach is
demonstrated with respect to the relational calculus and then extended
to cope with the more advanced constructs of SEQUEL and QUEL." ,
bibdate    =    "Mon Oct 14 12:05:38 1985" ,
)

@phdthesis    ( TUZHILIN89,
key    =    "Tuzhilin" ,
author    =    "Tuzhilin, Alexander" ,
title    =    "Using Relational Discrete Event Systems and Models
for Prediction of Future Behavior of databases" ,
school    =    "New York University" ,
month    =    "Oct" ,
year    =    "1989" ,
keywords=    "The following prediction problem is studied in
this dissertation: given a specification of the future behavior of a
system and the current state of the system described with a relational
database, predict what will happen to the system in the future. The
behavior is defined in terms of relational Discrete Event Systems
(RDESes) and Models (RDEMs). An RDES is a set of possible
non-deterministic trajectories of future states of a system. An RDEM
is a finit formal description of a generally infinite RDES set.
Various productio system RDEMs and a recurrence equation RDEM are
defined and formally compared in terms of expressive power in this
dissertation. It is shown that one of the production system RDEMs is
better than other considered RDEMs not only in terms of expressive
power but in other respects as well. Also, the suitablility of various
control strategies to restrict non-determinism and improve system's
performance is considered. In order to obtain predictions aboaut
possible future states of a database, Predictive Query Language (PQL)
is defined with the syntax based on a predicate temporal logic and the
semantics on RDEM models. It is shown how PQL is related to relational
queries for Datalog and its extensions. Finally, the prototype
implementation of Cassandra system is described. Cassandra supports
PQL with the semantics based on a production system REDM. an example
of a small Flexible Manufacturing system is used throughout the
dissertation to illustrate various points abaout the described
methods." ,
bibdate    =    "Tue Sep 24 13:05:07 1991" ,
owner    =    "suchen" ,
)

@techreport    ( TUZHILIN91,
key    =    "Tuzhilin \& Kedem" ,
author    =    "Tuzhilin,, Alexander and Zi M. Kedem" ,
title    =    "Modeling Dynamics of Databases with Relational
Discrete Event systems and Models" ,
number    =    "IS-91-5" ,
institution=    "NYU Information Systems Department" ,
year    =    "1991" ,
month    =    "Mar" ,
pages    =    "26" ,
abstract=    "Behavior of reltional databases is studied within
the framework of Relational Discrete Event Systems (RDESes) and Models
(RDEMs). Three behavior specification methods based on production
systems, recurrence equations, and Petri mets are defined and their
expressive powers are compared. Production system RDEM is extended to
support non-determinism, and various deterministic and
non-deterministic production system interpreters are introduced and
formally compared in terms of their expressive power. It is shown that
the parallel deterministic interpreter has more expressive power than
other interpreters including OPS5-like interpreter. since it is also
parallel , this makes the parellel deterministic interpreter a very
attractive interpreter for production systems" ,
bibdate    =    "Sat Sep 21 17:12:55 1991" ,
owner    =    "bib" ,
)

@techreport    ( TYLER90,
key    =    "Tyler" ,
author    =    "Tyler, J. " ,
title    =    "A Planning Model for Unifying Information Modeling
Languages for Product Data Exchange Standards ({\it PDES}) " ,
number    =    "NIST Document NISTR 90-4234" ,
institution=    "NIST" ,
month    =    "jan" ,
year    =    1990 ,
annote    =    "A proposal for co-relating different structures in
different exchange formats. It proposes examining several different
semantic models and look for the commonalities to develop a common
semantic model. Candidate models will be drawn from three classes:
Fact-Type, Unities, and Rules." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( ULLMAN83A,
key    =    "Ullman" ,
author    =    "Ullman, J. D." ,
title    =    "On Kent's 'Consequences of Assuming a Universal
Relation'" ,
journal    =    "ACM Transactions on Database Systems" ,
year    =    "1983" ,
volume    =    "8" ,
number    =    "4" ,
pages    =    "637--643" ,
month    =    "December" ,
)

@inproceedings    ( ULLMAN85,
key    =    "Ullman" ,
author    =    "Ullman, J.D." ,
title    =    "Implementation Of Logical Query Languages For
Databases" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
page    =    "444" ,
bibdate    =    "Wed Jun 12 15:32:01 1985" ,
)

@article    ( ULLMAN90,
key    =    "Ullman \& Zaniolo" ,
author    =    "Ullman, J. and Zaniolo, C." ,
title    =    "Deductive Databases: Achievements and Future
Directions" ,
journal    =    "sigmod" ,
volume    =    "19" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1990" ,
pages    =    "75--82" ,
abstract=    "In the recent years, deductive databases have been
the focus of intense research, which has brought dramatic advances in
theory, systems, and applications. A salient feature of deductive
databases is their capability of supporting a declarative, rule-based
style of expressing queries and applications on databases. As such,
they find applications in disparate areas, such as knowledge mining
from databases, and computer-aided design and manufacturing systems.
In this paper, we briefly review the key concepts behind deductive
databases and their newly developed enabling technology. Then, we
describe current research on extending the functionality and usability
of deductive databases and on providing a synthesis of deductive
databases with procedural and object-oriented approaches." ,
bibdate    =    "Sun Jan 19 21:00:01 1992" ,
owner    =    "soo" ,
)

@inproceedings    ( URBAN88,
key    =    "Urban \& Delcambre" ,
author    =    "Urban, S. and Delcambre, L." ,
title    =    " Constraint Analysis: A Tool for Explaining the
Semantics of Complex Objects" ,
booktitle=    "Advances in Object Oriented Database Systems 2nd
International Workshop on Object Oriented Database Systems" ,
pages    =    "156--161" ,
publisher=    "Springer-Verlag" ,
address    =    "New York" ,
month    =    "sep" ,
year    =    1988 ,
annote    =    "The problem of evaluating constraints on a
database is studied. A theory is proposed that allows an ordering for
efficient processing of constraints, and allows for easy
identification of constraints that subsume others. " ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( URBAN91,
key    =    "Urban \& Wu" ,
author    =    "Urban, S. and Wu, J." ,
title    =    "Resolving Semantic Heterogeneity through the
explicit representation of Data Model Semantics" ,
journal    =    "sigmod" ,
volume    =    20 ,
pages    =    "55--58" ,
month    =    "dec" ,
year    =    1991 ,
annote    =    " A behavioral approach to denotation, using a
logic programming style." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( VALDURIEZ86,
key    =    "Valduriez et al." ,
author    =    "Valduriez, Patrick and Koshafian, Setrag and
Copeland, George" ,
title    =    "Implementation Techniques of Complex Objects" ,
booktitle=    "Proceedings of the Twelfth International
Conference on Very Large Databases" ,
year    =    "1986" ,
pages    =    "101--109" ,
month    =    "August" ,
)

@article    ( VALDURIEZ87,
key    =    "Valduriez" ,
author    =    "Valduriez, Patrick" ,
title    =    "Join Indices" ,
journal    =    "ACM Transactions of Database Systems" ,
year    =    "1987" ,
volume    =    "12" ,
number    =    "2" ,
pages    =    "218--246" ,
month    =    "June" ,
)

@inproceedings    ( VALDURIEZ87A,
key    =    "Valduriez \& Boral" ,
author    =    "Valduriez, Patrick and Boral, Haran" ,
title    =    "Evaluation of Recursive Queries Using Join Indices" ,
booktitle=    "Proceedings from the First International
Conference on Expert Database Systems" ,
year    =    "1987" ,
pages    =    "197--208" ,
month    =    "" ,
)

@inproceedings    ( VALDURIEZ88,
key    =    "Valduriez \& Koshafian" ,
author    =    "Valduriez, Patrick and Koshafian, Setrag" ,
title    =    "Transitive Closure of Transitively Closed
Relations" ,
booktitle=    "Proceedings of the xth Conference on Expert
Database Systems" ,
year    =    "1988" ,
pages    =    "377--400" ,
month    =    "" ,
)

@techreport    ( VANDENBERG90,
key    =    "Vandenberg \& DeWitt" ,
author    =    "Vandenberg, S.; DeWitt, D." ,
title    =    "Algebraic Support for Complex Objects with Arrays,
Identity, and Inheritance" ,
number    =    "987" ,
institution=    "University of Wisconsin" ,
address    =    "Madison, WI" ,
year    =    "1990" ,
month    =    "dec" ,
pages    =    "1--28" ,
abstract=    "Algebraic query processing and optimization for
relational databases is a proven and reasonably well-understood
technology. Recently the algebraic approach has been extended to more
advanced data models (nested relations complex objects,
object-oriented systems.) Here we continue this evolution by
presenting novel algebraic operators and transformations supporting
grouping, arrays, references, and multisets. We also propose a new
approach to processing and optimizing overridden methods in the
presence of multiple inheritance. The utility of both the algebraic
operators and the transformation rules is demonstrated with examples.
Object identity is incorporated into the algebraic domains, giving an
original, intuitive set-theoretic semantics for the domains of object
identifiers in the presence of multiple inheritance. We prove that the
algebra is equipollent to the QUEL-like user-level query language and
discuss some other expressiveness issues." ,
bibdate    =    "Tue Mar 12 07:23:53 1991" ,
owner    =    "robyn" ,
)

@inproceedings    ( VANDENBERG91A,
key    =    "Vandenberg \& DeWitt" ,
author    =    "Vandenberg, S.L. and DeWitt, D.J." ,
title    =    "Algebraic SUpport for Complex Objects with Arrays,
Identity, and Inheritance" ,
booktitle=    "sigmod" ,
organization=    "ACM" ,
address    =    "Denver, CO" ,
editor    =    "Clifford, J. and King. R." ,
month    =    "may" ,
year    =    "1991" ,
pages    =    "158--167" ,
bibdate    =    "Sat Jul 20 11:52:01 1991" ,
owner    =    "rts" ,
)

@inproceedings    ( VANDERWOLF90,
key    =    "van der Wolf" ,
author    =    "van der Wolf, P. and Sloof, G. and Bingley, P. and
Dewilde, P." ,
title    =    " Meta Data Management in the {NELIS} {CAD}
Framework" ,
booktitle=    "Proceedings 27th ACM/IEEE Design Automation
Conference" ,
pages    =    "142--145" ,
publisher=    "IEEE Press" ,
address    =    "New York" ,
year    =    1990 ,
annote    =    "Details an Object Oriented approach to store CAD
design meta-data. The work is similar in form to that of Katz, but
ties in the different hierarchies to subclassing systems in OO
languages." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inbook        ( VASSILIOU85,
key    =    "Vassiliou et al." ,
author    =    "Vassiliou, Y. and Clifford, J. and Jarke, M." ,
title    =    "Database Access Requirements of Knowledge-Based
Systems" ,
booktitle=    "Query Processing Database Systems" ,
publisher=    "Springer-Verlag" ,
year    =    "1985" ,
pages    =    "156--170" ,
bibdate    =    "Wed Nov  6 22:26:48 1985" ,
)

@article    ( VAUGHAN-NICHOLS90,
key    =    "Vaughan-Nichols" ,
author    =    "Vaughan-Nichols, Steven J." ,
title    =    "Getting Your Byte's Worth" ,
journal    =    "Byte" ,
year    =    "1990" ,
volume    =    "" ,
number    =    "" ,
pages    =    "331--336" ,
month    =    "November" ,
)

@article    ( VEEN86,
key    =    "Veen" ,
author    =    "Veen, A.H." ,
title    =    "Dataflow Machine Architecture" ,
journal    =    "compsurv" ,
publisher=    "acm" ,
volume    =    "18" ,
number    =    "4" ,
month    =    "dec" ,
year    =    "1986" ,
pages    =    "363--396" ,
keywords=    "Design; performance; data-driven architectures;
dataflow machines; data structure storage" ,
abstract=    "Dataflow machines are programmable computers of
which the hardware is optimized for fine-grain data-driven parallel
computation. The principles and complications of data-driven execution
are explained, as well as the advantages and costs of fine-grain
parallelism. A general model for a dataflow machine is presented and
the major design options are discussed. Most dataflow machines
described in the literature are surveyed on the basis of this model
and its associated technology. For general-purpose computing the most
promising dataflow machinnes are those that employ packet-switching
communication and support general recusion. Such a recursion mechanism
requires an extremely fast mechanism to map a sparsely occupied
virtual space to a physical space of realistic size. No solution has
yet proved fully satisfactory. A working prototype of one processing
element is described in detail. On the basis of experiencee with this
prototype, some of the objections raised against the dataflow approach
are disucssed. It appears that the overhead due to fine-grain
parallelism can be made acceptable by sophisticated compiling and
employing special hardware for the storage of data structures. Many
computing-intensive programs show sufficient parallelism. In fact, a
major problem is to restrain parallelism when machine resources tend
to get overloaded. Another issue that requires further investigation
is the distribution of computation and data structures over the
processing elements." ,
bibdate    =    "Mon Aug 24 12:54:34 1987" ,
owner    =    "manning" ,
)

@article    ( VEKLEROV85,
key    =    "Veklerov" ,
author    =    "Veklerov, E." ,
title    =    "Analysis of Dynamic Hashing with Deferred
Splitting" ,
journal    =    "tods" ,
volume    =    "10" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1985" ,
pages    =    "90--96" ,
bibdate    =    "Wed Jun 12 21:51:28 1985" ,
)

@article    ( VENTRONE91,
key    =    "Ventrone \& Heiler" ,
author    =    "V. Ventrone and S. Heiler" ,
title    =    "Semantic Heterogeneity as a Result of Domain
Evolution" ,
journal    =    "sigmod" ,
volume    =    20 ,
pages    =    "16--19" ,
month    =    "dec" ,
year    =    1991 ,
annote    =    "Good statement of the problem, but no solutions." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( VIANU87,
key    =    "Vianu" ,
author    =    "Vianu, V." ,
title    =    "Dynamic Functional Dependencies and Database Aging" ,
journal    =    "jacm" ,
publisher=    "acm" ,
volume    =    "34" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1987" ,
pages    =    "28--59" ,
abstract=    "A simple extension of the relational model is
introduced to study the effect of dynamic constraints on database
evolution. Both static and dynamic constraints are used in conjunction
with the model. The static constraints considered here are functional
dependencies (FDs). The dynamic constraints involve global updates and
are restricted to certain analogs of FDs, called ``dynamic'' FDs. The
results concern the effect of the dynamic constraints on the static
constraints in the course of time. The effect of the past history of
the database on the static constraint is investigated using the
notions of age and age closure. The connection between the static
constraints and the potential future evolution of the database is
briefly discussed using the notions of survivability and survivability
closure." ,
bibdate    =    "Tue Jan 20 12:10:24 1987" ,
owner    =    "manning" ,
)

@article    ( VIET85,
key    =    "Viet" ,
author    =    "Chung Le Viet" ,
title    =    "Translation and Compatibility of SQL and QUEL
Queries" ,
journal    =    "J. Inf. Process. (Japan)" ,
volume    =    "8" ,
number    =    "1" ,
month    =    "6 - 11 April " ,
year    =    "1985" ,
pages    =    "1 -- 15" ,
bibdate    =    "Fri Mar 22 16:36:15 1991" ,
owner    =    "suchen" ,
)

@article    ( VITTER82,
key    =    "Vitter" ,
author    =    "Vitter, J." ,
title    =    "Implementations for Coalesced Hashing" ,
journal    =    "cacm" ,
volume    =    "25" ,
number    =    "12" ,
month    =    "dec" ,
year    =    "1982" ,
pages    =    "911--926" ,
bibdate    =    "Fri Apr 26 23:26:19 1985" ,
)

@inproceedings    ( VONBULTZINGSLOEWEN,
key    =    "vonBultzingsloewen" ,
author    =    "vonBultzingsloewen, G." ,
title    =    "Translating and Optimizing SQL Queries Having
Aggregates" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
editor    =    "Hammersley, P." ,
month    =    "sep" ,
year    =    "1987" ,
pages    =    "235--243" ,
abstract=    "In this paper, we give a precise definition of the
semantics of SQL queries having aggregate functions, identify the
problems associated with the optimization of such queries and give
some solutions. The semantics of SQL queries is defined by translating
them into expressions of an extended relational calculus (extensions
are necessary for a correct treatment of aggregate functions and null
values). The discussion of the optimization problems is based on a new
transformation of a relational calculus expression into relational
algebra. By investigating the transformation of aggregate functions we
are able to identify two major problems: correct integration of the
values of aggregate functions applied to empty relations and
unnecessary computation of unneeded function values. To solve these
problems we propose to interpret an aggregate function applied to a
calculus expression with some free variables as a function on the
attributes of these variables that are referenced in the expression.
Doing so, we are able to develop several new processing strategies
that should be considered by an optimizer." ,
bibdate    =    "Thu Apr 28 15:03:23 1988" ,
owner    =    "" ,
)

@inproceedings    ( VONBULTZINGSLOEWEN87,
key    =    "VonBultzingsloewen" ,
author    =    "VonBultzingsloewen, G." ,
title    =    "Translating and Optimizing SQL Queries Having
Aggregates" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
year    =    "1987" ,
pages    =    "235--243" ,
abstract=    "In this paper, we give a precise definition of the
semantics of SQL queries having aggregate functions, identify the
problems associated with the optimization of such queries and give
some solutions. The semantics of SQL queries is defined by translating
them into expressions of an extended relational calculus (extensions
are necessary for a correct treatment of aggregate functions and null
values). The discussion of the optimization problems is based on a new
transformation of a relational calculus expression into relational
algebra. By investigating the transformation of aggregate functions we
are able to identify two major problems: correct integration of the
values of aggregate functions applied to empty relations and
unnecessary computation of unneeded function values. To solve these
problems we propose to intepret an aggregate function applied to a
calculus expression with some free variables as a function on the
attributes of these variables that are referenced in the expression.
Doing so, we are able to develop several new processing strategies
that should be considered by an optimizer." ,
bibdate    =    "Fri Jan 19 09:27:26 1990" ,
owner    =    "robyn" ,
)

@inproceedings    ( VOSSEN85,
key    =    "Vossen \& Brosda" ,
author    =    "Vossen, G. and Brosda, V." ,
title    =    "A High-Level User Interface for Update and
Retrieval in Relational Databases - Language Aspects" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "343--353" ,
bibdate    =    "Wed Jun 12 11:46:20 1985" ,
)

@article    ( VOSSEN88,
key    =    "Vossen \& Yacabucci" ,
author    =    "G. Vossen and J. Yacabucci" ,
title    =    "An Extension of the Database Language SQL to
Capture More Relational Concept." ,
journal    =    "SIGMOD Rec. " ,
volume    =    "17" ,
number    =    "4" ,
month    =    "Dec." ,
year    =    "1988" ,
pages    =    "70--78" ,
keywords=    "SQL, relational database" ,
bibdate    =    "Fri Mar 22 11:35:20 1991" ,
owner    =    "suchen" ,
)

@article    ( VOSSEN91,
key    =    "Vossen" ,
author    =    "Vossen, G." ,
title    =    "Bibliography on Object-Oriented Database
Management" ,
journal    =    "sigmod" ,
volume    =    "20" ,
number    =    "1" ,
month    =    "Mar" ,
year    =    "1991" ,
pages    =    "24--46" ,
bibdate    =    "Wed Mar 20 00:37:09 1991" ,
owner    =    "soo" ,
)

@article    ( VOSSEN91A,
key    =    "Vossen" ,
author    =    "Vossen, G." ,
title    =    "Bibliography on Object-Oriented Database
Management" ,
journal    =    "sigmod" ,
publisher=    "Acm Press" ,
volume    =    "20" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1991" ,
pages    =    "24--46" ,
bibdate    =    "Thu Apr 22 12:00:48 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( WALKER80,
key    =    "Walker" ,
author    =    "Walker, Adrian" ,
title    =    "On Retrieval from a Small Version of a Large Data
Base" ,
booktitle=    "Proceedings of the Sixth International Conference
on Very Large Data Bases" ,
year    =    "1980" ,
pages    =    "47--54" ,
month    =    "" ,
)

@techreport    ( WALKER81,
key    =    "Walker \& Salveter" ,
author    =    "Walker, A. and Salveter, S.C." ,
title    =    "Automatic Modification of Transactions to Preserve
Database Integrity Without Undoing Updates" ,
number    =    "81/026" ,
institution=    "Department of Computer Science, State University
of New York" ,
address    =    "Stony Brook, NY" ,
year    =    "1981" ,
month    =    "jun" ,
pages    =    "1--31" ,
abstract=    "It is possible, in principle, for a table in a
relational data base to contain some rows which do not make sense in
the real world. For example, two salaries may be listed for the same
employee in a given year. Constraints on the contents of a data base
are often stated so as to rule out such rows. Then, a transaction
which changes the data base may violate a constraint. One way of
checking a transaction is to run it, test whether the resulting data
base satisfies the constraints, and, if not, undo the changes made by
the transaction. This method can be costly in computer resources, and
requires that transactions be individually debugged by the user. This
paper describes a technique which allows the user to enter any
transaction scheme into a database system. The entered scheme is
automatically transformed into a new scheme which is safe, in the
sense that no instance of the new transaction scheme will cause a
constraint violation. Such an instance transaction uses queries to
look ahead and test whether it would violate a constraint. If so, a
warning message is sent to the user; if not, the transaction updates
the data base. The transformed transaction never requires that any
changes to the date base be undone.," ,
bibdate    =    "Wed Jul 16 12:26:28 1986" ,
owner    =    "manning" ,
)

@article    ( WANG91,
key    =    "Wang" ,
author    =    "Wang, Fangju" ,
title    =    "Relational-Linear Quadtree Approach for
Two-Dimensional Spatial Representation and Manipulation" ,
journal    =    "tkde" ,
volume    =    "3" ,
number    =    "1" ,
month    =    "Mar" ,
year    =    "1991" ,
pages    =    "118--122" ,
keywords=    "Expert vision system, quadtree, relational data
model, spatial dtabase, spatial data modeling, spatial knowldege
representation, spatial manipulation." ,
abstract=    "In building spatial satabases and vision knowledge
bases, the currently used data (knowledge representation) models have
serious limitations. In this paper, a new approach relational-linear
quadtree is presented which provides information at multiple
resolution to describe spatial featues together with descriptive or
propositional information in desired structures, and provides powerful
and flexible spatial analysis and manipulation ability." ,
bibdate    =    "Tue Aug  6 16:48:36 1991" ,
owner    =    "suchen" ,
)

@article    ( WANG94,
key    =    "Wang et al." ,
author    =    "Wang, Jason Tsong-Li and Zhang, Kaizhong and
Jeong, Karpjoo and Shasha, Dennis" ,
title    =    "A System for Approximate Tree Matching" ,
journal    =    "tkde" ,
publisher=    "IEEE" ,
volume    =    "6" ,
number    =    "4" ,
month    =    "aug" ,
year    =    "1994" ,
pages    =    "559--571" ,
keywords=    "Editing distance; graphics; query language; query
processing; pattern matching; tool; trees; tree comparison" ,
abstract=    "Ordered, labeled trees are trees in which each
node has a label and the left-to-right order of its children (if it
has any) is fixed. Such trees have many applications in vision,
pattern recognition, molecular biology, programming compilation, and
natural language processing. Many of the applications involve
comparing trees or retrieving/extracting information from a repository
of trees. Examples include classification of unknown patterns,
analysis of newly sequenced RNA structures, semantic taxonomy for
dictionary definitions, generation of interpreters for nonprocedural
programming languages, and automatic error recovery and correction for
programming languages. Previous systems use exact matching (or
generalized regular expression matching) for tree comparison. This
paper presents a system, called Approximate-Tree-By-Example (ATBE),
which allows inexact matching of trees. The ATBE system interacts with
the user through a simple but powerful query language; graphical
devices are provided to facilitate inputing the queries. The paper
describes the architecture of ATBE, illustrates its use and describes
some aspects of ATBE implementation. We also discuss the underlying
algorithms and provide some sample applications." ,
bibdate    =    "Sat Dec  3 18:52:37 1994" ,
owner    =    "kevin" ,
)

@article    ( WARREN85,
key    =    "Warren" ,
author    =    "Warren, Carl" ,
title    =    "Optical Storage Shines on the Horizon" ,
journal    =    "Mini/Micro Systems" ,
year    =    "1985" ,
volume    =    "" ,
number    =    "" ,
pages    =    "68--80" ,
month    =    "December" ,
)

@inproceedings    ( WASSERMAN79,
key    =    "Wasserman" ,
author    =    "Wasserman, A." ,
title    =    "The Data Management Facilities of PLAIN" ,
booktitle=    "sigmod" ,
organization=    "ACM-SIGMOD" ,
address    =    "Boston, MA" ,
year    =    "1979" ,
month    =    "jun" ,
pages    =    "60--70" ,
bibdate    =    "Mon May  9 14:26:52 1988" ,
owner    =    "" ,
)

@article    ( WEBER83,
key    =    "Weber et al." ,
author    =    "Weber, Wolfgang and Stucky, Wolfried and Karszt,
Jakob" ,
title    =    "Integrity Checking in Database Systems" ,
journal    =    "Information Systems" ,
year    =    "1983" ,
volume    =    "8" ,
number    =    "2" ,
pages    =    "125--136" ,
month    =    "" ,
)

@techreport    ( WEDDELL87,
key    =    "Weddell" ,
author    =    "Weddell, G.E." ,
title    =    "Physical Design and Query Compilation for a
Semantic Data Model (assuming memory residence)" ,
number    =    "CSRI-198" ,
institution=    "Computer Systems Research Institute, University of
Toronto" ,
address    =    "Toronto, Canada" ,
year    =    "1987" ,
month    =    "apr" ,
pages    =    "297" ,
abstract=    "In this thesis, we consider some of the problems
of physical design for the more recently proposed data models. These
newer models, called semantic data models, adopt concepts developed by
artificial intelligence researchers investigating the general problem
of knowledge representation. Our results apply to a particular choice
of model, called LDM, that is also developed in the thesis. LDM
incorporates the most common features of other semantic data models
including a capability for a generalization hierarchy that supports
multiple inheritance, support for many-valued properties and a
non-procedural query language. This has the advantage that
implementors of these other models can then apply our techniques for
physical design to solve similar implementation problems. The
performance issues we address are based on the assumption that all
encoding of information is memory resident. With this assumption, some
problems, such as the choice of representation for entities and simple
property values, become important issues. Other issues relating to
access strategies for implementing queries or to the choice of index
types and their selection, are fundamentally changed. The assumption
also permits us to ignore clustering problems (problems concerning the
judicious placement of data in order to reduce retrieval overhead),
since they then have much less significance to overall performance.
The problems that are considered include: finding representations of
entities and single valued properties, selecting a set of indices to
support access to group of entities occurring as class extensions or
as values of many-valued properties, compiling queries, and mapping
transactions to forms that automatically maintain indices." ,
bibdate    =    "Wed Jul 21 23:47:55 1993" ,
owner    =    "daisyc" ,
)

@article    ( WEDDELL89,
key    =    "Weddell" ,
author    =    "Weddell G." ,
title    =    "Selection of Indexes to Memory-Resident Entities
for Semantic Data Models" ,
journal    =    "tse" ,
volume    =    "1" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1989" ,
pages    =    "274--284" ,
abstract=    "A basic part of physical design for a database
schema has always been the problem of selecting the best possible set
of indexes to records. In this paper, we consider the problem when all
encoding of information is memory-resident. Our data model is the
relational model extended in two ways that are common with semantic
data models. One consequence of memory residence is that the search
space of possible indexes is enlarged to the extent that previous
methods requiring some consideration of each possibility are no longer
possible. An instance of our index selection problem includes a set of
partial match queries in addition to the input schema. We presume that
the set is determined by an initial phase of query optimization when
applied to a fixed set of more general forms of queries that
characterize the way in which information is accessed for an
application. Our general approach is to separate the problem into two
parts. In the first part, our main concern in this paper, we search
for an initial choice of indexes, only considering their suitability
for answering the partial match queries. A procedure is exhibited that
finds the smallest possible set of indexes that ensures all queries
run as efficiently as possible. In the second part, we outline a
second procedure for refining this initial selection of indexes in a
way that accounts for the additional cost of index maintenance
overhead." ,
bibdate    =    "Fri Oct 20 15:39:17 1989" ,
owner    =    "robyn" ,
)

@techreport    ( WEDDELL89A,
key    =    "Weddell" ,
author    =    "Weddell, G.E." ,
title    =    "Efficient Property Access in Memory Resident
Object Oriented Databases" ,
number    =    "CS-89-49" ,
institution=    "University of Waterloo" ,
address    =    "Waterloo, Ontario, Canada" ,
year    =    "1989" ,
pages    =    "1--23" ,
abstract=    "We consider the problem of encoding property
values for objects in a memory-resident object-oriented database. A
choice of encoding will determine the strategies that may be used for
property value access, and for other operations such as checking for
equality of two objects. The results of an experiment with a C
compiler are presented which indicate that its use of less efficient
strategies for property value access significantly impacts its overall
performance. This is evidence that the encoding problem is an
important performance issue for software systems such as compilers
that have major components essentially responsible for managing a
memory-resident database. A definition of the problem is given,
followed by a review of procedures for solving the problem that has
been proposed or used in object-oriented programming languages. A new
procedure is described that produces a choice of property encoding
satisfying an alignment condition. Some results of an evaluation of
the procedure indicate that the procedure produces acceptable results
for class hierarchies in which highly connected conmponents consist of
up to twenty classes. Some analytic results on the general difficulty
of the problem are also presented." ,
bibdate    =    "Fri Dec  8 11:00:40 1989" ,
owner    =    "robyn" ,
)

@techreport    ( WEDDELL89B,
key    =    "Weddell" ,
author    =    "Weddell, G." ,
title    =    "RDM Reference Manual" ,
number    =    "89--41" ,
institution=    "University of Waterloo" ,
address    =    "Waterloo, Ontario" ,
year    =    "1989" ,
month    =    "sep" ,
pages    =    "20" ,
abstract=    "The Resident Manager (RDM) is a software tool set
for applications that manipulate memory-resident databases which is
currently under development in the multimedia laboratory of the
University of Waterloo. At present, the tool set consists of two
compilers. The first produces access and representation code in a
language called PDM from source that specifies the organization of
data, and the manner in which it is accessed and changed. The input
source for this compiler is expressed in a language called LDM. PDM
and LDM are acronyms for Physical Data Model and Logical Data Model
respectively. Output from this first compiler can be input to a second
compiler, together with applications written in an extended C language
called C/DB. C/DB has additional language constructs that permit the
direct use of data access specifications written in LDM. The result of
this second compiler is pure C code that can then be compiled with a
standard C compiler." ,
bibdate    =    "Wed Feb 13 10:20:11 1991" ,
owner    =    "robyn" ,
)

@article    ( WEIHL87,
key    =    "Weihl" ,
author    =    "Weihl, W.E." ,
title    =    "Distributed Version Management for Read-Only
Actions" ,
journal    =    "tse" ,
volume    =    "SE-13" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "87" ,
pages    =    "55--64" ,
keywords=    "Atomic actions; concurrency; distributed systems;
multiple version protocols; read-only actions; storage management" ,
abstract=    "Typical concurrency control protocols for atomic
actions, such as two-phase locking, perform poorly for long read-only
actions. We present four new concurrency control protocols that
eliminate all interference between read-only actions and update
actions, and thus offer significantly improved performance for
read-only actions. The protocols work by maintaining multiple versions
of the system state; read-only actions read old versions, while update
actions manipulate the most recent version. We focus on the problem of
managing the storage required for old versions in a distributed
system. One of the protocols uses relatively little space, but has a
potentially significant communication cost. The other protocols use
more space, but may be cheaper in terms of communication." ,
bibdate    =    "Tue Jan  6 17:35:39 1987" ,
owner    =    "manning" ,
)

@article    ( WELLS92,
key    =    "Wells et al." ,
author    =    "Wells, D.L. and Blakeley, J.A. and Thompson, C.W." ,
title    =    "Architecture of Open Object-Oriented Database
Management Systems" ,
journal    =    "IEEE Computer" ,
publisher=    "ieee" ,
volume    =    "25" ,
number    =    "10" ,
month    =    "oct" ,
year    =    "1992" ,
pages    =    "74--91" ,
bibdate    =    "Fri Oct 16 11:41:33 1992" ,
owner    =    "bassili" ,
)

@techreport    ( WENSEL88,
key    =    "Wensel" ,
author    =    "Wensel, S." ,
title    =    "The POSTGRES Reference Manual" ,
institution=    "University of California" ,
number    =    "UCB/ERL M88/20" ,
address    =    "Berkeley, CA" ,
month    =    "mar" ,
year    =    "1988" ,
bibdate    =    "Wed Oct 24 09:23:27 1990" ,
owner    =    "robyn" ,
)

@inproceedings    ( WESTON86,
key    =    "Weston" ,
author    =    "P. Weston" ,
title    =    "The Use of the SQL DBMS in the Administration of a
Computer Terminal Network" ,
booktitle=    "Proceedings of the SEAS Spring Meeting 1986.
Expert Systems," ,
address    =    "Heidelberg, Germany" ,
month    =    "6 - 11 April " ,
year    =    "1986" ,
pages    =    "197 -- 206" ,
keywords=    "SQL" ,
bibdate    =    "Fri Mar 22 16:26:38 1991" ,
owner    =    "suchen" ,
)

@inbook        ( WEYL75A,
key    =    "Weyl et al." ,
author    =    "Weyl, S. and Fries, J. and Wiederhold, G. and
Germano, F." ,
title    =    "A Modular Self-Describing Clinical Databank System" ,
booktitle=    "Computers and Biomedical Research" ,
publisher=    "Academic Press" ,
address    =    "Great Britain" ,
year    =    "1975" ,
volume    =    "8" ,
pages    =    "279--293" ,
abstract=    "Databanks containing detailed medical information
have been established for specific divisions of the Stanford Medical
Center using a table-driven computer system designed to record and
analyze medical record data. The databank developed in the Division of
Immunology over the past three years includes data from over 5500
patient visits. Nine months of experience in several other
specialities has demonstrated the usefulness and generality of the
approach. The system offers administrative procedures to generate
patient summaries and back up manual records, create graphical
flowcharts, and print lists of selected patients. As an educational
and research tool, the system provides ``information services,''
including tabulations, graphical illustrations, and statistical
analyses of medical variables. These services support patient care
decisions by analysis of stored clinical experience. By increasing the
information available to practicing physicians, medical specially
databanks may reinforce clinical practice sufficiently to allow
modular expansion into a hospital network." ,
bibdate    =    "Mon Feb  2 13:05:57 1987" ,
owner    =    "manning" ,
)

@article    ( WHANG83,
key    =    "Whang et al." ,
author    =    "Whang, K." ,
title    =    "Estimating Block Accesses in Database
Organizations: A Closed Noniterative Formula" ,
journal    =    "cacm" ,
volume    =    "26" ,
number    =    "11" ,
month    =    "nov" ,
year    =    "1983" ,
pages    =    "940--944" ,
bibdate    =    "Sat Apr 27 00:18:15 1985" ,
)

@article    ( WHANG84,
key    =    "Whang et al." ,
author    =    "Whang, K. and Wiederhold, G. and Sagalowicz, D." ,
title    =    "Separability - An Approach to Physical Database
Design" ,
journal    =    "tse" ,
volume    =    "33" ,
number    =    "3" ,
month    =    "mar" ,
year    =    "1984" ,
pages    =    "209--222" ,
bibdate    =    "Fri May 24 15:43:46 1985" ,
)

@article    ( WHANG90,
key    =    "Whang \& Krishnamurthy" ,
author    =    "Whang, K and Krishnamurthy, R." ,
title    =    "Query Optimization in a Memory-Resident Domain
Relational Calculus Database System" ,
journal    =    "tods" ,
volume    =    "15" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1990" ,
pages    =    "67--95" ,
keywords=    "CPU-intensive cost model; database query language;
domain relational calculus; example element; memory-resident database;
query optimization" ,
abstract=    "We present techniques for optimizing queries in
memory-resident database systems. Optimization techniques in
memory-resident database systems differ significantly from those in
conventional disk-resident database systems. In this paper we address
the following aspects of query optimization in such systems and
present specific solutions for them; (1) a new approach to developing
a CPU-intensive cost model; (2) new optimization strategies for
main-memory query processing; (3) new insight into join algorithms and
access structures that take advantage of memory residency of data; and
(4) the effect of the operating system's scheduling algorithm on the
memory-redident database assumption. We present an interesting result
that a mojor cost of processing queries in memory-resident database
systems is incurred by evaluation of predicates. We discuss
optimization techniques using the Office-by-Example (OBE) that has
been under development at IBM Research. We also present the results of
performance measurements, which prove to be excellent in the current
state of the art. Despite recent work on memory-resident database
systems, query optimization aspects in these systems have not been
well studied. We believe this paper opens the issure of query
optimization in memory-resident database systems and presents
practical solutions to them." ,
bibdate    =    "Tue Apr 10 13:52:32 1990" ,
owner    =    "robyn" ,
)

@inproceedings    ( WHITE92,
key    =    "White \& Dewitt" ,
author    =    "White, S.J. and Dewitt, D.J." ,
title    =    "A Performance Study of Alternative Object Faulting
and Pointer Swizzling Strategies" ,
booktitle=    "vldb" ,
year    =    "1992" ,
abstract=    "This paper presents a portable, efficient method
for accessing memory resident persistent objects in virtual memory in
the context of the E programming language. Under the approach, objects
are copied from the buffer pool of the underlying object manager into
virtual memory on demand, as they are accessed by an E program. The
cumulative effects of updates to a persistent object are then
propagated back to the object manager via a single write operation at
the end of each transaction. The method incorporates a comprehensive
pointer swizzling mechanism to enhance performance. Swizzling is done
a-pointer-at-a-time and software checks are used to detect the use of
swizzled pointers. The paper also presents the results of a
performance study comparing the method presented here with several
alternative software architectures including ObjectStore V1.2, a
commercially available OODBMS. The results highlight the tradeoffs
between providing software vs. memory-mapped support for pointer
swizzling and quantify the effects of pointer swizzling on overall
performance. In addition, the significant performance impact of
pointer swizzling on the generation of recovery information is
examined. The experimental results show that in many situations a
software approach can outperform the memory-mapped approach." ,
bibdate    =    "Mon Oct 19 00:45:03 1992" ,
owner    =    "leoso" ,
)

@phdthesis    ( WHITE94,
key    =    "White" ,
author    =    "White, Seth J." ,
title    =    "Pointer Swizzling Techniques for Object-Oriented
Database Systems" ,
school    =    "University of Wisconsin, Madison" ,
address    =    "Madison, WI" ,
month    =    "sep" ,
year    =    "1994" ,
number    =    "1242" ,
abstract=    "In this thesis, we examine a technique that has
come to be known as pointer swizzling and whose aim improve the
performance of object-oriented database management systems (OODBMSs)
while accessing persistent objects that have been cached in main
memory. It is crucial that OODBMSs provide high-performance when
accessing in-memory data, since the applications that OODBMSs must
support. i.e. CAD, CASE, GIS, and multimedia, are computationally very
intensive. Pointer swizzling improves performance by converting
pointers from their disk format (an object identifier) to a more
efficient in-memory format (a direct memory address) when objects are
faulted into memory by the OODBMS. The thesis presents an in-depth
analysis of the performance of several different approaches to pointer
swizzling, including several schemes that perform software-based
swizzling. The thesis also presents the design of a memory-mapped
storage manager, QuickStore, which provides full support for pointer
swizzling using standard virtual memory hardware. The performance
results presented in the thesis give an accurate and comprehensive
picture of the differences in performance between software and
hardware-based swizzling techniques. An issue that is closely related
to pointer swizzling, and which appears several times in the thesis,
is that of providing recovery services in an OODBMS. Implementing
recovery in an OODBMS poses new challenges due to the tight
integration between the application programming language used to
access the database and the database system itself. In addition, the
characteristics of the applications that OODBMSs must support, and the
use of a client-server architecture, both add new performance issues.
In the thesis we study several alternative ways of performing recovery
in the context of an OODBMS that also provides full support for
pointer swizzling. The results concerning recovery show that using
differencing to generate log records for updates at the client
workstations is generally superior in terms of performance to logging
whole pages. The differencing approach is better because it takes
advantage of the aggregate CPU power available at the clients to
lessen the overall burden placed on the server to support recovery.
This provides much better scalability, as it prevents the server from
becoming a performance bottleneck as quickly when the number of
clients accessing the database increases." ,
bibdate    =    "Fri Sep  1 15:19:15 1995" ,
owner    =    "jeff" ,
)

@proceedings    ( WIDOM95A,
key    =    "Widom" ,
title    =    "IEEE Data Engineering Special Issue on
Materialized Views and Data Warehousing" ,
publisher=    "IEEE Data Engineering" ,
editor    =    "Widom, Jennifer" ,
year    =    "1995" ,
month    =    "Jun" ,
bibdate    =    "Thu Nov  9 20:16:19 1995" ,
owner    =    "bib" ,
)

@inproceedings    ( WIEBE86,
key    =    "Wiebe" ,
author    =    "Weibe, D." ,
title    =    "A Distributed Repository for Immutable Persistent
Objects" ,
booktitle=    "Proceedings of the Conference on Object-Oriented
Programming Systems, Languages and Applications" ,
organization=    "ACM" ,
address    =    "Portland, OR" ,
editor    =    "Meyrowitz, N." ,
volume    =    "21" ,
month    =    "nov" ,
year    =    "1986" ,
pages    =    "453--465" ,
abstract=    "Jasmine is an object-oriented system for
programming-in-the-large. Jasmine describes software using system
model objects. These objects are persistent (they have lifetimes of
days or decades) and immutable (since system models act as historical
records). This paper describes JStore, a distributed, replicated
repository for system model objects. JStore provides robust,
transactional, write-once storage. Designs are presented for the
serialization, location, and replication of objects. Description
procedures serialize objects for network transmission and permanent
storage. An expanding ring multicast search algorithm locates saved
objects. JStore replicates objects using a lazy replication algorithm
built on top of the location mechanism. Decision procedures determine
the replication policy used at each storage site." ,
bibdate    =    "Mon Nov 10 12:12:53 1986" ,
owner    =    "manning" ,
)

@inproceedings    ( WIEDERHOLD75,
key    =    "Wiederhold et al." ,
author    =    "Wiederhold, G. and Fries, J.F. and Weyl, S." ,
title    =    "Structured Organization of Clinical Data Bases" ,
booktitle=    "ncc" ,
organization=    "AFIPS" ,
year    =    "1975" ,
pages    =    "479--485" ,
bibdate    =    "Sat Oct  1 15:39:18 1983" ,
)

@book        ( WIEDERHOLD81,
key    =    "Wiederhold" ,
author    =    "Wiederhold, G." ,
title    =    "Databases for Health Care" ,
publisher=    "Springer-Verlag" ,
address    =    "New York, NY" ,
year    =    "1981" ,
bibdate    =    "Sat Oct  1 15:49:32 1983" ,
)

@article    ( WIEDERHOLD84,
key    =    "Wiederhold" ,
author    =    "Wiederhold, G." ,
title    =    "Databases" ,
journal    =    "Computer" ,
publisher=    "ieee" ,
volume    =    "17" ,
number    =    "10" ,
month    =    "oct" ,
year    =    "1984" ,
pages    =    "211--223" ,
bibdate    =    "Wed Sep  2 13:11:55 1987" ,
owner    =    "manning" ,
)

@article    ( WIEDERHOLD86,
key    =    "Wiederhold" ,
author    =    "Wiederhold, G." ,
title    =    "Views, Objects, and Databases" ,
journal    =    "Computer" ,
publisher=    "IEEE" ,
volume    =    "19" ,
number    =    "12" ,
month    =    "dec" ,
year    =    "1986" ,
pages    =    "37--44" ,
bibdate    =    "Thu Jan  8 11:36:24 1987" ,
owner    =    "manning" ,
)

@article    ( WIERINGA89,
key    =    "Wieringa et al." ,
author    =    "Wieringa, R. and Meyer, J.-J. and Weigand, H." ,
title    =    "Specifying Dynamic and Deontic Integrity
Constraints" ,
journal    =    "Data and Knowledge Engineering, North-Holland" ,
year    =    "1989" ,
volume    =    "4" ,
number    =    "2" ,
pages    =    "157--189" ,
month    =    "" ,
)

@article    ( WILKINSON90,
key    =    "Wilkinson et al." ,
author    =    "Wilkinson, K. and Lyngb\ae{}k, P. and Hasan, W." ,
title    =    "The Iris Architecture and Implementation" ,
journal    =    "tkde" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1990" ,
pages    =    "63--75" ,
keywords=    "Database management, extensible systems,
functional data model, objeect-oriented databases, query processing,
rule-based query optimization, semantic data model." ,
abstract=    "The Iris database management system is a research
prototype being developed at Hewlett-Packard Laboratories. Its goals
are to enhance database programmer productivity and to provide
generalized database support for the integration of future application
Iris objects are typed, but, unlike other object systems, Iris objects
contain no state. Attribute values, relationships, and behavior of
objects are modeled by functions. The Iris architecture efficiently
supports the evaluation of functional expressions. The goal of the
architecture is to provide a database system that is powerful enough
to support the definition of functions and procedures that implement
the semantics of the data model. This paper provides an overview of
the data model, describes the architecture in detail, and discusses
our implementation experience and usage of the system." ,
bibdate    =    "Sun Aug  4 14:33:04 1991" ,
owner    =    "bib" ,
)

@article    ( WILSON87,
key    =    "Wilson" ,
author    =    "Wilson, P." ,
title    =    "Information Modeling" ,
journal    =    "IEEE Computer Graphics and Applications" ,
pages    =    "65--67" ,
publisher=    "IEEE" ,
month    =    "dec" ,
year    =    1987 ,
annote    =    " The concepts of local information models the TIM
and IPIM discussed in the 1989 paper are briefly reviewed here." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( WILSON87A,
key    =    "Wilson" ,
author    =    "Wilson, P." ,
title    =    "A Short History of CAD Data Transfer Standards" ,
journal    =    "IEEE Computer Graphics and Applications" ,
pages    =    "64--67" ,
publisher=    "IEEE" ,
month    =    "jun" ,
year    =    1987 ,
annote    =    "This is a good overview of the development of
exchange standards in CAD. It covers several projects: AIS, IGES, XBF,
ESP-IGES, PDDI, VDAFS, and PDES. It contains a very good diagram of
the history/interaction of these systems." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( WILSON87B,
key    =    "Wilson" ,
author    =    "Wilson, P." ,
title    =    "Information and/or Data" ,
journal    =    "IEEE Computer Graphics and Applications" ,
pages    =    "58--61" ,
publisher=    "IEEE" ,
month    =    "nov" ,
year    =    1987 ,
annote    =    "Generally discusses the difference between
Information and Data, Information it is said is represented by Data in
a computer file. He uses the analogy of a dictionary, the word is the
data, but it can convey several different meanings. A good quote is
'whether PDES should be viewed more from the database or file transfer
perspective is still open to debate.'" ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@article    ( WILSON89A,
key    =    "Wilson" ,
author    =    "Wilson, P." ,
title    =    "{\it PDES STEP's\/} Forward" ,
journal    =    "IEEE Computer Graphics and Applications" ,
pages    =    "79--80" ,
publisher=    "IEEE" ,
month    =    "mar" ,
year    =    1989 ,
annote    =    "The integration of PDES and STEP is discussed.
Most importantly four different levels of exchange are discussed.
File, Working Form, Database, and Knowledge-Base exchange are compared
and contrasted." ,
bibdate    =    "Mon Apr  1 15:20:41 1991" ,
owner    =    "curtis" ,
)

@inproceedings    ( WOELK86,
key    =    "Woelk et al." ,
author    =    "Woelk, D. and Kim, W. and Luther, W." ,
title    =    "An Object-Oriented Approach to Multimedia
Databases" ,
booktitle=    "sigmod" ,
publisher=    "ACM" ,
editor    =    "Zaniolo, C." ,
month    =    "may" ,
year    =    "1986" ,
pages    =    "311--325" ,
address    =    "Washington, DC" ,
abstract=    "This paper identifies data modelling and data
access and sharing requirements which multimedia applications impose
on a database system. It shows the capabilities of an object-based
data model and indicates extensions which are needed to meet the data
modelling aspects of these requirements. A logical implementation of
the operations on the model is described. The model generalizes the
notions of instantiation and generalization in the standard
object-oriented paradigm, and augments it with the notions of
aggregation and relationships which are specialized for a muitmedia
application environment. Objects may exist in aggregation hieratchies
which provide the capability to integrate diverse types of multimedia
information, such as text, sound, bit-mapped images, and complex
graphics drawings. Objects may also be linked through other
user-defined relationships to capture such application functions as
voice annotation and referencing of one document by another. Using
this model, the semantics of aggregation and relationship s in a
multimedia application environment can be understood and efficiently
supported by a database system." ,
bibdate    =    "Thu May  7 11:23:39 1987" ,
owner    =    "rts" ,
)

@inproceedings    ( WOELK87,
key    =    "Woelk \& Kim" ,
author    =    "Woelk, D. and Kim, W." ,
title    =    "Multimedia Information Management in an
Object-Oriented Database System" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
year    =    "1987" ,
pages    =    "319--329" ,
abstract=    "This paper describes the implementation of the
Multimedia Information Manager (MIM) in the ORION object-oriented
database system which is operational at MCC. We describe design
objectives and implementation techniques that have satisfied the
design objectives. Our design objectives include extensibility,
flexibility and efficiency in supporting the capture, storage, and
presentation of many types of multimedia information. We have achieved
extensibility by providing an object-oriented framework for multimedia
information management. The framework consists of definitions of class
hierarchies and a message passing protocol for not only the multimedia
capture, storage, and presentation devices, but also the captured and
stored multimedia objects. Both the class hierarchies and the protocol
may be easily extended and/or modified by system developers and end
users as they see fit. We have satisfied flexibility by supporting a
variety of ways in which the end users may control the capture and
presentation of multimedia information. Our implementation has
achieved storage efficiency by using a technique for sharing storage
blocks among multiple versions of a multimedia object, while achieving
data transfer performance by directly interfacing the MIM to certain
low level components of the ORION storage subsystem." ,
bibdate    =    "Fri Jan 19 09:56:03 1990" ,
owner    =    "robyn" ,
)

@techreport    ( WOLF92,
key    =    "Wolf" ,
author    =    "Wolf, A. L." ,
title    =    "Design of an Object Database Management System
Library" ,
institution=    "bell" ,
address    =    "Murray Hill, New Jersey" ,
year    =    "1992" ,
pages    =    "29" ,
abstract=    "Object database systems are emerging as a popular
and significant foundation system for applications. Therefore, the
form of interface to an object database is critical. There appear to
be two primary approaches to the design of the interface: the language
approach, in which the interface is provided by and embedded within a
new or modified programming language, and the library approach, in
which the interface is provided through a library of procedural and
data abstractions. This paper presents the design of an object
database system interface, called Persi, that employs the library
approach. The fundamental models of typing, computation, persistence,
access, transactions, and memory underlying Persi are discussed. The
library interface itself is then described, followed by a discussion
of the advantages and disadvantages of the approach and plans for
future work. A prototype of the interface has been evolving and
successfully used within a variety of applications for the past
several years." ,
bibdate    =    "Wed Jan 27 04:42:00 1993" ,
owner    =    "bassili" ,
)

@article    ( WOLFSON87,
key    =    "Wolfson" ,
author    =    "Wolfson, O." ,
title    =    "The Overhead of Locking-and Commit- Protocols in
Distributed Databases" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "12" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1987" ,
pages    =    "453--471" ,
keywords=    "Algorithms; performance; theory; commit protocols;
computer network; concurrency control; database locking; deadlock;
locking protocols; message passing; transaction" ,
abstract=    "The main purpose of a locking protocol is to
ensure correct interleaving of actions executed by concurrent
transactions. The locking protocol consists of a set of rules
dictating how accessed entities should be locked and unlocked. As a
result of obeying the rules, transactions in a distributed database
incur an overhead. We propose three measures of evaluating this
overhead, each most suitable to a different type of underlying
communication network. Then using a graph theoretic model, we analyze
and compare three protocols according to each measure: two-phase
locking, two-phase locking with a fixed order imposed on the database
entities-ensuring deadlock freedom- and the tree protocol. In
practice, a transaction also executes the two-phase commit protocol in
orer to guarantee atomicity. Therefore, the combined overhead of each
locking protocol and the two-phase commit protocol is also determined." ,
bibdate    =    "Mon Nov 16 10:31:46 1987" ,
owner    =    "manning" ,
)

@article    ( WONG76A,
key    =    "Wong \& Youssefi" ,
author    =    "Wong, E. and Youssefi, K." ,
title    =    "Decomposition - A Strategy for Query Processing" ,
journal    =    "tods" ,
volume    =    "1" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1976" ,
pages    =    "223--241" ,
keywords=    "relational database, query processing,
decomposition, tuple substitution, detachment, joining (overlapping)
variable, irreducible query, connected query, variable selection" ,
abstract=    "Strategy for processing multivariable queries in
the database management system INGRES is considered. The general
procedure is to decompose the query into a sequence of one-variable
queries by alternating between (a) reduction: breaking off components
of the query which are joined to it by a single variable, and (b)
tuple substitution: substituting for one of the variables a tuple at a
time. Algorithms for reduction and for choosing the variable to be
substituted are given. In most cases the latter decision depends on
estimation of costs; heuristic procedures for making such estimates
are outlined." ,
bibdate    =    "Fri Sep  4 19:43:28 1987" ,
owner    =    "mckenzie" ,
)

@article    ( WONG77A,
key    =    "Wong \& Edelberg" ,
author    =    "Wong, K. and Edelberg, M." ,
title    =    "Interval Hierarchies and Their Application to
Predicate Files" ,
journal    =    "tods" ,
volume    =    "2" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1977" ,
pages    =    "223--232" ,
bibdate    =    "Sat Apr 27 22:37:05 1985" ,
)

@article    ( WONG77B,
key    =    "Wong" ,
author    =    "Wong, E." ,
title    =    "Two Views of Data Semantics: A Survey of Data
Models in Artificial Intelligence and Database Management" ,
journal    =    "a" ,
year    =    "1977" ,
bibdate    =    "Thu Jan  5 12:33:54 1984" ,
)

@article    ( WOO85,
key    =    "Woo \& Lochovsky" ,
author    =    "Woo, C. C. and Lochovsky, F. H." ,
title    =    "An Object-Based Approach to Modelling Office Work" ,
journal    =    "Database Engineering. Special Issue on
Object-Oriented Systems" ,
year    =    "1985" ,
volume    =    "8" ,
number    =    "4" ,
pages    =    "14--22" ,
month    =    "December" ,
)

@techreport    ( WOODFILL81,
key    =    "Woodfill et al." ,
author    =    "Woodfill and Siegel and Ranstrom and Meyer and
Allman, E." ,
title    =    "INGRES Version 7 Reference Manual" ,
number    =    "M81/61" ,
institution=    "Electronics Research Lab" ,
address    =    "University of California, Berkeley, CA" ,
year    =    "1981" ,
bibdate    =    "Mon Nov  2 10:42:29 1987" ,
owner    =    "manning" ,
)

@manual        ( WOODFILL81A,
key    =    "Woodfill et al." ,
title    =    "Ingres Reference Manual" ,
edition    =    "Version 7" ,
year    =    "1981" ,
author    =    "Woodfill, J. and Siegal, P. and Ranstrom, J. and
Meyer, M. and Allman, E." ,
bibdate    =    "Mon Nov 18 14:21:58 1985" ,
)

@article    ( WU92,
key    =    "Wu \& Ichikawa" ,
author    =    "Wu, X. and Ichikawa, T." ,
title    =    "KDA: A Knowledge-Based Database Assistant with a
Query Guiding Facility" ,
journal    =    "tdke" ,
publisher=    "ieee" ,
volume    =    "4" ,
number    =    "5" ,
month    =    "oct" ,
year    =    "1992" ,
pages    =    "443--453" ,
keywords=    "Database query system; intelligent database front
end; knowledge-based system; natural language query system; semantic
network model; user interface" ,
bibdate    =    "Tue Jan 19 13:22:55 1993" ,
owner    =    "bassili" ,
)

@article    ( WUTHRICH95,
key    =    "Wuthrich" ,
author    =    "Wuthrich, B." ,
title    =    "Probabilistic Knowledge Bases" ,
journal    =    "tkde" ,
publisher=    "ieee" ,
volume    =    "7" ,
number    =    "5" ,
month    =    "oct" ,
year    =    "1995" ,
pages    =    "691--698" ,
bibdate    =    "Wed Nov 22 13:37:28 1995" ,
abstract=    "We define a new fixpoint semantics for rule-based
reasoning in the presence of weighted information. The semantics is
illustrated on a real-world application requiring such reasoning.
Optimizations and approximations of the semantics are shown so as to
make the semantics amenable to very large scale real-world
applications. We finally prove that the semantics is probabilistic and
reduces to the usual fixpoint semantics of stratified Datalog if all
information is certain. We implemented various knowledge discovery
systems which automatically generate such probabilistic decision
rules. In collaboration with a bank in Hong Kong we use one such
system to forecast currency exchange rates." ,
owner    =    "jeff" ,
)

@book        ( XOPEN92,
key    =    "OMG \& Xopen" ,
author    =    "OMG and Xopen" ,
title    =    "The Common Object Request Broker: Architecture and
Specification" ,
publisher=    "Object Management Group and X/Open" ,
address    =    "Framingham, MA and Reading Berkshire, UK" ,
year    =    "1992" ,
bibdate    =    "Mon Oct  5 19:32:55 1992" ,
owner    =    "leoso" ,
)

@article    ( YAN94,
key    =    "Yan \& Garcia-Molina" ,
author    =    "Yan, Tak W. and Garcia-Molina, Hector" ,
title    =    "Index Structures for Selective Dissemination of
Information Under the Boolean Model" ,
journal    =    "tods" ,
publisher=    "acm" ,
volume    =    "19" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1994" ,
pages    =    "332--364" ,
abstract=    "The number, size, and user population of
bibliographic and full-text document databases are rapidly growing.
With a high document arrival rate, it becomes essential for users of
such databases to have access to the very latest documents; yet the
high document arrival rate also makes it difficult for users to keep
themselves updated. It is desirable to allow users to submit profiles,
i.e., queries that are constantly evluated, so that they will be
automatically informed of new additions that may be of interest. Such
service is traditionally called Selective Dissemination of Information
(SDI). The high document arrival rate, the huge number of users, and
the timeliness requirement of the service poses a challenge in
achieving efficient SDI. In this article, we propose several index
structures for indexing profiles and algorithms that efficiently match
documents against large number of profiles. We also present analysis
and simulation results to compare their performance under different
scenarios." ,
bibdate    =    "Wed Sep 21 13:59:03 1994" ,
owner    =    "kevin" ,
)

@inproceedings    ( YANG87,
key    =    "Yang \& Larson" ,
author    =    "Yang, H.Z. and Larson, P.-A." ,
title    =    "Query Transformation for PSJ-queries" ,
booktitle=    "vldb" ,
address    =    "Brighton, England" ,
editor    =    "Hammersley, P." ,
month    =    "sep" ,
year    =    "1987" ,
pages    =    "245--254" ,
abstract=    "Consider a database containing not only base
relations but also derived relations (also called materialized or
concrete views). Relation fragments in a distributed database, view
indexes, and intermediate results obtained during query processing are
all examples of derived relations. The query transformation problem is
then the following: Given a query (or a subquery), can it be computed
from the available set of derived relations, and if so, how? We have
solved the query transformation problem for the case when both the
query and the derived relations are defined by PSJ-expressions, that
is, relational algebra expressions containing only projects, selects,
and joins. This paper gives an overview of the underlying theory,
shows how to reduce the number of attribute mappings to be considered,
and presents a prototype system for query transformation." ,
bibdate    =    "Thu Apr 28 17:54:51 1988" ,
owner    =    "" ,
)

@techreport    ( YANG87A,
key    =    "Yang" ,
author    =    "Yang, H." ,
title    =    "Query transformation" ,
institution=    "University of Waterloo" ,
year    =    "1987" ,
bibdate    =    "Tue Nov  7 15:33:10 1989" ,
owner    =    "robyn" ,
)

@article    ( YANNAKOUDAKIS89,
key    =    "Yannakoudakis \& Cheng" ,
author    =    "Yannakoudakis, E. J., C. P. Cheng" ,
title    =    "A domain-oriented approach to Improve the
User-friendliness of SQL" ,
journal    =    "comput. Stand. interfaces (Netherlands)" ,
volume    =    "9" ,
number    =    "2" ,
year    =    "1989" ,
pages    =    "p127 -- 141" ,
bibdate    =    "Sat Mar 23 21:04:11 1991" ,
owner    =    "suchen" ,
)

@inproceedings    ( YAO75B,
key    =    "Yao \& Merten" ,
author    =    "Yao, S. and Merten, A." ,
title    =    "Selection Of File Organization Using An Analytic
Model" ,
booktitle=    "vldb" ,
month    =    "sep" ,
year    =    "1975" ,
pages    =    "255--267" ,
bibdate    =    "Sun May 19 21:21:18 1985" ,
)

@article    ( YAO77A,
key    =    "Yao" ,
author    =    "Yao, S." ,
title    =    "An Attribute Based Model for Database Access Cost
Analysis" ,
journal    =    "tods" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1977" ,
pages    =    "45--67" ,
bibdate    =    "Tue Apr 23 22:41:43 1985" ,
)

@article    ( YAO77B,
key    =    "Yao" ,
author    =    "Yao, S." ,
title    =    "Approximating Block Accesses in Database
Organizations" ,
journal    =    "cacm" ,
volume    =    "20" ,
number    =    "4" ,
month    =    "apr" ,
year    =    "1977" ,
pages    =    "260--261" ,
bibdate    =    "Fri Apr 26 23:41:44 1985" ,
)

@inproceedings    ( YAO78,
key    =    "Yao \& DeJong" ,
author    =    "Yao, S. and Dejong, D." ,
title    =    "Evaluation of Database Access Paths" ,
booktitle=    "sigmod" ,
volume    =    "8" ,
year    =    "1978" ,
pages    =    "66--77" ,
bibdate    =    "Fri May  3 17:23:09 1985" ,
)

@article    ( YAO79,
key    =    "Yao" ,
author    =    "Yao, S.B." ,
title    =    "Optimization of Query Evaluation Algorithms" ,
journal    =    "tods" ,
volume    =    "4" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1979" ,
pages    =    "133--155" ,
annote    =    "A model of database storage and access is
presented, and generalized access cost equations are developed and
analyzed. Optimization can be implemented effectively and efficiently,
without heuristics, using this model." ,
bibdate    =    "Wed Dec 29 19:56:08 1982" ,
)

@article    ( YEN93,
key    =    "Yen \& Scamell" ,
author    =    "Yen, M.~Y. and Scamell, R.~W." ,
title    =    "A Human Factors Experimental Comparison of SQL and
QBE" ,
journal    =    "tse" ,
publisher=    "ieee" ,
volume    =    "19" ,
number    =    "4" ,
month    =    "apr" ,
year    =    "1993" ,
pages    =    "390--409" ,
keywords=    "Controlled laboratory experimentation; human
factors; query language; query language comparison; user performance;
user satisfaction" ,
abstract=    "Critical success factors dictate that query
language be 1) easy to learn, 2) easy to understand, and 3) easy to
use. Although a query language may influence the user's behavior by
its syntax, it is unrealistic to evaluate a query language without
considering the influence of its interactive user interface features.
In addition, in order to allow for a fair comparison of query
languages, the languages should be 1) directed toward the same type of
users, 2) used in a similar system environment, and 3) use the same
DBMS. This research focuses its attention on comparing SQL and QBE in
the same operating environment and studying the effects of query
language type and other variables on user performance and
satisfaction. The experimental design combined a factorial design and
a counterbalanced design in query language type affects user
performance in paper and pencil contrast, in on-line testing, query
language type had no effect on user performance. In addition, under
certain conditions, query complexity had a significant effect on user
performance and user satisfaction was influenced by query language
type. Moreover, order of exposure impacted user performance on the
basis of its interaction with query language type, query complexity,
and programming experience." ,
bibdate    =    "Sun Nov 28 14:26:22 1993" ,
owner    =    "daisyc" ,
)

@article    ( YOUN89A,
key    =    "Youn et al." ,
author    =    "Youn, C. and Kim, H.J. and Henschen, L. and Han,
J." ,
title    =    "Classification and Compilation of Linear Recursive
Formulas in Deductive Databases" ,
journal    =    "tokde" ,
publisher=    "ieee" ,
year    =    "1989" ,
annote    =    "Submitted" ,
abstract=    "In this paper, we present a graph model which is
powerful in classifying and compiling linear recursive formulas in
deductive databases. The graph model consists of two kinds of graph:
I-graph and Resolution Graph. We can extract essential properties of a
recursive formula from its I-graph and can easily figure out the
compiled formula and the query evalution plan of the recursive
formulas from its resolution graph. We demonstrate that based on the
graph model all the linear recursive formulas can be classified into
several classes and each class shares some common characteristics in
query compilation and query processing. The compiled formulas and the
correponding query evaluation plans can be derived based on the study
of the compilation of each class. We also show that our methodology
using the graph model can be extended to cover linear recursive
formulas having repeated variables." ,
bibdate    =    "Fri Mar 31 14:06:49 1989" ,
owner    =    "payne" ,
)

@manual        ( YOUSSEFI77,
key    =    "Youssefi et al." ,
title    =    "INGRES Reference Manual" ,
edition    =    "6" ,
year    =    "1977" ,
author    =    "Youssefi, K. and Whyte, N. and Ubell, M. and Ries,
D. and Hawthorn, P.; Epstein, B.; Berman, R.; Allman, E." ,
organization=    "Electronics Research Lab., University of
California" ,
address    =    "Berkeley, California" ,
bibdate    =    "Thu Feb 16 21:35:11 1984" ,
)

@article    ( YU78,
key    =    "Yu et al." ,
author    =    "Yu, C. and Luk, W. and Siu, M." ,
title    =    "On the Estimation of the Number of Desired Records
with Respect to a Given Query" ,
journal    =    "tods" ,
volume    =    "3" ,
number    =    "1" ,
month    =    "mar" ,
year    =    "1978" ,
pages    =    "41--56" ,
bibdate    =    "Sat Apr 27 22:39:07 1985" ,
)

@inproceedings    ( YU85,
key    =    "Yu \& Chen" ,
author    =    "Yu, C.T. and Chen, C.H." ,
title    =    "Adaptive Information System Design One Query At A
Time" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
editor    =    "Navathe, S." ,
address    =    "Austin, TX" ,
month    =    "may" ,
year    =    "1985" ,
pages    =    "280--290" ,
bibdate    =    "Tue Jun 11 13:43:22 1985" ,
)

@article    ( YU89,
key    =    "Yu \& Sun" ,
author    =    "Yu, C.T. and Sun, W." ,
title    =    "Automatic Knowledge Acquisition and Maintenance
for Semantic Query Optimization" ,
journal    =    "IEEE Transactions on Data and Knowledge
Engineering" ,
volume    =    "1" ,
number    =    "3" ,
month    =    "sep" ,
year    =    "1989" ,
pages    =    "362--375" ,
keywords=    "Automatic knowledge acquisition; database systems;
inference and deduction; integrity constraints; knowledge base;
knowledge base maintenance; semantic knowledge; semantic query
optimization" ,
abstract=    "We present an approach to acquire knowledge from
previously processed queries. By using newly acquired knowledge
together with given semantic knowledge, it is possible to make the
query processor and/or optimizer more intelligent so that future
queries can be processed more efficiently. The acquired knowledge is
in the form of constraints. While some constraints are to be enforced
for all database states, others are known to be valid for the current
state of the database. The former constraints are static integrity
constraints, while the latter are called dynamic integrity
constraints. In this paper, some situations in which certain dynamic
integrity constraints can be automatically extracted are identified.
This automatic tool for knowledge acquisition can also be used as an
interactive tool for identifying potential static integrity
constraints. The concept of minimal knowledge base is introduced and a
method to maintain the knowledge base is presented. An algorithm to
compute the restriction (selection) closure, that is, all deducible
restrictions, from a given set of restrictions, join predicates (as
given in a query), and constraints is given." ,
bibdate    =    "Fri Dec  8 14:07:11 1989" ,
owner    =    "robyn" ,
)

@inproceedings    ( YU90,
key    =    "Yu \& Liu" ,
author    =    "Yu, Clement and Liu, Chengwen" ,
title    =    "Experiences with Distributed Query Processing " ,
booktitle=    "Proceedings of the Sixth International Conference
on Data Engineering" ,
year    =    "1990" ,
pages    =    "192--199" ,
month    =    "February" ,
)

@article    ( YU93,
key    =    "Yu \& Cornell" ,
author    =    "Yu, P. S. and Cornell, D. W." ,
title    =    "Buffer Management Based on Return on Consumption
in a Multi-Query Environment" ,
journal    =    "The VLDB Journal" ,
publisher=    "VLDB Endowment" ,
volume    =    "2" ,
number    =    "1" ,
month    =    "jan" ,
year    =    "1993" ,
pages    =    "1--38" ,
keywords=    "Buffer management; Query optimization; simulated
annealing; join methods; queueing model; simulation" ,
abstract=    "In a multi-query environment, the marginal
utilities of allocating additional buffer to the various queries can
be vastly different. The conventional approach examines each query in
isolation to determine the optimal access plan and the corresponding
locality set. This can lead to performance that is far from optimal.
As each query can have different access plans with dissimilar locality
sets and sensitivities to memory requirement, we employ the concepts
of memory consumption and return on consumption (ROC) as the basis for
memory allocations. Memory consumptions of a query is its space-time
product, while ROC is a measure of the effectiveness of response-time
reduction through additional memory consumption. A global optimization
strategy using simulated annealing is developed, which minimizes the
average response over all queries under the constraint that the total
memory consumption rate has to be less than the buffer size. It
selects the optimal join method and memory allocation for all query
types simultaneously. By analyzing the way the optimal strategy makes
memory allocations, a heuristic threshold strategy is then proposed.
The threshold strategy is based on the concept of ROC. As the memory
consumption rate by all queries is limited by the buffer size, the
strategy tries to allocate the memory so as to make sure that a
certain level of ROC is achieved. A simulation model is developed to
demonstrate that the heuristic strategy yields performance that is
very close to the optimal strategy and is far superior to the
conventional allocation strategy." ,
bibdate    =    "Tue Mar  9 20:51:35 1993" ,
owner    =    "bassili" ,
)

@inproceedings    ( YUEN86,
key    =    "Yuen \& Du" ,
author    =    "Yuen, T.S. and Du, H.C." ,
title    =    "Dynamic File Organizations for Partial Match
Retrieval Based on Linear Hashing" ,
booktitle=    "Proceedings of the International Conference on
Data Engineering" ,
organization=    "IEEE Computer Society" ,
publisher=    "IEEE Computer Society Press" ,
address    =    "Los Angeles, CA" ,
month    =    "feb" ,
year    =    "1986" ,
pages    =    "116--123" ,
keywords=    "Database management; physical design; information
storage and retrieval; file organization" ,
abstract=    "Two new file organizations based on Linear Hashing
are proposed for partial match retrieval. The first organization
introduces a load-balancing scheme whereby overflow records are stored
temporarily in other primary buckets so that the allocation of
overflow buckets are deferred. The second organization defers the
physical splitting of underflow buckets can be retrieved together.
These two techniques are then combined together to form a new
variation of Linear Hashing. Compared with the original scheme, the
performance of these organizations for partial match retrieval are
improved, both in terms of storage utiliztion and retrieval time." ,
bibdate    =    "Mon Aug 10 14:21:09 1987" ,
owner    =    "manning" ,
)

@phdthesis    ( ZANIOLO76,
key    =    "Zaniolo" ,
author    =    "Zaniolo, C." ,
title    =    "Analysis and Design of Relational Schemata for
Database Systems" ,
school    =    "UCLA" ,
month    =    "jul" ,
year    =    "1976" ,
bibdate    =    "Thu Jul 23 17:26:21 1992" ,
owner    =    "soo" ,
)

@inproceedings    ( ZANIOLO83,
key    =    "Zaniolo" ,
author    =    "Zaniolo, C." ,
title    =    "The Database Language GEM" ,
booktitle=    "sigmod" ,
organization=    "acm" ,
address    =    "San Jose, CA" ,
month    =    "May" ,
year    =    "1983" ,
pages    =    "207--218" ,
abstract=    "GEM (an acronym for General Entity Manipulator) is
a general-purpose query and update language for the DSIS data model,
which is a semantic data model of the Entity-Relationship type. GEM is
designed as an easy-to-use extension of the relational language QUEL,
providing support for the notions of entities with surrogates,
aggregation, generalization, null values, and set-valued attributes." ,
bibdate    =    "Sat Jan 21 12:31:24 1984" ,
)

@inproceedings    ( ZDONIK86B,
key    =    "Zdonik" ,
author    =    "Zdonik, S.B." ,
title    =    "Version Management in an Object-Oriented Database" ,
booktitle=    "Proceedings of the International Workshop on
Advanced Programming Environments" ,
organization=    "IFIP WG2.4" ,
address    =    "Trondheim, Norway" ,
month    =    "jun" ,
year    =    "1986" ,
pages    =    "397--416" ,
abstract=    "We describe a database system that includes a
built-in version control mechanism that can be used in the definition
of any new object types. This database system is object-oriented in
the sense that it supports data abstraction, object types, and
inheritance. We show how this version control mechanism can be used to
manage change in the definition of a system. In particular, we show
how versions of type defining objects serve to maintain consistent
behavior of objects as the system evolves over time. We also show how
the system can use other information such as the component-of
relationship to propagate changes to the appropriate places. The
version mechanism is also used to control consistency during the
process of design. The notions of consistency surface, design step,
and slice are introduced. The version mechanism also gives us a way of
potentially tolerating more concurrency than in conventional systems." ,
bibdate    =    "Thu Nov 20 11:01:48 1986" ,
owner    =    "manning" ,
)

@inbook        ( ZDONIK88,
key    =    "Zdonik \& Wegner" ,
author    =    "Zdonik, S. B. and Wegner, P." ,
title    =    "Language and Methodology for Object-Oriented
Database Environments" ,
booktitle=    "Data Types and Persistence" ,
publisher=    "Springer-Verlag" ,
year    =    "1988" ,
chapter    =    "11" ,
pages    =    "155--171" ,
abstract=    "This paper describes an object-oriented database
language being implemented at Brown for use on workstations, and
demonstrates its use in defining an object-oriented programming
environment. The database language is illustrated by specifications of
the UNIX file system, Ada packages, program structure, and multiple
views of program modules. Each example illustrates a different feature
of object-oriented programming methodology. Collectively the examples
serve both as an introduction to our database language and as a
tutorial for object-oriented system programming." ,
bibdate    =    "Mon Nov  6 15:50:41 1989" ,
owner    =    "robyn" ,
)

@article    ( ZHOU95A,
key    =    "Zhou et al." ,
author    =    "Zhou, Gang and Hull, Richard and King, Roger and
Francitti, Jean-Claude" ,
title    =    "Supporting Data Integration and Warehousing Using
H2O" ,
journal    =    "IEEE Data Engineering" ,
volume    =    "18" ,
number    =    "2" ,
month    =    "jun" ,
year    =    "1995" ,
pages    =    "29--40" ,
bibdate    =    "Thu Nov  9 17:45:52 1995" ,
owner    =    "bib" ,
)

@incollection    ( ZILLES84,
key    =    "Zilles" ,
author    =    "Stephen N. Zilles" ,
title    =    "A Programming Language Perspective" ,
booktitle=    "On Conceptual Modelling" ,
publisher=    "Springer Verlag" ,
year    =    "1984" ,
editor    =    "Michael J. Brodie and John Mylopoulos and Joachim
W. Schmidt" ,
chapter    =    "19" ,
pages    =    "459--460" ,
)

@inproceedings    ( ZLOOF75,
key    =    "Zloof" ,
author    =    "Zloof, M." ,
title    =    "Query By Example" ,
booktitle=    "Proceedings of the National Computer Conference" ,
organization=    "AFIPS" ,
volume    =    "44" ,
year    =    "1975" ,
bibdate    =    "Mon Jul  6 15:28:33 1992" ,
owner    =    "rts" ,
)

@techreport    ( ZOU95,
key    =    "Zou et al." ,
author    =    "Zou, C. and Salzberg, B. and Ladin, R." ,
title    =    "Back to the Future: Dynamic Hierarchical
Clustering" ,
number    =    "4" ,
institution=    "University of Stuttgart, Germany" ,
year    =    "1995" ,
pages    =    "23" ,
bibdate    =    "Wed Dec 13 13:15:08 1995" ,
abstract=    "We describe a new method for dynamically
clustering hierarchical data which maintains good clustering in the
presence of insertions and deletions. This method, which we call Enc,
encodes the insertion order of children with respect to their parents
and concatenates the insertion numbers to form a compact key for the
data. We compare Enc with some more traditional approaches and show in
what circumstances Enc is effective. Our analysis is based on
simulations using queries derived from the 007 benchmark. Our results
show that our dynamic hierarchical storage method is very efficient
for hierarchical queries and performs reasonably well for random
access queries. Thus, using our method, hierarchical relationships
between objects can be better supported in relational databases and in
object-oriented databases." ,
owner    =    "jeff" ,
)

@Comment (BIBSETS
)