%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "2.45",
%%% date = "01 March 2012",
%%% time = "16:49:36 MST",
%%% filename = "tods.bib",
%%% address = "University of Utah
%%% Department of Mathematics, 110 LCB
%%% 155 S 1400 E RM 233
%%% Salt Lake City, UT 84112-0090
%%% USA",
%%% telephone = "+1 801 581 5254",
%%% FAX = "+1 801 581 4148",
%%% URL = "http://www.math.utah.edu/~beebe",
%%% checksum = "20381 38164 202785 2016225",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "bibliography, BibTeX, database systems,
%%% TODS",
%%% license = "public domain",
%%% supported = "yes",
%%% docstring = "This is a COMPLETE BibTeX bibliography for
%%% ACM Transactions on Database Systems (TODS)
%%% (CODEN ATDSD3, ISSN 0362-5915 (print),
%%% 1557-4644 (electronic)), which began
%%% publishing in March 1976.
%%%
%%% The companion bibliography pods.bib covers
%%% the ACM SIGACT-SIGMOD Symposia on
%%% Principles of Database Systems, and the
%%% companion bibliography vldb.bib covers the
%%% International Conferences on Very Large
%%% Data Bases. The companion bibliography
%%% sigmod.bib covers the ACM Special Interest
%%% Group on Management of Data SIGMOD Record
%%% newsletter.
%%%
%%% The journal has a World Wide Web site at
%%%
%%% http://www.acm.org/tods/
%%% http://www.acm.org/pubs/contents/journals/tods/
%%% http://portal.acm.org/browse_dl.cfm?idx=J777
%%%
%%% At version 2.45, the year coverage looked
%%% like this:
%%%
%%% 1975 ( 1) 1988 ( 18) 2001 ( 12)
%%% 1976 ( 20) 1989 ( 23) 2002 ( 11)
%%% 1977 ( 23) 1990 ( 22) 2003 ( 15)
%%% 1978 ( 21) 1991 ( 24) 2004 ( 22)
%%% 1979 ( 27) 1992 ( 20) 2005 ( 29)
%%% 1980 ( 25) 1993 ( 20) 2006 ( 38)
%%% 1981 ( 30) 1994 ( 17) 2007 ( 30)
%%% 1982 ( 31) 1995 ( 13) 2008 ( 31)
%%% 1983 ( 30) 1996 ( 14) 2009 ( 25)
%%% 1984 ( 32) 1997 ( 14) 2010 ( 29)
%%% 1985 ( 25) 1998 ( 14) 2011 ( 27)
%%% 1986 ( 25) 1999 ( 13) 2012 ( 7)
%%% 1987 ( 25) 2000 ( 12)
%%% 19xx ( 2)
%%%
%%% Article: 808
%%% Book: 3
%%% InProceedings: 1
%%% Proceedings: 5
%%%
%%% Total entries: 817
%%%
%%% This bibliography was initially built from
%%% searches in the OCLC Content1st database.
%%% Additions were then made from all of the
%%% bibliographies in the TeX User Group
%%% collection, from bibliographies in the
%%% author's personal files, from the IEEE
%%% INSPEC CD-ROM database (1989--1995), from
%%% the Compendex database, from the American
%%% Mathematical Society MathSciNet database,
%%% and from the computer science bibliography
%%% collection on ftp.ira.uka.de in
%%% /pub/bibliography to which many people of
%%% have contributed. The snapshot of this
%%% collection was taken on 5-May-1994, and it
%%% consists of 441 BibTeX files, 2,672,675
%%% lines, 205,289 entries, and 6,375
%%% <at>String{} abbreviations, occupying
%%% 94.8MB of disk space. Missing data in many
%%% entries were supplied after consulting
%%% original journal issues.
%%%
%%% Numerous errors in the sources noted above
%%% have been corrected. Spelling has been
%%% verified with the UNIX spell and GNU ispell
%%% programs using the exception dictionary
%%% stored in the companion file with extension
%%% .sok.
%%%
%%% BibTeX citation tags are uniformly chosen as
%%% name:year:abbrev, where name is the family
%%% name of the first author or editor, year is a
%%% 4-digit number, and abbrev is a 3-letter
%%% condensation of important title words.
%%% Citation labels were automatically generated
%%% by software developed for the BibNet Project.
%%%
%%% In this bibliography, entries are sorted in
%%% publication order, with the help of
%%% ``bibsort -byvolume''. The bibsort utility
%%% is available from ftp.math.utah.edu in
%%% /pub/tex/bib.
%%%
%%% The checksum field above contains a CRC-16
%%% checksum as the first value, followed by the
%%% equivalent of the standard UNIX wc (word
%%% count) utility output of lines, words, and
%%% characters. This is produced by Robert
%%% Solovay's checksum utility.",
%%% }
%%% ====================================================================
@Preamble{
"\hyphenation{ }"
}
%%% ====================================================================
%%% Acknowledgement abbreviations:
@String{ack-nhfb = "Nelson H. F. Beebe,
University of Utah,
Department of Mathematics, 110 LCB,
155 S 1400 E RM 233,
Salt Lake City, UT 84112-0090, USA,
Tel: +1 801 581 5254,
FAX: +1 801 581 4148,
e-mail: \path|beebe@math.utah.edu|,
\path|beebe@acm.org|,
\path|beebe@computer.org| (Internet),
URL: \path|http://www.math.utah.edu/~beebe/|"}
%%% ====================================================================
%%% Journal abbreviations:
@String{j-CACM = "Communications of the ACM"}
@String{j-TODS = "ACM Transactions on Database Systems"}
%%% ====================================================================
%%% Publishers and their addresses:
@String{pub-ACM = "ACM Press"}
@String{pub-ACM:adr = "New York, NY 10036, USA"}
@String{pub-IEEE = "IEEE Computer Society Press"}
@String{pub-IEEE:adr = "1109 Spring Street, Suite 300, Silver
Spring, MD 20910, USA"}
@String{pub-MORGAN-KAUFMANN = "Morgan Kaufmann Publishers"}
@String{pub-MORGAN-KAUFMANN:adr = "Los Altos, CA 94022, USA"}
%%% ====================================================================
%%% Bibliography entries:
@Article{Yao:1977:ABA,
author = "S. B. Yao",
title = "Approximating Block Accesses in Database
Organization",
journal = j-CACM,
volume = "20",
number = "4",
pages = "260--261",
month = apr,
year = "1977",
CODEN = "CACMA2",
ISSN = "0001-0782 (print), 1557-7317 (electronic)",
bibdate = "Tue Sep 20 23:14:33 1994",
bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib
and
ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in \cite{Yao:1977:ABM}.",
fjournal = "Communications of the ACM",
keywords = "selectivity estimation I/O cost query optimization
CACM",
}
@Article{Hsiao:1976:ATD,
author = "David K. Hsiao",
title = "{ACM Transactions on Database Systems}: aim and
scope",
journal = j-TODS,
volume = "1",
number = "1",
pages = "1--2",
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-1/p1-hsiao/p1-hsiao.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-1/p1-hsiao/",
abstract = "Record-keeping and decision-making in industry and
government are increasingly based on data stored in
computer processable databases. Thus the need for
improved computer technology for building, managing,
and using these databases is clearly evident. This need
is particularly acute in a complex society where the
interrelationships among various aspects of the society
must be identified and represented. The data which must
be used to represent these relationships are growing
more complex in nature and becoming greater in size.
Furthermore, the increasing on-line use of computer
systems and the proliferation and mass introduction of
multilevel secondary storage suggests that future
computer systems will be primarily oriented toward
database management. The large size of future on-line
databases will require the computer system to manage
local as well as physical resources. The management of
logical resources is concerned with the organization,
access, update, storage, and sharing of the data and
programs in the database. In addition, the sharing of
data means that the database system must be capable of
providing privacy protection and of controlling access
to the users' data. The term {\em data\/} is
interpreted broadly to include textual, numeric, and
signal data as well as data found in structured
records.\par
The aim of {\em ACM Transactions on Database Systems\/}
(TODS) is to serve as a focal point for an integrated
dissemination of database research and development on
storage and processor hardware, system software,
applications, information science, information
analysis, and file management. These areas are
particularly relevant to the following ACM Special
Interest Groups: Business Data Processing (SIGBDP),
Information Retrieval (SIGIR), and Management of Data
(SIGMOD). TODS will also embrace parts of the
Management/Database Systems and the Information
Retrieval and Language Processing sections of {\em
Communications of the ACM}.\par
High quality papers on all aspects of computer database
systems will be published in TODS. The scope of TODS
emphasizes data structures; storage organization; data
collection and dissemination; search and retrieval
strategies; update strategies; access control
techniques; data integrity; security and protection;
design and implementation of database software;
database related languages including data description
languages, query languages, and procedural and
nonprocedural data manipulation languages; language
processing; analysis and classification of data;
database utilities; data translation techniques;
distributed database problems and techniques; database
recovery and restart; database restructuring; adaptive
data structures; concurrent access techniques; database
computer hardware architecture; performance and
evaluation; intelligent front ends; and related
subjects such as privacy and economic issues.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
subject = "Information Systems --- Database Management ---
Systems (H.2.4)",
}
@Article{Chen:1976:ERM,
author = "Peter Pin-Shan S. Chen",
title = "The Entity-Relationship Model: Toward a Unified View
of Data",
journal = j-TODS,
volume = "1",
number = "1",
pages = "9--36",
month = mar,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compiler/prog.lang.theory.bib; Database/Graefe.bib;
Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/; Misc/is.bib;
Object/Nierstrasz.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Reprinted in \cite{Stonebraker:1988:RDS}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-1/p9-chen/p9-chen.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-1/p9-chen/",
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.\par
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.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "Data Base Task Group; data definition and
manipulation; data integrity and consistency; data
models; database design; dblit; entity set model;
entity-relationship; entity-relationship model; logical
view of data; network model; relational model;
semantics of data; TODS",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases}",
}
@Article{Bayer:1976:EST,
author = "R. Bayer and J. K. Metzger",
title = "On the Encipherment of Search Trees and Random Access
Files",
journal = j-TODS,
volume = "1",
number = "1",
pages = "37--52",
month = mar,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in \cite[p.~508--510]{Kerr:1975:PIC}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-1/p37-bayer/p37-bayer.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-1/p37-bayer/",
abstract = "The securing of information in indexed, random access
files by means of privacy transformations must be
considered as a problem distinct from that for
sequential files. Not only must processing overhead due
to encrypting be considered, but also threats to
encipherment arising from updating and the file
structure itself must be countered. A general
encipherment scheme is proposed for files maintained in
a paged structure in secondary storage. This is applied
to the encipherment of indexes organized as $B$-trees;
a $B$-tree is a particular type of multiway search
tree. Threats to the encipherment of $B$-trees,
especially relating to updating, are examined, and
countermeasures are proposed for each. In addition, the
effect of encipherment on file access and update, on
paging mechanisms, and on files related to the
enciphered index are discussed. Many of the concepts
presented may be readily transferred to other forms of
multiway index trees and to binary search trees.",
acknowledgement = ack-nhfb,
annote = "Trees versus hashing as his 1974 IFIP paper?",
fjournal = "ACM Transactions on Database Systems",
keywords = "",
subject = "Software --- Operating Systems --- Security and
Protection (D.4.6): {\bf Access controls}; Software ---
Operating Systems --- Security and Protection (D.4.6):
{\bf Cryptographic controls}",
}
@Article{Lin:1976:DRA,
author = "Chyuan Shiun Lin and Diane C. P. Smith and John Miles
Smith",
title = "The design of a rotating associative memory for
relational database applications",
journal = j-TODS,
volume = "1",
number = "1",
pages = "53--65",
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-1/p53-lin/p53-lin.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-1/p53-lin/",
abstract = "The design and motivation for a rotating associative
relational store (RARES) is described. RARES is
designed to enhance the performance of an optimizing
relational query interface by supporting important high
level optimization techniques. In particular, it can
perform tuple selection operations at the storage
device and also can provide a mechanism for efficient
sorting. Like other designs for rotating associative
stores, RARES contains search logic which is attached
to the heads of a rotating head-per-track storage
device. RARES is distinct from other designs in that it
utilizes a novel ``orthogonal'' storage layout. This
layout allows a high output rate of selected tuples
even when a sort order in the stored relation must be
preserved. As in certain other designs, RARES can
usually output a tuple as soon as it is found to
satisfy the selection criteria. However, relative to
these designs, the orthogonal layout allows an order of
magnitude reduction in the capacity of storage local to
the search logic.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "associative memory; content addressability; data
organization; head-per-track disks; memory systems;
relational database; rotating devices; search logic;
sorting technique",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases}",
}
@Article{Mahmoud:1976:OAR,
author = "Samy Mahmoud and J. S. Riordon",
title = "Optimal Allocation of Resources in Distributed
Information Networks",
journal = j-TODS,
volume = "1",
number = "1",
pages = "66--78",
month = mar,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-1/p66-mahmoud/p66-mahmoud.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-1/p66-mahmoud/",
abstract = "The problems of file allocation and capacity
assignment in a fixed topology distributed computer
network are examined. These two aspects of the design
are tightly coupled by means of an average message
delay constraint. The objective is to allocate copies
of information files to network nodes and capacities to
network links so that a minimum cost is achieved
subject to network delay and file availability
constraints. A model for solving the problem is
formulated and the resulting optimization problem is
shown to fall into a class of nonlinear integer
programming problems. Deterministic techniques for
solving this class of problems are computationally
cumbersome, even for small size problems. A new
heuristic algorithm is developed, which is based on a
decomposition technique that greatly reduces the
computational complexity of the problem. Numerical
results for a variety of network configurations
indicate that the heuristic algorithm, while not
theoretically convergent, yields practicable low cost
solutions with substantial savings in computer
processing time and storage requirements. Moreover, it
is shown that this algorithm is capable of solving
realistic network problems whose solutions using
deterministic techniques are computationally
intractable.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "data files; distributed computed; information
networks; link capacities; resource sharing",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2)",
}
@Article{Stemple:1976:DMF,
author = "David W. Stemple",
title = "A Database Management Facility for Automatic
Generation of Database Managers",
journal = j-TODS,
volume = "1",
number = "1",
pages = "79--94",
month = mar,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in \cite[p.~252]{Kerr:1975:PIC}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-1/p79-stemple/p79-stemple.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-1/p79-stemple/",
abstract = "A facility is described for the implementation of
database management systems having high degrees of {\em
horizontal\/} data independence, i.e. independence from
chosen logical properties of a database as opposed to
{\em vertical\/} independence from storage structures.
The facility consists of a high level language for the
specification of virtual database managers, a compiler
from this language to a pseudomachine language, and an
interpreter for the pseudomachine language.\par
It is shown how this facility can be used to produce
efficient database management systems with any degree
of both horizontal and vertical data independence. Two
key features of this tool are the compilation of
tailored database managers from individual schemas and
multiple levels of optional binding.",
acknowledgement = ack-nhfb,
annote = "Describes SLUSH and SLIM, a proposed compiler and
interpreter to operate on network schemas with
adjustable binding times.",
fjournal = "ACM Transactions on Database Systems",
keywords = "data independence; database management systems",
subject = "Information Systems --- Database Management ---
Systems (H.2.4); Information Systems --- Database
Management (H.2); Software --- Operating Systems ---
Systems Programs and Utilities (D.4.9): {\bf make}",
}
@Article{Astrahan:1976:SRR,
author = "M. M. Astrahan and M. W. Blasgen and D. D. Chamberlin
and K. P. Eswaran and J. N. Gray and P. P. Griffiths
and W. F. King and R. A. Lorie and P. R. McJones and J.
W. Mehl and G. R. Putzolu and I. L. Traiger and B. W.
Wade and V. Watson",
title = "{System R}: {A} Relational Approach to Database
Management",
journal = j-TODS,
volume = "1",
number = "2",
pages = "97--137",
month = jun,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/; Object/Nierstrasz.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: IBM, San Jose, Research Report.
No. RJ-1738, Feb. 1976. Reprinted in
\cite{Stonebraker:1988:RDS}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-2/p97-astrahan/p97-astrahan.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-2/p97-astrahan/",
abstract = "System R is a database management system which
provides a high level relational data interface. The
systems provides a high level of data independence by
isolating the end user as much as possible from
underlying storage structures. The system permits
definition of a variety of relational views on common
underlying data. Data control features are provided,
including authorization, integrity assertions,
triggered transactions, a logging and recovery
subsystem, and facilities for maintaining data
consistency in a shared-update environment.\par
This paper contains a description of the overall
architecture and design of the system. At the present
time the system is being implemented and the design
evaluated. We emphasize that System R is a vehicle for
research in database architecture, and is not planned
as a product.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "authorization; data structures; database; dblit; index
structures; locking; nonprocedural language; recovery;
relational model; TODS relation database IBM San Jose",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf System R}; Information Systems
--- Database Management --- Systems (H.2.4): {\bf
Relational databases}; Information Systems --- Database
Management (H.2)",
}
@Article{Navathe:1976:RLD,
author = "Shamkant B. Navathe and James P. Fry",
title = "Restructuring for Large Data Bases: Three Levels of
Abstraction",
journal = j-TODS,
volume = "1",
number = "2",
pages = "138--158",
month = mar,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in \cite[p.~174]{Kerr:1975:PIC}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-2/p138-navathe/p138-navathe.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-2/p138-navathe/",
abstract = "The development of a powerful restructuring function
involves two important components--the unambiguous
specification of the restructuring operations 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.\par
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.\par
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.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "data definition; data translation; database; database
management systems; logical restructuring",
subject = "Information Systems --- Database Management (H.2);
Information Systems --- Database Management ---
Heterogeneous Databases (H.2.5): {\bf Data
translation**}",
}
@Article{Yao:1976:DDR,
author = "S. B. Yao and K. S. Das and T. J. Teorey",
title = "A Dynamic Database Reorganization Algorithm",
journal = j-TODS,
volume = "1",
number = "2",
pages = "159--174",
month = jun,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: Purdue Un., TR-168, Nov. 1975.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-2/p159-yao/p159-yao.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-2/p159-yao/",
abstract = "Reorganization is necessary in some databases for
overcoming the performance deterioration caused by
updates. The paper presents a dynamic reorganization
algorithm which makes the reorganization decision by
measuring the database search costs. Previously, the
reorganization intervals could only be determined for
linear deterioration and known database lifetime. It is
shown that the dynamic reorganization algorithm is near
optimum for constant reorganization cost and is
superior for increasing reorganization cost. In
addition, it can be applied to cases of unknown
database lifetime and nonlinear performance
deterioration. The simplicity, generality, and
efficiency appear to make this good heuristic for
database reorganization.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "database; file organization; information retrieval;
reorganization",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}; Information Systems --- Information
Storage and Retrieval --- Information Search and
Retrieval (H.3.3): {\bf Retrieval models}",
}
@Article{Burkhard:1976:HTA,
author = "Walter A. Burkhard",
title = "Hashing and Trie Algorithms for Partial-Match
Retrieval",
journal = j-TODS,
volume = "1",
number = "2",
pages = "175--187",
month = jun,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Wiederhold.bib; Graphics/siggraph/76.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: UCSD, Appl. Physics and Inf. Sc,
CS TR.2, Jun. 1975.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-2/p175-burkhard/p175-burkhard.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-2/p175-burkhard/",
abstract = "File designs suitable for retrieval from a file of
$k$-letter words when queries may be only partially
specified are examined. A new class of partial match
file designs (called PMF designs) based upon hash
coding and trie search algorithms which provide good
worst-case performance is introduced. Upper bounds on
the worst-case performance of these designs are given
along with examples of files achieving the bound. Other
instances of PMF designs are known to have better
worst-case performances. The implementation of the file
designs with associated retrieval algorithms is
considered. The amount of storage required is
essentially that required of the records themselves.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "algorithms; analysis; associative retrieval; hash
coding; partial match; retrieval; searching; trie
search",
oldlabel = "geom-96",
subject = "Mathematics of Computing --- Mathematical Software
(G.4): {\bf Algorithm design and analysis}; Information
Systems --- Information Storage and Retrieval ---
Information Search and Retrieval (H.3.3): {\bf
Retrieval models}",
}
@Article{Stonebraker:1976:DII,
author = "Michael Stonebraker and Eugene Wong and Peter Kreps
and Gerald Held",
title = "The Design and Implementation of {INGRES}",
journal = j-TODS,
volume = "1",
number = "3",
pages = "189--222",
month = sep,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/; Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Reprinted in \cite{Stonebraker:1988:RDS}. Also
published in/as: UCB, Elec. Res. Lab, Memo No.
ERL-M577, Jan. 1976.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-3/p189-stonebraker/p189-stonebraker.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-3/p189-stonebraker/",
abstract = "The currently operational (March 1976) version of the
INGRES database management system is described. This
multiuser system gives a relational view of data,
supports two high level nonprocedural data
sublanguages, and runs as a collection of user
processes on top of the UNIX operating system for
Digital Equipment Corporation PDP 11/40, 11/45, and
11/70 computers. Emphasis is on the design decisions
and tradeoffs related to (1) structuring the system
into processes, (2) embedding one command language in a
general purpose programming language, (3) the
algorithms implemented to process interactions, (4) the
access methods implemented, (5) the concurrency and
recovery control currently provided, and (6) the data
structures used for system catalogs and the role of the
database administrator.\par
Also discussed are (1) support for integrity
constraints (which is only partly operational), (2) the
not yet supported features concerning views and
protection, and (3) future plans concerning the
system.",
acknowledgement = ack-nhfb,
annote = "Describes implementation of INGRES, a non-distributed
relational database system. This paper is useful for
understanding the distributed INGRES paper.",
fjournal = "ACM Transactions on Database Systems",
keywords = "concurrency; data integrity; data organization; data
sublanguage; database optimization; nonprocedural
language; protection; QUEL EQUEL query modification
process structure Halloween problem TODS; query
decomposition; query language; relational database",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management ---
Languages (H.2.3); Information Systems --- Database
Management --- General (H.2.0): {\bf Security,
integrity, and protection**}",
}
@Article{Wong:1976:DSQ,
author = "Eugene Wong and Karel Youssefi",
title = "Decomposition --- {A} Strategy for Query Processing",
journal = j-TODS,
volume = "1",
number = "3",
pages = "223--241",
month = sep,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: UCB, Elec. Res. Lab, Memo No.
ERL-574, Jan. 1976;",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-3/p223-wong/p223-wong.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-3/p223-wong/",
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.",
acknowledgement = ack-nhfb,
annote = "INGRES query decomposition by reduction to single
variable queries, and tuple substitution --- choosing a
variable and for it from all tuples, generating a
family of queries in one fewer variable.",
fjournal = "ACM Transactions on Database Systems",
keywords = "connected query; decomposition; detachment; Ingres
TODS; irreducible query; joining (overlapping)
variable; query processing; relational database; tuple
substitution; variable selection",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Query processing}",
}
@Article{Griffiths:1976:AMR,
author = "Patricia P. Griffiths and Bradford W. Wade",
title = "An Authorization Mechanism for a Relational Database
System",
journal = j-TODS,
volume = "1",
number = "3",
pages = "242--255",
month = sep,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-3/p242-griffiths/p242-griffiths.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-3/p242-griffiths/",
abstract = "A multiuser database system must selectively permit
users to share data, while retaining the ability to
restrict data access. There must be a mechanism to
provide protection and security, permitting information
to be accessed only by properly authorized users.
Further, when tables or restricted views of tables are
created and destroyed dynamically, the granting,
authentication, and revocation of authorization to use
them must also be dynamic. Each of these issues and
their solutions in the context of the relational
database management system System R are discussed.
\par
When a database user creates a table, he is fully and
solely authorized to perform upon it actions such as
read, insert, update, and delete. He may explicitly
grant to any other user any or all of his privileges on
the table. In addition he may specify that that user is
authorized to further grant these privileges to still
other users. The result is a directed graph of granted
privileges originating from the table creator.\par
At some later time a user A may revoke some or all of
the privileges which he previously granted to another
user B. This action usually revokes the entire subgraph
of the grants originating from A's grant to B. It may
be, however, that B will still possess the revoked
privileges by means of a grant from another user C, and
therefore some or all of B's grants should not be
revoked. This problem is discussed in detail, and an
algorithm for detecting exactly which of B's grants
should be revoked is presented.",
acknowledgement = ack-nhfb,
annote = "Defines a dynamic authorization mechanism. A database
user can grant or revoke privileges (such as to read,
insert, or delete) on a file that he has created.
Furthermore, he can authorize others to grant these
same privileges. The database management system keeps
track of a directed graph, emanating from the creator
of granted privileges.",
fjournal = "ACM Transactions on Database Systems",
keywords = "access control; authorization; data dependent
authorization; database systems; privacy; protection in
databases; revocation of authorization; security",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management --- Systems
(H.2.4); Information Systems --- Database Management
--- General (H.2.0): {\bf Security, integrity, and
protection**}",
}
@Article{Severance:1976:DFT,
author = "Dennis G. Severance and Guy M. Lohman",
title = "Differential Files: Their Application to the
Maintenance of Large Databases",
journal = j-TODS,
volume = "1",
number = "3",
pages = "256--267",
month = sep,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-3/p256-severance/p256-severance.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-3/p256-severance/",
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.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "backup and recovery; data sharing; database
maintenance; differential files",
subject = "Information Systems --- Database Management (H.2);
Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}",
}
@Article{Shneiderman:1976:BSS,
author = "Ben Shneiderman and Victor Goodman",
title = "Batched Searching of Sequential and Tree Structured
Files",
journal = j-TODS,
volume = "1",
number = "3",
pages = "268--275",
month = sep,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "See comments in \cite{Piwowarski:1985:CBS}. Also
published in/as: Indiana Un., CSD Tech. Ref. 0132.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-3/p268-shneiderman/p268-shneiderman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-3/p268-shneiderman/",
abstract = "The technique of batching searches has been ignored in
the context of disk based online data retrieval
systems. This paper suggests that batching be
reconsidered for such systems since the potential
reduction in processor demand may actually reduce
response time. An analysis with sample numerical
results and algorithms is presented.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}; Information Systems --- Information
Storage and Retrieval (H.3)",
}
@Article{Bernstein:1976:STN,
author = "Philip A. Bernstein",
title = "Synthesizing Third Normal Form Relations from
Functional Dependencies",
journal = j-TODS,
volume = "1",
number = "4",
pages = "277--298",
month = dec,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Wiederhold.bib; Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-4/p277-bernstein/p277-bernstein.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-4/p277-bernstein/",
abstract = "It has been proposed that the description of a
relational database can be formulated as a set of
functional relationships among database attributes.
These functional relationships can then be used to
synthesize algorithmically a relational scheme. It is
the purpose of this paper to present an effective
procedure for performing such a synthesis. The schema
that results from this procedure is proved to be in
Codd's third normal form and to contain the fewest
possible number of relations. Problems with earlier
attempts to construct such a procedure are also
discussed.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "database schema; functional dependency; relational
model; semantics of data; third normal form",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Normal forms}; Information
Systems --- Database Management --- Logical Design
(H.2.1): {\bf Schema and subschema}; Information
Systems --- Database Management --- Logical Design
(H.2.1): {\bf Data models}",
}
@Article{Liu:1976:APS,
author = "Jane W. S. Liu",
title = "Algorithms for parsing search queries in systems with
inverted file organization",
journal = j-TODS,
volume = "1",
number = "4",
pages = "299--316",
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-4/p299-liu/p299-liu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-4/p299-liu/",
abstract = "In an inverted file system a query is in the form of a
Boolean expression of index terms. In response to a
query the system accesses the inverted lists
corresponding to the index terms, merges them, and
selects from the merged list those records that satisfy
the search logic. Considered in this paper is the
problem of determining a Boolean expression which leads
to the minimum total merge time among all Boolean
expressions that are equivalent to the expression given
in the query. This problem is the same as finding an
optimal merge tree among all trees that realize the
truth function determined by the Boolean expression in
the query. Several algorithms are described which
generate optimal merge trees when the sizes of overlaps
between different lists are small compared with the
length of the lists.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "inverted file systems; merge algorithms; parsing
Boolean queries",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}; Mathematics of Computing ---
Mathematical Software (G.4): {\bf Algorithm design and
analysis}; Information Systems --- Database Management
--- Systems (H.2.4): {\bf Query processing}",
}
@Article{Sherman:1976:PDM,
author = "Stephen W. Sherman and Richard S. Brice",
title = "Performance of a Database Manager in a Virtual Memory
System",
journal = j-TODS,
volume = "1",
number = "4",
pages = "317--343",
month = dec,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-4/p317-sherman/p317-sherman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-4/p317-sherman/",
abstract = "Buffer space is created and managed in database
systems in order to reduce accesses to the I/O devices
for database information. In systems using virtual
memory any increase in the buffer space may be
accompanied by an increase in paging. The effects of
these factors on system performance are quantified
where system performance is a function of page faults
and database accesses to I/O devices. This phenomenon
is examined through the analysis of empirical data
gathered in a multifactor experiment. The factors
considered are memory size, size of buffer space,
memory replacement algorithm, and buffer management
algorithm. The improvement of system performance
through an increase in the size of the buffer space is
demonstrated. It is also shown that for certain values
of the other factors an increase in the size of the
buffer space can cause performance to deteriorate.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "buffer manager; Buffer operating system support TODS;
database management; double paging; page faults; page
replacement algorithm; performance; virtual buffer;
virtual memory",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Database Manager}; Mathematics of
Computing --- Mathematical Software (G.4): {\bf
Algorithm design and analysis}; Computer Systems
Organization --- Performance of Systems (C.4)",
}
@Article{Donovan:1976:DSA,
author = "John J. Donovan",
title = "Database System Approach to Management Decision
Support",
journal = j-TODS,
volume = "1",
number = "4",
pages = "344--369",
month = dec,
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-4/p344-donovan/p344-donovan.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-4/p344-donovan/",
abstract = "Traditional intuitive methods of decision-making are
no longer adequate to deal with the complex problems
faced by the modern policymaker. Thus systems must be
developed to provide the information and analysis
necessary for the decisions which must be made. These
systems are called decision support systems. Although
database systems provide a key ingredient to decision
support systems, the problems now facing the
policymaker are different from those problems to which
database systems have been applied in the past. The
problems are usually not known in advance, they are
constantly changing, and answers are needed quickly.
Hence additional technologies, methodologies, and
approaches must expand the traditional areas of
database and operating systems research (as well as
other software and hardware research) in order for them
to become truly effective in supporting policymakers.
\par
This paper describes recent work in this area and
indicates where future work is needed. Specifically the
paper discusses: (1) why there exists a vital need for
decision support systems; (2) examples from work in the
field of energy which make explicit the characteristics
which distinguish these decision support systems from
traditional operational and managerial systems; (3) how
an awareness of decision support systems has evolved,
including a brief review of work done by others and a
statement of the computational needs of decision
support systems which are consistent with contemporary
technology; (4) an approach which has been made to meet
many of these computational needs through the
development and implementation of a computational
facility, the Generalized Management Information System
(GMIS); and (5) the application of this computational
facility to a complex and important energy problem
facing New England in a typical study within the New
England Energy Management Information System (NEEMIS)
Project.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "database systems; decision support systems; management
applications; modeling; networking; relational; virtual
machines",
subject = "Information Systems --- Database Management (H.2);
Information Systems --- Database Management --- Systems
(H.2.4)",
}
@Article{McGee:1976:UCD,
author = "William C. McGee",
title = "On user criteria for data model evaluation",
journal = j-TODS,
volume = "1",
number = "4",
pages = "370--387",
year = "1976",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1976-1-4/p370-mcgee/p370-mcgee.pdf;
http://www.acm.org/pubs/citations/journals/tods/1976-1-4/p370-mcgee/",
abstract = "The emergence of a database technology in recent years
has focused interest on the subject of data models. A
data model is the class of logical data structures
which a computer system or language makes available to
the user for the purpose of formulating data processing
applications. The diversity of computer systems and
languages has resulted in a corresponding diversity of
data models, and has created a problem for the user in
selecting a data model which is in some sense
appropriate to a given application. An evaluation
procedure is needed which will allow the user to
evaluate alternative models in the context of a
specific set of applications. This paper takes a first
step toward such a procedure by identifying the
attributes of a data model which can be used as
criteria for evaluating the model. Two kinds of
criteria are presented: use criteria, which measure the
usability of the model; and implementation criteria,
which measure the implementability of the model and the
efficiency of the resulting implementation. The use of
the criteria is illustrated by applying them to three
specific models: an $n$-ary relational model, a
hierarchic model, and a network model.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "data model; data model evaluation; data model
selection; hierarchic model; network model; relational
model",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}",
}
@Article{Kam:1977:MSD,
author = "John B. Kam and Jeffrey D. Ullman",
title = "A Model of Statistical Databases and Their Security",
journal = j-TODS,
volume = "2",
number = "1",
pages = "1--10",
month = mar,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-1/p1-kam/p1-kam.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-1/p1-kam/",
abstract = "Considered here, for a particular model of databases
in which only information about relatively large sets
of records can be obtained, is the question of whether
one can from statistical information obtain information
about individuals. Under the assumption that the data
in the database is taken from arbitrary integers, it is
shown that essentially nothing can be inferred. It is
also shown that when the values are known to be
imprecise in some fixed range, one can often deduce the
values of individual records.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "compromisability; data security; linear independence;
statistical database; vector spece",
subject = "Information Systems --- Database Management ---
Database Applications (H.2.8): {\bf Statistical
databases}; Information Systems --- Database Management
--- General (H.2.0): {\bf Security, integrity, and
protection**}",
}
@Article{Bayer:1977:PBT,
author = "Rudolf Bayer and Karl Unterauer",
title = "Prefix {B}-trees",
journal = j-TODS,
volume = "2",
number = "1",
pages = "11--26",
month = mar,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: IBM Yorktwon, Technical Report
RJ1796, Jun. 1976.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-1/p11-bayer/p11-bayer.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-1/p11-bayer/",
abstract = "Two modifications of $B$-trees are described, simple
prefix $B$-trees and prefix $B$-trees. Both store only
parts of keys, namely prefixes, in the index part of a
$B$*-tree. In simple prefix $B$-trees those prefixes
are selected carefully to minimize their length. In
prefix $B$-trees the prefixes need not be fully stored,
but are reconstructed as the tree is searched. Prefix
$B$-trees are designed to combine some of the
advantages of $B$-trees, digital search trees, and key
compression techniques while reducing the processing
overhead of compression techniques.",
acknowledgement = ack-nhfb,
annote = "Index Btree structures can easily be compressed.",
fjournal = "ACM Transactions on Database Systems",
keywords = "truncation compression TODS",
subject = "Data --- Data Structures (E.1): {\bf Trees}",
}
@Article{Schkolnick:1977:CAH,
author = "Mario Schkolnick",
title = "A Clustering Algorithm for Hierarchical Structures",
journal = j-TODS,
volume = "2",
number = "1",
pages = "27--44",
month = may,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Dec 10 09:36:45 1996",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
annote = "Optimal file partitioning, applied to IMS.",
fjournal = "ACM Transactions on Database Systems",
}
@Article{Yao:1977:ABM,
author = "S. B. Yao",
title = "An Attribute Based Model for Database Access Cost
Analysis",
journal = j-TODS,
volume = "2",
number = "1",
pages = "45--67",
month = mar,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in \cite{Yao:1977:ABA}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-1/p45-yao/p45-yao.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-1/p45-yao/",
abstract = "A generalized model for physical database
organizations is presented. Existing database
organizations are shown to fit easily into the model as
special cases. Generalized access algorithms and cost
equations associated with the model are developed and
analyzed. The model provides a general design framework
in which the distinguishing properties of database
organizations are made explicit and their performances
can be compared.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "B-tree; database model; database organization;
database performance; estimation approximation TODS;
evaluation; index organization; index sequential;
inverted file; multilist",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1); Information Systems ---
Information Storage and Retrieval --- Content Analysis
and Indexing (H.3.1); Data --- Data Structures (E.1):
{\bf Trees}",
}
@Article{Anderson:1977:MCS,
author = "Henry D. Anderson and P. Bruce Berra",
title = "Minimum Cost Selection of Secondary Indexes for
Formatted Files",
journal = j-TODS,
volume = "2",
number = "1",
pages = "68--90",
month = mar,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/; Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-1/p68-anderson/p68-anderson.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-1/p68-anderson/",
abstract = "Secondary indexes are often used in database
management systems for secondary key retrieval.
Although their use can improve retrieval time
significantly, the cost of index maintenance and
storage increases the overhead of the file processing
application. The optimal set of indexed secondary keys
for a particular application depends on a number of
application dependent factors. In this paper a cost
function is developed for the evaluation of candidate
indexing choices and applied to the optimization of
index selection. Factors accounted for include file
size, the relative rates of retrieval and maintenance
and the distribution of retrieval and maintenance over
the candidate keys, index structure, and system
charging rates. Among the results demonstrated are the
increased effectiveness of secondary indexes for large
files, the effect of the relative rates of retrieval
and maintenance, the greater cost of allowing for
arbitrarily formulated queries, and the impact on cost
of the use of different index structures.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "access methods; access path; Boolean query; cost
function; data management; database; file design; file
organization; inverted file; inverted index;
maintenance; optimization; retrieval; secondary index;
secondary key; secondary key access",
subject = "Information Systems --- Information Storage and
Retrieval --- Content Analysis and Indexing (H.3.1):
{\bf Indexing methods}; Information Systems ---
Information Storage and Retrieval --- Information
Storage (H.3.2): {\bf File organization}; Information
Systems --- Database Management --- Physical Design
(H.2.2): {\bf Access methods}; Information Systems ---
Database Management (H.2)",
}
@Article{Lorie:1977:PIL,
author = "Raymond A. Lorie",
title = "Physical Integrity in a Large Segmented Database",
journal = j-TODS,
volume = "2",
number = "1",
pages = "91--104",
month = mar,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-1/p91-lorie/p91-lorie.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-1/p91-lorie/",
abstract = "A database system can generally be divided into three
major components. One component supports the logical
database as seen by the user. Another component maps
the information into physical records. The third
component, called the storage component, is responsible
for mapping these records onto auxiliary storage
(generally disks) and controlling their transfer to and
from main storage.\par
This paper is primarily concerned with the
implementation of a storage component. It considers a
simple and classical interface to the storage
component: Seen at this level the database is a
collection of segments. Each segment is a linear
address space.\par
A recovery scheme is first proposed for system failure
(hardware or software error which causes the contents
of main storage to be lost). It is based on maintaining
a dual mapping between pages and their location on
disk. One mapping represents the current state of a
segment being modified; the other represents a previous
backup state. At any time the backup state can be
replaced by the current state without any data merging.
Procedures for segment modification, save, and restore
are analyzed. Another section proposes a facility for
protection against damage to the auxiliary storage
itself. It is shown how such protection can be obtained
by copying on a tape (checkpoint) only those pages that
have been modified since the last checkpoint.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "checkpoint-restart; database; recovery; storage
management",
subject = "Information Systems --- Database Management ---
General (H.2.0): {\bf Security, integrity, and
protection**}; Information Systems --- Information
Storage and Retrieval --- Information Storage (H.3.2);
Information Systems --- Database Management ---
Physical Design (H.2.2): {\bf Recovery and restart}",
}
@Article{Smith:1977:DAA,
author = "John Miles Smith and Diane C. P. Smith",
title = "Database abstractions: Aggregation and
Generalization",
journal = j-TODS,
volume = "2",
number = "2",
pages = "105--133",
month = jun,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/; Object/Nierstrasz.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-2/p105-smith/p105-smith.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-2/p105-smith/",
abstract = "Two kinds of abstraction that are fundamentally
important in database design and usage are defined.
Aggregation is an abstraction which turns a
relationship between objects into an aggregate object.
Generalization is an abstraction which turns a class of
objects into a generic object. It is suggested that all
objects (individual, aggregate, generic) should be
given uniform treatment in models of the real world. A
new data type, called generic, is developed as a
primitive for defining such models. Models defined with
this primitive are structured as a set of aggregation
hierarchies intersecting with a set of generalization
hierarchies. Abstract objects occur at the points of
intersection. This high level structure provides a
discipline for the organization of relational
databases. In particular this discipline allows: (i) an
important class of views to be integrated and
maintained; (ii) stability of data and programs under
certain evolutionary changes; (iii) easier
understanding of complex models and more natural {\em
query formulation;\/} (iv) {\em a more systematic
approach to database design;\/} (v) {\em more
optimization\/} to be performed at lower implementation
levels. The generic type is formalized by a set of
invariant properties. These properties should be
satisfied by all relations in a database if
abstractions are to be preserved. A triggering
mechanism for automatically maintaining these
invariants during update operations is proposed. A
simple mapping of aggregation/generalization
hierarchies onto owner-coupled set structures is
given.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "aggregation; data abstraction; data model; data type;
database design; dblit data abstraction;
generalization; integrity constraints; knowledge
representation; relational database",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Information
Systems --- Database Management --- Systems (H.2.4):
{\bf Relational databases}; Software --- Software
Engineering --- Software Architectures (D.2.11): {\bf
Data abstraction}",
}
@Article{Shu:1977:EDE,
author = "N. C. Shu and B. C. Housel and R. W. Taylor and S. P.
Ghosh and V. Y. Lum",
title = "{EXPRESS}: a data {EXtraction, Processing, and
Restructuring System}",
journal = j-TODS,
volume = "2",
number = "2",
pages = "134--174",
month = jun,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-2/p134-shu/p134-shu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-2/p134-shu/",
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.\par
This paper describes the design and implementation of
EXPRESS. DEFINE and CONVERT are summarized and the
implementation architecture presented.\par
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.\par
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.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "data conversion; data description languages; data
manipulation languages; data restructuring; data
translation; file conversion; program generation; very
high level languages",
subject = "Information Systems --- Database Management ---
Heterogeneous Databases (H.2.5): {\bf Data
translation**}; Information Systems --- Information
Storage and Retrieval --- Information Storage (H.3.2):
{\bf File organization}; Information Systems ---
Database Management --- Languages (H.2.3)",
}
@Article{Ozkarahan:1977:PER,
author = "E. A. Ozkarahan and S. A. Schuster and K. C. Sevcik",
title = "Performance Evaluation of a Relational Associative
Processor",
journal = j-TODS,
volume = "2",
number = "2",
pages = "175--195",
month = jun,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-2/p175-ozkarahan/p175-ozkarahan.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-2/p175-ozkarahan/",
abstract = "An associative processor called RAP has been designed
to provide hardware support for the use and
manipulation of databases. RAP is particularly suited
for supporting relational databases. In this paper, the
relational operations provided by the RAP hardware are
described, and a representative approach to providing
the same relational operations with conventional
software and hardware is devised. Analytic models are
constructed for RAP and the conventional system. The
execution times of several of the operations are shown
to be vastly improved with RAP for large relations.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "associative processors; database machines; performance
evaluation; RAP hardware support database machine TODS;
relational databases",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases}; Hardware
--- Control Structures and Microprogramming --- Control
Structure Performance Analysis and Design Aids
(B.1.2)",
}
@Article{Brice:1977:EPD,
author = "Richard S. Brice and Stephen W. Sherman",
title = "An Extension on the Performance of a Database Manager
in a Virtual Memory System Using Partially Locked
Virtual Buffers",
journal = j-TODS,
volume = "2",
number = "2",
pages = "196--207",
month = jun,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-2/p196-brice/p196-brice.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-2/p196-brice/",
abstract = "Buffer pools are created and managed in database
systems in order to reduce the total number of accesses
to the I/O devices. In systems using virtual memory,
any reduction in I/O accesses may be accompanied by an
increase in paging. The effects of these factors on
system performance are quantified, where system
performance is a function of page faults and database
accesses to the I/O devices. A previous study of this
phenomenon is extended through the analysis of
empirical data gathered in a multifactor experiment. In
this study memory is partitioned between the program
and the buffer so that the impact of the controlled
factors can be more effectively evaluated. It is
possible to improve system performance through the use
of different paging algorithms in the program partition
and the buffer partition. Also, the effects on system
performance as the virtual buffer size is increased
beyond the real memory allocated to the buffer
partition are investigated.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "buffer manager; database management; double paging;
locked buffer; page faults; page replacement algorithm;
performance; pinning fixing TODS; virtual buffer;
virtual memory",
subject = "Hardware --- Control Structures and Microprogramming
--- Control Structure Performance Analysis and Design
Aids (B.1.2); Information Systems --- Database
Management --- Systems (H.2.4): {\bf Database
Manager}",
}
@Article{Lohman:1977:OPB,
author = "Guy M. Lohman and John A. Muckstadt",
title = "Optimal Policy for Batch Operations: Backup,
Checkpointing, Reorganization, and Updating",
journal = j-TODS,
volume = "2",
number = "3",
pages = "209--222",
month = sep,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-3/p209-lohman/p209-lohman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-3/p209-lohman/",
abstract = "Many database maintenance operations are performed
periodically in batches, even in realtime systems. The
purpose of this paper is to present a general model for
determining the optimal frequency of these batch
operations. Specifically, optimal backup,
checkpointing, batch updating, and reorganization
policies are derived. The approach used exploits
inventory parallels by seeking the optimal number of
items--rather than a time interval--to trigger a batch.
The Renewal Reward Theorem is used to find the average
long run costs for backup, recovery, and item storage,
per unit time, which is then minimized to find the
optimal backup policy. This approach permits far less
restrictive assumptions about the update arrival
process than did previous models, as well as inclusion
of storage costs for the updates. The optimal
checkpointing, batch updating, and reorganization
policies are shown to be special cases of this optimal
backup policy. The derivation of previous results as
special cases of this model, and an example,
demonstrate the generality of the methodology
developed.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "backup frequency; batch operations; batch update;
checkpoint interval; data base systems; database
maintenance; file reorganization; inventory theory;
real-time systems; renewal theory",
subject = "Information Systems --- Database Management ---
General (H.2.0)",
}
@Article{Wong:1977:IHT,
author = "Kai C. Wong and Murray Edelberg",
title = "Interval Hierarchies and Their Application to
Predicate Files",
journal = j-TODS,
volume = "2",
number = "3",
pages = "223--232",
month = sep,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-3/p223-wong/p223-wong.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-3/p223-wong/",
abstract = "Predicates are used extensively in modern database
systems for purposes ranging from user specification of
associative accesses to data, to user-invisible system
control functions such as concurrency control and data
distribution. Collections of predicates, or predicate
files, must be maintained and accessed efficiently. A
dynamic index is described, called an interval
hierarchy, which supports several important retrieval
operations on files of simple conjunctive predicates.
Search and maintenance algorithms for interval
hierarchies are given. For a file of n predicates,
typical of the kind expected in practice, these
algorithms require time equal to $O(\log n)$.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "concurrency control; data base systems; database
system; distributed data; index; interval; predicate
file",
subject = "Software --- Operating Systems --- Storage Management
(D.4.2): {\bf Storage hierarchies}; Information Systems
--- Information Storage and Retrieval --- Information
Storage (H.3.2): {\bf File organization}; Information
Systems --- Database Management --- Systems (H.2.4):
{\bf Distributed databases}; Information Systems ---
Database Management --- Systems (H.2.4): {\bf
Concurrency}; Information Systems --- Information
Storage and Retrieval --- Content Analysis and Indexing
(H.3.1): {\bf Indexing methods}",
}
@Article{Ries:1977:ELG,
author = "Daniel R. Ries and Michael Stonebraker",
title = "Effects of Locking Granularity in a Database
Management System",
journal = j-TODS,
volume = "2",
number = "3",
pages = "233--246",
month = sep,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-3/p233-ries/p233-ries.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-3/p233-ries/",
abstract = "Many database systems guarantee some form of integrity
control upon multiple concurrent updates by some form
of locking. Some ``granule'' of the database is chosen
as the unit which is individually locked, and a lock
management algorithm is used to ensure integrity. Using
a simulation model, this paper explores the desired
size of a granule. Under a wide variety of seemingly
realistic conditions, surprisingly coarse granularity
is called for. The paper concludes with some
implications of these results concerning the viability
of so-called predicate locking.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "concurrency; consistency; data base systems; database
management; locking granularity; multiple updates;
predicate locks",
subject = "Information Systems --- Database Management ---
Systems (H.2.4); Information Systems --- Database
Management (H.2); Information Systems --- Database
Management --- Systems (H.2.4): {\bf Concurrency}",
}
@Article{Schmidt:1977:SHL,
author = "Joachim W. Schmidt",
title = "Some High Level Language Constructs for Data of Type
Relation",
journal = j-TODS,
volume = "2",
number = "3",
pages = "247--261",
month = sep,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-3/p247-schmidt/p247-schmidt.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-3/p247-schmidt/",
abstract = "For the extension of high level languages by data
types of mode relation, three language constructs are
proposed and discussed: a repetition statement
controlled by relations, predicates as a generalization
of Boolean expressions, and a constructor for relations
using predicates. The language constructs are developed
step by step starting with a set of elementary
operations on relations. They are designed to fit into
PASCAL without introducing too many additional
concepts.",
acknowledgement = ack-nhfb,
annote = "PASCAL/R",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "computer programming languages; data type; database;
high level language; language extension; nonprocedural
language; relational calculus; relational model",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management ---
Languages (H.2.3)",
}
@Article{Fagin:1977:MVD,
author = "Ronald Fagin",
title = "Multi-Valued Dependencies and a New Normal Form for
Relational Databases",
journal = j-TODS,
volume = "2",
number = "3",
pages = "262--278",
month = sep,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-3/p262-fagin/p262-fagin.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-3/p262-fagin/",
abstract = "A new type of dependency, which includes the
well-known functional dependencies as a special case,
is defined for relational databases. By using this
concept, a new (``fourth'') normal form for relation
schemata is defined. This fourth normal form is
strictly stronger than Codd's ``improved third normal
form'' (or ``Boyce-Codd normal form''). It is shown
that every relation schema can be decomposed into a
family of relation schemata in fourth normal form
without loss of information (that is, the original
relation can be obtained from the new relations by
taking joins).",
acknowledgement = ack-nhfb,
annote = "Multivalued dependency is defined for relational
databases, a new (``fourth'') normal form is strictly
stronger than Codd's.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "3NF; 4NF; Boyce-Codd normal form; data base systems;
database design; decomposition; fourth normal form;
functional dependency; multivalued dependency;
normalization; relational database; third normal form",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Normal forms}",
}
@Article{March:1977:DER,
author = "Salvatore T. March and Dennis G. Severance",
title = "The Determination of Efficient Record Segmentations
and Blocking Factors for Shared Data Files",
journal = j-TODS,
volume = "2",
number = "3",
pages = "279--296",
month = sep,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-3/p279-march/p279-march.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-3/p279-march/",
abstract = "It is generally believed that 80 percent of all
retrieval from a commercial database is directed at
only 20 percent of the stored data items. By
partitioning data items into primary and secondary
record segments, storing them in physically separate
files, and judiciously allocating available buffer
space to the two files, it is possible to significantly
reduce the average cost of information retrieval from a
shared database. An analytic model, based upon
knowledge of data item lengths, data access costs, and
user retrieval patterns, is developed to assist an
analyst with this assignment problem. A computationally
tractable design algorithm is presented and results of
its application are described.",
acknowledgement = ack-nhfb,
classification = "723; 901",
fjournal = "ACM Transactions on Database Systems",
keywords = "bicriterion mathematical programs; branch and bound;
buffer allocation; data base systems; data management;
information science --- information retrieval; network
flows; record design; record segmentation",
subject = "Information Systems --- Database Management (H.2);
Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}",
}
@Article{Ozkarahan:1977:AAF,
author = "E. A. Ozkarahan and K. C. Sevcik",
title = "Analysis of Architectural Features for Enhancing the
Performance of a Database Machine",
journal = j-TODS,
volume = "2",
number = "4",
pages = "297--316",
month = dec,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-4/p297-ozkarahan/p297-ozkarahan.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-4/p297-ozkarahan/",
abstract = "RAP (Relational Associative Processor) is a
``back-end'' database processor that is intended to
take over much of the effort of database management in
a computer system. In order to enhance RAP's
performance its design includes mechanisms for
permitting features analogous to multiprogramming and
virtual memory as in general purpose computer systems.
It is the purpose of this paper to present the detailed
design of these mechanisms, along with some analysis
that supports their value. Specifically, (1) the
response time provided by RAP under several scheduling
disciplines involving priority by class is analyzed,
(2) the cost effectiveness of the additional hardware
in RAP necessary to support multiprogramming is
assessed, and (3) a detailed design of the RAP virtual
memory system and its monitor is presented.",
acknowledgement = ack-nhfb,
annote = "RAP (Relational Associative Processor) is a ``back-end
database processor''; its design includes mechanisms
for multiprogramming and virtual memory.",
classification = "722; 723",
fjournal = "ACM Transactions on Database Systems",
keywords = "associative processors; computer architecture;
computer architecture, hardware support TODS; data base
systems; database machines; database management",
subject = "Information Systems --- Database Management (H.2)",
}
@Article{Rissanen:1977:ICR,
author = "Jorma Rissanen",
title = "Independent Components of Relations",
journal = j-TODS,
volume = "2",
number = "4",
pages = "317--325",
month = dec,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-4/p317-rissanen/p317-rissanen.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-4/p317-rissanen/",
abstract = "In a multiattribute relation or, equivalently, a
multicolumn table a certain collection of the
projections can be shown to be independent in much the
same way as the factors in a Cartesian product or
orthogonal components of a vector. A precise notion of
independence for relations is defined and studied. The
main result states that the operator which reconstructs
the original relation from its independent components
is the natural join, and that independent components
split the full family of functional dependencies into
corresponding component families. These give an
easy-to-check criterion for independence.",
acknowledgement = ack-nhfb,
annote = "In a multi-attribute relation a certain collection of
projections can be shown to be independent. The
operator which reconstructs the original relation is
the natural join. Independent components split the full
family of functional dependencies into corresponding
component families.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; database; functional dependencies;
relations",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases}",
}
@Article{Bonczek:1977:TGB,
author = "Robert H. Bonczek and James I. Cash and Andrew B.
Whinston",
title = "A Transformational Grammar-Based Query Processor for
Access Control in a Planning System",
journal = j-TODS,
volume = "2",
number = "4",
pages = "326--338",
month = dec,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-4/p326-bonczek/p326-bonczek.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-4/p326-bonczek/",
abstract = "Providing computer facilities and data availability to
larger numbers of users generates increased system
vulnerability which is partially offset by software
security systems. Much too often these systems are
presented as ad hoc additions to the basic data
management system. One very important constituent of
software security systems is the access control
mechanism which may be the last resource available to
prohibit unauthorized data retrieval. This paper
presents a specification for an access control
mechanism. The mechanism is specified in a context for
use with the GPLAN decision support system by a
theoretical description consistent with the formal
definition of GPLAN's query language. Incorporation of
the mechanism into the language guarantees it will not
be an ad hoc addition. Furthermore, it provides a
facile introduction of data security dictates into the
language processor.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "access control; data processing; data security;
database; decision support system; planning system",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}; Information
Systems --- Database Management --- General (H.2.0):
{\bf Security, integrity, and protection**};
Information Systems --- Database Management ---
Physical Design (H.2.2): {\bf Access methods}",
}
@Article{Lang:1977:DBP,
author = "Tom{\'a}s Lang and Christopher Wood and Eduardo B.
Fern{\'a}ndez",
title = "Database Buffer Paging in Virtual Storage Systems",
journal = j-TODS,
volume = "2",
number = "4",
pages = "339--351",
month = dec,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-4/p339-lang/p339-lang.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-4/p339-lang/",
abstract = "Three models, corresponding to different sets of
assumptions, are analyzed to study the behavior of a
database buffer in a paging environment. The models
correspond to practical situations and vary in their
search strategies and replacement algorithms. The
variation of I/O cost with respect to buffer size is
determined for the three models. The analysis is valid
for arbitrary database and buffer sizes, and the I/O
cost is obtained in terms of the miss ratio, the buffer
size, the number of main memory pages available for the
buffer, and the relative buffer and database access
costs.",
acknowledgement = ack-nhfb,
annote = "The variation of I/O cost with respect to buffer size
is determined for three models: the IMS/360 database
buffer, with LRU memory replacement, and a prefix table
in main memory indicating which database pages are in
the VSAM buffer.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "buffer management; computer systems performance; data
base systems; database performance; page replacement
algorithm; virtual memory",
subject = "Information Systems --- Database Management ---
General (H.2.0); Information Systems --- Database
Management --- Systems (H.2.4)",
}
@Article{Thomas:1977:VAP,
author = "D. A. Thomas and B. Pagurek and R. J. Buhr",
title = "Validation Algorithms for Pointer Values in {DBTG}
Databases",
journal = j-TODS,
volume = "2",
number = "4",
pages = "352--369",
month = dec,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-4/p352-thomas/p352-thomas.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-4/p352-thomas/",
abstract = "This paper develops algorithms for verifying pointer
values in DBTG (Data Base Task Group) type databases.
To validate pointer implemented access paths and set
structures, two algorithms are developed. The first
procedure exploits the ``typed pointer'' concept
employed in modern programming languages to diagnose
abnormalities in directories and set instances. The
second algorithm completes pointer validation by
examining set instances to ensure that each DBTG set
has a unique owner. Sequential processing is used by
both algorithms, allowing a straightforward
implementation which is efficient in both time and
space. As presented, the algorithms are independent of
implementation schema and physical structure.",
acknowledgement = ack-nhfb,
annote = "Type Checking algorithm detects and locates errors in
the pointers which are used to represent chained and
pointer array implemented sets. In addition to invalid
set pointers, the algorithm has been extended to check
index sequential and inverted access directories
provided by EDMS.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; database integrity; database
utilities; type checking; validation",
subject = "Information Systems --- Database Management (H.2);
Information Systems --- Database Management --- General
(H.2.0): {\bf Security, integrity, and protection**}",
}
@Article{Claybrook:1977:FDM,
author = "Billy G. Claybrook",
title = "A Facility for Defining and Manipulating Generalized
Data Structures",
journal = j-TODS,
volume = "2",
number = "4",
pages = "370--406",
month = dec,
year = "1977",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1977-2-4/p370-claybrook/p370-claybrook.pdf;
http://www.acm.org/pubs/citations/journals/tods/1977-2-4/p370-claybrook/",
abstract = "A data structure definition facility (DSDF) is
described that provides definitions for several
primitive data types, homogeneous and heterogeneous
arrays, cells, stacks, queues, trees, and general
lists. Each nonprimitive data structure consists of two
separate entities--a head and a body. The head contains
the entry point(s) to the body of the structure; by
treating the head like a cell, the DSDF operations are
capable of creating and manipulating very general data
structures. A template structure is described that
permits data structures to share templates.\par
The primary objectives of the DSDF are: (1) to develop
a definition facility that permits the programmer to
explicitly define and manipulate generalized data
structures in a consistent manner, (2) to detect
mistakes and prevent the programmer from creating
(either inadvertently or intentionally) undesirable (or
illegal) data structures, (3) to provide a syntactic
construction mechanism that separates the
implementation of a data structure from its use in the
program in which it is defined, and (4) to facilitate
the development of reliable software.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data definition languages; data processing; data
structure definition facility; data structures;
database management",
subject = "Information Systems --- Database Management (H.2);
Information Systems --- Database Management ---
Languages (H.2.3)",
}
@Article{Minker:1978:SSS,
author = "Jack Minker",
title = "Search Strategy and Selection Function for an
Inferential Relational System",
journal = j-TODS,
volume = "3",
number = "1",
pages = "1--31",
month = mar,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-1/p1-minker/p1-minker.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-1/p1-minker/",
abstract = "An inferential relational system is one in which data
in the system consists of both explicit facts and
general axioms (or ``views''). The general axioms are
used together with the explicit facts to derive the
facts that are implicit (virtual relations) within the
system. A top-down algorithm, as used in artificial
intelligence work, is described to develop inferences
within the system. The top-down approach starts with
the query, a conjunction of relations, to be answered.
Either a relational fact solves a given relation in a
conjunct, or the relation is replaced by a conjunct of
relations which must be solved to solve the given
relation. The approach requires that one and only one
relation in a conjunction be replaced (or expanded) by
the given facts and general axioms. The decision to
expand only a single relation is termed a selection
function. It is shown for relational systems that such
a restriction still guarantees that a solution to the
problem will be found if one exists.\par
The algorithm provides for heuristic direction in the
search process. Experimental results are presented
which illustrate the techniques. A bookkeeping
mechanism is described which permits one to know when
subproblems are solved. It further facilitates the
outputting of reasons for the deductively found answer
in a coherent fashion.",
acknowledgement = ack-nhfb,
annote = "Data in the system consists of both explicit facts and
general axioms. The top-down approach starts with the
query, a conjunction of relations, to be answered.
Either a relational fact solves a given relation in a
conjunct, or the relation is replaced by a conjunct of
relations which must be solved to solve the given
relation. Experimental results are presented which
illustrate the techniques.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "answer and reason extraction; data base systems;
heuristics; inference mechanism; logic; predicate
calculus; relational databases; search strategy;
selection function; top-down search; virtual
relations",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Information Storage and
Retrieval --- Information Search and Retrieval (H.3.3):
{\bf Search process}",
}
@Article{Tuel:1978:ORP,
author = "William G. {Tuel, Jr.}",
title = "Optimum Reorganization Points for Linearly Growing
Files",
journal = j-TODS,
volume = "3",
number = "1",
pages = "32--40",
month = mar,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-1/p32-tuel/p32-tuel.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-1/p32-tuel/",
abstract = "The problem of finding optimal reorganization
intervals for linearly growing files is solved. An
approximate reorganization policy, independent of file
lifetime, is obtained. Both the optimum and approximate
policies are compared to previously published results
using a numerical example.",
acknowledgement = ack-nhfb,
annote = "The problem of finding optimal reorganization
intervals for linearly growing files is solved.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data processing --- file organization; database; file
organization; optimization; physical database design
TODS, data base systems; reorganization",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}",
}
@Article{Yu:1978:END,
author = "C. T. Yu and W. S. Luk and M. K. Siu",
title = "On the Estimation of the Number of Desired Records
with Respect to a Given Query",
journal = j-TODS,
volume = "3",
number = "1",
pages = "41--56",
month = mar,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-1/p41-yu/p41-yu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-1/p41-yu/",
abstract = "The importance of the estimation of the number of
desired records for a given query is outlined. Two
algorithms for the estimation in the ``closest
neighbors problem'' are presented. The numbers of
operations of the algorithms are $O(m\ell^2)$ and
$O(m\ell)$, where $m$ is the number of clusters and
$\ell$ is the ``length'' of the query.",
acknowledgement = ack-nhfb,
annote = "Two Algorithms for the estimation in the `closest
neighbors problem'",
classification = "901",
fjournal = "ACM Transactions on Database Systems",
keywords = "closest neighbors; database; estimate; information
science, CTYu selectivity TODS; query",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}",
}
@Article{Su:1978:CCS,
author = "Stanley Y. W. Su and Ahmed Emam",
title = "{CASDAL}: {{\em CAS\/}SM}'s {{\em DA\/}}ta {{\em
L\/}}anguage",
journal = j-TODS,
volume = "3",
number = "1",
pages = "57--91",
month = mar,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1978-3-1/p57-su/",
abstract = "CASDAL is a high level data language designed and
implemented for the database machine CASSM. The
language is used for the manipulation and maintenance
of a database using an unnormalized (hierarchically
structured) relational data model. It also has
facilities to define, modify, and maintain the data
model definition. The uniqueness of CASDAL lies in its
power to specify complex operations in terms of several
new language constructs and its concepts of tagging or
marking tuples and of matching values when walking from
relation to relation. The language is a result of a
top-down design and development effort for a database
machine in which high level language constructs are
directly supported by the hardware. This paper (1)
gives justifications for the use of an unnormalized
relational model on which the language is based, (2)
presents the CASDAL language constructs with examples,
and (3) describes CASSM's architecture and hardware
primitives which match closely with the high level
language constructs and facilitate the translation
process. This paper also attempts to show how the
efficiency of the language and the translation task can
be achieved and simplified in a system in which the
language is the result of a top-down system design and
development.",
acknowledgement = ack-nhfb,
annote = "CASDAL is a high level data language for the database
machine CASSM. It uses an unnormalized (hierarchically
structured) relational data model. This paper (1)
justifies the use of this model (2) presents the Casdal
language constructs with examples, and (3) describes
CASSM's architecture.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "associative memory; computer programming languages;
data language; database; nonprocedural language; query
language; relational model; SYWSu hardware support
database machine TODS, data base systems",
subject = "Information Systems --- Database Management ---
Languages (H.2.3); Information Systems --- Database
Management --- Languages (H.2.3): {\bf Query
languages}; Information Systems --- Database Management
--- Systems (H.2.4): {\bf Relational databases}",
}
@Article{Chin:1978:SSD,
author = "Francis Y. Chin",
title = "Security in Statistical Databases for Queries with
Small Counts",
journal = j-TODS,
volume = "3",
number = "1",
pages = "92--104",
month = mar,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-1/p92-chin/p92-chin.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-1/p92-chin/",
abstract = "The security problem of statistical databases
containing anonymous but individual records which may
be evaluated by queries about sums and averages is
considered. A model, more realistic than the previous
ones, is proposed, in which nonexisting records for
some keys can be allowed. Under the assumption that the
system protects the individual's information by the
well-known technique which avoids publishing summaries
with small counts, several properties about the system
and a necessary and sufficient condition for
compromising the database have been derived. The
minimum number of queries needed to compromise the
database is also discussed.",
acknowledgement = ack-nhfb,
annote = "Under the assumption that the system protects the
individual's information by the technique which avoids
publishing summaries with small counts, properties
about the system and a necessary and sufficient
condition for compromising the database have been
derived.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "compromisability; data base systems; data processing
--- security of data; data security; protection;
statistical databases",
subject = "Information Systems --- Database Management ---
Database Applications (H.2.8): {\bf Statistical
databases}; Information Systems --- Database Management
--- Systems (H.2.4): {\bf Query processing};
Information Systems --- Database Management ---
Database Administration (H.2.7): {\bf Security,
integrity, and protection}",
}
@Article{Hendrix:1978:DNL,
author = "Gary G. Hendrix and Earl D. Sacerdoti and Daniel
Sagalowicz and Jonathan Slocum",
title = "Developing a Natural Language Interface to Complex
Data",
journal = j-TODS,
volume = "3",
number = "2",
pages = "105--147",
month = jun,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Ai/Ai.misc.bib; Compendex database;
Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-2/p105-hendrix/p105-hendrix.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-2/p105-hendrix/",
abstract = "Aspects of an intelligent interface that provides
natural language access to a large body of data
distributed over a computer network are described. The
overall system architecture is presented, showing how a
user is buffered from the actual database management
systems (DBMSs) by three layers of insulating
components. These layers operate in series to convert
natural language queries into calls to DBMSs at remote
sites. Attention is then focused on the first of the
insulating components, the natural language system. A
pragmatic approach to language access that has proved
useful for building interfaces to databases is
described and illustrated by examples. Special language
features that increase system usability, such as
spelling correction, processing of incomplete inputs,
and run-time system personalization, are also
discussed. The language system is contrasted with other
work in applied natural language processing, and the
system's limitations are analyzed.",
acknowledgement = ack-nhfb,
classification = "722; 723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; database access; human engineering;
intelligent access semantic grammar human engineering
run-time personalization, computer interfaces;
intelligent interface; natural language; Natural
Language, Intelligent Interface, Database Access,
Semantic Grammar, Human Engineering, Runtime
Personalization; run-time personalization; semantic
grammar",
subject = "Information Systems --- Database Management ---
Languages (H.2.3); Information Systems --- Database
Management --- Physical Design (H.2.2): {\bf Access
methods}",
}
@Article{Langdon:1978:NAP,
author = "Glen G. {Langdon, Jr.}",
title = "A Note on Associative Processors for Data Management",
journal = j-TODS,
volume = "3",
number = "2",
pages = "148--158",
month = jun,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-2/p148-langdon/p148-langdon.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-2/p148-langdon/",
abstract = "Associative ``logic-per-track'' processors for data
management are examined from a technological and
engineering point of view. Architectural and design
decisions are discussed. Some alternatives to the
design of comparators, garbage collection, and domain
extraction for architectures like the Relational
Associative Processor (RAP) are offered.",
acknowledgement = ack-nhfb,
annote = "Associative ``logic-per-track'' processors for data
management are examined from a technological and
engineering point of view (RAP).",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "associative processors; computer operating systems;
data base systems, hardware support database machine
TODS; database machines",
subject = "Information Systems --- Database Management (H.2)",
}
@Article{Kluge:1978:DFM,
author = "Werner E. Kluge",
title = "Data File Management in Shift-Register Memories",
journal = j-TODS,
volume = "3",
number = "2",
pages = "159--177",
month = jun,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-2/p159-kluge/p159-kluge.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-2/p159-kluge/",
abstract = "The paper proposes a shift-register memory, structured
as a two-dimensional array of uniform shift-register
loops which are linked by flow-steering switches, whose
switch control scheme is tailored to perform with great
efficiency data management operations on sequentially
organized files. The memory operates in a linear
input/output mode to perform record insertion,
deletion, and relocation on an existing file, and in a
sublinear mode for rapid internal file movement to
expedite file positioning and record retrieval and
update operations.\par
The memory, implemented as a large capacity
charge-coupled device or magnetic domain memory,
permits efficient data management on very large
databases at the level of secondary storage and lends
itself to applications as a universal disk replacement,
particularly in database computers.",
acknowledgement = ack-nhfb,
annote = "Shift-register memory, structured as a two-dimensional
array tailored to perform with great efficiency data
management operations on sequentially organized files",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data transformations; deletion; hardware support
database machine TODS, computer operating systems;
insertion; LIFO/FIFO operation modes; management of
sequentially organized files; record retrieval;
relocation; shift-register memories; updating",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}; Information Systems --- Information
Storage and Retrieval --- Information Search and
Retrieval (H.3.3)",
}
@Article{Rosenkrantz:1978:SLC,
author = "David J. Rosenkrantz and Richard E. Stearns and Philip
M. {Lewis, II}",
title = "System Level Concurrency Control for Distributed
Database Systems",
journal = j-TODS,
volume = "3",
number = "2",
pages = "178--198",
month = jun,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-2/p178-rosenkrantz/p178-rosenkrantz.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-2/p178-rosenkrantz/",
abstract = "A distributed database system is one in which the
database is spread among several sites and application
programs ``move'' from site to site to access and
update the data they need. The concurrency control is
that portion of the system that responds to the read
and write requests of the application programs. Its job
is to maintain the global consistency of the
distributed database while ensuring that the
termination of the application programs is not
prevented by phenomena such as deadlock. We assume each
individual site has its own local concurrency control
which responds to requests at that site and can only
communicate with concurrency controls at other sites
when an application program moves from site to site,
terminates, or aborts.\par
This paper presents designs for several distributed
concurrency controls and demonstrates that they work
correctly. It also investigates some of the
implications of global consistency of a distributed
database and discusses phenomena that can prevent
termination of application programs.",
acknowledgement = ack-nhfb,
annote = "Later arriving transactions may be aborted if not yet
in the commit stage.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "concurrency; consistency; data base systems; database;
deadlock; deadly embrace; distributed; integrity; lock;
readers and writers; restart; rollback; transaction",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Distributed databases};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Concurrency}",
}
@Article{Delobel:1978:NHD,
author = "Claude Delobel",
title = "Normalization and Hierarchical Dependencies in the
Relational Data Model",
journal = j-TODS,
volume = "3",
number = "3",
pages = "201--222",
month = sep,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-3/p201-delobel/p201-delobel.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-3/p201-delobel/",
abstract = "The purpose of this paper is to present a new approach
to the conceptual design of logical schemata for
relational databases. One-to-one, one-to-many, and
many-to-many relationships between the attributes of
database relations are modeled by means of functional
dependencies and multivalued dependencies. A new type
of dependency is introduced: first-order hierarchical
decomposition. The properties of this new type of
dependency are studied and related to the normalization
process of relations. The relationship between the
concept of first-order hierarchical decomposition and
the notion of hierarchical organization of data is
discussed through the normalization process.",
acknowledgement = ack-nhfb,
annote = "One-to-one, one-to-many relationships between the
attributes of database relations are modeled by means
of functional dependencies and multivalued
dependencies. A new type of dependency is first-order
hierarchical.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design",
keywords = "data base systems; data model; first-order
hierarchical dependency; functional dependency;
hierarchical schema; multivalued dependency;
normalization process; relational database; relational
model",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Data models}; Information Systems
--- Database Management --- Logical Design (H.2.1):
{\bf Schema and subschema}",
}
@Article{Smith:1978:SPD,
author = "Alan Jay Smith",
title = "Sequentiality and Prefetching in Database Systems",
journal = j-TODS,
volume = "3",
number = "3",
pages = "223--247",
month = sep,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-3/p223-smith/p223-smith.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-3/p223-smith/",
abstract = "Sequentiality of access is an inherent characteristic
of many database systems. We use this observation to
develop an algorithm which selectively prefetches data
blocks ahead of the point of reference. The number of
blocks prefetched is chosen by using the empirical run
length distribution and conditioning on the observed
number of sequential block references immediately
preceding reference to the current block. The optimal
number of blocks to prefetch is estimated as a function
of a number of ``costs,'' including the cost of
accessing a block not resident in the buffer (a miss),
the cost of fetching additional data blocks at fault
times, and the cost of fetching blocks that are never
referenced. We estimate this latter cost, described as
memory pollution, in two ways. We consider the
treatment (in the replacement algorithm) of prefetched
blocks, whether they are treated as referenced or not,
and find that it makes very little difference. Trace
data taken from an operational IMS database system is
analyzed and the results are presented. We show how to
determine optimal block sizes. We find that
anticipatory fetching of data can lead to significant
improvements in system operation.",
acknowledgement = ack-nhfb,
annote = "An algorithm which selectively prefetches data blocks
ahead of the point of reference. The optimal number of
blocks to prefetch is estimated as a function, the cost
(a miss), the cost of fetching blocks that are never
referenced of fetching additional data blocks, and the
cost of fetching blocks that are never referenced.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "buffer management; database systems; dynamic
programming; IMS; paging; prefetching; read-ahead
caches caching buffer management TODS, data base
systems; sequentiality",
subject = "Information Systems --- Database Management ---
Systems (H.2.4)",
}
@Article{Schlageter:1978:PSD,
author = "Gunter Schlageter",
title = "Process Synchronization in Database Systems",
journal = j-TODS,
volume = "3",
number = "3",
pages = "248--271",
month = sep,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "See errata report in \cite{Bernstein:1979:CSD}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-3/p248-schlageter/p248-schlageter.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-3/p248-schlageter/",
abstract = "The problem of process synchronization in database
systems is analyzed in a strictly systematic way, on a
rather abstract level; the abstraction is chosen such
that the essential characteristics of the problem can
be distinctly modeled and investigated. Using a small
set of concepts, a consistent description of the whole
problem is developed; many widely used, but only
vaguely defined, notions are defined exactly within
this framework. The abstract treatment of the problem
immediately leads to practically useful insights with
respect to possible solutions, although
implementational aspects are not discussed in detail.",
acknowledgement = ack-nhfb,
annote = "Process synchronization in database systems is
analyzed on a rather abstract level. [see Bernstein for
comments]",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "database consistency; database systems; integrity;
locking; operating system support TODS, data base
systems; parallel process systems; process
synchronization",
subject = "Information Systems --- Database Management ---
Systems (H.2.4); Information Systems --- Database
Management (H.2)",
}
@Article{Hollaar:1978:SMP,
author = "Lee A. Hollaar",
title = "Specialized Merge Processor Networks for Combining
Sorted Lists",
journal = j-TODS,
volume = "3",
number = "3",
pages = "272--284",
month = sep,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-3/p272-hollaar/p272-hollaar.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-3/p272-hollaar/",
abstract = "In inverted file database systems, index lists
consisting of pointers to items within the database are
combined to form a list of items which potentially
satisfy a user's query. This list merging is similar to
the common data processing operation of combining two
or more sorted input files to form a sorted output
file, and generally represents a large percentage of
the computer time used by the retrieval system.
Unfortunately, a general purpose digital computer is
better suited for complicated numeric processing rather
than the simple combining of data. The overhead of
adjusting and checking pointers, aligning data, and
testing for completion of the operation overwhelm the
processing of the data.\par
A specialized processor can perform most of these
overhead operations in parallel with the processing of
the data, thereby offering speed increases by a factor
from 10 to 100 over conventional computers, depending
on whether a higher speed memory is used for storing
the lists. These processors can also be combined into
networks capable of directly forming the result of a
complex expression, with another order of magnitude
speed increase possible. The programming and operation
of these processors and networks is discussed, and
comparisons are made with the speed and efficiency of
conventional general purpose computers.",
acknowledgement = ack-nhfb,
classification = "722; 723",
fjournal = "ACM Transactions on Database Systems",
keywords = "backend processors; binary tree networks; computer
architecture --- program processors; computer system
architecture; full text retrieval systems; hardware
support database machine TODS, data base systems;
inverted file databases; nonnumeric processing;
pipelined networks; sorted list merging",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Search and Retrieval (H.3.3);
Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}",
}
@Article{Haerder:1978:IGA,
author = "Theo Haerder",
title = "Implementing a Generalized Access Path Structure for a
Relational Database System",
journal = j-TODS,
volume = "3",
number = "3",
pages = "285--298",
month = sep,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-3/p285-haerder/p285-haerder.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-3/p285-haerder/",
abstract = "A new kind of implementation technique for access
paths connecting sets of tuples qualified by attribute
values is described. It combines the advantages of
pointer chain and multilevel index implementation
techniques. Compared to these structures the
generalized access path structure is at least
competitive in performing retrieval and update
operations, while a considerable storage space saving
is gained. Some additional features of this structure
support $m$-way joins and the evaluation of
multirelation queries, and allow efficient checks of
integrity assertions and simple reorganization
schemes.",
acknowledgement = ack-nhfb,
annote = "Implementation technique for access paths connecting
sets of tuples qualified by attribute values combines
the advantages of pointer chains and multilevel
indexes. Features of this structure support m-way
joins.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems, Harder multi-relation indices
TODS",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases}",
}
@Article{Yu:1978:PP,
author = "C. T. Yu and M. K. Siu and K. Lam",
title = "On a Partitioning Problem",
journal = j-TODS,
volume = "3",
number = "3",
pages = "299--309",
month = sep,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-3/p299-yu/p299-yu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-3/p299-yu/",
abstract = "This paper investigates the problem of locating a set
of ``boundary points'' of a large number of records.
Conceptually, the boundary points partition the records
into subsets of roughly the same number of elements,
such that the key values of the records in one subset
are all smaller or all larger than those of the records
in another subset. We guess the locations of the
boundary points by linear interpolation and check their
accuracy by reading the key values of the records on
one pass. This process is repeated until all boundary
points are determined. Clearly, this problem can also
be solved by performing an external tape sort. Both
analytical and empirical results indicate that the
number of passes required is small in comparison with
that in an external tape sort. This kind of record
partitioning may be of interest in setting up a
statistical database system.",
acknowledgement = ack-nhfb,
annote = "Boundary points partition the records into subsets of
roughly the same number of elements. We guess the
locations of the boundary points by linear
interpolation and check their accuracy by reading the
key values of the records on one pass. This process is
repeated until all boundary points are determined.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "CTYu TODS, data base systems; external sort; key
value; partition; passes; tape probability",
subject = "Computing Methodologies --- Image Processing And
Computer Vision --- Segmentation (I.4.6): {\bf Region
growing, partitioning}",
}
@Article{Fagin:1978:AM,
author = "Ronald Fagin",
title = "On an Authorization Mechanism",
journal = j-TODS,
volume = "3",
number = "3",
pages = "310--319",
month = sep,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-3/p310-fagin/p310-fagin.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-3/p310-fagin/",
abstract = "Griffiths and Wade ({\em ACM Trans. Database Syst.
1,3}, (Sept. 1976), 242-255) have defined a dynamic
authorization mechanism that goes beyond the
traditional password approach. A database user can
grant or revoke privileges (such as to read, insert, or
delete) on a file that he has created. Furthermore, he
can authorize others to grant these same privileges.
The database management system keeps track of a
directed graph, emanating from the creator, of granted
privileges. The nodes of the graph correspond to users,
and the edges (each of which is labeled with a
timestamp) correspond to grants. The edges are of two
types, corresponding to whether or not the recipient of
the grant has been given the option to make further
grants of this privilege. Furthermore, for each pair
$A, B$ of nodes, there can be no more than one edge of
each type from $A$ to $B$. We modify this approach by
allowing graphs in which there can be multiple edges of
each type from one node to another. We prove
correctness (in a certain strong sense) for our
modified authorization mechanism. Further, we show by
example that under the original mechanism, the system
might forbid some user from exercising or granting a
privilege that he ``should'' be allowed to exercise or
grant.",
acknowledgement = ack-nhfb,
annote = "We prove correctness for our modified authorization
mechanism",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "access control; authorization; data base systems;
database; privacy; proof of correctness; protection;
revocation; security",
subject = "Information Systems --- Database Management ---
Database Administration (H.2.7): {\bf Security,
integrity, and protection}",
}
@Article{Salton:1978:GSC,
author = "G. Salton and A. Wong",
title = "Generation and Search of Clustered Files",
journal = j-TODS,
volume = "3",
number = "4",
pages = "321--346",
month = dec,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-4/p321-salton/p321-salton.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-4/p321-salton/",
abstract = "A classified, or clustered file is one where related,
or similar records are grouped into classes, or
clusters of items in such a way that all items within a
cluster are jointly retrievable. Clustered files are
easily adapted to broad and narrow search strategies,
and simple file updating methods are available. An
inexpensive file clustering method applicable to large
files is given together with appropriate file search
methods. An abstract model is then introduced to
predict the retrieval effectiveness of various search
methods in a clustered file environment. Experimental
evidence is included to test the versatility of the
model and to demonstrate the role of various parameters
in the cluster search process.",
acknowledgement = ack-nhfb,
annote = "Automatic classification for information retrieval",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "automatic classification; cluster searching; clustered
files; data processing; fast classification; file
organization; probabilistic models",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}; Information Systems --- Information
Storage and Retrieval --- Information Search and
Retrieval (H.3.3): {\bf Clustering}; Information
Systems --- Information Storage and Retrieval ---
Information Search and Retrieval (H.3.3): {\bf Search
process}",
}
@Article{Banerjee:1978:CCD,
author = "Jayanta Banerjee and Richard I. Baum and David K.
Hsiao",
title = "Concepts and Capabilities of a Database Computer",
journal = j-TODS,
volume = "3",
number = "4",
pages = "347--384",
month = dec,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-4/p347-banerjee/p347-banerjee.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-4/p347-banerjee/",
abstract = "The concepts and capabilities of a database computer
(DBC) are given in this paper. The proposed design
overcomes many of the traditional problems of database
system software and is one of the first to describe a
complete data-secure computer capable of handling large
databases.\par
This paper begins by characterizing the major problems
facing today's database system designers. These
problems are intrinsically related to the nature of
conventional hardware and can only be solved by
introducing new architectural concepts. Several such
concepts are brought to bear in the later sections of
this paper. These architectural principles have a major
impact upon the design of the system and so they are
discussed in some detail. A key aspect of these
principles is that they can be implemented with
near-term technology. The rest of the paper is devoted
to the functional characteristics and the theory of
operation of the DBC. The theory of operation is based
on a series of abstract models of the components and
data structures employed by the DBC. These models are
used to illustrate how the DBC performs access
operations, manages data structures and security
specifications, and enforces security requirements.
Short Algol-like algorithms are used to show how these
operations are carried out. This part of the paper
concludes with a high-level description of the DBC
organization. The actual details of the DBC hardware
are quite involved and so their presentation is not the
subject of this paper.\par
A sample database is included in the Appendix to
illustrate the working of the security and clustering
mechanisms of the DBC.",
acknowledgement = ack-nhfb,
annote-1 = "The concepts of a database computer (DBC) are given.
The theory of operation is based on abstract models.
The DBC performs access operations, manages data
structures and security specifications.",
annote-2 = "The correct author order (from the running heads and
table of contents) is Banerjee, Baum, Hsiao: the
article cover page has Banerjee, Hsiao, Baum, because
the first two share a common address.",
classification = "722; 723",
fjournal = "ACM Transactions on Database Systems",
keywords = "clustering; content-addressable memory; data base
systems; database computers; hardware support machine
TODS, computer architecture; keywords; mass memory;
performance; security; structure memory",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Search and Retrieval (H.3.3):
{\bf Clustering}",
}
@Article{Bradley:1978:EOC,
author = "J. Bradley",
title = "An Extended Owner-Coupled Set Data Model and Predicate
Calculus for Database Management",
journal = j-TODS,
volume = "3",
number = "4",
pages = "385--416",
month = dec,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-4/p385-bradley/p385-bradley.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-4/p385-bradley/",
abstract = "A data model is presented, based on the extension of
the concept of a DBTG owner-coupled set to permit {\em
static\/} and {\em dynamic\/} sets and a new kind of
set referred to as a {\em virtual\/} set. The notion of
{\em connection fields\/} is introduced, and it is
shown how connection fields may be used to construct
derived information bearing set names, and hence permit
the specification of (dynamic) sets which are not
predeclared in a schema. Virtual sets are shown to
reflect the functional dependencies which can exist
within a file. A technique which permits the data model
to be fully described diagrammatically by {\em extended
Bachman diagrams\/} is described. A predicate calculus
for manipulation of this data model is presented.
Expressions written in this calculus are compared with
corresponding expressions in a relational predicate
calculus, DSL ALPHA. An argument for the relational
completeness of the language is given.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "Codasyl DBTG; connection field; data base systems; DSL
AlPHA; dynamic set; extended Bachman diagram; extended
owner-coupled set data model; extended owner-coupled
set predicate calculus; functional dependency;
information bearing set name; owner-coupled set; static
set; virtual set",
subject = "Information Systems --- Database Management (H.2)",
}
@Article{Shneiderman:1978:IHF,
author = "Ben Shneiderman",
title = "Improving the Human Factors Aspect of Database
Interactions",
journal = j-TODS,
volume = "3",
number = "4",
pages = "417--439",
month = dec,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-4/p417-shneiderman/p417-shneiderman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-4/p417-shneiderman/",
abstract = "The widespread dissemination of computer and
information systems to nontechnically trained
individuals requires a new approach to the design and
development of database interfaces. This paper provides
the motivational background for controlled
psychological experimentation in exploring the
person\slash machine interface. Frameworks for the
reductionist approach are given, research methods
discussed, research issues presented, and a small
experiment is offered as an example of what can be
accomplished. This experiment is a comparison of
natural and artificial language query facilities.
Although subjects posed approximately equal numbers of
valid queries with either facility, natural language
users made significantly more invalid queries which
could not be answered from the database that was
described.",
acknowledgement = ack-nhfb,
classification = "461; 723; 901",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; data models; database systems;
experimentation; human engineering; human factors;
natural language interfaces; psychology; query
languages; systems science and cybernetics --- man
machine systems",
subject = "Information Systems --- Models and Principles ---
User/Machine Systems (H.1.2): {\bf Human factors};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Data models}; Information Systems
--- Database Management --- Languages (H.2.3): {\bf
Query languages}; Information Systems --- Database
Management --- Systems (H.2.4)",
}
@Article{Comer:1978:DOI,
author = "Douglas Comer",
title = "The Difficulty of Optimum Index Selection",
journal = j-TODS,
volume = "3",
number = "4",
pages = "440--445",
month = dec,
year = "1978",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1978-3-4/p440-comer/p440-comer.pdf;
http://www.acm.org/pubs/citations/journals/tods/1978-3-4/p440-comer/",
abstract = "Given a file on a secondary store in which each record
has several attributes, it is usually advantageous to
build an index mechanism to decrease the cost of
conducting transactions to the file. The problem of
selecting attributes over which to index has been
studied in the context of various storage structures
and access assumptions. One algorithm to make an
optimum index selection requires 2 $k$ steps in the
worst case, where $k$ is the number of attributes in
the file. We examine the question of whether a more
efficient algorithm might exist and show that even
under a simple cost criterion the problem is
computationally difficult in a precise sense. Our
results extend directly to other related problems where
the cost of the index depends on fixed values which are
assigned to each attribute. Some practical implications
are discussed.",
acknowledgement = ack-nhfb,
annote = "Theorem: optimum index selection problem OISP is
NP-complete for files of degree $d \ge 2$.",
fjournal = "ACM Transactions on Database Systems",
keywords = "attribute selection; complexity; index selection;
physical database design; secondary index",
subject = "Information Systems --- Information Storage and
Retrieval --- Content Analysis and Indexing (H.3.1):
{\bf Indexing methods}",
}
@Article{Babb:1979:IRD,
author = "E. Babb",
title = "Implementing a Relational Database by Means of
Specialized Hardware",
journal = j-TODS,
volume = "4",
number = "1",
pages = "1--29",
month = mar,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-1/p1-babb/p1-babb.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-1/p1-babb/",
abstract = "New hardware is described which allows the rapid
execution of queries demanding the joining of
physically stored relations. The main feature of the
hardware is a special store which can rapidly remember
or recall data. This data might be pointers from one
file to another, in which case the memory helps with
queries on joins of files. Alternatively, the memory
can help remove redundant data during projection[s??],
giving a considerable speed advantage over conventional
hardware.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "bit array; CAFS; content addressing; database;
hardware support machine bit vector filter
probabilistic semi-join TODS, data base systems;
hashing; information retrieval; join; projection;
relational model; selection; special hardware",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases}",
}
@Article{Beeri:1979:CPR,
author = "Catriel Beeri and Philip A. Bernstein",
title = "Computational Problems Related to the Design of Normal
Form Relational Schemas",
journal = j-TODS,
volume = "4",
number = "1",
pages = "30--59",
month = mar,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Compiler/prog.lang.theory.bib;
Database/Graefe.bib; Database/Wiederhold.bib;
Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: errata in ACM Transactions on
Database Systems, Vol. 4 No. 3, Sep. 1979, pp. 396.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-1/p30-beeri/p30-beeri.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-1/p30-beeri/",
abstract = "Problems related to functional dependencies and the
algorithmic design of relational schemas are examined.
Specifically, the following results are presented: (1)
a tree model of derivations of functional dependencies
from other functional dependencies; (2) a linear-time
algorithm to test if a functional dependency is in the
closure of a set of functional dependencies; (3) a
quadratic-time implementation of Bernstein's third
normal form schema synthesis algorithm.
\par
Furthermore, it is shown that most interesting
algorithmic questions about Boyce-Codd normal form and
keys are {\em NP\/}-complete and are therefore probably
not amenable to fast algorithmic solutions.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1); Information Systems ---
Database Management --- Systems (H.2.4): {\bf
Relational databases}",
}
@Article{Lockemann:1979:DAD,
author = "Peter C. Lockemann and Heinrich C. Mayr and Wolfgang
H. Weil and Wolfgang H. Wohlleber",
title = "Data Abstractions for Database Systems",
journal = j-TODS,
volume = "4",
number = "1",
pages = "60--75",
month = mar,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-1/p60-lockemann/p60-lockemann.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-1/p60-lockemann/",
abstract = "Data abstractions were originally conceived as a
specification tool in programming. They also appear to
be useful for exploring and explaining the capabilities
and shortcomings of the data definition and
manipulation facilities of present-day database
systems. Moreover they may lead to new approaches to
the design of these facilities. In the first section
the paper introduces an axiomatic method for specifying
data abstractions and, on that basis, gives precise
meaning to familiar notions such as data model, data
type, and database schema. In a second step the various
possibilities for specifying data types within a given
data model are examined and illustrated. It is shown
that data types prescribe the individual operations
that are allowed within a database. Finally, some
additions to the method are discussed which permit the
formulation of interrelationships between arbitrary
operations.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "abstract data type; data abstraction; data base
systems; data definition language; data manipulation
language; data model; data structure; data type;
database consistency; database design; database schema;
integrity constraints; specification",
subject = "Information Systems --- Database Management ---
Systems (H.2.4); Information Systems --- Database
Management --- Languages (H.2.3): {\bf Data
manipulation languages (DML)}; Information Systems ---
Database Management --- Logical Design (H.2.1): {\bf
Data models}; Information Systems --- Database
Management --- Logical Design (H.2.1): {\bf Schema and
subschema}",
}
@Article{Denning:1979:TTS,
author = "Dorothy E. Denning and Peter J. Denning and Mayer D.
Schwartz",
title = "The Tracker: {A} Threat to Statistical Database
Security",
journal = j-TODS,
volume = "4",
number = "1",
pages = "76--96",
month = mar,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-1/p76-denning/p76-denning.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-1/p76-denning/",
abstract = "The query programs of certain databases report raw
statistics for query sets, which are groups of records
specified implicitly by a characteristic formula. The
raw statistics include query set size and sums of
powers of values in the query set. Many users and
designers believe that the individual records will
remain confidential as long as query programs refuse to
report the statistics of query sets which are too
small. It is shown that the compromise of small query
sets can in fact almost always be accomplished with the
help of characteristic formulas called trackers. J.
Schl{\"o}rer's individual tracker is reviewed; it is
derived from known characteristics of a given
individual and permits deducing additional
characteristics he may have. The general tracker is
introduced: It permits calculating statistics for
arbitrary query sets, without requiring preknowledge of
anything in the database. General trackers always exist
if there are enough distinguishable classes of
individuals in the database, in which case the trackers
have a simple form. Almost all databases have a general
tracker, and general trackers are almost always easy to
find. Security is not guaranteed by the lack of a
general tracker.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "confidentiality; data base systems; data processing;
data security; database security; secure query
functions; statistical database; tracker",
subject = "Information Systems --- Database Management ---
General (H.2.0): {\bf Security, integrity, and
protection**}; Information Systems --- Database
Management --- Database Applications (H.2.8): {\bf
Statistical databases}",
}
@Article{Dobkin:1979:SDP,
author = "David Dobkin and Anita K. Jones and Richard J.
Lipton",
title = "Secure Databases: Protection Against User Influence",
journal = j-TODS,
volume = "4",
number = "1",
pages = "97--106",
month = mar,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-1/p97-dobkin/p97-dobkin.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-1/p97-dobkin/",
abstract = "Users may be able to compromise databases by asking a
series of questions and then inferring new information
from the answers. The complexity of protecting a
database against this technique is discussed here.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "compromise; data base systems; database; inference;
information flow; protection; security; Security TODS,
data processing; statistical query",
subject = "Information Systems --- Database Management ---
Database Administration (H.2.7): {\bf Security,
integrity, and protection}",
}
@Article{Kent:1979:LRB,
author = "William Kent",
title = "Limitations of Record-Based Information Models",
journal = j-TODS,
volume = "4",
number = "1",
pages = "107--131",
month = mar,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-1/p107-kent/p107-kent.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-1/p107-kent/",
abstract = "Record structures are generally efficient, familiar,
and easy to use for most current data processing
applications. But they are not complete in their
ability to represent information, nor are they fully
self-describing.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "conceptual model; data model; entities; first normal
form; information model; normalization; records;
relationships; semantic model",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Information
Systems --- Database Management --- Logical Design
(H.2.1): {\bf Normal forms}; Information Systems ---
Database Management --- Systems (H.2.4): {\bf
Relational databases}",
}
@Article{Yao:1979:OQE,
author = "S. Bing Yao",
title = "Optimization of Query Evaluation Algorithms",
journal = j-TODS,
volume = "4",
number = "2",
pages = "133--155",
month = jun,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-2/p133-yao/p133-yao.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-2/p133-yao/",
abstract = "A model of database storage and access is presented.
The model represents many evaluation algorithms as
special cases, and helps to break a complex algorithm
into simple access operations. Generalized access cost
equations associated with the model are developed and
analyzed. Optimization of these cost equations yields
an optimal access algorithm which can be synthesized by
a query subsystem whose design is based on the modular
access operations.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "computer programming languages; data base systems;
data manipulation language; database optimization;
inverted file; query language; query languages; query
optimization; relational data model",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management ---
Languages (H.2.3): {\bf Query languages}; Information
Systems --- Database Management --- Logical Design
(H.2.1): {\bf Data models}; Information Systems ---
Database Management --- Languages (H.2.3): {\bf Data
manipulation languages (DML)}",
}
@Article{Schwartz:1979:LQS,
author = "M. D. Schwartz and D. E. Denning and P. J. Denning",
title = "Linear Queries in Statistical Databases",
journal = j-TODS,
volume = "4",
number = "2",
pages = "156--167",
month = jun,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-2/p156-schwartz/p156-schwartz.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-2/p156-schwartz/",
abstract = "A database is compromised if a user can determine the
data elements associated with keys which he did not
know previously. If it is possible, compromise can be
achieved by posing a finite set of queries over sets of
data elements and employing initial information to
solve the resulting system of equations. Assuming the
allowable queries are linear, that is, weighted sums of
data elements, we show how compromise can be achieved
and we characterize the maximal initial information
permitted of a user in a secure system. When compromise
is possible, the initial information and the number of
queries required to achieve it is surprisingly small.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "confidentiality; data base systems; data processing
--- security of data; data security; database security;
inference; linear query; secure query functions;
statistical database",
subject = "Information Systems --- Database Management ---
Database Applications (H.2.8): {\bf Statistical
databases}; Information Systems --- Database Management
--- Systems (H.2.4): {\bf Query processing};
Information Systems --- Database Management --- General
(H.2.0): {\bf Security, integrity, and protection**}",
}
@Article{Aho:1979:OPM,
author = "Alfred V. Aho and Jeffrey D. Ullman",
title = "Optimal Partial-Match Retrieval When Fields are
Independently Specified",
journal = j-TODS,
volume = "4",
number = "2",
pages = "168--179",
month = jun,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Graphics/siggraph/79.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-2/p168-aho/p168-aho.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-2/p168-aho/",
abstract = "This paper considers the design of a system to answer
partial-match queries from a file containing a
collection of records, each record consisting of a
sequence of fields. A partial-match query is a
specification of values for zero or more fields of a
record, and the answer to a query is a listing of all
records in the file whose fields match the specified
values.\par
A design is considered in which the file is stored in a
set of bins. A formula is derived for the optimal
number of bits in a bin address to assign to each
field, assuming the probability that a given field is
specified in a query is independent of what other
fields are specified. Implications of the optimality
criterion on the size of bins are also discussed.",
acknowledgement = ack-nhfb,
classification = "723; 901",
fjournal = "ACM Transactions on Database Systems",
keywords = "associative searching; data processing --- file
organization; file organization; hashing; information
retrieval; information science; partial-match
retrieval; searching",
oldlabel = "geom-2",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Search and Retrieval (H.3.3):
{\bf Retrieval models}; Information Systems ---
Information Storage and Retrieval --- Information
Search and Retrieval (H.3.3): {\bf Search process};
Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}",
}
@Article{Thomas:1979:MCA,
author = "Robert H. Thomas",
title = "A Majority Consensus Approach to Concurrency Control
for Multiple Copy Databases",
journal = j-TODS,
volume = "4",
number = "2",
pages = "180--209",
month = jun,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib;
Distributed/fault.tolerant.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-2/p180-thomas/p180-thomas.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-2/p180-thomas/",
abstract = "A ``majority consensus'' algorithm which represents a
new solution to the update synchronization problem for
multiple copy databases is presented. The algorithm
embodies distributed control and can function
effectively in the presence of communication and
database site outages. The correctness of the algorithm
is demonstrated and the cost of using it is analyzed.
Several examples that illustrate aspects of the
algorithm operation are included in the Appendix.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "clock synchronization; computer networks; concurrency
control; data base systems; distributed computation;
distributed control; distributed databases;
multiprocess systems; update synchronization",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Concurrency}; Information Systems
--- Information Storage and Retrieval --- Systems and
Software (H.3.4): {\bf Distributed systems}",
}
@Article{Ries:1979:LGR,
author = "Daniel R. Ries and Michael R. Stonebraker",
title = "Locking Granularity Revisited",
journal = j-TODS,
volume = "4",
number = "2",
pages = "210--227",
month = jun,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-2/p210-ries/p210-ries.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-2/p210-ries/",
abstract = "Locking granularity refers to the size and hence the
number of locks used to ensure the consistency of a
database during multiple concurrent updates. In an
earlier simulation study we concluded that coarse
granularity, such as area or file locking, is to be
preferred to fine granularity such as individual page
or record locking.\par
However, alternate assumptions than those used in the
original paper can change that conclusion. First, we
modified the assumptions concerning the placement of
the locks on the database with respect to the accessing
transactions. In the original model the locks were
assumed to be well placed. Under worse case and random
placement assumptions when only very small transactions
access the database, fine granularity is preferable.
\par
Second, we extended the simulation to model a lock
hierarchy where large transactions use large locks and
small transactions use small locks. In this scenario,
again under the random and worse case lock placement
assumptions, fine granularity is preferable if all
transactions accessing more than 1 percent of the
database use large locks.\par
Finally, the simulation was extended to model a ``claim
as needed'' locking strategy together with the
resultant possibility of deadlock. In the original
study all locks were claimed in one atomic operation at
the beginning of a transaction. The claim as needed
strategy does not change the conclusions concerning the
desired granularity.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "concurrency; database management; locking granularity;
locking hierarchies; multiple updates; TODS Ingres,
data base systems",
subject = "Information Systems --- Database Management ---
Database Administration (H.2.7): {\bf Security,
integrity, and protection}; Information Systems ---
Database Management --- Systems (H.2.4): {\bf
Concurrency}; Information Systems --- Database
Management (H.2); Information Systems --- Database
Management --- Physical Design (H.2.2): {\bf Deadlock
avoidance}",
}
@Article{Burkhard:1979:PMH,
author = "Walter A. Burkhard",
title = "Partial-Match Hash Coding: Benefits of Redundancy",
journal = j-TODS,
volume = "4",
number = "2",
pages = "228--239",
month = jun,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
Graphics/siggraph/79.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-2/p228-burkhard/p228-burkhard.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-2/p228-burkhard/",
abstract = "File designs suitable for retrieval from a file of
$k$-field records when queries may be partially
specified are examined. Storage redundancy is
introduced to obtain improved worst-case and
average-case performances. The resulting storage
schemes are appropriate for replicated distributed
database environments; it is possible to improve the
overall average and worst-case behavior for query
response as well as provide an environment with very
high reliability. Within practical systems it will be
possible to improve the query response time performance
as well as reliability over comparable systems without
replication.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "access methods; algorithms; analysis; data base
systems; data processing --- file organization; data
structures; database systems; replication; searching",
oldlabel = "geom-100",
subject = "Information Systems --- Database Management (H.2);
Information Systems --- Database Management ---
Physical Design (H.2.2): {\bf Access methods};
Information Systems --- Information Storage and
Retrieval --- Information Search and Retrieval (H.3.3):
{\bf Search process}",
}
@Article{Raghavan:1979:EDR,
author = "Vijay V. Raghavan and C. T. Yu",
title = "Experiments on the Determination of the Relationships
Between Terms",
journal = j-TODS,
volume = "4",
number = "2",
pages = "240--260",
month = jun,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-2/p240-raghavan/p240-raghavan.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-2/p240-raghavan/",
abstract = "The retrieval effectiveness of an automatic method
that uses relevance judgments for the determination of
positive as well as negative relationships between
terms is evaluated. The term relationships are
incorporated into the retrieval process by using a
generalized similarity function that has a term match
component, a positive term relationship component, and
a negative term relationship component. Two strategies,
query partitioning and query clustering, for the
evaluation of the effectiveness of the term
relationships are investigated. The latter appears to
be more attractive from linguistic as well as economic
points of view. The positive and the negative
relationships are verified to be effective both when
used individually, and in combination. The importance
attached to the term relationship components relative
to that of term match component is found to have a
substantial effect on the retrieval performance. The
usefulness of discriminant analysis as a technique for
determining the relative importance of these components
is investigated.",
acknowledgement = ack-nhfb,
classification = "723; 901",
fjournal = "ACM Transactions on Database Systems",
keywords = "antonym; document retrieval; feedback; information
science; pseudoclassification; semantics; statistical
discrimination; synonym; term associations; thesaurus",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Search and Retrieval (H.3.3);
Information Systems --- Information Storage and
Retrieval --- Content Analysis and Indexing (H.3.1):
{\bf Thesauruses}; Information Systems --- Database
Management --- Database Applications (H.2.8): {\bf
Statistical databases}",
}
@Article{Lipski:1979:SIC,
author = "Witold {Lipski, Jr.}",
title = "On Semantic Issues Connected with Incomplete
Information Databases",
journal = j-TODS,
volume = "4",
number = "3",
pages = "262--296",
month = sep,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Ai/nonmono.bib; Compendex database;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-3/p262-lipski/p262-lipski.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-3/p262-lipski/",
abstract = "Various approaches to interpreting queries in a
database with incomplete information are discussed. A
simple model of a database is described, based on
attributes which can take values in specified attribute
domains. Information incompleteness means that instead
of having a single value of an attribute, we have a
subset of the attribute domain, which represents our
knowledge that the actual value, though unknown, is one
of the values in this subset. This extends the idea of
Codd's null value, corresponding to the case when this
subset is the whole attribute domain. A simple query
language to communicate with such a system is described
and its various semantics are precisely defined. We
emphasize the distinction between two different
interpretations of the query language--the external
one, which refers the queries directly to the real
world modeled in an incomplete way by the system, and
the internal one, under which the queries refer to the
system's information about this world, rather than to
the world itself. Both external and internal
interpretations are provided with the corresponding
sets of axioms which serve as a basis for equivalent
transformations of queries. The technique of equivalent
transformations of queries is then extensively
exploited for evaluating the interpretation of (i.e.,
the response to) a query.",
acknowledgement = ack-nhfb,
annote = "Attributes can take values in specified attribute
domains. Instead a single value of an attribute, we
have a subset of the attribute domain, which represents
our knowledge that the actual value, though unknown, is
one of the values in this subset. This extends the idea
of Codd's null value, corresponding to the case when
this subset is the whole attribute domain.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; database; incomplete information;
model logic; null values; query language semantics;
relational model",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Information
Systems --- Database Management --- Systems (H.2.4):
{\bf Relational databases}; Information Systems ---
Database Management --- Languages (H.2.3): {\bf Query
languages}",
}
@Article{Aho:1979:TJR,
author = "A. V. Aho and C. Beeri and J. D. Ullman",
title = "The theory of joins in relational databases",
journal = j-TODS,
volume = "4",
number = "3",
pages = "297--314",
month = sep,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "See corrigendum \cite{Ullman:1983:CTJ}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-3/p297-aho/p297-aho.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-3/p297-aho/",
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 {\em
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.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; decomposition of database schemes;
functional dependencies; lossless join; multivalued
dependencies; natural join; projection of dependencies;
relational databases",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Models and Principles ---
Systems and Information Theory (H.1.1)",
}
@Article{Fagin:1979:EHF,
author = "Ronald Fagin and J{\"u}rg Nievergelt and Nicholas
Pippenger and H. Raymond Strong",
title = "Extendible Hashing --- {A} Fast Access Method for
Dynamic Files",
journal = j-TODS,
volume = "4",
number = "3",
pages = "315--344",
month = sep,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/bin-packing.bib; Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: IBM, Research Report RJ2305,
Jul. 1978.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-3/p315-fagin/p315-fagin.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-3/p315-fagin/",
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.",
acknowledgement = ack-nhfb,
annote = "The user is guaranteed no more than two page faults to
locate the data associated with a given unique
identifier, or key. Extendible hashing has a dynamic
structure that grows and shrinks as the database grows
and shrinks.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "access method; B-tree; data processing; directory;
extendible hashing; external hashing; file
organization; Hashing; hashing; index; radix search;
searching; trie",
subject = "Information Systems --- Database Management ---
Physical Design (H.2.2): {\bf Access methods};
Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}; Information Systems --- Information
Storage and Retrieval --- Information Search and
Retrieval (H.3.3): {\bf Search process}",
}
@Article{Lam:1979:PSH,
author = "Chat Yu Lam and Stuart E. Madnick",
title = "Properties of Storage Hierarchy Systems with Multiple
Page Sizes and Redundant Data",
journal = j-TODS,
volume = "4",
number = "3",
pages = "345--367",
month = sep,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1979-4-3/p345-lam/",
abstract = "The need for high performance, highly reliable storage
for very large on-line databases, coupled with rapid
advances in storage device technology, has made the
study of generalized storage hierarchies an important
area of research.\par
This paper analyzes properties of a data storage
hierarchy system specifically designed for handling
very large on-line databases. To attain high
performance and high reliability, the data storage
hierarchy makes use of multiple page sizes in different
storage levels and maintains multiple copies of the
same information across the storage levels. Such a
storage hierarchy system is currently being designed as
part of the INFOPLEX database computer project.
Previous studies of storage hierarchies have primarily
focused on virtual memories for program storage and
hierarchies with a single page size across all storage
levels and/or a single copy of information in the
hierarchy.\par
In the INFOPLEX design, extensions to the least
recently used (LRU) algorithm are used to manage the
storage levels. The read-through technique is used to
initially load a referenced page of the appropriate
size into all storage levels above the one in which the
page is found. Since each storage level is viewed as an
extension of the immediate higher level, an overflow
page from level $i$ is always placed in level $i + 1$.
Important properties of these algorithms are derived.
It is shown that depending on the types of algorithms
used and the relative sizes of the storage levels, it
is not always possible to guarantee that the contents
of a given storage level $i$ is always a superset of
the contents of its immediate higher storage level $i -
1$. The necessary and sufficient conditions for this
property to hold are identified and proved.
Furthermore, it is possible that increasing the size of
intermediate storage levels may actually increase the
number of references to lower storage levels, resulting
in reduced performance. Conditions necessary to avoid
such an anomaly are also identified and proved.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; data storage hierarchy; database
computer; inclusion properties; modeling; perform and
reliability analysis; storage management algorithms;
very large databases",
subject = "Information Systems --- Database Management (H.2);
Software --- Operating Systems --- Storage Management
(D.4.2): {\bf Storage hierarchies}",
}
@Article{Buneman:1979:EMR,
author = "O. Peter Buneman and Eric K. Clemons",
title = "Efficiently Monitoring Relational Databases",
journal = j-TODS,
volume = "4",
number = "3",
pages = "368--382",
month = sep,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: Working paper, 76-10-08, Dep.
Decision Sciences, The Wharton School, Un. Penn, PA,
Jun. 1977.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-3/p368-buneman/p368-buneman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-3/p368-buneman/",
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.",
acknowledgement = ack-nhfb,
annote = "An alerter monitors a database and reports when a
specific condition occurs. Alerters may be placed on a
query, a method is demonstrated for reducing the amount
of computation involved in checking whether an alerter
should be triggered. Recomputation of derived data with
pruning, viz. identity connection.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "alerters; data base systems; exception reporting;
integrity constraints; programming techniques;
relational databases",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases}",
}
@Article{Comer:1979:HTI,
author = "Douglas Comer",
title = "Heuristics For Trie Index Minimization",
journal = j-TODS,
volume = "4",
number = "3",
pages = "383--395",
month = sep,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-3/p383-comer/p383-comer.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-3/p383-comer/",
abstract = "A trie is a digital search tree in which leaves
correspond to records in a file. Searching proceeds
from the root to a leaf, where the edge taken at each
node depends on the value of an attribute in the query.
Trie implementations have the advantage of being fast,
but the disadvantage of achieving that speed at great
expense in storage space. Of primary concern in making
a trie practical, therefore, is the problem of
minimizing storage requirements. One method for
reducing the space required is to reorder attribute
testing. Unfortunately, the problem of finding an
ordering which guarantees a minimum-size trie is
NP-complete. In this paper we investigate several
heuristics for reordering attributes, and derive bounds
on the sizes of the worst tries produced by them in
terms of the underlying file. Although the analysis is
presented for a binary file, extensions to files of
higher degree are shown.\par
Another alternative for reducing the space required by
a trie is an implementation, called an $\Omega$-trie,
in which the order of attribute testing is contained in
the trie itself. We show that for most applications,
$\Omega$-tries are smaller than other implementations
of tries, even when heuristics for improving storage
requirements are employed.",
acknowledgement = ack-nhfb,
annote = "Of primary concern in making a trie practical is the
problem of minimizing storage requirements. One method
for reducing the space is attribute testing which is
NP-complete. Another alternative is an $\Omega$-trie,
in which the order of attribute testing is contained in
the trie itself. $\Omega$-tries are smaller than other
implementations of tries.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data processing; doubly chained tree; index; trie;
trie minimization",
subject = "Data --- Data Structures (E.1); Information Systems
--- Database Management (H.2)",
}
@Article{Codd:1979:EDR,
author = "E. F. Codd",
title = "Extending the Database Relational Model to Capture
More Meaning",
journal = j-TODS,
volume = "4",
number = "4",
pages = "397--434",
month = dec,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Ai/nonmono.bib; Compendex database;
Compiler/prog.lang.theory.bib; Database/Graefe.bib;
Database/Wiederhold.bib; Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/; Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Reprinted in
\cite[pp.~457--475]{Stonebraker:1988:RDS}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-4/p397-codd/p397-codd.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-4/p397-codd/",
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.\par
(1) the search for meaningful units that are as small
as possible-- {\em atomic semantics\/};\par
(2) the search for meaningful units that are larger
than the usual $n$-ary relation-- {\em molecular
semantics}.\par
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.",
acknowledgement = ack-nhfb,
acmcrnumber = "8905-0330",
annote = "``Semantic models'' for formatted databases, to
capture in a more or less formal way more of the
meaning of the data. Two major thrusts: relation and
molecular semantics. Extensions to the relational model
(RM/T). New rules for insertion, update, and deletion,
as well as new algebraic operators (Theta-select, outer
join,\ldots{}.).",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "conceptual model; conceptual schema; data base
systems; data model; data semantics; database; database
schema; entity model; knowledge base; knowledge
representation; relation; relational database;
relational model; relational schema; semantic model",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Data models}; Information Systems
--- Database Management --- Logical Design (H.2.1):
{\bf Schema and subschema}",
}
@Article{Aho:1979:EOC,
author = "A. V. Aho and Y. Sagiv and J. D. Ullman",
title = "Efficient Optimization of a Class of Relational
Expressions",
journal = j-TODS,
volume = "4",
number = "4",
pages = "435--454",
month = dec,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-4/p435-aho/p435-aho.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-4/p435-aho/",
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. Although the
optimization problem is NP-complete, a polynomial time
algorithm exists to optimize tableaux that correspond
to an important subclass of queries.",
acknowledgement = ack-nhfb,
annote = "Optimizing queries based on select, project, and
join.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems, TODS tableaux optimization;
equivalence of queries; NP-completeness; query
optimization; relational algebra; relational database;
tableaux",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Query processing}",
}
@Article{Maier:1979:TID,
author = "David Maier and Alberto O. Mendelzon and Yehoshua
Sagiv",
title = "Testing Implications of Data Dependencies",
journal = j-TODS,
volume = "4",
number = "4",
pages = "455--469",
month = dec,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-4/p455-maier/p455-maier.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-4/p455-maier/",
abstract = "Presented is a computation method --- the {\em
chase\/} --- for testing implication of data
dependencies by a set of data dependencies. The chase
operates on tableaux similar to those of Aho, Sagiv,
and Ullman. The chase includes previous tableau
computation methods as special cases. By interpreting
tableaux alternately as mappings or as templates for
relations, it is possible to test implication of join
dependencies (including multivalued dependencies) and
functional dependencies by a set of dependencies.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "chase; data base systems; data dependencies;
functional dependencies; join dependencies; multivalued
dependencies; relational databases; tableaux",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases}",
}
@Article{Housel:1979:PTI,
author = "Barron C. Housel",
title = "Pipelining: {A} Technique for Implementing Data
Restructurers",
journal = j-TODS,
volume = "4",
number = "4",
pages = "470--492",
month = dec,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-4/p470-housel/p470-housel.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-4/p470-housel/",
abstract = "In the past several years much attention has been
given to the problem of data translation. The focus has
been mainly on methodologies and specification
languages for accomplishing this task. Recently,
several prototype systems have emerged, and now the
issues of implementation and performance must be
addressed. In general, a data restructuring
specification may contain multiple source and target
files. This specification can be viewed as a ``process
graph'' which is a network of restructuring operations
subject to precedence constraints. One technique used
to achieve good performance is that of pipelining data
in the process graph.\par
In this paper we address a number of issues pertinent
to a pipelining architecture. Specifically, we give
algorithms for resolving deadlock situations which can
arise, and partitioning the process graph to achieve an
optimal schedule for executing the restructuring steps.
In addition, we discuss how pipelining has influenced
the design of the restructuring operations and the file
structures used in an actual system.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data processing; data translation; database
conversion; deadlock; pipelining; process scheduling",
subject = "Information Systems --- Database Management ---
Heterogeneous Databases (H.2.5): {\bf Data
translation**}; Information Systems --- Database
Management --- Physical Design (H.2.2): {\bf Deadlock
avoidance}",
}
@Article{Shopiro:1979:TPL,
author = "Jonathan E. Shopiro",
title = "{Theseus} --- {A} Programming Language for Relational
Databases",
journal = j-TODS,
volume = "4",
number = "4",
pages = "493--517",
month = dec,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-4/p493-shopiro/p493-shopiro.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-4/p493-shopiro/",
abstract = "Theseus, a very high-level programming language
extending EUCLID, is described. Data objects in Theseus
include relations and a-sets, a generalization of
records. The primary design goals of Theseus are to
facilitate the writing of well-structured programs for
database applications and to serve as a vehicle for
research in automatic program optimization.",
acknowledgement = ack-nhfb,
annote = "Extending EUCLID. Data objects in Theseus include
relations and a-sets",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "compiler organization; computer programming languages;
data base systems; relational database languages; very
high-level languages",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management ---
Languages (H.2.3): {\bf Database (persistent)
programming languages}",
}
@Article{Yamamoto:1979:DBM,
author = "Sumiyasu Yamamoto and Shinsei Tazawa and Kazuhiko
Ushio and Hideto Ikeda",
title = "Design of a Balanced Multiple-Valued File-Organization
Scheme with the Least Redundancy",
journal = j-TODS,
volume = "4",
number = "4",
pages = "518--530",
month = dec,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-4/p518-yamamoto/p518-yamamoto.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-4/p518-yamamoto/",
abstract = "A new balanced file-organization scheme of order two
for multiple-valued records is presented. This scheme
is called HUBMFS 2 (Hiroshima University Balanced
Multiple-valued File-organization Scheme of order two).
It is assumed that records are characterized by $m$
attributes having $n$ possible values each, and the
query set consists of queries which specify values of
two attributes. It is shown that the redundancy of the
bucket (the probability of storing a record in the
bucket) is minimized if and only if the structure of
the bucket is a partite-claw. A necessary and
sufficient condition for the existence of an HUBMFS 2,
which is composed exclusively of partite-claw buckets,
is given. A construction algorithm is also given. The
proposed HUBMFS 2 is superior to existing BMFS 2
(Balanced Multiple-valued File-organization Schemes of
order two) in that it has the least redundancy among
all possible BMFS 2 's having the same parameters and
that it can be constructed for a less restrictive set
of parameters.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "balanced filing scheme; bucket; claw; data processing;
file organization; graph decomposition; information
retrieval; information storage; inverted file;
multipartite graph; multiple-valued attributes;
redundancy; secondary index",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}; Information Systems --- Database
Management --- Logical Design (H.2.1): {\bf Schema and
subschema}; Information Systems --- Information Storage
and Retrieval --- Information Storage (H.3.2)",
}
@Article{Batory:1979:STF,
author = "Don S. Batory",
title = "On Searching Transposed Files",
journal = j-TODS,
volume = "4",
number = "4",
pages = "531--544",
month = dec,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-4/p531-batory/p531-batory.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-4/p531-batory/",
abstract = "A transposed file is a collection of nonsequential
files called subfiles. Each subfile contains selected
attribute data for all records. It is shown that
transposed file performance can be enhanced by using a
proper strategy to process queries. Analytic cost
expressions for processing conjunctive, disjunctive,
and batched queries are developed and an effective
heuristic for minimizing query processing costs is
presented. Formulations of the problem of optimally
processing queries for a particular family of
transposed files are shown to be NP-complete. Query
processing performance comparisons of multilist,
inverted, and nonsequential files with transposed files
are also considered.",
acknowledgement = ack-nhfb,
annote = "Analytic cost expressions for processing conjunctive,
disjunctive, and batch queries are developed and an
effective heuristic for minimizing query processing
costs is presented.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; file searching; inverted file;
multilist; NP-complete; query processing; transposed
file",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}; Information Systems --- Information
Storage and Retrieval --- Information Search and
Retrieval (H.3.3): {\bf Search process}",
}
@Article{Bernstein:1979:CPS,
author = "Philip A. Bernstein and Marco A. Casanova and Nathan
Goodman",
title = "Comments on {``Process Synchronization in Database
Systems''}",
journal = j-TODS,
volume = "4",
number = "4",
pages = "545--546",
month = dec,
year = "1979",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "See \cite{Schlageter:1978:PSD}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1979-4-4/p545-bernstein/p545-bernstein.pdf;
http://www.acm.org/pubs/citations/journals/tods/1979-4-4/p545-bernstein/",
acknowledgement = ack-nhfb,
annote = "The results of Schlageter are in error.",
fjournal = "ACM Transactions on Database Systems",
subject = "Information Systems --- Database Management (H.2)",
}
@Article{Rothnie:1980:ISD,
author = "James B. {Rothnie, Jr.} and Philip A. Bernstein and S.
Fox and N. Goodman and M. Hammer and T. A. Landers and
C. Reeve and David W. Shipman and E. Wong",
title = "Introduction to a System for Distributed Databases
({SDD-1})",
journal = j-TODS,
volume = "5",
number = "1",
pages = "1--17",
month = mar,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib;
Distributed/fault.tolerant.bib;
http://www.acm.org/pubs/toc/; Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-1/p1-rothnie/p1-rothnie.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-1/p1-rothnie/",
abstract = "The declining cost of computer hardware and the
increasing data processing needs of geographically
dispersed organizations have led to substantial
interest in distributed data management. SDD-1 is a
distributed database management system currently being
developed by Computer Corporation of America. Users
interact with SDD-1 precisely as if it were a
nondistributed database system because SDD-1 handles
all issues arising from the distribution of data. These
issues include distributed concurrency control,
distributed query processing, resiliency to component
failure, and distributed directory management. This
paper presents an overview of the SDD-1 design and its
solutions to the above problems.\par
This paper is the first of a series of companion papers
on SDD-1 (Bernstein and Shipman [2], Bernstein et al.
[4], and Hammer and Shipman [14]).",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "concurrency control; data base systems; database
reliability; distributed database system; query
processing; relational data model",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Distributed databases};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Relational databases}; Information
Systems --- Database Management --- Systems (H.2.4):
{\bf Concurrency}; Information Systems --- Database
Management --- Systems (H.2.4): {\bf Query
processing}",
}
@Article{Bernstein:1980:CCS,
author = "Philip A. Bernstein and David W. Shipman and James B.
{Rothnie, Jr.}",
title = "Concurrency Control in a System for Distributed
Databases ({SDD-1})",
journal = j-TODS,
volume = "5",
number = "1",
pages = "18--51",
month = mar,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
Distributed/fault.tolerant.bib;
http://www.acm.org/pubs/toc/; Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-1/p18-bernstein/p18-bernstein.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-1/p18-bernstein/",
abstract = "This paper presents the concurrency control strategy
of SDD-1. SDD-1, a System for Distributed Databases, is
a prototype distributed database system being developed
by Computer Corporation of America. In SDD-1, portions
of data distributed throughout a network may be
replicated at multiple sites. The SDD-1 concurrency
control guarantees database consistency in the face of
such distribution and replication.\par
This paper is one of a series of companion papers on
SDD-1 [4, 10, 12, 21].",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "concurrency control; conflict graph; data base
systems; distributed database system; serializability;
synchronization; timestamps",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Concurrency}; Information Systems
--- Database Management --- Systems (H.2.4): {\bf
Distributed databases}",
}
@Article{Bernstein:1980:CCCb,
author = "Philip A. Bernstein and David W. Shipman",
title = "Correctness of Concurrency Control Mechanisms in a
System for Distributed Databases ({SDD-1})",
journal = j-TODS,
volume = "5",
number = "1",
pages = "52--68",
month = mar,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-1/p52-bernstein/p52-bernstein.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-1/p52-bernstein/",
abstract = "This paper presents a formal analysis of the
concurrency control strategy of SDD-1. SDD-1, a System
for Distributed Databases, is a prototype distributed
database system being developed by Computer Corporation
of America. In SDD-1, portions of data distributed
throughout a network may be replicated at multiple
sites. The SDD-1 concurrency control guarantees
database consistency in the face of such distribution
and replication.\par
This paper is one of a series of companion papers on
SDD-1 [2, 8].",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "conflict graph; correctness of concurrency control;
data base systems; distributed database system;
serializability theory",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Distributed databases};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Concurrency}",
}
@Article{Gopalakrishna:1980:PEA,
author = "V. Gopalakrishna and C. E. {Veni Madhavan}",
title = "Performance Evaluation of Attribute-Based Tree
Organization",
journal = j-TODS,
volume = "5",
number = "1",
pages = "69--87",
month = mar,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-1/p69-gopalakrishna/p69-gopalakrishna.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-1/p69-gopalakrishna/",
abstract = "A modified version of the multiple attribute tree
(MAT) database organization, which uses a compact
directory, is discussed. An efficient algorithm to
process the directory for carrying out the node
searches is presented. Statistical procedures are
developed to estimate the number of nodes searched and
the number of data blocks retrieved for most general
and complex queries. The performance of inverted file
and modified MAT organizations are compared using six
real-life databases and four types of query
complexities. Careful tradeoffs are established in
terms of storage and access times for directory and
data, query complexities, and database
characteristics.",
acknowledgement = ack-nhfb,
annote = "A version of the multiple attribute tree (MAT)
database organization. Statistical procedures are
developed to estimate the number of nodes searched and
the number of data blocks retrieved. The performance of
inverted file and modified MAT organizations are
compared.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "access time; average retrieval time per query; data
base systems; database organization; database
performance; directory search time; modified multiple
attribute tree; query complexity; secondary index
organization",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}; Information
Systems --- Information Storage and Retrieval ---
Information Search and Retrieval (H.3.3)",
}
@Article{Denning:1980:FPF,
author = "Dorothy E. Denning and Jan Schl{\"o}rer",
title = "Fast Procedure for Finding a Tracker in a Statistical
Database",
journal = j-TODS,
volume = "5",
number = "1",
pages = "88--102",
month = mar,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-1/p88-denning/p88-denning.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-1/p88-denning/",
abstract = "To avoid trivial compromises, most on-line statistical
databases refuse to answer queries for statistics about
small subgroups. Previous research discovered a
powerful snooping tool, the tracker, with which the
answers to these unanswerable queries are easily
calculated. However, the extent of this threat was not
clear, for no one had shown that finding a tracker is
guaranteed to be easy.\par
This paper gives a simple algorithm for finding a
tracker when the maximum number of identical records is
not too large. The number of queries required to find a
tracker is at most {$O(\log_2 S)$} queries, where {$S$}
is the number of distinct records possible.
Experimental results show that the procedure often
finds a tracker with just a few queries. The threat
posed by trackers is therefore considerable.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "confidentiality; data base systems; data security;
database security; statistical database; tracker",
subject = "Information Systems --- Database Management ---
Database Applications (H.2.8): {\bf Statistical
databases}; Information Systems --- Database Management
--- Database Administration (H.2.7): {\bf Security,
integrity, and protection}",
}
@Article{Menasce:1980:LPR,
author = "Daniel A. Menasc{\'e} and Gerald J. Popek and Richard
R. Muntz",
title = "A Locking Protocol for Resource Coordination in
Distributed Databases",
journal = j-TODS,
volume = "5",
number = "2",
pages = "103--138",
month = jun,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
Distributed/fault.tolerant.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-2/p103-menasce/p103-menasce.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-2/p103-menasce/",
abstract = "A locking protocol to coordinate access to a
distributed database and to maintain system consistency
throughout normal and abnormal conditions is presented.
The proposed protocol is robust in the face of crashes
of any participating site, as well as communication
failures. Recovery from any number of failures during
normal operation or any of the recovery stages is
supported. Recovery is done in such a way that maximum
forward progress is achieved by the recovery
procedures. Integration of virtually any locking
discipline including predicate lock methods is
permitted by this protocol. The locking algorithm
operates, and operates correctly, when the network is
partitioned, either intentionally or by failure of
communication lines. Each partition is able to continue
with work local to it, and operation merges gracefully
when the partitions are reconnected.\par
A subroutine of the protocol, that assures reliable
communication among sites, is shown to have better
performance than two-phase commit methods. For many
topologies of interest, the delay introduced by the
overall protocol is not a direct function of the size
of the network. The communications cost is shown to
grow in a relatively slow, linear fashion with the
number of sites participating in the transaction. An
informal proof of the correctness of the algorithm is
also presented in this paper.\par
The algorithm has as its core a centralized locking
protocol with distributed recovery procedures. A
centralized controller with local appendages at each
site coordinates all resource control, with requests
initiated by application programs at any site. However,
no site experiences undue load. Recovery is broken down
into three disjoint mechanisms: for single node
recovery, merge of partitions, and reconstruction of
the centralized controller and tables. The disjointness
of the mechanisms contributes to comprehensibility and
ease of proof.\par
The paper concludes with a proposal for an extension
aimed at optimizing operation of the algorithm to adapt
to highly skewed distributions of activity. The
extension applies nicely to interconnected computer
networks.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "concurrency; consistency; crash recovery; distributed
databases; locking protocol",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Concurrency}; Information Systems
--- Database Management --- Systems (H.2.4): {\bf
Distributed databases}",
}
@Article{Bayer:1980:PRD,
author = "R. Bayer and H. Heller and A. Reiser",
title = "Parallelism and Recovery in Database Systems",
journal = j-TODS,
volume = "5",
number = "2",
pages = "139--156",
month = jun,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-2/p139-bayer/p139-bayer.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-2/p139-bayer/",
abstract = "In this paper a new method to increase parallelism in
database systems is described. Use is made of the fact
that for recovery reasons, we often have two values for
one object in the database--the new one and the old
one. Introduced and discussed in detail is a certain
scheme by which readers and writers may work
simultaneously on the same object. It is proved that
transactions executed according to this scheme have the
correct effect; i.e., consistency is preserved. Several
variations of the basic scheme which are suitable
depending on the degree of parallelism required, are
described.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "concurrency; consistency; data base systems; deadlock;
integrity; recovery; synchronization; transaction; two
phase locking",
subject = "Information Systems --- Database Management ---
Physical Design (H.2.2): {\bf Recovery and restart};
Information Systems --- Database Management ---
Physical Design (H.2.2): {\bf Deadlock avoidance};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Concurrency}; Information Systems ---
Database Management --- Systems (H.2.4): {\bf
Transaction processing}",
}
@Article{Navathe:1980:SAD,
author = "Shamkant B. Navathe",
title = "Schema Analysis for Database Restructuring",
journal = j-TODS,
volume = "5",
number = "2",
pages = "157--184",
month = jun,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: Proceedings of the Third
Conference on Very Large Databases, Morgan Kaufman
pubs. (Los Altos CA), 1977.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-2/p157-navathe/p157-navathe.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-2/p157-navathe/",
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.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; data model; data relationships;
data semantics; data structure; database; database
design; database management systems; database
restructuring; graphical representation of data;
schema; stored data",
subject = "Information Systems --- Database Management (H.2);
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Schema and subschema}; Information
Systems --- Database Management --- Logical Design
(H.2.1): {\bf Data models}; Information Systems ---
Database Management --- Systems (H.2.4): {\bf
Relational databases}",
}
@Article{Mylopoulos:1980:LFD,
author = "John Mylopoulos and Philip A. Bernstein and Harry K.
T. Wong",
title = "A Language Facility for Designing Database-Intensive
Applications",
journal = j-TODS,
volume = "5",
number = "2",
pages = "185--207",
month = jun,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/; Misc/is.bib;
Object/Nierstrasz.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-2/p185-mylopoulos/p185-mylopoulos.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-2/p185-mylopoulos/",
abstract = "TAXIS, a language for the design of interactive
information systems (e.g., credit card verification,
student-course registration, and airline reservations)
is described. TAXIS offers (relational) database
management facilities, a means of specifying semantic
integrity constraints, and an exception-handling
mechanism, integrated into a single language through
the concepts of {\em class, property}, and the {\em
IS-A\/} (generalization) {\em relationship}. A
description of the main constructs of TAXIS is included
and their usefulness illustrated with examples.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "abstract data type; applications programming;
exception handling; information system; relational data
model; semantic network",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Data models}; Information Systems
--- Database Management --- Languages (H.2.3)",
}
@Article{Lozinskii:1980:CRR,
author = "Eliezer L. Lozinskii",
title = "Construction of Relations in Relational Databases",
journal = j-TODS,
volume = "5",
number = "2",
pages = "208--224",
month = jun,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-2/p208-lozinskii/p208-lozinskii.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-2/p208-lozinskii/",
abstract = "Using a nonprocedural language for query formulation
requires certain automatization of a query answering
process. Given a query for creation of a new relation,
the problem is to find an efficient procedure which
produces this relation from a given relational
database. The author concentrates upon sequences of
join operations which losslessly produce a relation
required by a query. A new property of such sequences
is analyzed which provides a basis for the presented
algorithms that construct an efficient join procedure.
The algorithms have polynomial complexity. A modified
AND\slash OR graph is used for the display of a given
set of dependencies and a collection of relations
representing a database.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "algorithms; AND/OR graphs; data base systems; lossless
joins; query answering; relational databases",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases}",
}
@Article{Stonebraker:1980:RDS,
author = "Michael Stonebraker",
title = "Retrospection on a Database System",
journal = j-TODS,
volume = "5",
number = "2",
pages = "225--240",
month = jun,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Reprinted in \cite{Stonebraker:1988:RDS}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-2/p225-stonebraker/p225-stonebraker.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-2/p225-stonebraker/",
abstract = "This paper describes the implementation history of the
INGRES database system. It focuses on mistakes that
were made in progress rather than on eventual
corrections. Some attention is also given to the role
of structured design in a database system
implementation and to the problem of supporting
nontrivial users. Lastly, miscellaneous impressions of
UNIX, the PDP-11, and data models are given.",
acknowledgement = ack-nhfb,
annote = "The implementation history of the INGRES database
system. The role of structured design in a database
system implementation, impressions of UNIX, the PDP-11,
and data models are given.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "concurrency; data base systems, history evaluation,
Ingres, TODS; integrity; nonprocedural languages;
protection; recovery; relational databases",
subject = "Information Systems --- Database Management ---
Systems (H.2.4); Information Systems --- Database
Management --- Systems (H.2.4): {\bf Relational
databases}; Information Systems --- Database Management
--- Physical Design (H.2.2): {\bf Recovery and
restart}; Information Systems --- Database Management
--- Systems (H.2.4): {\bf Concurrency}",
}
@Article{Beeri:1980:MPF,
author = "Catriel Beeri",
title = "On the Membership Problem for Functional and
Multivalued Dependencies in Relational Databases",
journal = j-TODS,
volume = "5",
number = "3",
pages = "241--259",
month = sep,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-3/p241-beeri/p241-beeri.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-3/p241-beeri/",
abstract = "The problem of whether a given dependency in a
database relation can be derived from a given set of
dependencies is investigated. We show that the problem
can be decided in polynomial time when the given set
consists of either multivalued dependencies only or of
both functional and multivalued dependencies and the
given dependency is also either a functional or a
multivalued dependency. These results hold when the
derivations are restricted not to use the
complementation rule.",
acknowledgement = ack-nhfb,
annote = "The problem of whether a given dependency in a
database relation can be derived from a given set of
dependencies is investigated. We show that the problem
can be decided in polynomial time when the given set
consists of either multivalued dependencies only or of
both functional and multivalued dependencies and the
given dependency is also either a functional or a
multivalued dependency. These results hold when the
derivations are restricted not to use the
complementation rule.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; functional dependency; inference
rule; membership; multivalued dependency; relations",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases}",
}
@Article{Klug:1980:CCR,
author = "A. Klug",
title = "Calculating Constraints on Relational Expressions",
journal = j-TODS,
volume = "5",
number = "3",
pages = "260--290",
month = sep,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-3/p260-klug/p260-klug.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-3/p260-klug/",
abstract = "This paper deals with the problem of determining which
of a certain class of constraints hold on a given
relational algebra expression where the base relations
come from a given schema. The class of constraints
includes functional dependencies, equality of domains,
and constancy of domains. The relational algebra
consists of projection, selection, restriction, cross
product, union, and difference. The problem as given is
undecidable, but if set difference is removed from the
algebra, there is a solution. Operators specifying a
closure function (similar to functional dependency
closure on one relation) are defined; these will
generate exactly the set of constraints valid on the
given relational algebra expression. We prove that the
operators are sound and complete.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "completeness; constraints; data base systems;
derivation rules; functional dependencies; Views",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases}",
}
@Article{Denning:1980:SSD,
author = "Dorothy E. Denning",
title = "Secure Statistical Databases with Random Sample
Queries",
journal = j-TODS,
volume = "5",
number = "3",
pages = "291--315",
month = sep,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-3/p291-denning/p291-denning.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-3/p291-denning/",
abstract = "A new inference control, called random sample queries,
is proposed for safeguarding confidential data in
on-line statistical databases. The random sample
queries control deals directly with the basic principle
of compromise by making it impossible for a questioner
to control precisely the formation of query sets.
Queries for relative frequencies and averages are
computed using random samples drawn from the query
sets. The sampling strategy permits the release of
accurate and timely statistics and can be implemented
at very low cost. Analysis shows the relative error in
the statistics decreases as the query set size
increases; in contrast, the effort required to
compromise increases with the query set size due to
large absolute errors. Experiments performed on a
simulated database support the analysis.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "confidentiality; data base systems; database security;
disclosure controls; sampling; statistical database",
subject = "Information Systems --- Database Management ---
Database Applications (H.2.8): {\bf Statistical
databases}; Information Systems --- Database Management
--- Systems (H.2.4): {\bf Query processing};
Information Systems --- Database Management ---
Database Administration (H.2.7): {\bf Security,
integrity, and protection}",
}
@Article{Beck:1980:SMS,
author = "Leland L. Beck",
title = "A security mechanism for statistical database",
journal = j-TODS,
volume = "5",
number = "3",
pages = "316--338",
month = sep,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-3/p316-beck/p316-beck.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-3/p316-beck/",
abstract = "The problem of user inference in statistical databases
is discussed and illustrated with several examples. It
is assumed that the database allows ``total'',
``average'', ``count'', and ``percentile'' queries; a
query may refer to any arbitrary subset of the
database. Methods for protecting the security of such a
database are considered; it is shown that any scheme
which gives ``statistically correct'' answers is
vulnerable to penetration. A precise definition of
compromisability (in a statistical sense) is given. A
general model of user inference is proposed; two
special cases of this model appear to contain all
previously published strategies for compromising a
statistical database. A method for protecting the
security of such a statistical database against these
types of user inference is presented and discussed. It
is shown that the number of queries required to
compromise the database can be made arbitrarily large
by accepting moderate increases in the variance of
responses to queries. A numerical example is presented
to illustrate the application of the techniques
discussed.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "compromisability; data base systems; data security;
database inference; privacy protection; statistical
databases; statistical queries",
subject = "Information Systems --- Database Management ---
General (H.2.0): {\bf Security, integrity, and
protection**}; Information Systems --- Database
Management --- Systems (H.2.4): {\bf Query processing};
Information Systems --- Database Management ---
Database Applications (H.2.8): {\bf Statistical
databases}",
}
@Article{Lee:1980:QTF,
author = "D. T. Lee and C. K. Wong",
title = "Quintary Trees: {A} File Structure for
Multidimensional Database Systems",
journal = j-TODS,
volume = "5",
number = "3",
pages = "339--353",
month = sep,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
Graphics/siggraph/80.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-3/p339-lee/p339-lee.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-3/p339-lee/",
abstract = "A file structure is presented that was designed for a
database system in which four types of retrieval
requests (queries) are allowed: exact match, partial
match, range, and partial range queries. Outlines are
sketched for inserting and deleting records that
require O(k plus (log N)**k) time, on the average. This
structure achieves faster response time than previously
known structures (for many of the queries) at the cost
of extra storage.",
acknowledgement = ack-nhfb,
annote = "Four types of retrieval (queries) are allowed: exact
match, partial match, range, and partial range queries.
Faster response time at the cost of extra storage.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; data processing --- data
structures; database system; exact match queries; file
maintenance; information retrieval; key;
multidimensional space; queries; range search; search",
subject = "Data --- Data Structures (E.1): {\bf Trees};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Query processing}; Information Systems
--- Information Storage and Retrieval --- Information
Storage (H.3.2): {\bf File organization}; Information
Systems --- Information Storage and Retrieval ---
Information Search and Retrieval (H.3.3)",
}
@Article{Kung:1980:CMB,
author = "H. T. Kung and Philip L. Lehman",
title = "Concurrent Manipulation of Binary Search Trees",
journal = j-TODS,
volume = "5",
number = "3",
pages = "354--382",
month = sep,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-3/p354-kung/p354-kung.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-3/p354-kung/",
abstract = "The concurrent manipulation of a binary search tree is
considered in this paper. The systems presented can
support any number of concurrent processes which
perform searching, insertion, deletion, and rotation
(reorganization) on the tree, but allow any process to
lock only a constant number of nodes at any time. Also,
in the systems, searches are essentially never blocked.
The concurrency control techniques introduced in the
paper include the use of special nodes and pointers to
redirect searches, and the use of copies of sections of
the tree to introduce many changes simultaneously and
therefore avoid unpredictable interleaving. Methods
developed in this paper may provide new insights into
other problems in the area of concurrent database
manipulation.",
acknowledgement = ack-nhfb,
annote = "Operations on tries are defined so that concurrency of
access is possible while the number of locked nodes is
minimal.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "binary search trees; concurrency controls; concurrent
algorithm; consistency; correctness; data processing;
data structures; databases; locking protocols",
subject = "Data --- Data Structures (E.1): {\bf Trees};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Concurrency}",
}
@Article{Denning:1980:CLQ,
author = "D. E. Denning",
title = "Corrigenda on Linear Queries in Statistical
Databases",
journal = j-TODS,
volume = "5",
number = "3",
pages = "383--383",
month = sep,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibsource = "Database/Wiederhold.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
annote = "refers to Schwartz 1979 TODS.",
fjournal = "ACM Transactions on Database Systems",
}
@Article{Hsiao:1980:TFT,
author = "David K. Hsiao",
title = "{TODS} --- the first three years {(1976\&ndash1978)}",
journal = j-TODS,
volume = "5",
number = "4",
pages = "385--403",
month = dec,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-4/p385-hsiao/p385-hsiao.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-4/p385-hsiao/",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
subject = "General Literature --- General (A.0)",
}
@Article{Armstrong:1980:DFD,
author = "W. W. Armstrong and C. Delobel",
title = "Decompositions and Functional Dependencies in
Relations",
journal = j-TODS,
volume = "5",
number = "4",
pages = "404--430",
month = dec,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-4/p404-armstrong/p404-armstrong.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-4/p404-armstrong/",
abstract = "A general study is made of two basic integrity
constraints on relations: functional and multivalued
dependencies. The latter are studied via an equivalent
concept: decompositions. A model is constructed for any
possible combination of functional dependencies and
decompositions. The model embodies some decompositions
as unions of relations having different schemata of
functional dependencies. This suggests a new, stronger
integrity constraint, the degenerate decomposition.
More generally, the theory demonstrates the importance
of using the union operation in database design and of
allowing different schemata on the operands of a union.
Techniques based on the union lead to a method for
solving the problem of membership of a decomposition in
the closure of a given set of functional dependencies
and decompositions. The concept of antiroot is
introduced as a tool for describing families of
decompositions, and its fundamental importance for
database design is indicated.",
acknowledgement = ack-nhfb,
annote = "A general study is made of two basic integrity
constrains, functional and multivalued dependencies,
via an equivalent concept: decompositions.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; decomposition; functional
dependency; integrity constraint; multivalued
dependency; relational database",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases}",
}
@Article{Hammer:1980:RMS,
author = "Michael Hammer and David Shipman",
title = "Reliability Mechanisms for {SDD-1}: {A} System for
Distributed Databases",
journal = j-TODS,
volume = "5",
number = "4",
pages = "431--466",
month = dec,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Distributed/fault.tolerant.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-4/p431-hammer/p431-hammer.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-4/p431-hammer/",
abstract = "This paper presents the reliability mechanisms of
SDD-1, a prototype distributed database system being
developed by the Computer Corporation of America.
Reliability algorithms in SDD-1 center around the
concept of the Reliable Network (RelNet). The RelNet is
a communications medium incorporating facilities for
site status monitoring, event timestamping, multiply
buffered message delivery, and the atomic control of
distributed transactions.\par
This paper is one of a series of companion papers on
SDD-1 [3, 4, 6, 13].",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Reliability",
keywords = "atomicity; data base systems; distributed databases;
recovery; reliability",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Distributed databases};
Information Systems --- Database Management ---
Physical Design (H.2.2): {\bf Recovery and restart}",
}
@Article{Schloer:1980:SSD,
author = "Jan Schl{\"o}er",
title = "Security of statistical databases: multidimensional
transformation",
journal = j-TODS,
volume = "5",
number = "4",
pages = "467--492",
month = dec,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1980-5-4/p467-schler/",
abstract = "Statistical evaluation of databases which contain
personal records may entail risks for the
confidentiality of the individual records. The risk has
increased with the availability of flexible interactive
evaluation programs which permit the use of trackers,
the most dangerous class of snooping tools known. A
class of trackers, called union trackers, is described.
They permit reconstruction of the entire database
without supplementary knowledge and include the general
tracker recently described as a special case. For many
real statistical databases the overwhelming majority of
definable sets of records will form trackers. For such
databases a random search for a tracker is likely to
succeed rapidly. Individual trackers are redefined and
counted and their cardinalities are investigated. If
there are $n$ records in the database, then most
individual trackers employ innocent cardinalities near
$n/3$, making them difficult to detect. Disclosure with
trackers usually requires little effort per retrieved
data element.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "confidentiality; database security; security;
statistical database; tracker",
subject = "Information Systems --- Database Management ---
Database Applications (H.2.8): {\bf Statistical
databases}; Information Systems --- Database Management
--- Database Administration (H.2.7): {\bf Security,
integrity, and protection}",
xxtitle = "Disclosure from Statistical Databases: Quantitative
Aspects of Trackers",
}
@Article{Herot:1980:SMD,
author = "Christopher F. Herot",
title = "Spatial Management of Data",
journal = j-TODS,
volume = "5",
number = "4",
pages = "493--513",
month = dec,
year = "1980",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; Distributed/gesturing.bib;
Graphics/imager/imager.80.bib;
Graphics/siggraph/80.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1980-5-4/p493-herot/p493-herot.pdf;
http://www.acm.org/pubs/citations/journals/tods/1980-5-4/p493-herot/",
abstract = "Spatial data management is a technique for organizing
and retrieving information by positioning it in a
graphical data space (GDS). This graphical data space
is viewed through a color raster-scan display which
enables users to traverse the GDS surface or zoom into
the image to obtain greater detail. In contrast to
conventional database management systems, in which
users access data by asking questions in a formal query
language, a spatial data management system (SDMS)
presents the information graphically in a form that
seems to encourage browsing and to require less prior
knowledge of the contents and organization of the
database.\par
This paper presents an overview of the SDMS concept and
describes its implementation in a prototype system for
retrieving information from both a symbolic database
management system and an optical videodisk.",
acknowledgement = ack-nhfb,
annote = "Organizing and retrieving information by positioning
it in a graphical data space viewed through a color
display. An overview of the SDMS concept and describes
its implementation in a prototype system.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "computer graphics; database query languages;
graphical/programming language, query language,
Man-Machine Communications interaction, data base
systems; graphics languages; man-machine interaction",
subject = "Information Systems --- Database Management ---
Database Applications (H.2.8): {\bf Spatial databases
and GIS}; Information Systems --- Database Management
--- Languages (H.2.3): {\bf Query languages};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Query processing}",
}
@Article{Zaniolo:1981:DRD,
author = "Carlo Zaniolo and Michel A. Melkanoff",
title = "On the Design of Relational Database Schemata",
journal = j-TODS,
volume = "6",
number = "1",
pages = "1--47",
month = mar,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68B15 (68H05)",
MRnumber = "82b:68019",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-1/p1-zaniolo/p1-zaniolo.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-1/p1-zaniolo/",
abstract = "The purpose of this paper is to present a new approach
to the conceptual design of relational databases based
on the complete relatability conditions (CRCs).\par
It is shown that current database design methodology
based upon the elimination of anomalies is not
adequate. In contradistinction, the CRCs are shown to
provide a powerful criticism for decomposition. A
decomposition algorithm is presented which (1) permits
decomposition of complex relations into simple,
well-defined primitives, (2) preserves all the original
information, and (3) minimizes redundancy.\par
The paper gives a complete derivation of the CRCs,
beginning with a unified treatment of functional and
multivalued dependencies, and introduces the concept of
elementary functional dependencies and multiple
elementary multivalued dependencies. Admissibility of
covers and validation of results are also discussed,
and it is shown how these concepts may be used to
improve the design of 3NF schemata. Finally, a
convenient graphical representation is proposed, and
several examples are described in detail to illustrate
the method.",
acknowledgement = ack-nhfb,
annote = "The conceptual design of relational databases based on
the complete reliability conditions (CRCs). A unified
treatment of functional and multivalued dependencies.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; decomposition; functional
dependencies; minimal covers; multivalued dependencies;
relational databases; schema design",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Schema and subschema}",
}
@Article{Lien:1981:HSR,
author = "Y. Edmund Lien",
title = "Hierarchical Schemata for Relational Databases",
journal = j-TODS,
volume = "6",
number = "1",
pages = "48--69",
month = mar,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68B15 (68H05)",
MRnumber = "82b:68015",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-1/p48-lien/p48-lien.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-1/p48-lien/",
abstract = "Most database design methods for the relational model
produce a flat database, that is, a family of relations
with no explicit interrelational connections. The user
of a flat database is likely to be unaware of certain
interrelational semantics. In contrast, the
entity-relationship model provides schema graphs as a
description of the database, as well as for navigating
the database. Nevertheless, the user of an
entity-relationship database may still commit semantic
errors, such as performing a lossy join. This paper
proposes a nonflat, or hierarchical, view of relational
databases. Relations are grouped together to form {\em
relation hierarchies\/} in which lossless joins are
explicitly shown whereas lossy joins are excluded.
Relation hierarchies resemble the schema graphs in the
entity-relationship model.\par
An approach to the design of relation hierarchies is
outlined in the context of data dependencies and
relational decomposition. The approach consists of two
steps; each is described as an algorithm. Algorithm DEC
decomposes a given universal relation according to a
given set of data dependencies and produces a set of
nondecomposable relation schemes. This algorithm
differs from its predecessors in that it produces no
redundant relation schemes. Algorithm RH further
structures the relation schemes produced by Algorithm
DEC into a hierarchical schema. These algorithms can be
useful software tools for database designers.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; database design; lossless join;
multivalued dependency; relation normalization",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Schema and subschema}",
}
@Article{Chamberlin:1981:SRT,
author = "D. D. Chamberlin and M. M. Astrahan and W. F. King and
R. A. Lorie and J. W. Mehl and T. G. Price and M.
Schkolnick and P. Griffiths Selinger and D. R. Slutz
and B. W. Wade and R. A. Yost",
title = "Support for Repetitive Transactions and Ad Hoc Queries
in {System R}",
journal = j-TODS,
volume = "6",
number = "1",
pages = "70--94",
month = mar,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: IBM Research Report
RJ2551(33151), May. 1979.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-1/p70-chamberlin/p70-chamberlin.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-1/p70-chamberlin/",
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.\par
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.",
acknowledgement = ack-nhfb,
annote = "Embedded SQL statements are processed by the System R
precompiler enabling highly efficient support for
repetitive transactions. Ad hoc 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.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "compilation; data base systems, TODS ad-hoc relation
database IBM San Jose; performance measurements; query
languages; relational database systems; transaction
processing",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf System R}; Information Systems
--- Database Management --- Systems (H.2.4): {\bf
Relational databases}",
}
@Article{Schlorer:1981:SSD,
author = "Jan Schl{\"o}rer",
title = "Security of Statistical Databases: Multidimensional
Transformation",
journal = j-TODS,
volume = "6",
number = "1",
pages = "95--112",
month = mar,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68B15",
MRnumber = "82b:68018",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-1/p95-schlorer/p95-schlorer.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-1/p95-schlorer/",
abstract = "The concept of multidimensional transformation of
statistical databases is described. A given set of
statistical output may be compatible with more than one
statistical database. A transformed database $D'$ is a
database which (1) differs from the original database
$D$ in its record content, for (2) produces, within
certain limits, the same statistical output as the
original database. For a transformable database $D$
there are two options: One may physically transform $D$
into a suitable database $D'$, or one may release only
that output which will not permit the users to decide
whether it comes from $D$ or $D'$. The second way is,
of course, the easier one. Basic structural
requirements for transformable statistical databases
are investigated. Advantages, drawbacks, and open
questions are discussed.",
acknowledgement = ack-nhfb,
annote = "A transformed database differs from the original
database in its record content but produces within
certain limits the same statistical output.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "confidentiality; data base systems; data processing
--- security of data; database; database security;
matrices; security; statistical database",
subject = "Information Systems --- Database Management ---
Database Applications (H.2.8): {\bf Statistical
databases}",
}
@Article{Chin:1981:SDD,
author = "Francis Y. Chin and Gultekin {\"O}zsoyo{\u{g}}lu",
title = "Statistical Database Design",
journal = j-TODS,
volume = "6",
number = "1",
pages = "113--139",
month = mar,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-1/p113-chin/p113-chin.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-1/p113-chin/",
abstract = "The security problem of a statistical database is to
limit the use of the database so that no sequence of
statistical queries is sufficient to deduce
confidential or private information. In this paper it
is suggested that the problem be investigated at the
conceptual data model level. The design of a
statistical database should utilize a statistical
security management facility to enforce the security
constraints at the conceptual model level. Information
revealed to users is well defined in the sense that it
can at most be reduced to nondecomposable information
involving a group of individuals. In addition, the
design also takes into consideration means of storing
the query information for auditing purposes, changes in
the database, users' knowledge, and some security
measures.",
acknowledgement = ack-nhfb,
annote = "Limit the use of the database so that no sequence of
statistical queries is sufficient to deduce
confidential information at the conceptual data model
level.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "compromisability; conceptual databases model; data
base systems; data processing --- security of data;
database design; protection; security; statistical
database",
subject = "Information Systems --- Database Management ---
Database Applications (H.2.8): {\bf Statistical
databases}",
}
@Article{Shipman:1981:FDM,
author = "David W. Shipman",
title = "The Functional Data Model and the Data Language
{DAPLEX}",
journal = j-TODS,
volume = "6",
number = "1",
pages = "140--173",
month = mar,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/bibdb.bib;
Database/Graefe.bib; Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/; Misc/Functional.bib;
Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Reprinted in \cite{Stonebraker:1988:RDS}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-1/p140-shipman/p140-shipman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-1/p140-shipman/",
abstract = "DAPLEX is a database language which incorporates:
\par
a formulation of data in terms of entities;\par
a functional representation for both actual and virtual
data relationships;\par
a rich collection of language constructs for expressing
entity selection criteria;\par
a notion of subtype/supertype relationships among
entity types.\par
This paper presents and motivates the DAPLEX language
and the underlying data model on which it is based.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "computer programming languages; data base systems;
database; functional data model; language",
subject = "Information Systems --- Database Management ---
Languages (H.2.3): {\bf DAPLEX}; Information Systems
--- Database Management --- Languages (H.2.3)",
}
@Article{Rosenberg:1981:TSO,
author = "Arnold L. Rosenberg and Lawrence Snyder",
title = "Time- and Space-Optimality in {B-Trees}",
journal = j-TODS,
volume = "6",
number = "1",
pages = "174--193",
month = mar,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68B15 (68E10)",
MRnumber = "82m:68048",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/; Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-1/p174-rosenberg/p174-rosenberg.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-1/p174-rosenberg/",
abstract = "A B-tree is {\em compact\/} if it is minimal in number
of nodes, hence has optimal space utilization, among
equally capacious B-trees of the same order. The space
utilization of compact B-trees is analyzed and compared
with that of noncompact B-trees and with
(node)-visit-optimal B-trees, which minimize the
expected number of nodes visited per key access.
Compact B-trees can be as much as a {\em factor\/} of
2.5 more space efficient than visit-optimal B-trees;
and the node-visit cost of a compact tree is never more
than 1 + the node-visit cost of an optimal tree. The
utility of initializing a B-tree to be compact (which
initialization can be done in time linear in the number
of keys if the keys are presorted) is demonstrated by
comparing the space utilization of a compact tree that
has been augmented by random insertions with that of a
tree that has been grown entirely by random insertions.
Even after increasing the number of keys by a modest
amount, the effects of compact initialization are still
felt. Once the tree has grown so large that these
effects are no longer discernible, the tree can be
expeditiously compacted in place using an algorithm
presented here; and the benefits of compactness
resume.",
acknowledgement = ack-nhfb,
annote = "A Btree is compact if it is minimal in number of
nodes. Compact Btree initialization can be done in time
linear in the number of keys if the keys are presorted.
Study indicates that space-optimal trees are nearly
time optimal, but time-optimal trees are nearly space
pessimal.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "2,3-tree; B-tree; bushy B-tree; compact B-tree; data
processing; node-visit cost; space utilization",
subject = "Mathematics of Computing --- Discrete Mathematics ---
Graph Theory (G.2.2): {\bf Trees}",
}
@Article{Scholl:1981:NFO,
author = "Michel Scholl",
title = "New File Organizations Based on Dynamic Hashing",
journal = j-TODS,
volume = "6",
number = "1",
pages = "194--211",
month = mar,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68B15",
MRnumber = "82c:68016",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-1/p194-scholl/p194-scholl.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-1/p194-scholl/",
abstract = "New file organizations based on hashing and suitable
for data whose volume may vary rapidly recently
appeared in the literature. In the three schemes which
have been independently proposed, rehashing is avoided,
storage space is dynamically adjusted to the number of
records actually stored, and there are no overflow
records. Two of these techniques employ an index to the
data file. Retrieval is fast and storage utilization is
low.\par
In order to increase storage utilization, we introduce
two schemes based on a similar idea and analyze the
performance of the second scheme. Both techniques use
an index of much smaller size. In both schemes,
overflow records are accepted. The price which has to
be paid for the improvement in storage utilization is a
slight access cost degradation.",
acknowledgement = ack-nhfb,
annote = "In the three schemes which proposed, rehashing is
avoided, storage space is dynamically adjusted to the
number of records actually stored, and there are no
overflow records. Two of these techniques employ an
index to the data file.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data processing; data structure; dynamic hashing; file
organization; hashing; linear splitting",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}",
}
@Article{Kung:1981:OMC,
author = "H. T. Kung and John T. Robinson",
title = "On Optimistic Methods for Concurrency Control",
journal = j-TODS,
volume = "6",
number = "2",
pages = "213--226",
month = jun,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Compiler/garbage.collection.bib;
Compiler/Heaps.bib; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/misc.1.bib; Misc/real.time.bib;
Object/Nierstrasz.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Reprinted in \cite{Stonebraker:1988:RDS}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-2/p213-kung/p213-kung.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-2/p213-kung/",
abstract = "Most current approaches to concurrency control in
database systems rely on locking of data objects as a
control mechanism. In this paper, two families of
nonlocking concurrency controls are presented. The
methods used are ``optimistic'' in the sense that they
rely mainly on transaction backup as a control
mechanism, ``hoping'' that conflicts between
transactions will not occur. Applications for which
these methods should be more efficient than locking are
discussed.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "concurrency controls; data base systems, concurrency
other; databases; transaction processing",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Concurrency}",
}
@Article{Boral:1981:PAS,
author = "Haran Boral and David J. DeWitt",
title = "Processor Allocation Strategies for Multiprocessor
Database Machines",
journal = j-TODS,
volume = "6",
number = "2",
pages = "227--254",
month = jun,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-2/p227-boral/p227-boral.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-2/p227-boral/",
abstract = "In this paper four alternative strategies for
assigning processors to queries in multiprocessor
database machines are described and evaluated. The
results demonstrate that SIMD database machines are
indeed a poor design when their performance is compared
with that of the three MIMD strategies presented.
\par
Also introduced is the application of data-flow machine
techniques to the processing of relational algebra
queries. A strategy that employs data-flow techniques
is shown to be superior to the other strategies
described by several experiments. Furthermore, if the
data-flow query processing strategy is employed, the
results indicate that a two-level storage hierarchy (in
which relations are paged between a shared data cache
and mass storage) does not have a significant impact on
performance.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "associative processors; back-end computers; computer
architecture; data base systems, Direct TODS; data-flow
computers; database machines; database management;
parallel processors; processor scheduling",
subject = "Information Systems --- Database Management ---
Database Machines (H.2.6); Information Systems ---
Database Management (H.2)",
}
@Article{Su:1981:TDT,
author = "Stanley Y. W. Su and Herman Lam and Der Her Lo",
title = "Transformation of Data Traversals and Operations in
Application Programs to Account for Semantic Changes of
Databases",
journal = j-TODS,
volume = "6",
number = "2",
pages = "255--294",
month = jun,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-2/p255-su/p255-su.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-2/p255-su/",
abstract = "This paper addresses the problem of application
program conversion to account for changes in database
semantics that result in changes in the schema and
database contents. With the observation that the
existing data models can be viewed as alternative ways
of modeling the same database semantics, a methodology
of application program analysis and conversion based on
an existing-DBMS-model-and schema-independent
representation of both the database and programs is
presented. In this methodology, the source and target
databases are described in terms of the association
types of a semantic association model. The structural
properties, the integrity constraints, and the
operational characteristics (storage operation
behaviors) of the association types are more explicitly
defined to reveal the semantics that is generally
hidden in application programs. The explicit
descriptions of the source and target databases are
used as the basis for program analysis and conversion.
Application programs are described in terms of a small
number of ``access patterns'' which define the data
traversals and operations of the programs. In addition
to the methodology, this paper (1) describes a model of
a generalized application program conversion system
that serves as a framework for research, (2) presents
an analysis of access patterns that serve as the
primitives for program description, (3) delineates some
meaningful semantic changes to databases and their
corresponding transformation rules for program
conversion, (4) illustrates the application of these
rules to two different approaches to program conversion
problems, and (5) reports on the development effort
undertaken at the University of Florida.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "access pattern; application program conversion; data
base systems; database changes; semantic data model;
transformation rules",
subject = "Information Systems --- Database Management ---
Database Applications (H.2.8); Information Systems ---
Database Management --- Physical Design (H.2.2): {\bf
Access methods}; Information Systems --- Database
Management --- Logical Design (H.2.1): {\bf Data
models}",
}
@Article{Clemons:1981:DES,
author = "Eric K. Clemons",
title = "Design of an External Schema Facility to Define and
Process Recursive Structures",
journal = j-TODS,
volume = "6",
number = "2",
pages = "295--311",
month = jun,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-2/p295-clemons/p295-clemons.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-2/p295-clemons/",
abstract = "The role of the external schema is to support user
views of data and thus to provide programmers with
easier data access. This author believes that an
external schema facility is best based on hierarchies,
both simple and recursive. After a brief introduction
to an external schema facility to support simple
hierarchical user views, the requirements for a
facility for recursive hierarchies are listed and the
necessary extensions to the external schema definition
language are offered.\par
Functions that must be provided for generality in
definition are node specification and node control.
Tree traversal functions must be provided for
processing. Definitions of each and examples of use are
presented.",
acknowledgement = ack-nhfb,
annote = "[Ahad,Yao,Choi87] A.2.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "ANSI SPARC architectures; data base systems; external
schemata; recursive data structures; user views",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Schema and subschema}",
}
@Article{Davida:1981:DES,
author = "George I. Davida and David L. Wells and John B. Kam",
title = "A Database Encryption System with Subkeys",
journal = j-TODS,
volume = "6",
number = "2",
pages = "312--328",
month = jun,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68B15",
MRnumber = "82f:68020",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-2/p312-davida/p312-davida.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-2/p312-davida/",
abstract = "A new cryptosystem that is suitable for database
encryption is presented. The system has the important
property of having subkeys that allow the encryption
and decryption of fields within a record. The system is
based on the Chinese Remainder Theorem.",
acknowledgement = ack-nhfb,
annote = "Subkeys allow the encryption and decryption of fields
within a record. The system is based on the Chinese
Remainder Theorem.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "codes, symbolic; data base systems; data security;
databases; decryption; encryption; subkeys",
subject = "Data --- Data Encryption (E.3)",
}
@Article{Ling:1981:ITN,
author = "Tok Wang Ling and Frank W. Tompa and Tiko Kameda",
title = "An Improved Third Normal Form for Relational
Databases",
journal = j-TODS,
volume = "6",
number = "2",
pages = "329--346",
month = jun,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68B15",
MRnumber = "82f:68024",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-2/p329-ling/p329-ling.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-2/p329-ling/",
abstract = "In this paper, we show that some Codd third normal
form relations may contain ``superfluous'' attributes
because the definitions of transitive dependency and
prime attribute are inadequate when applied to sets of
relations. To correct this, an improved third normal
form is defined and an algorithm is given to construct
a set of relations from a given set of functional
dependencies in such a way that the superfluous
attributes are guaranteed to be removed. This new
normal form is compared with other existing definitions
of third normal form, and the deletion normalization
method proposed is shown to subsume the decomposition
method of normalization.",
acknowledgement = ack-nhfb,
annote = "An improved third normal form is defined and an
algorithm is given to construct a set of relations from
a given set of functional dependencies in such a way
that the superfluous attributes are guaranteed to be
removed.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "covering; data base systems; database design;
functional dependency; normalization; prime attribute;
reconstructibility; relational schema; third normal
form; transitive dependency",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Schema and subschema}",
}
@Article{McLean:1981:CSC,
author = "Gordon {McLean, Jr.}",
title = "Comments on {SDD-1} Concurrency Control Mechanisms",
journal = j-TODS,
volume = "6",
number = "2",
pages = "347--350",
month = jun,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/; Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-2/p347-mclean/p347-mclean.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-2/p347-mclean/",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Concurrency}",
}
@Article{Hammer:1981:DDS,
author = "Michael Hammer and Dennis Mc Leod",
title = "Database Description with {SDM}: {A} Semantic Database
Model",
journal = j-TODS,
volume = "6",
number = "3",
pages = "351--386",
month = sep,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/bibdb.bib;
Database/Graefe.bib; Database/Wiederhold.bib;
Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/; Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Reprinted in \cite{Stonebraker:1988:RDS}. Also
published in \cite{Zdonik:1990:ROO}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-3/p351-hammer/p351-hammer.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-3/p351-hammer/",
abstract = "SDM is a high-level semantics-based database
description and structuring formalism (database model)
for databases. This database model is designed to
capture more of the meaning of an application
environment than is possible with contemporary database
models. An SDM specification describes a database in
terms of the kinds of entities that exist in the
application environment, the classifications and
groupings of those entities, and the structural
interconnections among them. SDM provides a collection
of high-level modeling primitives to capture the
semantics of an application environment. By
accommodating derived information in a database
structural specification, SDM allows the same
information to be viewed in several ways; this makes it
possible to directly accommodate the variety of needs
and processing requirements typically present in
database applications. The design of the present SDM is
based on our experience in using a preliminary version
of it.\par
SDM is designed to enhance the effectiveness and
usability of database systems. An SDM database
description can serve as a formal specification and
documentation tool for a database; it can provide a
basis for supporting a variety of powerful user
interface facilities, it can serve as a conceptual
database model in the database design process; and, it
can be used as the database model for a new kind of
database management system.",
acknowledgement = ack-nhfb,
annote = "SDM is a high-level semantics-based database model, to
capture the meaning of an application environment. One
of the papers usually referred to when discussing
semantic data models. Describes a model which permits a
lot of flexibility and expressiveness, and is
consequently difficult to implement. Advantage is that
it can be used as a specification and documentation
tool. Good introduction, giving an overview of (some?,
most?, all?) problems in semantic data models. The
section describing SDM DDL is a bit too detailed (one
needs to pick up the essential concepts like
subclassing, and redundancy in model (which may be
necessary to make the model easier to use)). Some
discussion of inheritance is also present. Nothing much
is said in the final discussion. Reasonable paper. To
benefit, one needs to be careful not to get lost in the
details. A detailed description of the semantic data
model.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; database definition; database
management; database modeling; database models;
database semantics; logical database design",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}",
}
@Article{Fagin:1981:NFR,
author = "Ronald Fagin",
title = "A Normal Form for Relational Databases That is Based
on Domains and Keys",
journal = j-TODS,
volume = "6",
number = "3",
pages = "387--415",
month = sep,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Compiler/prog.lang.theory.bib;
Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-3/p387-fagin/p387-fagin.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-3/p387-fagin/",
abstract = "The new normal form for relational databases, called
domain-key normal form (DK\slash NF), is defined. Also,
formal definitions of insertion anomaly and deletion
anomaly are presented. It is shown that a schema is in
DK\slash NF if and only if it has no insertion or
deletion anomalies. Unlike previously defined normal
forms, DK\slash NF is not defined in terms of
traditional dependencies (functional, multivalued, or
join). Instead, it is defined in terms of the more
primitive concepts of domain and key, along with the
general concept of a ``constraint''. It is considered
how the definitions of traditional normal forms might
be modified by taking into consideration, for the first
time, the combinatorial consequences of bounded domain
sizes. It is shown that after this modification, these
traditional normal forms are all implied by DK\slash
NF. In particular, if all domains are infinite, then
these traditional normal forms are all implied by
DK\slash NF.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "anomaly; complexity; data base systems; database
design; DK/NF; domain-key normal form; functional
dependency; join dependency; multivalued dependency;
normalization; relational database",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Normal forms}; Information
Systems --- Database Management --- Systems (H.2.4):
{\bf Relational databases}",
}
@Article{Hong:1981:AHS,
author = "Y. C. Hong and Stanley Y. W. Su",
title = "Associative Hardware and Software Techniques for
Integrity Control",
journal = j-TODS,
volume = "6",
number = "3",
pages = "416--440",
month = sep,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-3/p416-hong/p416-hong.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-3/p416-hong/",
abstract = "This paper presents the integrity control mechanism of
the associative processing system, CASSM. The mechanism
takes advantage of the associative techniques, such as
content and context addressing, tagging and marking
data, parallel processing, automatic triggering of
integrity control procedures, etc., for integrity
control and as a result offers three significant
advantages: (1) The problem of staging data in a main
memory for integrity checking can be eliminated because
database storage operations are verified at the place
where the data are stored. (2) The backout or merging
procedures are relatively easy and inexpensive in the
associative system because modified copies can be
substituted for the originals or may be discarded by
merely changing their associated tags. (3) The database
management system software is simplified because
database integrity functions are handled by the
associative processing system to which a mainframe
computer is a front-end computer.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "assertion and trigger; associative techniques;
cellular-logic devices; data base systems; database
integrity; database management; integrity control;
integrity control, SYWSu hardware support relational
database machine TODS",
subject = "Information Systems --- Database Management ---
General (H.2.0): {\bf Security, integrity, and
protection**}",
}
@Article{March:1981:FMS,
author = "Salvatore T. March and Dennis G. Severance and Michael
Wilens",
title = "Frame Memory: {A} Storage Architecture to Support
Rapid Design and Implementation of Efficient
Databases",
journal = j-TODS,
volume = "6",
number = "3",
pages = "441--463",
month = sep,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-3/p441-march/p441-march.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-3/p441-march/",
abstract = "Frame memory is a virtual view of secondary storage
that can be implemented with reasonable overhead to
support database record storage and accessing
requirements. Frame memory is designed so that its
operating characteristics can be easily manipulated by
either designers or design algorithms, while
performance effects of such changes can be accurately
predicted. Automated design procedures exist to
generate and evaluate alternative database designs
built upon frame memory, and the existence of these
procedures establishes frames as an attractive memory
management architecture for future database management
systems.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "analytic modeling; data base systems; database design
system; database machine; hardware support; TODS;
virtual secondary storage",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2); Software ---
Operating Systems --- Storage Management (D.4.2): {\bf
Secondary storage}",
}
@Article{vandeRiet:1981:HLP,
author = "Reind P. {van de Riet} and Anthony I. Wasserman and
Martin L. Kersten and Wiebren {de Jonge}",
title = "High-Level Programming Features for Improving the
Efficiency of a Relational Database System",
journal = j-TODS,
volume = "6",
number = "3",
pages = "464--485",
month = sep,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: UCSF, Lab. of Med. Inf. Science,
Tech. Rpt. 44, Feb. 1980.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-3/p464-van_de_riet/p464-van_de_riet.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-3/p464-van_de_riet/",
abstract = "This paper discusses some high-level language
programming constructs that can be used to manipulate
the relations of a relational database system
efficiently. Three different constructs are described:
(1) tuple identifiers that directly reference tuples of
a relation; (2) cursors that may iterate over the
tuples of a relation; and (3) markings, a form of
temporary relation consisting of a set of tuple
identifiers. In each case, attention is given to
syntactic, semantic, and implementation considerations.
\par
The use of these features is first presented within the
context of the programming language PLAIN, and it is
then shown how these features could be used more
generally to provide database manipulation capabilities
in a high-level programming language. Consideration is
also given to issues of programming methodology, with
an important goal being the achievement of a balance
between the enforcement of good programming practices
and the ability to write efficient programs.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "markings; PLAIN; programming languages; programming
methodology; relational algebra; relational database
management",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management ---
Languages (H.2.3): {\bf Database (persistent)
programming languages}",
}
@Article{Culik:1981:DMT,
author = "K. {Culik II} and Th. Ottmann and D. Wood",
title = "Dense multiway trees",
journal = j-TODS,
volume = "6",
number = "3",
pages = "486--512",
month = sep,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68B15 (05C05)",
MRnumber = "82m:68038",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1981-6-3/p486-culic/",
abstract = "B-trees of order $m$ are a ``balanced'' class of
$m$-ary trees, which have applications in the areas of
file organization. In fact, they have been the only
choice when balanced multiway trees are required.
Although they have very simple insertion and deletion
algorithms, their storage utilization, that is, the
number of keys per page or node, is at worst 50
percent. In the present paper we investigate a new
class of balanced $m$-ary trees, the dense multiway
trees, and compare their storage utilization with that
of B-trees of order $m$. \par
Surprisingly, we are able to demonstrate that weakly
dense multiway trees have an $(log_2 N)$ insertion
algorithm. We also show that inserting $m h - 1$ keys
in ascending order into an initially empty dense
multiway tree yields the complete $m$-ary tree of
height $h$, and that at intermediate steps in the
insertion sequence the intermediate trees can also be
considered to be as dense as possible. Furthermore, an
analysis of the limiting dynamic behavior of the dense
$m$-ary trees under insertion shows that the average
storage utilization tends to 1; that is, the trees
become as dense as possible. This motivates the use of
the term ``dense.''",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "B-trees; balanced trees; dense trees; multiway trees;
search trees; storage utilization",
subject = "Data --- Data Structures (E.1): {\bf Trees}",
}
@Article{Comer:1981:AHF,
author = "Douglas Comer",
title = "Analysis of a Heuristic for Full Trie Minimization",
journal = j-TODS,
volume = "6",
number = "3",
pages = "513--537",
month = sep,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-3/p513-comer/p513-comer.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-3/p513-comer/",
abstract = "A trie is a distributed-key search tree in which
records from a file correspond to leaves in the tree.
Retrieval consists of following a path from one root to
a leaf, where the choice of edge at each node is
determined by attribute values of the key. For full
tries, those in which all leaves lie at the same depth,
the problem of finding an ordering of attributes which
yields a minimum size trie is NP-complete.\par
This paper considers a ``greedy'' heuristic for
constructing low-cost tries. It presents simulation
experiments which show that the greedy method tends to
produce tries with small size, and analysis leading to
a worst case bound on approximations produced by the
heuristic. It also shows a class of files for which the
greedy method may perform badly, producing tries of
high cost.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data processing; heuristic; trie index; trie size",
subject = "Computing Methodologies --- Artificial Intelligence
--- Problem Solving, Control Methods, and Search
(I.2.8): {\bf Heuristic methods}",
}
@Article{Kent:1981:CAU,
author = "W. Kent",
title = "Consequences of Assuming a Universal Relation",
journal = j-TODS,
volume = "6",
number = "4",
pages = "539--556",
month = dec,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/database.bib;
Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "See remark \cite{Ullman:1983:KAU}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-4/p539-kent/p539-kent.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-4/p539-kent/",
abstract = "Although central to the current direction of
dependency theory, the assumption of a universal
relation is incompatible with some aspects of
relational database theory and practice. Furthermore,
the universal relation is itself ill defined in some
important ways. And, under the universal relation
assumption, the decomposition approach to database
design becomes virtually indistinguishable from the
synthetic approach.",
acknowledgement = ack-nhfb,
annote = "The assumption of a universal relation is incompatible
with some aspects of relational database theory and
practice. Under the universal relation assumption, the
decomposition approach to database design becomes
virtually indistinguishable from the synthetic
approach.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; database design; dependency theory;
rational database; relational theory; universal
relation",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Models and Principles ---
Systems and Information Theory (H.1.1); Information
Systems --- Database Management --- Logical Design
(H.2.1)",
}
@Article{Bancilhon:1981:USR,
author = "F. B. Bancilhon and N. Spyratos",
title = "Update Semantics of Relational Views",
journal = j-TODS,
volume = "6",
number = "4",
pages = "557--575",
month = dec,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Ai/nonmono.bib; Compendex database;
Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "See comment \cite{Keller:1987:CBS}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-4/p557-bancilhon/p557-bancilhon.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-4/p557-bancilhon/",
abstract = "A database view is a portion of the data structured in
a way suitable to a specific application. Updates on
views must be translated into updates on the underlying
database. This paper studies the translation process in
the relational model.\par
The procedure is as follows: first, a ``complete'' set
of updates is defined such that\par
together with every update the set contains a
``return'' update, that is, one that brings the view
back to the original state;\par
given two updates in the set, their composition is also
in the set.\par
To translate a complete set, we define a mapping called
a ``translator,'' that associates with each view update
a unique database update called a ``translation.'' The
constraint on a translation is to take the database to
a state mapping onto the updated view. The constraint
on the translator is to be a morphism.\par
We propose a method for defining translators. Together
with the user-defined view, we define a
``complementary'' view such that the database could be
computed from the view and its complement. We show that
a view can have many different complements and that the
choice of a complement determines an update policy.
Thus, we fix a view complement and we define the
translation of a given view update in such a way that
the complement remains invariant (``translation under
constant complement''). The main result of the paper
states that, given a complete set $U$ of view updates,
$U$ has a translator if and only if $U$ is translatable
under constant complement.",
acknowledgement = ack-nhfb,
annote = "A mapping called a ``translator'', associates with
each view update a unique database update. A method for
defining translators with the user-defined view, define
a ``complementary'' view such that the database could
be computed from the view and its complement. We define
the translation of a given view update in such a way
that the complement remains invariant. Aplies to
Universal relations.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "conceptual model; data base systems; data model; data
semantics; database view; relation; relational model
database; update translation; view updating",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Data models}; Theory of
Computation --- Logics and Meanings of Programs ---
Semantics of Programming Languages (F.3.2)",
}
@Article{Baroody:1981:OOA,
author = "A. James {Baroody, Jr.} and David J. DeWitt",
title = "An Object-Oriented Approach to Database System
Implementation",
journal = j-TODS,
volume = "6",
number = "4",
pages = "576--601",
month = dec,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Object/Nierstrasz.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-4/p576-baroody/p576-baroody.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-4/p576-baroody/",
abstract = "This paper examines object-oriented programming as an
implementation technique for database systems. The
object-oriented approach encapsulates the
representations of database entities and relationships
with the procedures that manipulate them. To achieve
this, we first define abstractions of the modeling
constructs of the data model that describe their common
properties and behavior. Then we represent the entity
types and relationship types in the conceptual schema
and the internal schema by objects that are instances
of these abstractions. The generic procedures (data
manipulation routines) that comprise the user interface
can now be implemented as calls to the procedures
associated with these objects.\par
A generic procedure model of database implementation
techniques is presented and discussed. Several current
database system implementation techniques are
illustrated as examples of this model, followed by a
critical analysis of our implementation technique based
on the use of objects. We demonstrate that the
object-oriented approach has advantages of data
independence, run-time efficiency due to eliminating
access to system descriptors, and support for low-level
views.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "computer programming, olit-db casais; data base
systems; data independence; data manipulation routines;
database systems; high-level languages; object-oriented
programming; procedural binding",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Object-oriented databases};
Computer Systems Organization --- Computer System
Implementation (C.5); Information Systems --- Database
Management --- Languages (H.2.3)",
}
@Article{Bernstein:1981:QPS,
author = "Philip A. Bernstein and Nathan Goodman and Eugene Wong
and Christopher L. Reeve and James B. {Rothnie, Jr.}",
title = "Query Processing in a System for Distributed Databases
({SDD-1})",
journal = j-TODS,
volume = "6",
number = "4",
pages = "602--625",
month = dec,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-4/p602-bernstein/p602-bernstein.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-4/p602-bernstein/",
abstract = "This paper describes the techniques used to optimize
relational queries in the SDD-1 distributed database
system. Queries are submitted to SDD-1 in a high-level
procedural language called Datalanguage. Optimization
begins by translating each Datalanguage query into a
relational calculus form called an {\em envelope},
which is essentially an aggregate-free QUEL query. This
paper is primarily concerned with the optimization of
envelopes.\par
Envelopes are processed in two phases. The first phase
executes relational operations at various sites of the
distributed database in order to delimit a subset of
the database that contains all data relevant to the
envelope. This subset is called a {\em reduction\/} of
the database. The second phase transmits the reduction
to one designated site, and the query is executed
locally at that site.\par
The critical optimization problem is to perform the
reduction phase efficiently. Success depends on
designing a good repertoire of operators to use during
this phase, and an effective algorithm for deciding
which of these operators to use in processing a given
envelope against a given database. The principal
reduction operator that we employ is called a {\em
semijoin}. In this paper we define the semijoin
operator, explain why semijoin is an effective
reduction operator, and present an algorithm that
constructs a cost-effective program of semijoins, given
an envelope and a database.",
acknowledgement = ack-nhfb,
annote = "Techniques to optimize relational queries in the SDD-1
distributed database system. First phase executes
relational operations at various sites to delimit a
subset called a reduction. The second phase transmits
the reduction to one designated site. The principal
reduction operator, introduced here, is called a
semijoin.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "computer programming --- subroutines; data base
systems; distributed databases; query optimization;
query processing; query processing, TODS semijoins
semi-join join; relational databases; semijoins",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}; Information
Systems --- Database Management --- Systems (H.2.4):
{\bf Distributed databases}; Information Systems ---
Database Management --- Systems (H.2.4): {\bf
Relational databases}",
}
@Article{Welty:1981:HFC,
author = "Charles Welty and David W. Stemple",
title = "Human Factors Comparison of a Procedural and a
Nonprocedural Query Language",
journal = j-TODS,
volume = "6",
number = "4",
pages = "626--649",
month = dec,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-4/p626-welty/p626-welty.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-4/p626-welty/",
abstract = "Two experiments testing the ability of subjects to
write queries in two different query languages were
run. The two languages, SQL and TABLET, differ
primarily in their procedurality; both languages use
the relational data model, and their Halstead levels
are similar. Constructs in the languages which do not
affect their procedurality are identical. The two
languages were learned by the experimental subjects
almost exclusively from manuals presenting the same
examples and problems ordered identically for both
languages. The results of the experiments show that
subjects using the more procedural language wrote
difficult queries better than subjects using the less
procedural language. The results of the experiments are
also used to compare corresponding constructs in the
two languages and to recommend improvements for these
constructs.",
acknowledgement = ack-nhfb,
annote = "SQL and TABLET. The results show that subjects using
the more procedural language wrote difficult queries
better than subjects using the less procedural
language.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; database systems; human factors;
procedural and nonprocedural languages; query
languages",
subject = "Information Systems --- Models and Principles ---
User/Machine Systems (H.1.2): {\bf Human factors};
Information Systems --- Database Management ---
Languages (H.2.3): {\bf Query languages}; Information
Systems --- Database Management --- Systems (H.2.4)",
}
@Article{Lehman:1981:ELC,
author = "Philip L. Lehman and S. Bing Yao",
title = "Efficient Locking for Concurrent Operations on
{B-Trees}",
journal = j-TODS,
volume = "6",
number = "4",
pages = "650--670",
month = dec,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-4/p650-lehman/p650-lehman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-4/p650-lehman/",
abstract = "The B-tree and its variants have been found to be
highly useful (both theoretically and in practice) for
storing large amounts of information, especially on
secondary storage devices. We examine the problem of
overcoming the inherent difficulty of concurrent
operations on such structures, using a practical
storage model. A single additional ``link'' pointer in
each node allows a process to easily recover from tree
modifications performed by other concurrent processes.
Our solution compares favorably with earlier solutions
in that the locking scheme is simpler (no read-locks
are used) and only a (small) constant number of nodes
are locked by any update process at any given time. An
informal correctness proof for our system is given.",
acknowledgement = ack-nhfb,
annote = "A single additional `link' pointer in each node allows
a process to easily recover from tree modifications
performed by other concurrent processes. No read-locks
are used only a (small) constant number of nodes are
locked by any update process at any given time.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "B-tree; concurrenct algorithms; concurrency controls;
consistency; correctness; data processing; data
structures; database; index organizations; locking
protocols; multiway search trees",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Concurrency}; Mathematics of
Computing --- Discrete Mathematics --- Graph Theory
(G.2.2): {\bf Trees}",
}
@Article{Larson:1981:AIS,
author = "Per-{\AA}ke Larson",
title = "Analysis of Index-Sequential Files with Overflow
Chaining",
journal = j-TODS,
volume = "6",
number = "4",
pages = "671--680",
month = dec,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68B15 (68H05)",
MRnumber = "82m:68044",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1981-6-4/p671-larson/p671-larson.pdf;
http://www.acm.org/pubs/citations/journals/tods/1981-6-4/p671-larson/",
abstract = "The gradual performance deterioration caused by
deletions from and insertions into an index-sequential
file after loading is analyzed. The model developed
assumes that overflow records are handled by chaining.
Formulas for computing the expected number of overflow
records and the expected number of additional accesses
caused by the overflow records for both successful and
unsuccessful searches are derived.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "analysis of algorithms; analytic model; data
processing, TODS ISAM; file organization; file
structure; index sequential files; indexed sequential
access method; ISAM; overflow; overflow chaining;
overflow handling; performance analysis",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}; Information Systems --- Database
Management --- Physical Design (H.2.2): {\bf Access
methods}",
}
@Article{Comer:1981:EKD,
author = "D. Comer",
title = "Extended {K-d} Tree Database Organization: {A} Dynamic
Multiattribute File Corresponds to Leaves in the Tree",
journal = j-TODS,
volume = "6",
number = "3",
pages = "??--??",
month = sep,
year = "1981",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Dec 10 12:49:00 1996",
bibsource = "Database/Wiederhold.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
annote = "This paper considers a `greedy' heuristic for
constructing low-cost trees.",
fjournal = "ACM Transactions on Database Systems",
xxnote = "This paper does not seem to be published in TODS.",
}
@Article{Zaniolo:1982:DRN,
author = "C. Zaniolo",
title = "Database Relations with Null Values",
journal = j-TODS,
volume = "1",
number = "1",
pages = "??--??",
month = mar,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Dec 10 12:48:57 1996",
bibsource = "Database/Wiederhold.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
annote = "a three-valued logic: TRUE, FALSE, UNKNOWN",
fjournal = "ACM Transactions on Database Systems",
xxnote = "This paper does not seem to be published in TODS.",
}
@Article{Katz:1982:DCD,
author = "R. H. Katz and E. Wong",
title = "Decompiling {CODASYL DML} into Relational Queries",
journal = j-TODS,
volume = "7",
number = "1",
pages = "1--23",
month = mar,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-1/p1-katz/p1-katz.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-1/p1-katz/",
abstract = "A ``decompilation'' algorithm is developed to
transform a program written with the procedural
operations of CODASYL DML into one which interacts with
a relational system via a nonprocedural query
specification. An Access Path Model is introduced to
interpret the semantic accesses performed by the
program. Data flow analysis is used to determine how
FIND operations implement semantic accesses. A sequence
of these is mapped into a relational query and embedded
into the original program. The class of programs for
which the algorithm succeeds is characterized.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems; decompilation; semantic data
models",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Relational databases};
Information Systems --- Database Management ---
Languages (H.2.3): {\bf Data manipulation languages
(DML)}; Information Systems --- Database Management ---
Languages (H.2.3): {\bf Query languages}; Information
Systems --- Database Management --- Heterogeneous
Databases (H.2.5): {\bf Program translation**}",
}
@Article{Zaniolo:1982:FAD,
author = "Carlo Zaniolo and Michel A. Melkanoff",
title = "A Formal Approach to the Definition and the Design of
Conceptual Schemata for Database Systems",
journal = j-TODS,
volume = "7",
number = "1",
pages = "24--59",
month = mar,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-1/p24-zaniolo/p24-zaniolo.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-1/p24-zaniolo/",
abstract = "A formal approach is proposed to the definition and
the design of conceptual database diagrams to be used
as conceptual schemata in a system featuring a
multilevel schema architecture, and as an aid for the
design of other forms of schemata. We consider E-R
(entity-relationship) diagrams, and we introduce a new
representation called {\em CAZ\/}-graphs. A rigorous
connection is established between these diagrams and
some formal constraints used to describe relationships
in the framework of the relational data model. These
include functional and multivalued dependencies of
database relations. The basis for our schemata is a
combined representation for two fundamental structures
underlying every relation: the first defined by its
minimal atomic decompositions, the second by its
elementary functional dependencies.\par
The interaction between these two structures is
explored, and we show that, jointly, they can represent
a wide spectrum of database relationships, of which the
well-known one-to-one, one-to-many, and many-to-many
associations constitute only a small subset. It is
suggested that a main objective in conceptual schema
design is to ensure a complete representation of these
two structures. A procedure is presented to design
schemata which obtain this objective while eliminating
redundancy. A simple correspondence between the
topological properties of these schemata and the
structure of multivalued dependencies of the original
relation is established. Various applications are
discussed and a number of illustrative examples are
given.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems, logical design TODS",
subject = "Information Systems --- Database Management ---
Systems (H.2.4); Information Systems --- Database
Management --- Logical Design (H.2.1): {\bf Data
models}; Information Systems --- Database Management
--- Logical Design (H.2.1): {\bf Schema and
subschema}",
}
@Article{Batory:1982:OFD,
author = "D. S. Batory",
title = "Optimal File Designs and Reorganization Points",
journal = j-TODS,
volume = "7",
number = "1",
pages = "60--81",
month = mar,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: University of Toronto,
TR-CSRG-110, 1980.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-1/p60-batory/p60-batory.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-1/p60-batory/",
abstract = "A model for studying the combined problems of file
design and file reorganization is presented. New
modeling techniques for predicting the performance
evolution of files and for finding optimal
reorganization points for files are introduced.
Applications of the model to hash-based and
indexed-sequential files reveal important relationships
between initial loading factors and reorganization
frequency. A practical file design strategy, based on
these relationships, is proposed.",
acknowledgement = ack-nhfb,
annote = "Applications of the model to hash-based and
indexed-sequential files reveal important relationships
between initial loading factors and reorganization
frequency.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data processing; file design; file reorganization",
subject = "Information Systems --- Database Management ---
Systems (H.2.4); Information Systems --- Database
Management --- Physical Design (H.2.2)",
}
@Article{Du:1982:DAC,
author = "H. C. Du and J. S. Sobolewski",
title = "Disk Allocation for {Cartesian} Product Files on
Multiple-Disk Systems",
journal = j-TODS,
volume = "7",
number = "1",
pages = "82--101",
month = mar,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-1/p82-du/p82-du.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-1/p82-du/",
abstract = "Cartesian product files have recently been shown to
exhibit attractive properties for partial match
queries. This paper considers the file allocation
problem for Cartesian product files, which can be
stated as follows: Given a $k$-attribute Cartesian
product file and an $m$-disk system, allocate buckets
among the $m$ disks in such a way that, for all
possible partial match queries, the concurrency of disk
accesses is maximized. The Disk Modulo (DM) allocation
method is described first, and it is shown to be strict
optimal under many conditions commonly occurring in
practice, including all possible partial match queries
when the number of disks is 2 or 3. It is also shown
that although it has good performance, the DM
allocation method is not strict optimal for all
possible partial match queries when the number of disks
is greater than 3. The General Disk Modulo (GDM)
allocation method is then described, and a sufficient
but not necessary condition for strict optimality of
the GDM method for all partial match queries and any
number of disks is then derived. Simulation studies
comparing the DM and random allocation methods in terms
of the average number of disk accesses, in response to
various classes of partial match queries, show the
former to be significantly more effective even when the
number of disks is greater than 3, that is, even in
cases where the DM method is not strict optimal. The
results that have been derived formally and shown by
simulation can be used for more effective design of
optimal file systems for partial match queries. When
considering multiple-disk systems with independent
access paths, it is important to ensure that similar
records are clustered into the same or similar buckets,
while similar buckets should be dispersed uniformly
among the disks.",
acknowledgement = ack-nhfb,
annote = "For partial match queries. Allocate buckets among the
m disks in such a way that, for all possible partial
match queries, the concurrency of disk accesses is
maximized.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "Cartesian product files; data processing",
subject = "Information Systems --- Database Management ---
Physical Design (H.2.2); Information Systems ---
Information Storage and Retrieval --- Information
Storage (H.3.2): {\bf File organization}; Information
Systems --- Information Storage and Retrieval ---
Information Search and Retrieval (H.3.3): {\bf Search
process}; Information Systems --- Database Management
--- Systems (H.2.4)",
}
@Article{Dahl:1982:DSD,
author = "Ver{\'o}nica Dahl",
title = "On Database Systems Development through Logic",
journal = j-TODS,
volume = "7",
number = "1",
pages = "102--123",
month = mar,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68H05 (03B99)",
MRnumber = "83f:68112",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Ai/nonmono.bib; Compendex database;
Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-1/p102-dahl/p102-dahl.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-1/p102-dahl/",
abstract = "The use of logic as a single tool for formalizing and
implementing different aspects of database systems in a
uniform manner is discussed. The discussion focuses on
relational databases with deductive capabilities and
very high-level querying and defining features. The
computational interpretation of logic is briefly
reviewed, and then several pros and cons concerning the
description of data, programs, queries, and language
parser in terms of logic programs are examined. The
inadequacies are discussed, and it is shown that they
can be overcome by the introduction of convenient
extensions into logic programming. Finally, an
experimental database query system with a natural
language front end, implemented in PROLOG, is presented
as an illustration of these concepts. A description of
the latter from the user's point of view and a sample
consultation session in Spanish are included.",
acknowledgement = ack-nhfb,
annote = "The use of logic as a single tool for relational
databases with deductive capabilities and very
high-level querying and defining features. Inadequacies
are discussed, and overcome by extensions into logic
programming. An experimental database query system with
a natural language front end, implemented in PROLOG, is
presented.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems, TODS relational database; rational
database",
subject = "Information Systems --- Database Management ---
Systems (H.2.4); Theory of Computation --- Mathematical
Logic and Formal Languages --- Mathematical Logic
(F.4.1): {\bf Logic and constraint programming};
Information Systems --- Database Management ---
Languages (H.2.3): {\bf Query languages}; Information
Systems --- Database Management --- Systems (H.2.4):
{\bf Relational databases}; Information Systems ---
Database Management --- Languages (H.2.3): {\bf
Prolog}",
}
@Article{Addis:1982:RBL,
author = "T. R. Addis",
title = "A Relation-Based Language Interpreter for a Content
Addressable File Store",
journal = j-TODS,
volume = "7",
number = "2",
pages = "125--163",
month = jun,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-2/p125-addis/p125-addis.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-2/p125-addis/",
abstract = "The combination of the Content Addressable File Store
(CAFS \footnote{CAFS is a registered trademark of
International Computers Limited}) and an extension of
relational analysis is described. This combination
allows a simple and compact implementation of a
database query and update language (FIDL). The language
has one of the important properties of a ``natural''
language interface by using a ``world model'' derived
from the relational analysis. The interpreter (FLIN)
takes full advantage of the CAFS by employing a unique
database storage technique which results in a fast
response to both queries and updates.",
acknowledgement = ack-nhfb,
annote = "ICL CAFS is used.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "computer operating systems --- program Interpreters,
hardware support database machine CAFS TODS; content
addressing; data base systems",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}; Information
Systems --- Database Management --- Database Machines
(H.2.6)",
}
@Article{Buneman:1982:ITD,
author = "Peter Buneman and Robert E. Frankel and Rishiyur
Nikhil",
title = "An Implementation Technique for Database Query
Languages",
journal = j-TODS,
volume = "7",
number = "2",
pages = "164--186",
month = jun,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/; Misc/Functional.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-2/p164-buneman/p164-buneman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-2/p164-buneman/",
abstract = "Structured query languages, such as those available
for relational databases, are becoming increasingly
desirable for all database management systems. Such
languages are applicative: there is no need for an
assignment or update statement. A new technique is
described that allows for the implementation of
applicative query languages against most commonly used
database systems. The technique involves ``lazy''
evaluation and has a number of advantages over existing
methods: it allows queries and functions of arbitrary
complexity to be constructed; it reduces the use of
secondary storage; it provides a simple control
structure through which interfaces to other programs
may be constructed; and the implementation, including
the database interface, is quite compact. Although the
technique is presented for a specific functional
programming system and for a CODASYL DBMS, it is
general and may be used for other query languages and
database systems.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "applicative programming; coroutines; database
interfaces; functional, data base systems; lazy
evaluation; query languages; TODS functional FQL
applicative programming lazy evaluation",
subject = "Information Systems --- Database Management ---
Systems (H.2.4); Software --- Programming Languages ---
Language Classifications (D.3.2): {\bf Applicative
(functional) languages}; Information Systems ---
Database Management --- Languages (H.2.3): {\bf Query
languages}",
}
@Article{Obermarck:1982:DDD,
author = "Ron Obermarck",
title = "Distributed Deadlock Detection Algorithm",
journal = j-TODS,
volume = "7",
number = "2",
pages = "187--208",
month = jun,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/; Misc/misc.1.bib;
Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-2/p187-obermarck/p187-obermarck.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-2/p187-obermarck/",
abstract = "We propose an algorithm for detecting deadlocks among
transactions running concurrently in a distributed
processing network (i.e., a distributed database
system). The proposed algorithm is a distributed
deadlock detection algorithm. A proof of the
correctness of the distributed portion of the algorithm
is given, followed by an example of the algorithm in
operation. The performance characteristics of the
algorithm are also presented.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "computer programming; data base systems; deadlock
detection",
subject = "Information Systems --- Database Management ---
Systems (H.2.4); Computer Systems Organization ---
Computer-Communication Networks --- Distributed Systems
(C.2.4): {\bf Distributed databases}; Software ---
Operating Systems --- Process Management (D.4.1): {\bf
Deadlocks}; Software --- Operating Systems ---
Organization and Design (D.4.7): {\bf Distributed
systems}",
}
@Article{Garcia-Molina:1982:ROT,
author = "H{\'e}ctor Garc{\'\i}a-Molina and Gio Wiederhold",
title = "Read-Only Transactions in a Distributed Database",
journal = j-TODS,
volume = "7",
number = "2",
pages = "209--234",
month = jun,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-2/p209-garcia-molina/p209-garcia-molina.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-2/p209-garcia-molina/",
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.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "concurrency control; consistency; currency; data base
systems, TODS R insularity; query; R insularity;
read-only transaction; schedule; serializability;
transaction; transaction processing algorithm",
subject = "Information Systems --- Database Management ---
Systems (H.2.4); Information Systems --- Database
Management --- Systems (H.2.4): {\bf Query processing};
Computer Systems Organization ---
Computer-Communication Networks --- Distributed Systems
(C.2.4): {\bf Distributed databases}",
}
@Article{Shneiderman:1982:AAR,
author = "Ben Shneiderman and Glenn Thomas",
title = "An Architecture for Automatic Relational Database
System Conversion",
journal = j-TODS,
volume = "7",
number = "2",
pages = "235--257",
month = jun,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/database.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-2/p235-shneiderman/p235-shneiderman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-2/p235-shneiderman/",
abstract = "Changes in requirements for database systems
necessitate schema restructuring, database translation,
and application or query program conversion. An
alternative to the lengthy manual revision process is
proposed by offering a set of 15 transformations keyed
to the relational model of data and the relational
algebra. Motivations, examples, and detailed
descriptions are provided.",
acknowledgement = ack-nhfb,
annote = "Alterations to the logical structure of a DB may
necessitate changes at three levels: (1) stored
database, (2) schema definition, and (3) application
programs or queries. Each transformation is assessed on
three features: (1) information preservation (data are
not destroyed, only their logical format is altered);
(2) data dependence (a data dependent transformation is
one in which the stored DB must be checked to determine
whether it is consistent with the logical format of the
target system); and (3) program dependence (a program
dependent transformation is one in which the
application programs must be checked to determine
whether the transformation is permissible). At every
stage the DB is kept in fourth normal form. The 15
transformations are divided into five groups. The first
group includes simple alterations, such as changing the
name of an attribute or relation (CHANGE NAME), or
adding or deleting attributes or relations (ADD/DELETE
ATTRIBUTES, INTRODUCE/SEPARATE). The role played by
keys in the relational model is clearly critical, and
particular care must be taken when transformations
involving these keys are being carried out. The second
group of transformations concerns the effect of adding
attributes to or deleting attributes from keys
(PROMOTE/DEMOTE). The third and fourth sets of
transformations are provided for the combining and
dividing of relations. (COMPOSE/DECOMPOSE,
PARTITION/MERGE). The final group of transformations is
concerned with functional dependencies",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "automatic conversion; data base systems; database
systems; relational model; transformations",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Schema and subschema};
Information Systems --- Database Management ---
Languages (H.2.3): {\bf Data manipulation languages
(DML)}; Information Systems --- Database Management ---
Heterogeneous Databases (H.2.5): {\bf Program
translation**}",
}
@Article{Roussopoulos:1982:VIR,
author = "Nicholas Roussopoulos",
title = "View Indexing in Relational Databases",
journal = j-TODS,
volume = "7",
number = "2",
pages = "258--290",
month = jun,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-2/p258-roussopoulos/p258-roussopoulos.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-2/p258-roussopoulos/",
abstract = "The design and maintenance of a useful database system
require efficient optimization of the logical access
paths which demonstrate repetitive usage patterns.
Views (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 this selection.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data base systems, views precomputation index
selection TODS index selection; index selection",
subject = "Information Systems --- Database Management ---
Physical Design (H.2.2); Information Systems ---
Database Management --- Systems (H.2.4): {\bf Query
processing}",
}
@Article{Jacobs:1982:IRL,
author = "Barry E. Jacobs and Alan R. Aronson and Anthony C.
Klug",
title = "On Interpretations of Relational Languages and
Solutions to the Implied Constraint Problem",
journal = j-TODS,
volume = "7",
number = "2",
pages = "291--315",
month = jun,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-2/p291-jacobs/p291-jacobs.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-2/p291-jacobs/",
abstract = "The interconnection between conceptual and external
levels of a relational database is made precise in
terms of the notion of ``interpretation'' between
first-order languages. This is then used to obtain a
methodology for discovering constraints at the external
level that are ``implied'' by constraints at the
conceptual level and by conceptual-to-external
mappings. It is also seen that these concepts are
important in other database issues, namely, automatic
program conversion, database design, and compile-time
error checking of embedded database languages. Although
this study deals exclusively with the relational
approach, it also discusses how these ideas can be
extended to hierarchical and network databases.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "constraints; data base systems; program conversion;
relational database",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Information
Systems --- Database Management --- Logical Design
(H.2.1): {\bf Schema and subschema}; Information
Systems --- Database Management --- Languages (H.2.3):
{\bf Data manipulation languages (DML)}",
}
@Article{Chamberlin:1982:HFC,
author = "Donald D. Chamberlin",
title = "On ``Human Factors Comparison of a Procedural and a
Nonprocedural Query Language''",
journal = j-TODS,
volume = "7",
number = "2",
pages = "316--317",
month = jun,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Dec 10 12:45:59 1996",
bibsource = "Database/Graefe.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
fjournal = "ACM Transactions on Database Systems",
keywords = "TODS technical correspondence",
}
@Article{Traiger:1982:TCD,
author = "Irving L. Traiger and Jim Gray and Cesare A. Galtieri
and Bruce G. Lindsay",
title = "Transactions and Consistency in Distributed Database
Systems",
journal = j-TODS,
volume = "7",
number = "3",
pages = "323--342",
month = sep,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/; Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-3/p323-traiger/p323-traiger.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-3/p323-traiger/",
abstract = "The concepts of transaction and of data consistency
are defined for a distributed system. The cases of
partitioned data, where fragments of a file are stored
at multiple nodes, and replicated data, where a file is
replicated at several nodes, are discussed. It is
argued that the distribution and replication of data
should be transparent to the programs which use the
data. That is, the programming interface should provide
location transparency, replica transparency,
concurrency transparency, and failure transparency.
Techniques for providing such transparencies are
abstracted and discussed.\par
By extending the notions of system schedule and system
clock to handle multiple nodes, it is shown that a
distributed system can be modeled as a single
sequential execution sequence. This model is then used
to discuss simple techniques for implementing the
various forms of transparency.",
acknowledgement = ack-nhfb,
annote = "This paper is a easy-to-read introduction to required
transparency in distributed database systems. 4
transparencies are chosen and explained here, namely
location transparency, replication transparency,
concurrency transparency, and failure transparency. The
transaction model adapted by the paper is fully
synchronous and 2 phase protocol is used to implement
concurrency transparency. The paper proves that if all
transaction executions are two-phase, any legal
execution of the transactions by a distributed system
will be equivalent to some serial execution of the
transactions by a system consisting of a single node
under the assumption that updates are synchronous. The
paper introduces special node-associated clock to prove
it. The paper also gives simple explanation about a
protocol to implement failure transparency using logs
and two-phase commit protocol.",
fjournal = "ACM Transactions on Database Systems",
keywords = "concurrency control; data partitioning; data
replication; recovery; TODS data replication, data
partitioning",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Distributed databases};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Transaction processing}",
}
@Article{Fagin:1982:SUR,
author = "Ronald Fagin and Alberto O. Mendelzon and Jeffrey D.
Ullman",
title = "A Simplified Universal Relation Assumption and its
Properties",
journal = j-TODS,
volume = "7",
number = "3",
pages = "343--360",
month = sep,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68H05 (68B15)",
MRnumber = "83k:68100",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/bibdb.bib; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-3/p343-fagin/p343-fagin.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-3/p343-fagin/",
abstract = "One problem concerning the universal relation
assumption is the inability of known methods to obtain
a database scheme design in the general case, where the
real-world constraints are given by a set of
dependencies that includes embedded multivalued
dependencies. We propose a simpler method of describing
the real world, where constraints are given by
functional dependencies and a single join dependency.
The relationship between this method of defining the
real world and the classical methods is exposed. We
characterize in terms of hypergraphs those multivalued
dependencies that are the consequence of a given join
dependency. Also characterized in terms of hypergraphs
are those join dependencies that are equivalent to a
set of multivalued dependencies.",
acknowledgement = ack-nhfb,
annote = "Constraints are functional dependencies and a single
join dependency.",
fjournal = "ACM Transactions on Database Systems",
keywords = "acyclic; database scheme; hypergraph; join dependency;
multivalued dependency; relational database",
subject = "Theory of Computation --- Mathematical Logic and
Formal Languages --- Mathematical Logic (F.4.1);
Mathematics of Computing --- Discrete Mathematics ---
Graph Theory (G.2.2): {\bf Graph algorithms};
Mathematics of Computing --- Discrete Mathematics ---
Graph Theory (G.2.2): {\bf Trees}; Information Systems
--- Database Management --- Logical Design (H.2.1):
{\bf Normal forms}; Information Systems --- Database
Management --- Logical Design (H.2.1): {\bf Schema and
subschema}; Information Systems --- Information Storage
and Retrieval --- Information Search and Retrieval
(H.3.3): {\bf Query formulation}; Information Systems
--- Database Management --- Systems (H.2.4): {\bf
Relational databases}",
}
@Article{Klug:1982:DVD,
author = "Anthony Klug and Rod Price",
title = "Determining {View} dependencies using tableaux",
journal = j-TODS,
volume = "7",
number = "3",
pages = "361--380",
month = sep,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68H05",
MRnumber = "83k:68103",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-3/p361-klug/p361-klug.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-3/p361-klug/",
abstract = "A relational database models some part of the real
world by a set of relations and a set of constraints.
The constraints model properties of the stored
information and must be maintained true at all times.
For views defined over physically stored (base)
relations, this is done by determining whether the view
constraints are logical consequences of base relation
constraints. A technique for determining such valid
view constraints is presented in this paper. A
generalization of the tableau chase is used. The idea
of the method is to generate a tableau for the
expression whose summary violates the test constraints
in a ``canonical'' way. The chase then tries to remove
this violation.\par
It is also shown how this method has applications to
schema design. Relations not in normal form or having
other deficiencies can be replaced by normal form
projections without losing the ability to represent all
constraint information.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "chase; dependencies; rational algebra; relational
model; tableaux; views TODS",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Schema and subschema}",
}
@Article{Dayal:1982:CTU,
author = "Umeshwar Dayal and Philip A. Bernstein",
title = "On the Correct Translation of Update Operations on
Relational Views",
journal = j-TODS,
volume = "7",
number = "3",
pages = "381--416",
month = sep,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68H05",
MRnumber = "83k:68099",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-3/p381-dayal/p381-dayal.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-3/p381-dayal/",
abstract = "Most relational database systems provide a facility
for supporting user views. Permitting this level of
abstraction has the danger, however, that update
requests issued by a user within the context of his
view may not translate correctly into equivalent
updates on the underlying database. The purpose of this
paper is to formalize the notion of update translation
and derive conditions under which translation
procedures will produce correct translations of view
updates.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "external schemata; relational databases; schema
mapping; update translation; user views",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Schema and subschema};
Information Systems --- Database Management ---
Languages (H.2.3): {\bf Data manipulation languages
(DML)}; Information Systems --- Database Management ---
Systems (H.2.4); Information Systems --- Database
Management --- Heterogeneous Databases (H.2.5): {\bf
Program translation**}; Computing Methodologies ---
Artificial Intelligence --- Automatic Programming
(I.2.2): {\bf Program transformation}",
}
@Article{Griffith:1982:TPR,
author = "Robert L. Griffith",
title = "Three Principles of Representation for Semantic
Networks",
journal = j-TODS,
volume = "7",
number = "3",
pages = "417--442",
month = sep,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-3/p417-griffith/p417-griffith.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-3/p417-griffith/",
abstract = "Semantic networks are so intuitive and easy to use
that they are often employed without much thought as to
the phenomenon of semantic nets themselves. Since they
are becoming more and more a tool of artificial
intelligence and now database technology, it is
appropriate to focus on the principles of semantic
nets. Such focus finds a harmonious and consistent base
which can increase the semantic quality and usefulness
of such nets. Three rules of representation are
presented which achieve greater conceptual simplicity
for users, simplifications in semantic net
implementations and maintenance, and greater
consistency across semantic net applications. These
rules, applied to elements of the net itself, reveal
how fundamental structures should be organized, and
show that the common labeled-edge semantic net can be
derived from a more primitive structure involving only
nodes and membership relationships (and special nodes
which represent names). Also, the correlation between
binary and $n$-ary relations is presented.",
acknowledgement = ack-nhfb,
annote = "Semantic networks are employed without much thought.
They are becoming a tool of artificial intelligences
and database technology, principles of semantic nets.
Three rules of representation are presented. The common
labeled-edge semantic net can be derived from a more
primitive structure involving only nodes and membership
relationships.",
fjournal = "ACM Transactions on Database Systems",
subject = "Data --- Data Structures (E.1): {\bf Graphs and
networks}; Computing Methodologies --- Artificial
Intelligence --- Knowledge Representation Formalisms
and Methods (I.2.4): {\bf Semantic networks}",
}
@Article{Kim:1982:OSL,
author = "Won Kim",
title = "On Optimizing an {SQL-like} Nested Query",
journal = j-TODS,
volume = "7",
number = "3",
pages = "443--469",
month = sep,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-3/p443-kim/p443-kim.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-3/p443-kim/",
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.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "aggregate function; divide; join; nested query;
predicate; relational database; SQL queries TODS",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}",
}
@Article{Wong:1982:SAI,
author = "Eugene Wong",
title = "A Statistical Approach to Incomplete Information in
Database Systems",
journal = j-TODS,
volume = "7",
number = "3",
pages = "470--488",
month = sep,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68H05",
MRnumber = "83k:68108",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/bibdb.bib; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-3/p470-wong/p470-wong.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-3/p470-wong/",
abstract = "There are numerous situations in which a database
cannot provide a precise answer to some of the
questions that are posed. Sources of imprecision vary
and include examples such as recording errors,
incompatible scaling, and obsolete data. In many such
situations, considerable prior information concerning
the imprecision exists and can be exploited to provide
valuable information for queries to which no exact
answer can be given. The objective of this paper is to
provide a framework for doing so.",
acknowledgement = ack-nhfb,
annote = "Sources of imprecision include recording errors,
incompatible scaling, and obsolete data. In many
situations considerable prior information concerning
the imprecision exists and can be exploited. This paper
provides a framework. Null values.",
fjournal = "ACM Transactions on Database Systems",
keywords = "incomplete information; missing values; null values;
TODS null values",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Information
Systems --- Database Management --- Logical Design
(H.2.1): {\bf Schema and subschema}",
}
@Article{Zaniolo:1982:NNF,
author = "Carlo Zaniolo",
title = "A New Normal Form for the Design of Relational
Database Schemata",
journal = j-TODS,
volume = "7",
number = "3",
pages = "489--499",
month = sep,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68H05 (68B15)",
MRnumber = "83k:68109",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-3/p489-zaniolo/p489-zaniolo.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-3/p489-zaniolo/",
abstract = "This paper addresses the problem of database schema
design in the framework of the relational data model
and functional dependencies. It suggests that both
Third Normal Form (3NF) and Boyce-Codd Normal Form
(BCNF) supply an inadequate basis for relational schema
design. The main problem with 3NF is that it is too
forgiving and does not enforce the separation principle
as strictly as it should. On the other hand, BCNF is
incompatible with the principle of representation and
prone to computational complexity. Thus a new normal
form, which lies between these two and captures the
salient qualities of both is proposed. The new normal
form is stricter than 3NF, but it is still compatible
with the representation principle. First a simpler
definition of 3NF is derived, and the analogy of this
new definition to the definition of BCNF is noted. This
analogy is used to derive the new normal form. Finally,
it is proved that Bernstein's algorithm for schema
design synthesizes schemata that are already in the new
normal form.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "database schema; functional dependencies; relational
model",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Normal forms}",
}
@Article{Lam:1982:CSA,
author = "K. Lam and C. T. Yu",
title = "A Clustered Search Algorithm Incorporating Arbitrary
Term Dependencies",
journal = j-TODS,
volume = "7",
number = "3",
pages = "500--508",
month = sep,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68H05",
MRnumber = "83k:68104",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/bibdb.bib; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-3/p500-lam/p500-lam.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-3/p500-lam/",
abstract = "The documents in a database are organized into
clusters, where each cluster contains similar documents
and a representative of these documents. A user query
is compared with all the representatives of the
clusters, and on the basis of such comparisons, those
clusters having many {\em close neighbors\/} with
respect to the query are selected for searching. This
paper presents an estimation of the number of close
neighbors in a cluster in relation to the given query.
The estimation takes into consideration the
dependencies between terms. It is demonstrated by
experiments that the estimate is accurate and the time
to generate the estimate is small.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "Bahadur-Lazarsfeld expansion; clustered search; CTYU
TODS; generating polynomial; term dependencies",
subject = "Theory of Computation --- Analysis of Algorithms and
Problem Complexity --- General (F.2.0); Mathematics of
Computing --- Discrete Mathematics --- Combinatorics
(G.2.1): {\bf Combinatorial algorithms}; Information
Systems --- Information Storage and Retrieval ---
Information Storage (H.3.2): {\bf File organization};
Information Systems --- Information Storage and
Retrieval --- Information Search and Retrieval (H.3.3):
{\bf Clustering}; Information Systems --- Information
Storage and Retrieval --- Information Search and
Retrieval (H.3.3): {\bf Retrieval models}; Information
Systems --- Information Storage and Retrieval ---
Information Search and Retrieval (H.3.3): {\bf Search
process}",
}
@Article{Batory:1982:UMP,
author = "D. S. Batory and C. C. Gotlieb",
title = "A Unifying Model of Physical Databases",
journal = j-TODS,
volume = "7",
number = "4",
pages = "509--539",
month = dec,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-4/p509-batory/p509-batory.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-4/p509-batory/",
abstract = "A unifying model for the study of database performance
is proposed. Applications of the model are shown to
relate and extend important work concerning batched
searching, transposed files, index selection, dynamic
hash-based files, generalized access path structures,
differential files, network databases, and multifile
query processing.",
acknowledgement = ack-nhfb,
annote = "See also \cite{Piwowarski:1985:CBS}.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "database systems, TODS decomposition; decomposition;
linksets; simple files; unifying model",
subject = "Information Systems --- Database Management ---
Physical Design (H.2.2)",
}
@Article{Aghili:1982:PGD,
author = "Houtan Aghili and Dennis G. Severance",
title = "Practical Guide to the Design of Differential Files
for Recovery of On-Line Databases",
journal = j-TODS,
volume = "7",
number = "4",
pages = "540--565",
month = dec,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-4/p540-aghili/p540-aghili.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-4/p540-aghili/",
abstract = "The concept of a differential file has previously been
proposed as an efficient means of collecting database
updates for on-line systems. This paper studies the
problem of database backup and recovery for such
systems, and presents an analytic model of their
operation. Five key design decisions are identified and
an optimization procedure for each is developed. A
design algorithm that quickly provides parameters for a
near-optimal differential file architecture is
provided.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "backup and recovery; data processing; database
maintenance; database systems; differential files;
hashing functions; numerical methods; optimization;
reorganization",
subject = "Data --- Data Storage Representations (E.2);
Mathematics of Computing --- Numerical Analysis (G.1);
Information Systems --- Database Management ---
Physical Design (H.2.2); Information Systems ---
Database Management --- Database Administration
(H.2.7)",
}
@Article{Larson:1982:PAL,
author = "Per-{\AA}ke Larson",
title = "Performance Analysis of Linear Hashing with Partial
Expansions",
journal = j-TODS,
volume = "7",
number = "4",
pages = "566--587",
month = dec,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-4/p566-larson/p566-larson.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-4/p566-larson/",
abstract = "Linear hashing with partial expansions is a new file
organization primarily intended for files which grow
and shrink dynamically. This paper presents a
mathematical analysis of the expected performance of
the new scheme. The following performance measures are
considered: length of successful and unsuccessful
searches, accesses required to insert or delete a
record, and the size of the overflow area. The
performance is cyclical. For all performance measures,
the necessary formulas are derived for computing the
expected performance at any point of a cycle and the
average over a cycle. Furthermore, the expected worst
case in connection with searching is analyzed. The
overall performance depends on several file parameters.
The numerical results show that for many realistic
parameter combinations the performance is expected to
be extremely good. Even the longest search is expected
to be of quite reasonable length.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "dynamic hashing schemes; extendible hashing; hashing;
linear hashing; TODS dynamic hashing, extendible
hashing, TODS dynamic hashing, extendible hashing, data
processing",
subject = "Theory of Computation --- Analysis of Algorithms and
Problem Complexity --- Nonnumerical Algorithms and
Problems (F.2.2): {\bf Sorting and searching};
Information Systems --- Database Management ---
Physical Design (H.2.2): {\bf Access methods};
Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}",
}
@Article{Babb:1982:JNF,
author = "E. Babb",
title = "Joined Normal Form: {A} Storage Encoding for
Relational Databases",
journal = j-TODS,
volume = "7",
number = "4",
pages = "588--614",
month = dec,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-4/p588-babb/p588-babb.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-4/p588-babb/",
abstract = "A new on-line query language and storage structure for
a database machine is presented. By including a
mathematical model in the interpreter the query
language has been substantially simplified so that no
reference to relation names is necessary. By storing
the model as a single joined normal form (JNF) file, it
has been possible to exploit the powerful search
capability of the Content Addressable File Store (CAFS;
CAFS is a registered trademark of International
Computers Limited) database machine.",
acknowledgement = ack-nhfb,
annote = "prejoining for CAFS.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "CAFS; content addressing hardware; database systems;
functional dependencies; implication network; joined
normal form; joins; mathematical model; network;
queries; relational database; storage encoding tags;
storage encoding, TODS CAFS, third normal form; third
normal form; updates",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Information
Systems --- Database Management --- Languages (H.2.3):
{\bf Query languages}; Information Systems ---
Information Storage and Retrieval --- Information
Search and Retrieval (H.3.3): {\bf Search process}",
}
@Article{Heyman:1982:MMD,
author = "Daniel P. Heyman",
title = "Mathematical Models of Database Degradation",
journal = j-TODS,
volume = "7",
number = "4",
pages = "615--631",
month = dec,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-4/p615-heyman/p615-heyman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-4/p615-heyman/",
abstract = "As data are updated, the initial physical structure of
a database is changed and retrieval of specific pieces
of data becomes more time consuming. This phenomenon is
called database degradation. In this paper two models
of database degradation are described. Each model
refers to a different aspect of the problem.\par
It is assumed that transactions are statistically
independent and either add, delete, or update data. The
first model examines the time during which a block of
data is filling up. The second model examines the
overflows from a block of data, which essentially
describes the buildup of disorganization. Analytical
results are obtained for both models. In addition,
several numerical examples are presented which show
that the mean number of overflows grows approximately
linearly with time. This approximation is used to
devise a simple formula for the optimal time to
reorganize a stochastically growing database.",
acknowledgement = ack-nhfb,
classification = "723; 921",
fjournal = "ACM Transactions on Database Systems",
keywords = "data overflows; database degradation, TODS data
overflows; database systems; file organization;
mathematical models",
subject = "Computer Systems Organization --- Performance of
Systems (C.4): {\bf Modeling techniques}; Information
Systems --- Database Management --- Database
Administration (H.2.7): {\bf Logging and recovery}",
}
@Article{Korth:1982:DFU,
author = "Henry F. Korth",
title = "Deadlock Freedom Using Edge Locks",
journal = j-TODS,
volume = "7",
number = "4",
pages = "632--652",
month = dec,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-4/p632-korth/p632-korth.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-4/p632-korth/",
abstract = "We define a series of locking protocols for database
systems that all have three main features: freedom from
deadlock, multiple granularity, and support for general
collections of locking primitives. A rooted directed
acyclic graph is used to represent multiple
granularities, as in System R. Deadlock freedom is
guaranteed by extending the System R protocol to
require locks on edges of the graph in addition to the
locks required on nodes.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "concurrency control; database systems; locking;
serializability",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Transaction processing}",
}
@Article{Goodman:1982:TQS,
author = "Nathan Goodman and Oded Shmueli",
title = "Tree Queries: {A} Simple Class of Relational Queries",
journal = j-TODS,
volume = "7",
number = "4",
pages = "653--677",
month = dec,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/; Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-4/p653-goodman/p653-goodman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-4/p653-goodman/",
abstract = "One can partition the class of relational database
schemas into tree schemas and cyclic schemas. (These
are called acyclic hypergraphs and cyclic hypergraphs
elsewhere in the literature.) This partition has
interesting implications in query processing,
dependency theory, and graph theory.\par
The tree/cyclic partitioning of database schemas
originated with a similar partition of equijoin
queries. Given an arbitrary equijoin query one can
obtain an equivalent query that calculates the natural
join of all relations in (an efficiently) derived
database; such a query is called a natural join (NJ)
query. If the derived database is a tree schema the
original query is said to be a tree query, and
otherwise a cyclic query.\par
In this paper we analyze query processing consequences
of the tree/cyclic partitioning. We are able to argue,
qualitatively, that queries which imply a tree schema
are easier to process than those implying a cyclic
schema. Our results also extend the study of the
semijoin operator.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "acyclic schemes; cyclic schemas; database systems;
join; semijoin; tree queries; tree schemas",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}",
}
@Article{Kerschberg:1982:QOS,
author = "Larry Kerschberg and Peter D. Ting and S. Bing Yao",
title = "Query Optimization in Star Computer Networks",
journal = j-TODS,
volume = "7",
number = "4",
pages = "678--711",
month = dec,
year = "1982",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/; Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1982-7-4/p678-kerschberg/p678-kerschberg.pdf;
http://www.acm.org/pubs/citations/journals/tods/1982-7-4/p678-kerschberg/",
abstract = "Query processing is investigated for relational
databases distributed over several computers organized
in a star network. Minimal response-time processing
strategies are presented for queries involving the
select, project, and join commands. These strategies
depend on system parameters such as communication costs
and different machine processing speeds; database
parameters such as relation cardinality and file size;
and query parameters such as estimates of the size and
number of tuples in the result relation. The optimal
strategies specify relation preparation processes, the
shipping strategy, serial or parallel processing, and,
where applicable, the site of join filtering and
merging. Strategies for optimizing select and join
queries have been implemented and tested.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "computer networks; database systems; query
optimization; relational database system; star computer
network",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Distributed Systems
(C.2.4): {\bf Distributed applications}; Computer
Systems Organization --- Computer-Communication
Networks --- Distributed Systems (C.2.4): {\bf
Distributed databases}; Computer Systems Organization
--- Performance of Systems (C.4): {\bf Design studies};
Computer Systems Organization --- Performance of
Systems (C.4): {\bf Modeling techniques}; Software ---
Operating Systems --- File Systems Management (D.4.3):
{\bf Distributed file systems}; Software --- Operating
Systems --- Organization and Design (D.4.7): {\bf
Distributed systems}; Information Systems --- Database
Management --- Physical Design (H.2.2): {\bf Access
methods}; Information Systems --- Database Management
--- Systems (H.2.4): {\bf Distributed databases}",
}
@Article{Maier:1983:MOS,
author = "David Maier and Jeffrey D. Ullman",
title = "Maximal Objects and the Semantics of Universal
Relation Databases",
journal = j-TODS,
volume = "8",
number = "1",
pages = "1--14",
month = mar,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: SUNY, Stony Brook, CS, TR
80/016, 1980.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-1/p1-maier/p1-maier.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-1/p1-maier/",
abstract = "The universal relation concept is intended to provide
the database user with a simplified model in which he
can compose queries without regard to the underlying
structure of the relations in the database. Frequently,
the lossless join criterion provides the query
interpreter with the clue needed to interpret the query
as the user intended. However, some examples exist
where interpretation by the lossless-join rule runs
contrary to our intuition. To handle some of these
cases, we propose a concept called {\em maximal
objects}, which modifies the universal relation concept
in exactly those situations where it appears to go awry
--- when the underlying relational structure has
``cycles.'' We offer examples of how the maximal object
concept provides intuitively correct interpretations.
We also consider how one might construct maximal
objects mechanically from purely syntactic structural
information --- the relation schemes and functional
dependencies --- about the database.",
acknowledgement = ack-nhfb,
annote = "A universal relation is represented by a hypergraph.
If the hypergraph is cyclic, some queries can be
evaluated in different ways; restricting navigation to
few acyclic components (maximal objects) gives
intuitively correct answers.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "acyclic hypergraph; database systems; relational
database; universal relation",
subject = "Mathematics of Computing --- Discrete Mathematics ---
Graph Theory (G.2.2): {\bf Path and circuit problems};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Data models}; Information Systems
--- Database Management --- Languages (H.2.3): {\bf
Data description languages (DDL)}; Information Systems
--- Database Management --- Languages (H.2.3): {\bf
Data manipulation languages (DML)}; Information Systems
--- Database Management --- Systems (H.2.4): {\bf Query
processing}",
}
@Article{Haskin:1983:OCH,
author = "Roger L. Haskin and Lee A. Hollaar",
title = "Operational Characteristics of a Hardware-Based
Pattern Matcher",
journal = j-TODS,
volume = "8",
number = "1",
pages = "15--40",
month = mar,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-1/p15-haskin/p15-haskin.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-1/p15-haskin/",
abstract = "The design and operation of a new class of
hardware-based pattern matchers, such as would be used
in a backended database processor in a full-text or
other retrieval system, is presented. This recognizer
is based on a unique implementation technique for
finite state automata consisting of partitioning the
state table among a number of simple digital machines.
It avoids the problems generally associated with
implementing finite state machines, such as large state
table memories, complex control mechanisms, and state
encodings. Because it consists primarily of memory,
with its high regularity and density, needs only
limited static interconnections, and operates at a
relatively low speed, it can be easily constructed
using integrated circuit techniques.\par
After a brief discussion of other pattern-matching
hardware, the structure and operation of the
partitioned finite state automaton is given, along with
a simplified discussion of how the state tables are
partitioned. The expected performance of the resulting
system and the state table partitioning programs is
then discussed.",
acknowledgement = ack-nhfb,
classification = "723; 901",
fjournal = "ACM Transactions on Database Systems",
keywords = "backend processors; computer system architecture;
database systems; finite state automata; full text
retrieval systems; information science; text
searching",
subject = "Hardware --- Logic Design --- Design Styles (B.6.1):
{\bf Cellular arrays and automata}; Hardware ---
Integrated Circuits --- Types and Design Styles
(B.7.1): {\bf Algorithms implemented in hardware};
Information Systems --- Database Management ---
Database Machines (H.2.6); Information Systems ---
Information Storage and Retrieval --- Information
Search and Retrieval (H.3.3): {\bf Search process}",
}
@Article{Sicherman:1983:AQR,
author = "George L. Sicherman and Wiebren {De Jonge} and Reind
P. {Van De Riet}",
title = "Answering Queries without Revealing Secrets",
journal = j-TODS,
volume = "8",
number = "1",
pages = "41--59",
month = mar,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: reprinted in deJonge thesis,
Jun. 1985.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-1/p41-sicherman/p41-sicherman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-1/p41-sicherman/",
abstract = "Question-answering systems must often keep certain
information secret. This can be accomplished, for
example, by sometimes refusing to answer a query. Here
the danger of revealing a secret by refusing to answer
a query is investigated. First several criteria that
can be used to decide whether or not to answer a query
are developed. First several criteria that can be used
to decide whether or not to answer a query are
developed. Then it is shown which of these criteria are
safe if the questioner knows nothing at all about what
is kept secret. Furthermore, it is proved that one of
these criteria is safe even if the user of the system
knows which information is to be kept secret.",
acknowledgement = ack-nhfb,
acmcrnumber = "8404-296",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "database systems, statistical security TODS; keeping
secrets; refusal to answer; strategy",
subject = "Information Systems --- Models and Principles ---
Systems and Information Theory (H.1.1): {\bf Value of
information}; Information Systems --- Models and
Principles --- User/Machine Systems (H.1.2);
Information Systems --- Information Storage and
Retrieval --- Systems and Software (H.3.4): {\bf
Current awareness systems (selective dissemination of
information--SDI)**}; Information Systems ---
Information Storage and Retrieval --- Systems and
Software (H.3.4): {\bf Question-answering (fact
retrieval) systems**}; Computing Methodologies ---
Artificial Intelligence --- Deduction and Theorem
Proving (I.2.3): {\bf Answer/reason extraction}",
}
@Article{deJonge:1983:CSD,
author = "Wiebren de Jonge",
title = "Compromising Statistical Databases Responding to
Queries About Means",
journal = j-TODS,
volume = "8",
number = "1",
pages = "60--80",
month = mar,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: reprinted in Jun. 1985 thesis",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-1/p60-de_jonge/p60-de_jonge.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-1/p60-de_jonge/",
abstract = "This paper describes how to compromise a statistical
database which only answers queries about arithmetic
means for query sets whose cardinality falls in the
range $[k,N-k]$, for some $k$ greater than $0$, where
$N$ greater than equivalent to $2k$ is the number of
records in the database. The compromise is shown to be
easy and to require only a little preknowledge; knowing
the cardinality of just one nonempty query set is
usually sufficient.\par
This means that not only count and sum queries, but
also queries for arithmetic means can be extremely
dangerous for the security of a statistical database,
and that this threat must be taken into account
explicitly by protective measures. This seems quite
important from a practical standpoint: while arithmetic
means were known for some time to be not altogether
harmless, the (perhaps surprising) extent of the threat
is now shown.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "compromise; database security; database systems;
security TODS; statistical databases",
subject = "Information Systems --- Models and Principles ---
Systems and Information Theory (H.1.1): {\bf Value of
information}; Information Systems --- Models and
Principles --- User/Machine Systems (H.1.2);
Information Systems --- Information Storage and
Retrieval --- Systems and Software (H.3.4): {\bf
Question-answering (fact retrieval) systems**}",
}
@Article{Graham:1983:FD,
author = "Marc H. Graham",
title = "Functions in Databases",
journal = j-TODS,
volume = "8",
number = "1",
pages = "81--109",
month = mar,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "85a:68036",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-1/p81-graham/p81-graham.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-1/p81-graham/",
abstract = "We discuss the objectives of including functional
dependencies in the definition of a relational
database. We find two distinct objectives. The
appearance of a dependency in the definition of a
database indicates that the states of the database are
to encode a function. A method based on the chase of
calculating the function encoded by a particular state
is given and compared to methods utilizing derivations
of the dependency. A test for deciding whether the
states of a schema may encode a nonempty function is
presented as is a characterization of the class of
schemas which are capable of encoding nonempty
functions for all the dependencies in the definition.
This class is the class of dependency preserving
schemas as defined by Beeri et al. and is strictly
larger than the class presented by Bernstein.\par
The second objective of including a functional
dependency in the definition of a database is that the
dependency be capable of constraining the states of the
database; that is, capable of uncovering input errors
made by the users. We show that this capability is
weaker than the first objective; thus, even
dependencies whose functions are everywhere empty may
still act as constraints. Bounds on the requirements
for a dependency to act as a constraint are derived.
\par
These results are founded on the notion of a weak
instance for a database state, which replaces the
universal relation instance assumption and is both
intuitively and computationally more nearly
acceptable.",
acknowledgement = ack-nhfb,
annote = "Method based on the chase of calculating the function
is given; the dependency should constrain the states of
the database; many algorithms.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "functional dependencies; tableaux; TODS functional
dependencies, tableaux, database systems",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Normal forms}; Information
Systems --- Database Management --- Logical Design
(H.2.1): {\bf Schema and subschema}",
}
@Article{Katz:1983:RCG,
author = "R. H. Katz and E. Wong",
title = "Resolving Conflicts in Global Storage Design Through
Replication",
journal = j-TODS,
volume = "8",
number = "1",
pages = "110--135",
month = mar,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-1/p110-katz/p110-katz.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-1/p110-katz/",
abstract = "We present a conceptual framework in which a
database's intra- and interrecord set access
requirements are specified as a constrained assignment
of abstract characteristics (``evaluated,''
``indexed,'' ``clustered,'' ``well-placed'') to logical
access paths. We derive a physical schema by choosing
an available storage structure that most closely
provides the desired access characteristics. We use
explicit replication of schema objects to reduce the
access cost along certain paths, and analyze the
trade-offs between increased update overhead and
improved retrieval access. Finally, we given an
algorithm to select storage structures for a CODASYL 78
DBTG schema, given its access requirements
specification.",
acknowledgement = ack-nhfb,
annote = "Access path data model deduced from the
Entity-Relationship Model. Each function is augmented
with access characteristics, evaluated, indexed,
clustered, and well-placed.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "access path selection; database systems, TODS
functional data model; functional data model; storage
structure choice",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Information
Systems --- Database Management --- Physical Design
(H.2.2): {\bf Access methods}",
}
@Article{Lomet:1983:BIE,
author = "David B. Lomet",
title = "Bounded Index Exponential Hashing",
journal = j-TODS,
volume = "8",
number = "1",
pages = "136--165",
month = mar,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-1/p136-lomet/p136-lomet.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-1/p136-lomet/",
abstract = "Bounded index exponential hashing, a new form of
extendible hashing, is described. It has the important
advantages over most of the other extendible hashing
variants of both (i) providing random access to any
record of a file in close to one disk access and (ii)
having performance which does not vary with file size.
It is straightforward to implement and demands only a
fixed and specifiable amount of main storage to achieve
this performance. Its underlying physical disk storage
is readily managed and record overflow is handled so as
to insure that unsuccessful searches never take more
than two accesses. The method's ability to access data
in close to a single disk access makes it possible to
organize a database, in which files have a primary key
and multiple secondary keys, such that the result is a
significant performance advantage over existing
organizations.",
acknowledgement = ack-nhfb,
classification = "722",
fjournal = "ACM Transactions on Database Systems",
keywords = "data processing, TODS extendible hashing; extendible
hasing; tree index methods",
subject = "Software --- Operating Systems --- File Systems
Management (D.4.3): {\bf File organization}; Data ---
Data Storage Representations (E.2): {\bf Hash-table
representations}; Information Systems --- Information
Storage and Retrieval --- Information Storage (H.3.2):
{\bf File organization}",
}
@Article{Stonebraker:1983:PER,
author = "Michael Stonebraker and John Woodfill and Jeff
Ranstrom and Marguerite Murphy and Marc Meyer and Eric
Allman",
title = "Performance Enhancements to a Relational Database
System",
journal = j-TODS,
volume = "8",
number = "2",
pages = "167--185",
month = jun,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-2/p167-stonebraker/p167-stonebraker.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-2/p167-stonebraker/",
abstract = "In this paper we examine four performance enhancements
to a database management system: dynamic compilation,
microcoded routines, a special-purpose file system, and
a special-purpose operating system. All were examined
in the context of the INGRES database management
system. Benchmark timings that are included suggest the
attractiveness of dynamic compilation and a
special-purpose file system. Microcode and a
special-purpose operating system are analyzed and
appear to be of more limited utility in the INGRES
context.",
acknowledgement = ack-nhfb,
annote = "Estimates are given for compilation, micro-coding, a
file system which supports locality, and a specialized
operating system for INGRES.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "compiled query languages; database performance;
database systems, TODS dynamic compilation microcode
special purpose file operating system; file systems for
databases; microcode",
subject = "Information Systems --- Database Management ---
General (H.2.0); Information Systems --- Database
Management --- Systems (H.2.4): {\bf Query processing};
Information Systems --- Database Management ---
Database Machines (H.2.6)",
}
@Article{Garcia-Molina:1983:USK,
author = "H{\'e}ctor Garc{\'\i}a-Molina",
title = "Using Semantic Knowledge for Transaction Processing in
a Distributed Database",
journal = j-TODS,
volume = "8",
number = "2",
pages = "186--213",
month = jun,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/; Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-2/p186-garcia-molina/p186-garcia-molina.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-2/p186-garcia-molina/",
abstract = "This paper investigates how the semantic knowledge of
an application can be used in a distributed database to
process transactions efficiently and to avoid some of
the delays associated with failures. The main idea is
to allow nonserializable schedules which preserve
consistency and which are acceptable to the system
users. To produce such schedules, the transaction
processing mechanism receives semantic information from
the users in the form of transaction semantic types, a
division of transactions into steps, compatibility
sets, and countersteps. Using these notions, we propose
a mechanism which allows users to exploit their
semantic knowledge in an organized fashion. The
strengths and weaknesses of this approach are
discussed.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "concurrency control; consistency; database systems;
locking; schedule; semantic knowledge;
serializability",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Distributed Systems
(C.2.4): {\bf Distributed databases}; Information
Systems --- Database Management --- Systems (H.2.4);
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Transaction processing}",
}
@Article{Clifford:1983:FST,
author = "James Clifford and David S. Warren",
title = "Formal Semantics for Time in Databases",
journal = j-TODS,
volume = "8",
number = "2",
pages = "214--254",
month = jun,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Ai/ai.misc.bib; Compendex database;
Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/; Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-2/p214-clifford/p214-clifford.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-2/p214-clifford/",
abstract = "The concept of a historical database is introduced as
a tool for modeling the dynamic nature of some part of
the real world. Just as first-order logic has been
shown to be a useful formalism for expressing and
understanding the underlying semantics of the
relational database model, intensional logic is
presented as an analogous formalism for expressing and
understanding the temporal semantics involved in a
historical database. The various components of the
relational model, as extended to include historical
relations, are discussed in terms of the model theory
for the logic IL//s, a variation of the logic IL
formulated by Richard Montague. The modal concepts of
intensional and extensional data constraints and
queries are introduced and contrasted. Finally, the
potential application of these ideas to the problem of
natural language database querying is discussed.",
acknowledgement = ack-nhfb,
annote = "all timeslices are represented. No inference needed.
Storage could be huge. Uses term historical db versus
temporal db. Intensional Montague logic. Two
timestamps: `state' and `exist'",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "database systems; entity-relationship model;
historical databases; intensional logic; relational
database; temporal semantics",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}",
}
@Article{Bitton:1983:DRE,
author = "Dina Bitton and David J. DeWitt",
title = "Duplicate Record Elimination in Large Data Files",
journal = j-TODS,
volume = "8",
number = "2",
pages = "255--265",
month = jun,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-2/p255-bitton/p255-bitton.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-2/p255-bitton/",
abstract = "The issue of duplicate elimination for large data
files in which many occurrences of the same record may
appear is addressed. A comprehensive cost analysis of
the duplicate elimination operation is presented. This
analysis is based on a combinatorial model developed
for estimating the size of intermediate runs produced
by a modified merge-sort procedure. The performance of
this modified merge-sort procedure is demonstrated to
be significantly superior to the standard duplicate
elimination technique of sorting followed by a
sequential pass to locate duplicate records. The
results can also be used to provide critical input to a
query optimizer in a relational database system.",
acknowledgement = ack-nhfb,
annote = "use a modified sort-merge.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "database systems, early aggregation TODS; duplicate
elimination; projection operator; sorting",
subject = "Information Systems --- Database Management ---
Physical Design (H.2.2): {\bf Access methods};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Query processing}",
}
@Article{Sagiv:1983:CGC,
author = "Yehoshua Sagiv",
title = "A Characterization of Globally Consistent Databases
and Their Correct Access Paths",
journal = j-TODS,
volume = "8",
number = "2",
pages = "266--286",
month = jun,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Ai/prolog.1.bib; Compendex database;
Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-2/p266-sagiv/p266-sagiv.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-2/p266-sagiv/",
abstract = "The representative instance is proposed as a
representation of the data stored in a database whose
relations are not the projections of a universal
instance. Database schemes are characterized for which
local consistency implies global consistency. (Local
consistency means that each relation satisfies its own
functional dependencies; global consistency means that
the representative instance satisfies all the
functional dependencies). A method of efficiently
computing projections of the representative instance is
given, provided that local consistency implies global
consistency. Throughout, it is assumed that a cover of
the functional dependencies is embodied in the database
scheme in the form of keys.",
acknowledgement = ack-nhfb,
annote = "Inter-relational consistency based on FD's",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "chase; database systems, TODS chase, universal
relation scheme, extension join, relational algebra;
extension join; functional dependency; null value;
prolog; relational algebra; relational database;
representative instance; universal relation scheme",
subject = "Theory of Computation --- Mathematical Logic and
Formal Languages --- Mathematical Logic (F.4.1);
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Normal forms}; Information Systems
--- Database Management --- Logical Design (H.2.1):
{\bf Schema and subschema}; Information Systems ---
Information Storage and Retrieval --- Information
Search and Retrieval (H.3.3): {\bf Query formulation}",
}
@Article{Ullman:1983:CTJ,
author = "Jeffrey D. Ullman",
title = "Corrigendum: The Theory of Joins in Relational
Databases",
journal = j-TODS,
volume = "8",
number = "2",
pages = "287--287",
month = jun,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibsource = "Database/Graefe.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "See \cite{Aho:1979:TJR}.",
fjournal = "ACM Transactions on Database Systems",
}
@Article{Cardenas:1983:PRA,
author = "Alfonso F. Cardenas and Farid Alavian and Algirdas
Avizienis",
title = "Performance of Recovery Architectures in Parallel
Associative Database Processors",
journal = j-TODS,
volume = "8",
number = "3",
pages = "291--323",
month = sep,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-3/p291-cardenas/p291-cardenas.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-3/p291-cardenas/",
abstract = "The need for robust recovery facilities in modern
database management systems is quite well known.
Various authors have addressed recovery facilities and
specific techniques, but none have delved into the
problem of recovery in database machines. In this
paper, the types of undesirable events that occur in a
database environment are classified and the necessary
recovery information, with subsequent actions to
recover the correct state of the database, is
summarized. A model of the ``processor-per-track''
class of parallel associative database processor is
presented. Three different types of recovery mechanisms
that may be considered for parallel associative
database processors are identified. For each
architecture, both the workload imposed by the recovery
mechanisms on the execution of database operations
(i.e., retrieve, modify, delete, and insert) and the
workload involved in the recovery actions (i.e.,
rollback, restart, restore, and reconstruct) are
analyzed. The performance of the three architectures is
quantitatively compared. This comparison is made in
terms of the number of extra revolutions of the
database area required to process a transaction versus
the number of records affected by a transaction. A
variety of different design parameters of the database
processor, of the database, and of a mix of transaction
types (modify, insert, and delete) are considered. A
large number of combinations is selected and the
effects of the parameters on the extra processing time
are identified.",
acknowledgement = ack-nhfb,
annote = "three methods of recovery in logic-per-track
processors are analyzed.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "associative database processors; database systems,
hardware support machine TODS",
subject = "Computer Systems Organization --- Performance of
Systems (C.4): {\bf Performance attributes};
Information Systems --- Database Management ---
Database Machines (H.2.6); Information Systems ---
Database Management --- Database Administration
(H.2.7): {\bf Logging and recovery}",
}
@Article{Bitton:1983:PAE,
author = "Dina Bitton and Haran Boral and David J. DeWitt and W.
Kevin Wilkinson",
title = "Parallel Algorithms for the Execution of Relational
Database Operations",
journal = j-TODS,
volume = "8",
number = "3",
pages = "324--353",
month = sep,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-3/p324-bitton/p324-bitton.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-3/p324-bitton/",
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 for sorting, projection, and join
operations. While some of these algorithms have been
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.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "aggregate operations; database machines; database
systems; join operation; parallel processing;
projection operator; sorting",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}; Information
Systems --- Database Management --- Database Machines
(H.2.6)",
}
@Article{Eager:1983:ARD,
author = "Derek L. Eager and Kenneth C. Sevcik",
title = "Achieving Robustness in Distributed Database Systems",
journal = j-TODS,
volume = "8",
number = "3",
pages = "354--381",
month = sep,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib;
Distributed/fault.tolerant.bib;
http://www.acm.org/pubs/toc/; Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-3/p354-eager/p354-eager.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-3/p354-eager/",
abstract = "The problem of concurrency control in distributed
database systems in which site and communication link
failures may occur is considered. The possible range of
failures is not restricted; in particular, failures may
induce an arbitrary network partitioning. It is
desirable to attain a high ``level of robustness'' in
such a system; that is, these failures should have only
a small impact on system operation.\par
A level of robustness termed {\em maximal partial
operability\/} is identified. Under our models of
concurrency control and robustness, this robustness
level is the highest level attainable without
significantly degrading performance.\par
A basis for the implementation of maximal partial
operability is presented. To illustrate its use, it is
applied to a distributed locking concurrency control
method and to a method that utilizes timestamps. When
no failures are present, the robustness modifications
for these methods induce no significant additional
overhead.",
acknowledgement = ack-nhfb,
annote = "Three phases: 1. read and write to a private
workspace, 2. indicate intention to commit, restart, or
abort, 3. if verified complete actual transaction.
Intention to update from phase 2 is withdrawn if abort
or restart is the end result of phase 2. Two versions
are presented, either the data are transmitted in phase
3, or, if handled as phase 2 of two-phase commit
protocol, the data are held in secure storage from
phase 2 to phase 3. In case of partitioning, voting
(ref. Gifford) is used, but to prevent broad lockouts,
those transactions which cannot update all copies must
post this failure at a quorum of nodes, so that
successor transactions can test that they do not
conflict, and do not enter phase 3. Dangling precommits
may be resolved by checking other nodes in the
partition. On re-establishing the net, acyclicness is
created by possibly restarting transactions which led
to a cycle in the combined schedule.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "concurrency control; database systems; network
partitioning; robustness; serializability",
subject = "Information Systems --- Database Management ---
Physical Design (H.2.2); Information Systems ---
Database Management --- Systems (H.2.4); Information
Systems --- Database Management --- Database
Administration (H.2.7)",
}
@Article{Trueblood:1983:MMM,
author = "Robert P. Trueblood and H. Rex Hartson and Johannes J.
Martin",
title = "{MULTISAFE} --- {A} Modular Multiprocessing Approach
to Secure Database Management",
journal = j-TODS,
volume = "8",
number = "3",
pages = "382--409",
month = sep,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-3/p382-trueblood/p382-trueblood.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-3/p382-trueblood/",
abstract = "This paper describes the configuration and intermodule
communication of a MULTImodule system for supporting
Secure Authorization with Full Enforcement (MULTISAFE)
for database management. A modular architecture is
described which provides secure, controlled access to
shared data in a multiuser environment, with low
performance penalties, even for complex protection
policies. The primary mechanisms are structured and
verifiable. The entire approach is immediately
extendible to distributed protection of distributed
data. The system includes a user and applications
module (UAM), a data storage and retrieval module
(SRM), and a protection and security module (PSM). The
control of intermodule communication is based on a data
abstraction approach, initially described in terms of
function invocations. An implementation within a formal
message system is then described. The discussion of
function invocations begins with the single terminal
case and extends to the multiterminal case. Some
physical implementation aspects are also discussed, and
some examples of message sequences are given.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "abstract data types; access control; back-end
database; database systems; intermodule communication;
secure database; TODS",
subject = "Computer Systems Organization --- Processor
Architectures --- Multiple Data Stream Architectures
(Multiprocessors) (C.1.2); Software --- Operating
Systems --- Storage Management (D.4.2); Software ---
Operating Systems --- Security and Protection (D.4.6);
Information Systems --- Database Management (H.2);
Information Systems --- Database Management --- Systems
(H.2.4); Information Systems --- Database Management
--- Database Machines (H.2.6)",
}
@Article{Ito:1983:HFO,
author = "Tetsuro Ito and Makoto Kizawa",
title = "Hierarchical File Organization and its Application to
Similar-String Matching",
journal = j-TODS,
volume = "8",
number = "3",
pages = "410--433",
month = sep,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-3/p410-ito/p410-ito.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-3/p410-ito/",
abstract = "The automatic correction of misspelled inputs is
discussed from a viewpoint of similar-string matching.
First a hierarchical file organization based on a
linear ordering of records is presented for retrieving
records highly similar to any input query. Then the
spelling problem is attacked by constructing a
hierarchical file for a set of strings in a dictionary
of English words. The spelling correction steps proceed
as follows: (1) find one of the best-match strings
which are most similar to a query, (2) expand the
search area for obtaining the good-match strings, and
(3) interrupt the file search as soon as the required
string is displayed. Computational experiments verify
the performance of the proposed methods for
similar-string matching under the UNIX time-sharing
system.",
acknowledgement = ack-nhfb,
annote = "A spelling checker to provide possible correct
spellings for all possible words. Results are quite
sketchy",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "best match; data processing, algorithms;
experimentation; file organization; good match;
hierarchical clustering; linear ordering; measurement;
office automation; performance; similar-string;
similarity; spelling correction; text editor; theory;
verification",
review = "ACM CR 8408-0665",
subject = "I.2 Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Natural Language Processing \\ I.5.4 Computing
Methodologies, PATTERN RECOGNITION, Applications, Text
processing \\ E.5 Data, FILES, Organization/structure
\\ H.3.2 Information Systems, INFORMATION STORAGE AND
RETRIEVAL, Information Storage, File organization \\
H.3.3 Information Systems, INFORMATION STORAGE AND
RETRIEVAL, Information Search and Retrieval, Search
process \\ H.3.3 Information Systems, INFORMATION
STORAGE AND RETRIEVAL, Information Search and
Retrieval, Selection process \\ H.4 Information
Systems, INFORMATION SYSTEMS APPLICATIONS, Office
Automation",
}
@Article{Kolodner:1983:IRS,
author = "Janet L. Kolodner",
title = "Indexing and Retrieval Strategies for Natural Language
Fact Retrieval",
journal = j-TODS,
volume = "8",
number = "3",
pages = "434--464",
month = sep,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Ai/ai.misc.bib; Compendex database;
Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-3/p434-kolodner/p434-kolodner.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-3/p434-kolodner/",
abstract = "Researchers in artificial intelligence have recently
become interested in natural language fact retrieval;
currently, their research is at a point where it can
begin contributing to the field of Information
Retrieval. In this paper, strategies for a natural
language fact retrieval system are mapped out, and
approaches to many of the organization and retrieval
problems are presented. The CYRUS system, which keeps
track of important people and is queried in English, is
presented and used to illustrate those solutions.",
acknowledgement = ack-nhfb,
classification = "723; 901",
fjournal = "ACM Transactions on Database Systems",
keywords = "artificial intelligence; conceptual memory; database
retrieval; fact retrieval; information science; natural
language processing; question answering",
subject = "Information Systems --- Information Storage and
Retrieval --- Content Analysis and Indexing (H.3.1);
Information Systems --- Information Storage and
Retrieval --- Information Search and Retrieval (H.3.3);
Computing Methodologies --- Artificial Intelligence ---
Knowledge Representation Formalisms and Methods
(I.2.4)",
}
@Article{Bernstein:1983:MCC,
author = "Philip A. Bernstein and Nathan Goodman",
title = "Multiversion Concurrency Control --- Theory and
Algorithms",
journal = j-TODS,
volume = "8",
number = "4",
pages = "465--483",
month = dec,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "86m:68025",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/Discrete.event.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-4/p465-bernstein/p465-bernstein.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-4/p465-bernstein/",
abstract = "Concurrency control is the activity of synchronizing
operations issued by concurrently executing programs on
a shared database. The goal is to produce an execution
that has the same effect as a serial (noninterleaved)
one. In a multiversion database system, each write on a
data item produces a new copy (or {\em version\/}) of
that data item. This paper presents a theory for
analyzing the correctness of concurrency control
algorithms for multiversion database systems. We use
the theory to analyze some new algorithms and some
previously published ones.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "computer programming --- Algorithms; database systems;
transaction processing",
subject = "Information Systems --- Database Management ---
Systems (H.2.4)",
}
@Article{Lynch:1983:MAN,
author = "Nancy A. Lynch",
title = "Multilevel Atomicity --- {A} New Correctness Criterion
for Database Concurrency Control",
journal = j-TODS,
volume = "8",
number = "4",
pages = "484--502",
month = dec,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "86j:68022",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-4/p484-lynch/p484-lynch.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-4/p484-lynch/",
abstract = "{\em Multilevel atomicity}, a new correctness criteria
for database concurrency control, is defined. It
weakens the usual notion of serializability by
permitting controlled interleaving among transactions.
It appears to be especially suitable for applications
in which the set of transactions has a natural
hierarchical structure based on the hierarchical
structure of an organization. A characterization for
multilevel atomicity, in terms of the absence of cycles
in a dependency relation among transaction steps, is
given. Some remarks are made concerning
implementation.",
acknowledgement = ack-nhfb,
annote = "A weaker level of concurrency control than transaction
serializability, a generalization of Garc{\'\i}a-Molina
[1981].",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "atomicity; breakpoint; database systems; transaction",
subject = "Software --- Programming Languages --- Language
Constructs and Features (D.3.3): {\bf Concurrent
programming structures}",
}
@Article{Hecht:1983:SMF,
author = "Matthew S. Hecht and John D. Gabbe",
title = "Shadowed Management of Free Disk Pages with a Linked
List",
journal = j-TODS,
volume = "8",
number = "4",
pages = "503--514",
month = dec,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-4/p503-hecht/p503-hecht.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-4/p503-hecht/",
abstract = "We describe and prove correct a programming technique
using a linked list of pages for managing the free disk
pages of a file system where shadowing is the recovery
technique. Our technique requires a window of only two
pages of main memory for accessing and maintaining the
free list, and avoids wholesale copying of free-list
pages during a {\em checkpoint\/} or {\em recover\/}
operation.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "checkpoint; computer operating systems; computer
programming; database systems; dynamic storage
allocation; file system; recovery; shadowing; storage
management",
subject = "Software --- Operating Systems --- Storage Management
(D.4.2): {\bf Allocation/deallocation strategies};
Software --- Operating Systems --- Reliability (D.4.5):
{\bf Checkpoint/restart}",
}
@Article{Malhotra:1983:EIA,
author = "A. Malhotra and H. M. Markowitz and D. P. Pazel",
title = "{EAS-E}: An Integrated Approach to Application
Development",
journal = j-TODS,
volume = "8",
number = "4",
pages = "515--542",
month = dec,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-4/p515-malhotra/p515-malhotra.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-4/p515-malhotra/",
abstract = "{\em 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
({\em 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.\par
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
extends. Also available is a nonprocedural facility
that allows a user to browse and update the database
without writing programs.",
acknowledgement = ack-nhfb,
annote = "ER model based tool",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "computer programming languages; database systems, TODS
E/R model; entity relationship model",
subject = "Information Systems --- Database Management ---
Languages (H.2.3): {\bf Data description languages
(DDL)}; Information Systems --- Database Management ---
Languages (H.2.3): {\bf Data manipulation languages
(DML)}; Information Systems --- Database Management ---
Systems (H.2.4); Software --- Software Engineering ---
Programming Environments (D.2.6)",
}
@Article{Moran:1983:CDO,
author = "Shlomo Moran",
title = "On the Complexity of Designing Optimal Partial-Match
Retrieval Systems",
journal = j-TODS,
volume = "8",
number = "4",
pages = "543--551",
month = dec,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P20 (68P10)",
MRnumber = "86j:68024",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; Graphics/siggraph/83.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-4/p543-moran/p543-moran.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-4/p543-moran/",
abstract = "We consider the problem of designing an information
retrieval system on which partial match queries have to
be answered. Each record in the system consists of a
list of {\em attributes}, and a partial match query
specifies the values of some of the attributes. The
records are stored in {\em buckets\/} in a secondary
memory, and in order to answer a partial match query
all the buckets that may contain a record satisfying
the specifications of that query must be retrieved. The
bucket in which a given record is stored is found by a
multiple key hashing function, which maps each
attribute to a string of a fixed number of bits. The
address of that bucket is then represented by the
string obtained by concatenating the strings on which
the various attributes were mapped. A partial match
query may specify only part of the bits in the string
representing the address, and the larger the number of
bits specified, the smaller the number of buckets that
have to be retrieved in order to answer the query.
\par
The optimization problem considered in this paper is
that of deciding to how many bits each attribute should
be mapped by the bashing function above, so that the
expected number of buckets retrieved per query is
minimized. Efficient solutions for special cases of
this problem have been obtained in [1], [12], and [14].
It is shown that in general the problem is NP-hard, and
that if $P$ NP, it is also not fully approximable. Two
heuristic algorithms for the problem are also given and
compared.",
acknowledgement = ack-nhfb,
annote = "Optimal variable bit lengths of hashstrings, it is
NP-hard.",
classification = "723; 901; 922",
fjournal = "ACM Transactions on Database Systems",
keywords = "approximation algorithms; computer programming ---
algorithms; file organization; hashing; information
science; NP-hard problems; optimization, TODS hashing,
searching; partial match retrieval; searching",
oldlabel = "geom-947",
review = "ACM CR 8411-0954",
subject = "Theory of Computation --- Analysis of Algorithms and
Problem Complexity --- Nonnumerical Algorithms and
Problems (F.2.2); Information Systems --- Information
Storage and Retrieval --- Information Search and
Retrieval (H.3.3)",
}
@Article{Ramamohanarao:1983:PMR,
author = "K. Ramamohanarao and John W. Lloyd and James A. Thom",
title = "Partial-Match Retrieval using Hashing and
Descriptors",
journal = j-TODS,
volume = "8",
number = "4",
pages = "552--576",
month = dec,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P10",
MRnumber = "794 538",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; Graphics/siggraph/83.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-4/p552-ramamohanarao/p552-ramamohanarao.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-4/p552-ramamohanarao/",
abstract = "This paper studies a partial-match retrieval scheme
based on hash functions and descriptors. The emphasis
is placed on showing how the use of a descriptor file
can improve the performance of the scheme. Records in
the file are given addresses according to hash
functions for each field in the record. Furthermore,
each page of the file has associated with it a
descriptor, which is a fixed-length bit string,
determined by the records actually present in the page.
Before a page is accessed to see if it contains records
in the answer to a query, the descriptor for the page
is checked. This check may show that no relevant
records are on the page and, hence, that the page does
not have to be accessed. The method is shown to have a
very substantial performance advantage over pure
hashing schemes, when some fields in the records have
large key spaces. A mathematical model of the scheme,
plus an algorithm for optimizing performance, is
given.",
acknowledgement = ack-nhfb,
classification = "723; 901; 921",
fjournal = "ACM Transactions on Database Systems",
keywords = "computer programming --- Algorithms; DATA PROCESSING
--- File Organization; descriptors; dynamic file;
hashing; information science; MATHEMATICAL MODELS;
OPTIMIZATION; optimization; partial-match retrieval",
oldlabel = "geom-948",
subject = "Information Systems --- Database Management ---
Physical Design (H.2.2): {\bf Access methods};
Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}",
}
@Article{Ceri:1983:CQE,
author = "S. Ceri and G. Pelagatti",
title = "Correctness of Query Execution Strategies in
Distributed Databases",
journal = j-TODS,
volume = "8",
number = "4",
pages = "577--607",
month = dec,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-4/p577-ceri/p577-ceri.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-4/p577-ceri/",
abstract = "A major requirement of a Distributed DataBase
Management System (DDBMS) is to enable users to write
queries as though the database were not distributed
(distribution transparency). The DDBMS transforms the
user's queries into execution strategies, that is,
sequences of operations on the various nodes of the
network and of transmissions between them. An execution
strategy on a distributed database is correct if it
returns the same result as if the query were applied to
a nondistributed database.\par
This paper analyzes the correctness problem for query
execution strategies. A formal model, called
Multirelational Algebra, is used as a unifying
framework for this purpose. The problem of proving the
correctness of execution strategies is reduced to the
problem of proving the equivalence of two expressions
of Multirelational Algebra. A set of theorems on
equivalence is given in order to facilitate this task.
\par
The proposed approach can be used also for the
generation of correct execution strategies, because it
defines the rules which allow the transformation of a
correct strategy into an equivalent one. This paper
does not deal with the problem of evaluating equivalent
strategies, and therefore is not in itself a proposal
for a query optimizer for distributed databases.
However, it constitutes a theoretical foundation for
the design of such optimizers.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "correctness of database access; database systems;
distributed database access; read-only transactions;
relational algebra",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Distributed Systems
(C.2.4): {\bf Distributed databases}; Information
Systems --- Database Management --- Languages (H.2.3):
{\bf Query languages}; Information Systems --- Database
Management --- Systems (H.2.4); Information Systems ---
Database Management --- Systems (H.2.4): {\bf Query
processing}",
}
@Article{Biskup:1983:FCR,
author = "Joachim Biskup",
title = "A Foundation of {Codd}'s Relational Maybe Operators",
journal = j-TODS,
volume = "8",
number = "4",
pages = "608--636",
month = dec,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15 (03B70)",
MRnumber = "86j:68019",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Ai/nonmono.bib; Compendex database;
Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-4/p608-biskup/p608-biskup.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-4/p608-biskup/",
abstract = "Database relations which possibly contain maybe-tuples
and null values of type ``value at present unknown''
are studied. Maybe-tuples and null values are formally
interpreted by our notion of {\em representation},
which uses classical notions of predicate logic,
elaborates Codd's proposal of maybe-tuples, and adopts
Reiter's concept of a closed world. Precise notions of
{\em information content\/} and {\em redundancy},
associated with our notion of representation, are
investigated. {\em Extensions of the relational
algebra\/} to relations with maybe-tuples and null
values are proposed. Our extensions are essentially
Codd's, with some modifications. It is proved that
these extensions have natural properties which are
formally stated as being {\em adequate\/} and {\em
restricted}.\par
By the treatment of difference and division, our formal
framework can be used even for operations that require
``negative information.'' Finally, extensions of {\em
update operations\/} are discussed.",
acknowledgement = ack-nhfb,
annote = "Join, Project, Select, Union, Difference is defined
for nulls which are not labeled, results include Maybe.
Division does not work. Update is discussed.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "closed world assumption; database systems; information
content; maybe-tuple; negative information; null value;
open word assumption; redundancy; relational algebra;
relational database; representation",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Information
Systems --- Database Management --- Systems (H.2.4):
{\bf Query processing}; Computing Methodologies ---
Artificial Intelligence --- Knowledge Representation
Formalisms and Methods (I.2.4): {\bf Predicate logic}",
}
@Article{Ullman:1983:KCA,
author = "Jeffrey D. Ullman",
title = "On {Kent}'s {``Consequences of assuming a universal
relation''} ({Technical} correspondence)",
journal = j-TODS,
volume = "8",
number = "4",
pages = "637--643",
month = dec,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/database.bib; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "See \cite{Kent:1981:CAU}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-4/p637-ullman/p637-ullman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-4/p637-ullman/",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "TODS technical correspondence",
subject = "Information Systems --- Database Management ---
General (H.2.0)",
}
@Article{Kent:1983:URR,
author = "William Kent",
title = "The universal relation revisited (technical
correspondence)",
journal = j-TODS,
volume = "8",
number = "4",
pages = "644--648",
month = dec,
year = "1983",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/database.bib; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-4/p644-kent/p644-kent.pdf;
http://www.acm.org/pubs/citations/journals/tods/1983-8-4/p644-kent/",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "TODS technical correspondence",
subject = "Information Systems --- Database Management ---
General (H.2.0)",
}
@Article{Kaplan:1984:DPN,
author = "S. Jerrold Kaplan",
title = "Designing a Portable Natural Language Database Query
System",
journal = j-TODS,
volume = "9",
number = "1",
pages = "1--19",
month = mar,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Ai/ai.misc.bib; Compendex database;
Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-1/p1-kaplan/p1-kaplan.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-1/p1-kaplan/",
abstract = "One barrier to the acceptance of natural language
database query systems is the substantial installation
effort required for each new database. Much of this
effort involves the encoding of semantic knowledge for
the domain of discourse, necessary to correctly
interpret and respond to natural language questions.
For such systems to be practical, techniques must be
developed to increase their portability to new domains.
\par
This paper discusses several issues involving the
portability of natural language interfaces to database
systems, and presents the approach taken in {\em
CO-OP\/} -- a natural language database query system
that provides cooperative responses to English
questions and operates with a typical CODA-SYL database
system. {\em CO-OP\/} derives its domain-specific
knowledge from a {\em lexicon\/} (the list of words
known to the system) and the information already
present in the structure and content of the underlying
database. Experience with the implementation suggests
that strategies that are not directly derivative of
cognitive or linguistic models may nonetheless play an
important role in the development of practical natural
language systems.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "database systems",
}
@Article{Reiss:1984:PDS,
author = "Steven P. Reiss",
title = "Practical Data-Swapping: The First Steps",
journal = j-TODS,
volume = "9",
number = "1",
pages = "20--37",
month = mar,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-1/p20-reiss/p20-reiss.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-1/p20-reiss/",
abstract = "The problem of statistical database confidentiality in
releasing microdata is addressed through the use of
approximate data-swapping. Here, a portion of the
microdata is replaced with a database that has been
selected with approximately the same statistics. The
result guarantees the confidentiality of the original
data, while providing microdata with accurate
statistics. Methods for achieving such transformations
are considered and analyzed through simulation.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Security",
keywords = "database systems, TODS statistical databases",
subject = "Data --- Coding and Information Theory (E.4): {\bf
Nonsecret encoding schemes**}; Information Systems ---
Models and Principles --- Systems and Information
Theory (H.1.1): {\bf Value of information}; Information
Systems --- Information Storage and Retrieval ---
Online Information Services (H.3.5): {\bf Data
sharing}",
}
@Article{Nievergelt:1984:GFA,
author = "J. Nievergelt and Hans Hinterberger and Kenneth C.
Sevcik",
title = "The Grid File: An Adaptable, Symmetric Multikey File
Structure",
journal = j-TODS,
volume = "9",
number = "1",
pages = "38--71",
month = mar,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-1/p38-nievergelt/p38-nievergelt.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-1/p38-nievergelt/",
abstract = "Traditional file structures that provide multikey
access to records, for example, inverted files, are
extensions of file structures originally designed for
single-key access. They manifest various deficiencies
in particular for multikey access to highly dynamic
files. We study the dynamic aspects of file structures
that treat all keys symmetrically, that is, file
structures which avoid the distinction between primary
and secondary keys. We start from a bitmap approach and
treat the problem of file design as one of data
compression of a large sparse matrix. This leads to the
notions of a {\em grid partition\/} of the search space
and of a {\em grid directory}, which are the keys to a
dynamic file structure called the {\em grid file}. This
file system adapts gracefully to its contents under
insertions and deletions, and thus achieves an upper
bound of two disk accesses for single record retrieval;
it also handles range queries and partially specified
queries efficiently. We discuss in detail the design
decisions that led to the grid file, present simulation
results of its behavior, and compare it to other
multikey access file structures.",
acknowledgement = ack-nhfb,
annote = "Grid files use a vector of hash-keys, partition the
result into clusters, and store the clusters into
blocks. Two accesses are used for retrieval. Update may
be more costly. Access structures fit in core?",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data processing, TODS multidimensional hashing,
multidimensional hashing",
review = "ACM CR 8411-0931",
}
@Article{Buchanan:1984:DMS,
author = "Jack R. Buchanan and Richard D. Fennell and Hanan
Samet",
title = "A Database Management System for the {Federal
Courts}",
journal = j-TODS,
volume = "9",
number = "1",
pages = "72--88",
month = mar,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-1/p72-buchanan/p72-buchanan.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-1/p72-buchanan/",
abstract = "A judicial systems laboratory has been established and
several large-scale information management systems
projects have been undertaken within the Federal
Judicial Center in Washington, D.C. The newness of the
court application area, together with the experimental
nature of the initial prototypes, required that the
system building tools be as flexible and efficient as
possible for effective software design and development.
The size of the databases, the expected transaction
volumes, and the long-term value of the court records
required a data manipulation system capable of
providing high performance and integrity. The resulting
design criteria, the programming capabilities
developed, and their use in system construction are
described herein. This database programming facility
has been especially designed as a technical management
tool for the database administrator, while providing
the applications programmer with a flexible database
software interface for high productivity.
\par
Specifically, a network-type database management system
using SAIL as the data manipulation host language is
described. Generic data manipulation verb formats using
SAIL's macro facilities and dynamic data structuring
facilities allowing in-core database representations
have been developed to achieve a level of flexibility
not usually attained in conventional database
systems.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "database systems, TODS SAIL, network model",
}
@Article{Papadimitriou:1984:CCM,
author = "Christos H. Papadimitriou and Paris C. Kanellakis",
title = "On Concurrency Control by Multiple Versions",
journal = j-TODS,
volume = "9",
number = "1",
pages = "89--99",
month = mar,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-1/p89-papadimitriou/p89-papadimitriou.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-1/p89-papadimitriou/",
abstract = "We examine the problem of concurrency control when the
database management system supports multiple versions
of the data. We characterize the limit of the
parallelism achievable by the multiversion approach and
demonstrate the resulting space-parallelism
trade-off.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "database systems",
}
@Article{Shultz:1984:RTA,
author = "Roger K. Shultz and Roy J. Zingg",
title = "Response Time Analysis of Multiprocessor Computers for
Database Support",
journal = j-TODS,
volume = "9",
number = "1",
pages = "100--132",
month = mar,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-1/p100-shultz/p100-shultz.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-1/p100-shultz/",
abstract = "Comparison of three multiprocessor computer
architectures for database support is made possible
through evaluation of response time expressions. These
expressions are derived by parameterizing algorithms
performed by each machine to execute a relational
algebra query. Parameters represent properties of the
database and components of the machines. Studies of
particular parameter values exhibit response times for
conventional machine technology, for low selectivity,
high duplicate occurrence, and parallel disk access,
increasing the number of processors, and improving
communication and processing technology.",
acknowledgement = ack-nhfb,
annote = "analyzes DIRECT, HYPERTREE, and REPT, their own
proposal.",
classification = "722; 723",
fjournal = "ACM Transactions on Database Systems",
keywords = "COMPUTER SYSTEMS, DIGITAL --- multiprocessing, TODS
relational model, relational queries, direct,
hypertree, rept; database systems",
}
@Article{Valduriez:1984:JSA,
author = "Patrick Valduriez and Georges Gardarin",
title = "Join and Semijoin Algorithms for a Multiprocessor
Database Machine",
journal = j-TODS,
volume = "9",
number = "1",
pages = "133--161",
month = mar,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-1/p133-valduriez/p133-valduriez.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-1/p133-valduriez/",
abstract = "This paper presents and analyzes algorithms for
computing joins and semijoins of relations in a
multiprocessor database machine. First, a model of the
multiprocessor architecture is described, incorporating
parameters defining I/O, CPU, and message transmission
times that permit calculation of the execution times of
these algorithms. Then, three join algorithms are
presented and compared. It is shown that, for a given
configuration, each algorithm has an application domain
defined by the characteristics of the operand and
result relations. Since a semijoin operator is useful
for decreasing I/O and transmission times in a
multiprocessor system, we present and compare two
equi-semijoin algorithms and one non-equi-semijoin
algorithm. The execution times of these algorithms are
generally linearly proportional to the size of the
operand and result relations, and inversely
proportional to the number of processors. We then
compare a method which consists of joining two
relations to a method whereby one joins their
semijoins. Finally, it is shown that the latter method,
using semijoins, is generally better. The various
algorithms presented are implemented in the SABRE
database system; an evaluation model selects the best
algorithm for performing a join according to the
results presented here. A first version of the SABRE
system is currently operational at INRIA.",
acknowledgement = ack-nhfb,
classification = "722; 723",
fjournal = "ACM Transactions on Database Systems",
keywords = "COMPUTER SYSTEMS, DIGITAL --- Multiprocessing;
database systems",
}
@Article{Christodoulakis:1984:ICA,
author = "S. Christodoulakis",
title = "Implications of Certain Assumptions in Database
Performance Evaluation",
journal = j-TODS,
volume = "9",
number = "2",
pages = "163--186",
month = jun,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "86k:68011",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-2/p163-christodoulakis/p163-christodoulakis.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-2/p163-christodoulakis/",
abstract = "The assumptions of uniformity and independence of
attribute values in a file, uniformity of queries,
constant number of records per block, and random
placement of qualifying records among the blocks of a
file are frequently used in database performance
evaluation studies. In this paper we show that these
assumptions often result in predicting only an upper
bound of the expected system cost. We then discuss the
implications of nonrandom placement, nonuniformity, and
dependencies of attribute values on database design and
database performance evaluation.",
acknowledgement = ack-nhfb,
annote = "After a somewhat cursory reading of the paper --- A
few comments: A. Uniform distributions, particularly
for parallel machines, may imply uniform distribution
of work over the machines --- thus giving an upper
bound for speedup --- thus a uniform distribution is an
optimistic assumption. B. For uniprocessor systems --
the assumption of a uniform dist. is optimistic when:
1. hashing --- fewer collisions, shorter lists at
collisions should be expected from a uniform
distribution. 2. trees --- more balancing costs may be
incurred for non-uniform distributions. 3. searching
--- for example, a binary search on a non-uniform could
cost significantly more. 4. sorting --- I suspect that
uniform distributions are optimal for some sorting
methods, although I haven't looked at this in any
detail.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "database systems, selectivity cost estimation approx
TODS",
}
@Article{Effelsberg:1984:LIP,
author = "Wolfgang Effelsberg and Mary E. S. Loomis",
title = "Logical, Internal, and Physical Reference Behavior in
{CODASYL} Database Systems",
journal = j-TODS,
volume = "9",
number = "2",
pages = "187--213",
month = jun,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-2/p187-effelsberg/p187-effelsberg.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-2/p187-effelsberg/",
abstract = "This work investigates one aspect of the performance
of CODASYL database systems: the data reference
behavior. We introduce a model of database traversals
at three levels: the logical, internal, and physical
levels. The mapping between the logical and internal
levels is defined by the internal schema, whereas the
mapping between the internal and the physical levels
depends on cluster properties of the database. Our
model explains the physical reference behavior for a
given sequence of DML statements at the logical level.
\par
Software has been implemented to monitor references in
two selected CODASYL DBMS applications. In a series of
experiments the physical reference behavior was
observed for varying internal schemas and cluster
properties of the database. The measurements were
limited to retrieval transactions, so that a variety of
queries could be analyzed for the same well-known state
of the database. Also, all databases were relatively
small in order to allow fast reloading with varying
internal schema parameters. In all cases, the database
transactions showed less locality of reference than do
programs under virtual memory operating systems; some
databases showed no locality at all. No evidence of
physical sequentiality was found. This suggests that
standard page replacement strategies are not optimal
for CODASYL database buffer management; instead,
replacement decisions in a database buffer should be
based on specific knowledge available from higher
system layers.",
acknowledgement = ack-nhfb,
acmcrnumber = "8506 0534",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Measurement; Performance",
keywords = "database systems, TODS buffer management",
subject = "Information Systems --- Database Management ---
Systems (H.2.4); Computer Systems Organization ---
Performance of Systems (C.4): {\bf Measurement
techniques}; Software --- Operating Systems --- Storage
Management (D.4.2): {\bf Storage hierarchies}; Software
--- Operating Systems --- Performance (D.4.8): {\bf
Measurements}; Software --- Operating Systems ---
Performance (D.4.8): {\bf Modeling and prediction};
Information Systems --- Database Management ---
Physical Design (H.2.2); Information Systems ---
Database Management --- Logical Design (H.2.1)",
}
@Article{Kim:1984:PPR,
author = "Won Kim and Daniel Gajski and David J. Kuck",
title = "A Parallel Pipelined Relational Query Processor",
journal = j-TODS,
volume = "9",
number = "2",
pages = "214--242",
month = jun,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-2/p214-kim/p214-kim.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-2/p214-kim/",
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.",
acknowledgement = ack-nhfb,
classification = "722; 723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design",
keywords = "computer architecture; database systems; pipeline
processing; relational query processor, hardware
support database machine TODS",
subject = "Computer Systems Organization --- Processor
Architectures --- Other Architecture Styles (C.1.3):
{\bf High-level language architectures**}; Information
Systems --- Database Management --- Database Machines
(H.2.6)",
}
@Article{Al-Suwaiyel:1984:ATC,
author = "M. Al-Suwaiyel and E. Horowitz",
title = "Algorithms for Trie Compaction",
journal = j-TODS,
volume = "9",
number = "2",
pages = "243--263",
month = jun,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P05",
MRnumber = "794 541",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1984-9-2/p243-ai-suwaiyel/",
abstract = "The trie data structure has many properties which make
it especially attractive for representing large files
of data. These properties include fast retrieval time,
quick unsuccessful search determination, and finding
the longest match to a given identifier. The main
drawback is the space requirement. In this paper the
concept of trie compaction is formalized. An exact
algorithm for optimal trie compaction and three
algorithms for approximate trie compaction are given,
and an analysis of the three algorithms is done. The
analyses indicate that for actual tries, reductions of
around 70 percent in the space required by the
uncompacted trie can be expected. The quality of the
compaction is shown to be insensitive to the number of
nodes, while a more relevant parameter is the alphabet
size of the key.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms",
keywords = "data processing",
subject = "Data --- Data Structures (E.1); Data --- Data Storage
Representations (E.2); Data --- Coding and Information
Theory (E.4): {\bf Data compaction and compression};
Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2); Theory of
Computation --- Analysis of Algorithms and Problem
Complexity --- Nonnumerical Algorithms and Problems
(F.2.2)",
}
@Article{Mendelzon:1984:DST,
author = "Alberto O. Mendelzon",
title = "Database States and Their Tableaux",
journal = j-TODS,
volume = "9",
number = "2",
pages = "264--282",
month = jun,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "794 542",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-2/p264-mendelzon/p264-mendelzon.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-2/p264-mendelzon/",
abstract = "Recent work considers a database state to satisfy a
set of dependencies if there exists a satisfying
universal relation whose projections contain each of
the relations in the state. Such relations are called
{\em weak instances\/} for the state. We propose the
set of all weak instances for a state as an embodiment
of the information represented by the state. We
characterize states that have the same set of weak
instances by the equivalence of their associated
tableaux. We apply this notion to the comparison of
database schemes and characterize all pairs of schemes
such that for every legal state of one of them there
exists an equivalent legal state of the other one. We
use this approach to provide a new characterization of
Boyce-Codd Normal Form relation schemes.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "TODS weak instance assumption, database systems",
}
@Article{Maier:1984:FUR,
author = "David Maier and Jeffrey D. Ullman and Moshe Y. Vardi",
title = "On the Foundations of the Universal Relation Model",
journal = j-TODS,
volume = "9",
number = "2",
pages = "283--308",
month = jun,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "86m:68031",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-2/p283-maier/p283-maier.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-2/p283-maier/",
abstract = "Two fundamentally different approaches to the
universal relation model have been taken. According to
the first approach, the user's view of the database is
a universal relation or many universal relations, about
which the user poses queries. The second approach sees
the model as having query-processing capabilities that
relieve the user of the need to specify the logical
access path. Thus, while the first approach gives a
denotational semantics to query answering, the second
approach gives it an operational semantics. The authors
investigate the relationship between these two
approaches.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Languages; Theory; Verification",
keywords = "database systems",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Information
Systems --- Database Management --- Languages (H.2.3):
{\bf Query languages}; Computing Methodologies ---
Artificial Intelligence --- Deduction and Theorem
Proving (I.2.3); Information Systems --- Database
Management --- Logical Design (H.2.1): {\bf Normal
forms}; Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}",
}
@Article{Katsuno:1984:ECF,
author = "Hirofumi Katsuno",
title = "An Extension of Conflict-free Multi-valued Dependency
Sets",
journal = j-TODS,
volume = "9",
number = "2",
pages = "309--326",
month = jun,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "86m:68029",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-2/p309-katsuno/p309-katsuno.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-2/p309-katsuno/",
abstract = "Several researchers (Beeri, Bernstein, Chiu, Fagin,
Goodman, Maier, Mendelzon, Ullman, and Yannakakis) have
introduced a special class of database schemes, called
{\em acyclic\/} or {\em tree\/} schemes. Beeri et al.
have shown that an acyclic join dependency, naturally
defined by an acyclic database scheme, has several
desirable properties, and that an acyclic join
dependency is equivalent to a conflict-free set of
multivalued dependencies. However, since their results
are confined to multivalued and join dependencies, it
is not clear whether we can handle functional
dependencies independently of other dependencies.
\par
In the present paper we define an extension of a
conflict-free set, called an {\em extended
conflict-free set}, including multivalued dependencies
and functional dependencies, and show the following two
properties of an extended conflict-free set:\par
There are three equivalent definitions of an extended
conflict-free set. One of them is defined as a set
including an acyclic joint dependency and a set of
functional dependencies such that the left and right
sides of each functional dependency are included in one
of the attribute sets that construct the acyclic join
dependency.\par
For a relation scheme with an extended conflict-free
set, there is a decomposition into third normal form
with a lossless join and preservation of
dependencies.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Theory; Verification",
keywords = "database systems",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Schema and subschema};
Information Systems --- Database Management --- Logical
Design (H.2.1): {\bf Normal forms}",
}
@Article{Korth:1984:SUD,
author = "Henry F. Korth and Gabriel M. Kuper and Joan
Feigenbaum and Allen {Van Gelder} and Jeffrey D.
Ullman",
title = "{System/U}: {A} Database System Based on the Universal
Relation Assumption",
journal = j-TODS,
volume = "9",
number = "3",
pages = "331--347",
month = sep,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-3/p331-korth/p331-korth.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-3/p331-korth/",
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.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Theory",
keywords = "computer programming languages; database systems;
RELATIONAL DATABASE; SYSTEM/U; UNIVERSAL RELATION",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Information
Systems --- Database Management --- Languages (H.2.3):
{\bf Data description languages (DDL)}; Information
Systems --- Database Management --- Languages (H.2.3):
{\bf Data manipulation languages (DML)}; Information
Systems --- Database Management --- Physical Design
(H.2.2): {\bf Access methods}; Information Systems ---
Database Management --- Systems (H.2.4): {\bf Query
processing}; Mathematics of Computing --- Discrete
Mathematics --- Graph Theory (G.2.2): {\bf Path and
circuit problems}",
}
@Article{Wald:1984:RQI,
author = "Joseph A. Wald and Paul G. Sorenson",
title = "Resolving the Query Inference Problem Using {Steiner}
Trees",
journal = j-TODS,
volume = "9",
number = "3",
pages = "348--368",
month = sep,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; Graphics/siggraph/86.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-3/p348-wald/p348-wald.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-3/p348-wald/",
abstract = "The query inference problem is to translate a sentence
of a query language into an unambiguous representation
of a query. A query is represented as an expression
over a set of query trees. A metric is introduced for
measuring the complexity of a query and also a proposal
that a sentence be translated into the least complex
query which `satisfies' the sentence. This method of
query inference can be used to resolve ambiguous
sentences and leads to easier formulation of
sentences.",
acknowledgement = ack-nhfb,
annote = "MDCST resolves queries over attributes using a schema
tree.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Measurement; Performance",
keywords = "database systems; query inference problem; Steiner
trees, TODS E/R model",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}; Information
Systems --- Database Management --- Systems (H.2.4):
{\bf Transaction processing}; Information Systems ---
Information Storage and Retrieval --- Information
Search and Retrieval (H.3.3): {\bf Query formulation};
Mathematics of Computing --- Discrete Mathematics ---
Graph Theory (G.2.2): {\bf Graph algorithms};
Mathematics of Computing --- Discrete Mathematics ---
Graph Theory (G.2.2): {\bf Trees}; Information Systems
--- Database Management --- Languages (H.2.3): {\bf
Query languages}",
}
@Article{Ramamohanarao:1984:RLH,
author = "K. Ramamohanarao and R. Sacks-Davis",
title = "Recursive Linear Hashing",
journal = j-TODS,
volume = "9",
number = "3",
pages = "369--391",
month = sep,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P10",
MRnumber = "794 545",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-3/p369-ramamohanarao/p369-ramamohanarao.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-3/p369-ramamohanarao/",
abstract = "A modification of linear hashing is proposed for which
the conventional use of overflow records is avoided.
Furthermore, an implementation of linear hashing is
presented for which the amount of physical storage
claimed is only fractionally more than the minimum
required. This implementation uses a fixed amount of
in-core space. Simulation results are given which
indicate that even for storage utilizations approaching
95 percent, the average successful search cost for this
method is close to one disk access.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Measurement; Performance",
keywords = "COMPUTER SIMULATION; data processing; DYNAMIC FILES;
LINEAR HASHING",
subject = "Data --- Data Storage Representations (E.2): {\bf
Hash-table representations}; Software --- Operating
Systems --- File Systems Management (D.4.3): {\bf File
organization}; Information Systems --- Information
Storage and Retrieval --- Information Storage (H.3.2):
{\bf File organization}; Computing Methodologies ---
Simulation and Modeling --- Applications (I.6.3);
Software --- Operating Systems --- Storage Management
(D.4.2): {\bf Secondary storage}",
}
@Article{Cooper:1984:ATU,
author = "Robert B. Cooper and Martin K. Solomon",
title = "The Average Time Until Bucket Overflow",
journal = j-TODS,
volume = "9",
number = "3",
pages = "392--408",
month = sep,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-3/p392-cooper/p392-cooper.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-3/p392-cooper/",
abstract = "It is common for file structures to be divided into
equal-length partitions, called buckets, into which
records arrive for insertion and from which records are
physically deleted. We give a simple algorithm which
permits calculation of the average time until overflow
for a bucket of capacity $n$ records, assuming that
record insertions and deletions can be modeled as a
stochastic process in the usual manner of queueing
theory. We present some numerical examples, from which
we make some general observations about the
relationships among insertion and deletion rates,
bucket capacity, initial fill, and average time until
overflow. In particular, we observe that it makes sense
to define the {\em stable point\/} as the product of
the arrival rate and the average residence time of the
records; then a bucket tends to fill up to its stable
point quickly, in an amount of time almost independent
of the stable point, but the average time until
overflow increases rapidly with the difference between
the bucket capacity and the stable point.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "BUCKET OVERFLOW; data processing",
}
@Article{March:1984:SER,
author = "Salvatore T. March and Gary D. Scudder",
title = "On the Selection of Efficient Record Segmentations and
Backup Strategies for Large Shared Databases",
journal = j-TODS,
volume = "9",
number = "3",
pages = "409--438",
month = sep,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-3/p409-march/p409-march.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-3/p409-march/",
abstract = "In recent years the information processing
requirements of business organizations have expanded
tremendously. With this expansion, the design of
databases to efficiently manage and protect business
information has become critical. We analyze the impacts
of {\em record segmentation\/} (the assignment of data
items to segments defining subfiles), an
efficiency-oriented design technique, and of {\em
backup and recovery strategies}, a data protection
technique, on the overall process of database design. A
combined record segmentation/backup and recovery
procedure is presented and an application of the
procedure is discussed. Results in which problem
characteristics are varied along three dimensions:
update frequencies, available types of access paths,
and the predominant type of data retrieval that must be
supported by the database, are presented.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design",
keywords = "backup strategies; database systems; large shared
databases; record segmentations",
subject = "Data --- Files (E.5): {\bf Organization/structure};
Information Systems --- Information Storage and
Retrieval --- Information Storage (H.3.2): {\bf File
organization}; Software --- Operating Systems ---
Reliability (D.4.5): {\bf Backup procedures}; Software
--- Operating Systems --- File Systems Management
(D.4.3): {\bf File organization}; Data --- Files (E.5):
{\bf Backup/recovery}; Information Systems --- Database
Management --- Database Administration (H.2.7): {\bf
Logging and recovery}",
}
@Article{Manber:1984:CCD,
author = "Udi Manber and Richard E. Ladner",
title = "Concurrency Control in a Dynamic Search Structure",
journal = j-TODS,
volume = "9",
number = "3",
pages = "439--455",
month = sep,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68N25 (68P15)",
MRnumber = "794 546",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: ACM Proc. on Database Systems,
Boston, Apr. 1982, pp. 268--282.",
URL = "http://www.acm.org/pubs/citations/journals/tods/1984-9-3/p439-manbar/",
abstract = "A design of a data structure and efficient algorithms
for concurrent manipulations of a dynamic search
structure by independent user processes is presented in
this paper. The algorithms include updating data,
inserting new elements, and deleting elements. The
algorithms support a high level of concurrency. Each of
the operations listed above requires only constant
amount of locking. In order to make the system even
more efficient for the user processes, maintenance
processes are introduced. The maintenance processes
operate independently in the background to reorganize
the data structure and ``clean up'' after the (more
urgent) user processes. A proof of correctness of the
algorithms is given and some experimental results and
extensions are examined.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "computer programming --- Algorithms; concurrency
control; data processing; dynamic search structure",
}
@Article{Davidson:1984:OCP,
author = "Susan B. Davidson",
title = "Optimism and Consistency in Partitioned Distributed
Database Systems",
journal = j-TODS,
volume = "9",
number = "3",
pages = "456--481",
month = sep,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "794 547",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-3/p456-davidson/p456-davidson.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-3/p456-davidson/",
abstract = "A protocol for transaction processing during partition
failures is presented which guarantees mutual
consistency between copies of data-items after repair
is completed. The protocol is ``optimistic'' in that
transactions are processed without restrictions during
failure; conflicts are then detected at repair time
using a {\em precedence graph}, and are resolved by
backing out transactions according to some {\em backout
strategy}. The resulting database state then
corresponds to a serial execution of some subset of
transactions run during the failure. Results from
simulation and probabilistic modeling show that the
optimistic protocol is a reasonable alternative in many
cases. Conditions under which the protocol performs
well are noted, and suggestions are made as to how
performance can be improved. In particular, a backout
strategy is presented which takes into account
individual transaction costs and attempts to minimize
total backout cost. Although the problem of choosing
transactions to minimize total backout cost is, in
general, NP-complete, the backout strategy is efficient
and produces very good results.",
acknowledgement = ack-nhfb,
annote = "Counter example to uniform is last hypothesis of
Christodoulakis.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance; Reliability",
keywords = "database systems; DISTRIBUTED database systems",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Distributed databases};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Transaction processing}; Information
Systems --- Database Management --- Physical Design
(H.2.2): {\bf Recovery and restart}; Mathematics of
Computing --- Discrete Mathematics --- Graph Theory
(G.2.2)",
}
@Article{Ibaraki:1984:ONO,
author = "Toshihide Ibaraki and Tiko Kameda",
title = "On the Optimal Nesting Order for Computing
${N}$-Relational Joins",
journal = j-TODS,
volume = "9",
number = "3",
pages = "482--502",
month = sep,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "794 548",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-3/p482-ibaraki/p482-ibaraki.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-3/p482-ibaraki/",
abstract = "Using the nested loops method, this paper addresses
the problem of minimizing the number of page fetches
necessary to evaluate a given query to a relational
database. We first propose a data structure whereby the
number of page fetches required for query evaluation is
substantially reduced and then derive a formula for the
expected number of page fetches. An optimal solution to
our problem is the nesting order of relations in the
evaluation program, which minimizes the number of page
fetches. Since the minimization of the formula is
NP-hard, as shown in the Appendix, we propose a
heuristic algorithm which produces a good suboptimal
solution in polynomial time. For the special case where
the input query is a ``tree query,'' we present an
efficient algorithm for finding an optimal nesting
order.",
acknowledgement = ack-nhfb,
acmcrnumber = "8506 0535",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance; Theory",
keywords = "N-relational joins; optimal nesting order; TODS query
optimization processing relational model, database
systems",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Transaction processing}; Theory
of Computation --- Analysis of Algorithms and Problem
Complexity --- Nonnumerical Algorithms and Problems
(F.2.2); Information Systems --- Database Management
--- Logical Design (H.2.1): {\bf Data models};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Query processing}",
}
@Article{Elhardt:1984:DCH,
author = "Klaus Elhardt and Rudolf Bayer",
title = "A Database Cache for High Performance and Fast Restart
in Database Systems",
journal = j-TODS,
volume = "9",
number = "4",
pages = "503--525",
month = dec,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-4/p503-elhardt/p503-elhardt.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-4/p503-elhardt/",
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 throughput of
\par
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 guaranteed in such an
environment. Very long retrieval and update
transactions are also supported.",
acknowledgement = ack-nhfb,
affiliation = "Technische Univ, Muenchen, Inst fuer Informatik,
Munich, West Ger",
affiliationaddress = "Technische Univ, Muenchen, Inst fuer Informatik,
Munich, West Ger",
annote = "The Elhardt-Bayer cache does indeed resemble Alpine in
many important respects. The primary difference is that
it requires all of a transaction's updates to be
written to the log in contiguous log pages, which
allows some compact encodings to be used in
representing the log, but also means that more work
must be done synchronously at commit time. Also, their
scheme is not designed to support two-phase commit, and
extending it to handle two-phase commit is sure to mess
up the pretty log encoding, I think. ---Mark Brown.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Measurement; Performance",
keywords = "buffer management; crash recovery; data processing;
database cache; database systems; fast restart; media
failure",
subject = "Information Systems --- Database Management ---
Physical Design (H.2.2): {\bf Recovery and restart};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Transaction processing}; Software ---
Operating Systems --- Storage Management (D.4.2): {\bf
Main memory}",
}
@Article{Reuter:1984:PAR,
author = "Andreas Reuter",
title = "Performance Analysis of Recovery Techniques",
journal = j-TODS,
volume = "9",
number = "4",
pages = "526--559",
month = dec,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-4/p526-reuter/p526-reuter.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-4/p526-reuter/",
abstract = "Various logging and recovery techniques for
centralized transaction-oriented database systems under
performance aspects are described and discussed. The
classification of functional principles that has been
developed in a companion paper is used as a
terminological basis. In the main sections, a set of
analytic models is introduced and evaluated in order to
compare the performance characteristics of nine
different recovery techniques with respect to four key
parameters and a set of other parameters with less
influence. Finally, the results of model evaluation as
well as the limitations of the models themselves are
discussed.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Kaiserslautern, Kaiserslautern, West Ger",
affiliationaddress = "Univ of Kaiserslautern, Kaiserslautern, West
Ger",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance; Reliability",
keywords = "computer programming --- algorithms; data processing;
database systems; logging and recovery; recovery and
restart; recovery techniques; Reliability; transaction
processing",
subject = "Information Systems --- Database Management ---
Physical Design (H.2.2): {\bf Recovery and restart};
Software --- Operating Systems --- Reliability (D.4.5):
{\bf Fault-tolerance}; Software --- Operating Systems
--- Performance (D.4.8): {\bf Modeling and prediction};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Transaction processing}; Information
Systems --- Database Management --- Database
Administration (H.2.7): {\bf Logging and recovery}",
}
@Article{Effelsberg:1984:PDB,
author = "Wolfgang Effelsberg and Theo Haerder",
title = "Principles of Database Buffer Management",
journal = j-TODS,
volume = "9",
number = "4",
pages = "560--595",
month = dec,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-4/p560-effelsberg/p560-effelsberg.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-4/p560-effelsberg/",
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 principal
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.\par
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.",
acknowledgement = ack-nhfb,
affiliation = "IBM, Scientific Cent, Heidelberg, West Ger",
affiliationaddress = "IBM, Scientific Cent, Heidelberg, West Ger",
annote = "an interface between the buffer manager and the DBMS,
choices of page replacement policies; does not cover
sequential I/O (read-ahead and write-behind).",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design",
keywords = "buffer management; computer programming ---
algorithms; data processing; database systems; memory
paging; referencing database pages; replacement
algorithms",
subject = "Information Systems --- Database Management ---
Physical Design (H.2.2); Software --- Operating Systems
--- Storage Management (D.4.2): {\bf Storage
hierarchies}",
}
@Article{Bernstein:1984:ACC,
author = "Philip A. Bernstein and Nathan Goodman",
title = "An Algorithm for Concurrency Control and Recovery in
Replicated Distributed Databases",
journal = j-TODS,
volume = "9",
number = "4",
pages = "596--615",
month = dec,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "86k:68010",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib;
Distributed/fault.tolerant.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-4/p596-bernstein/p596-bernstein.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-4/p596-bernstein/",
abstract = "In a one-copy distributed database, each data item is
stored at exactly one site. In a replicated database,
some data items may be stored at multiple sites. The
main motivation is improved reliability: by storing
important data at multiple sites, the DBS can operate
even though some sites have failed.\par
This paper describes an algorithm for handling
replicated data, which allows users to operate on data
so long as one copy is ``available.'' A copy is
``available'' when (i) its site is up, and (ii) the
copy is not out-of-date because of an earlier crash.
\par
The algorithm handles clean, detectable site failures,
but not Byzantine failures or network partitions.",
acknowledgement = ack-nhfb,
affiliation = "Sequoia Systems Inc, Marlborough, MA, USA",
affiliationaddress = "Sequoia Systems Inc, Marlborough, MA, USA",
annote = "3-phase commit. The first and third phases are
identical to the two phases of 2-phase commit. There is
a `Precommit' phase after the first phase where the
knowledge of the coordinator is replicated elsewhere,
thus protecting against a crash of the coordinator
(which could result in locks being tied up for long
periods).",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Reliability",
keywords = "Algorithms; computer programming; concurrency control
and recovery; continuous operation; database systems;
replicated distributed databases; serializability;
transaction processing",
subject = "Information Systems --- Database Management ---
Physical Design (H.2.2): {\bf Recovery and restart};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Distributed databases}; Information
Systems --- Database Management --- Systems (H.2.4):
{\bf Transaction processing}",
}
@Article{Chen:1984:ANV,
author = "Wen Chin Chen and Jeffrey Scott Vitter",
title = "Analysis of New Variants of Coalesced Hashing",
journal = j-TODS,
volume = "9",
number = "4",
pages = "616--645",
month = dec,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P10",
MRnumber = "794 550",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-4/p616-chen/p616-chen.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-4/p616-chen/",
abstract = "The coalesced hashing method has been shown to be very
fast for dynamic information storage and retrieval.
This paper analyzes in a uniform way the performance of
coalesced hashing and its variants, thus settling some
open questions in the literature.\par
In all the variants, the range of the hash function is
called the {\em address region}, and extra space
reserved for storing colliders is called the {\em
cellar}. We refer to the unmodified method, which was
analyzed previously, as {\em late-insertion\/}
coalesced hashing. In this paper we analyze late
insertion and two new variations called {\em early
insertion\/} and {\em varied insertion}. When there is
no cellar, the early-insertion method is better than
late insertion; however, past experience has indicated
that it might be worse when there is a cellar. Our
analysis confirms that it is worse. The
varied-insertion method was introduced as a means of
combining the advantages of late insertion and early
insertion. This paper shows that varied insertion
requires fewer probes per search, on the average, than
do the other variants.\par
Each of these three coalesced hashing methods has a
parameter that relates the sizes of the address region
and the cellar. Techniques in this paper are designed
for tuning the parameter in order to achieve optimum
search times. We conclude with a list of open
problems.",
acknowledgement = ack-nhfb,
affiliation = "Brown Univ, Dep of Computer Science, Providence, RI,
USA",
affiliationaddress = "Brown Univ, Dep of Computer Science, Providence,
RI, USA",
annote = "Chaining and open addressing. Internal memory is
assumed!",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance; Theory",
keywords = "address region; cellar; coalesced hashing; computer
programming --- algorithms; data processing; early
insertion; information retrieval systems; late
insertion",
subject = "Data --- Data Storage Representations (E.2): {\bf
Hash-table representations}; Software --- Software
Engineering --- Metrics (D.2.8): {\bf Performance
measures}; Theory of Computation --- Analysis of
Algorithms and Problem Complexity --- Nonnumerical
Algorithms and Problems (F.2.2): {\bf Sorting and
searching}; Mathematics of Computing --- Discrete
Mathematics --- Combinatorics (G.2.1): {\bf Generating
functions}; Mathematics of Computing --- Discrete
Mathematics --- Combinatorics (G.2.1): {\bf
Permutations and combinations}; Mathematics of
Computing --- Discrete Mathematics --- Combinatorics
(G.2.1): {\bf Recurrences and difference equations};
Mathematics of Computing --- Probability and Statistics
(G.3): {\bf Random number generation}; Information
Systems --- Information Storage and Retrieval ---
Information Search and Retrieval (H.3.3): {\bf Search
process}",
}
@Article{Deogun:1984:OCF,
author = "J. S. Deogun and V. V. Raghavan and T. K. W. Tsou",
title = "Organization of Clustered Files for Consecutive
Retrieval",
journal = j-TODS,
volume = "9",
number = "4",
pages = "646--671",
month = dec,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-4/p646-deogun/p646-deogun.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-4/p646-deogun/",
abstract = "This paper studies the problem of storing single-level
and multilevel clustered files. Necessary and
sufficient conditions for a single-level clustered file
to have the consecutive retrieval property (CRP) are
developed. A linear time algorithm to test the CRP for
a given clustered file and to identify the proper
arrangement of objects, if CRP exists, is presented.
For the single-level clustered files that do not have
CRP, it is shown that the problem of identifying a
storage organization with minimum redundancy is
NP-complete.\par
Consequently, an efficient heuristic algorithm to
generate a good storage organization for such files is
developed. Furthermore, it is shown that, for certain
types of multilevel clustered files, there exists a
storage organization such that the objects in each
cluster, for all clusters in each level of the
clustering, appear in consecutive locations.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Nebraska, Lincoln, NE, USA",
affiliationaddress = "Univ of Nebraska, Lincoln, NE, USA",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance; Theory",
keywords = "CLUSTERED FILES; computer programming --- Algorithms;
CONSECUTIVE RETRIEVAL; data processing --- File
Organization; FILE ORGANIZATION; information retrieval
systems; NP-COMPLETE",
subject = "Information Systems --- Information Storage and
Retrieval --- Information Search and Retrieval (H.3.3):
{\bf Clustering}; Information Systems --- Information
Storage and Retrieval --- Information Storage (H.3.2):
{\bf File organization}",
}
@Article{Traub:1984:SSS,
author = "J. F. Traub and Y. Yemini and H. Wozniakowski",
title = "The Statistical Security of a Statistical Database",
journal = j-TODS,
volume = "9",
number = "4",
pages = "672--679",
month = dec,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sun Dec 8 08:54:10 MST 1996",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "This study proposes a statistical perturbation scheme
to protect a statistical database against compromise.
The proposed scheme can handle the security of
numerical as well as nonnumerical sensitive fields or a
combination of fields. Furthermore, knowledge of some
records in a database does not help to compromise
unknown records. The authors use Chebyshev's inequality
to analyze the trade-offs among the magnitude of the
perturbations, the error incurred by statistical
queries, and the size of the query set to which they
apply. They show that if the statistician is given
absolute error guarantees, then a compromise is
possible, but the cost is made exponential in the size
of the database.",
acknowledgement = ack-nhfb,
affiliation = "Columbia Univ, Dep of Computer Science, New York, NY,
USA",
affiliationaddress = "Columbia Univ, Dep of Computer Science, New
York, NY, USA",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "Chebyshev's inequality; complexity of compromise; data
processing --- Security of data; database systems;
security; statistical database",
}
@Article{Navathe:1984:VPA,
author = "Shamkant Navathe and Stefano Ceri and Gio Wiederhold
and Jinglie Dou",
title = "Vertical Partitioning Algorithms for Database Design",
journal = j-TODS,
volume = "9",
number = "4",
pages = "680--710",
month = dec,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: Stanford Un., TR-CS-82-957, Jan.
1983, revised Aug. 1983.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1984-9-4/p680-navathe/p680-navathe.pdf;
http://www.acm.org/pubs/citations/journals/tods/1984-9-4/p680-navathe/",
abstract = "This paper addresses the vertical partitioning of a
set of logical records or a relation into fragments.
The rationale behind vertical partitioning is to
produce fragments, groups of attribute columns, that
``closely match'' the requirements of transactions.
\par
Vertical partitioning is applied in three contexts: a
database stored on devices of a single type, a database
stored in different memory levels, and a distributed
database. In a two-level memory hierarchy, most
transactions should be processed using the fragments in
primary memory. In distributed databases, fragment
allocation should maximize the amount of local
transaction processing.\par
Fragments may be nonoverlapping or overlapping. A
two-phase approach for the determination of fragments
is proposed; in the first phase, the design is driven
by empirical objective functions which do not require
specific cost information. The second phase performs
cost optimization by incorporating the knowledge of a
specific application environment. The algorithms
presented in this paper have been implemented, and
examples of their actual use are shown.",
acknowledgement = ack-nhfb,
affiliation = "Stanford Univ, Dep of Computer Science, Stanford, CA,
USA",
affiliationaddress = "Stanford Univ, Dep of Computer Science,
Stanford, CA, USA",
annote = "based on affinity considerations.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "Algorithms; CLUSTERS; computer programming; data
processing; database systems --- Design; FRAGMENT
ALLOCATION; MEMORY LEVELS; VERTICAL PARTITIONING
ALGORITHMS",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1); Information Systems ---
Database Management --- Physical Design (H.2.2);
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Transaction processing}",
}
@Article{Maier:1984:DFG,
author = "D. Maier",
title = "Databases in the Fifth Generation Project: Is {Prolog}
a Database Language?",
journal = j-TODS,
volume = "9",
number = "2",
pages = "??--??",
month = jun,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Dec 10 12:48:52 1996",
bibsource = "Database/Wiederhold.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: ACM SIGMOD, 1984.",
annote = "very readable discussion, includes links to universal
relation research.",
fjournal = "ACM Transactions on Database Systems",
xxnote = "This paper does not seem to be published in TODS.",
}
@Article{Skeen:1984:IAP,
author = "D. Skeen and D. D. Wright",
title = "Increasing Availability in Partitioned Database
Systems",
journal = j-TODS,
volume = "??",
number = "??",
pages = "290--299",
month = Apr,
year = "1984",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Dec 10 12:48:54 1996",
bibsource = "Distributed/Dist.Sys.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
fjournal = "ACM Transactions on Database Systems",
xxnote = "This paper does not seem to be published in TODS.",
}
@Article{Franaszek:1985:LCT,
author = "Peter Franaszek and John T. Robinson",
title = "Limitations of Concurrency in Transaction Processing",
journal = j-TODS,
volume = "10",
number = "1",
pages = "1--28",
month = mar,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/real.time.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-1/p1-franaszek/p1-franaszek.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-1/p1-franaszek/;
http://www.acm.org/pubs/toc/Abstracts/tods/3160.html",
abstract = "Given the pairwise probability of conflict p among
transactions in a transaction processing system,
together with the total number of concurrent
transactions n, the effective level of concurrency
E(n,p) is defined as the expected number of the n
transactions that can run concurrently and actually do
useful work. Using a random graph model of concurrency,
we show for three general classes of concurrency
control methods, examples of which are (1) standard
locking, (2) strict priority scheduling, and (3)
optimistic methods, that (1) E(n, p) n(1 - p/2) n-1,
(2) E(n, p) (1 - (1 - p) n)/p, and (3) 1 + ((1 -
p)/p)ln(p(n - 1) + 1) E(n, p) 1 + (1/p)ln(p(n - 1) +
1). Thus, for fixed p, as n ??, (1) E 0 for standard
locking methods, (2) E 1/p for strict priority
scheduling methods, and (3) E for optimistic methods.
Also found are bounds on E in the case where conflicts
are analyzed so as to maximize E.\par
The predictions of the random graph model are confirmed
by simulations of an abstract transaction processing
system. In practice, though, there is a price to pay
for the increased effective level of concurrency of
methods (2) and (3): using these methods there is more
wasted work (i.e., more steps executed by transactions
that are later aborted). In response to this problem,
three new concurrency control methods suggested by the
random graph model analysis are developed. Two of
these, called (a) running priority and (b) older or
running priority, are shown by the simulation results
to perform better than the previously known methods
(l)-(3) for relatively large n or large p, in terms of
achieving a high effective level of concurrency at a
comparatively small cost in wasted work.",
acknowledgement = ack-nhfb,
affiliation = "IBM, Thomas J. Watson Research Cent, Yorktown Heights,
NY, USA",
affiliationaddress = "IBM, Thomas J. Watson Research Cent, Yorktown
Heights, NY, USA",
annote = "6 methods, incl. optimistic (best) but not
version-ing.",
classification = "722; 723; 921",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance; Theory; Verification",
keywords = "computer systems, digital --- multiprocessing;
concurrency control; database systems; mathematical
techniques --- graph theory; performance; theory;
transaction processing, algorithms; verification",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Distributed systems. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf
D.1.3}: Software, PROGRAMMING TECHNIQUES, Concurrent
Programming. {\bf D.4.1}: Software, OPERATING SYSTEMS,
Process Management, Concurrency.",
}
@Article{Sacca:1985:DPC,
author = "Domenico Sacca and Gio Wiederhold",
title = "Database Partitioning in a Cluster of Processors",
journal = j-TODS,
volume = "10",
number = "1",
pages = "29--56",
month = mar,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Parallel/Multi.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in
\cite[242--247]{Schkolnick:1983:ICV}, and IBM Research
Report No. RJ-4076, 1983.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-1/p29-sacca/p29-sacca.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-1/p29-sacca/;
http://www.acm.org/pubs/toc/Abstracts/tods/3161.html",
abstract = "In a distributed database system the partitioning and
allocation of the database over the processor nodes of
the network can be a critical aspect of the database
design effort. In this paper we develop and evaluate
algorithms that perform this task in a computationally
feasible manner. The network we consider is
characterized by a relatively high communication
bandwidth, considering the processing and input output
capacities in its processors. Such a balance is typical
if the processors are connected via busses or local
networks. The common constraint that transactions have
a specific root node no longer exists, so that there
are more distribution choices. However, a poor
distribution leads to less efficient computation,
higher costs, and higher loads in the nodes or in the
communication network so that the system may not be
able to handle the required set of transactions.
\par
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, called
GFF, is stated in a procedural form.\par
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 of the allocation
procedure varies by orders of magnitude with the
alternatives of benefit evaluation. A mixed benefit
evaluation strategy is eventually proposed.\par
A model for evaluation is presented. Two of the
strategies are experimentally evaluated, and the
reported results support the discussion. The approach
should be suitable for other cases where resources have
to be allocated subject to resource constraints.",
acknowledgement = ack-nhfb,
affiliation = "IBM, Research Lab, San Jose, CA, USA",
affiliationaddress = "IBM, Research Lab, San Jose, CA, USA",
classification = "722; 723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Theory",
keywords = "computer systems, digital --- multiprocessing;
database partitioning, parallelism declustering
partitioning disk striping TODS, algorithms; database
systems; design; theory",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Distributed systems. {\bf C.2.4}: Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems.",
}
@Article{Pramanik:1985:UGT,
author = "Sakti Pramanik and David Ittner",
title = "Use of Graph-Theoretic Models for Optimal Relational
Database Accesses to Perform Join",
journal = j-TODS,
volume = "10",
number = "1",
pages = "57--74",
month = mar,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "794 551",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-1/p57-pramanik/p57-pramanik.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-1/p57-pramanik/;
http://www.acm.org/pubs/toc/Abstracts/tods/3325.html",
abstract = "A graph model is presented to analyze the performance
of a relational join. The amount of page reaccesses,
the page access sequence, and the amount of buffer
needed are represented in terms of graph parameters. By
using the graph model formed from the index on the join
attributes, we determine the relationships between
these parameters. Two types of buffer allocation
strategies are studied, and the upper bound on the
buffer size with no page reaccess is given. This bound
is shown to be the maximum cut value of a graph. Hence,
the problem of computing this upper bound is NP-hard.
We also give algorithms to determine a page access
sequence requiring a near optimal buffer size with no
page reaccess. The optimal page access sequence for a
fixed buffer size has also been considered.",
acknowledgement = ack-nhfb,
affiliation = "Michigan State Univ, Computer Science Dep, East
Lansing, MI, USA",
affiliationaddress = "Michigan State Univ, Computer Science Dep, East
Lansing, MI, USA",
annote = "buffer management for indexes.",
classification = "723; 921",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Experimentation; Measurement; Performance;
Theory",
keywords = "computer programming --- algorithms; database systems;
experimentation; graph-theoretic models, query
optimization processing TODS, algorithms; mathematical
techniques --- graph theory; measurement; performance;
relational database accesses; relational join; theory",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf G.2.2}: Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Graph
algorithms.",
}
@Article{Larson:1985:LHO,
author = "Per-{\AA}ke Larson",
title = "Linear Hashing with Overflow-Handling by Linear
Probing",
journal = j-TODS,
volume = "10",
number = "1",
pages = "75--89",
month = mar,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-1/p75-larson/p75-larson.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-1/p75-larson/;
http://www.acm.org/pubs/toc/Abstracts/tods/3324.html",
abstract = "Linear hashing is a file structure for dynamic files.
In this paper, a new, simple method for handling
overflow records in connection with linear hashing is
proposed. The method is based on linear probing and
does not rely on chaining. No dedicated overflow area
is required. The expansion sequence of linear hashing
is modified to improve the performance, which requires
changes in the address computation. A new address
computation algorithm and an expansion algorithm are
given. The performance of the method is studied by
simulation. The algorithms for the basic file
operations are very simple, and the overall performance
is competitive with that of other variants of linear
hashing.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Waterloo, Dep of Computer Science, Waterloo,
Ont, Can",
affiliationaddress = "Univ of Waterloo, Dep of Computer Science,
Waterloo, Ont, Can",
annote = "New algorithm for files that grow and shrink
dynamically; the overflow records of a full page are
directed to the next page of a group; the introduction
of five groups and the backwards split order makes this
algorithm better than previous ones.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Measurement; Performance",
keywords = "computer programming --- algorithms; data processing;
database systems; design; dynamic hashing; file
organization; linear hashing; measurement; open
addressing, algorithms; performance",
review = "ACM CR 8512-1134",
subject = "{\bf E.2}: Data, DATA STORAGE REPRESENTATIONS,
Hash-table representations. {\bf D.2.2}: Software,
SOFTWARE ENGINEERING, Tools and Techniques, Decision
tables. {\bf E.5}: Data, FILES,
Organization/structure.",
}
@Article{Veklerov:1985:ADH,
author = "Eugene Veklerov",
title = "Analysis of Dynamic Hashing with Deferred Splitting",
journal = j-TODS,
volume = "10",
number = "1",
pages = "90--96",
month = mar,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-1/p90-veklerov/p90-veklerov.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-1/p90-veklerov/",
abstract = "Dynamic hashing with deferred splitting is a file
organization scheme which increases storage
utilization, as compared to `standard' dynamic hashing.
In this scheme, splitting of a bucket is deferred if
the bucket is full but its brother can accommodate new
records. The performance of the scheme is analyzed. In
a typical case the expected storage utilization
increases from 69 to 76 percent.",
acknowledgement = ack-nhfb,
affiliation = "Lawrence Berkeley Lab, Real Time Systems Group,
Berkeley, CA, USA",
affiliationaddress = "Lawrence Berkeley Lab, Real Time Systems Group,
Berkeley, CA, USA",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data processing; database systems; DEFERRED SPLITTING;
DYNAMIC HASHING; File Organization; STORAGE
UTILIZATION",
}
@Article{Palvia:1985:EBS,
author = "Prashant Palvia",
title = "Expressions for Batched Searching of Sequential and
Hierarchical Files",
journal = j-TODS,
volume = "10",
number = "1",
pages = "97--106",
month = mar,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-1/p97-palvia/p97-palvia.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-1/p97-palvia/;
http://www.acm.org/pubs/toc/Abstracts/tods/3326.html",
abstract = "Batching yields significant savings in access costs in
sequential, tree-structured, and random files. A direct
and simple expression is developed for computing the
average number of records\slash pages accessed to
satisfy a batched query of a sequential file. The
advantages of batching for sequential and random files
are discussed. A direct equation is provided for the
number of nodes accessed in unbatched queries of
hierarchical files. An exact recursive expression is
developed for node accesses in batched queries of
hierarchical files. In addition to the recursive
relationship, good, closed-form upper- and lower-bound
approximations are provided for the case of batched
queries of hierarchical files.",
acknowledgement = ack-nhfb,
affiliation = "Temple Univ, Dep of Computer \& Information Sciences,
Philadelphia, PA, USA",
affiliationaddress = "Temple Univ, Dep of Computer \& Information
Sciences, Philadelphia, PA, USA",
classification = "723; 901",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Performance; Theory",
keywords = "batched searching; database systems; design;
hierarchical files; information science --- information
retrieval; sequential files, performance; theory",
subject = "{\bf E.5}: Data, FILES, Organization/structure. {\bf
H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Access methods. {\bf H.3.3}:
Information Systems, INFORMATION STORAGE AND RETRIEVAL,
Information Search and Retrieval, Search process.",
}
@Article{Bever:1985:DHS,
author = "Martin Bever and Peter C. Lockemann",
title = "Database Hosting in Strongly-Typed Programming
Languages",
journal = j-TODS,
volume = "10",
number = "1",
pages = "107--126",
month = mar,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-1/p107-bever/p107-bever.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-1/p107-bever/;
http://www.acm.org/pubs/toc/Abstracts/tods/3327.html",
abstract = "Database system support has become an essential part
of many computer applications, 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.\par
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.\par
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.",
acknowledgement = ack-nhfb,
acmcrnumber = "8707-597",
affiliation = "Univ Karlsruhe, Inst fuer Informatik, Karlsruhe, West
Ger",
affiliationaddress = "Univ Karlsruhe, Inst fuer Informatik, Karlsruhe,
West Ger",
annote = "ADABAS is the experimental target system and the
language is LIS.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages",
keywords = "computer programming languages; database hosting,
design; database systems; languages; parameterized data
types; schema mapping; strongly-typed programming
languages",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Data manipulation languages (DML). {\bf
D.3.3}: Software, PROGRAMMING LANGUAGES, Language
Constructs and Features, Abstract data types. {\bf
D.3.3}: Software, PROGRAMMING LANGUAGES, Language
Constructs and Features, Data types and structures.
{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Schema
and subschema. {\bf H.2.3}: Information Systems,
DATABASE MANAGEMENT, Languages, Data description
languages (DDL).",
}
@Article{Chen:1985:AAS,
author = "Wen Chin Chen and Jeffrey Scott Vitter",
title = "Addendum to: {``Analysis of Some New Variants of
Coalesced Hashing''} [{ACM} Trans. Database Systems
{\bf 9} (1984), no. 4, 616--645]",
journal = j-TODS,
volume = "10",
number = "1",
pages = "127--127",
month = mar,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P10",
MRnumber = "794 552",
bibsource = "Database/Graefe.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Vitter:1985:EIO,
author = "Jeffrey Scott Vitter",
title = "An Efficient {I/O} Interface for Optical Disks",
journal = j-TODS,
volume = "10",
number = "2",
pages = "129--162",
month = jun,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-2/p129-vitter/p129-vitter.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-2/p129-vitter/;
http://www.acm.org/pubs/toc/Abstracts/tods/3862.html",
abstract = "We introduce the notion of an I/O interface for
optical digital (write-once) disks, which is quite
different from earlier research. The purpose of an I/O
interface is to allow existing operating systems and
application programs that use magnetic disks to use
optical disks instead, with minimal change. We define
what it means for an I/O interface to be
disk-efficient. We demonstrate a practical disk-
efficient I/O interface and show that its I/O
performance in many cases is optimum, up to a constant
factor, among all disk-efficient interfaces. The
interface is most effective for applications that are
not update-intensive. An additional capability is a
built-in history mechanism that provides software
support for accessing previous versions of records.
Even if not implemented, the I/O interface can be used
as a programming tool to develop efficient special
purpose applications for use with optical disks.",
acknowledgement = ack-nhfb,
affiliation = "Brown Univ, Dep of Computer Science, Providence, RI,
USA",
affiliationaddress = "Brown Univ, Dep of Computer Science, Providence,
RI, USA",
annote = "An I/O interface supports basic update operations such
as insert write and delete on the block is proposed.
Index techniques for erasable media (Btree is assumed
in this paper) can be implemented on this interface.
Versions of a block is stored as an allocation tree on
an optical disk, which is an efficient implementation
of the pointer fill-in method. Contents of a version of
a block is represented by an offset tree. Theoretical
lower bound of these operations is evaluated. This
paper assumes that appending into existing block is
possible on optical disk.",
classification = "722; 741",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Theory",
keywords = "computer interfaces; data storage, optical; design;
I/O interface; optical disks, algorithms; performance;
theory",
subject = "{\bf D.4.2}: Software, OPERATING SYSTEMS, Storage
Management, Secondary storage. {\bf D.4.2}: Software,
OPERATING SYSTEMS, Storage Management,
Allocation/deallocation strategies. {\bf D.4.3}:
Software, OPERATING SYSTEMS, File Systems Management,
Access methods. {\bf D.4.3}: Software, OPERATING
SYSTEMS, File Systems Management, File organization.
{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf E.2}:
Data, DATA STORAGE REPRESENTATIONS, Hash-table
representations. {\bf E.2}: Data, DATA STORAGE
REPRESENTATIONS, Linked representations. {\bf F.2.2}:
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sorting and searching. {\bf G.2.1}:
Mathematics of Computing, DISCRETE MATHEMATICS,
Combinatorics, Combinatorial algorithms. {\bf H.2.2}:
Information Systems, DATABASE MANAGEMENT, Physical
Design, Access methods.",
}
@Article{Schkolnick:1985:ECU,
author = "M. Schkolnick and P. Tiberio",
title = "Estimating the Cost of Updates in a Relational
Database",
journal = j-TODS,
volume = "10",
number = "2",
pages = "163--179",
month = jun,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-2/p163-schkolnick/p163-schkolnick.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-2/p163-schkolnick/;
http://www.acm.org/pubs/toc/Abstracts/tods/3863.html",
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 problem
and in access path selection in query optimization for
relational DBMSs.",
acknowledgement = ack-nhfb,
affiliation = "IBM Research Lab, San Jose, CA, USA",
affiliationaddress = "IBM Research Lab, San Jose, CA, USA",
annote = "tradeoff by a given index query cost against update
cost.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Measurement; Performance",
keywords = "costs; database systems; measurement; performance;
query optimization; relational databases; update costs,
design",
subject = "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Access methods. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Query processing.",
}
@Article{Yu:1985:ARC,
author = "C. T. Yu and Cheing-Mei Suen and K. Lam and M. K.
Siu",
title = "Adaptive Record Clustering",
journal = j-TODS,
volume = "10",
number = "2",
pages = "180--204",
month = jun,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-2/p180-yu/p180-yu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-2/p180-yu/;
http://www.acm.org/pubs/toc/Abstracts/tods/3861.html",
abstract = "An algorithm for record clustering is presented. It is
capable of detecting sudden changes in users' access
patterns and then suggesting an appropriate assignment
of records to blocks. It is conceptually simple, highly
intuitive, does not need to classify queries into
types, and avoids collecting individual query
statistics. Experimental results indicate that it
converges rapidly; its performance is about 50 percent
better than that of the total sort method, and about
100 percent better than that of randomly assigning
records to blocks.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois at Chicago Circle, Dep of Electrical
Engineering \& Computer Science, Chicago, IL, USA",
affiliationaddress = "Univ of Illinois at Chicago Circle, Dep of
Electrical Engineering \& Computer Science, Chicago,
IL, USA",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Experimentation; Measurement; Performance;
Theory; Verification",
keywords = "adaptive record clustering; algorithms; computer
programming --- algorithms; database systems;
experimentation; file organization; measurement;
performance; physical database design; probabilistic
retrieval, CTYU TODS; theory; verification, data
processing",
subject = "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design. {\bf E.5}: Data, FILES,
Organization/structure. {\bf H.2.m}: Information
Systems, DATABASE MANAGEMENT, Miscellaneous. {\bf
H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Access methods.",
}
@Article{Katoh:1985:CTS,
author = "Naoki Katoh and Toshihide Ibaraki and Tiko Kameda",
title = "Cautious Transaction Schedulers with Admission
Control",
journal = j-TODS,
volume = "10",
number = "2",
pages = "205--229",
month = jun,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-2/p205-katoh/p205-katoh.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-2/p205-katoh/;
http://www.acm.org/pubs/toc/Abstracts/tods/3860.html",
abstract = "We propose a new class of schedulers, called {\em
cautious schedulers}, that grant an input request if it
will not necessitate any rollback in the future. In
particular, we investigate cautious WRW-schedulers that
output schedules in class WRW only. Class WRW consists
of all schedules that are serializable, while
preserving the write-read and read-write conflict, and
is the largest polynomially {\em recognizable\/}
subclass of serializable schedules currently known. It
is shown, in this paper however, that cautious WRW-
{\em scheduling\/} is, in general, NP-complete.
Therefore, we introduce a special type ({\em type
1R\/}) of transaction, which consists of no more than
one read step (an indivisible set of read operations)
followed by multiple write steps. It is shown that
cautious WRW-scheduling can be performed efficiently if
all transactions are of type 1R and if {\em admission
control\/} can be exercised. Admission control rejects
a transaction unless its first request is immediately
grantable.",
acknowledgement = ack-nhfb,
affiliation = "Kobe Univ of Commerce, Dep of Management Science,
Kobe, Japan",
affiliationaddress = "Kobe Univ of Commerce, Dep of Management
Science, Kobe, Japan",
annote = "serializability control for predefined transaction
sequences.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms",
keywords = "concurrency control; database systems; scheduling;
serializability; transaction scheduler, algorithms",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing.",
}
@Article{Albano:1985:GST,
author = "Antonio Albano and Luca Cardelli and Renzo Orsini",
title = "{Galileo}: {A} Strongly-Typed, Interactive Conceptual
Language",
journal = j-TODS,
volume = "10",
number = "2",
pages = "230--260",
month = jun,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/; Misc/Functional.bib;
Object/Nierstrasz.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in \cite{Zdonik:1990:ROO}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-2/p230-albano/p230-albano.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-2/p230-albano/;
http://www.acm.org/pubs/toc/Abstracts/tods/3859.html",
abstract = "Galileo, a programming language for database
applications, is presented. Galileo is a
strongly-typed, interactive programming language
designed specifically to support semantic data model
features (classification, aggregation, and
specialization), as well as the abstraction mechanisms
of modern programming languages (types, abstract types,
and modularization). The main contributions of Galileo
are (a) a flexible type system to model database
structure and semantic integrity constraints; (b) the
inclusion of type hierarchies to support the
specialization abstraction mechanisms of semantic data
models; (c) a modularization mechanism to structure
data and operations into interrelated units (d) the
integration of abstraction mechanisms into an
expression-based language that allows interactive use
of the database without resorting to a new stand-alone
query language.\par
Galileo will be used in the immediate future as a tool
for database design and, in the long term, as a
high-level interface for DBMSs.",
acknowledgement = ack-nhfb,
affiliation = "Univ di Pisa, Dipartmento di Informatica, Pisa,
Italy",
affiliationaddress = "Univ di Pisa, Dipartmento di Informatica, Pisa,
Italy",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages",
keywords = "computer programming languages; data description
languages; data manipulation; database systems;
functional abstract data types; Galileo; languages;
olit-oopl Galileo; query languages, design",
subject = "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
Classifications, GALILEO. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages. {\bf H.2.3}: Information Systems, DATABASE
MANAGEMENT, Languages, Data description languages
(DDL). {\bf H.2.3}: Information Systems, DATABASE
MANAGEMENT, Languages, Data manipulation languages
(DML). {\bf D.3.3}: Software, PROGRAMMING LANGUAGES,
Language Constructs and Features, Abstract data types.
{\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language
Constructs and Features, Data types and structures.
{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Schema
and subschema.",
}
@Article{Huang:1985:HBT,
author = "Shou-Hsuan Stephen Huang",
title = "Height-balanced Trees of Order
$(\beta,\gamma,\delta)$",
journal = j-TODS,
volume = "10",
number = "2",
pages = "261--284",
month = jun,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P05",
MRnumber = "801 578",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-2/p261-huang/p261-huang.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-2/p261-huang/",
abstract = "We study restricted classes of B-trees, called
$H(\beta,\gamma,\delta)$ trees. A class is defined by
three parameters: $\beta$, the size of a node;
$\gamma$, the minimal number of grandsons a node must
have; and $\delta$, the minimal number of leaves bottom
nodes must have. This generalizes the brother condition
of 2-3 brother trees in a uniform way to B-trees of
higher order. The class of B-trees of order m is
obtained by choosing $\beta = m$, $\gamma = (m/2)^2$,
and $\delta = m/2$. An algorithm to construct H-trees
for any given number of keys is given in Section 1.
Insertion and deletion algorithms are given in Section
2. The costs of these algorithms increase smoothly as
the parameters are increased. Furthermore, it is proved
that the insertion can be done in time $O(?? + \log
N)$, where $N$ is the number of nodes in the tree.
Deletion can also be accomplished without
reconstructing the entire tree. Properties of H-trees
are given in Section 3. It is shown that the height of
H-trees decreases as increases, and the storage
utilization increases significantly as increases.
Finally, comparisons with other restricted classes of
B-trees are given in Section 4 to show the
attractiveness of H-trees.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Houston, Dep of Computer Science, Houston, TX,
USA",
affiliationaddress = "Univ of Houston, Dep of Computer Science,
Houston, TX, USA",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "algorithms; b-trees; compact b-trees; computer
programming --- algorithms; data processing; data
structures; dense multiway trees; height-balanced
trees; performance",
subject = "{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf H.2.2}:
Information Systems, DATABASE MANAGEMENT, Physical
Design, Access methods.",
}
@Article{Piwowarski:1985:CBS,
author = "Marek Piwowarski",
title = "Comments on Batched Searching of Sequential and
Tree-Structured Files",
journal = j-TODS,
volume = "10",
number = "2",
pages = "285--287",
month = jun,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "See \cite{Shneiderman:1976:BSS,Batory:1982:UMP}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-2/p285-piwowarski/p285-piwowarski.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-2/p285-piwowarski/;
http://www.acm.org/pubs/toc/Abstracts/tods/214294.html",
abstract = "Exact formulas for the expected cost savings from
batching requests against two types of j-ary trees are
given. Approximate expressions are also presented.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Performance",
keywords = "performance",
subject = "{\bf H.3.2}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Storage, File organization.
{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf F.2.2}:
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, Nonnumerical Algorithms and
Problems, Sorting and searching.",
}
@Article{Ullman:1985:ILQ,
author = "Jeffrey D. Ullman",
title = "Implementation of Logical Query Languages for
Databases",
journal = j-TODS,
volume = "10",
number = "3",
pages = "289--321",
month = sep,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Ai/nonmono.bib; Ai/prolog.1.bib; Compendex database;
Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Sep., YEAR $=$ 1985",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-3/p289-ullman/p289-ullman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-3/p289-ullman/;
http://www.acm.org/pubs/toc/Abstracts/tods/3980.html",
abstract = "We examine methods of implementing queries about
relational databases in the case where these queries
are expressed in first-order logic as a collection of
Horn clauses. Because queries may be defined
recursively, straightforward methods of query
evaluation do not always work, and a variety of
strategies have been proposed to handle subsets of
recursive queries. We express such query evaluation
techniques as ``capture rules'' on a graph representing
clauses and predicates. One essential property of
capture rules is that they can be applied
independently, thus providing a clean interface for
query-evaluation systems that use several different
strategies in different situations. Another is that
there be an efficient test for the applicability of a
given rule. We define basic capture rules corresponding
to application of operators from relational algebra, a
top-down capture rule corresponding to ``backward
chaining,'' that is, repeated resolution of goals, a
bottom-up rule, corresponding to ``forward chaining,''
where we attempt to deduce all true facts in a given
class, and a ``sideways'' rule that allows us to pass
results from one goal to another.",
acknowledgement = ack-nhfb,
affiliation = "Stanford Univ, Dep of Computer Science, Stanford, CA,
USA",
affiliationaddress = "Stanford Univ, Dep of Computer Science,
Stanford, CA, USA",
classification = "723",
conference = "Sel Pap from the 1985 ACM SIGMOD Conf",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Theory; Verification",
keywords = "computer programming languages; database systems; Horn
clauses; languages; logical query languages; relational
databases, Prolog, algorithms; theory; verification",
meetingaddress = "Austin, TX, USA",
meetingdate = "May 28--31 1985",
meetingdate2 = "05/28--31/85",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf I.2.3}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
Theorem Proving, Logic programming. {\bf I.2.4}:
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Knowledge Representation Formalisms and Methods,
Predicate logic.",
}
@Article{Anonymous:1985:SPA,
author = "Anonymous",
title = "Selected Papers from the 1985 {ACM SIGMOD
Conference}",
journal = j-TODS,
volume = "10",
number = "3",
pages = "289--346",
month = sep,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Nov 10 07:59:49 1998",
bibsource = "Compendex database; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "This issue contains 2 conference papers. The topics
covered are: logical query languages for databases; and
modeling concepts for VLSI CAD objects.",
acknowledgement = ack-nhfb,
classification = "714; 723",
conference = "Selected Papers from the 1985 ACM SIGMOD Conference.",
fjournal = "ACM Transactions on Database Systems",
journalabr = "ACM Transactions on Database Systems",
keywords = "CAD; database systems; design automation; integrated
circuits, VLSI --- computer aided design; logical query
languages; relational databases",
meetingaddress = "Austin, TX, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Batory:1985:MCV,
author = "D. S. Batory and Won Kim",
title = "Modeling Concepts for {VLSI CAD} Objects",
journal = j-TODS,
volume = "10",
number = "3",
pages = "322--346",
month = sep,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: ACM-SIGMOD 1985.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-3/p322-batory/p322-batory.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-3/p322-batory/;
http://www.acm.org/pubs/toc/Abstracts/tods/4018.html",
abstract = "VLSI CAD applications deal with design objects that
have an interface description and an implementation
description. Versions of design objects have a common
interface but differ in their implementations. A
molecular object is a modeling construct which enables
a database entity to be represented by two sets of
heterogeneous records, one set describes the object's
interface and the other describes its implementation.
Thus a reasonable starting point for modeling design
objects is to begin with the concept of molecular
objects.\par
In this paper, we identify modeling concepts that are
fundamental to capturing the semantics of VLSI CAD
design objects and versions in terms of molecular
objects. A provisional set of user operations on design
objects, consistent with these modeling concepts, is
also defined. The modeling framework that we present
has been found useful for investigating physical
storage techniques and change notification problems in
version control.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Texas at Austin, Dep of Computer Sciences,
Austin, TX, USA",
affiliationaddress = "Univ of Texas at Austin, Dep of Computer
Sciences, Austin, TX, USA",
classification = "714; 723",
conference = "Sel Pap from the 1985 ACM SIGMOD Conf",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages",
keywords = "CAD; Computer Aided Design; database systems; design
automation; integrated circuits, VLSI; languages;
relational databases; storage techniques, design;
version control",
meetingaddress = "Austin, TX, USA",
meetingdate = "May 28--31 1985",
meetingdate2 = "05/28--31/85",
subject = "{\bf B.7.1}: Hardware, INTEGRATED CIRCUITS, Types and
Design Styles, VLSI (very large scale integration).",
}
@Article{Subieta:1985:SQL,
author = "Kazimierz Subieta",
title = "Semantics of Query Languages for Network Databases",
journal = j-TODS,
volume = "10",
number = "3",
pages = "347--394",
month = sep,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-3/p347-subieta/p347-subieta.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-3/p347-subieta/;
http://www.acm.org/pubs/toc/Abstracts/tods/214293.html",
abstract = "Semantics determines the meaning of language
constructs; hence it says much more than syntax does
about implementing the language. The main purpose of
this paper is a formal presentation of the meaning of
basic language constructs employed in many database
languages (sublanguages). Therefore, stylized query
languages SSL (Sample Selection Language) and J (Joins)
are introduced, wherein most of the typical entries
present in other query languages are collected. The
semantics of SSL and J are defined by means of the
denotational method and explained informally. In SSL
and J, four types of expressions are introduced: a
selector (denotes a set of addresses), a term (denotes
a set of values), a formula (denotes a truth value),
and a join (denotes a set of n-tuples of addresses or
values). In many cases alternative semantics are given
and discussed. In order to obtain more general
properties of the proposed languages, a new database
access model is introduced, intended to be a tool for
the description of the logical access paths to data. In
particular, the access paths of the network and
relational models can be described. SSL and J
expressions may be addressed to both data structures.
In the case of the relational model, expressions of J
are similar to SQL or QUEL statements. Thus J may be
considered a generalization of relational query
languages for the network model. Finally, a programming
language, based on SSL and J, is outlined, and the
issues of SSL and J implementation are considered.",
acknowledgement = ack-nhfb,
affiliation = "Polish Acad of Sciences, Inst of Computer Science,
Warsaw, Pol",
affiliationaddress = "Polish Acad of Sciences, Inst of Computer
Science, Warsaw, Pol",
classification = "723",
conference = "Sel Pap from the 1985 ACM SIGMOD Conf",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages; Theory",
keywords = "computer programming languages; data manipulation
languages; database systems; denotational semantics;
query languages; query optimization, languages;
theory",
meetingaddress = "Austin, TX, USA",
meetingdate = "May 28--31 1985",
meetingdate2 = "05/28--31/85",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Data
manipulation languages (DML).",
}
@Article{Liew:1985:DDP,
author = "Chong K. Liew and Uinam J. Choi and Chung J. Liew",
title = "A Data Distortion by Probability Distribution",
journal = j-TODS,
volume = "10",
number = "3",
pages = "395--411",
month = sep,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-3/p395-liew/p395-liew.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-3/p395-liew/;
http://www.acm.org/pubs/toc/Abstracts/tods/4017.html",
abstract = "This paper introduces data distortion by probability
distribution, a probability distortion that involves
three steps. The first step is to identify the
underlying density function of the original series and
to estimate the parameters of this density function.
The second step is to generate a series of data from
the estimated density function. And the final step is
to map and replace the generated series for the
original one. Because it is replaced by the distorted
data set, probability distortion guards the privacy of
an individual belonging to the original data set. At
the same time, the probability distorted series
provides asymptotically the same statistical properties
as those of the original series, since both are under
the same distribution. Unlike conventional point
distortion, probability distortion is difficult to
compromise by repeated queries, and provides a maximum
exposure for statistical analysis.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Oklahoma, Norman, OK, USA",
affiliationaddress = "Univ of Oklahoma, Norman, OK, USA",
annote = "analysis of pollution technique.",
classification = "723",
conference = "Sel Pap from the 1985 ACM SIGMOD Conf",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Security",
keywords = "data distortion; database systems; probability;
probability distortion; security; statistical
databases, statistical security; TODS, algorithms",
meetingaddress = "Austin, TX, USA",
meetingdate = "May 28--31 1985",
meetingdate2 = "05/28--31/85",
subject = "{\bf H.2.0}: Information Systems, DATABASE MANAGEMENT,
General, Security, integrity, and protection. {\bf
H.2.7}: Information Systems, DATABASE MANAGEMENT,
Database Administration. {\bf G.3}: Mathematics of
Computing, PROBABILITY AND STATISTICS, Statistical
computing. {\bf G.3}: Mathematics of Computing,
PROBABILITY AND STATISTICS.",
}
@Article{Tay:1985:LPC,
author = "Y. C. Tay and Nathan Goodman and Rajan Suri",
title = "Locking Performance in Centralized Databases",
journal = j-TODS,
volume = "10",
number = "4",
pages = "415--462",
month = dec,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-4/p415-tay/p415-tay.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-4/p415-tay/;
http://www.acm.org/pubs/toc/Abstracts/tods/4880.html",
abstract = "An analytic model is used to study the performance of
dynamic locking. The analysis uses only the
steady-state average values of the variables. The
solution to the model is given by a cubic, which has
exactly one valid root for the range of parametric
values that is of interest. The model's predictions
agree well with simulation results for transactions
that require up to twenty locks. The model separates
data contention from resource contention, thus
facilitating an analysis of their separate effects and
their interaction. It shows that systems with a
particular form of nonuniform access, or with shared
locks, are equivalent to systems with uniform access
and only exclusive locks.\par
Blocking due to conflicts is found to impose an upper
bound on transaction throughput; this fact leads to a
rule of thumb on how much data contention should be
permitted in a system. Throughput can exceed this bound
if a transaction is restarted whenever it encounters a
conflict, provided restart costs and resource
contention are low. It can also be exceeded by making
transactions predeclare their locks. Raising the
multiprogramming level to increase throughput also
raises the number of restarts per completion.
Transactions should minimize their lock requests,
because data contention is proportional to the square
of the number of requests. The choice of how much data
to lock at a time depends on which part of a general
granularity curve the system sees.",
acknowledgement = ack-nhfb,
affiliation = "Natl Univ of Singapore, Singapore, Singapore",
affiliationaddress = "Natl Univ of Singapore, Singapore, Singapore",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Measurement; Performance; Theory;
Verification",
keywords = "concurrency control; data contention; database
locking; database systems; measurement; performance;
resource contention, algorithms; theory; verification",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf H.2.2}:
Information Systems, DATABASE MANAGEMENT, Physical
Design, Deadlock avoidance. {\bf C.4}: Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Modeling
techniques. {\bf C.2.2}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.2.1}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Architecture
and Design, Centralized networks.",
}
@Article{Batory:1985:MSA,
author = "D. S. Batory",
title = "Modeling the Storage Architectures of Commercial
Database Systems",
journal = j-TODS,
volume = "10",
number = "4",
pages = "463--528",
month = dec,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-4/p463-batory/p463-batory.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-4/p463-batory/;
http://www.acm.org/pubs/toc/Abstracts/tods/5392.html",
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.\par
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 architectures (i.e., the storage structures and
mappings) of many commercial DBMSs in a precise,
systematic, and comprehensible way. Models of the
INQUIRE, ADABAS, and SYSTEM 2000 storage architectures
are presented as examples of the model's utility.
\par
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.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Texas at Austin, Austin, TX, USA",
affiliationaddress = "Univ of Texas at Austin, Austin, TX, USA",
annote = "considers ADABAS, INQUIRE, SYSTEM2000 in depth.
Classification of linksets. modeling storage methods of
Inquire, ADABAS, and System 2000.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Documentation",
keywords = "data processing --- data structures; database systems;
documentation; storage architectures, design",
subject = "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Access methods. {\bf E.5}: Data,
FILES, Organization/structure. {\bf H.2.m}: Information
Systems, DATABASE MANAGEMENT, Miscellaneous.",
}
@Article{Agrawal:1985:ICC,
author = "Rakesh Agrawal and David J. Dewitt",
title = "Integrated Concurrency Control and Recovery
Mechanisms: Design and Performance Evaluation",
journal = j-TODS,
volume = "10",
number = "4",
pages = "529--564",
month = dec,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-4/p529-agrawal/p529-agrawal.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-4/p529-agrawal/;
http://www.acm.org/pubs/toc/Abstracts/tods/4958.html",
abstract = "In spite of the wide variety of concurrency control
and recovery 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 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.",
acknowledgement = ack-nhfb,
affiliation = "AT\&T Bell Lab, Murray Hill, NJ, USA",
affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Measurement; Performance",
keywords = "concurrency control; database systems; design;
measurement; performance; recovery mechanisms;
transaction processing, algorithms",
subject = "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Recovery and restart. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems. {\bf
H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Deadlock avoidance. {\bf D.4.1}:
Software, OPERATING SYSTEMS, Process Management,
Concurrency. {\bf D.4.3}: Software, OPERATING SYSTEMS,
File Systems Management.",
}
@Article{Borgida:1985:LFF,
author = "Alexander Borgida",
title = "Language Features for Flexible Handling of Exceptions
in Information Systems",
journal = j-TODS,
volume = "10",
number = "4",
pages = "565--603",
month = dec,
year = "1985",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/database.bib;
Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: Rutgers Un., TR-LCSR-70, rev.
Mar. 1985.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1985-10-4/p565-borgida/p565-borgida.pdf;
http://www.acm.org/pubs/citations/journals/tods/1985-10-4/p565-borgida/;
http://www.acm.org/pubs/toc/Abstracts/tods/4995.html",
abstract = "An exception-handling facility suitable for languages
used to implement database-intensive information
systems is presented. Such a mechanism facilitates the
development and maintenance of more flexible software
systems by supporting the abstraction of details
concerning special or abnormal occurrences. The type
constraints imposed by the schema as well as various
semantic integrity assertions are considered to be
normalcy conditions, and the key contribution of this
work is to allow exceptions to these constraints to
persist. To achieve this, solutions are proposed to a
range of problems, including sharing and computing with
exceptional information, exception handling by users,
the logic of constraints with exceptions, and
implementation issues. The use of exception handling in
dealing with null values, estimates, and measurement is
also illustrated.",
acknowledgement = ack-nhfb,
affiliation = "Rutgers Univ, Dep of Computer Science, New Brunswick,
NJ, USA",
affiliationaddress = "Rutgers Univ, Dep of Computer Science, New
Brunswick, NJ, USA",
annote = "Adding exception handling to database systems to deal
with unusual, unknown, or otherwise exceptional
attribute values. A semantic extension that may inspire
KBMSers. I have a report in my office on the
possibilities of this approach, by Alex Borgida of
Rutgers. It's very readable, and it may inspire someone
to cook up such a scheme of his or her own for Naxos,
thesis, or whatever. -----Marianne W. W.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Theory; Verification",
keywords = "computer programming languages; database systems;
exception handling; languages; semantic integrity;
theory; type constraints, design; verification",
subject = "{\bf D.2.5}: Software, SOFTWARE ENGINEERING, Testing
and Debugging, Error handling and recovery. {\bf
H.2.0}: Information Systems, DATABASE MANAGEMENT,
General, Security, integrity, and protection. {\bf
H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Data
description languages (DDL). {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Data
manipulation languages (DML).",
}
@Article{Hagmann:1986:PAS,
author = "Robert Brian Hagmann and Domenico Ferrari",
title = "Performance Analysis of Several Back-End Database
Architectures",
journal = j-TODS,
volume = "11",
number = "1",
pages = "1--26",
month = mar,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-1/p1-hagmann/p1-hagmann.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-1/p1-hagmann/;
http://www.acm.org/pubs/toc/Abstracts/tods/5242.html",
abstract = "The growing acceptance of database systems makes their
performance increasingly more important. One way to
gain performance is to off-load some of the functions
of the database system to aback-end computer. The
problem is what functions should be off-loaded to
maximize the benefits of distributed processing.
\par
Our approach to this problem consisted of constructing
several variants of an existing relational database
system. INGRES, that partition the database system
software into two parts, and assigning these two parts
to two computers connected by a local area network. For
the purposes of this experiment, six different variants
of the database software were constructed to test the
sir most interesting functional subdivisions. Each
variant was then benchmarked using two different
databases and query streams. The communication medium
and the communication software were also benchmarked to
measure their contribution to the performance of each
configuration.\par
Combining the database and network measurement results,
various conclusions were reached about the viability of
the configurations, the desirable properties of the
communications mechanisms to he used, the operating
system interface and overhead, and the performance of
the database system. The variants to be preferred
depend on the hardware technology, operating system
features, database system internal structure, and
network software overhead.",
acknowledgement = ack-nhfb,
affiliation = "Univ of California, Berkely, CA, USA",
affiliationaddress = "Univ of California, Berkely, CA, USA",
annote = "an experimental methodology using INGRES.",
classification = "722; 723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Experimentation; Measurement; Performance",
keywords = "back-end database architectures; computer networks ---
local networks; computer systems, digital ---
distributed; database systems; experimentation; Ingres
database system; measurement; performance; relational
databases, hardware support database machine TODS,
design",
subject = "{\bf H.2.6}: Information Systems, DATABASE MANAGEMENT,
Database Machines. {\bf C.2.4}: Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems. {\bf C.4}: Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf H.2.0}:
Information Systems, DATABASE MANAGEMENT, General,
INGRES.",
}
@Article{Garcia-Molina:1986:ABA,
author = "H{\'e}ctor Garc{\'\i}a-Molina and Frank Pittelli and
Susan Davidson",
title = "Applications of {Byzantine} Agreement in Database
Systems",
journal = j-TODS,
volume = "11",
number = "1",
pages = "27--47",
month = mar,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-1/p27-molina/p27-molina.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-1/p27-molina/;
http://www.acm.org/pubs/toc/Abstracts/tods/5243.html",
abstract = "In this paper we study when and how a Byzantine
agreement protocol can be used in general-purpose
database management, systems. We present an overview of
the failure model used for Bizantine agreement, and of
the protocol itself. We then present correctness
criteria for database processing in this failure
environment and discuss strategies for satisfying them.
In doing this, we present new failure models for
input\slash output nodes and study ways to distribute
input transactions to processing nodes under these
models. Finally, we investigate applications of
Byzantine agreement protocols in the more common
failure environment where processors are assumed to
halt after a failure.",
acknowledgement = ack-nhfb,
affiliation = "Princeton Univ, Princeton, NJ, USA",
affiliationaddress = "Princeton Univ, Princeton, NJ, USA",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Reliability",
keywords = "algorithms; Byzantine agreement protocol; data
processing; database systems; distributed; failure
models; fault tolerance; reliability",
subject = "{\bf D.4.5}: Software, OPERATING SYSTEMS, Reliability,
Fault-tolerance. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems, Distributed systems. {\bf
C.2.2}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases.",
}
@Article{Segev:1986:OJO,
author = "Arie Segev",
title = "Optimization of Join Operations in Horizontally
Partitioned Database Systems",
journal = j-TODS,
volume = "11",
number = "1",
pages = "48--80",
month = mar,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-1/p48-segev/p48-segev.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-1/p48-segev/;
http://www.acm.org/pubs/toc/Abstracts/tods/5241.html",
abstract = "This paper analyzes the problem of joining two
horizontally partitioned relations in a distributed
database system. Two types of semijoin strategies are
introduced, local and remote. Local semijoins are
performed at the site of the restricted relation (or
fragment), and remote semijoins can be performed at an
arbitrary site. A mathematical model of a semijoin
strategy for the case of remote semijoins is developed,
and lower bounding and heuristic procedures are
proposed. The results of computational experiments are
reported. The experiments include an analysis of the
heuristics' performance relative to the lower bounds,
sensitivity analysis, and error analysis. These results
reveal a good performance of the heuristic procedures,
and demonstrate the benefit of using semijoin
operations to reduce the size of fragments prior to
their transmission. The algorithms for the case of
remote semijoins were found to be superior to the
algorithms for the case of local semijoins. In
addition, we found that the estimation accuracy of the
selectivity factors has a significant effect on the
incurred communication cost.",
acknowledgement = ack-nhfb,
affiliation = "Univ of California, Berkely, CA, USA",
affiliationaddress = "Univ of California, Berkely, CA, USA",
classification = "723; 921",
fjournal = "ACM Transactions on Database Systems",
keywords = "computer programming --- algorithms; database systems;
distributed; horizontally partitioned database systems,
query processing optimization tods; join operations;
mathematical models; optimization",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf G.2.2}: Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.
{\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Distributed
systems. {\bf G.2.1}: Mathematics of Computing,
DISCRETE MATHEMATICS, Combinatorics, Combinatorial
algorithms.",
}
@Article{Gyssens:1986:CJD,
author = "Marc Gyssens",
title = "On the Complexity of Join Dependencies",
journal = j-TODS,
volume = "11",
number = "1",
pages = "81--108",
month = mar,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "87g:68011",
MRreviewer = "J. Paredaens",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-1/p81-gyssens/p81-gyssens.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-1/p81-gyssens/;
http://www.acm.org/pubs/toc/Abstracts/tods/5237.html",
abstract = "In [10] a method is proposed for decomposing join
dependencies (jds) in a relational database using the
notion of a hinge. This method was subsequently studied
in [11] and [12]. We show how the technique of
decomposition can be used to make integrity checking
more efficient. It turns out that it is important to
find a decomposition that minimizes the number of edges
of its largest element. We show that the decompositions
obtained with the method described in [10] are optimal
in this respect. This minimality criterion leads to the
definition of the {\em degree of cyclicity}, which
allows us to classify jds and leads to the notion of
{\em n-cyclicity}, of which acyclicity is a special
case for n = 2. We then show that, for a fixed value of
n (which may be greater than 2). integrity checking can
be performed in polynomial time provided we restrict
ourselves to {\em n-cyclic\/} jds. Finally, we
generalize a well-known characterization for acyclic
jds by proving that n-cyclicity is equivalent to
``n-wise consistency implies global consistency.'' As a
consequence, consistency checking can be performed in
polynomial time if we restrict ourselves to n-cyclic
jds, for a tired value of n, not necessarily equal to
2.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Antwerp, Antwerp, Belg",
affiliationaddress = "Univ of Antwerp, Antwerp, Belg",
classification = "723; 921",
fjournal = "ACM Transactions on Database Systems",
keywords = "CYCLICITY; database systems; DECOMPOSITION; JOIN
DEPENDENCIES; MATHEMATICAL TECHNIQUES --- Graph Theory;
Relational",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Normal forms. {\bf G.2.2}: Mathematics
of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph
algorithms. {\bf H.2.1}: Information Systems, DATABASE
MANAGEMENT, Logical Design, Schema and subschema. {\bf
G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Trees.",
}
@Article{Sacco:1986:FTE,
author = "Giovanni Maria Sacco",
title = "Fragmentation: {A} technique for Efficient Query
Processing",
journal = j-TODS,
volume = "11",
number = "2",
pages = "113--133",
month = jun,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: University of Torino, TR., Aug.
1983.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-2/p113-sacco/p113-sacco.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-2/p113-sacco/;
http://www.acm.org/pubs/toc/Abstracts/tods/5638.html",
abstract = "A `divide and conquer' strategy to compute natural
joins by sequential scans on unordered relations is
described. This strategy is shown to always be better
than merging scans when both relations must be sorted
before joining, and generally better in practical cases
when only the largest relation must be sorted.",
acknowledgement = ack-nhfb,
affiliation = "Univ di Torino",
affiliationaddress = "Turin, Italy",
annote = "Join by hashing: Create fragments by hashing, as many
fragments as buffers can be allocated in memory. Then
repeat that for the other relation. Then do a nested
unsorted join, as Kim, W. 1980, on the fragment
pairs.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Economics; Performance",
keywords = "computer programming --- Algorithms; database systems;
divide-and-conquer algorithms; economics;
fragmentation; natural joins, join hash partitioning
overflow avoidance recursion parallelism TODS,
algorithms; performance; query processing",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing.",
}
@Article{Beeri:1986:IAL,
author = "Catriel Beeri and Michael Kifer",
title = "An Integrated Approach to Logical Design of Relational
Database Schemes",
journal = j-TODS,
volume = "11",
number = "2",
pages = "134--158",
month = jun,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "848 633",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-2/p134-beeri/p134-beeri.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-2/p134-beeri/;
http://www.acm.org/pubs/toc/Abstracts/tods/214291.html",
abstract = "We propose a new approach to the design of relational
database schemes. The main features of the approach are
the following:\par
A combination of the traditional decomposition and
synthesis approaches, thus allowing the use of both
functional and multivalued dependencies.
\par
Separation of structural dependencies relevant for the
design process from integrity constraints, that is,
constraints that do not bear any structural information
about the data and which should therefore be discarded
at the design stage. This separation is supported by a
simple syntactic test filtering out nonstructural
dependencies.\par
Automatic correction of schemes which lack certain
desirable properties.",
acknowledgement = ack-nhfb,
affiliation = "Hebrew Univ of Jerusalem, Jerusalem, Isr",
affiliationaddress = "Hebrew Univ of Jerusalem, Jerusalem, Isr",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Theory",
keywords = "acyclic schemes, design; database systems;
decomposition; functional dependencies; multivalued
dependencies; relational; synthesis; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf H.2.1}:
Information Systems, DATABASE MANAGEMENT, Logical
Design, Normal forms.",
}
@Article{Mendelson:1986:IIC,
author = "Haim Mendelson and Aditya N. Saharia",
title = "Incomplete Information Costs and Database Design",
journal = j-TODS,
volume = "11",
number = "2",
pages = "159--185",
month = jun,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-2/p159-mendelson/p159-mendelson.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-2/p159-mendelson/;
http://www.acm.org/pubs/toc/Abstracts/tods/5678.html",
abstract = "This paper presents a methodology for trading-off the
cost of incomplete information against the data-related
costs in the design of database systems. It
investigates how the usage patterns of the database,
defined by the characteristics of information requests
presented to it, affect its conceptual design. The
construction of minimum-cost answers to information
requests for a variety of query types and cost
structures is also studied. The resulting costs of
incomplete database information are balanced against
the data-related costs in the derivation of the optimal
design.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Rochester, Rochester, NY, USA",
affiliationaddress = "Univ of Rochester, Rochester, NY, USA",
annote = "information value, missing data, decision theory
framework, applied to ships in the Mediterranean.",
classification = "723; 921",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Economics; Theory",
keywords = "data-related costs, design; database systems; design;
economics; incomplete information costs; optimization;
theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design. {\bf H.1.1}: Information Systems,
MODELS AND PRINCIPLES, Systems and Information Theory.
{\bf H.3.3}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Search and Retrieval.",
}
@Article{Ginsburg:1986:CTS,
author = "Seymour Ginsburg and Katsumi Tanaka",
title = "Computation-Tuple Sequences and Object Histories",
journal = j-TODS,
volume = "11",
number = "2",
pages = "186--212",
month = jun,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "848 634",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-2/p186-ginsburg/p186-ginsburg.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-2/p186-ginsburg/;
http://www.acm.org/pubs/toc/Abstracts/tods/5924.html",
abstract = "A record-based, algebraically-oriented model is
introduced for describing data for ``object histories''
(with computation), such as checking accounts, credit
card accounts, taxes, schedules, and so on. The model
consists of sequences of computation tuples defined by
a computation-tuple sequence scheme (CSS). The CSS has
three major features (in addition to input data):
computation (involving previous computation tuples),
``uniform'' constraints (whose satisfaction by a
computation-tuple sequence $u$ implies satisfaction by
every interval of $u$), and specific sequences with
which to start the valid computation-tuple sequences. A
special type of CSS, called ``local,'' is singled out
for its relative simplicity in maintaining the validity
of a computation-tuple sequence. A necessary and
sufficient condition for a CSS to be equivalent to at
least one local CSS is given. Finally, the notion of
``local bisimulatability'' is introduced for regarding
two CSS as conveying the same information, and two
results on local bisimulatability in connection with
local CSS are established.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Southern California, Los Angeles, CA, USA",
affiliationaddress = "Univ of Southern California, Los Angeles, CA,
USA",
annote = "Sequential history tuples and objects with input,
computation, and result. Some constraints applied per
sequential entry cause satisfaction of global
constraints. Temporal issues are very specific.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Theory; Verification",
keywords = "computation history; data description; database state
transitions; database systems; theory; transaction
processing, algorithms; verification",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.1.0}: Information
Systems, MODELS AND PRINCIPLES, General. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Transaction processing.",
}
@Article{Garg:1986:OPK,
author = "Anil K. Garg and C. C. Gotlieb",
title = "Order-Preserving Key Transformations",
journal = j-TODS,
volume = "11",
number = "2",
pages = "213--234",
month = jun,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-2/p213-garg/p213-garg.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-2/p213-garg/;
http://www.acm.org/pubs/toc/Abstracts/tods/5923.html",
abstract = "File organizations based on conventional hash
functions provide faster access to the stored records
in comparison with tree-like file structures. Tree
structures such as B** plus -trees and ISAM do provide
for sequential processing, but require considerable
storage for the indices. When sequential processing is
needed a table that performs an order-preserving
transformation on keys can be used. H is an
order-preserving key transform if H(K//1) greater than
equivalent to H(K//2), for all keys K//1 greater than
K//2. We present methodologies for constructing such
key transforms, and illustrate them for some real-life
key sets. Storage requirements for the table needed to
carry out the transformation are less than those needed
for the indices.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Toronto, Toronto, Ont, Can",
affiliationaddress = "Univ of Toronto, Toronto, Ont, Can",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Management; Measurement;
Performance; Theory",
keywords = "access methods, algorithms; data processing; database
systems; design; dynamic files; file organization; key
transformations; management; measurement;
order-preserving hashing; performance; theory",
subject = "{\bf E.5}: Data, FILES, Organization/structure. {\bf
H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Access methods.",
}
@Article{Shapiro:1986:JPD,
author = "Leonard D. Shapiro",
title = "Join Processing in Database Systems with Large Main
Memories",
journal = j-TODS,
volume = "11",
number = "3",
pages = "239--264",
month = sep,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/database.bib; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-3/p239-shapiro/p239-shapiro.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-3/p239-shapiro/;
http://www.acm.org/pubs/toc/Abstracts/tods/6315.html",
abstract = "We study algorithms for computing the equijoin of two
relations in a system with a standard architecture hut
with large amounts of main memory. Our algorithms are
especially efficient when the main memory available is
a significant fraction of the size of one of the
relations to he joined; but they can be applied
whenever there is memory equal to approximately the
square root of the size of one relation. We present a
new algorithm which is a hybrid of two hash-based
algorithms and which dominates the other algorithms we
present, including sort-merge. Even in a virtual memory
environment, the hybrid algorithm dominates all the
others we study.\par
Finally, we describe how three popular tools to
increase the efficiency of joins, namely filters, Babb
arrays, and semijoins, can he grafted onto any of our
algorithms.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "design; memory query evaluation classical simple
hybrid hash joins TODS, algorithms; performance",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.2.0}: Information
Systems, DATABASE MANAGEMENT, General. {\bf H.2.6}:
Information Systems, DATABASE MANAGEMENT, Database
Machines. {\bf H.2.2}: Information Systems, DATABASE
MANAGEMENT, Physical Design.",
}
@Article{Gavish:1986:SQO,
author = "Bezalel Gavish and Arie Segev",
title = "Set Query Optimization in Distributed Database
Systems",
journal = j-TODS,
volume = "11",
number = "3",
pages = "265--293",
month = sep,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-3/p265-gavish/p265-gavish.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-3/p265-gavish/;
http://www.acm.org/pubs/toc/Abstracts/tods/6488.html",
abstract = "This paper addresses the problem of optimizing queries
that involve set operations (set queries) in a
distributed relational database system. A particular
emphasis is put on the optimization of such queries in
horizontally partitioned database systems. A
mathematical programming model of the set query problem
is developed and its NP-completeness is proved.
Solution procedures are proposed and computational
results presented. One of the main results of the
computational experiments is that, for many queries,
the solution procedures are not sensitive to errors in
estimating the size of results of set operations.",
acknowledgement = ack-nhfb,
annote = "The time complexity is NP-complete. Three
approximations.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Theory",
keywords = "algorithms; languages; theory",
subject = "{\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases. {\bf G.2.2}: Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Trees.
{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Query
processing.",
}
@Article{Lafortune:1986:STM,
author = "St{\'e}phane Lafortune and Eugene Wong",
title = "A State Transition Model for Distributed Query
Processing",
journal = j-TODS,
volume = "11",
number = "3",
pages = "294--322",
month = sep,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/database.bib; Database/Graefe.bib;
http://www.acm.org/pubs/toc/; Misc/des.bib;
Misc/Discrete.event.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-3/p294-lafortune/p294-lafortune.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-3/p294-lafortune/;
http://www.acm.org/pubs/toc/Abstracts/tods/6460.html",
abstract = "A state transition model for the optimization of query
processing in a distributed database system is
presented. The problem is parameterized by means of a
state describing the amount of processing that has been
performed at each site where the database is located. A
state transition occurs each time a new join or
semijoin is executed. Dynamic programming is used to
compute recursively the costs of the states and the
globally optimal solution, taking into account
communication and local processing costs. The state
transition model is general enough to account for the
possibility of parallel processing among the various
sites, as well as for redundancy in the database. The
model also permits significant reductions of the
necessary computations by taking advantage of simple
additivity and site-uniformity properties of a cost
model, and of clever strategies that improve on the
basic dynamic programming algorithm.",
acknowledgement = ack-nhfb,
bib = "koz",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Theory",
keywords = "algorithms; design; performance; theory, Optimization
TODS",
subject = "{\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Distributed
systems. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Query processing.",
}
@Article{Lozinskii:1986:POI,
author = "Eliezer L. Lozinskii",
title = "A Problem-Oriented Inferential Database System",
journal = j-TODS,
volume = "11",
number = "3",
pages = "323--356",
month = sep,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15 (68T20)",
MRnumber = "87k:68025",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-3/p323-lozinskii/p323-lozinskii.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-3/p323-lozinskii/;
http://www.acm.org/pubs/toc/Abstracts/tods/6419.html",
abstract = "Recently developed inferential database systems face
some common problems: a very fast growth of search
space and difficulties in recognizing inference
termination (especially for recursive axioms). These
shortcomings stem mainly from the fact that the
inference process is usually separated from database
operations. A problem-oriented inferential system i8
described which refers to the database prior to query
(or subquery) processing, so that the inference from
the very beginning is directed by data relevant to the
query. A multiprocessor implementation of the system is
presented based on a computer network conforming to
database relations and axioms. The system provides an
efficient indication of query termination, and is
complete in the sense that it produces all correct
answers to a query in a finite time.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Theory;
Verification",
keywords = "algorithms; design; performance; theory;
verification",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf I.2.3}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
Theorem Proving, Deduction. {\bf C.1.3}: Computer
Systems Organization, PROCESSOR ARCHITECTURES, Other
Architecture Styles, Data-flow architectures.",
}
@Article{Osborn:1986:DRD,
author = "Sylvia L. Osborn and T. E. Heaven",
title = "The Design of a Relational Database System with
Abstract Data Types for Domains",
journal = j-TODS,
volume = "11",
number = "3",
pages = "357--373",
month = sep,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-3/p357-osborn/p357-osborn.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-3/p357-osborn/;
http://www.acm.org/pubs/toc/Abstracts/tods/6461.html",
abstract = "An extension to the relational model is described in
which domains can he arbitrarily defined as abstract
data types. Operations on these data types include
primitive operations, aggregates, and transformations.
It is shown that these operations make the query
language complete in the sense of Chandra and Harel.
The system has been designed in such a way that new
data types and their operations can be defined with a
minimal amount of interaction with the database
management system.",
acknowledgement = ack-nhfb,
annote = "Operations on simple objects, operations on aggregates
and `transformations' can be defined on relations. It
is possible to implement a transitive closure RAD uses
the data dictionary. ---Ong, Fogg and Stonebraker.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Theory",
keywords = "design; languages; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf D.3.3}: Software,
PROGRAMMING LANGUAGES, Language Constructs and
Features, Abstract data types. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages.",
}
@Article{Gawlick:1986:RIW,
author = "Dieter Gawlick",
title = "Report on the International Workshop on
High-Performance Transaction Systems",
journal = j-TODS,
volume = "11",
number = "4",
pages = "375--377",
month = dec,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-4/p375-gawlick/p375-gawlick.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-4/p375-gawlick/;
http://www.acm.org/pubs/toc/Abstracts/tods/17346.html",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Performance",
keywords = "design; performance",
subject = "{\bf A.0}: General Literature, GENERAL. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Transaction processing. {\bf C.4}: Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Reliability,
availability, and serviceability.",
}
@Article{Mohan:1986:TMR,
author = "C. Mohan and B. Lindsay and R. Obermarck",
title = "Transaction Management in the {R*} Distributed
Database Management System",
journal = j-TODS,
volume = "11",
number = "4",
pages = "378--396",
month = dec,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-4/p378-mohan/p378-mohan.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-4/p378-mohan/;
http://www.acm.org/pubs/toc/Abstracts/tods/7266.html",
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
Commit (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.",
acknowledgement = ack-nhfb,
affiliation = "IBM, San Jose, CA, USA",
affiliationaddress = "IBM, San Jose, CA, USA",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Reliability",
keywords = "commit protocols; concurrency control, RSTAR TODS,
algorithms; database systems; deadlock victim
selection; design; distributed; optimization;
reliability; transaction management",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Distributed systems. {\bf C.2.4}: Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems, Distributed databases. {\bf
D.4.1}: Software, OPERATING SYSTEMS, Process
Management, Concurrency. {\bf D.4.1}: Software,
OPERATING SYSTEMS, Process Management, Deadlocks. {\bf
D.4.1}: Software, OPERATING SYSTEMS, Process
Management, Synchronization. {\bf D.4.5}: Software,
OPERATING SYSTEMS, Reliability, Fault-tolerance. {\bf
D.4.7}: Software, OPERATING SYSTEMS, Organization and
Design, Distributed systems. {\bf H.2.2}: Information
Systems, DATABASE MANAGEMENT, Physical Design, Recovery
and restart. {\bf H.2.7}: Information Systems, DATABASE
MANAGEMENT, Database Administration, Logging and
recovery.",
}
@Article{Bayer:1986:CTR,
author = "Rudolf Bayer",
title = "Consistency of Transactions and Random Batch",
journal = j-TODS,
volume = "11",
number = "4",
pages = "397--404",
month = dec,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-4/p397-bayer/p397-bayer.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-4/p397-bayer/;
http://www.acm.org/pubs/toc/Abstracts/tods/214287.html",
abstract = "A synchronization technique and scheduling strategy is
described, which allows us to run a batch process
simultaneously with on-line transactions. The batch
process and the transactions are serialized in such a
way that consistency level 3 is achieved.",
acknowledgement = ack-nhfb,
affiliation = "Technische Univ Muenchen, West Ger",
affiliationaddress = "Technische Univ Muenchen, West Ger",
classification = "723; 913",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "concurrency control, algorithms; consistency of
transactions; database systems; design; performance;
random batch; scheduling; synchronization",
subject = "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process
Management. {\bf D.4.7}: Software, OPERATING SYSTEMS,
Organization and Design. {\bf E.5}: Data, FILES. {\bf
H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems.",
}
@Article{ONeil:1986:ETM,
author = "Patrick E. O'Neil",
title = "The {Escrow} Transactional Method",
journal = j-TODS,
volume = "11",
number = "4",
pages = "405--430",
month = dec,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-4/p405-o_neil/p405-o_neil.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-4/p405-o_neil/;
http://www.acm.org/pubs/toc/Abstracts/tods/7265.html",
abstract = "A method is presented for permitting record updates by
long-lived transactions without forbidding simultaneous
access by other users to records modified. Earlier
methods presented separately by Gawlick and Reuter are
comparable but concentrate on ``hot-spot'' situations,
where even short transactions cannot lock frequently
accessed fields without causing bottlenecks. The Escrow
Method offered here is designed to support nonblocking
record updates by transactions that are ``long lived''
and thus require long periods to complete.
Recoverability of intermediate results prior to commit
thus becomes a design goal, so that updates as of a
given time can be guaranteed against memory or media
failure while still retaining the prerogative to abort.
This guarantee basically completes phase one of a
two-phase commit, and several advantages result: (1) As
with Gawlick's and Reuter's methods, high-concurrency
items in the database will not act as a bottleneck; (2)
transaction commit of different updates can be
performed asynchronously, allowing natural distributed
transactions; indeed, distributed transactions in the
presence of delayed messages or occasional line
disconnection become feasible in a way that we argue
will tie up minimal resources for the purpose intended;
and (3) it becomes natural to allow for human
interaction in the middle of a transaction without loss
of concurrent access or any special difficulty for the
application programmer. The Escrow Method, like
Gawlick's Fast Path and Reuter's Method, requires the
database system to be an ``expert'' about the type of
transactional updates performed, most commonly updates
involving incremental changes to aggregate quantities.
However, the Escrow Method is extendable to other types
of updates.",
acknowledgement = ack-nhfb,
affiliation = "Computer Corp of America, Cambridge, MA, USA",
affiliationaddress = "Computer Corp of America, Cambridge, MA, USA",
annote = "For aggregate values (counts, sum) concurrency control
can use soft tolerances and keep them in escrow",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Theory",
keywords = "database systems; design; escrow transactional method;
long-lived transactions; multiuser environment, locking
quantities, not variables TODS, algorithms; nested
transactions; performance; theory; two-phase commit",
subject = "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process
Management, Concurrency. {\bf D.4.1}: Software,
OPERATING SYSTEMS, Process Management, Deadlocks. {\bf
H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Recovery and restart. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Distributed systems. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems, Escrow. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Transaction processing.",
}
@Article{Hsu:1986:PTP,
author = "Meichun Hsu and Arvola Chan",
title = "Partitioned Two-Phase Locking",
journal = j-TODS,
volume = "11",
number = "4",
pages = "431--446",
month = dec,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-4/p431-hsu/p431-hsu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-4/p431-hsu/;
http://www.acm.org/pubs/toc/Abstracts/tods/7477.html",
abstract = "In a large integrated database, there often exists an
``information hierarchy,'' where both raw data and
derived data are stored and used together. Therefore,
among update transactions, there will often be some
that perform only read accesses from a certain (i.e.,
the ``raw'' data) portion of the database and write
into another (i.e., the ``derived'' data) portion. A
conventional concurrency control algorithm would have
treated such transactions as regular update
transactions and subjected them to the usual protocols
for synchronizing update transactions. In this paper
such transactions are examined more closely. The
purpose is to devise concurrency control methods that
allow the computation of derived information to proceed
without interfering with the updating of raw data.
\par
The first part of the paper presents a proof method for
correctness of concurrency control algorithms in a
hierarchically decomposed database. The proof method
provides a framework for understanding the intricacies
in dealing with hierarchically decomposed databases.
The second part of the paper is an application of the
proof method to show the correctness of a
two-phase-locking- based algorithm, called partitioned
two-phase locking, for hierarchically decomposed
databases. This algorithm is a natural extension to the
Version Pool method proposed previously in the
literature.",
acknowledgement = ack-nhfb,
affiliation = "Harvard Univ, Cambridge, MA, USA",
affiliationaddress = "Harvard Univ, Cambridge, MA, USA",
annote = "revisions also for update",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Theory",
keywords = "computer programming --- algorithms; concurrency
control; database systems; theory; transaction
processing, algorithms; two-phase locking",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems. {\bf H.2.2}: Information Systems, DATABASE
MANAGEMENT, Physical Design.",
}
@Article{Luk:1986:EEL,
author = "W. S. Luk and Steve Kloster",
title = "{ELFS}: {English} Language from {SQL}",
journal = j-TODS,
volume = "11",
number = "4",
pages = "447--472",
month = dec,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sun Dec 8 08:54:10 MST 1996",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
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.",
acknowledgement = ack-nhfb,
affiliation = "Simon Fraser Univ, Burnaby, BC, Can",
affiliationaddress = "Simon Fraser Univ, Burnaby, BC, Can",
annote = "display meaning in natural language is independent of
the application domain.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "computer programming --- Program Debugging; database
systems; ELFS; Query Languages; relational database
language; SQL",
}
@Article{Sacco:1986:BMR,
author = "Giovanni Maria Sacco and Mario Schkolnick",
title = "Buffer Management in Relational Database Systems",
journal = j-TODS,
volume = "11",
number = "4",
pages = "473--498",
month = dec,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-4/p473-sacco/p473-sacco.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-4/p473-sacco/;
http://www.acm.org/pubs/toc/Abstracts/tods/7336.html",
abstract = "The hot-set model, characterizing the buffer
requirements of relational queries, is presented. This
model allows the system to determine the optimal buffer
space to be allocated to a query; it can also be used
by the query optimizer to derive efficient execution
plans accounting for the available buffer space, and by
a query scheduler to prevent thrashing. The hot-set
model is compared with the working-set model. A
simulation study is presented.",
acknowledgement = ack-nhfb,
acmcr = "8708-0695",
affiliation = "Univ di Torino",
affiliationaddress = "Turin, Italy",
annote = "The hot-set model provides a more meaningful measure
of cost than simple I/O counts.",
classification = "723; 913",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance; Theory",
keywords = "buffer management; database systems; performance;
query optimizer, algorithms; query processing;
relational; scheduling; theory",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.2.2}: Information
Systems, DATABASE MANAGEMENT, Physical Design. {\bf
D.4.2}: Software, OPERATING SYSTEMS, Storage
Management.",
}
@Article{Ariav:1986:TOD,
author = "Gad Ariav",
title = "A Temporally Oriented Data Model",
journal = j-TODS,
volume = "11",
number = "4",
pages = "499--527",
month = dec,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1986-11-4/p499-ariav/p499-ariav.pdf;
http://www.acm.org/pubs/citations/journals/tods/1986-11-4/p499-ariav/;
http://www.acm.org/pubs/toc/Abstracts/tods/7350.html",
abstract = "The research into time and data models has so far
focused on the identification of extensions to the
classical relational model that would provide it with
``adequate'' semantic capacity to deal with time. The
temporally oriented data model (TODM) presented in this
paper is a result of a different approach, namely, it
directly operationalizes the pervasive
three-dimensional metaphor for time. One of the main
results is thus the development of the notion of the
data cube: a three-dimensional and inherently temporal
data construct where time, objects, and attributes are
the primary dimensions of stored data. TODM's cube adds
historical depth to the tabular notions of data and
provides a framework for storing and retrieving data
within their temporal context. The basic operations in
the model allow the formation of new cubic views from
existing ones, or viewing data as one moves up and down
in time within cubes.\par
This paper introduces TODM, a consistent set of
temporally oriented data constructs, operations, and
constraints, and then presents TOSQL, a corresponding
end-user's SQL-like query syntax. The model is a
restricted but consistent superset of the relational
model, and the query syntax incorporates temporal
notions in a manner that likewise avoids penalizing
users who are interested solely in the current view of
data (rather than in a temporal perspective). The
naturalness of the spatial reference to time and the
added semantic capacity of TODM come with a price--the
definitions of the cubic constructs and basic
operations are relatively cumbersome. As rudimentary as
it is, TODM nonetheless provides a comprehensive basis
for formulating an external data model for a temporally
oriented database.",
acknowledgement = ack-nhfb,
affiliation = "New York Univ, New York, NY, USA",
affiliationaddress = "New York Univ, New York, NY, USA",
annote = "at least one timestamp, time of record, plus other
temporal --- event stamps.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Theory",
keywords = "data cube; database systems; information modeling;
languages; relational; temporally oriented data model;
theory; TODM, design; TOSQL",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Data
manipulation languages (DML). {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages.",
}
@Article{Albano:1986:OSG,
author = "Antonio Albano and S. Alfo and Luca Cardelli and Renzo
Orsini",
title = "An Overview of {SIDEREUS}: {A} Graphical Database
Schema Editor for {Galileo}",
journal = j-TODS,
volume = "11",
number = "??",
pages = "568--571",
month = "????",
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Dec 10 12:51:20 1996",
bibsource = "Distributed/gesturing.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
fjournal = "ACM Transactions on Database Systems",
xxnote = "This paper does not seem to be published in TODS.",
}
@Article{Durand:1986:FMS,
author = "Charles Durand",
title = "Forward Multidimensional Search with Applications to
Information Retrieval",
journal = j-TODS,
volume = "??",
number = "??",
pages = "??--??",
month = sep,
year = "1986",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Dec 10 12:51:25 1996",
bibsource = "Database/Wiederhold.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Submitted.",
fjournal = "ACM Transactions on Database Systems",
xxnote = "This paper does not seem to be published in TODS.",
}
@Article{Spyratos:1987:PMD,
author = "Nicolas Spyratos",
title = "The partition model: a deductive database model",
journal = j-TODS,
volume = "12",
number = "1",
pages = "1--37",
month = mar,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: Institut National de la
Recherche en Informatique et Automatique, TR-286, Apr.
1983.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-1/p1-spyratos/p1-spyratos.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-1/p1-spyratos/;
http://www.acm.org/pubs/toc/Abstracts/tods/22718.html",
abstract = "We present a new database model in which each
attribute is modeled by a family of disjoint subsets of
an underlying population of objects. Such a family is
called a partitioning, and the set of all partitionings
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:\par
(1) syntactic simplicity (essentially that of the
relational model),\par
(2) powerful means for the specification of semantic
information (in the form of lattice equations), and
\par
(3) deductive capability (essentially that of set
theory).\par
The relational model of data and the basic constructs
of semantic modeling can be embedded into our model in
a simple and straightforward manner.",
acknowledgement = ack-nhfb,
affiliation = "Univ de Paris-Sud, Orsay, Fr",
affiliationaddress = "Univ de Paris-Sud, Orsay, Fr",
annote = "Type hierarchies and lattices.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Theory",
keywords = "database semantics; database systems; deductive
database model; partition model; theory",
subject = "{\bf F.3.2}: Theory of Computation, LOGICS AND
MEANINGS OF PROGRAMS, Semantics of Programming
Languages, Algebraic approaches to semantics. {\bf
H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models.",
}
@Article{Wu:1987:ASM,
author = "C. T. Wu and Walter A. Burkhard",
title = "Associative Searching in Multiple Storage Units",
journal = j-TODS,
volume = "12",
number = "1",
pages = "38--64",
month = mar,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Discusses interpolation hashing, a multidimensional
variant of linear hashing.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-1/p38-wu/p38-wu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-1/p38-wu/;
http://www.acm.org/pubs/toc/Abstracts/tods/12048.html",
abstract = "A file maintenance model, called the multiple random
access storage units model, is introduced. Storage
units can be accessed simultaneously, and the parallel
processing of an associative query is achieved by
distributing data evenly among the storage units.
Maximum parallelism is obtained when data satisfying an
associative query are evenly distributed for every
possible query. An allocation scheme called $M$-cycle
allocation is proposed to maintain large files of data
on multiple random access storage units. The allocation
scheme provides an efficient and straightforward
indexing over multidimensional key spaces and supports
the parallel processing of orthogonal range queries.
Our analysis shows that $M$-cycle allocation achieves
the near-optimum parallelism for processing the
orthogonal range queries. Moreover, there is no
duplication of records and no increase in
insertion\slash deletion cost.",
acknowledgement = ack-nhfb,
affiliation = "Univ of California, San Diego, CA, USA",
affiliationaddress = "Univ of California, San Diego, CA, USA",
classification = "723; 903",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Theory",
keywords = "associative searching; data processing --- file
organization; database systems; design; file
maintenance model; information science --- information
retrieval; multiple storage units; performance; random
access, algorithms; theory",
subject = "{\bf E.5}: Data, FILES. {\bf E.1}: Data, DATA
STRUCTURES. {\bf H.2.2}: Information Systems, DATABASE
MANAGEMENT, Physical Design.",
}
@Article{Lomet:1987:PEF,
author = "David B. Lomet",
title = "Partial Expansions for File Organizations with an
Index",
journal = j-TODS,
volume = "12",
number = "1",
pages = "65--84",
month = mar,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-1/p65-lomet/p65-lomet.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-1/p65-lomet/;
http://www.acm.org/pubs/toc/Abstracts/tods/12049.html",
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.",
acknowledgement = ack-nhfb,
affiliation = "Wang Inst of Graduate Studies, Tyngboro, MA, USA",
affiliationaddress = "Wang Inst of Graduate Studies, Tyngboro, MA,
USA",
annote = "a way to increase file space with substantial
improvement in file utilization elastic buckets come in
a number of sizes.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
keywords = "data processing; database systems; File Organization;
FILE UTILIZATION; INSERTION COST; PARTIAL EXPANSIONS",
subject = "{\bf D.4.3}: Software, OPERATING SYSTEMS, File Systems
Management, Access methods. {\bf D.4.3}: Software,
OPERATING SYSTEMS, File Systems Management, File
organization. {\bf H.2.2}: Information Systems,
DATABASE MANAGEMENT, Physical Design, Access methods.
{\bf H.3.2}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Storage, File
organization.",
}
@Article{Fedorowicz:1987:DPE,
author = "Jane Fedorowicz",
title = "Database Performance Evaluation in an Indexed File
Environment",
journal = j-TODS,
volume = "12",
number = "1",
pages = "85--110",
month = mar,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-1/p85-fedorowicz/p85-fedorowicz.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-1/p85-fedorowicz/;
http://www.acm.org/pubs/toc/Abstracts/tods/13675.html",
abstract = "The use of database systems for managerial decision
making often incorporates information-retrieval
capabilities with numeric report generation. Of great
concern to the user of such a system is the response
time associated with issuing a query to the database.
This study presents a procedure for estimating response
time for one of the most frequently encountered
physical storage mechanisms, the indexed file. The
model provides a fairly high degree of accuracy, but is
simple enough so that the cost of applying the model is
not exorbitant. The model incorporates the knowledge
that the distribution of access key occurrences is
known to follow Zipf's law. It first estimates the
access time required to complete the query, which
includes the time needed for all input and output
transactions, and CPU time used in performing the
search. The effects of multiple users on an
individual's response time are then assessed using a
simple regression estimation technique. The two-step
procedure allows for the separation of access time from
multiuser influences.",
acknowledgement = ack-nhfb,
affiliation = "Boston Univ, Boston, MA, USA",
affiliationaddress = "Boston Univ, Boston, MA, USA",
annote = "a procedure for estimating response time; distribution
of access key occurrences follow Zipf's law. Early
version with Kellogg, J. L. Model provides a fairly
high degree of accuracy but is simple. The effects of
multiple users are assessed using simple regression
estimation.",
classification = "723; 912; 922",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Performance",
keywords = "data processing --- File organization; database
performance; database systems; indexed file
environment; MANAGEMENT --- Information Systems;
multiple users, design; Performance; performance;
response time; statistical methods --- regression
analysis; Zipf's law",
subject = "{\bf D.4.3}: Software, OPERATING SYSTEMS, File Systems
Management, File organization. {\bf H.2.2}: Information
Systems, DATABASE MANAGEMENT, Physical Design, Access
methods. {\bf H.3.2}: Information Systems, INFORMATION
STORAGE AND RETRIEVAL, Information Storage, File
organization. {\bf H.3.3}: Information Systems,
INFORMATION STORAGE AND RETRIEVAL, Information Search
and Retrieval, Retrieval models.",
}
@Article{Ozsoyoglu:1987:NNF,
author = "Z. Meral {\"O}zsoyo{\u{g}}lu and Li-Yan Yuan",
title = "A New Normal Form for Nested Relations",
journal = j-TODS,
volume = "12",
number = "1",
pages = "111--136",
month = mar,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "886 100",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-1/p111-ozsoyoglu/p111-ozsoyoglu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-1/p111-ozsoyoglu/;
http://www.acm.org/pubs/toc/Abstracts/tods/13676.html",
abstract = "We consider nested relations whose schemes are
structured as trees, called scheme trees, and introduce
a normal form for such relations, called the nested
normal form. Given a set of attributes $U$, and a set
of multivalued dependencies (MVDs) $M$ over these
attributes, we present an algorithm to obtain a nested
normal form decomposition of $U$ with respect to $M$.
Such a decomposition has several desirable properties,
such as explicitly representing a set of full and
embedded MVDs implied by $M$, and being a faithful and
nonredundant representation of $U$. Moreover, if the
given set of MVDs is conflict-free, then the nested
normal form decomposition is also
dependency-preserving. Finally, we show that if $M$ is
conflict-free, then the set of root-to-leaf paths of
scheme trees in nested normal form decomposition is
precisely the unique 4NF decomposition $[9,16]$ of $U$
with respect to $M$.",
acknowledgement = ack-nhfb,
affiliation = "Case Western Reserve Univ, Cleveland, OH, USA",
affiliationaddress = "Case Western Reserve Univ, Cleveland, OH, USA",
annote = "non-first normal form.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Theory",
keywords = "data processing; data structures; database systems ---
design; decomposition, algorithms; design; multivalued
dependency; nested relations; normal form; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Normal
forms.",
}
@Article{Christodoulakis:1987:ARP,
author = "Stavros Christodoulakis",
title = "Analysis of Retrieval Performance for Records and
Objects using Optical Disk Technology",
journal = j-TODS,
volume = "12",
number = "2",
pages = "137--169",
month = jun,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-2/p137-christodoulakis/p137-christodoulakis.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-2/p137-christodoulakis/;
http://www.acm.org/pubs/toc/Abstracts/tods/23015.html",
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 the
components of an object are stored consecutively in
storage to speed-up 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 stored on an optical disk
device. We then provide {\em exact\/} and {\em
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 database
organizations for optical disks. The results involve
probability distribution of block accesses, probability
distributions of span accesses, and probability
distribution of seek times. Record retrieval is an
important special case. This analysis differs from
similar ones in database environments in the following
respects: (1) the 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 in a given position, information can be read
from a number of consecutive tracks (span) with a small
additional cost).",
acknowledgement = ack-nhfb,
affiliation = "Univ of Waterloo, Waterloo, Ont, Can",
affiliationaddress = "Univ of Waterloo, Waterloo, Ont, Can",
classification = "723; 741; 903",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Measurement; Performance; Theory",
keywords = "data storage, optical --- storage devices; information
retrieval; information science; optical disk
technology, measurement; performance; retrieval
performance; theory",
subject = "{\bf C.4}: Computer Systems Organization, PERFORMANCE
OF SYSTEMS, Modeling techniques. {\bf D.4.3}: Software,
OPERATING SYSTEMS, File Systems Management, File
organization.",
}
@Article{Herlihy:1987:DQA,
author = "Maurice Herlihy",
title = "Dynamic Quorum Adjustment for Partitioned Data",
journal = j-TODS,
volume = "12",
number = "2",
pages = "170--194",
month = jun,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-2/p170-herlihy/p170-herlihy.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-2/p170-herlihy/;
http://www.acm.org/pubs/toc/Abstracts/tods/22953.html",
abstract = "A partition occurs when functioning sites in a
distributed system are unable to communicate. This
paper introduces a new method for managing replicated
data objects in the presence of partitions. Each
operation provided by a replicated object has a set of
quorums, which are sets of sites whose cooperation
suffices to execute the operation. The method permits
an object's quorums to be adjusted dynamically in
response to failures and recoveries. A transaction that
is unable to progress using one set of quorums may
switch to another, more favorable set, and transactions
in different partitions may progress using different
sets. This method has three novel aspects: (1) it
supports a wider range of quorums than earlier
proposals, (2) it scales up effectively to large
systems because quorum adjustments do not require
global reconfiguration, and (3) it systematically
exploits the semantics of typed objects to support more
flexible quorum adjustment.",
acknowledgement = ack-nhfb,
affiliation = "Carnegie-Mellon Univ, Pittsburgh, PA, USA",
affiliationaddress = "Carnegie-Mellon Univ, Pittsburgh, PA, USA",
annote = "Each operation provided by a replicated object has a
set of quorums, sites whose cooperation suffices to
execute the operation.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Reliability",
keywords = "computer systems, digital --- distributed; database
systems; distributed; dynamic quorum adjustment;
languages; partitioned data, algorithms; reliability",
subject = "{\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language
Constructs and Features, Abstract data types. {\bf
D.4.3}: Software, OPERATING SYSTEMS, File Systems
Management, Distributed file systems. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Distributed systems. {\bf D.3.3}: Software, PROGRAMMING
LANGUAGES, Language Constructs and Features, Data types
and structures. {\bf D.4.5}: Software, OPERATING
SYSTEMS, Reliability, Fault-tolerance. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Transaction processing.",
}
@Article{Ellis:1987:CLH,
author = "Carla Schlatter Ellis",
title = "Concurrency in Linear Hashing",
journal = j-TODS,
volume = "12",
number = "2",
pages = "195--217",
month = jun,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in \cite{ACM:1985:PFA}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-2/p195-ellis/p195-ellis.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-2/p195-ellis/;
http://www.acm.org/pubs/toc/Abstracts/tods/22954.html",
abstract = "Concurrent access to complex shared data structures,
particularly structures useful as database indices, has
long been of interest in the database community. In
dynamic databases, tree structures such as B-trees have
been used as indices because of their ability to handle
growth; whereas hashing has been used for fast access
in relatively static databases. Recently, a number of
techniques for dynamic hashing have appeared. They
address the major deficiency of traditional hashing
when applied to databases that experience significant
change in the amount of data being stored. This paper
presents a solution that allows concurrency in one of
these dynamic hashing data structures, namely linear
hash files. The solution is based on locking protocols
and minor modifications in the data structures.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Rochester, USA",
affiliationaddress = "Univ of Rochester, USA",
annote = "Searching can proceed in parallel with splits. Also
discusses distributed access.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms",
keywords = "complex shared data structures, algorithms; concurrent
access; data processing; Data Structures; database
systems; linear hashing",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Concurrency. {\bf D.4.1}: Software, OPERATING
SYSTEMS, Process Management,
Multiprocessing/multiprogramming. {\bf E.1}: Data, DATA
STRUCTURES. {\bf H.2.2}: Information Systems, DATABASE
MANAGEMENT, Physical Design. {\bf H.3.2}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Information
Storage, File organization.",
}
@Article{Valduriez:1987:JI,
author = "Patrick Valduriez",
title = "Join Indices",
journal = j-TODS,
volume = "12",
number = "2",
pages = "218--246",
month = jun,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/database.bib;
Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Compares join indices with inverted indices, clustered
indices, B+ trees, linked lists, and hybrid hash
techniques.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-2/p218-valduriez/p218-valduriez.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-2/p218-valduriez/;
http://www.acm.org/pubs/toc/Abstracts/tods/22955.html",
abstract = "In new application areas of relational database
systems, such as artificial intelligence, the join
operator is used more extensively than in conventional
applications. In this paper, we propose a simple data
structure, called a join index, for improving the
performance of joins in the context of complex queries.
For most of the joins, updates to join indices incur
very little overhead. Some properties of a join index
are (i) its efficient use of memory and adaptiveness to
parallel execution, (ii) its compatibility with other
operations (including select and union), (iii) its
support for abstract data type join predicates, (iv)
its support for multirelation clustering, and (v) its
use in representing directed graphs and in evaluating
recursive queries. Finally, the analysis of the join
algorithm using join indices shows its excellent
performance.",
acknowledgement = ack-nhfb,
affiliation = "Microelectronics \& Computer Technology Corp, Austin,
TX, USA",
affiliationaddress = "Microelectronics \& Computer Technology Corp,
Austin, TX, USA",
annote = "arrays of combined indices are maintained to
precompute joins among tuples. The technique is very
similar to that implemented as ADABAS correlators.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "abstract data types; computer programming ---
Algorithms; data processing --- Data Structures;
database systems; design; join algorithm, including
semi-join join index with rid list from selection index
TODS, algorithms; JOIN index; multirelation clustering;
performance; Relational",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf E.1}: Data, DATA
STRUCTURES, Trees. {\bf E.5}: Data, FILES,
Organization/structure. {\bf H.2.2}: Information
Systems, DATABASE MANAGEMENT, Physical Design, Access
methods. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Query processing. {\bf H.3.1}:
Information Systems, INFORMATION STORAGE AND RETRIEVAL,
Content Analysis and Indexing, Indexing methods.",
}
@Article{Snodgrass:1987:TQL,
author = "Richard Snodgrass",
title = "The {Temporal Query Language TQUEL}",
journal = j-TODS,
volume = "12",
number = "2",
pages = "247--298",
month = jun,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-2/p247-snodgrass/p247-snodgrass.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-2/p247-snodgrass/;
http://www.acm.org/pubs/toc/Abstracts/tods/22956.html",
abstract = "Recently, attention has been focused on {\em temporal
databases}, representing an enterprise over time. We
have developed a new language, {\em Tquel}, to query a
temporal database. TQuel was designed to be a minimal
extension, both syntactically and semantically, of
Quel, the query language in the Ingres relational
database management system. This paper discusses the
language informally, then provides a tuple relational
calculus semantics for the TQuel statements that differ
from their Quel counterparts, including the
modification statements. The three additional temporal
constructs defined in Tquel are shown to be direct
semantic analogues of Quel's where clause and target
list. We also discuss reducibility of the semantics to
Quel's semantics when applied to a static database.
TQuel is compared with ten other query languages
supporting time.",
acmcrnumber = "8712-1006",
affiliation = "Univ of North Carolina, Chapel Hill, NC, USA",
affiliationaddress = "Univ of North Carolina, Chapel Hill, NC, USA",
annote = "Describes extensions to Quel to handle temporal
queries. Three kinds of temporal information are
handled: `Transaction time', when information was
stored in the database, `valid time' when the stored
info models reality, and `user-defined time' explicitly
stored by user in the database.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages; Theory",
keywords = "computer programming languages; database systems;
relational calculus; temporal databases; temporal query
language; theory; TQUEL; tuple calculus, languages",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.7}: Information
Systems, DATABASE MANAGEMENT, Database Administration,
Logging and recovery. {\bf H.2.3}: Information Systems,
DATABASE MANAGEMENT, Languages, Query languages. {\bf
H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, TQUEL.",
}
@Article{Wong:1987:MIR,
author = "S. K. M. Wong and W. Ziarko and V. V. Raghavan and P.
C. N. Wong",
title = "On Modeling of Information Retrieval Concepts in
Vector Spaces",
journal = j-TODS,
volume = "12",
number = "2",
pages = "299--321",
month = jun,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-2/p299-wong/p299-wong.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-2/p299-wong/;
http://www.acm.org/pubs/toc/Abstracts/tods/22957.html",
abstract = "The Vector Space Model (VSM) has been adopted in
information retrieval as a means of coping with inexact
representation of documents and queries, and the
resulting difficulties in determining the relevance of
a document relative to a given query. The major problem
in employing this approach is that the explicit
representation of term vectors is not known a priori.
Consequently, earlier researchers made the assumption
that the vectors corresponding to terms are pairwise
orthogonal. Such an assumption is clearly unrealistic.
Although attempts have been made to compensate for this
assumption by some separate, corrective steps, such
methods are ad hoc and, in most cases, formally
inconsistent.\par
In this paper, a generalization of the VSM, called the
GVSM, is advanced. The developments provide a solution
not only for the computation of a measure of similarity
(correlation) between terms, but also for the
incorporation of these similarities into the retrieval
process.\par
The major strength of the GVSM derives from the fact
that it is theoretically sound and elegant.
Furthermore, experimental evaluation of the model on
several test collections indicates that the performance
is better than that of the VSM. Experiments have been
performed on some variations of the GVSM, and all these
results have also been compared to those of the VSM,
based on inverse document frequency weighting. These
results and some ideas for the efficient implementation
of the GVSM are discussed.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Regina, Regina, Sask, Can",
affiliationaddress = "Univ of Regina, Regina, Sask, Can",
annote = "The space for both documents and queries is an
n-dimensional vector space. In GVSM, terms are not
assumed to be linearly independent; measure of
independence is based on the number of common
documents.",
classification = "723; 903",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Experimentation; Languages; Theory",
keywords = "document representation; experimentation; generalized
vector space; Information Retrieval; information
retrieval systems --- Mathematical Models; information
science; languages; query representation, design;
theory",
subject = "{\bf H.3.3}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Search and Retrieval,
Retrieval models. {\bf H.3.1}: Information Systems,
INFORMATION STORAGE AND RETRIEVAL, Content Analysis and
Indexing, Thesauruses. {\bf H.3.1}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Content
Analysis and Indexing, Indexing methods. {\bf H.3.3}:
Information Systems, INFORMATION STORAGE AND RETRIEVAL,
Information Search and Retrieval.",
}
@Article{Rybinski:1987:FOL,
author = "Henryk Rybi{\'n}ski",
title = "On First-Order-Logic Databases",
journal = j-TODS,
volume = "12",
number = "3",
pages = "325--349",
month = sep,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15 (03B70)",
MRnumber = "88j:68033",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-3/p325-rybinski/p325-rybinski.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-3/p325-rybinski/;
http://www.acm.org/pubs/toc/Abstracts/tods/27630.html",
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,'' {\em J. ACM 29\/} ,2 (Apr.
1982), 310-332) are avoided.",
acknowledgement = ack-nhfb,
annote = "Successor of Jacobs's work. Language Ld can specify
constraints for any database type, which can then be
`translated' to a particular database domain.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Theory",
keywords = "computer metatheory --- formal logic; database logic;
design; first-order logic; hierarchical databases;
languages; network databases; relational databases;
theory, database systems",
review = "ACM Computing Reviews, Jan 1989",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Data
manipulation languages (DML). {\bf F.4.1}: Theory of
Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
Mathematical Logic. {\bf I.2.4}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge
Representation Formalisms and Methods, Predicate
logic.",
}
@Article{Stonebraker:1987:EDS,
author = "Michael Stonebraker and Jeff Anton and Eric Hanson",
title = "Extending a Database System with Procedures",
journal = j-TODS,
volume = "12",
number = "3",
pages = "350--376",
month = sep,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: UCB/ERL memo M85/59, 1985.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-3/p350-stonebraker/p350-stonebraker.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-3/p350-stonebraker/;
http://www.acm.org/pubs/toc/Abstracts/tods/27631.html",
abstract = "This paper suggests 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.
\par
In order to implement this construct, extensions to a
typical relational query language must be made, and
considerable work on the execution engine of 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.",
acknowledgement = ack-nhfb,
annote = "Stored procedures follow DBTG suggestions from 1971.
The INGRES+ results were `competitive'.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design",
keywords = "database procedures, design; database systems;
object-oriented systems; relational query language;
semantic data models",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Query processing.",
}
@Article{Ozsoyoglu:1987:RMM,
author = "Z. Meral {\"O}zsoyo{\u{g}}lu and Li-Yan Yuan",
title = "Reduced {MVDs} and Minimal Covers",
journal = j-TODS,
volume = "12",
number = "3",
pages = "377--394",
month = sep,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "88h:68017",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1987-12-3/p377-ozsoyoolu/;
http://www.acm.org/pubs/toc/Abstracts/tods/214286.html",
abstract = "Multivalued dependencies (MVDs) are data dependencies
that appear frequently in the ``real world'' and play
an important role in designing relational database
schemes. Given a set of MVDs to constrain a database
scheme, it is desirable to obtain an equivalent set of
MVDs that do not have any redundancies. In this paper
we define such a set of MVDs, called reduced MVDs, and
present an algorithm to obtain reduced MVDs. We also
define a minimal cover of a set of MVDs, which is a set
of reduced MVDs, and give an efficient method to find
such a minimal cover. The significance and properties
of reduced MVDs are also discussed in the context of
database design (e.g., 4NF decomposition) and
conflict-free MVDs.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Theory",
keywords = "algorithms; computer programming --- algorithms;
database schema design; database systems; design;
minimal covers; multivalued dependencies; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Normal
forms.",
}
@Article{Faloutsos:1987:OSE,
author = "Christos Faloutsos and Stavros Christodoulakis",
title = "Optimal Signature Extraction and Information Loss",
journal = j-TODS,
volume = "12",
number = "3",
pages = "395--428",
month = sep,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-3/p395-faloutsos/p395-faloutsos.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-3/p395-faloutsos/;
http://www.acm.org/pubs/toc/Abstracts/tods/214285.html",
abstract = "Signature files seem to be a promising access method
for text and attributes. According to this method, the
documents (or records) are stored sequentially in one
file (``text file''), while abstractions of the
documents (``signatures'') are stored sequentially in
another file (``signature file''). In order to resolve
a query, the signature file is scanned first, and many
nonqualifying documents are immediately rejected. We
develop a framework that includes primary key hashing,
multiattribute hashing, and signature files. Our effort
is to find the optimal signature extraction method.
\par
The main contribution of this paper is that we present
optimal and efficient suboptimal algorithms for
assigning words to signatures in several environments.
Another contribution is that we use information theory,
and study the relationship of the false drop
probability $F_d$ and the information that is lost
during signature extraction. We give tight lower bounds
on the achievable $F_d$ and show that a simple
relationship holds between the two quantities in the
case of optimal signature extraction with uniform
occurrence and query frequencies. We examine hashing as
a method to map words to signatures (instead of the
optimal way), and show that the same relationship holds
between $F_d$ and {\em loss}, indicating that an
invariant may exist between these two quantities for
every signature extraction method.",
acknowledgement = ack-nhfb,
annote = "superimposed coding",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Performance",
keywords = "data processing; database systems; information loss;
optimal signature extraction; performance; signature
files, design",
subject = "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Access methods. {\bf E.4}: Data,
CODING AND INFORMATION THEORY, Data compaction and
compression. {\bf E.5}: Data, FILES. {\bf H.3.2}:
Information Systems, INFORMATION STORAGE AND RETRIEVAL,
Information Storage, File organization.",
}
@Article{Ibaraki:1987:SC,
author = "Toshihide Ibaraki and Tiko Kameda and Toshimi
Minoura",
title = "Serializability with Constraints",
journal = j-TODS,
volume = "12",
number = "3",
pages = "429--452",
month = sep,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "909 139",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-3/p429-ibaraki/p429-ibaraki.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-3/p429-ibaraki/;
http://www.acm.org/pubs/toc/Abstracts/tods/214284.html",
abstract = "This paper deals with the serializability theory for
single-version and multiversion database systems. We
first introduce the concept of {\em disjoint-interval
topological sort\/} ({\em DITS}, for short) of an
arc-labeled directed acyclic graph. It is shown that a
history is serializable if and only if its {\em
transaction IO graph\/} has a DITS. We then define
several subclasses of serializable histories, based on
the constraints imposed by write-write, write-read,
read-write, or read-read conflicts, and investigate
inclusion relationships among them. In terms of DITS,
we give a sufficient condition for a class of
serializable histories to be polynomially recognizable,
which is then used to show that a new class of
histories, named WRW, can be recognized in polynomial
time. We also present NP-completeness results for the
problem of testing membership in some other classes.
\par
In the second half of this paper, we extend these
results to multiversion database systems. The inclusion
relationships among multiversion classes defined by
constraints, such as write-write and write-read, are
investigated. One such class coincides with class
DMVSR, introduced by Papadimitriou and Kanellakis, and
gives a simple characterization of this class. It is
shown that for most constraints, multiversion classes
properly contain the corresponding single-version
classes. Complexity results for the membership testing
are also discussed.",
acknowledgement = ack-nhfb,
annote = "classification and properties of conflict graphs, with
and without versions.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Theory",
keywords = "computer systems programming --- sorting; concurrency
control; database systems; disjoint-interval
topological sort, algorithms; serializability; theory",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing.",
}
@Article{Wolfson:1987:OLC,
author = "Ouri Wolfson",
title = "The Overhead of Locking (and Commit) Protocols in
Distributed Databases",
journal = j-TODS,
volume = "12",
number = "3",
pages = "453--471",
month = sep,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-3/p453-wolfson/p453-wolfson.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-3/p453-wolfson/;
http://www.acm.org/pubs/toc/Abstracts/tods/28053.html",
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 order to guarantee
atomicity. Therefore, the combined overhead of each
locking protocol and the two-phase commit protocol is
also determined.",
acknowledgement = ack-nhfb,
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Measurement; Performance; Theory",
keywords = "commit protocols; computer networks --- protocols;
concurrency control, algorithms; database systems;
locking protocols; measurement; message passing;
performance; theory",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Concurrency. {\bf C.4}: Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf C.2.4}:
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Distributed Systems, Distributed databases.
{\bf D.2.8}: Software, SOFTWARE ENGINEERING, Metrics,
Performance measures. {\bf H.2.2}: Information Systems,
DATABASE MANAGEMENT, Physical Design. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Transaction processing.",
}
@Article{Su:1987:CBD,
author = "Stanley Y. W. Su and Jozo Dujmovic and D. S. Batory
and S. B. Navathe and Richard Elnicki",
title = "A Cost-Benefit Decision Model: Analysis, Comparison,
and Selection of Data Management Systems",
journal = j-TODS,
volume = "12",
number = "3",
pages = "472--520",
month = sep,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-3/p472-su/p472-su.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-3/p472-su/;
http://www.acm.org/pubs/toc/Abstracts/tods/33403.html",
abstract = "This paper describes a general cost-benefit decision
model that is applicable to the evaluation, comparison,
and selection of alternative products with a
multiplicity of features, such as complex computer
systems. The application of this model is explained and
illustrated using the selection of data management
systems as an example.\par
The model has the following features: (1) it is
mathematically based on an extended continuous logic
and a theory of complex criteria; (2) the
decision-making procedure is very general yet
systematic, well-structured, and quantitative; (3) the
technique is based on a comprehensive cost analysis and
an elaborate analysis of benefits expressed in terms of
the decision maker's preferences. The decision
methodology, when applied to the problem of selecting a
data management system, takes into consideration the
life cycle of a DMS and the objectives and goals for
the new systems under evaluation. It allows the cost
and preference analyses to be carried out separately
using two different models. The model for preference
analysis makes use of comprehensive performance (or
preference) parameters and allows what we call a
``logic scoring of preferences'' using continuous
values between zero and one, to express the degree with
which candidate systems satisfy stated requirements. It
aggregates preference parameters based on their
relative weights and logical relationships to compute a
global performance (preference) score for each system.
The cost model incorporates an aggregation of costs
which may be estimated over different time horizons and
discounted at appropriate discount rates. A procedure
to establish an overall ranking of alternative systems
based on their global preference scores and global
costs is also discussed.",
acknowledgement = ack-nhfb,
annote = "The LPS model results from a NBS study. Preference
scoring, facility costs.",
classification = "723; 921",
fjournal = "ACM Transactions on Database Systems",
keywords = "cost-benefit decision model; data management systems,
SYWSU TODS; database systems; mathematical models",
subject = "{\bf H.2.7}: Information Systems, DATABASE MANAGEMENT,
Database Administration. {\bf K.6.3}: Computing
Milieux, MANAGEMENT OF COMPUTING AND INFORMATION
SYSTEMS, Software Management. {\bf D.2.9}: Software,
SOFTWARE ENGINEERING, Management, Cost estimation.",
}
@Article{Keller:1987:CBS,
author = "Arthur M. Keller",
title = "Comment on {Bancilhon} and {Spyratos}' {``Update
semantics and relational views''}",
journal = j-TODS,
volume = "12",
number = "3",
pages = "521--523",
month = sep,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "See \cite{Bancilhon:1981:USR}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-3/p521-keller/p521-keller.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-3/p521-keller/;
http://www.acm.org/pubs/toc/Abstracts/tods/214296.html",
acknowledgement = ack-nhfb,
annote = "a small relaxation of constraints increases the
feasibility of view update",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Theory",
keywords = "design; theory",
subject = "{\bf H.3.3}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Search and Retrieval,
Retrieval models. {\bf H.2.1}: Information Systems,
DATABASE MANAGEMENT, Logical Design, Data models.",
}
@Article{Abiteboul:1987:IFS,
author = "Serge Abiteboul and Richard Hull",
title = "{IFO}: {A} Formal Semantic Database Model",
journal = j-TODS,
volume = "12",
number = "4",
pages = "525--565",
month = dec,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "88i:68017",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/; Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: ACM SIGACT-SIGMOD Symp. on
Principles of Database Systems, 1984 (short version).
Also published in/as: USC CSD, TR-84-304, Apr. 1984.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-4/p525-abiteboul/p525-abiteboul.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-4/p525-abiteboul/;
http://www.acm.org/pubs/toc/Abstracts/tods/32205.html",
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.",
acknowledgement = ack-nhfb,
annote = "A graph-based formal semantic database model. Well
written. The model appears to be well founded.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Theory; Verification",
keywords = "algorithms; design; theory; verification",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf I.2.4}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge
Representation Formalisms and Methods, Semantic
networks.",
}
@Article{Ozsoyoglu:1987:ERA,
author = "G. {\"O}zsoyo{\u{g}}lu and Z. M. {\"O}zsoyo{\u{g}}lu
and V. Matos",
title = "Extending Relational Algebra and Relational Calculus
with Set-Valued Attributes and Aggregate Functions",
journal = j-TODS,
volume = "12",
number = "4",
pages = "566--592",
month = dec,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "920 253",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-4/p566-ozsoyoglu/p566-ozsoyoglu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-4/p566-ozsoyoglu/;
http://www.acm.org/pubs/toc/Abstracts/tods/32219.html",
abstract = "In commercial network 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.\par
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 expressive power of
the extended languages is shown to be equivalent. We
extend the relational algebra with three new operators,
namely, pack, unpack, and aggregation-by-template. The
extended languages form a theoretical framework for
statistical database query languages.",
acknowledgement = ack-nhfb,
annote = "Nested relations.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Theory; Verification",
keywords = "algorithms; languages; theory; verification;
{\"O}zsoyo{\u{g}}lu Nested NF2 TODS",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages.",
}
@Article{Palley:1987:URM,
author = "Michael A. Palley and Jeffrey S. Simonoff",
title = "The Use of Regression Methodology for the Compromise
of Confidential Information in Statistical Databases",
journal = j-TODS,
volume = "12",
number = "4",
pages = "593--608",
month = dec,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-4/p593-palley/p593-palley.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-4/p593-palley/;
http://www.acm.org/pubs/toc/Abstracts/tods/42174.html",
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 ineffective
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.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Legal Aspects; Management; Security",
keywords = "legalaspects; management; security, security TODS",
subject = "{\bf H.2.7}: Information Systems, DATABASE MANAGEMENT,
Database Administration. {\bf H.2.8}: Information
Systems, DATABASE MANAGEMENT, Database applications.
{\bf K.4.1}: Computing Milieux, COMPUTERS AND SOCIETY,
Public Policy Issues, Privacy. {\bf K.6.m}: Computing
Milieux, MANAGEMENT OF COMPUTING AND INFORMATION
SYSTEMS, Miscellaneous, Security*. {\bf H.2.0}:
Information Systems, DATABASE MANAGEMENT, General,
Security, integrity, and protection. {\bf G.3}:
Mathematics of Computing, PROBABILITY AND STATISTICS,
Statistical computing.",
}
@Article{Agrawal:1987:CCP,
author = "Rakesh Agrawal and Michael J. Carey and Miron Livny",
title = "Concurrency Control Performance Modeling: Alternatives
and Implications",
journal = j-TODS,
volume = "12",
number = "4",
pages = "609--654",
month = dec,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/; Misc/real.time.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: ACM SIGMOD Conf. on the
Management of Data, 1985.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-4/p609-agrawal/p609-agrawal.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-4/p609-agrawal/;
http://www.acm.org/pubs/toc/Abstracts/tods/32220.html",
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 database
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.",
acknowledgement = ack-nhfb,
annote = "This paper is unique in that it studies the
implications of fundamental assumptions regarding
system resources, transactions restarts, and
predeclarations of writes. Essential reading.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Performance",
keywords = "performance",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Concurrency. {\bf D.4.8}: Software, OPERATING
SYSTEMS, Performance, Simulation. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Transaction processing. {\bf D.4.2}: Software,
OPERATING SYSTEMS, Storage Management.",
}
@Article{Sacks-Davis:1987:MAM,
author = "R. Sacks-Davis and A. Kent and K. Ramamohanarao",
title = "Multikey Access Methods Based on Superimposed Coding
Techniques",
journal = j-TODS,
volume = "12",
number = "4",
pages = "655--696",
month = dec,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1987-12-4/p655-sacks-davis/p655-sacks-davis.pdf;
http://www.acm.org/pubs/citations/journals/tods/1987-12-4/p655-sacks-davis/;
http://www.acm.org/pubs/toc/Abstracts/tods/32222.html",
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 shown 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 accrue
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.",
acknowledgement = ack-nhfb,
annote = "Expressions for the cost of a two-level and one-level
scheme.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design",
keywords = "descriptors; Design; hashing; partial match retrieval;
performance; record signatures; superimposed coding,
design",
subject = "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Access methods. {\bf H.3.2}:
Information Systems, INFORMATION STORAGE AND RETRIEVAL,
Information Storage, File organization. {\bf H.4.1}:
Information Systems, INFORMATION SYSTEMS APPLICATIONS,
Office Automation. {\bf I.7.m}: Computing
Methodologies, TEXT PROCESSING, Miscellaneous.",
}
@Article{Elhardt:1987:SQO,
author = "K. Elhardt",
title = "Support for Query Optimization by Optimal Predicate
Splitting",
journal = j-TODS,
volume = "??",
number = "??",
pages = "??--??",
month = mar,
year = "1987",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibsource = "Database/Wiederhold.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Accepted.",
fjournal = "ACM Transactions on Database Systems",
xxnote = "This paper does not seem to be published in TODS.",
}
@Article{Vianu:1988:DFO,
author = "Victor Vianu",
title = "A Dynamic Framework for Object Projection Views",
journal = j-TODS,
volume = "13",
number = "1",
pages = "1--22",
month = mar,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "933 215",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-1/p1-vianu/p1-vianu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-1/p1-vianu/;
http://www.acm.org/pubs/toc/Abstracts/tods/42202.html",
abstract = "User views in a relational database obtained through a
single projection ('projection views') are considered
in a new framework. Specifically, such views, where
each tuple in the view represents an object
('object-projection views'), are studied using the
dynamic relational model, which captures the evolution
of the database through consecutive updates. Attribute
sets that yield object-projection views are
characterized using the static and dynamic functional
dependencies satisfied by the database.
Object-projection views are then described using the
static and dynamic functional dependencies `inherited'
from the original database. Finally, the impact of
dynamic constraints on the view update problem is
studied in a limited context. This paper demonstrates
that new, useful information about views can be
obtained by looking at the evolution of the database as
captured by the dynamic relational model.",
acknowledgement = ack-nhfb,
affiliation = "Univ of California, San Diego, CA, USA",
affiliationaddress = "Univ of California, San Diego, CA, USA",
annote = "Assumes simplest translation to the underlying
database. Very restrictive unirelational database FDs
and DFDs, no exclusions or deletions. Technically very
good. Rejecting update object projections.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Management; Theory",
keywords = "database schema, design; database systems; dynamic
constraints; functional dependency; languages;
management; object projection views; relational;
theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Schema
and subschema. {\bf H.2.3}: Information Systems,
DATABASE MANAGEMENT, Languages, Data description
languages (DDL).",
}
@Article{Sellis:1988:MQO,
author = "Timos K. Sellis",
title = "Multiple-Query Optimization",
journal = j-TODS,
volume = "13",
number = "1",
pages = "23--52",
month = mar,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/database.bib;
Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-1/p23-sellis/p23-sellis.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-1/p23-sellis/;
http://www.acm.org/pubs/toc/Abstracts/tods/42203.html",
abstract = "Some recently proposed extensions to relational
database systems, as well as to deductive database
systems, require support for multiple-query processing.
For example, in a database system enhanced with
inference capabilities, a simple query involving a rule
with multiple definitions may expand to more than one
actual query that has to be run over the database. It
is an interesting problem then to come up with
algorithms that process these queries together instead
of one query at a time. The main motivation for
performing such an interquery optimization lies in the
fact that queries may share common data. We examine the
problem of multiple-query optimization in this paper.
The first major contribution of the paper is a
systematic look at the problem, along with the
presentation and analysis of algorithms that can be
used for multiple-query optimization. The second
contribution lies in the presentation of experimental
results. Our results show that using multiple-query
processing algorithms may reduce execution cost
considerably.",
acknowledgement = ack-nhfb,
affiliation = "Univ of California, Berkeley, CA, USA",
affiliationaddress = "Univ of California, Berkeley, CA, USA",
annote = "Two architectures: Interleaving the results of locally
optimal access plans or a global optimizer.
Experimental results, a decrease of 20-50 percent show
in I/O and CPU time. ---Sava-Segal.",
classification = "723; 921",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "common access paths; computer programming ---
algorithms; database systems; deductive databases;
heuristic methods, global query TODS, algorithms;
multiple-query optimization; optimization; performance;
Relational",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Data
models. {\bf I.2.8}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Problem Solving, Control
Methods, and Search, Heuristic methods. {\bf H.3.4}:
Information Systems, INFORMATION STORAGE AND RETRIEVAL,
Systems and Software.",
}
@Article{Shasha:1988:CSS,
author = "Dennis Shasha and Nathan Goodman",
title = "Concurrent Search Structure Algorithms",
journal = j-TODS,
volume = "13",
number = "1",
pages = "53--90",
month = mar,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-1/p53-shasha/p53-shasha.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-1/p53-shasha/;
http://www.acm.org/pubs/toc/Abstracts/tods/42204.html",
abstract = "A dictionary is an abstract data type supporting the
actions member, insert, and delete. A search structure
is a data structure used to implement a dictionary.
Examples include B trees, hash structures, and
unordered lists. Concurrent algorithms on search
structures can achieve more parallelism than standard
concurrency control methods would suggest, by
exploiting the fact that many different search
structure states represent one dictionary state. We
present a framework for verifying such algorithms and
for inventing new ones. We give several examples, one
of which exploits the structure of Banyan family
interconnection networks. We also discuss the
interaction between concurrency control and recovery as
applied to search structures.",
acknowledgement = ack-nhfb,
affiliation = "New York Univ, New York, NY, USA",
affiliationaddress = "New York Univ, New York, NY, USA",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "abstract data type; Banyan interconnection networks;
computer programming --- algorithms; concurrent
algorithms, algorithms; data processing; Data
Structures; design; dictionary; performance; search
structure",
subject = "{\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases. {\bf D.4.1}: Software, OPERATING
SYSTEMS, Process Management, Concurrency. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Distributed systems. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems, Transaction processing.",
}
@Article{Finkelstein:1988:PDD,
author = "S. J. Finkelstein and M. Schkolnick and P. Tiberio",
title = "Physical Database Design for Relational Databases",
journal = j-TODS,
volume = "13",
number = "1",
pages = "91--128",
month = mar,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: IBM Research Report No. RJ5034,
Nov. 1986, preprint IBM Aug. 1985.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-1/p91-finkelstein/p91-finkelstein.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-1/p91-finkelstein/;
http://www.acm.org/pubs/toc/Abstracts/tods/42205.html",
abstract = "This paper describes the concepts used in the
implementation of DBDSGN, an experimental physical
design tool for relational databases developed at the
IBM San Jose Research Laboratory. Given a workload for
System R (consisting of a set of SQL statements and
their execution frequencies), DBDSGN suggests physical
configurations for efficient performance. Each
configuration consists of a set of indices and an
ordering for each table. Workload statements are
evaluated only for atomic configurations of indices,
which have only one index per table. Costs for any
configuration can be obtained from those of the atomic
configurations. DBDSGN uses information supplied by the
System R optimizer both to determine which columns
might be worth indexing and to obtain estimates of the
cost of executing statements in different
configurations. The tool finds efficient solutions to
the index-selection problem; if we assume the cost
estimates supplied by the optimizer are the actual
execution costs, it finds the optimal solution.
Optionally, heuristics can be used to reduce execution
time. The approach taken by DBDSGN in solving the
index-selection problem for multiple-table statements
significantly reduces the complexity of the problem.
DBDSGN's principles were used in the Relational Design
Tool (RDT), an IBM product based on DBDSGN, which
performs design for SQL/DS, a relational system based
on System R. System R actually uses DBDSGN's suggested
solutions as the tool expects because cost estimates
and other necessary information can be obtained from
System R using a new SQL statement, the EXPLAIN
statement. This illustrates how a system can export a
model of its internal assumptions and behavior so that
other systems (such as tools) can share this model.",
acknowledgement = ack-nhfb,
affiliation = "IBM",
affiliationaddress = "IBM",
annote = "DBDSGN led to IBM RDT; input are relational tables and
a set of queries expected to be run; produces
specifications of indexes, clustered; it uses the
actual DBMS (SQL/DS) optimizer.",
classification = "723; 921",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Experimentation; Performance;
Theory",
keywords = "DBDSGN; design; experimentation; IBM DBDSGN tool TODS,
database systems; optimization; performance; physical
database design; relational; System R, algorithms;
theory",
subject = "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Access methods. {\bf D.4.8}: Software,
OPERATING SYSTEMS, Performance, Modeling and
prediction. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Query processing. {\bf E.1}: Data,
DATA STRUCTURES, Tables.",
}
@Article{Raju:1988:FFD,
author = "K. V. S. V. N. Raju and Arun K. Majumdar",
title = "Fuzzy Functional Dependencies and Lossless Join
Decomposition of Fuzzy Relational Database Systems",
journal = j-TODS,
volume = "13",
number = "2",
pages = "129--166",
month = jun,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-2/p129-raju/p129-raju.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-2/p129-raju/;
http://www.acm.org/pubs/toc/Abstracts/tods/42344.html",
abstract = "This paper deals with the application of fuzzy logic
in a relational database environment with the objective
of capturing more meaning of the data. It is shown that
with suitable interpretations for the fuzzy membership
functions, a fuzzy relational data model can be used to
represent ambiguities in data values as well as
impreciseness in the association among them. Relational
operators for fuzzy relations have been studied, and
applicability of fuzzy logic in capturing integrity
constraints has been investigated. By introducing a
fuzzy resemblance measure EQUAL for comparing domain
values, the definition of classical functional
dependency has been generalized to fuzzy functional
dependency (ffd). The implication problem of ffds has
been examined and a set of sound and complete inference
axioms has been proposed. Next, the problem of lossless
join decomposition of fuzzy relations for a given set
of fuzzy functional dependencies is investigated. It is
proved that with a suitable restriction on EQUAL, the
design theory of a classical relational database with
functional dependencies can be extended to fuzzy
relations satisfying fuzzy functional dependencies.",
acknowledgement = ack-nhfb,
affiliation = "Ahdhra Univ, Visakhapatnam, India",
affiliationaddress = "Ahdhra Univ, Visakhapatnam, India",
annote = "Extend Armstrong's axioms to fuzzy domains. The
concept works out theoretically, but may not
necessarily agree with the intuition of the database
user. This paper is highly theoretical and notationally
intimidating. Yet worth to peruse.",
classification = "723; 921",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Theory",
keywords = "database systems; fuzzy functional dependencies; fuzzy
relational database systems, design; lossless join
decomposition; mathematical techniques --- fuzzy sets;
relational; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design. {\bf E.5}: Data, FILES. {\bf I.2.3}:
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Deduction and Theorem Proving, Uncertainty, ``fuzzy,''
and probabilistic reasoning.",
}
@Article{Winslett:1988:MBA,
author = "Marianne Winslett",
title = "A Model-Based Approach to Updating Databases with
Incomplete Information",
journal = j-TODS,
volume = "13",
number = "2",
pages = "167--196",
month = jun,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/bibdb.bib;
Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-2/p167-winslett/p167-winslett.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-2/p167-winslett/;
http://www.acm.org/pubs/toc/Abstracts/tods/42386.html",
abstract = "Suppose one wishes to construct, use, and maintain a
database of facts about the real world, even though the
state of that world is only partially known. In the
artificial intelligence domain, this problem arises
when an agent has a base set of beliefs that reflect
partial knowledge about the world, and then tries to
incorporate new, possibly contradictory knowledge into
this set of beliefs. In the database domain, one facet
of this situation is the well-known null values
problem. We choose to represent such a database as a
logical theory, and view the models of the theory as
representing possible states of the world that are
consistent with all known information.\par
How can new information be incorporated into the
database? For example, given the new information that
``$b$ or $c$ is true,'' how can one get rid of all
outdated information about $b$ and $c$, add the new
information, and yet in the process not disturb any
other information in the database? In current-day
database management systems, the difficult and tedious
burden of determining exactly what to add and remove
from the database is placed on the user. The goal of
our research was to relieve users of that burden, by
equipping the database management system with update
algorithms that can automatically determine what to add
and remove from the database. \par
Under our approach, new information about the state of
the world is input to the database management system as
a well-formed formula that the state of the world is
now known to satisfy. We have constructed database
update algorithms to interpret this update formula and
incorporate the new information represented by the
formula into the database without further assistance
from the user. In this paper we show how to embed the
incomplete database and the incoming information in the
language of mathematical logic, explain the semantics
of our update operators, and discuss the algorithms
that implement these operators.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois, Urbana, IL, USA",
affiliationaddress = "Univ of Illinois, Urbana, IL, USA",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Human Factors; Languages; Theory",
keywords = "computer programming --- algorithms; database systems;
database updates; humanfactors; incomplete information;
languages; theory; uncertainty, algorithms; update
algorithms",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems. {\bf H.3.0}: Information Systems,
INFORMATION STORAGE AND RETRIEVAL, General. {\bf
H.3.3}: Information Systems, INFORMATION STORAGE AND
RETRIEVAL, Information Search and Retrieval, Retrieval
models. {\bf I.2.3}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Deduction and Theorem
Proving.",
}
@Article{Eich:1988:DCC,
author = "Margaret H. Eich and David L. Wells",
title = "Database Concurrency Control using Data Flow Graphs",
journal = j-TODS,
volume = "13",
number = "2",
pages = "197--227",
month = jun,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "943 408",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-2/p197-eich/p197-eich.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-2/p197-eich/;
http://www.acm.org/pubs/toc/Abstracts/tods/42345.html",
abstract = "A specialized data flow graph, {\em Database Flow
Graph\/} ({\em DBFG\/}) is introduced. DBFGs may be
used for scheduling database operations, particularly
in an MIMD database machine environment. A DBFG
explicitly maintains intertransaction and
intratransaction dependencies, and is constructed from
the Transaction Flow Graphs (TFG) of active
transactions. A TFG, in turn, is the generalization of
a query tree used, for example, in DIRECT [15].
\par
All DBFG schedules are serializable and deadlock free.
Operations needed to create and maintain the DBFG
structure as transactions are added or removed from the
system are discussed. Simulation results show that DBFG
scheduling performs as well as two-phase locking.",
acknowledgement = ack-nhfb,
affiliation = "Southern Methodist Univ, Dallas, TX, USA",
affiliationaddress = "Southern Methodist Univ, Dallas, TX, USA",
classification = "723; 921",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "data flow graphs; database concurrency control;
database systems; deadlock, algorithms; distributed;
mathematical techniques --- graph theory; performance;
serializability",
subject = "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Deadlock avoidance. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Concurrency. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Transaction processing.",
}
@Article{Batory:1988:ICE,
author = "D. S. Batory and T. Y. Leung and T. E. Wise",
title = "Implementation Concepts for an Extensible Data Model
and Data Language",
journal = j-TODS,
volume = "13",
number = "3",
pages = "231--262",
month = sep,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: Un. Texas, TR-86-24, Oct.
1986.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-3/p231-batory/p231-batory.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-3/p231-batory/;
http://www.acm.org/pubs/toc/Abstracts/tods/45062.html",
abstract = "Future database systems must feature extensible data
models and data languages in order to accommodate the
novel data types and special-purpose operations that
are required by nontraditional database applications.
In this paper, we outline a functional data model and
data language that are targeted for the semantic
interface of GENESIS, an extensible DBMS. The model and
language are generalizations of FQL [11] and DAPLEX
[40], and have an implementation that fits ideally with
the modularity required by extensible database
technologies. We explore different implementations of
functional operators and present experimental evidence
that they have efficient implementations. We also
explain the advantages of a functional front-end to 1NF
databases, and show how our language and implementation
are being used to process queries on both 1NF and 1NF
relations.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Texas at Austin, Austin, TX, USA",
affiliationaddress = "Univ of Texas at Austin, Austin, TX, USA",
annote = "Illustrates a functional data model of GENESIS.
Defines GDM, the data model, and GDL, the data
language. GDM productions are stream rewrite rules and
GDM computations are expressed as streams of tokens.
Promotes extensibility. To build a non-1NF query
processor is an example.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Performance",
keywords = "computer programming languages; data language;
database systems; functional data model; languages;
lazy evaluation, TODS genesis functional language join
joins lazy eager nested relations, design; Management;
performance; stream translators",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Data manipulation languages (DML). {\bf
H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Query
processing. {\bf I.1.3}: Computing Methodologies,
ALGEBRAIC MANIPULATION, Languages and Systems,
Evaluation strategies. {\bf I.1.3}: Computing
Methodologies, ALGEBRAIC MANIPULATION, Languages and
Systems, Nonprocedural languages.",
}
@Article{Apers:1988:DAD,
author = "Peter M. G. Apers",
title = "Data Allocation in Distributed Database Systems",
journal = j-TODS,
volume = "13",
number = "3",
pages = "263--304",
month = sep,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-3/p263-apers/p263-apers.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-3/p263-apers/;
http://www.acm.org/pubs/toc/Abstracts/tods/45063.html",
abstract = "The problem of allocating the data of a database to
the sites of a communication network is investigated.
This problem deviates from the well-known file
allocation problem in several aspects. First, the
objects to be allocated are not known a priori; second,
these objects are accessed by schedules that contain
transmissions between objects to produce the result. A
model that makes it possible to compare the cost of
allocations is presented; the cost can be computed for
different cost functions and for processing schedules
produced by arbitrary query processing algorithms.
\par
For minimizing the total transmission cost, a method is
proposed to determine the fragments to be allocated
from the relations in the conceptual schema and the
queries and updates executed by the users.\par
For the same cost function, the complexity of the data
allocation problem is investigated. Methods for
obtaining optimal and heuristic solutions under various
ways of computing the cost of an allocation are
presented and compared.\par
Two different approaches to the allocation management
problem are presented and their merits are discussed.",
acknowledgement = ack-nhfb,
affiliation = "Vrije Univ, Enschede, Neth",
affiliationaddress = "Vrije Univ, Enschede, Neth",
annote = "Fragments are allocated. The strength of the paper is
its rigor, the weakness is in the applicability of the
model.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Measurement; Theory",
keywords = "computer networks; computer software --- software
engineering; data allocation; database systems; design;
distributed; dynamic schedules; greedy method;
heuristic allocations, algorithms; measurement; optimal
allocations; static schedules; theory",
subject = "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Access methods. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Distributed systems. {\bf C.2.4}: Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems, Distributed databases. {\bf
D.2.8}: Software, SOFTWARE ENGINEERING, Metrics,
Performance measures.",
}
@Article{Storey:1988:MCU,
author = "Veda C. Storey and Robert C. Goldstein",
title = "A Methodology for Creating User Views in Database
Design",
journal = j-TODS,
volume = "13",
number = "3",
pages = "305--338",
month = sep,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-3/p305-storey/p305-storey.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-3/p305-storey/;
http://www.acm.org/pubs/toc/Abstracts/tods/45064.html",
abstract = "The View Creation System (VCS) is an expert system
that engages a user in a dialogue about the information
requirements for some application, develops an
Entity-Relationship model for the user's database view,
and then converts the E-R model to a set of Fourth
Normal Form relations. This paper describes the
knowledge base of VCS. That is, it presents a formal
methodology, capable of mechanization as a computer
program, for accepting requirements from a user,
identifying and resolving inconsistencies,
redundancies, and ambiguities, and ultimately producing
a normalized relational representation. Key aspects of
the methodology are illustrated by applying VCS's
knowledge base to an actual database design task.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Rochester, Rochester, NY, USA",
affiliationaddress = "Univ of Rochester, Rochester, NY, USA",
annote = "Engages the user in a dialogue about the information
requirements for some application, develops an E-R
model and Fourth Normal Form relations.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design",
keywords = "computer programming; database systems; design; expert
system; knowledge base; user views, design; view
creation system (VCS)",
subject = "{\bf I.2.1}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Applications and Expert Systems. {\bf
H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design. {\bf H.2.7}: Information Systems,
DATABASE MANAGEMENT, Database Administration.",
}
@Article{Diederich:1988:NMF,
author = "Jim Diederich and Jack Milton",
title = "New Methods and Fast Algorithms for Database
Normalization",
journal = j-TODS,
volume = "13",
number = "3",
pages = "339--365",
month = sep,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "1 072 196",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: UCD, Math, revised Jun. 1987.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-3/p339-diederich/p339-diederich.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-3/p339-diederich/;
http://www.acm.org/pubs/toc/Abstracts/tods/44499.html",
abstract = "A new method for computing minimal covers is presented
using a new type of closure that allows significant
reductions in the number of closures computed for
normalizing relations. Benchmarks are reported
comparing the new and the standard techniques.",
acknowledgement = ack-nhfb,
affiliation = "Univ of California, Davis, CA, USA",
affiliationaddress = "Univ of California, Davis, CA, USA",
annote = "Modify existing algorithms to make the process
faster.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design",
keywords = "computer programming --- algorithms; database
normalization; database systems; design; fast
algorithms; functional dependency; management;
redundant dependencies; relational database,
algorithms",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Normal forms.",
}
@Article{Larson:1988:LHS,
author = "Per-{\AA}ke Larson",
title = "Linear Hashing with Separators --- {A} Dynamic Hashing
Scheme Achieving One-Access Retrieval",
journal = j-TODS,
volume = "13",
number = "3",
pages = "366--388",
month = sep,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-3/p366-larson/p366-larson.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-3/p366-larson/;
http://www.acm.org/pubs/toc/Abstracts/tods/44500.html",
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 storage 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.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Waterloo, Waterloo, Ont, Can",
affiliationaddress = "Univ of Waterloo, Waterloo, Ont, Can",
annote = "A small amount of supplemental internal storage stores
enough information to uniquely determine the current
location of any record.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "address computation; data processing --- File
organization; design; dynamic hashing schemes;
extendible hashing; linear hashing; linear probing;
Management; one-access retrieval; open addressing,
algorithms; open addressing, database systems;
performance",
review = "ACM CR 8811-0850",
subject = "{\bf D.4.3}: Software, OPERATING SYSTEMS, File Systems
Management, Access methods. {\bf D.4.3}: Software,
OPERATING SYSTEMS, File Systems Management, File
organization. {\bf E.5}: Data, FILES,
Organization/structure. {\bf H.2.2}: Information
Systems, DATABASE MANAGEMENT, Physical Design, Access
methods.",
}
@Article{Roth:1988:EAC,
author = "Mark A. Roth and Henry F. Korth and Abraham
Silberschatz",
title = "Extended Algebra and Calculus for Nested Relational
Databases",
journal = j-TODS,
volume = "13",
number = "4",
pages = "389--417",
month = dec,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "1 072 197",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/database.bib;
Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/; Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "See comment \cite{Tansel:1992:RKS}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-4/p389-roth/p389-roth.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-4/p389-roth/;
http://www.acm.org/pubs/toc/Abstracts/tods/49347.html",
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.",
acknowledgement = ack-nhfb,
affiliation = "Texas Univ., Austin, TX, USA",
affiliationaddress = "Austin, TX, USA",
annote = "Only two new operators, nest and unnest.",
classification = "723; 921",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages; Theory",
keywords = "languages; mathematical techniques --- algebra; nested
relational databases; non-first normal form database;
partitioned normal forms; query languages; relational;
relational calculus; theory, extended algebra and
calculus, nested relations, non-first normal form,
partitioned normal form, database systems",
owner = "curtis",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Normal
forms. {\bf H.2.3}: Information Systems, DATABASE
MANAGEMENT, Languages, Query languages.",
}
@Article{Gadia:1988:HRM,
author = "Shashi K. Gadia",
title = "A Homogeneous Relational Model and Query Languages for
Temporal Databases",
journal = j-TODS,
volume = "13",
number = "4",
pages = "418--448",
month = dec,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "1 072 198",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-4/p418-gadia/p418-gadia.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-4/p418-gadia/;
http://www.acm.org/pubs/toc/Abstracts/tods/50065.html",
abstract = "In a temporal database, time values are associated
with data item to indicate their periods of validity.
We propose a model for temporal databases within the
framework of the classical database theory. Our model
is realized as a temporal parameterization of static
relations. We do not impose any restrictions upon the
schemes of temporal relations. The classical concepts
of normal forms and dependencies are easily extended to
our model, allowing a suitable design for a database
scheme. We present a relational algebra and a tuple
calculus for our model and prove their equivalence. Our
data model is homogeneous in the sense that the periods
of validity of all the attributes in a given tuple of a
temporal relation are identical. We discuss how to
relax the homogeneity requirement to extend the
application domain of our approach.",
acknowledgement = ack-nhfb,
affiliation = "Iowa State Univ., Ames, IA, USA",
affiliationaddress = "Ames, IA, USA",
annote = "temporal tuples and temporal relations; the temporal
domain varies from tuple to tuple but it is constant
with respect to attributes.",
classification = "723; 921",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Theory",
keywords = "design; languages; mathematical techniques ---
algebra; query languages; relational; relational
algebra; relational calculus; temporal databases;
theory, database systems; tuple calculus",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages.",
}
@Article{Brosda:1988:URR,
author = "Volkert Brosda and Gottfried Vossen",
title = "Update and Retrieval in a Relational Database Through
a Universal Schema Interface",
journal = j-TODS,
volume = "13",
number = "4",
pages = "449--485",
month = dec,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "1 072 199",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-4/p449-brosda/p449-brosda.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-4/p449-brosda/;
http://www.acm.org/pubs/toc/Abstracts/tods/49884.html",
abstract = "A database system that is based on the universal
relation (UR) model aims at freeing its users from
specifying access paths on both the physical and on the
logical levels. All information about the logical
structure of the database (i.e., its conceptual scheme)
is hidden from users; they need only to know the
attribute names, which now carry all the semantics of
the database.\par
Previous work on UR interfaces has concentrated on the
design and implementation of query languages that serve
to facilitate retrieval of data from a relational
database. On the other hand, updates are always handled
as before, which means that users still have to know
the logical structure of the database in case they want
to insert, delete, or modify tuples.\par
In this paper the concepts underlying a UR interface,
which is really ``universal,'' are presented; it is
based on the UR model, and it permits not only queries
but also updates: Combinations of attributes that may
participate in an update-operation (``objects'') have
to be specified during the design phase of the
database, and are then embodied into the database
scheme by an extended synthesis algorithm. They form
the basis for any insertion or deletion operation. A
precise definition of ``insertable'' tuples, and of the
insert- and delete-operation in this new context, is
given. It is then shown that these operations modify a
database state in such a way that a representative
instance always exists. This is accomplished by
providing a more detailed version of Sagiv's uniqueness
condition and by exploring the structure of nonunique
objects. Since the underlying database always has a
representative instance, this instance can be used to
define the window function for retrieval. It is shown
that it is still possible to compute windows by a union
of minimal extension joins.",
acknowledgement = ack-nhfb,
affiliation = "Rheinisch-Westfalische Tech. Hochschule Aachen, West
Germany",
affiliationaddress = "Aachen, West Ger",
classification = "723; 903",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Theory",
keywords = "computer interfaces; database systems; database
updates; information science --- information retrieval;
languages; minimal extension joins; relational; theory;
universal relation interface; universal scheme
interfaces, design",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf D.2.2}: Software,
SOFTWARE ENGINEERING, Tools and Techniques, User
interfaces. {\bf H.2.1}: Information Systems, DATABASE
MANAGEMENT, Logical Design. {\bf H.2.2}: Information
Systems, DATABASE MANAGEMENT, Physical Design, Access
methods. {\bf H.2.3}: Information Systems, DATABASE
MANAGEMENT, Languages, Data manipulation languages
(DML). {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Transaction processing. {\bf
H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing.",
}
@Article{Gottlob:1988:PUS,
author = "Georg Gottlob and Paolo Paolini and Roberto Zicari",
title = "Properties and Update Semantics of Consistent Views",
journal = j-TODS,
volume = "13",
number = "4",
pages = "486--524",
month = dec,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "1 072 200",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-4/p486-gottlob/p486-gottlob.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-4/p486-gottlob/;
http://www.acm.org/pubs/toc/Abstracts/tods/50068.html",
abstract = "The problem of translating view updates to database
updates is considered. Both databases and views are
modeled as data abstractions. A data abstraction
consists of a set of states and of a set of primitive
update operators representing state transition
functions. It is shown how complex update programs can
be built from primitive update operators and how view
update programs are translated into database update
programs. Special attention is paid to a class of views
that we call ``consistent.'' Loosely speaking, a
consistent view is a view with the following property:
If the effect of a view update program on a view state
is determined, then the effect of the corresponding
database update is unambiguously determined. Thus, in
order to know how to translate a given view update into
a database update, it is sufficient to be aware of a
functional specification of such a program. We show
that consistent views have a number of interesting
properties with respect to the concurrency of
(high-level) update transactions. Moreover we show that
the class of consistent views includes as a subset the
class of views that translate updates under maintenance
of a constant complement. However, we show that there
exist consistent views that do not translate under
constant complement. The results of Bancilhon and
Spyratos [6] are generalized in order to capture the
update semantics of the entire class of consistent
views. In particular we show that the class of
consistent views is obtained if we relax the
requirement of a constant complement by allowing the
complement to decrease according to a suitable partial
order.",
acknowledgement = ack-nhfb,
affiliation = "Inst. for Appl. Math., CNR, Genoa, Italy",
affiliationaddress = "Genoa, Italy",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Theory",
keywords = "concurrency, design; consistent views; data
abstractions; database systems; theory; update
semantics; view updates",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf H.2.1}:
Information Systems, DATABASE MANAGEMENT, Logical
Design, Data models. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems.",
}
@Article{Lomet:1988:SBD,
author = "David B. Lomet",
title = "A Simple Bounded Disorder File Organization with Good
Performance",
journal = j-TODS,
volume = "13",
number = "4",
pages = "525--551",
month = dec,
year = "1988",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1988-13-4/p525-lomet/p525-lomet.pdf;
http://www.acm.org/pubs/citations/journals/tods/1988-13-4/p525-lomet/;
http://www.acm.org/pubs/toc/Abstracts/tods/50067.html",
abstract = "A bounded-disorder (BD) file is one in which data are
organized into nodes that are indexed, e.g., by means
of a B-tree. The data nodes are multibucket nodes that
are accessed by hashing. In this paper we present two
important improvements to the BD organization as
originally described. First, records in a data node
that overflow their designated primary bucket are
stored in a single overflow bucket which is itself a
bucket of the data node. Second, when file space needs
to be increased, partial expansions are used that
employ elastic buckets. Analysis and simulation results
demonstrate that this variant of the BD organization
has utilization, random access performance, and file
growth performance that can be competitive with good
extendible hashing methods, while supporting
high-performance sequential access. The simplicity of
the organization results in simple algorithms for
realizing the organization.",
acknowledgement = ack-nhfb,
affiliation = "Digital Equip. Corp., Nashua, NH, USA",
annote = "Index entries refer to large data nodes which are
treated as separate hashed files.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "bounded disorder file organization; computer
programming --- algorithms; computer simulation; data
processing; design; dynamic files; file organization;
index sequential access; indexed files; performance;
storage management, algorithms",
review = "ACM CR 8904-0253",
subject = "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Access methods. {\bf H.3.2}:
Information Systems, INFORMATION STORAGE AND RETRIEVAL,
Information Storage, File organization. {\bf D.4.3}:
Software, OPERATING SYSTEMS, File Systems Management,
Access methods. {\bf D.4.3}: Software, OPERATING
SYSTEMS, File Systems Management, File organization.",
}
@Article{Freytag:1989:TRQ,
author = "Johann Christoph Freytag and Nathan Goodman",
title = "On the Translation of Relational Queries into
Iterative Programs",
journal = j-TODS,
volume = "14",
number = "1",
pages = "1--27",
month = mar,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-1/p1-freytag/p1-freytag.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-1/p1-freytag/",
abstract = "This paper investigates the problem of translating
set-oriented query specifications into iterative
programs. The translation uses techniques of functional
programming and program transformation.\par
We present two algorithms that 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 that 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.",
acknowledgement = ack-nhfb,
affiliation = "Eur. Comput. Ind. Res. Centre, Munich, West Germany",
affiliationaddress = "Cambridge, MA, USA",
annote = "Functional programming is used for the formulation of
simple algebraic rules",
classification = "723; 921",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Performance; Theory",
keywords = "algebraic specification; algorithms; computer
programming --- algorithms; functional programming;
iterative programs; languages; mathematical techniques
--- algebra; performance; program transformation;
relational; relational queries; theory, database
systems",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf D.1.1}: Software,
PROGRAMMING TECHNIQUES, Applicative (Functional)
Programming. {\bf I.2.2}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Automatic Programming, Program
transformation. {\bf H.2.5}: Information Systems,
DATABASE MANAGEMENT, Heterogeneous Databases, Program
translation.",
}
@Article{Ahad:1989:ECP,
author = "Rafiul Ahad and K. V. {Bapa Rao} and Dennis McLeod",
title = "On Estimating the Cardinality of the Projection of a
Database Relation",
journal = j-TODS,
volume = "14",
number = "1",
pages = "28--40",
month = mar,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-1/p28-ahad/p28-ahad.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-1/p28-ahad/;
http://www.acm.org/pubs/toc/Abstracts/tods/62034.html",
abstract = "We present an analytical formula for estimating the
cardinality of the projection on certain attributes of
a subset of a relation in a relational database. This
formula takes into account a priori knowledge of the
semantics of the real-world objects and relationships
that the database is intended to represent.
Experimental testing of the formula shows that it has
an acceptably low percentage error, and that its
worst-case error is smaller than the best-known
formula. Furthermore, the formula presented here has
the advantage that it does not require a scan of the
relation.",
acknowledgement = ack-nhfb,
affiliation = "Maryland Univ., College Park, MD, USA",
affiliationaddress = "College Park, MD, USA",
annote = "Uses normal distribution estimates.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Experimentation; Measurement; Performance",
keywords = "application semantics; cardinality estimation, data
semantics selectivity estimation TODS, design; computer
simulation; data semantics; database systems;
experimentation; measurement; performance; relational",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.2}: Information
Systems, DATABASE MANAGEMENT, Physical Design, Access
methods. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Query processing.",
}
@Article{Ramesh:1989:VDT,
author = "R. Ramesh and A. J. G. Babu and J. Peter Kincaid",
title = "Variable-Depth Trie Index Optimization: Theory and
Experimental Results",
journal = j-TODS,
volume = "14",
number = "1",
pages = "41--74",
month = mar,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-1/p41-ramesh/p41-ramesh.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-1/p41-ramesh/;
http://www.acm.org/pubs/toc/Abstracts/tods/77249.html",
abstract = "We develop an efficient approach to Trie index
optimization. A {\em Trie\/} is a data structure used
to index a file having a set of attributes as record
identifiers. In the proposed methodology, a file is
horizontally partitioned into subsets of records using
a Trie index whose depth of indexing is allowed to
vary. The retrieval of a record from the file proceeds
by ``stepping through'' the index to identify a subset
of records in the file in which a binary search is
performed. This paper develops a taxonomy of
optimization problems underlying variable-depth Trie
index construction. All these problems are solvable in
polynomial time, and their characteristics are studied.
Exact algorithms and heuristics for their solution are
presented. The algorithms are employed in CRES-an
expert system for editing written narrative material,
developed for the Department of the Navy. CRES uses
several large-to-very-large dictionary files for which
Trie indexes are constructed using these algorithms.
Computational experience with CRES shows that search
and retrieval using variable-depth Trie indexes can be
as much as six times faster than pure binary search.
The space requirements of the Tries are reasonable. The
results show that the variable-depth Tries constructed
according to the proposed algorithms are viable and
efficient for indexing large-to-very-large files by
attributes in practical applications.",
acknowledgement = ack-nhfb,
affiliation = "State Univ. of New York, Buffalo, NY, USA",
affiliationaddress = "Buffalo, NY, USA",
classification = "723; 921",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Experimentation; Performance;
Theory",
keywords = "artificial intelligence --- expert systems; computer
editing; computer programming --- algorithms; CRES
expert system; data processing; data structures;
design; experimentation; information science ---
information retrieval; optimization; performance;
theory; trie index optimization, algorithms",
subject = "{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf E.5}:
Data, FILES. {\bf E.2}: Data, DATA STORAGE
REPRESENTATIONS, Contiguous representations. {\bf
H.3.1}: Information Systems, INFORMATION STORAGE AND
RETRIEVAL, Content Analysis and Indexing. {\bf H.3.3}:
Information Systems, INFORMATION STORAGE AND RETRIEVAL,
Information Search and Retrieval, Search process. {\bf
E.2}: Data, DATA STORAGE REPRESENTATIONS, Linked
representations.",
}
@Article{Gladney:1989:DRD,
author = "H. M. Gladney",
title = "Data Replicas in Distributed Information Services",
journal = j-TODS,
volume = "14",
number = "1",
pages = "75--97",
month = mar,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; Distributed/CCR.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "{\it Reviews}: Computing Reviews, Vol. 30, No. 11,
November 1989",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-1/p75-gladney/p75-gladney.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-1/p75-gladney/;
http://www.acm.org/pubs/toc/Abstracts/tods/62035.html",
abstract = "In an information distribution network in which
records are repeatedly read, it is cost-effective to
keep read-only copies in work locations. This paper
presents a method of updating replicas that need not be
immediately synchronized with the source data or with
each other. The method allows an arbitrary mapping from
source records to replica records. It is fail-safe,
maximizes workstation autonomy, and is well suited to a
network with slow, unreliable, and/or expensive
communications links.\par
The algorithm is a manipulation of queries, which are
represented as short encodings. When a response is
generated, we record which portion of the source
database was used. Later, when the source data are
updated, this information is used to identify obsolete
replicas. For each workstation, the identity of
obsolete replicas is saved until a workstation process
asks for this information. This workstation process
deletes each obsolete replica, and replaces it by an
up-to-date version either promptly or the next time the
application asks for this particular item. Throughout,
queries are grouped so that the impact of each source
update transaction takes effect atomically at each
workstation.\par
Optimizations of the basic algorithm are outlined.
These overlap change dissemination with user service,
allow the mechanism to be hidden within the data
delivery subsystem, and permit very large networks.",
acknowledgement = ack-nhfb,
affiliation = "IBM Almaden Res. Center, San Jose, CA, USA",
affiliationaddress = "San Jose, CA, USA",
annote = "Server and workstations.",
classification = "723; 903; 921",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Languages; Performance;
Reliability",
keywords = "computer programming --- algorithms; design;
distributed; information services; languages;
optimization, algorithms; performance; reliability;
reviews, database systems",
subject = "{\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases. {\bf C.2.4}: Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems, Distributed applications. {\bf
H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Distributed systems.",
}
@Article{McLeish:1989:FRS,
author = "Mary McLeish",
title = "Further Results on the Security of Partitioned Dynamic
Statistical Databases",
journal = j-TODS,
volume = "14",
number = "1",
pages = "98--113",
month = mar,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-1/p98-mcleish/p98-mcleish.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-1/p98-mcleish/;
http://www.acm.org/pubs/toc/Abstracts/tods/62036.html",
abstract = "Partitioning is a highly secure approach to protecting
statistical databases. When updates are introduced,
security depends on putting restrictions on the sizes
of partition sets which may be queried. To overcome
this problem, attempts have been made to add ``dummy''
records. Recent work has shown that this leads to high
information loss.\par
This paper reconsiders the restrictions on the size of
partitioning sets required to achieve a high level of
security. Updates of two records at a time were studied
earlier, and security was found to hold if the sizes of
the partition sets were kept even. In this paper an
extended model is presented, allowing very general
updates to be performed. The security problem is
thoroughly studied, giving if and only if conditions.
The earlier result is shown to be part of a corollary
to the main theorem of this paper. Alternatives to
adding dummy records are presented and the practical
implications of the theory for the database manager are
discussed.",
acknowledgement = ack-nhfb,
affiliation = "Guelph Univ., Ont., Canada",
affiliationaddress = "Guelph, Ont, Can",
classification = "723; 922",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance; Security; Theory",
keywords = "data processing --- security of data; database
security, algorithms; database systems; partitioned
databases; performance; security; statistical
databases; statistical methods; theory",
subject = "{\bf H.2.0}: Information Systems, DATABASE MANAGEMENT,
General, Security, integrity, and protection. {\bf
G.3}: Mathematics of Computing, PROBABILITY AND
STATISTICS. {\bf K.4.1}: Computing Milieux, COMPUTERS
AND SOCIETY, Public Policy Issues, Privacy.",
}
@Article{Bic:1989:ADD,
author = "Lubomir Bic and Robert L. Hartmann",
title = "{AGM}: {A} Dataflow Database Machine",
journal = j-TODS,
volume = "14",
number = "1",
pages = "114--146",
month = mar,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-1/p114-bic/p114-bic.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-1/p114-bic/;
http://www.acm.org/pubs/toc/Abstracts/tods/62037.html",
abstract = "In recent years, a number of database machines
consisting of large numbers of parallel processing
elements have been proposed. Unfortunately, there are
two main limitations in database processing that
prevent a high degree of parallelism; these are the
available I/O bandwidth of the underlying storage
devices and the concurrency control mechanisms
necessary to guarantee data integrity. The main problem
with conventional approaches is the lack of a
computational model capable of utilizing the potential
of any significant number of processing elements and
storage devices and, at the same time, preserving the
integrity of the database.\par
This paper presents a database model and its associated
architecture, which is based on the principles of
data-driven computation. According to this model, the
database is represented as a network in which each node
is conceptually an independent, asynchronous processing
element, capable of communicating with other nodes by
exchanging messages along the network arcs. To answer a
query, one or more such messages, called tokens, are
created and injected into the network. These then
propagate asynchronously through the network in search
of results satisfying the given query.\par
The asynchronous nature of processing permits the model
to be mapped onto a computer architecture consisting of
large numbers of independent disk units and processing
elements. This increases both the available I/O
bandwidth as well as the processing potential of the
machine. At the same time, new concurrency control and
error recovery mechanisms are necessary to cope with
the resulting parallelism.",
acknowledgement = ack-nhfb,
affiliation = "California Univ., Irvine, CA, USA",
affiliationaddress = "Irvine, CA, USA",
classification = "722; 723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Performance",
keywords = "Active Graph Machine, design; AGM Model; Computer
Architecture; Database Machines; Database Systems;
Dataflow Computing; hardware support token flow on
multi-processor data connection graph TODS; languages;
Models; performance",
subject = "{\bf H.2.6}: Information Systems, DATABASE MANAGEMENT,
Database Machines. {\bf C.1.2}: Computer Systems
Organization, PROCESSOR ARCHITECTURES, Multiple Data
Stream Architectures (Multiprocessors), Parallel
processors. {\bf C.1.3}: Computer Systems Organization,
PROCESSOR ARCHITECTURES, Other Architecture Styles,
Data-flow architectures. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages. {\bf C.4}: Computer Systems Organization,
PERFORMANCE OF SYSTEMS, Modeling techniques.",
}
@Article{Yu:1989:FER,
author = "C. T. Yu and W. Meng and S. Park",
title = "A Framework for Effective Retrieval",
journal = j-TODS,
volume = "14",
number = "2",
pages = "147--167",
month = jun,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P20",
MRnumber = "1 072 201",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-2/p147-yu/p147-yu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-2/p147-yu/;
http://www.acm.org/pubs/toc/Abstracts/tods/63519.html",
abstract = "The aim of an effective retrieval system is to yield
high recall and precision (retrieval effectiveness).
The nonbinary independence model, which takes into
consideration the number of occurrences of terms in
documents, is introduced. It is shown to be optimal
under the assumption that terms are independent. It is
verified by experiments to yield significant
improvement over the binary independence model. The
nonbinary model is extended to normalized vectors and
is applicable to more general queries.\par
Various ways to alleviate the consequences of the term
independence assumption are discussed. Estimation of
parameters required for the nonbinary independence
model is provided, taking into consideration that a
term may have different meanings.",
acknowledgement = ack-nhfb,
acmcrnumber = "8912-0901",
affiliation = "Dept. of Electr. Eng. and Comput. Sci., Illinois
Univ., Chicago, IL, USA",
affiliationaddress = "Chicago, IL, USA",
annote = "probabilistic models with parameters estimated from
previously retrieved relevant and irrelevant
documents.",
classification = "723; 903; 921; 922",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Performance; Theory",
keywords = "Database Systems; Information Retrieval; Information
Science; Mathematical Techniques --- Estimation;
Nonbinary Independence Model; Parameter Estimation;
Retrieval Effectiveness",
subject = "{\bf H.3.3}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Search and Retrieval,
Retrieval models. {\bf H.3.3}: Information Systems,
INFORMATION STORAGE AND RETRIEVAL, Information Search
and Retrieval, Query formulation. {\bf H.3.3}:
Information Systems, INFORMATION STORAGE AND RETRIEVAL,
Information Search and Retrieval, Clustering.",
}
@Article{Embley:1989:NNF,
author = "David W. Embley",
title = "{NFQL}: The {Natural Forms Query Language}",
journal = j-TODS,
volume = "14",
number = "2",
pages = "168--211",
month = jun,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: Brigham Young Un., TR-CS-87-6,
Mar. 1987.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-2/p168-embley/p168-embley.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-2/p168-embley/;
http://www.acm.org/pubs/toc/Abstracts/tods/64125.html",
abstract = "A means by which ordinary forms can be exploited to
provide a basis for nonprocedural specification of
information processing is discussed. The Natural Forms
Query Language (NFQL) is defined. In NFQL data
retrieval requests and computation specifications are
formulated by sketching ordinary forms to show what
data are desired and update operations are specified by
altering data on filled-in forms. The meaning of a form
depends on a store of knowledge that includes extended
abstract data types for defining elementary data items,
a database scheme defined by an entity-relationship
model, and a conceptual model of an ordinary form.
Based on this store of knowledge, several issues are
addressed and resolved in the context of NFQL. These
issues include automatic generation of query
expressions from weak specifications, the view update
problem, power and completeness, and a heuristic
approach to resolving computational relationships. A
brief status report of an implementation of NFQL is
also given.",
acknowledgement = ack-nhfb,
affiliation = "Brigham Young Univ., Prov., UT, USA",
affiliationaddress = "Provo, UT, USA",
annote = "Uses surrogate keys in the ER model.",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Theory",
keywords = "database systems; entity-relationship model; forms
oriented interfaces; informal software specification;
information science --- information retrieval;
languages; natural forms query language; nonprocedural
specification; query languages; relational database,
algorithms; theory",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, NFQL. {\bf H.2.1}: Information Systems,
DATABASE MANAGEMENT, Logical Design, Data models. {\bf
H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf H.4.1}:
Information Systems, INFORMATION SYSTEMS APPLICATIONS,
Office Automation. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems, Query processing. {\bf
H.3.3}: Information Systems, INFORMATION STORAGE AND
RETRIEVAL, Information Search and Retrieval, Query
formulation. {\bf H.2.3}: Information Systems, DATABASE
MANAGEMENT, Languages, Data description languages
(DDL). {\bf H.2.3}: Information Systems, DATABASE
MANAGEMENT, Languages, Data manipulation languages
(DML). {\bf H.2.3}: Information Systems, DATABASE
MANAGEMENT, Languages, Query languages.",
}
@Article{Atzeni:1989:EOS,
author = "Paolo Atzeni and Edward P. F. Chan",
title = "Efficient Optimization of Simple Chase Join
Expressions",
journal = j-TODS,
volume = "14",
number = "2",
pages = "212--230",
month = jun,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "1 072 202",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-2/p212-atzeni/p212-atzeni.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-2/p212-atzeni/;
http://www.acm.org/pubs/toc/Abstracts/tods/63520.html",
abstract = "Simple chase join expressions are relational algebra
expressions, involving only projection and join
operators, defined on the basis of the functional
dependencies associated with the database scheme. They
are meaningful in the weak instance model, because for
certain classes of schemes, including independent
schemes, the total projections of the representative
instance can be computed by means of unions of simple
chase join expressions. We show how unions of simple
chase join expressions can be optimized efficiently,
without constructing and chasing the corresponding
tableaux. We also present efficient algorithms for
testing containment and equivalence, and for optimizing
individual simple chase join expressions.",
acknowledgement = ack-nhfb,
affiliation = "IASI-CNR, Rome, Italy",
affiliationaddress = "Rome, Italy",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Performance; Theory",
keywords = "computer programming --- algorithms; containment
testing; database systems; equivalence testing,
algorithms; functional dependencies; languages;
optimization; performance; relational; relational
algebra expressions; simple chase join expressions;
theory",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages. {\bf H.2.1}:
Information Systems, DATABASE MANAGEMENT, Logical
Design, Normal forms.",
}
@Article{Ramakrishna:1989:FOU,
author = "M. V. Ramakrishna and Per-{\AA}ke Larson",
title = "File Organization Using Composite Perfect Hashing",
journal = j-TODS,
volume = "14",
number = "2",
pages = "231--263",
day = "1",
month = jun,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/;
UnCover library database",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-2/p231-ramakrishna/p231-ramakrishna.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-2/p231-ramakrishna/;
http://www.acm.org/pubs/toc/Abstracts/tods/63521.html",
abstract = "Perfect hashing refers to hashing with no overflows.
We propose and analyze a composite perfect hashing
scheme for large external files. The scheme guarantees
retrieval of any record in a single disk access.
Insertions and deletions are simple, and the file size
may vary considerably without adversely affecting the
performance. A simple variant of the scheme supports
efficient range searches in addition to being a
completely dynamic file organization scheme. These
advantages are achieved at the cost of a small amount
of additional internal storage and increased cost of
insertions.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Michigan State Univ., East
Lansing, MI, USA",
affiliationaddress = "East Lansing, MI, USA",
classification = "723; 903",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Experimentation; Performance",
keywords = "composite perfect hashing; data processing; database
systems; design; dynamic file organization, algorithms;
experimentation; file organization; information science
--- information retrieval; large external files;
performance; range searches",
subject = "{\bf E.2}: Data, DATA STORAGE REPRESENTATIONS,
Hash-table representations. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Sorting and searching. {\bf H.2.2}: Information
Systems, DATABASE MANAGEMENT, Physical Design, Access
methods.",
}
@Article{ElAbaddi:1989:MAP,
author = "Amr {El Abaddi} and Sam Toueg",
title = "Maintaining Availability in Partitioned Replicated
Databases",
journal = j-TODS,
volume = "14",
number = "2",
pages = "264--290",
month = jun,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "1 072 203",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Compendex database; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: ACM SIGACT-SIGMOD Symp. on
Principles of Database Systems, Cambridge MA, Mar.
1986.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-2/p264-abbadi/p264-abbadi.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-2/p264-abbadi/;
http://www.acm.org/pubs/toc/Abstracts/tods/63501.html",
abstract = "In a replicated database, a data item may have copies
residing on several sites. A replica control protocol
is necessary to ensure that data items with several
copies behave as if they consist of a single copy, as
far as users can tell. We describe a new replica
control protocol that allows the accessing of data in
spite of site failures and network partitioning. This
protocol provides the database designer with a large
degree of flexibility in deciding the degree of data
availability, as well as the cost of accessing data.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY,
USA",
affiliationaddress = "Ithaca, NY, USA",
classification = "723",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Reliability",
keywords = "computer operating systems; concurrency control;
database availability, algorithms; database systems;
design; distributed; partitioned replicated databases;
partitioning failures; performance; reliability;
replica control; serializability",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Distributed systems. {\bf C.2.4}: Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems, Distributed databases. {\bf
D.4.3}: Software, OPERATING SYSTEMS, File Systems
Management, Distributed file systems. {\bf D.4.5}:
Software, OPERATING SYSTEMS, Reliability,
Fault-tolerance. {\bf C.2.2}: Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS, Network
Protocols. {\bf H.2.2}: Information Systems, DATABASE
MANAGEMENT, Physical Design, Access methods.",
}
@Article{Hudson:1989:CSA,
author = "Scott E. Hudson and Roger King",
title = "{Cactis}: {A} Self-Adaptive, Concurrent Implementation
of an Object-Oriented Database Management System",
journal = j-TODS,
volume = "14",
number = "3",
pages = "291--321",
month = sep,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-3/p291-hudson/p291-hudson.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-3/p291-hudson/;
http://www.acm.org/pubs/toc/Abstracts/tods/68013.html",
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.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Arizona Univ., Tucson, AZ,
USA",
annote = "attributes of objects can be derived; dynamic
definition of a scheme, depending on the user's
requirements functionally defined data, intelligent
update algorithms",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "algorithms; clustering derived update propagation
TODS; design; performance",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Cactis. {\bf H.2.1}: Information Systems,
DATABASE MANAGEMENT, Logical Design, Data models. {\bf
H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design. {\bf J.6}: Computer Applications,
COMPUTER-AIDED ENGINEERING.",
}
@Article{Sheard:1989:AVD,
author = "Tim Sheard and David Stemple",
title = "Automatic Verification of Database Transaction
Safety",
journal = j-TODS,
volume = "14",
number = "3",
pages = "322--368",
month = sep,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: U. Mass, COINS TR-88-29, Apr.
1988, also TR-86-30, 1986.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-3/p322-sheard/p322-sheard.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-3/p322-sheard/;
http://www.acm.org/pubs/toc/Abstracts/tods/68014.html",
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.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. and Inf. Sci., Massachusetts Univ.,
Amherst, MA, USA",
annote = "LISP; inference techniques based on Boyer--Moore.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Reliability; Verification",
keywords = "design; reliability; verification",
subject = "{\bf H.2.0}: Information Systems, DATABASE MANAGEMENT,
General, Security, integrity, and protection. {\bf
H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf H.2.1}:
Information Systems, DATABASE MANAGEMENT, Logical
Design, Schema and subschema. {\bf D.2.4}: Software,
SOFTWARE ENGINEERING, Program Verification.",
}
@Article{Blakeley:1989:UDR,
author = "Jos{\'e} A. Blakeley and Neil Coburn and Per-{\AA}ke
Larson",
title = "Updating Derived Relations: Detecting Irrelevant and
Autonomously Computable Updates",
journal = j-TODS,
volume = "14",
number = "3",
pages = "369--400",
month = sep,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "1 073 202",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: Indiana Un., TR-235, Nov. 1987.
Also published in \cite{Kambayashi:1986:TIC}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-3/p369-blakeley/p369-blakeley.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-3/p369-blakeley/;
http://www.acm.org/pubs/toc/Abstracts/tods/68015.html",
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 {\em 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.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
annote = "Identity implementation; rigorous mathematical proofs;
expressions that are capable of being tested constitute
a large and commonly occurring class.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Theory",
keywords = "algorithms; design; performance; theory",
subject = "{\bf H.2.0}: Information Systems, DATABASE MANAGEMENT,
General. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Query processing. {\bf H.2.1}:
Information Systems, DATABASE MANAGEMENT, Logical
Design, Schema and subschema. {\bf H.2.2}: Information
Systems, DATABASE MANAGEMENT, Physical Design, Access
methods.",
}
@Article{Mackert:1989:ISU,
author = "Lothar F. Mackert and Guy M. Lohman",
title = "Index Scans Using a Finite {LRU} Buffer: {A} Validated
{I/O} Model",
journal = j-TODS,
volume = "14",
number = "3",
pages = "401--424",
month = sep,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: IBM, TR-RC-4836, Sep. 1985.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-3/p401-mackert/p401-mackert.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-3/p401-mackert/;
http://www.acm.org/pubs/toc/Abstracts/tods/68016.html",
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
$N$ given records stored on $T$ disk pages. This paper
generalizes these results, relaxing two assumptions
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.",
acknowledgement = ack-nhfb,
affiliation = "IBM Almaden Res. Center, San Jose, CA, USA",
annote = "consider limited buffer and now unique records for
each key value.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Measurement; Performance; Theory",
keywords = "design; measurement; performance; theory, clustering
non-clustering B-tree lookup cost Starburst System R
IBM Almaden TODS",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.3.2}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Information
Storage, File organization. {\bf H.2.2}: Information
Systems, DATABASE MANAGEMENT, Physical Design, Access
methods. {\bf H.3.3}: Information Systems, INFORMATION
STORAGE AND RETRIEVAL, Information Search and
Retrieval, Retrieval models. {\bf H.3.1}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Content
Analysis and Indexing, Indexing methods. {\bf E.5}:
Data, FILES, Organization/structure. {\bf C.4}:
Computer Systems Organization, PERFORMANCE OF SYSTEMS,
Performance attributes.",
}
@Article{Manolopoulos:1989:PTH,
author = "Y. Manolopoulos and J. G. Kollias",
title = "Performance of a Two-Headed Disk System when Serving
Database Queries Under the Scan Policy",
journal = j-TODS,
volume = "14",
number = "3",
pages = "425--442",
month = sep,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-3/p425-manolopoulos/p425-manolopoulos.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-3/p425-manolopoulos/;
http://www.acm.org/pubs/toc/Abstracts/tods/68017.html",
abstract = "Disk drives with movable two-headed arms are now
commercially available. The two heads are separated by
a fixed number of cylinders. A major problem for
optimizing disk head movement, when answering database
requests, is the specification of the optimum number of
cylinders separating the two heads. An earlier
analytical study assumed a FCFS model and concluded
that the optimum separation distance should be equal to
0.44657 of the number of cylinders $N$ of the disk.
This paper considers that the SCAN scheduling policy is
used in file access, and it applies combinatorial
analysis to derive exact formulas for the expected head
movement. Furthermore, it is proven that the optimum
separation distance is $N/2 - 1$ ($\lceil N /2 -
1\rceil$ and $\lfloor N/2 - 1\rfloor$) if $N$ is even
(odd). In addition, a comparison with a single-headed
disk system operating under the same scheduling policy
shows that if the two heads are optimally spaced, then
the mean seek distance is less than one-half of the
value obtained with one head. In fact that the SCAN
policy is used for many database applications (for
example,batching and secondary key retrieval)
demonstrates the potential of two-headed disk systems
for improving the performance of database systems.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Electr. Eng., Aristotelian Univ. of
Thessaloniki, Greece",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "design; hardware support I/O seek machine TODS,
algorithms; performance",
subject = "{\bf D.4.2}: Software, OPERATING SYSTEMS, Storage
Management, Secondary storage. {\bf D.4.1}: Software,
OPERATING SYSTEMS, Process Management, Scheduling. {\bf
H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Sequencing and scheduling.",
}
@Article{Dreizen:1989:ISR,
author = "Howard M. Dreizen and Shi-Kuo Chang",
title = "Imprecise Schema: {A} Rationale for Relations with
Embedded Subrelations",
journal = j-TODS,
volume = "14",
number = "4",
pages = "447--479",
month = dec,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/; Misc/is.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-4/p447-dreizen/p447-dreizen.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-4/p447-dreizen/;
http://www.acm.org/pubs/toc/Abstracts/tods/76903.html",
abstract = "{\em Exceptional conditions\/} are anomalous data
which meet the intent of a schema but not the schema
definition, represent a small proportion of the
database extension, and may become known only after the
schema is in use. Admission of exceptional conditions
is argued to suggest a representation that locally
stretches the schema definition by use of relations
with embedded subrelations. Attempted normalization of
these relations to 1NF does not yield the static schema
typically associated with such transformations. A class
of relations, termed Exceptional Condition Nested Form
(ECNF), is defined which allows the necessary
representation of exceptional conditions while
containing sufficient restrictions to prevent arbitrary
and chaotic inclusion of embedded subrelations. Queries
on a subset of exceptional conditions, the {\em
exceptional constraints}, are provided an
interpretation via an algorithm that transforms ECNF
relations into 1NF relations containing two types of
null values. Extensions of relational algebraic
operators, suitable for interactive query navigation,
are defined for use with ECNF relations containing all
forms of exceptional conditions.",
acknowledgement = ack-nhfb,
affiliation = "Illinois Inst. of Technol., Chicago, IL, USA",
annote = "If the data contain only a few `exceptional' tuples,
their effect might better be confined to a local schema
change rather than changing the global schema; the
effect of processing is only partly answered.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Theory",
keywords = "algorithms; design; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf H.2.1}:
Information Systems, DATABASE MANAGEMENT, Logical
Design, Data models. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems, Query processing.",
}
@Article{Motro:1989:IVC,
author = "Amihai Motro",
title = "Integrity = Validity + Completeness",
journal = j-TODS,
volume = "14",
number = "4",
pages = "480--502",
month = dec,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-4/p480-motro/p480-motro.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-4/p480-motro/;
http://www.acm.org/pubs/toc/Abstracts/tods/76904.html",
abstract = "Database integrity has two complementary components:
{\em validity}, which guarantees that all false
information is excluded from the database, and {\em
completeness}, which guarantees that all true
information is included in the database. This article
describes a uniform model of integrity for relational
databases, that considers both validity and
completeness. To a large degree, this model subsumes
the prevailing model of integrity (i.e., integrity
constraints). One of the features of the new model is
the determination of the integrity of answers issued by
the database system in response to user queries. To
users, answers that are accompanied with such detailed
certifications of their integrity are more meaningful.
First, the model is defined and discussed. Then, a
specific mechanism is described that implements this
model. With this mechanism, the determination of the
integrity of an answer is a process analogous to the
determination of the answer itself.",
acknowledgement = ack-nhfb,
affiliation = "Univ. of Southern California, Los Angeles, CA, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Theory",
keywords = "algorithms; design; performance; theory",
subject = "{\bf H.2.0}: Information Systems, DATABASE MANAGEMENT,
General, Security, integrity, and protection. {\bf
H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Data
models.",
}
@Article{Farrag:1989:USK,
author = "Abdel Aziz Farrag and M. Tamer {\"O}zsu",
title = "Using Semantic Knowledge of Transactions to Increase
Concurrency",
journal = j-TODS,
volume = "14",
number = "4",
pages = "503--525",
month = dec,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Accepted. Also published in/as: Un. Alberta, DCS,
TR-85-11, Jul. 1985.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-4/p503-farrag/p503-farrag.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-4/p503-farrag/;
http://www.acm.org/pubs/toc/Abstracts/tods/76905.html",
abstract = "When the only information available about transactions
is syntactic information, serializability is the main
correctness criterion for concurrency control.
Serializability requires that the execution of each
transaction must appear to every other transaction as a
single atomic step (i.e., the execution of the
transaction cannot be interrupted by other
transactions). Many researchers, however, have realized
that this requirement is unnecessarily strong for many
applications and can significantly increase transaction
response time. To overcome this problem, a new approach
for controlling concurrency that exploits the semantic
information available about transactions to allow
controlled nonserializable interleavings has recently
been proposed. This approach is useful when the cost of
producing only serializable interleavings is
unacceptably high. The main drawback of the approach is
the extra overhead incurred by utilizing the semantic
information. We examine this new approach in this paper
and discuss its strengths and weaknesses. We introduce
a new formalization for the concurrency control problem
when semantic information is available about the
transactions. This semantic information takes the form
of transaction types, transaction steps, and
transaction break-points. We define a new class of
``safe'' schedules called relatively consistent (RC)
schedules. This class contains serializable as well as
nonserializable schedules. We prove that the execution
of an RC schedule cannot violate consistency and
propose a new concurrency control mechanism that
produces only RC schedules. Our mechanism assumes fewer
restrictions on the interleavings among transactions
than previously introduced semantic-based mechanisms.",
acknowledgement = ack-nhfb,
affiliation = "Dalhousie Univ., Halifax, NS, Canada",
annote = "By setting breakpoints to interleave compatible
transactions. But aborts can require rollbacks or
offsetting transactions. Compatible transactions can
interleave. Nested compatibility in interleaving
transactions.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Theory",
keywords = "algorithms; design; theory",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Concurrency. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems, Transaction processing.",
}
@Article{Ozsoyoglu:1989:QPT,
author = "Gultekin {\"O}zsoyo{\u{g}}lu and Victor Matos and Z.
Meral {\"O}zsoyo{\u{g}}lu",
title = "Query Processing Techniques in the
Summary-Table-by-Example Database Query Language",
journal = j-TODS,
volume = "14",
number = "4",
pages = "526--573",
month = dec,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-4/p526-ozsoyoglu/p526-ozsoyoglu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-4/p526-ozsoyoglu/;
http://www.acm.org/pubs/toc/Abstracts/tods/76906.html",
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.\par
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.
\par
STBE is implemented in a prototype statistical database
management system. We discuss the STBE-related features
of the implemented system.",
acknowledgement = ack-nhfb,
affiliation = "Case Western Reserve Univ., Cleveland, OH, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Languages; Theory",
keywords = "algorithms; design; languages; theory",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages. {\bf H.2.1}: Information Systems, DATABASE
MANAGEMENT, Logical Design, Data models. {\bf G.3}:
Mathematics of Computing, PROBABILITY AND STATISTICS,
Statistical software.",
}
@Article{Grady:1989:EJO,
author = "Dani{\`e}le Grady and Claude Puech",
title = "On the Effect of Join Operations on Relation Sizes",
journal = j-TODS,
volume = "14",
number = "4",
pages = "574--603",
month = dec,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "1 073 203",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-4/p574-grady/p574-grady.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-4/p574-grady/;
http://www.acm.org/pubs/toc/Abstracts/tods/76907.html",
abstract = "We propose a generating function approach to the
problem of evaluating the sizes of derived relations in
a relational database framework. We present a model of
relations and show how to use it to deduce
probabilistic estimations of derived relation sizes.
These are found to asymptotically follow normal
distributions under a variety of assumptions.",
acknowledgement = ack-nhfb,
affiliation = "Univ. Paris-Sud, Orsay, France",
annote = "Polynomial generating function is given; derived
relation sizes asymptotically follow normal
distributions.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Theory",
keywords = "algorithms; design; generating functions; performance;
selectivity estimation; theory; TODS",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf G.2.1}: Mathematics of
Computing, DISCRETE MATHEMATICS, Combinatorics,
Generating functions. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Computations on discrete structures. {\bf H.2.1}:
Information Systems, DATABASE MANAGEMENT, Logical
Design, Schema and subschema. {\bf H.3.3}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Information
Search and Retrieval.",
}
@Article{Lang:1989:UAB,
author = "Sheau-Dong Lang and James R. Driscoll and Jiann H.
Jou",
title = "A Unified Analysis of Batched Searching of Sequential
and Tree-Structured Files",
journal = j-TODS,
volume = "14",
number = "4",
pages = "604--618",
month = dec,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P10 (68P20)",
MRnumber = "1 073 204",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1989-14-4/p604-lang/p604-lang.pdf;
http://www.acm.org/pubs/citations/journals/tods/1989-14-4/p604-lang/;
http://www.acm.org/pubs/toc/Abstracts/tods/76908.html",
abstract = "A direct and unified approach is used to analyze the
efficiency of batched searching of sequential and
tree-structured files. The analysis is applicable to
arbitrary search distributions, and closed-form
expressions are obtained for the expected batched
searching cost and savings. In particular, we consider
a search distribution satisfying Zipf's law for
sequential files and four types of uniform (random)
search distribution for sequential and tree-structured
files. These results unify and extend earlier research
on batched searching and estimating block accesses for
database systems.",
acknowledgement = ack-nhfb,
affiliation = "Central Florida Univ., Orlando, FL, USA",
annote = "closed-form expressions for the number of accesses
needed given arbitrary search distributions.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Theory",
keywords = "algorithms; design; performance; theory",
subject = "{\bf H.3.3}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Search and Retrieval, Search
process. {\bf H.3.2}: Information Systems, INFORMATION
STORAGE AND RETRIEVAL, Information Storage, File
organization. {\bf H.2.2}: Information Systems,
DATABASE MANAGEMENT, Physical Design, Access methods.",
}
@Article{Motro:1989:QDK,
author = "A. Motro and Q. Yuan",
title = "Querying Database Knowledge",
journal = j-TODS,
volume = "14",
number = "4",
pages = "??--??",
month = dec,
year = "1989",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibsource = "Database/Wiederhold.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in \cite{Garcia-Molina:1990:PAS}.",
annote = "The describe statement inquires about the meaning of a
concept under specified circumstances",
fjournal = "ACM Transactions on Database Systems",
xxnote = "This paper does not seem to be published in TODS.",
}
@Article{Liu:1990:IMI,
author = "Ken-Chih C. Liu and Rajshekhar Sunderraman",
title = "Indefinite and Maybe Information in Relational
Databases",
journal = j-TODS,
volume = "15",
number = "1",
pages = "1--39",
month = mar,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "1 073 205",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-1/p1-liu/p1-liu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-1/p1-liu/;
http://www.acm.org/pubs/toc/Abstracts/tods/77644.html",
abstract = "This paper extends the relational model to represent
indefinite and maybe kinds of incomplete information. A
data structure, called an 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.",
acknowledgement = ack-nhfb,
affiliation = "AT\&T Bell Labs., Naperville, IL, USA",
annote = "an I-table is capable of representing indefinite and
maybe facts, is introduced; an operator to remove
redundant facts is presented. The relational algebra is
then extended; user may now expect indefinite as well
as maybe answers",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Theory",
keywords = "design; languages; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages. {\bf E.1}: Data, DATA STRUCTURES, Tables.
{\bf H.3.3}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Search and Retrieval.",
}
@Article{Langerak:1990:VUR,
author = "Rom Langerak",
title = "View Updates in Relational Databases with an
Independent Scheme",
journal = j-TODS,
volume = "15",
number = "1",
pages = "40--66",
month = mar,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "1 073 206",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-1/p40-langerak/p40-langerak.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-1/p40-langerak/;
http://www.acm.org/pubs/toc/Abstracts/tods/77645.html",
abstract = "A view on a database is a mapping that provides a user
or application with a suitable way of looking at the
data. Updates specified on a view have to be translated
into updates on the underlying database. We study the
view update translation problem for a relational data
model in which the base relations may contain (indexed)
nulls.\par
The representative instance is considered to be the
correct representation of all data in the database; the
class of views that is studied consists of total
projections of the representative instance. Only
independent database schemes are considered, that is,
schemes for which global consistency is implied by
local consistency. A view update can be an insertion, a
deletion, or a modification of a single view tuple.
\par
It is proven that the constant complement method of
Bancilhon and Spyratos is too restrictive to be useful
in this context. Structural properties of extension
joins are derived that are important for understanding
views. On the basis of these properties, minimal
algorithms for translating a single view-tuple update
are given.",
acknowledgement = ack-nhfb,
affiliation = "Fac. of Inf., Twente Univ., Enschede, Netherlands",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Theory",
keywords = "design; theory; views TODS, algorithms",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf H.2.1}:
Information Systems, DATABASE MANAGEMENT, Logical
Design, Data models. {\bf H.3.3}: Information Systems,
INFORMATION STORAGE AND RETRIEVAL, Information Search
and Retrieval.",
}
@Article{Whang:1990:QOM,
author = "Kyu-Young Y. Whang and Ravi Krishnamurthy",
title = "Query Optimization in a Memory-Resident Domain
Relational Calculus Database System",
journal = j-TODS,
volume = "15",
number = "1",
pages = "67--95",
month = mar,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-1/p67-whang/p67-whang.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-1/p67-whang/;
http://www.acm.org/pubs/toc/Abstracts/tods/77646.html",
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-residency
assumption. We present an interesting result that a
major 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 issues of
query optimization in memory-resident database systems
and presents practical solutions to them.",
acknowledgement = ack-nhfb,
affiliation = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
annote = "Office-by-example extends the concept of
query-by-example (QBE); disks are used only for
permanent storage of data and backup; The technique is
not a heuristic since it employs a systematic search,
but uses the branch-and-bound algorithm. Uses the
nested-loop join with use of indexes. An index is an
array of tuple identifiers. Assess uses binary search.
When an index entry is inserted, the upper half of the
index is block-copied. In a 3081 processor copying 1 MB
of memory takes less than 0.1 second. Queries in OBE
are in the canonical form, have no substructures. Pure
demand paging is not suitable, the system has a global
goal for paging activities. The set of virtual machines
on the dispatch list is determined.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Experimentation; Languages; Performance",
keywords = "experimentation; languages; Large Main Memory TODS,
algorithms; performance",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages. {\bf H.2.2}: Information Systems, DATABASE
MANAGEMENT, Physical Design, Access methods.",
}
@Article{Herlihy:1990:AVA,
author = "Maurice Herlihy",
title = "Apologizing Versus Asking Permission: Optimistic
Concurrency Control for Abstract Data Types",
journal = j-TODS,
volume = "15",
number = "1",
pages = "96--124",
month = mar,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68N25 (68P15 68Q65)",
MRnumber = "1 073 207",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-1/p96-herlihy/p96-herlihy.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-1/p96-herlihy/;
http://www.acm.org/pubs/toc/Abstracts/tods/77647.html",
abstract = "An optimistic concurrency control technique is one
that allows transactions to execute without
synchronization, relying on commit-time validation to
ensure serializability. Several new optimistic
concurrency control techniques for objects in
decentralized distributed systems are described here,
their correctness and optimality properties are proved,
and the circumstances under which each is likely to be
useful are characterized.\par
Unlike many methods that classify operations only as
Reads or Writes, these techniques systematically
exploit type-specific properties of objects to validate
more interleavings. Necessary and sufficient validation
conditions can be derived directly from an object's
data type specification. These techniques are also
modular: they can be applied selectively on a
per-object (or even per-operation) basis in conjunction
with standard pessimistic techniques such as two-phase
locking, permitting optimistic methods to be introduced
exactly where they will be most effective.\par
These techniques can be used to reduce the algorithmic
complexity of achieving high levels of concurrency,
since certain scheduling decisions that are NP-complete
for pessimistic schedulers can be validated after the
fact in time, independent of the level of concurrency.
These techniques can also enhance the availability of
replicated data, circumventing certain tradeoffs
between concurrency and availability imposed by
comparable pessimistic techniques.",
acknowledgement = ack-nhfb,
affiliation = "Carnegie Mellon Univ., Pittsburgh, PA, USA",
annote = "new optimistic techniques for objects; exploit
type-specific properties of objects to validate
interleavings. These techniques reduce the complexity
of achieving high levels of concurrency and enhance the
availability of replicated data. Deals with hot spots
such as counters, account balances, or queues.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Reliability; Verification",
keywords = "ADT TODS, algorithms; design; reliability;
verification",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Concurrency. {\bf D.3.3}: Software, PROGRAMMING
LANGUAGES, Language Constructs and Features, Abstract
data types. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Distributed systems. {\bf D.4.5}:
Software, OPERATING SYSTEMS, Reliability, Verification.
{\bf D.4.3}: Software, OPERATING SYSTEMS, File Systems
Management, Distributed file systems.",
}
@Article{Wald:1990:EAF,
author = "Joseph A. Wald and Paul G. Sorenson",
title = "Explaining Ambiguity in a Formal Query Language",
journal = j-TODS,
volume = "15",
number = "2",
pages = "125--161",
month = jun,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-2/p125-wald/p125-wald.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-2/p125-wald/;
http://www.acm.org/pubs/toc/Abstracts/tods/78923.html",
abstract = "The problem of generating reasonable natural
language-like responses to queries formulated in
nonnavigational query languages with logical data
independence is addressed. An extended ER model, the
Entity-Relationship-Involvement model, is defined which
assists in providing a greater degree of logical data
independence and the generation of natural language
explanations of a query processor's interpretation of a
query. These are accomplished with the addition of the
concept of an involvement to the model. Based on
involvement definitions in a formally defined data
definition language, DDL, an innovative strategy for
generating explanations is outlined and exemplified. In
the conclusion, possible extensions to the approach are
given.",
acknowledgement = ack-nhfb,
affiliation = "Schlumberger Lab. for Comput. Sci., Austin, TX, USA",
annote = "sorting out paths in the ER model.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages",
keywords = "design; languages",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Schema
and subschema. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems, Query processing. {\bf
H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models.",
}
@Article{Chakravarthy:1990:LBA,
author = "Upen S. Chakravarthy and John Grant and Jack Minker",
title = "Logic-Based Approach to Semantic Query Optimization",
journal = j-TODS,
volume = "15",
number = "2",
pages = "162--207",
month = jun,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-2/p162-chakravarthy/p162-chakravarthy.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-2/p162-chakravarthy/;
http://www.acm.org/pubs/toc/Abstracts/tods/78924.html",
abstract = "The purpose of semantic query optimization is to use
semantic knowledge (e.g., integrity constraints) for
transforming a query into a form that may be answered
more efficiently than the original version. In several
previous papers we described and proved the correctness
of a method for semantic query optimization in
deductive databases couched in first-order logic. This
paper consolidates the major results of these papers
emphasizing the techniques and their applicability for
optimizing relational queries. Additionally, we show
how this method subsumes and generalizes earlier work
on semantic query optimization. We also indicate how
semantic query optimization techniques can be extended
to databases that support recursion and integrity
constraints that contain disjunction, negation, and
recursion.",
acknowledgement = ack-nhfb,
annote = "consolidate results emphasizing the techniques and
their applicability for optimizing relational queries;
recursion and integrity constraints that contain
disjunction, negation, and recursion.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "algorithms; design; performance",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.2.2}: Information
Systems, DATABASE MANAGEMENT, Physical Design, Access
methods. {\bf I.2.3}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving,
Logic programming. {\bf H.2.0}: Information Systems,
DATABASE MANAGEMENT, General, Security, integrity, and
protection. {\bf I.2.8}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Problem Solving, Control
Methods, and Search, Heuristic methods. {\bf I.2.8}:
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Problem Solving, Control Methods, and Search, Plan
execution, formation, generation.",
}
@Article{Whang:1990:LTP,
author = "Kyu-Young Whang and Brad T. {Vander-Zanden} and Howard
M. Taylor",
title = "A Linear-Time Probabilistic Counting Algorithm for
Database Applications",
journal = j-TODS,
volume = "15",
number = "2",
pages = "208--229",
month = jun,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/; Theory/ProbAlgs.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "A probabilistic technique called linear counting,
based on hashing, for counting the number of unique
values in the presence of duplicates is presented in
this paper.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-2/p208-whang/p208-whang.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-2/p208-whang/;
http://www.acm.org/pubs/toc/Abstracts/tods/78925.html",
abstract = "We present a probabilistic algorithm for counting the
number of unique values in the presence of duplicates.
This algorithm has $O$ ($q$) time complexity, where $q$
is the number of values including duplicates, and
produces an estimation with an arbitrary accuracy
prespecified by the user using only a small amount of
space. Traditionally, accurate counts of unique values
were obtained by sorting, which has $O$ ($q$ log $q$)
time complexity. Our technique, called {\em linear
counting}, is based on hashing. We present a
comprehensive theoretical and experimental analysis of
linear counting. The analysis reveals an interesting
result: A load factor (number of unique values/hash
table size) much larger than 1.0 (e.g., 12) can be used
for accurate estimation (e.g., 1% of error). We present
this technique with two important applications to
database problems: namely, (1) obtaining the column
cardinality (the number of unique values in a column of
a relation) and (2) obtaining the join selectivity (the
number of unique values in the join column resulting
from an unconditional join divided by the number of
unique join column values in the relation to he
joined). These two parameters are important statistics
that are used in relational query optimization and
physical database design.",
acknowledgement = ack-nhfb,
affiliation = "Korea Adv. Inst. of Sci. and Technol., Seoul, South
Korea",
annote = "Counting the number of unique values in the presence
of duplicates; $O(n)$ time complexity based on
hashing.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Experimentation; Performance;
Theory",
keywords = "design; experimentation; hashing sampling TODS,
algorithms; performance; theory",
subject = "{\bf G.3}: Mathematics of Computing, PROBABILITY AND
STATISTICS, Probabilistic algorithms (including Monte
Carlo). {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Query processing. {\bf H.2.2}:
Information Systems, DATABASE MANAGEMENT, Physical
Design, Access methods.",
}
@Article{Jajodia:1990:DVA,
author = "Sushil Jajodia and David Mutchler",
title = "Dynamic Voting Algorithms for Maintaining the
Consistency of a Replicated Database",
journal = j-TODS,
volume = "15",
number = "2",
pages = "230--280",
month = jun,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-2/p230-jajodia/p230-jajodia.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-2/p230-jajodia/;
http://www.acm.org/pubs/toc/Abstracts/tods/78926.html",
abstract = "There are several replica control algorithms for
managing replicated files in the face of network
partitioning due to site or communication link
failures. Pessimistic algorithms ensure consistency at
the price of reduced availability; they permit at most
one (distinguished) partition to process updates at any
given time. The best known pessimistic algorithm, {\em
voting}, is a ``static'' algorithm, meaning that all
potential distinguished partitions can be listed in
advance. We present a dynamic extension of voting
called {\em dynamic voting}. This algorithm permits
updates in a partition provided it contains more than
half of the {\em up-to-date\/} copies of the replicated
file. We also present an extension of dynamic voting
called {\em dynamic voting with linearly ordered
copies\/} (abbreviated as {\em dynamic-linear\/}).
These algorithms are dynamic because the order in which
past distinguished partitions were created plays a role
in the selection of the next distinguished partition.
Our algorithms have all the virtues of ordinary voting,
including its simplicity, and provide improved
availability as well. We provide two stochastic models
to support the latter claim. In the first (site) model,
sites may fail but communication links are infallible;
in the second (link) model the reverse is true. We
prove that under the site model, dynamic-linear has
greater availability than any static algorithm,
including weighted voting, if there are four or more
sites in the network. In the link model, we consider
all biconnected five-site networks and a wide variety
of failure and repair rates. In all cases considered,
dynamic-linear had greater availability than any static
algorithm.",
acknowledgement = ack-nhfb,
affiliation = "George Mason Univ., Fairfax, VA, USA",
annote = "mathematical analysis shows that dynamic-linear is
better than static voting algorithms",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Reliability",
keywords = "algorithms; design; performance; reliability",
subject = "{\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases. {\bf D.4.3}: Software, OPERATING
SYSTEMS, File Systems Management, Distributed file
systems. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Distributed systems. {\bf C.4}:
Computer Systems Organization, PERFORMANCE OF SYSTEMS,
Reliability, availability, and serviceability.",
}
@Article{Dasgupta:1990:FCC,
author = "Partha Dasgupta and Zvi M. Kedem",
title = "The Five-Color Concurrency Control Protocol:
Non-Two-Phase Locking in General Databases",
journal = j-TODS,
volume = "15",
number = "2",
pages = "281--307",
month = jun,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "1 156 124",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-2/p281-dasgupta/p281-dasgupta.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-2/p281-dasgupta/;
http://www.acm.org/pubs/toc/Abstracts/tods/78927.html",
abstract = "Concurrency control protocols based on two-phase
locking are a popular family of locking protocols that
preserve serializability in general (unstructured)
database systems. A concurrency control algorithm (for
databases with no inherent structure) is presented that
is practical, non two-phase, and allows varieties of
serializable logs not possible with any commonly known
locking schemes. All transactions are required to
predeclare the data they intend to read or write. Using
this information, the protocol anticipates the
existence (or absence) of possible conflicts and hence
can allow non-two-phase locking.\par
It is well known that serializability is characterized
by acyclicity of the conflict graph representation of
interleaved executions. The two-phase locking protocols
allow only {\em forward\/} growth of the paths in the
graph. The {\em Five Color\/} protocol allows the
conflict graph to grow in any direction (avoiding
two-phase constraints) and prevents cycles in the graph
by maintaining transaction access information in the
form of data-item markers. The read and write set
information can also be used to provide relative
immunity from deadlocks.",
acknowledgement = ack-nhfb,
affiliation = "Georgia Inst. of Technol., Atlanta, GA, USA",
annote = "allow varieties of serializable logs not possible with
known locking schemes; the protocol anticipates the
existence of possible conflicts and hence can allow
non-two-phase locking.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "algorithms; design; performance; predeclared lock sets
TODS",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Concurrency.",
}
@Article{Moore:1990:DTA,
author = "James C. Moore and William B. Richmond and Andrew B.
Whinston",
title = "A Decision-Theoretic Approach to Information
Retrieval",
journal = j-TODS,
volume = "15",
number = "3",
pages = "311--340",
month = sep,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P20",
MRnumber = "91h:68037",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-3/p311-moore/p311-moore.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-3/p311-moore/;
http://www.acm.org/pubs/toc/Abstracts/tods/88597.html",
abstract = "We present the file search problem in a
decision-theoretic framework, and discuss a variation
of it that we call the common index problem. The goal
of the common index problem is to return the best
available record in the file, where {\em best\/} is in
terms of a class of user preferences. We use dynamic
programming to construct an optimal algorithm using two
different optimality criteria, and we develop
sufficient conditions for obtaining complete
information.",
acknowledgement = ack-nhfb,
affiliation = "Purdue Univ., West Lafayette, IN, USA",
annote = "searching a file for a best record rather than a
specific one; the assumption is that the preferences of
the ith individual can be represented as a composite
where preferences are based on the same index for all
users",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Economics; Theory",
keywords = "algorithms; approximate algorithms; design; economics;
economics of information; information retrieval;
theory",
subject = "{\bf E.5}: Data, FILES, Sorting/searching. {\bf
H.3.3}: Information Systems, INFORMATION STORAGE AND
RETRIEVAL, Information Search and Retrieval, Search
process.",
}
@Article{Westland:1990:SOC,
author = "J. Christopher Westland",
title = "Scaling Up Output Capacity and Performance Results
from Information Systems Prototypes",
journal = j-TODS,
volume = "15",
number = "3",
pages = "341--358",
month = sep,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-3/p341-westland/p341-westland.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-3/p341-westland/;
http://www.acm.org/pubs/toc/Abstracts/tods/87943.html",
abstract = "The advantage of information system prototyping arises
from its predict problems and end-user satisfaction
with a system early in the development process, before
significant commitments of time and effort have been
made. Predictions of problems and end-user satisfaction
have risen in importance with the increasing complexity
of business information systems and the exponential
growth of database size. This research investigates the
reporting of information to an end user, and the
process of inferring from a prototype to a full-scale
information system. This inference is called {\em
scaling up}, and is an important part of the systems
development planning process. The research investigates
information systems reporting from a linguistic
perspective, where a database is used as a central
receptacle for information storage. It then
investigates the manner in which reporting statistics
from the prototype information system may be used to
infer the behavior and performance of the full-scale
system. An example is presented for the application of
the algorithm, and the final section discusses the
usefulness, application, and implications of the
algorithm developed in this research.",
acknowledgement = ack-nhfb,
affiliation = "Univ. of Southern California, Los Angeles, CA, USA",
annote = "a coarse introduction, mainly the recall of
information retrieval systems; the mathematics is wrong
and too simple.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "algorithms; design; inclusion-exclusion principle;
performance",
subject = "{\bf H.3.3}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Search and Retrieval. {\bf
C.4}: Computer Systems Organization, PERFORMANCE OF
SYSTEMS, Measurement techniques.",
}
@Article{Alonso:1990:DCI,
author = "Rafael Alonso and Daniel Barbara and H{\'e}ctor
Garc{\'\i}a-Molina",
title = "Data Caching Issues in an Information Retrieval
System",
journal = j-TODS,
volume = "15",
number = "3",
pages = "359--384",
month = sep,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-3/p359-alonso/p359-alonso.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-3/p359-alonso/;
http://www.acm.org/pubs/toc/Abstracts/tods/87848.html",
abstract = "Currently, a variety of information retrieval systems
are available to potential users\ldots{}. While in many
cases these systems are accessed from personal
computers, typically no advantage is taken of the
computing resources of those machines (such as local
processing and storage). In this paper we explore the
possibility of using the user's local storage
capabilities to cache data at the user's site. This
would improve the response time of user queries albeit
at the cost of incurring the overhead required in
maintaining multiple copies. In order to reduce this
overhead it may be appropriate to allow copies to
diverge in a controlled fashion\ldots{}. Thus, we
introduce the notion of quasi-copies, which embodies
the ideas sketched above. We also define the types of
deviations that seem useful, and discuss the available
implementation strategies.",
acknowledgement = ack-nhfb,
affiliation = "Princeton Univ., NJ, USA",
annote = "focus: cache coherency in distributed information
retrieval systems one central server site, data cached
at client site. Less response time, but more overhead
in maintaining multiple copies. To reduce overhead,
allow copies to diverge in a controlled fashion -
notion of ``quasi copies'' and quasi-caching. - users
can precisely define limits for divergence of
quasi-copies. - reduces update propagation overhead -
main difference with materialized views is that here
user can establish degree of coherency - implementation
possibilities: invalidate/refresh out-of-date data,
include automatic expiration date etc. Paper surveys
various implementation strategies and their tradeoffs.
users give two types of conditions on quasi-caches:
selection and coherency. - selection conditions specify
which object images will be cached at the user site. -
modifiers: - Add/drop (add to cache or remove) -
compulsory or advisory (whether caching is to be
enforced or to be taken as a hint) - query optimizer
can take advantage if caching is compulsory - advisory
selection gives greater system flexibility - static /
dynamic (static => objects selected once when the
condition is issued by a user, dynamic => changes in
data cause objects to be added/dropped dynamically). -
triggering delay: specifies acceptable delay for
dynamic selections - coherency conditions define the
allowable deviations between an object and its images.
- default: image must have a valid value (though
out-of-date) - delay: how much time an image may lag
behind an object - version: acceptable lag of how many
versions - periodic: image to be refreshed periodically
- arithmetic: deviations limited by the difference
between the values of the object and its image. - can
also have inter-object consistency constraints.
implementation issues - transmission delays and
failures: ``null'' messages sent out by central site to
check if client is alive etc. - what to propagate: -
data message: contains new values to overwrite old ones
in cache - invalidation message: only identifies
invalid object to be purged from the cache, but does
not contain new values. - version number message:
provides new version numbers only - no new data -
implicit invalidation: no message from central site,
cache images automatically invalidated after a certain
time. - when to propagate: - last minute: delayed until
a selection/coherency condition is about to be
violated. - immediately: as soon as updates occur -
delayed update at central site, so no cache conditions
are violated. - collapsing conditions: - possible to
collapse several coherency conditions on same object
into one - load balancing: central site can partially
off-load enforcement of consistency to clients
describes a probabilistic performance model and
simulation results - simulation parameters are network
traffic, query processing time, update installation
time etc. conclusions: - quasi-caching can potentially
improve performance and availability - problems if: -
selection and consistency constraints are complex -
large number of updates at central site - open issues:
- how much data to cache - how does choice of when to
propagate updates affect performance etc.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Management; Performance",
keywords = "cache coherency; data sharing; design; information
retrieval systems; management; performance",
subject = "{\bf H.3.5}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Online Information Services, Data bank
sharing. {\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases. {\bf D.4.7}: Software, OPERATING
SYSTEMS, Organization and Design, Distributed systems.
{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Distributed systems.",
}
@Article{Kifer:1990:CTQ,
author = "Michael Kifer and Eliezer L. Lozinskii",
title = "On Compile-Time Query Optimization In Deductive
Databases By Means of Static Filtering",
journal = j-TODS,
volume = "15",
number = "3",
pages = "385--426",
month = sep,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "1 081 178",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-3/p385-kifer/p385-kifer.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-3/p385-kifer/;
http://www.acm.org/pubs/toc/Abstracts/tods/87121.html",
abstract = "We extend the query optimization techniques known as
algebraic manipulations with relational expressions
[48] to work with deductive databases. In particular,
we propose a method for moving data-independent
selections and projections into recursive axioms, which
extends all other known techniques for performing that
task [2, 3, 9, 18, 20]. We also show that, in a
well-defined sense, our algorithm is optimal among the
algorithms that propagate data-independent selections
through recursion.",
acknowledgement = ack-nhfb,
affiliation = "State Univ. of New York, Stony Brook, NY, USA",
annote = "Discusses algebraic optimizations for logic
programs.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Management; Performance; Theory",
keywords = "algorithms; dataflow; deductive databases; design;
filtering; fixpoint; graph representation; inference;
management; performance; projection; recursive rules;
selection; theory",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.3.3}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Information
Search and Retrieval, Selection process. {\bf I.2.3}:
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Deduction and Theorem Proving, Deduction. {\bf I.2.8}:
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Problem Solving, Control Methods, and Search, Graph and
tree search strategies.",
}
@Article{Agrawal:1990:DTC,
author = "Rakesh Agrawal and Shaul Dar and H. V. Jagadish",
title = "Direct Transitive Closure Algorithms: Design and
Performance Evaluation",
journal = j-TODS,
volume = "15",
number = "3",
pages = "427--458",
month = sep,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15 (68Q25 68R05)",
MRnumber = "91h:68029",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-3/p427-agrawal/p427-agrawal.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-3/p427-agrawal/;
http://www.acm.org/pubs/toc/Abstracts/tods/88888.html",
abstract = "We present new algorithms for computing transitive
closure of large database relations. Unlike iterative
algorithms, such as the seminaive and logarithmic
algorithms, the termination of our algorithms does not
depend on the length of paths in the underlying graph
(hence the name {\em direct\/} algorithms). Besides
reachability computations, the proposed algorithms can
also be used for solving path problems. We discuss
issues related to the efficient implementation of these
algorithms, and present experimental results that show
the direct algorithms perform uniformly better than the
iterative algorithms. A side benefit of this work is
that we have proposed a new methodology for evaluating
the performance of recursive queries.",
acknowledgement = ack-nhfb,
affiliation = "AT\&T Bell Labs., Murray Hill, NJ, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Experimentation; Performance",
keywords = "deductive databases; design; experimentation;
performance; query processing; recursive query
processing TODS, algorithms; transitive closure",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems. {\bf I.2.8}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Problem Solving, Control
Methods, and Search. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems.",
}
@Article{Zhang:1990:NSC,
author = "Weining Zhang and Clement T. Yu and Daniel Troy",
title = "Necessary and Sufficient Conditions to Linearize
Doubly Recursive Programs in Logic Databases",
journal = j-TODS,
volume = "15",
number = "3",
pages = "459--482",
month = sep,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15 (68T15)",
MRnumber = "91h:68036",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-3/p459-zhang/p459-zhang.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-3/p459-zhang/;
http://www.acm.org/pubs/toc/Abstracts/tods/89237.html",
abstract = "Linearization of nonlinear recursive programs is an
important issue in logic databases for both practical
and theoretical reasons. If a nonlinear recursive
program can be transformed into an equivalent linear
recursive program, then it may be computed more
efficiently than when the transformation is not
possible. We provide a set of necessary and sufficient
conditions for a simple doubly recursive program to be
equivalent to a simple linear recursive program. The
necessary and sufficient conditions can be verified
effectively.",
acknowledgement = ack-nhfb,
acmcrnumber = "9211-0888",
affiliation = "Illinois Univ., Chicago, IL, USA",
annote = "extends authors' previous results",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Theory",
keywords = "CTYU TODS, algorithms; design; logic database;
theory",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf I.2.3}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
Theorem Proving, Logic programming.",
}
@Article{Can:1990:CEC,
author = "Fazli Can and Esen A. Ozkarahan",
title = "Concepts and Effectiveness of the
Cover-Coefficient-Based Clustering Methodology for Text
Databases",
journal = j-TODS,
volume = "15",
number = "4",
pages = "483--517",
month = dec,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-4/p483-can/p483-can.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-4/p483-can/;
http://www.acm.org/pubs/toc/Abstracts/tods/99938.html",
abstract = "A new algorithm for document clustering is introduced.
The base concept of the algorithm, the cover
coefficient (CC) concept, provides a means of
estimating the number of clusters within a document
database and related indexing and clustering
analytically. The CC concept is used also to identify
the cluster seeds and to form clusters with these
seeds. It is shown that the complexity of the
clustering process is very low. The retrieval
experiments show that the information-retrieval
effectiveness of the algorithm is compatible with a
very demanding complete linkage clustering method that
is known to have good retrieval performance. The
experiments also show that the algorithm is 15.1 to
63.5 (with an average of 47.5) percent better than four
other clustering algorithms in cluster-based
information retrieval. The experiments have validated
the indexing-clustering relationships and the
complexity of the algorithm and have shown improvements
in retrieval effectiveness. In the experiments two
document databases are used: TODS214 and INSPEC. The
latter is a common database with 12,684 documents.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Syst. Anal., Miami Univ., Oxford, OH, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Experimentation",
keywords = "cluster validity; clustering-indexing relationships;
cover coefficient; decoupling coefficient; design;
document retrieval; experimentation; Inf. retrieval
TODS, algorithms; retrieval effectiveness",
subject = "{\bf H.3.3}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Search and Retrieval,
Clustering. {\bf H.3.1}: Information Systems,
INFORMATION STORAGE AND RETRIEVAL, Content Analysis and
Indexing, Indexing methods. {\bf H.3.6}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Library
Automation, Large text archives. {\bf I.7.0}: Computing
Methodologies, TEXT PROCESSING, General.",
}
@Article{Nakano:1990:TOR,
author = "Ryohei Nakano",
title = "Translation with Optimization from Relational Calculus
to Relational Algebra Having Aggregate Functions",
journal = j-TODS,
volume = "15",
number = "4",
pages = "518--557",
month = dec,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P10",
MRnumber = "1 093 243",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-4/p518-nakano/p518-nakano.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-4/p518-nakano/;
http://www.acm.org/pubs/toc/Abstracts/tods/99943.html",
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
having both aggregate functions and null values to
optimized relational algebra expressions. Thus, logical
optimization is carried out through translation. The
translation method comprises two parts: the
translational 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.\par
\ldots{} 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",
acknowledgement = ack-nhfb,
affiliation = "Knowledge Syst. Lab., NTT Commun. and Inf. Process.
Lab., Kanagawa, Japan",
annote = "a rule-based translation method from expressions
having aggregate functions being a two-phase rewriting
strategy; experiment with many queries shows that
heuristic rules are essential in optimization; the
translation will from the front end of a database
machine, MACH, developed by the author.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Theory",
keywords = "algorithms; languages; theory",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Query
processing.",
}
@Article{Jagadish:1990:CTM,
author = "H. V. Jagadish",
title = "A Compression Technique to Materialize Transitive
Closure",
journal = j-TODS,
volume = "15",
number = "4",
pages = "558--598",
month = dec,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P10",
MRnumber = "1 093 244",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-4/p558-jagadish/p558-jagadish.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-4/p558-jagadish/;
http://www.acm.org/pubs/toc/Abstracts/tods/99944.html",
abstract = "An important feature of database support for expert
systems is the ability of the database to answer
queries regarding the existence of a path from one node
to another in the directed graph underlying some
database relation. Given just the database relation,
answering such a query is time-consuming, but given the
transitive closure of the database relation a table
look-up suffices. We present an indexing scheme that
permits the storage of the pre-computed transitive
closure of a database relation in a compressed form.
The existence of a specified tuple in the closure can
be determined from this compressed store by a single
look-up followed by an index comparison. We show how to
add nodes and arcs to the compressed closure
incrementally. We also suggest how this compression
technique can be used to reduce the effort required to
compute the transitive closure.",
acknowledgement = ack-nhfb,
affiliation = "AT\&T Bell Lab., Murray Hill, NJ, USA",
annote = "an indexing scheme that permits the storage of the
pre-computed transitive closure",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "performance; recursive query processing TODS,
algorithms",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf I.2.1}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Applications
and Expert Systems. {\bf I.2.8}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Problem
Solving, Control Methods, and Search.",
}
@Article{Omiecinski:1990:PAR,
author = "Edward Omiecinski and Peter Scheuermann",
title = "A Parallel Algorithm for Record Clustering",
journal = j-TODS,
volume = "15",
number = "4",
pages = "599--624",
month = dec,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P20 (68Q25)",
MRnumber = "1 093 245",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-4/p599-omiecinski/p599-omiecinski.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-4/p599-omiecinski/;
http://www.acm.org/pubs/toc/Abstracts/tods/99947.html",
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 among the
queries.",
acknowledgement = ack-nhfb,
affiliation = "Sch. of Inf. and Comput. Sci., Georgia Inst. of
Technol., Atlanta, GA, USA",
annote = "for SIMD machine",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Experimentation; Performance",
keywords = "design; experimentation; performance; Physical
database design TODS, algorithms",
subject = "{\bf H.3.3}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Search and Retrieval,
Clustering. {\bf C.1.2}: Computer Systems Organization,
PROCESSOR ARCHITECTURES, Multiple Data Stream
Architectures (Multiprocessors),
Single-instruction-stream, multiple-data-stream
processors (SIMD). {\bf F.2.2}: Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Nonnumerical Algorithms and Problems, Sequencing and
scheduling. {\bf H.3.2}: Information Systems,
INFORMATION STORAGE AND RETRIEVAL, Information Storage.
{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design.",
}
@Article{Lomet:1990:HTM,
author = "David B. Lomet and Betty Salzberg",
title = "The {hB-Tree}: {A} Multiattribute Indexing Method with
Good Guaranteed Performance",
journal = j-TODS,
volume = "15",
number = "4",
pages = "625--658",
month = dec,
year = "1990",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1990-15-4/p625-lomet/p625-lomet.pdf;
http://www.acm.org/pubs/citations/journals/tods/1990-15-4/p625-lomet/;
http://www.acm.org/pubs/toc/Abstracts/tods/99949.html",
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 that 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.",
acknowledgement = ack-nhfb,
annote = "multiattributable index; node splitting produces nodes
that can be characterized as holey bricks",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Performance",
keywords = "design; multi dimensional range queries TODS;
performance",
subject = "{\bf E.1}: Data, DATA STRUCTURES, Trees. {\bf H.2.2}:
Information Systems, DATABASE MANAGEMENT, Physical
Design, Access methods. {\bf H.3.2}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Information
Storage, File organization.",
}
@Article{Abiteboul:1991:RBL,
author = "Serge Abiteboul and St{\'e}phane Grumbach",
title = "A Rule-Based Language with Functions and Sets",
journal = j-TODS,
volume = "16",
number = "1",
pages = "1--30",
month = mar,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68Q45 (68N17 68P15)",
MRnumber = "92a:68067",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-1/p1-abiteboul/p1-abiteboul.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-1/p1-abiteboul/;
http://www.acm.org/pubs/toc/Abstracts/tods/103141.html",
abstract = "A logic based language for manipulating complex
objects constructed using set and tuple constructors is
introduced. A key feature of the COL language is the
use of base and derived data functions. Under some
stratification restrictions, the semantics of programs
is given by a minimal and justified model that can be
computed using a finite sequence of fixpoints. The
language is extended using external functions and
predicates. An implementation of COL in a functional
language is briefly discussed.",
acknowledgement = ack-nhfb,
affiliation = "INRIA, Le Chesnay, France",
annote = "the COL language uses base and derived data
functions",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Theory",
keywords = "complex objects; deductive databases; deductive
knowledge TODS, design; fixpoint semantics; knowledge
bases; languages; object-oriented databases; rule
based; theory",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages. {\bf H.2.1}: Information Systems, DATABASE
MANAGEMENT, Logical Design. {\bf I.2.3}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
Theorem Proving. {\bf F.4.1}: Theory of Computation,
MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
Logic, Logic programming.",
}
@Article{Mendelzon:1991:FDH,
author = "Alberto O. Mendelzon and Peter T. Wood",
title = "Functional dependencies in {Horn} clause queries",
journal = j-TODS,
volume = "16",
number = "1",
pages = "31--55",
month = mar,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P20 (68N17)",
MRnumber = "92b:68028",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-1/p31-mendelzon/p31-mendelzon.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-1/p31-mendelzon/;
http://www.acm.org/pubs/toc/Abstracts/tods/103142.html",
abstract = "When a database query is expressed as a set of Horn
clauses whose execution is by top-down resolution of
goals, there is a need to improve the backtracking
behavior of the interpreter. Rather than putting on the
programmer the onus of using extra-logical operators
such as {\em cut\/} to improve performance, we show
that some uses of the cut can be automated by inferring
them from functional dependencies. This requires some
knowledge of which variables are guaranteed to be bound
at query execution time; we give a method for deriving
such information using data flow analysis.",
acknowledgement = ack-nhfb,
affiliation = "Comput. Syst. Res. Inst., Toronto Univ., Ont.,
Canada",
annote = "some uses of the cut can be automated by inferring
them; this requires knowledge of which variables are
bound at execution time",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Theory",
keywords = "data flow analysis; design; functional dependency;
logic programming; performance; relational database;
theory; theory deductive knowledge TODS, algorithms",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf I.2.3}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
Theorem Proving, Deduction. {\bf I.2.3}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
Theorem Proving, Logic programming.",
}
@Article{Meghini:1991:COF,
author = "C. Meghini and C. Thanos",
title = "The Complexity of Operations on a Fragmented
Relation",
journal = j-TODS,
volume = "16",
number = "1",
pages = "56--87",
month = mar,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15 (68Q25)",
MRnumber = "92g:68036",
MRreviewer = "K. Marguerite Hafen",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-1/p56-meghini/p56-meghini.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-1/p56-meghini/;
http://www.acm.org/pubs/toc/Abstracts/tods/103143.html",
abstract = "Data fragmentation is an important aspect of
distributed database design, in which portions of
relations, tailored to the specific needs of local
applications, are defined to be further allocated to
the sites of the computer network supporting the
database system. In this paper we present a theory of
fragmentation with overlapping fragments to study the
complexity of the problems involved in checking the
completeness of a fragmentation schema and in querying
and updating a fragmented relation. We analyze these
problems from the complexity viewpoint and present
sound and complete algorithms for their solution.",
acknowledgement = ack-nhfb,
affiliation = "Istituto di Elaborazione della Inf., CNR, Pisa,
Italy",
annote = "Proposes a two-step process to reconstruct first
minimal horizontal, then vertical covers. When
fragments overlap, optimization becomes intractible.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Theory;
Verification",
keywords = "algorithms; completeness of fragmentation schemas;
design; NP-hardness; performance; query optimization;
relation fragmentation; theory; updates; verification",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Distributed systems. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Query
processing. {\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.
{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf F.1.3}:
Theory of Computation, COMPUTATION BY ABSTRACT DEVICES,
Complexity Classes.",
}
@Article{Rabitti:1991:MAN,
author = "Fausto Rabitti and Elisa Bertino and Won Kim and
Darrell Woelk",
title = "A Model of Authorization for Next-Generation Database
Systems",
journal = j-TODS,
volume = "16",
number = "1",
pages = "88--131",
month = mar,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-1/p88-rabitti/p88-rabitti.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-1/p88-rabitti/;
http://www.acm.org/pubs/toc/Abstracts/tods/103144.html",
abstract = "The conventional models of authorization have been
designed for database systems supporting the
hierarchical, network, and relational models of data.
However, these models are not adequate for
next-generation database systems that support richer
data models that include object-oriented concepts and
semantic data modeling concepts. Rabitti, Woelk, and
Kim [14] presented a preliminary model of authorization
for use as the basis of an authorization mechanism in
such database systems. In this paper we present a
fuller model of authorization that fills a few major
gaps that the conventional models of authorization
cannot fill for next-generation database systems. We
also further formalize the notion of implicit
authorization and refine the application of the notion
of implicit authorization to object-oriented and
semantic modeling concepts. We also describe a user
interface for using the model of authorization and
consider key issues in implementing the authorization
model.",
acknowledgement = ack-nhfb,
affiliation = "Microelectronics and Comput. Technol. Corp., CNR,
Pisa, Italy",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Security; Theory",
keywords = "object-oriented database; security; security access
control TODS, design; semantic database; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf D.1.5}: Software,
PROGRAMMING TECHNIQUES, Object-oriented Programming.
{\bf H.2.0}: Information Systems, DATABASE MANAGEMENT,
General, Security, integrity, and protection.",
}
@Article{Weikum:1991:PRS,
author = "Gerhard Weikum",
title = "Principles and Realization Strategies of Multilevel
Transaction Management",
journal = j-TODS,
volume = "16",
number = "1",
pages = "132--180",
month = mar,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-1/p132-weikum/p132-weikum.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-1/p132-weikum/;
http://www.acm.org/pubs/toc/Abstracts/tods/103145.html",
abstract = "One of the demands of database system transaction
management is to achieve a high degree of concurrency
by taking into consideration the semantics of
high-level operations. On the other hand, the
implementation of such operations must pay attention to
conflicts on the storage representation levels below.
To meet these requirements in a layered architecture,
we propose a multilevel transaction management
utilizing layer-specific semantics. Based on the
theoretical notion of multilevel serializability, a
family of concurrency control strategies is developed.
Suitable recovery protocols are investigated for
aborting single transactions and for restarting the
system after a crash. The choice of levels involved in
a multilevel transaction strategy reveals an inherent
trade-off between increased concurrency and growing
recovery costs. A series of measurements has been
performed in order to compare several strategies.
Preliminary results indicate considerable performance
gains of the multilevel transaction approach.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., ETH Zurich, Switzerland",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Management; Performance;
Reliability",
keywords = "atomicity persistence concurrency control; concurrency
control recovery atomicity nested transactions TODS,
algorithms; design; management; multilevel
transactions; performance; persistence; reliability;
serializability",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf D.4.1}: Software,
OPERATING SYSTEMS, Process Management, Concurrency.
{\bf H.2.7}: Information Systems, DATABASE MANAGEMENT,
Database Administration, Logging and recovery. {\bf
D.4.1}: Software, OPERATING SYSTEMS, Process
Management, Synchronization.",
}
@Article{Wolfson:1991:MPR,
author = "Ouri Wolfson and Amir Milo",
title = "The Multicast Policy and its Relationship to
Replicated Data Placement",
journal = j-TODS,
volume = "16",
number = "1",
pages = "181--205",
month = mar,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15 (68M10)",
MRnumber = "92a:68042",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "See corrigendum in \cite{Wolfson:1991:CMP}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-1/p181-wolfson/p181-wolfson.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-1/p181-wolfson/;
http://www.acm.org/pubs/toc/Abstracts/tods/103146.html",
abstract = "In this paper we consider the communication complexity
of maintaining the replicas of a logical data-item, in
a database distributed over a computer network. We
propose a new method, called the minimum spanning tree
write, by which a processor in the network should
multicast a write of a logical data-item, to all the
processors that store replicas of the items. Then we
show that the minimum spanning tree write is optimal
from the communication cost point of view. We also
demonstrate that the method by which a write is
multicast to all the replicas of a data-item affects
the optimal replication scheme of the item, i.e., at
which processors in the network the replicas should be
located. Therefore, next we consider the problem of
determining an optimal replication scheme for a data
item, assuming that each processor employs the minimum
spanning tree write at run-time. The problem for
general networks is shown NP-Complete, but we provide
efficient algorithms to obtain an optimal allocation
scheme for three common types of network topologies.
They are completely-connected, tree, and ring networks.
For these topologies, efficient algorithms are also
provided for the case in which reliability
considerations dictate a minimum number of replicas.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Columbia Univ., New York, NY,
USA",
annote = "mimumun spanning tree write and multicast to store
replicas",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance; Theory",
keywords = "181 TODS, algorithms; complexity; computer network;
file allocation; message passing; NP-Complete;
performance; theory",
subject = "{\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases. {\bf C.4}: Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf C.2.1}:
Computer Systems Organization, COMPUTER-COMMUNICATION
NETWORKS, Network Architecture and Design. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Distributed systems.",
}
@Article{Casanova:1991:STM,
author = "M. A. Casanova and A. L. Furtado and L. Tucherman",
title = "A Software Tool for Modular Database Design",
journal = j-TODS,
volume = "16",
number = "2",
pages = "209--234",
month = jun,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-2/p209-casanova/p209-casanova.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-2/p209-casanova/;
http://www.acm.org/pubs/toc/Abstracts/tods/103711.html",
abstract = "A modularization discipline for database schemas is
first described. The discipline incorporates both a
strategy for enforcing integrity constraints and a
tactic for organizing large sets of database
structures, integrity constraints, and operations. A
software tool that helps the development and
maintenance of database schemas modularized according
to the discipline is then presented. It offers a
user-friendly interface that guides the designer
through the various stages of the creation of a new
module or through the process of changing objects of
existing modules. The tool incorporates, in a
declarative style, a description of the design and
redesign rules behind the modularization discipline,
hence facilitating the incremental addition of new
expertise about database design.",
acknowledgement = ack-nhfb,
affiliation = "Rio Sci. Center, IBM Brazil, Rio de Janeiro, Brazil",
annote = "first modularize, then use the tool to develop and
maintain schemas; functions declared to enforce
constraints",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages",
keywords = "abstract data types; consistency preservation; design;
encapsulation; integrity constraints; languages;
logical database design; modular design; module
constructors",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf D.2.2}:
Software, SOFTWARE ENGINEERING, Tools and Techniques.
{\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language
Constructs and Features, Modules, packages. {\bf
H.2.7}: Information Systems, DATABASE MANAGEMENT,
Database Administration.",
}
@Article{VanGelder:1991:STR,
author = "Allen {Van Gelder} and Rodney W. Topor",
title = "Safety and Translation of Relational Calculus
Queries",
journal = j-TODS,
volume = "16",
number = "2",
pages = "235--278",
month = jun,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P20",
MRnumber = "92c:68037",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-2/p235-van_gelder/p235-van_gelder.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-2/p235-van_gelder/;
http://www.acm.org/pubs/toc/Abstracts/tods/103712.html",
abstract = "Not all queries in relational calculus can be answered
sensibly when disjunction, negation, and universal
quantification are allowed. The class of relation
calculus queries or formulas that have sensible answers
is called the {\em domain independent\/} class which is
known to be undecidable. Subsequent research has
focused on identifying large decidable subclasses of
domain independent formulas. In this paper we
investigate the properties of two such classes: the
{\em evaluable\/} formulas and the {\em allowed\/}
formulas. Although both classes have been defined
before, we give simplified definitions, present short
proofs of their main properties, and describe a method
to incorporate equality.\par
Although evaluable queries have sensible answers, it is
not straightforward to compute them efficiently or
correctly. We introduce {\em relational algebra normal
form\/} for formulas from which form the correct
translation into relational algebra is trivial. We give
algorithms to transform an evaluable formula into an
equivalent {\em allowed\/} formula and from there into
relational algebra normal form. Our algorithms avoid
use of the so-called {\em Dom\/} relation, consisting
of all constants appearing in the database or the
query.\par
Finally, we describe a restriction under which every
domain independent formula is evaluable and argue that
the class of evaluable formulas is the largest
decidable subclass of the domain independent formulas
that can be efficiently recognized.",
acknowledgement = ack-nhfb,
affiliation = "California Univ., Santa Cruz, CA, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Theory",
keywords = "allowed formulas; domain independence; evaluable
formulas; existential normal; query translation;
relational algebra; relational calculus",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages. {\bf F.4.1}: Theory of Computation,
MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
Logic, Model theory.",
}
@Article{Shasha:1991:OEQ,
author = "Dennis Shasha and Tsong-Li L. Wang",
title = "Optimizing Equijoin Queries in Distributed Databases
where Relations are Hash-Partitioned",
journal = j-TODS,
volume = "16",
number = "2",
pages = "279--308",
day = "1",
month = jun,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P20",
MRnumber = "92c:68036",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/; UnCover library
database",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-2/p279-shasha/p279-shasha.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-2/p279-shasha/;
http://www.acm.org/pubs/toc/Abstracts/tods/103713.html",
abstract = "Consider the class of distributed database systems
consisting of a set of nodes connected by a high
bandwidth network. Each node consists of a processor, a
random access memory, and a slower but much larger
memory such as a disk. There is no shared memory among
the nodes. The data are horizontally partitioned often
using a hash function. Such a description characterizes
many parallel or distributed database systems that have
recently been proposed, both commercial and academic.
We study the optimization problem that arises when the
query processor must repartition the relations and
intermediate results participating in a multijoin
query. Using estimates of the sizes of intermediate
relations, we show (1) optimum solutions for closed
chain queries; (2) the NP-completeness of the
optimization problem for star, tree, and general graph
queries; and (3) effective heuristics for these hard
cases.\par
Our general approach and many of our results extend to
other attribute partitioning schemes, for example,
sort-partitioning on attributes, and to partitioned
object databases.",
acknowledgement = ack-nhfb,
affiliation = "Courant Inst. of Math. Sci., New York Univ., NY, USA",
annote = "No shared memory so that processor must repartition
the relations and intermediate results in a multijoin
query for lost hashkeys (not dynamic optimization);
optimum solutions for closed chain queries,
NP-completeness of star, tree, and general graph
queries and effective heuristics.",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance; Theory",
keywords = "algorithms; equijoin; hashing; NP-complete problems;
performance; relational data models; spanning trees;
systems; theory",
subject = "{\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Distributed
systems. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Query processing. {\bf C.4}:
Computer Systems Organization, PERFORMANCE OF
SYSTEMS.",
}
@Article{Cesarini:1991:DHM,
author = "F. Cesarini and G. Soda",
title = "A Dynamic Hash Method with Signature",
journal = j-TODS,
volume = "16",
number = "2",
pages = "309--337",
day = "1",
month = jun,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/; UnCover library
database",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-2/p309-cesarini/p309-cesarini.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-2/p309-cesarini/;
http://www.acm.org/pubs/toc/Abstracts/tods/103714.html",
abstract = "We present a dynamic external hash method that allows
retrieval of a record by only one access to mass
storage while maintaining a high load factor. The hash
function is based on generalized spiral storage. Both
primary and overflow records are allocated to the same
file, and file expansion depends on being able to
allocate every overflow chain to one bucket. An in-core
index, built by means of a signature function,
discriminates between primary and overflow records and
assures one access to storage in the case of either
successful or unsuccessful searching. Simulation
results confirm the good expected performance.",
acknowledgement = ack-nhfb,
affiliation = "Dipartimento di Sistemi e Inf., Florence Univ.,
Italy",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "algorithms; design; dynamic hashing; external hashing;
generalized spiral storage; performance; signature
functions",
subject = "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Access methods. {\bf H.3.3}:
Information Systems, INFORMATION STORAGE AND RETRIEVAL,
Information Search and Retrieval, Retrieval models.
{\bf E.2}: Data, DATA STORAGE REPRESENTATIONS,
Hash-table representations. {\bf H.3.3}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Information
Search and Retrieval. {\bf E.5}: Data, FILES.",
}
@Article{King:1991:MRB,
author = "Richard P. King and Nagui Halim and H{\'e}ctor
Garc{\'\i}a-Molina and Christos A. Polyzois",
title = "Management of a Remote Backup Copy for Disaster
Recovery",
journal = j-TODS,
volume = "16",
number = "2",
pages = "338--368",
month = jun,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-2/p338-king/p338-king.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-2/p338-king/;
http://www.acm.org/pubs/toc/Abstracts/tods/103715.html",
abstract = "A remote backup database system tracks the state of a
primary system, taking over transaction processing when
disaster hits the primary site. The primary and backup
sites are physically isolated so that failures at one
site are unlikely to propagate to the other. For
correctness, the execution schedule at the backup must
be equivalent to that at the primary. When the primary
and backup sites contain a single processor, it is easy
to achieve this property. However, this is harder to do
when each site contains multiple processors and sites
are connected via multiple communication lines. We
present an efficient transaction processing mechanism
for multiprocessor systems that guarantees this and
other important properties. We also present a database
initialization algorithm that copies the database to a
backup site while transactions are being processed.",
acknowledgement = ack-nhfb,
affiliation = "IBM T.J. Watson Research Center, Yorktown Heights, NY,
USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Reliability",
keywords = "algorithms; database initialization; hot spare; hot
standby; reliability; remote backup",
subject = "{\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Transaction
processing. {\bf D.4.5}: Software, OPERATING SYSTEMS,
Reliability, Backup procedures. {\bf H.2.7}:
Information Systems, DATABASE MANAGEMENT, Database
Administration, Logging and recovery.",
}
@Article{Gogolla:1991:TSV,
author = "Martin Gogolla and Uwe Hohenstein",
title = "Towards a Semantic View of an Extended
Entity-Relationship Model",
journal = j-TODS,
volume = "16",
number = "3",
pages = "369--416",
month = sep,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68Q55 (68P15 68Q60)",
MRnumber = "1 131 140",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
Distributed/gesturing.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-3/p369-gogolla/p369-gogolla.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-3/p369-gogolla/;
http://www.acm.org/pubs/toc/Abstracts/tods/111200.html",
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.\par
This paper introduces an extended ER model
concentrating nearly all concepts 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 yielding a finite
result, and to be (at least) as expressive as the
relational calculi.",
acknowledgement = ack-nhfb,
affiliation = "Tech. Univ. Braunschweig, Germany",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Theory",
keywords = "abstract data type; aggregate function; calculus;
design; entity-relationship model; formal semantics;
languages; relational completeness; safeness; semantic
data model; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf F.3.1}: Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS,
Specifying and Verifying and Reasoning about Programs,
Specification techniques. {\bf F.3.2}: Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics
of Programming Languages. {\bf D.3.1}: Software,
PROGRAMMING LANGUAGES, Formal Definitions and Theory,
Semantics. {\bf H.2.3}: Information Systems, DATABASE
MANAGEMENT, Languages, Query languages.",
}
@Article{Sciore:1991:UAS,
author = "Edward Sciore",
title = "Using Annotations to Support Multiple Kinds of
Versioning in an Object- Oriented Database System",
journal = j-TODS,
volume = "16",
number = "3",
pages = "417--438",
month = sep,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-3/p417-sciore/p417-sciore.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-3/p417-sciore/;
http://www.acm.org/pubs/toc/Abstracts/tods/111205.html",
abstract = "The concept of {\em annotation\/} from object-oriented
languages is adapted to object-oriented databases. It
is shown how annotations can be used to model
activities such as constraint checking, default values,
and triggers. Annotations also are an appropriate way
to model different versioning concepts. This paper
discusses three kinds of versioning---histories,
revisions, and alternatives---and demonstrates how each
one can be modeled effectively using annotations. The
use of annotations also allows other kinds of
versioning to be defined extensibly, and arbitrary
combinations of versions can be handled easily.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Boston Coll., Chestnut Hill,
MA, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages",
keywords = "configuration management; design; languages;
object-oriented databases; versions",
subject = "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
Classifications, Object-oriented languages. {\bf
H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages. {\bf D.1.5}: Software, PROGRAMMING
TECHNIQUES, Object-oriented Programming.",
}
@Article{Karabeg:1991:SRC,
author = "Dino Karabeg and Victor Vianu",
title = "Simplification Rules and Complete Axiomatization for
Relational Update Transactions",
journal = j-TODS,
volume = "16",
number = "3",
pages = "439--475",
month = sep,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15 (68P20)",
MRnumber = "92g:68033",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-3/p439-karabeg/p439-karabeg.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-3/p439-karabeg/;
http://www.acm.org/pubs/toc/Abstracts/tods/111208.html",
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 efficiently 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.",
acknowledgement = ack-nhfb,
affiliation = "California Univ., San Diego, La Jolla, CA, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Theory",
keywords = "algorithms; design; performance; theory",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf H.2.1}:
Information Systems, DATABASE MANAGEMENT, Logical
Design. {\bf F.2.2}: Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems. {\bf G.2.2}: Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Graph
algorithms.",
}
@Article{Yu:1991:RTR,
author = "Philip S. Yu and Avraham Leff and Yann-Hang Lee",
title = "On Robust Transaction Routing and Load Sharing",
journal = j-TODS,
volume = "16",
number = "3",
pages = "476--512",
month = sep,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-3/p476-yu/p476-yu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-3/p476-yu/;
http://www.acm.org/pubs/toc/Abstracts/tods/111210.html",
abstract = "In this paper we examine the issue of robust
transaction routing in a locally distributed database
environment where transaction characteristics such as
reference locality imply that certain processing
systems can be identified as being more suitable than
others for a given transaction class. A response time
based routing strategy can strike a balance between
indiscriminate sharing of the load and routing based
only on transaction affinity. Since response time
estimates depend on workload and system parameters that
may not be readily available, it is important to
examine the robustness of routing decisions to
information accuracy. We find that a strategy which
strictly tries to minimize the response time of
incoming transactions is sensitive to the accuracy of
certain parameter values. On the other hand, naive
strategies, that simply ignore the parameters in making
routing decisions, have even worse performance. Three
alternative strategies are therefore examined:
threshold, discriminatory, and adaptive. Instead of
just optimizing an incoming transaction's response
time, the first two strategies pursue a strategy that
is somewhat more oriented towards global optimization.
This is achieved by being more restrictive on either
the condition or the candidate for balancing the load.
The third strategy, while trying to minimize the
response time of individual incoming transactions,
employs a feedback process to adaptively adjust future
response time estimates. It monitors the discrepancy
between the actual and estimated response times and
introduces a correction factor based on regression
analysis. All three strategies are shown to be robust
with respect to the accuracy of workload and system
parameters used in the response time estimation.",
acknowledgement = ack-nhfb,
affiliation = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Performance",
keywords = "design; distributed database; load balancing;
performance analysis; performance, PSYU TODS;
transaction routing",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Routing and layout. {\bf D.4.8}: Software, OPERATING
SYSTEMS, Performance. {\bf D.4.1}: Software, OPERATING
SYSTEMS, Process Management. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Distributed
systems.",
}
@Article{Negri:1991:FSS,
author = "M. Negri and G. Pelagatti and L. Sbattella",
title = "Formal Semantics of {SQL} Queries",
journal = j-TODS,
volume = "16",
number = "3",
pages = "513--534",
month = sep,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P20 (03B50 03B70)",
MRnumber = "92i:68033",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-3/p513-negri/p513-negri.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-3/p513-negri/;
http://www.acm.org/pubs/toc/Abstracts/tods/111212.html",
abstract = "The semantics of SQL queries is formally defined by
stating a set of rules that determine 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 equivalence 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 SQL semantics can lead to errors is
shown, and the reasons for this are analyzed.",
acknowledgement = ack-nhfb,
affiliation = "Brescia Univ., Italy",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Theory",
keywords = "design; languages; query equivalence; query semantics;
SQL; theory",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, SQL. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems, Query processing. {\bf
H.3.3}: Information Systems, INFORMATION STORAGE AND
RETRIEVAL, Information Search and Retrieval, Query
formulation. {\bf F.3.2}: Theory of Computation, LOGICS
AND MEANINGS OF PROGRAMS, Semantics of Programming
Languages.",
}
@Article{Roussopoulos:1991:IAM,
author = "Nicholas Roussopoulos",
title = "An Incremental Access Method for {ViewCache}: Concept,
Algorithms, and Cost Analysis",
journal = j-TODS,
volume = "16",
number = "3",
pages = "535--563",
month = sep,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-3/p535-roussopoulos/p535-roussopoulos.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-3/p535-roussopoulos/;
http://www.acm.org/pubs/toc/Abstracts/tods/111215.html",
abstract = "A {\em ViewCache\/} is a stored collection of pointers
pointing to records of underlying relations needed to
materialize a view. This paper presents an {\em
Incremental Access Method (IAM)\/} that amortizes the
maintenance cost of ViewCaches over a long time period
or indefinitely. Amortization is based on {\em
deferred\/} and other update propagation strategies. A
deferred update strategy allows a ViewCache to remain
outdated until a query needs to selectively or
exhaustively materialize the view. At that 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
bookkeeping.\par
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 conditions, most of which depend
on the size of the incremental update logs between
consecutive accesses of the views, 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.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Maryland Univ., College Park,
MD, USA",
annote = "replicated data management",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "design; performance; Relational Precomputation TODS,
algorithms; terms",
subject = "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Access methods. {\bf H.2.3}:
Information Systems, DATABASE MANAGEMENT, Languages,
Query languages.",
}
@Article{Mukkamala:1991:NEC,
author = "Ravi Mukkamala and Sushil Jajodia",
title = "A Note on Estimating the Cardinality of the Projection
of a Database Relation",
journal = j-TODS,
volume = "16",
number = "3",
pages = "564--566",
month = sep,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-3/p564-mukkamala/p564-mukkamala.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-3/p564-mukkamala/;
http://www.acm.org/pubs/toc/Abstracts/tods/111218.html",
abstract = "The paper by Ahad et al. [1] 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.",
acknowledgement = ack-nhfb,
affiliation = "Old Dominion Univ., Norfolk, VA, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Performance",
keywords = "block access estimation; design; performance; query
cost-estimation; relational databases",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design.",
}
@Article{Wolfson:1991:CMP,
author = "O. Wolfson and A. Milo",
title = "Corrigendum: {``The Multicast Policy and its
Relationship to Replicated Data Placement'' [ACM Trans.
Database Systems {\bf 16} (1991), no. 1, 181--205, by
O. Wolfson and A. Milo] (MR 92a:68042)}",
journal = j-TODS,
volume = "16",
number = "3",
pages = "567--567",
month = sep,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15 (68M10)",
MRnumber = "1 131 143",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "See \cite{Wolfson:1991:MPR}.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Hernandez:1991:CTM,
author = "H{\'e}ctor J. Hern{\'a}ndez and Edward P. F. Chan",
title = "Constant-Time-Maintainable {BCNF} Database Schemes",
journal = j-TODS,
volume = "16",
number = "4",
pages = "571--599",
month = dec,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-4/p571-hernandez/p571-hernandez.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-4/p571-hernandez/;
http://www.acm.org/pubs/toc/Abstracts/tods/115301.html",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., New Mexico State Univ., Las
Cruces, NM, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Theory",
keywords = "algorithms; boundedness; constraint enforcement; data
dependencies; design; query processing; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf H.2.1}:
Information Systems, DATABASE MANAGEMENT, Logical
Design, Normal forms. {\bf H.2.1}: Information Systems,
DATABASE MANAGEMENT, Logical Design, Data models. {\bf
H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing.",
}
@Article{Hou:1991:SEA,
author = "Wen-Chi Hou and Gultekin {\"O}zsoyo{\u{g}}lu",
title = "Statistical Estimators for Aggregate Relational
Algebra Queries",
journal = j-TODS,
volume = "16",
number = "4",
pages = "600--654",
month = dec,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-4/p600-hou/p600-hou.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-4/p600-hou/;
http://www.acm.org/pubs/toc/Abstracts/tods/115300.html",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. and Eng. Sci., Case Western Reserve
Univ., Cleveland, OH, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Management; Performance; Theory",
keywords = "algorithms; management; performance; relational
algebra; sampling; selectivity; simple random sampling;
statistical estimators; theory",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf G.3}: Mathematics of
Computing, PROBABILITY AND STATISTICS, Statistical
computing. {\bf G.2.m}: Mathematics of Computing,
DISCRETE MATHEMATICS, Miscellaneous. {\bf H.2.3}:
Information Systems, DATABASE MANAGEMENT, Languages,
Query languages.",
}
@Article{Negri:1991:DJN,
author = "M. Negri and G. Pelagatti",
title = "Distributive Join: {A} New Algorithm for Joining
Relations",
journal = j-TODS,
volume = "16",
number = "4",
pages = "655--669",
month = dec,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-4/p655-negri/p655-negri.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-4/p655-negri/;
http://www.acm.org/pubs/toc/Abstracts/tods/115299.html",
abstract = "This paper describes a new algorithm for performing
joins in the absence of access paths. This algorithm 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.",
acknowledgement = ack-nhfb,
affiliation = "Politecnico di Milano, Italy",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Experimentation; Performance",
keywords = "Algorithm, Performance, buffer, hashing, join, merging
scan, nested scan, sort, algorithms; buffer; design;
experimentation; hashing; join; merging scan; nested
scan; performance; sort",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Sorting and searching. {\bf H.2.2}: Information
Systems, DATABASE MANAGEMENT, Physical Design, Access
methods.",
}
@Article{Moerkotte:1991:RCC,
author = "Guido Moerkotte and Peter C. Lockemann",
title = "Reactive Consistency Control in Deductive Databases",
journal = j-TODS,
volume = "16",
number = "4",
pages = "670--702",
month = dec,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-4/p670-moerkotte/p670-moerkotte.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-4/p670-moerkotte/;
http://www.acm.org/pubs/toc/Abstracts/tods/115298.html",
acknowledgement = ack-nhfb,
affiliation = "Inst. fuer Programmstrukturen und Datenorganisation,
Karlsruhe Univ., Germany",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Experimentation; Performance;
Theory",
keywords = "algorithms; design; experimentation; performance;
theory",
subject = "{\bf H.2.0}: Information Systems, DATABASE MANAGEMENT,
General, Security, integrity, and protection. {\bf
H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design. {\bf H.2.3}: Information Systems,
DATABASE MANAGEMENT, Languages, Data description
languages (DDL). {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems, Query processing. {\bf
I.2.3}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Deduction and Theorem Proving,
Deduction.",
}
@Article{Carey:1991:CDT,
author = "Michael J. Carey and Miron Livny",
title = "Conflict Detection Tradeoffs for Replicated Data",
journal = j-TODS,
volume = "16",
number = "4",
pages = "703--746",
month = dec,
year = "1991",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1991-16-4/p703-carey/p703-carey.pdf;
http://www.acm.org/pubs/citations/journals/tods/1991-16-4/p703-carey/;
http://www.acm.org/pubs/toc/Abstracts/tods/115289.html",
acknowledgement = ack-nhfb,
affiliation = "Wisconsin Univ., Madison, WI, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Experimentation; Measurement;
Performance",
keywords = "algorithms; concurrency control; experimentation;
measurement; performance; replicated data",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Distributed systems. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Transaction
processing. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Concurrency. {\bf D.4.8}:
Software, OPERATING SYSTEMS, Performance, Modeling and
prediction. {\bf D.4.8}: Software, OPERATING SYSTEMS,
Performance, Simulation. {\bf C.2.4}: Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems, Distributed databases.",
}
@Article{Cattell:1992:OOB,
author = "R. G. G. Cattell and J. Skeen",
title = "Object Operations Benchmark",
journal = j-TODS,
volume = "17",
number = "1",
pages = "1--31",
month = mar,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-1/p1-cattell/p1-cattell.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-1/p1-cattell/;
http://www.acm.org/pubs/toc/Abstracts/tods/128766.html",
abstract = "Performance 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 database systems benchmarks
are inappropriate to measure performance for operations
on engineering objects, we designed a new benchmark
Object Operations version 1 (OO1) to focus on important
characteristics of these applications. OO1 is descended
from an earlier benchmark for simple database
operations and is based on several years experience
with that benchmark. In this paper we describe the OO1
benchmark and results we obtained running it on a
variety of database systems. We provide a careful
specification of the benchmark, show how it can be
implemented on database systems, and present evidence
that more than an order of magnitude difference in
performance can result from a DBMS implementation quite
different from current products; minimizing overhead
per database call, offloading database server
functionality to workstations, taking advantage of
large main memories, and using link-based methods.",
acknowledgement = ack-nhfb,
affiliation = "Sun Microsyst., Mountain View, CA, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Experimentation; Languages;
Measurement; Performance",
keywords = "algorithms; CAD; CASE; client-server architecture;
design; engineering database benchmark;
experimentation; hypermodel; languages; measurement;
object operations benchmark; object-oriented DBMS's;
performance; relation of DBMS's; workstations",
subject = "{\bf K.6.2}: Computing Milieux, MANAGEMENT OF
COMPUTING AND INFORMATION SYSTEMS, Installation
Management, Benchmarks. {\bf D.1.5}: Software,
PROGRAMMING TECHNIQUES, Object-oriented Programming.
{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Data
description languages (DDL). {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Data
manipulation languages (DML). {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Database
(persistent) programming languages. {\bf H.2.8}:
Information Systems, DATABASE MANAGEMENT, Database
applications. {\bf K.6.2}: Computing Milieux,
MANAGEMENT OF COMPUTING AND INFORMATION SYSTEMS,
Installation Management, Performance and usage
measurement.",
}
@Article{Weddell:1992:RAF,
author = "Grant E. Weddell",
title = "Reasoning About Functional Dependencies Generalized
for Semantic Data Models",
journal = j-TODS,
volume = "17",
number = "1",
pages = "32--64",
month = mar,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15 (68Q55)",
MRnumber = "1 161 053",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-1/p32-weddell/p32-weddell.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-1/p32-weddell/;
http://www.acm.org/pubs/toc/Abstracts/tods/128767.html",
abstract = "We propose a more general form of functional
dependency for semantic data models that derives from
their common feature in which the separate notions of
{\em domain\/} and {\em relation\/} in the relational
model are combined into a single notion of {\em class}.
This usually results in a richer terminological
component for their query languages, whereby terms may
navigate through any number of properties, including
none. We prove the richer expressiveness of this more
general functional dependency, and exhibit a sound and
complete set of inference axioms. Although the general
problem of decidability of their logical implication
remains open at this time, we present decision
procedures for cases in which the dependencies included
in a schema correspond to keys, or in which the schema
itself is acyclic. The theory is then extended to
include a form of conjunctive query. Of particular
significance is that the query becomes an additional
source of functional dependency. Finally, we outline
several applications of the theory to various problems
in physical design and in query optimization. The
applications derive from an ability to predict when a
query can have at most one solution.",
acknowledgement = ack-nhfb,
affiliation = "Waterloo Univ., Ont., Canada",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Theory",
keywords = "algorithms; constraint theory; functional
dependencies; query optimization; semantic data models;
theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Normal forms. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Schema
and subschema. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems, Query processing.",
}
@Article{Paredaens:1992:CNA,
author = "Jan Paredaens and Dirk {Van Gucht}",
title = "Converting Nested Algebra Expressions into Flat
Algebra Expressions",
journal = j-TODS,
volume = "17",
number = "1",
pages = "65--93",
month = mar,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P10",
MRnumber = "93c:68018",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-1/p65-paredaens/p65-paredaens.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-1/p65-paredaens/;
http://www.acm.org/pubs/toc/Abstracts/tods/128768.html",
abstract = "Nested relations generalize ordinary flat relations by
allowing tuple values to be either atomic or set
valued. The nested algebra is a generalization of the
flat relational algebra to manipulate nested relations.
In this paper we study the expressive power of the
nested algebra relative to its operation on flat
relational databases. We show that the flat relational
algebra is rich enough to extract the same ``flat
information'' from a flat database as the nested
algebra does. Theoretically, this result implies that
recursive queries such as the transitive closure of a
binary relation cannot be expressed in the nested
algebra. Practically, this result is relevant to (flat)
relational query optimization.",
acknowledgement = ack-nhfb,
affiliation = "Antwerp Univ., Belgium",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Theory",
keywords = "algebraic query transformation; algorithms; languages;
nested algebra; nested calculus; nested relations;
relational databases; theory, van Gucht relational data
model TODS",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf H.3.3}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Information
Search and Retrieval, Query formulation. {\bf H.2.1}:
Information Systems, DATABASE MANAGEMENT, Logical
Design, Data models.",
}
@Article{Mohan:1992:ATR,
author = "C. Mohan and Don Haderle and Bruce Lindsay and Hamid
Pirahesh and Peter Schwarz",
title = "{ARIES}: {A} Transaction Recovery Method Supporting
Fine-Granularity Locking and Partial Rollbacks Using
Write-Ahead Logging",
journal = j-TODS,
volume = "17",
number = "1",
pages = "94--162",
month = mar,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: IBM Almaden Res. Ctr, Res. R.
No. RJ-6649, Jan. 1989, 45 pp.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-1/p94-mohan/p94-mohan.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-1/p94-mohan/;
http://www.acm.org/pubs/toc/Abstracts/tods/128770.html",
abstract = "DB2$^{\rm TM}$, IMS, and Tandem$^{\rm TM}$ systems.
ARIES is applicable not only to database management
systems but also to persistent object-oriented
languages, recoverable file systems and
transaction-based operating systems. ARIES has been
implemented, to varying degrees, in IBM's OS/2$^{\rm
TM}$ Extended Edition Database Manager, DB2,
Workstation Data Save Facility/VM, Starburst and
QuickSilver, and in the University of Wisconsin's
EXODUS and Gamma database machine.",
acknowledgement = ack-nhfb,
affiliation = "IBM Almaden Res. Center, San Jose, CA, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Reliability",
keywords = "algorithms; buffer management; design; latching;
locking; performance; reliability; space management;
write-ahead logging",
subject = "{\bf H.2.7}: Information Systems, DATABASE MANAGEMENT,
Database Administration, Logging and recovery. {\bf
H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Recovery and restart. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Transaction processing. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Concurrency.
{\bf E.5}: Data, FILES, Backup/recovery. {\bf D.4.5}:
Software, OPERATING SYSTEMS, Reliability, Backup
procedures.",
}
@Article{Badrinath:1992:SBC,
author = "B. R. Badrinath and Krithi Ramamritham",
title = "Semantics-Based Concurrency Control: Beyond
Commutativity",
journal = j-TODS,
volume = "17",
number = "1",
pages = "163--199",
month = mar,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "93b:68019",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-1/p163-badrinath/p163-badrinath.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-1/p163-badrinath/;
http://www.acm.org/pubs/toc/Abstracts/tods/128771.html",
abstract = "The concurrency of transactions executing on atomic
data types can be enhanced through the use of semantic
information about operations defined on these types.
Hitherto, commutativity of operations has been
exploited to provide enhanced concurrency while
avoiding cascading aborts. We have identified a
property known as {\em recoverability\/} which can be
used to decrease the delay involved in processing
noncommuting operations while still avoiding cascading
aborts. When an invoked operation is {\em
recoverable\/} with respect to an uncommitted
operation, the invoked operation can be executed by
forcing a commit dependency between the invoked
operation and the uncommitted operation; the
transaction invoking the operation will not have to
wait for the uncommitted operation to abort or commit.
Further, this commit dependency only affects the order
in which the operations should commit, if both commit;
if either operation aborts, the other can still commit
thus avoiding cascading aborts. To ensure the
serializability of transactions, we force the
recoverability relationship between transactions to be
acyclic. Simulation studies, based on the model
presented by Agrawal et al. [1], indicate that using
recoverability, the turnaround time of transactions can
be reduced. Further, our studies show enhancement in
concurrency even when {\em resource constraints\/} are
taken into consideration. The magnitude of enhancement
is dependent on the resource contention; the lower the
resource contention, the higher the improvement.",
acknowledgement = ack-nhfb,
affiliation = "Rutgers Univ., New Brunswick, NJ, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "algorithms; concurrency control; performance; semantic
information",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Concurrency. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems, Transaction processing.
{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Recovery and restart. {\bf D.2.1}:
Software, SOFTWARE ENGINEERING,
Requirements/Specifications.",
}
@Article{Wang:1992:CTM,
author = "Ke Wang and Marc H. Graham",
title = "Constant-Time Maintainability: {A} Generalization of
Independence",
journal = j-TODS,
volume = "17",
number = "2",
pages = "201--246",
month = jun,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-2/p201-wang/p201-wang.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-2/p201-wang/;
http://www.acm.org/pubs/toc/Abstracts/tods/128904.html",
abstract = "The {\em maintenance problem\/} of a database scheme
is the following decision problem: Given a consistent
database state $\rho$ and a new tuple $u$ over some
relation scheme of $\rho$, is the modified state $\rho
\cup u$ still consistent? A database scheme is said to
be {\em constant-time-maintainable(ctm)\/} if there
exists an algorithm that solves its maintenance problem
by making a fixed number of tuple retrievals. We
present a practically useful algorithm, called the {\em
canonical maintenance algorithm}, that solves the
maintenance problem of all ctm database schemes within
a ``not too large'' bound. A number of interesting
properties are shown for ctm database schemes, among
them that non-ctm database schemes are not maintainable
in less than a linear time in the state size. A test
method is given when only cover embedded functional
dependencies (fds) appear. When the given dependencies
consist of fds and the join dependency (jd) $\bowtie
{\bf R}$ of the database scheme, testing whether a
database scheme is ctm is reduced to the case of cover
embedded fds. When dependency-preserving database
schemes with only equality-generating dependencies
(egds) are considered, it is shown that every ctm
database scheme has a set of dependencies that is
equivalent to a set of embedded fds, and thus, our test
method for the case of embedded fds can be applied. In
particular, this includes the important case of
lossless database schemes with only egds.",
acknowledgement = ack-nhfb,
affiliation = "Chongqing Univ., Sichuan, China",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Theory",
keywords = "algorithms; chase; constraint enforcement; design;
functional dependency; independent database schemes;
join dependency; lossless join; relational database;
representative instance; tableau; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf H.2.0}:
Information Systems, DATABASE MANAGEMENT, General,
Security, integrity, and protection. {\bf H.2.1}:
Information Systems, DATABASE MANAGEMENT, Logical
Design, Normal forms. {\bf F.4.1}: Theory of
Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
Mathematical Logic, Mechanical theorem proving.",
}
@Article{Becker:1992:RBO,
author = "Ludger Becker and Ralf Hartmut G{\"u}ting",
title = "Rule-Based Optimization and Query Processing in an
Extensible Geometric Database System",
journal = j-TODS,
volume = "17",
number = "2",
pages = "247--303",
month = jun,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-2/p247-becker/p247-becker.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-2/p247-becker/;
http://www.acm.org/pubs/toc/Abstracts/tods/128905.html",
abstract = "Gral is an extensible database system, based on the
formal concept of a many-sorted relational algebra.
Many-sorted algebra is used to define any application's
query language, its query execution language, and its
optimization rules. In this paper we describe Gral's
optimization component. It provides (1) a sophisticated
rule language --- rules are transformations of abstract
algebra expressions, (2) a general optimization
framework under which more specific optimization
algorithms can be implemented, and (3) several control
mechanisms for the application of rules. An
optimization algorithm can be specified as a series of
steps. Each step is defined by its own collection of
rules together with a selected control strategy.
\par
The general facilities are illustrated by the complete
design of an example optimizer --- in the form of a
rule file --- for a small nonstandard query language
and an associated execution language. The query
language includes selection, join, ordering, embedding
derived values, aggregate functions, and several
geometric operations. The example shows in particular
how the special processing techniques of a geometric
database systems, such as spatial join methods and
geometric index structures, can be integrated into
query processing and optimization of a relational
database system. A similar, though larger, optimizer is
fully functional within the geometric database system
implemented as a Gral prototype.",
acknowledgement = ack-nhfb,
affiliation = "Univ. Gesamthochschule Siegen, Germany",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages",
keywords = "algorithms; extensibility; geometric query processing;
languages, Guting Gral TODS; many-sorted algebra;
optimization; relational algebra; rule-based
optimization",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Data
models. {\bf H.2.3}: Information Systems, DATABASE
MANAGEMENT, Languages, Query languages. {\bf F.2.0}:
Theory of Computation, ANALYSIS OF ALGORITHMS AND
PROBLEM COMPLEXITY, General. {\bf E.2}: Data, DATA
STORAGE REPRESENTATIONS, Hash-table representations.
{\bf I.3.5}: Computing Methodologies, COMPUTER
GRAPHICS, Computational Geometry and Object Modeling,
Geometric algorithms, languages, and systems.",
}
@Article{Franaszek:1992:CCH,
author = "Peter A. Franaszek and John T. Robinson and Alexander
Thomasian",
title = "Concurrency Control for High Contention Environments",
journal = j-TODS,
volume = "17",
number = "2",
pages = "304--345",
month = jun,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-2/p304-franaszek/p304-franaszek.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-2/p304-franaszek/;
http://www.acm.org/pubs/toc/Abstracts/tods/128906.html",
abstract = "Future transaction processing systems may have
substantially higher levels of concurrency due to
reasons which include: (1) increasing disparity between
processor speeds and data access latencies, (2) large
numbers of processors, and (3) distributed databases.
Another influence is the trend towards longer or more
complex transactions. A possible consequence is
substantially more data contention, which could limit
total achievable throughput. In particular, it is known
that the usual locking method of concurrency control is
not well suited to environments where data contention
is a significant factor.\par
Here we consider a number of concurrency control
concepts and transaction scheduling techniques that are
applicable to high contention environments, and that do
not rely on database semantics to reduce contention.
These include {\em access invariance\/} and its
application to prefetching of data, approximations to
{\em essential blocking\/} such as {\em wait depth
limited\/} scheduling, and {\em phase dependent\/}
control. The performance of various concurrency control
methods based on these concepts are studied using
detailed simulation models. The results indicate that
the new techniques can offer substantial benefits for
systems with high levels of data contention.",
acknowledgement = ack-nhfb,
affiliation = "Thomas J. Watson Res. Center, Yorktown Heights, NY,
USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "algorithms; concurrency control; design; performance;
transaction processing",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf D.4.8}: Software,
OPERATING SYSTEMS, Performance. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Concurrency. {\bf H.2.2}: Information Systems, DATABASE
MANAGEMENT, Physical Design.",
}
@Article{Leng:1992:OWA,
author = "Chun-Wu Roger Leng and Dik Lun Lee",
title = "Optimal Weight Assignment for Signature Generation",
journal = j-TODS,
volume = "17",
number = "2",
pages = "346--373",
month = jun,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/bibdb.bib; Database/Graefe.bib;
Database/Wiederhold.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-2/p346-leng/p346-leng.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-2/p346-leng/;
http://www.acm.org/pubs/toc/Abstracts/tods/128907.html",
abstract = "Previous work on superimposed coding has been
characterized by two aspects. First, it is generally
assumed that signatures are generated from {\em
logical\/} text blocks of the same size; that is, each
block contains the same number of unique terms after
stopword and duplicate removal. We call this approach
the fixed-size block (FSB) method, since each text
block has the same size, as measured by the number of
unique terms contained in it. Second, with only a few
exceptions [6,7,8,9,17], most previous work has assumed
that each term in the text contributes the same number
of ones to the signature (i.e., the weight of the term
signatures is fixed). The main objective of this paper
is to derive an optimal weight assignment that assigns
weights to document terms according to their occurrence
and query frequencies in order to minimize the
false-drop probability. The optimal scheme can account
for both uniform and nonuniform occurrence and query
frequencies, and the signature generation method is
still based on hashing rather than on table lookup.
Furthermore, a new way of generating signatures, the
fixed-weight block (FWB) method, is introduced. FWB
controls the weight of {\em every\/} signature to a
constant, whereas in FSB, only the {\em expected\/}
signature weight is constant. We have shown that FWB
has a lower false-drop probability than that of the FSB
method, but its storage overhead is slightly higher.
Other advantages of FWB are that the optimal weight
assignment can be obtained analytically without making
unrealistic assumptions and that the formula for
computing the term signature weights is simple and
efficient.",
acknowledgement = ack-nhfb,
affiliation = "Ohio State Univ., Columbus, OH, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Performance",
keywords = "access method; coding methods; design; document
retrieval; information retrieval; optimization;
performance; signature file; superimposed coding; text
retrieval",
subject = "{\bf H.3.3}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Search and Retrieval,
Retrieval models. {\bf H.2.2}: Information Systems,
DATABASE MANAGEMENT, Physical Design, Access methods.
{\bf H.3.6}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Library Automation. {\bf I.7.1}:
Computing Methodologies, TEXT PROCESSING, Text
Editing.",
}
@Article{Tansel:1992:MRH,
author = "Abdullah U. Tansel and Lucy Garnett",
title = "On {M. A. Roth, H. F. Korth and A. Silberschatz:
``{Extended Algebra and Calculus for Nested Relational
Databases}'' [ACM Trans. Database Systems {\bf 13}
(1988), no. 4, 389--417]}",
journal = j-TODS,
volume = "17",
number = "2",
pages = "374--383",
month = jun,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "1 167 047",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "See \cite{Roth:1988:EAC}.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-2/p374-tansel/p374-tansel.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-2/p374-tansel/;
http://www.acm.org/pubs/toc/Abstracts/tods/128908.html",
abstract = "We discuss the issues encountered in the extended
algebra and calculus languages for nested relations
defined by Roth, Korth, and Silberschatz.[4]. Their
equivalence proof between algebra and calculus fails
because of the keying problems and the use of extended
set operations. Extended set operations also have
unintended side effects. Furthermore, their calculus
seems to allow the generation of power sets, thus
making it more powerful than their algebra.",
acknowledgement = ack-nhfb,
affiliation = "Bilkent Univ., Ankara, Turkey",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages; Theory",
keywords = "equivalence of algebra and calculus; languages; nested
relations; relational algebra; relational calculus;
theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf F.4.1}: Theory of
Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
Mathematical Logic. {\bf H.2.1}: Information Systems,
DATABASE MANAGEMENT, Logical Design, Normal forms. {\bf
H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Data manipulation languages (DML).",
}
@Article{Bergamaschi:1992:TRC,
author = "Sonia Bergamaschi and Claudio Sartori",
title = "On Taxonomic Reasoning in Conceptual Design",
journal = j-TODS,
volume = "17",
number = "3",
pages = "385--422",
month = sep,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-3/p385-bergamaschi/p385-bergamaschi.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-3/p385-bergamaschi/;
http://www.acm.org/pubs/toc/Abstracts/tods/132272.html",
abstract = "Taxonomic reasoning is a typical task performed by
many AI knowledge representation systems. In this
paper, the effectiveness of taxonomic reasoning
techniques as an active support to knowledge
acquisition and conceptual schema design is shown. The
idea developed is that by extending conceptual models
with {\em defined concepts\/} and giving them rigorous
logic semantics, it is possible to infer {\em isa\/}
relationships between concepts on the basis of their
descriptions. From a theoretical point of view, this
approach makes it possible to give a formal definition
for {\em consistency\/} and {\em minimality\/} of a
conceptual schema. From a pragmatic point of view it is
possible to develop an active environment that allows
automatic {\em classification\/} of a new concept in
the right position of a given taxonomy, ensuring the
consistency and minimality of a conceptual schema. A
formalism that includes the data semantics of models
giving prominence to type constructors (E/R, TAXIS,
GALILEO) and algorithms for taxonomic inferences are
presented: their soundness, completeness, and
tractability properties are proved. Finally, an
extended formalism and taxonomic inference algorithms
for models giving prominence to attributes (FDM, IFO)
are given.",
acknowledgement = ack-nhfb,
affiliation = "Bologna Univ., Italy",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Theory; Verification",
keywords = "design; languages; schema consistency; schema
minimality; semantic models; taxonomic reasoning;
theory; verification",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf I.2.4}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge
Representation Formalisms and Methods, Representation
languages. {\bf I.2.4}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Knowledge Representation
Formalisms and Methods, Frames and scripts.",
}
@Article{Markowitz:1992:REE,
author = "Victor M. Markowitz and Arie Shoshani",
title = "Representing Extended Entity-Relationship Structures
in Relational Databases: {A} Modular Approach",
journal = j-TODS,
volume = "17",
number = "3",
pages = "423--464",
month = sep,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-3/p423-markowitz/p423-markowitz.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-3/p423-markowitz/;
http://www.acm.org/pubs/toc/Abstracts/tods/132273.html",
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, {\em 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.",
acknowledgement = ack-nhfb,
affiliation = "Lawrence Berkeley Lab., CA, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design",
keywords = "algorithms; database design; design; extended
entity-relationship model; relational data model;
schema translation; semantic data model",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Normal
forms. {\bf H.2.3}: Information Systems, DATABASE
MANAGEMENT, Languages, Data description languages
(DDL).",
}
@Article{Date:1992:SCG,
author = "C. J. Date and Ronald Fagin",
title = "Simple Conditions for Guaranteeing Higher Normal Forms
in Relational Databases",
journal = j-TODS,
volume = "17",
number = "3",
pages = "465--476",
month = sep,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-3/p465-date/p465-date.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-3/p465-date/;
http://www.acm.org/pubs/toc/Abstracts/tods/132274.html",
abstract = "A key is {\em 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 {\em
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.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Theory",
keywords = "5NF; BCNF; Boyce-Codd normal form; database design;
design; fifth normal form; fourth normal form 4NF;
functional dependency; join dependency; multivalued
dependency; normalization; PJ/NF; projection-join
normal form; relational database; simple key; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Normal forms.",
}
@Article{Hsu:1992:PEC,
author = "Meichun Hsu and Bin Zhang",
title = "Performance Evaluation of Cautious Waiting",
journal = j-TODS,
volume = "17",
number = "3",
pages = "477--512",
month = sep,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-3/p477-hsu/p477-hsu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-3/p477-hsu/;
http://www.acm.org/pubs/toc/Abstracts/tods/132275.html",
abstract = "We study a deadlock-free locking-based concurrency
control algorithm, called {\em cautious waiting}, which
allows for a limited form of waiting. The algorithm is
very simple to implement. We present an analytical
solution to its performance evaluation based on the
mean-value approach proposed by Tay et al. [18]. From
the modeling point of view, we are able to do away with
a major assumption used in Tay's previous work, and
therefore capture more accurately both the restart and
the blocking rates in the system. We show that to solve
for this model we only need to solve for the root of a
polynomial. The analytical tools developed enable us to
see that the cautious waiting algorithm manages to
achieve a {\em delicate\/} balance between restart and
blocking, and therefore is superior (i.e., has higher
throughput to {\em both\/} the no-waiting (i.e.,
immediate restart) and the general waiting algorithms)
under a wide range of system parameters. The study
substantiates the argument that balancing restart and
blocking is important in locking systems.",
acknowledgement = ack-nhfb,
affiliation = "Digital Equipment Corp., Mountain View, CA, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Management; Performance",
keywords = "algorithms; cautious waiting; concurrency control;
management; performance, Concurrency control locking
TODS",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Concurrency. {\bf D.4.1}: Software, OPERATING
SYSTEMS, Process Management, Concurrency.",
}
@Article{Abbott:1992:SRT,
author = "Robert K. Abbott and H{\'e}ctor Garc{\'\i}a-Molina",
title = "Scheduling Real-Time Transactions: {A} Performance
Evaluation",
journal = j-TODS,
volume = "17",
number = "3",
pages = "513--560",
month = sep,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-3/p513-abbott/p513-abbott.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-3/p513-abbott/;
http://www.acm.org/pubs/toc/Abstracts/tods/132276.html",
acknowledgement = ack-nhfb,
affiliation = "Digital Equipment Corp., Littleton, MA, USA",
annote = "real-time",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "algorithms; deadlines; locking protocols; performance;
real-time systems",
subject = "{\bf D.4.1}: Software, OPERATING SYSTEMS, Process
Management, Scheduling. {\bf D.4.1}: Software,
OPERATING SYSTEMS, Process Management, Concurrency.
{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Concurrency. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems, Transaction processing.",
}
@Article{Siegel:1992:MAR,
author = "Michael Siegel and Edward Sciore and Sharon Salveter",
title = "A Method for Automatic Rule Derivation to Support
Semantic Query Optimization",
journal = j-TODS,
volume = "17",
number = "4",
pages = "563--600",
month = dec,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P20 (68T05)",
MRnumber = "1 197 198",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-4/p563-siegel/p563-siegel.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-4/p563-siegel/;
http://www.acm.org/pubs/toc/Abstracts/tods/146932.html",
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.\par
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.\par
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.",
acknowledgement = ack-nhfb,
affiliation = "Boston Univ., MA, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages; Performance",
keywords = "integrity constraint; languages; learning;
performance; transformation heuristic",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf I.2.6}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Learning,
Knowledge acquisition.",
}
@Article{Kamel:1992:IDC,
author = "Nabil Kamel and Roger King",
title = "Intelligent Database Caching Through the Use of Page
Answers and Page Traces",
journal = j-TODS,
volume = "17",
number = "4",
pages = "601--646",
month = dec,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P20",
MRnumber = "1 197 199",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-4/p601-kamel/p601-kamel.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-4/p601-kamel/;
http://www.acm.org/pubs/toc/Abstracts/tods/146933.html",
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 ideas 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 constraint 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 been developed, implemented, and
tested. Finally, quantitative measurements of
performance benefits are reported.",
acknowledgement = ack-nhfb,
affiliation = "Florida Univ., Gainesville, FL, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "algorithms; artificial intelligence; databases;
design; page access; performance",
subject = "{\bf H.3.3}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Search and Retrieval. {\bf
H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Access methods. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Query processing. {\bf H.3.1}: Information Systems,
INFORMATION STORAGE AND RETRIEVAL, Content Analysis and
Indexing, Indexing methods. {\bf H.3.2}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Information
Storage, Record classification. {\bf I.1.3}: Computing
Methodologies, ALGEBRAIC MANIPULATION, Languages and
Systems, Evaluation strategies. {\bf I.2.8}: Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Problem
Solving, Control Methods, and Search, Plan execution,
formation, generation.",
}
@Article{Maiocchi:1992:ADT,
author = "Roberto Maiocchi and Barbara Pernici and Federico
Barbic",
title = "Automatic Deduction of Temporal Information",
journal = j-TODS,
volume = "17",
number = "4",
pages = "647--688",
month = dec,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P20 (03B70 68T27)",
MRnumber = "93h:68038",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-4/p647-maiocchi/p647-maiocchi.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-4/p647-maiocchi/;
http://www.acm.org/pubs/toc/Abstracts/tods/146934.html",
abstract = "In many computer-based applications, temporal
information has to be stored, retrieved, and related to
other temporal information. Several time models have
been proposed to manage temporal knowledge in the
fields of conceptual modeling, database systems, and
artificial intelligence.\par
In this paper we present TSOS, a system for reasoning
about time that can be integrated as a time expert in
environments designed for broader problem-solving
domains. The main intended goal of TSOS is to allow a
user to infer further information on the temporal data
stored in the database through a set of deduction rules
handling various aspects of time. For this purpose,
TSOS provides the capability of answering queries about
the temporal specifications it has in its temporal
database.\par
Distinctive time-modeling features of TSOS are the
introduction of {\em temporal modalities}, i.e., the
possibility of specifying if a piece of information is
always true within a time interval, or if it is only
sometimes true, and the capability of answering about
the possibility and the necessity of the validity of
some information at a given time, the association of
temporal knowledge both to {\em instances of data\/}
and to {\em types of data}, and the development of a
{\em time calculus\/} for reasoning on temporal data.
Another relevant feature of TSOS is the capability to
reason about temporal data specified at different time
granularities.",
acknowledgement = ack-nhfb,
affiliation = "Politecnico di Milano, Italy",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Theory",
keywords = "design; events; languages; meta-level temporal
assertions; propositions; temporal database; temporal
modalities; theory; time calculus",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages. {\bf I.2.3}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving,
Deduction.",
}
@Article{Agrawal:1992:GTQ,
author = "D. Agrawal and A. {El Abbadi}",
title = "The Generalized Tree Quorum Protocol: An Efficient
Approach for Managing Replicated Data",
journal = j-TODS,
volume = "17",
number = "4",
pages = "689--717",
month = dec,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68M10",
MRnumber = "1 197 201",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-4/p689-agrawal/p689-agrawal.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-4/p689-agrawal/;
http://www.acm.org/pubs/toc/Abstracts/tods/146935.html",
abstract = "In this paper, we present a low-cost fault-tolerant
protocol for managing replicated data. We impose 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 results 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 mode of operations.",
acknowledgement = ack-nhfb,
affiliation = "California Univ., Santa Barbara, CA, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Economics; Experimentation; Measurement;
Performance",
keywords = "algorithms; economics; experimentation; measurement;
performance",
subject = "{\bf C.2.2}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Network Protocols.
{\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases. {\bf H.2.2}: Information
Systems, DATABASE MANAGEMENT, Physical Design. {\bf
G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS,
Graph Theory, Network problems. {\bf G.2.2}:
Mathematics of Computing, DISCRETE MATHEMATICS, Graph
Theory, Trees.",
}
@Article{Atzeni:1992:URD,
author = "Paolo Atzeni and Riccardo Torlone",
title = "Updating Relational Databases Through Weak Instance
Interfaces",
journal = j-TODS,
volume = "17",
number = "4",
pages = "718--745",
month = dec,
year = "1992",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P20",
MRnumber = "93h:68035",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1992-17-4/p718-atzeni/p718-atzeni.pdf;
http://www.acm.org/pubs/citations/journals/tods/1992-17-4/p718-atzeni/;
http://www.acm.org/pubs/toc/Abstracts/tods/146936.html",
abstract = "The problem of updating databases through interfaces
based on the weak instance model is studied, thus
extending previous proposals that considered them only
from the query point of view. Insertions and deletions
of tuples are considered.\par
As a preliminary tool, a lattice on states is defined,
based on the information content of the various
states.\par
Potential results of an insertion are states that
contain at least the information in the original state
and that in the new tuple. Sometimes there is no
potential result, and in the other cases there may be
many of them. We argue that the insertion is
deterministic if the state that contains the
information common to all the potential results (the
greatest lower bound, in the lattice framework) is a
potential result itself. Effective characterizations
for the various cases exist.\par
A symmetric approach is followed for deletions, with
fewer cases, since there are always potential results;
determinism is characterized as a consequence.",
acknowledgement = ack-nhfb,
affiliation = "Roma Univ., Italy",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Theory",
keywords = "algorithms; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Schema
and subschema. {\bf H.2.m}: Information Systems,
DATABASE MANAGEMENT, Miscellaneous. {\bf H.5.2}:
Information Systems, INFORMATION INTERFACES AND
PRESENTATION, User Interfaces, Theory and methods.",
}
@Article{Ishikawa:1993:MLI,
author = "Hiroshi Ishikawa and Fumio Suzuki and Fumihiko
Kozakura and Akifumi Makinouchi and Mika Miyagishima
and Yoshio Izumida and Masaaki Aoshima and Yasuo
Yamane",
title = "The Model, Language, and Implementation of an
Object-Oriented Multimedia Knowledge Base Management
System",
journal = j-TODS,
volume = "18",
number = "1",
pages = "1--50",
month = mar,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-1/p1-ishikawa/p1-ishikawa.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-1/p1-ishikawa/;
http://www.acm.org/pubs/toc/Abstracts/tods/151285.html",
abstract = "New applications such as CAD, AI, and hypermedia
require direct representation and flexible use of
complex objects, behavioral knowledge, and multimedia
data. To this end, we have devised a knowledge base
management system called Jasmine. An object-oriented
approach in a programming language also seems promising
for use in Jasmine. Jasmine extends the current
object-oriented approach and provides the following
features. Our object model is based on functional data
models and well-established set theory. Attributes or
functions composing objects can represent both
structural and behavioral knowledge. The object model
can represent incomplete and generic knowledge. The
model can support the basic storage and operations of
multimedia data. The facets of attributes can flexibly
represent constraints and triggers. The object
manipulation language can support associative access of
objects. The structural and behavioral knowledge can be
uniformly treated to allow the user to specify complex
object operations in a compact manner. The user-defined
and system-defined attributes can be uniformly
specified to ease user customization of the language.
The classes and instances can be uniformly accessed.
Incomplete knowledge can be flexibly accessed. The
system has a layered architecture. Objects are stored
in nested relations provided by extensive DBMS as a
sublayer. User query of objects is compiled into
relational operations such as select and join, which
can be efficiently processed using hashing. The
behavioral knowledge is compiled into predicate and
manipulation function interfaces that can directly
access tuples in a buffer.",
acknowledgement = ack-nhfb,
affiliation = "Fujitsu Labs., Ltd., Kawasaki, Japan",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages",
keywords = "design; languages",
subject = "{\bf I.2.1}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Applications and Expert Systems. {\bf
I.2.4}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Knowledge Representation Formalisms and
Methods, Representations (procedural and rule-based).
{\bf H.4.2}: Information Systems, INFORMATION SYSTEMS
APPLICATIONS, Types of Systems. {\bf H.2.1}:
Information Systems, DATABASE MANAGEMENT, Logical
Design, Data models. {\bf H.2.3}: Information Systems,
DATABASE MANAGEMENT, Languages, Query languages. {\bf
H.5.1}: Information Systems, INFORMATION INTERFACES AND
PRESENTATION, Multimedia Information Systems.",
}
@Article{Johnson:1993:PCB,
author = "Theodore Johnson and Dennis Shasha",
title = "The Performance of Current {B-Tree} Algorithms",
journal = j-TODS,
volume = "18",
number = "1",
pages = "51--101",
month = mar,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "``Current'' in the title should be ``Concurrent''.",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-1/p51-johnson/p51-johnson.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-1/p51-johnson/;
http://www.acm.org/pubs/toc/Abstracts/tods/151286.html",
acknowledgement = ack-nhfb,
affiliation = "Florida Univ., Gainesville, FL, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Experimentation; Measurement;
Performance",
keywords = "B-trees; concurrent B-trees; concurrent data
structures; experimentation; measurement; performance;
performance of concurrent algorithms; TOC Concurrency
control simulations TODS, algorithms",
subject = "{\bf H.3.3}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Search and Retrieval,
Retrieval models. {\bf H.3.3}: Information Systems,
INFORMATION STORAGE AND RETRIEVAL, Information Search
and Retrieval, Search process. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Transaction
processing. {\bf H.2.2}: Information Systems, DATABASE
MANAGEMENT, Physical Design. {\bf F.2.2}: Theory of
Computation, ANALYSIS OF ALGORITHMS AND PROBLEM
COMPLEXITY, Nonnumerical Algorithms and Problems,
Sorting and searching. {\bf I.6.6}: Computing
Methodologies, SIMULATION AND MODELING, Simulation
Output Analysis.",
}
@Article{Kumar:1993:CAT,
author = "Akhil Kumar and Arie Segev",
title = "Cost and Availability Tradeoffs in Replicated Data
Concurrency Control",
journal = j-TODS,
volume = "18",
number = "1",
pages = "102--131",
month = mar,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-1/p102-kumar/p102-kumar.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-1/p102-kumar/;
http://www.acm.org/pubs/toc/Abstracts/tods/151287.html",
acknowledgement = ack-nhfb,
affiliation = "Cornell Univ., Ithaca, NY, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "algorithms; availability; performance; replicated
database",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Distributed systems. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Transaction
processing. {\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases.",
}
@Article{Abdel-Ghaffar:1993:ODA,
author = "Khaled A. S. Abdel-Ghaffar and Amr {El Abbadi}",
title = "Optimal Disk Allocation for Partial Match Queries",
journal = j-TODS,
volume = "18",
number = "1",
pages = "132--156",
month = mar,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-1/p132-abdel-ghaffar/p132-abdel-ghaffar.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-1/p132-abdel-ghaffar/;
http://www.acm.org/pubs/toc/Abstracts/tods/151288.html",
abstract = "The problem of disk allocation addresses the issue of
how to distribute a file on several disks in order to
maximize concurrent disk accesses in response to a
partial match query. In this paper a coding-theoretic
analysis of this problem is presented, and both
necessary and sufficient conditions for the existence
of strictly optimal allocation methods are provided.
Based on a class of optimal codes, known as maximum
distance separable codes, strictly optimal allocation
methods are constructed. Using the necessary conditions
proved, we argue that the standard definition of strict
optimality is too strong and cannot be attained, in
general. Hence, we reconsider the definition of
optimality. Instead of basing it on an abstract
definition that may not be attainable, we propose a new
definition based on the best possible allocation
method. Using coding theory, allocation methods that
are optimal according to our proposed criterion are
developed.",
acknowledgement = ack-nhfb,
affiliation = "California Univ., Davis, CA, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Theory",
keywords = "Abbadi TODS, algorithms; Cartesian product files;
coding theory; design; multiple disk systems; partial
match queries; theory",
subject = "{\bf H.3.2}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Information Storage, File organization.
{\bf D.4.3}: Software, OPERATING SYSTEMS, File Systems
Management, File organization. {\bf E.5}: Data, FILES,
Organization/structure. {\bf H.2.2}: Information
Systems, DATABASE MANAGEMENT, Physical Design, Access
methods. {\bf H.1.1}: Information Systems, MODELS AND
PRINCIPLES, Systems and Information Theory, Information
theory. {\bf E.4}: Data, CODING AND INFORMATION
THEORY.",
}
@Article{Matsliach:1993:PAF,
author = "Gabriel Matsliach",
title = "Performance Analysis of File Organizations that Use
Multibucket Data Leaves with Partial Expansions",
journal = j-TODS,
volume = "18",
number = "1",
pages = "157--180",
month = mar,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-1/p157-matsliach/p157-matsliach.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-1/p157-matsliach/;
http://www.acm.org/pubs/toc/Abstracts/tods/151289.html",
abstract = "We present an exact performance analysis, under random
insertions, of file organizations that use multibucket
data leaves and perform partial expansions before
splitting. We evaluate the expected disk space
utilization of the file and show how the expected
search and insert costs can be estimated. The
analytical results are confirmed by simulations. The
analysis can be used to investigate both the dynamic
and the asymptotic behaviors.",
acknowledgement = ack-nhfb,
affiliation = "Technion-Israel Inst. of Technol., Haifa, Israel",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Performance; Theory; Verification",
keywords = "bounded disorder files; multibucket data leaves;
partial expansion; performance; performance analysis;
search structures; theory; verification",
subject = "{\bf E.5}: Data, FILES, Organization/structure. {\bf
E.1}: Data, DATA STRUCTURES, Trees. {\bf H.3.2}:
Information Systems, INFORMATION STORAGE AND RETRIEVAL,
Information Storage, File organization. {\bf H.3.1}:
Information Systems, INFORMATION STORAGE AND RETRIEVAL,
Content Analysis and Indexing. {\bf H.3.3}: Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Information
Search and Retrieval.",
}
@Article{Chomicki:1993:FRI,
author = "Jan Chomicki and Tomasz Imieli{\'n}ski",
title = "Finite Representation of Infinite Query Answers",
journal = j-TODS,
volume = "18",
number = "2",
pages = "181--223",
month = jun,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-2/p181-chomicki/p181-chomicki.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-2/p181-chomicki/;
http://www.acm.org/pubs/toc/Abstracts/tods/151635.html",
abstract = "We define here a formal notion of finite
representation of infinite query answers in logic
programs. We apply this notion to Datalog$_{\rm nS}$
programs may be infinite and consequently queries may
have infinite answers.\par
We present a method to finitely represent infinite
least Herbrand models of Datalog$_{\rm nS}$ program
(and its underlying computational engine) can be
forgotten. Given a query to be evaluated, it is easy to
obtain from the relational specification finitely many
answer 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 evaluation methods. Second, a relational
specification is {\em effectively computable\/} and its
computation is no harder, in the sense of the
complexity class, than answering yes-no
queries.\par
Our method is applicable to every range-restricted
Datalog$_{\rm nS}$ program. We also show that for some
very simple non-Datalog$_{\rm nS}$ logic programs,
finite representations of query answers do not exist.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. and Inf. Sci., Kansas State Univ.,
Manhattan, KS, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Theory",
keywords = "algorithms; theory",
subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Datalog. {\bf
I.2.3}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Deduction and Theorem Proving, Deduction.
{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC
AND FORMAL LANGUAGES, Mathematical Logic.",
}
@Article{Hou:1993:PTC,
author = "Wen-Chi Hou and Gultekin {\"O}zsoyo{\u{g}}lu",
title = "Processing Time-Constrained Aggregate Queries in
{CASE-DB}",
journal = j-TODS,
volume = "18",
number = "2",
pages = "224--261",
month = jun,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-2/p224-hou/p224-hou.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-2/p224-hou/;
http://www.acm.org/pubs/toc/Abstracts/tods/151636.html",
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.\par
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
adjusted at runtime to 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.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Southern Illinois Univ.,
Carbondale, IL, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Theory",
keywords = "algorithms; design; estimation; performance;
relational algebra; risk of overspending; sampling;
selectivity; theory; time constraints",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf G.3}: Mathematics of
Computing, PROBABILITY AND STATISTICS, Statistical
computing. {\bf H.2.8}: Information Systems, DATABASE
MANAGEMENT, Database applications. {\bf J.7}: Computer
Applications, COMPUTERS IN OTHER SYSTEMS, Real time.",
}
@Article{Drenick:1993:SQO,
author = "P. E. Drenick and E. J. Smith",
title = "Stochastic Query Optimization in Distributed
Databases",
journal = j-TODS,
volume = "18",
number = "2",
pages = "262--288",
month = jun,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-2/p262-drenick/p262-drenick.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-2/p262-drenick/;
http://www.acm.org/pubs/toc/Abstracts/tods/151637.html",
abstract = "Many algorithms have been devised for minimizing the
costs associated with obtaining the answer to a single,
isolated query in a distributed database system.
However, if more than one query may be processed by the
system at the same time and if the arrival times of the
queries are unknown, the determination of optimal
query-processing strategies becomes a stochastic
optimization problem. In order to cope with such
problems, a theoretical state-transition model is
presented that treats the system as one operating under
a stochastic load. Query-processing strategies may then
be distributed over the processors of a network as
probability distributions, in a manner which
accommodates many queries over time.\par
It is then shown that the model leads to the
determination of optimal query-processing strategies as
the solution of mathematical programming problems, and
analytical results for several examples are presented.
Furthermore, a divide-and-conquer approach is
introduced for decomposing stochastic query
optimization problems into distinct subproblems for
processing queries sequentially and in parallel.",
acknowledgement = ack-nhfb,
affiliation = "Polytech. Univ., Farmingdale, NY, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance; Theory",
keywords = "algorithms; distributed query processing; performance;
state-transition model; stochastic query optimization;
theory",
subject = "{\bf G.1.6}: Mathematics of Computing, NUMERICAL
ANALYSIS, Optimization, Linear programming. {\bf
H.3.3}: Information Systems, INFORMATION STORAGE AND
RETRIEVAL, Information Search and Retrieval, Retrieval
models. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Distributed systems. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Query processing. {\bf C.2.4}: Computer Systems
Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems, Distributed databases.",
}
@Article{Rothermel:1993:OCP,
author = "Kurt Rothermel and Stefan Pappe",
title = "Open Commit Protocols Tolerating Commission Failures",
journal = j-TODS,
volume = "18",
number = "2",
pages = "289--332",
month = jun,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-2/p289-rothermel/p289-rothermel.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-2/p289-rothermel/;
http://www.acm.org/pubs/toc/Abstracts/tods/151638.html",
abstract = "To ensure atomicity of transactions in distributed
systems so-called 2-phase commit (2PC) protocols have
been proposed. The basic assumption of these protocols
is that the processing nodes involved in transactions
are ``sane,'' i.e., they only fail with omission
failures, and nodes eventually recover from failures.
Unfortunately, this assumption is not realistic for
so-called Open Distributed Systems (ODSs), in which
nodes may have totally different reliability
characteristics. In ODSs, nodes can be classified into
trusted nodes (e.g., a banking server) and nontrusted
nodes (e.g., a home PC requesting a remote banking
service). While trusted nodes are assumed to be sane,
nontrusted nodes may fail permanently and even cause
commission failures to occur.\par
In this paper, we propose a family of 2PC protocols
that tolerate any number of omission failures at
trusted nodes and any number of commission and omission
failures at nontrusted nodes. The proposed protocols
ensure that (at least) the trusted nodes participating
in a transaction {\em eventually\/} terminate the
transaction in a {\em consistent\/} manner. Unlike
Byzantine commit protocols, our protocols do {\em
not\/} incorporate mechanisms for achieving Byzantine
agreement, which has advantages in terms of complexity:
Our protocols have the same or only a slightly higher
message complexity than traditional 2PC protocols.",
acknowledgement = ack-nhfb,
affiliation = "Inst. of Parallel and Distributed High Performance
Syst., Stuttgart Univ., Germany",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance; Reliability",
keywords = "algorithms; commit protocols; open systems;
performance; reliability",
subject = "{\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Network operating systems. {\bf C.2.4}: Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems, Distributed databases. {\bf
H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Distributed systems. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Transaction
processing. {\bf C.4}: Computer Systems Organization,
PERFORMANCE OF SYSTEMS, Reliability, availability, and
serviceability.",
}
@Article{Rahm:1993:EPE,
author = "Erhard Rahm",
title = "Empirical Performance Evaluation of Concurrency and
Coherency Control Protocols for Database Sharing
Systems",
journal = j-TODS,
volume = "18",
number = "2",
pages = "333--377",
month = jun,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; Database/Wiederhold.bib;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-2/p333-rahm/p333-rahm.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-2/p333-rahm/;
http://www.acm.org/pubs/toc/Abstracts/tods/151639.html",
abstract = "Database Sharing (DB-sharing) refers to a general
approach for building a distributed high performance
transaction system. The nodes of a DB-sharing system
are locally coupled via a high-speed interconnect and
share a common database at the disk level. This is also
known as a ``shared disk'' approach. We compare
database sharing with the database partitioning (shared
nothing) approach and discuss the functional DBMS
components that require new and coordinated solutions
for DB-sharing. The performance of DB-sharing systems
critically depends on the protocols used for
concurrency and coherency control. The frequency of
communication required for these functions has to be
kept as low as possible in order to achieve high
transaction rates and short response times. A
trace-driven simulation system for DB-sharing complexes
has been developed that allows a realistic performance
comparison of four different concurrency and coherency
control protocols. We consider two locking and two
optimistic schemes which operate either under central
or distributed control. For coherency control, we
investigate so-called on-request and broadcast
invalidation schemes, and employ buffer-to-buffer
communication to exchange modified pages directly
between different nodes. The performance impact of
random routing versus affinity-based load distribution
and different communication costs is also examined. In
addition, we analyze potential performance bottlenecks
created by hot spot pages.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Kaiserslautern Univ., Germany",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Theory",
keywords = "algorithms; coherency control; concurrency control;
database partitioning; database sharing; design;
performance; performance analysis; shared disk; shared
nothing; theory; trace-driven simulation",
subject = "{\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems.
{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Distributed systems. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Transaction
processing. {\bf C.4}: Computer Systems Organization,
PERFORMANCE OF SYSTEMS. {\bf D.4.8}: Software,
OPERATING SYSTEMS, Performance, Simulation. {\bf
D.4.1}: Software, OPERATING SYSTEMS, Process
Management, Concurrency.",
}
@Article{Kuper:1993:LDM,
author = "Gabriel M. Kuper and Moshe Y. Vardi",
title = "The Logical Data Model",
journal = j-TODS,
volume = "18",
number = "3",
pages = "379--413",
month = sep,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "96c:68035",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-3/p379-kuper/p379-kuper.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-3/p379-kuper/;
http://www.acm.org/pubs/toc/Abstracts/tods/155274.html",
abstract = "We propose an object-oriented data model that
generalizes the relational, hierarchical, and network
models. A database scheme 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.",
acknowledgement = ack-nhfb,
affiliation = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Theory",
keywords = "Algebra; database schema; design; languages; logic;
relational database; theory; tuple calculus",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages. {\bf H.2.1}: Information Systems, DATABASE
MANAGEMENT, Logical Design, Schema and subschema.",
}
@Article{Levene:1993:SNE,
author = "Mark Levene and George Loizou",
title = "Semantics for Null Extended Nested Relations",
journal = j-TODS,
volume = "18",
number = "3",
pages = "414--459",
month = sep,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-3/p414-levene/p414-levene.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-3/p414-levene/;
http://www.acm.org/pubs/toc/Abstracts/tods/155275.html",
abstract = "The nested relational model extends the flat
relational model by relaxing the first normal form
assumption in order to allow the modeling of complex
objects. Much of the previous work on the nested
relational model has concentrated on defining the data
structures and query language for the model. The work
done on integrity constraints in nested relations has
mainly focused on characterizing subclasses of nested
relations and defining normal forms for nested
relations with certain desirable properties.\par
In this paper we define the semantics of nested
relations, which may contain null values, in terms of
integrity constraints, called {\em null extended data
dependencies}, which extend functional dependencies and
join dependencies encountered in flat relational
database theory. We formalize incomplete information in
nested relations by allowing only one unmarked {\em
generic null value}, whose semantics we do not further
specify. The motivation for the choice of a generic
null is our desire to investigate only fundamental
semantics which are common to all unmarked null types.
This lead us to define a preorder on nested relations,
which allows us to measure the relative information
content of nested relations. We also define a
procedure, called the {\em extended chase procedure},
for testing satisfaction of null extended data
dependencies and for making inferences by using these
null extended data dependencies. The extended chase
procedure is shown to generalize the classical chase
procedure, which is of major importance in flat
relational database theory. As a consequence of our
approach we are able to capture the novel notion of
losslessness in nested relations, called herein {\em
null extended lossless decomposition}. Finally, we show
that the semantics of nested relations are a natural
extension of the semantics of flat relations.",
acknowledgement = ack-nhfb,
affiliation = "Univ. Coll., London, UK",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Theory",
keywords = "algorithms; extended chase; languages; nested
relations; null extended algebra; null extended data
dependencies; nulls; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages. {\bf H.2.1}: Information Systems, DATABASE
MANAGEMENT, Logical Design, Normal forms.",
}
@Article{Agrawal:1993:COS,
author = "Divyakant Agrawal and Amr {El Abbadi} and Ambuj K.
Singh",
title = "Consistency and Orderability: Semantics-Based
Correctness Criteria for Databases",
journal = j-TODS,
volume = "18",
number = "3",
pages = "460--486",
month = sep,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-3/p460-agrawal/p460-agrawal.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-3/p460-agrawal/;
http://www.acm.org/pubs/toc/Abstracts/tods/155276.html",
abstract = "The semantics of objects and transactions in database
systems are investigated. User-defined predicates
called {\em consistency assertions\/} are used to
specify user programs. Three new correctness criteria
are proposed. The first correctness criterion {\em
consistency\/} is based solely on the users'
specifications and admit nonserializable executions
that are acceptable to the users. Integrity constraints
of the database are maintained through consistency
assertions. The second correctness criterion {\em
orderability\/} is a generalization of view
serializability and represents a weak notion of
equivalence to a serial schedule. Finally, the third
correctness criterion {\em strong order-ability\/} is
introduced as a generalization of conflict
serializability. Unlike consistency, the notions of
orderability allow users to operate an isolation as
maintenance of the integrity constraint now becomes the
responsibility of the database system.",
acknowledgement = ack-nhfb,
affiliation = "California Univ., Santa Barbara, CA, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Theory; Verification",
keywords = "Abbadi TODS, theory; concurrency control;
object-oriented databases; semantics; serializability
theory; verification",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Concurrency.
{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf D.2.4}: Software,
SOFTWARE ENGINEERING, Program Verification, Correctness
proofs. {\bf F.3.1}: Theory of Computation, LOGICS AND
MEANINGS OF PROGRAMS, Specifying and Verifying and
Reasoning about Programs, Assertions.",
}
@Article{Sagiv:1993:SQT,
author = "Yehoshua Sagiv and Oded Shmueli",
title = "Solving Queries by Tree Projections",
journal = j-TODS,
volume = "18",
number = "3",
pages = "487--511",
month = sep,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15",
MRnumber = "96c:68038",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-3/p487-sagiv/p487-sagiv.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-3/p487-sagiv/;
http://www.acm.org/pubs/toc/Abstracts/tods/155277.html",
abstract = "Suppose a database schema {\bf D} is extended to {\bf
D'} by adding new relation schemas, and states for {\bf
D} are extended to states for {\bf D'} by applying
joins and projections to existing relations. It is
shown that certain desirable properties that {\bf D'}
has with respect to {\bf D}. These properties amount to
the ability to compute efficiently the join of all
relations in a state for {\bf D} from an extension of
this state over {\bf D'}. The equivalence is proved for
unrestricted (i.e., both finite and infinite)
databases. If {\bf D'} is obtained from {\bf D} by
adding a set of new relation schemas that form a tree
schema, then the equivalence also holds for finite
databases. In this case there is also a polynomial time
algorithm for testing the existence of a tree
projection of {\bf D'} with respect to {\bf D}.",
acknowledgement = ack-nhfb,
affiliation = "Hebrew Univ., Jerusalem, Israel",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Theory",
keywords = "acyclicity; algorithms; chase; database schema;
design; hypergraph; inclusion dependency; join;
monotone join expression; projection; qual graph;
relational database; semijoin; semijoin reduction;
tableau; theory; tree projection; tree schema",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Query processing.",
}
@Article{Ioannidis:1993:TCA,
author = "Yannis Ioannidis and Raghu Ramakrishnan and Linda
Winger",
title = "Transitive Closure Algorithms Based on Graph
Traversal",
journal = j-TODS,
volume = "18",
number = "3",
pages = "512--576",
month = sep,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-3/p512-ioannidis/p512-ioannidis.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-3/p512-ioannidis/;
http://www.acm.org/pubs/toc/Abstracts/tods/155273.html",
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 Gobal\_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 {\em 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, 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 optimizations 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
algorithms such as Seminaive and Warren.",
acknowledgement = ack-nhfb,
affiliation = "Wisconsin Univ., Madison, WI, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "algorithms; depth-first search; node reachability;
path computations; performance; transitive closure",
subject = "{\bf D.3.4}: Software, PROGRAMMING LANGUAGES,
Processors. {\bf F.2.2}: Theory of Computation,
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY,
Nonnumerical Algorithms and Problems, Computations on
discrete structures. {\bf D.3.3}: Software, PROGRAMMING
LANGUAGES, Language Constructs and Features, Recursion.
{\bf D.4.2}: Software, OPERATING SYSTEMS, Storage
Management, Main memory. {\bf D.4.2}: Software,
OPERATING SYSTEMS, Storage Management, Secondary
storage. {\bf D.4.2}: Software, OPERATING SYSTEMS,
Storage Management, Swapping. {\bf E.1}: Data, DATA
STRUCTURES, Graphs. {\bf E.1}: Data, DATA STRUCTURES,
Trees. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Query processing.",
}
@Article{Thomasian:1993:TPL,
author = "Alexander Thomasian",
title = "Two-Phase Locking Performance and Its Thrashing
Behavior",
journal = j-TODS,
volume = "18",
number = "4",
pages = "579--625",
month = dec,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-4/p579-thomasian/p579-thomasian.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-4/p579-thomasian/;
http://www.acm.org/pubs/toc/Abstracts/tods/169720.html",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Performance; Theory",
keywords = "concurrency control; data contention; load control;
performance; theory; thrashing; two-phase locking",
subject = "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Deadlock avoidance. {\bf D.4.8}:
Software, OPERATING SYSTEMS, Performance, Modeling and
prediction. {\bf D.4.8}: Software, OPERATING SYSTEMS,
Performance, Operational analysis. {\bf D.4.8}:
Software, OPERATING SYSTEMS, Performance, Simulation.
{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Concurrency. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems, Transaction processing.",
}
@Article{Qian:1993:DSD,
author = "Xiaolei Qian",
title = "The Deductive Synthesis of Database Transactions",
journal = j-TODS,
volume = "18",
number = "4",
pages = "626--677",
month = dec,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-4/p626-qian/p626-qian.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-4/p626-qian/;
http://www.acm.org/pubs/toc/Abstracts/tods/169716.html",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Theory; Verification",
keywords = "database programming; deductive tableau; design;
integrity constraints; search control; theory;
transaction logic; transaction synthesis;
verification",
subject = "{\bf I.2.2}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Automatic Programming, Program synthesis.
{\bf D.1.2}: Software, PROGRAMMING TECHNIQUES,
Automatic Programming. {\bf F.3.1}: Theory of
Computation, LOGICS AND MEANINGS OF PROGRAMS,
Specifying and Verifying and Reasoning about Programs,
Logics of programs. {\bf H.2.0}: Information Systems,
DATABASE MANAGEMENT, General, Security, integrity, and
protection. {\bf H.2.3}: Information Systems, DATABASE
MANAGEMENT, Languages, Database (persistent)
programming languages. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Transaction
processing.",
}
@Article{Malvestuto:1993:USA,
author = "Francesco M. Malvestuto",
title = "A Universal-Scheme Approach to Statistical Databases
Containing Homogeneous Summary Tables",
journal = j-TODS,
volume = "18",
number = "4",
pages = "678--708",
month = dec,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-4/p678-malvestuto/p678-malvestuto.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-4/p678-malvestuto/;
http://www.acm.org/pubs/toc/Abstracts/tods/169712.html",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Theory",
keywords = "bipartite graph; category relation; design;
query-answering system; statistical database; summary
table; theory; universal classification scheme",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf G.1.3}: Mathematics of
Computing, NUMERICAL ANALYSIS, Numerical Linear
Algebra, Linear systems (direct and iterative methods).
{\bf G.1.6}: Mathematics of Computing, NUMERICAL
ANALYSIS, Optimization, Integer programming. {\bf
G.1.6}: Mathematics of Computing, NUMERICAL ANALYSIS,
Optimization, Linear programming. {\bf G.2.2}:
Mathematics of Computing, DISCRETE MATHEMATICS, Graph
Theory, Graph algorithms. {\bf G.2.2}: Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Network
problems. {\bf G.2.2}: Mathematics of Computing,
DISCRETE MATHEMATICS, Graph Theory, Trees. {\bf H.2.1}:
Information Systems, DATABASE MANAGEMENT, Logical
Design, Data models. {\bf H.2.3}: Information Systems,
DATABASE MANAGEMENT, Languages, Query languages.",
}
@Article{Ioannidis:1993:OHL,
author = "Yannis E. Ioannidis and Stavros Christodoulakis",
title = "Optimal Histograms for Limiting Worst-Case Error
Propagation in the Size of Join Results",
journal = j-TODS,
volume = "18",
number = "4",
pages = "709--748",
month = dec,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1993-18-4/p709-ioannidis/p709-ioannidis.pdf;
http://www.acm.org/pubs/citations/journals/tods/1993-18-4/p709-ioannidis/;
http://www.acm.org/pubs/toc/Abstracts/tods/169708.html",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Performance; Theory",
keywords = "histograms; join size estimation; performance; query
optimization; theory; vector majorization",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf G.1.0}: Mathematics of
Computing, NUMERICAL ANALYSIS, General, Error analysis.
{\bf H.1.1}: Information Systems, MODELS AND
PRINCIPLES, Systems and Information Theory.",
}
@Article{Anonymous:1993:AI,
author = "Anonymous",
title = "1993 Author Index",
journal = j-TODS,
volume = "18",
number = "4",
pages = "749--750",
month = dec,
year = "1993",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Dec 10 12:59:37 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Kim:1994:CS,
author = "Won Kim",
title = "Charter and Scope",
journal = j-TODS,
volume = "19",
number = "1",
pages = "1--??",
month = mar,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri Dec 6 18:01:56 MST 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Olivier:1994:TSO,
author = "Martin S. Olivier and Sebastiaan H. {von Solms}",
title = "A Taxonomy for Secure Object-Oriented Databases",
journal = j-TODS,
volume = "19",
number = "1",
pages = "3--46",
month = mar,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib;
http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1994-19-1/p3-olivier/p3-olivier.pdf;
http://www.acm.org/pubs/citations/journals/tods/1994-19-1/p3-olivier/;
http://www.acm.org/pubs/toc/Abstracts/tods/174640.html",
abstract = "This paper proposes a taxonomy for secure
object-oriented databases in order to clarify the
issues in modeling and implementing such databases. It
also indicates some implications of the various choices
one may make when designing such a database.\par
Most secure database models have been designed for
relational databases. The object-oriented database
model is more complex than the relational model. For
these reasons, models for secure object-oriented
databases are more complex than their relational
counterparts. Furthermore, since views of the
object-oriented model differ, each security model has
to make some assumptions about the object-oriented
model used for its particular database.\par
A number of models for secure object-oriented databases
have been proposed. These models differ in many
respects, because they focus on different aspects of
the security problem, or because they make different
assumptions about what constitutes a secure database or
because they make different assumptions about the
object-oriented model.\par
The taxonomy proposed in this paper may be used to
compare the various models: Models that focus on
specific issues may be positioned in the broader
context with the aid of the taxonomy. The taxonomy also
identifies the major aspects where security models may
differ and indicates some alternatives available to the
system designer for each such design choice. We show
some implications of using specific
alternatives.\par
Since differences between models for secure
object-oriented databases are often subtle, a formal
notation is necessary for a proper comparison. Such a
formal notation also facilitates the formal derivation
of restrictions that apply under specific conditions.
The formal approach also gives a clear indication about
the assumptions made by us---given as axioms---and the
consequences of those assumptions (and of design
choices made by the model designer)---given as
theorems.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Security",
keywords = "design; formal security models; information security;
multilevel secure databases; object-orientation;
security",
subject = "{\bf H.2.0}: Information Systems, DATABASE MANAGEMENT,
General, Security, integrity, and protection. {\bf
D.4.6}: Software, OPERATING SYSTEMS, Security and
Protection. {\bf K.6.5}: Computing Milieux, MANAGEMENT
OF COMPUTING AND INFORMATION SYSTEMS, Security and
Protection. {\bf H.2.1}: Information Systems, DATABASE
MANAGEMENT, Logical Design.",
}
@Article{Tendick:1994:MRP,
author = "Patrick Tendick and Norman Matloff",
title = "A Modified Random Perturbation Method for Database
Security",
journal = j-TODS,
volume = "19",
number = "1",
pages = "47--63",
month = mar,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1994-19-1/p47-tendick/p47-tendick.pdf;
http://www.acm.org/pubs/citations/journals/tods/1994-19-1/p47-tendick/;
http://www.acm.org/pubs/toc/Abstracts/tods/174641.html",
abstract = "The random data perturbation (RDP) method of
preserving the privacy of individual records in a
statistical database is discussed. In particular, it is
shown that if confidential attributes are allowed as
query-defining variables, severe biases may result in
responses to queries. It is also shown that even if
query definition through confidential variables is {\em
not\/} allowed, biases can still occur in responses to
queries such as those involving proportions or counts.
In either case, serious distortions may occur in user
statistical analyses. A modified version of RDP is
presented, in the form of a query adjustment procedure
and specialized perturbation structure which will
produce unbiased results.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Security",
keywords = "bias; correlation; design; noise addition; random
perturbation method; security",
subject = "{\bf H.2.0}: Information Systems, DATABASE MANAGEMENT,
General, Security, integrity, and protection. {\bf
D.4.6}: Software, OPERATING SYSTEMS, Security and
Protection, Access controls. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Query
processing.",
}
@Article{Clifford:1994:CHR,
author = "James Clifford and Albert Croker and Alexander
Tuzhilin",
title = "On Completeness of Historical Relational Query
Languages",
journal = j-TODS,
volume = "19",
number = "1",
pages = "64--116",
month = mar,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1994-19-1/p64-clifford/p64-clifford.pdf;
http://www.acm.org/pubs/citations/journals/tods/1994-19-1/p64-clifford/;
http://www.acm.org/pubs/toc/Abstracts/tods/174642.html",
abstract = "Numerous proposals for extending the relational data
model to incorporate the temporal dimension of data
have appeared in the past several years. These
proposals have differed considerably in the way that
the temporal dimension has been incorporated both into
the {\em structure\/} of the extended relations of
these temporal models and into the extended relational
{\em algebra\/} or {\em calculus\/} that they define.
Because of these differences, it has been difficult to
compare the proposed models and to make judgments as to
which of them might in some sense be equivalent or even
{\em better}. In this paper we define {\em temporally
grouped\/} and {\em temporally ungrouped\/} historical
data models and propose two notions of {\em historical
relational completeness}, analogous to Codd's notion of
relational completeness, one for each type of model. We
show that the temporally ungrouped models are less
expressive than the grouped models, but demonstrate a
technique for extending the ungrouped models with a
grouping mechanism to capture the additional semantic
power of temporal grouping. For the ungrouped models,
we define three different languages, a logic with
explicit reference to time, a temporal logic, and a
temporal algebra, and motivate our choice for the first
of these as the basis for completeness for these
models. For the grouped models, we define a many-sorted
logic with variables over ordinary values, historical
values, and times. Finally, we demonstrate the
equivalence of this grouped calculus and the ungrouped
calculus extended with a grouping mechanism. We believe
the classification of historical data models into
grouped and ungrouped models provides a useful
framework for the comparison of models in the
literature, and furthermore, the exposition of
equivalent languages for each type provides reasonable
standards for common, and minimal, notions of
historical relational completeness.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages; Theory",
keywords = "completeness; historical databases; languages; query
languages; relational model; temporal databases;
temporal grouping; temporal logic; theory",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Data
models.",
}
@Article{Salem:1994:AL,
author = "Kenneth Salem and H{\'e}ctor Garc{\'\i}a-Molina and
Jeannie Shands",
title = "Altruistic Locking",
journal = j-TODS,
volume = "19",
number = "1",
pages = "117--165",
month = mar,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "Database/Graefe.bib; http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1994-19-1/p117-salem/p117-salem.pdf;
http://www.acm.org/pubs/citations/journals/tods/1994-19-1/p117-salem/;
http://www.acm.org/pubs/toc/Abstracts/tods/174639.html",
abstract = "Long-lived transactions (LLTs) hold on to database
resources for relatively long periods of time,
significantly delaying the completion of shorter and
more common transactions. To alleviate this problem we
propose an extension to two-phase locking, called
altruistic locking, whereby LLTs can release their
locks early. Transactions that access this released
data are said to run in the wake of the LLT and must
follow special locking rules. Like two-phase locking,
altruistic locking is easy to implement and guarantees
serializability.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance; Theory",
keywords = "algorithms; atomicity; locking; performance;
scheduling; serializability; theory, concurrency
control ``wake'' of a single transaction TODS",
subject = "{\bf H.2.2}: Information Systems, DATABASE MANAGEMENT,
Physical Design, Deadlock avoidance. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Concurrency. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Transaction processing.",
}
@Article{Rosenthal:1994:TTR,
author = "Arnon Rosenthal and David Reiner",
title = "Tools and Transformations --- Rigorous and Otherwise
--- for Practical Database Design",
journal = j-TODS,
volume = "19",
number = "2",
pages = "167--211",
month = jun,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1994-19-2/p167-rosenthal/p167-rosenthal.pdf;
http://www.acm.org/pubs/citations/journals/tods/1994-19-2/p167-rosenthal/;
http://www.acm.org/pubs/toc/Abstracts/tods/176568.html",
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.\par
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.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Theory",
keywords = "applications of database theory; computer-aided
software engineering; data model translation; database
design; database equivalence; design; design
heuristics; entity-relationship model; heuristics;
normalization; theory; view integration",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf D.2.2}:
Software, SOFTWARE ENGINEERING, Tools and Techniques,
Programmer workbench. {\bf D.2.2}: Software, SOFTWARE
ENGINEERING, Tools and Techniques, Software libraries.
{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Normal
forms.",
}
@Article{Bright:1994:ARS,
author = "M. W. Bright and A. R. Hurson and S. Pakzad",
title = "Automated Resolution of Semantic Heterogeneity in
Multidatabases",
journal = j-TODS,
volume = "19",
number = "2",
pages = "212--253",
month = jun,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1994-19-2/p212-bright/p212-bright.pdf;
http://www.acm.org/pubs/citations/journals/tods/1994-19-2/p212-bright/;
http://www.acm.org/pubs/toc/Abstracts/tods/176569.html",
abstract = "A multidatabase system provides integrated access to
heterogeneous, autonomous local databases in a
distributed system. An important problem in current
multidatabase systems is identification of semantically
similar data in different local databases. The Summary
Schemas Model (SSM) is proposed as an extension to
multidatabase systems to aid in semantic
identification. The SSM uses a global data structure to
abstract the information available in a multidatabase
system. This abstracted form allows users to use their
own terms (imprecise queries) when accessing data
rather than being forced to use system-specified terms.
The system uses the global data structure to match the
user's terms to the semantically closest available
system terms. A simulation of the SSM is presented to
compare imprecise-query processing with corresponding
query-processing costs in a standard multidatabase
system. The costs and benefits of the SSM are
discussed, and future research directions are
presented.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Performance; Theory",
keywords = "design; federated database; imprecise queries;
multidatabase; performance; schemas; semantic
heterogeneity; theory",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Distributed systems. {\bf C.2.4}: Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems, Distributed databases. {\bf
H.2.5}: Information Systems, DATABASE MANAGEMENT,
Heterogeneous Databases.",
}
@Article{Sciore:1994:USV,
author = "Edward Sciore and Michael Siegel and Arnon Rosenthal",
title = "Using Semantic Values to Facilitate Interoperability
Among Heterogeneous Information Systems",
journal = j-TODS,
volume = "19",
number = "2",
pages = "254--290",
month = jun,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1994-19-2/p254-sciore/p254-sciore.pdf;
http://www.acm.org/pubs/citations/journals/tods/1994-19-2/p254-sciore/;
http://www.acm.org/pubs/toc/Abstracts/tods/176570.html",
abstract = "Large organizations need to exchange information among
many separately developed systems. In order for this
exchange to be useful, the individual systems must
agree on the meaning of their exchanged data. That is,
the organization must ensure {\em semantic
interoperability}. This paper provides a theory of {\em
semantic values\/} as a unit of exchange that
facilitates semantic interoperability between
heterogeneous information systems. We show how semantic
values can either be stored explicitly or be defined by
{\em environments}. A system architecture is presented
that allows autonomous components to share semantic
values. The key component in this architecture is
called the {\em context mediator}, whose job is to
identify and construct the semantic values being sent,
to determine when the exchange is meaningful, and to
convert the semantic values to the form required by the
receiver.\par
Our theory is then applied to the relational model. We
provide an interpretation of standard SQL queries in
which context conversions and manipulations are
transparent to the user. We also introduce an extension
of SQL, called Context-SQL (C-SQL), in which the {\em
context\/} of a semantic value can be explicitly
accessed and updated. Finally, we describe the
implementation of a prototype context mediator for a
relational C-SQL system.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Management",
keywords = "design; languages; management",
subject = "{\bf H.2.5}: Information Systems, DATABASE MANAGEMENT,
Heterogeneous Databases, Data translation. {\bf H.2.3}:
Information Systems, DATABASE MANAGEMENT, Languages,
Query languages. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems, Distributed systems.",
}
@Article{Subrahmanian:1994:AKB,
author = "V. S. Subrahmanian",
title = "Amalgamating Knowledge Bases",
journal = j-TODS,
volume = "19",
number = "2",
pages = "291--331",
month = jun,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1994-19-2/p291-subrahmanian/p291-subrahmanian.pdf;
http://www.acm.org/pubs/citations/journals/tods/1994-19-2/p291-subrahmanian/;
http://www.acm.org/pubs/toc/Abstracts/tods/176571.html",
abstract = "The integration of knowledge for multiple sources is
an important aspect of automated reasoning systems.
When different knowledge bases are used to store
knowledge provided by multiple sources, we are faced
with the problem of integrating multiple knowledge
bases: Under these circumstances, we are also
confronted with the prospect of inconsistency. In this
paper we present a uniform theoretical framework, based
on annotated logics, for amalgamating multiple
knowledge bases when these knowledge bases (possibly)
contain inconsistencies, uncertainties, and
nonmonotonic modes of negation. We show that annotated
logics may be used, with some modifications, to mediate
between different knowledge bases. The multiple
knowledge bases are amalgamated by a transformation of
the individual knowledge bases into new annotated logic
programs, together with the addition of a new axiom
scheme. We characterize the declarative semantics of
such amalgamated knowledge bases and study how the
semantics of the amalgam is related to the semantics of
the individual knowledge bases being combined.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages",
keywords = "amalgamated knowledge bases; annotated logics;
languages",
subject = "{\bf I.2.4}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Knowledge Representation Formalisms and
Methods, Representations (procedural and rule-based).
{\bf H.2.5}: Information Systems, DATABASE MANAGEMENT,
Heterogeneous Databases, Data translation. {\bf I.2.4}:
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Knowledge Representation Formalisms and Methods,
Representation languages.",
}
@Article{Yan:1994:ISS,
author = "Tak W. Yan and H{\'e}ctor Garc{\'\i}a-Molina",
title = "Index Structures for Selective Dissemination of
Information Under the {Boolean} Model",
journal = j-TODS,
volume = "19",
number = "2",
pages = "332--364",
month = jun,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1994-19-2/p332-yan/p332-yan.pdf;
http://www.acm.org/pubs/citations/journals/tods/1994-19-2/p332-yan/;
http://www.acm.org/pubs/toc/Abstracts/tods/176573.html",
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 evaluated,
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).\par
The high document arrival rate, the huge number of
users, and the timeliness requirement of the service
pose a challenge in achieving efficient SDL. 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.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "algorithms; performance",
subject = "{\bf H.3.1}: Information Systems, INFORMATION STORAGE
AND RETRIEVAL, Content Analysis and Indexing, Indexing
methods. {\bf H.2.2}: Information Systems, DATABASE
MANAGEMENT, Physical Design, Access methods. {\bf
H.3.4}: Information Systems, INFORMATION STORAGE AND
RETRIEVAL, Systems and Software, Current awareness
systems (selective dissemination of information ---
SDI).",
}
@Article{Ceri:1994:AGP,
author = "Stefano Ceri and Piero Fraternali and Stefano
Paraboschi and Letizia Tanca",
title = "Automatic Generation of Production Rules for Integrity
Maintenance",
journal = j-TODS,
volume = "19",
number = "3",
pages = "367--422",
month = sep,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1994-19-3/p367-ceri/p367-ceri.pdf;
http://www.acm.org/pubs/citations/journals/tods/1994-19-3/p367-ceri/;
http://www.acm.org/pubs/toc/Abstracts/tods/185828.html",
abstract = "In this article we present an approach to integrity
maintenance, consisting of automatically generating
production rules for integrity enforcement. Constraints
are expressed as particular formulas of Domain
Relational Calculus; they are automatically translated
into a set of repair actions, encoded as production
rules of an active database system. Production rules
may be redundant (they enforce the same constraint in
different ways) and conflicting (because repairing one
constraint may cause the violation of another
constraint). Thus, it is necessary to develop
techniques for analyzing the properties of the set of
active rules and for ensuring that any computation of
production rules after any incorrect transaction
terminates and produces a consistent database
state.\par
Along these guidelines, we describe a specific
architecture for constraint definition and enforcement.
The components of the architecture include a {\em Rule
Generator}, for producing all possible repair actions,
and a {\em Rule Analyzer and Selector}, for producing a
collection of production rules such that their
execution after an incorrect transaction always
terminates in a consistent state (possibly by rolling
back the transaction); moreover, the needs of
applications are modeled, so that integrity-enforcing
rules reach the final state that better represents the
original intentions of the transaction's supplier.
Specific input from the designer can also drive the
process and integrate or modify the rules generated
automatically by the method. Experimental results of a
prototype implementation of the proposed architecture
are also described.",
acknowledgement = ack-nhfb,
affiliation = "Dipartimento di Elettronica, Politecnico di Milano,
Italy",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Experimentation; Management",
keywords = "automatic generation of production rules;
experimentation; management",
subject = "{\bf H.2.0}: Information Systems, DATABASE MANAGEMENT,
General, Security, integrity, and protection. {\bf
I.2.2}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Automatic Programming.",
}
@Article{Polyzois:1994:ERB,
author = "Christos A. Polyzois and H{\'e}ctor
Garc{\'\i}a-Molina",
title = "Evaluation of Remote Backup Algorithms for
Transaction-Processing Systems",
journal = j-TODS,
volume = "19",
number = "3",
pages = "423--449",
month = sep,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1994-19-3/p423-polyzois/p423-polyzois.pdf;
http://www.acm.org/pubs/citations/journals/tods/1994-19-3/p423-polyzois/;
http://www.acm.org/pubs/toc/Abstracts/tods/185836.html",
abstract = "A remote backup is a copy of a primary database
maintained at a geographically separate location and is
used to increase data availability. Remote backup
systems are typically log-based and can be classified
into 2-safe and 1-safe, depending on whether
transactions commit at both sites simultaneously or
first commit at the primary and are later propagated to
the backup. We have built an experimental database
system on which we evaluated the performance of the
epoch and the dependency reconstruction algorithms, two
1-safe algorithms we have developed. We compared the
1-safe with the 2-safe approach under various
conditions.",
acknowledgement = ack-nhfb,
affiliation = "IBM Thomas J. Watson Res. Center, Yorktown Heights,
NY, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance; Reliability",
keywords = "algorithms; disaster recovery; hot spare; hot standby;
performance; reliability; remote backup",
subject = "{\bf H.2.7}: Information Systems, DATABASE MANAGEMENT,
Database Administration, Logging and recovery. {\bf
H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf C.2.4}: Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems, Distributed databases. {\bf
C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed applications. {\bf D.4.5}: Software,
OPERATING SYSTEMS, Reliability, Backup procedures. {\bf
D.4.5}: Software, OPERATING SYSTEMS, Reliability,
Fault-tolerance.",
}
@Article{Chrysanthis:1994:SET,
author = "Panos K. Chrysanthis and Krithi Ramamritham",
title = "Synthesis of Extended Transaction Models Using
{ACTA}",
journal = j-TODS,
volume = "19",
number = "3",
pages = "450--491",
month = sep,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1994-19-3/p450-chrysanthis/p450-chrysanthis.pdf;
http://www.acm.org/pubs/citations/journals/tods/1994-19-3/p450-chrysanthis/;
http://www.acm.org/pubs/toc/Abstracts/tods/185843.html",
abstract = "ACTA is a comprehensive transaction framework that
facilitates the formal description of properties of
extended transaction models. Specifically, using ACTA,
one can specify and reason about (1) the effects of
transactions on objects and (2) the interactions
between transactions. This article presents ACTA {\em
as a tool for the synthesis of extended transaction
models}, one which supports the development and
analysis of new extended transaction models in a
systematic manner. Here, this is demonstrated by
deriving new transaction definitions (1) by modifying
the specifications of existing transaction models, (2)
by combining the specifications of existing models, and
(3) by starting from first principles. To exemplify the
first, new models are synthesized from {\em atomic
transactions\/} and {\em join transactions}. To
illustrate the second, we synthesize a model that
combines aspect of the {\em nested\/}- and {\em
split-transaction\/} models. We demonstrate the latter
by deriving the specification of an {\em
open-nested-transaction\/} model from high-level
requirements.",
acknowledgement = ack-nhfb,
affiliation = "Pittsburgh Univ., PA, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Reliability; Theory; Verification",
keywords = "concurrency control; correctness criteria; design;
reliability; semantics; serializability theory; theory;
transaction models; verification",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf C.2.4}: Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems, Distributed databases. {\bf
D.2.4}: Software, SOFTWARE ENGINEERING, Program
Verification, Correctness proofs. {\bf D.3.3}:
Software, PROGRAMMING LANGUAGES, Language Constructs
and Features, Abstract data types. {\bf D.4.1}:
Software, OPERATING SYSTEMS, Process Management,
Concurrency. {\bf F.3.1}: Theory of Computation, LOGICS
AND MEANINGS OF PROGRAMS, Specifying and Verifying and
Reasoning about Programs, Assertions. {\bf H.2.4}:
Information Systems, DATABASE MANAGEMENT, Systems,
Concurrency. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Distributed systems.",
}
@Article{Korth:1994:FAC,
author = "Henry F. Korth and Greg Speegle",
title = "Formal Aspects of Concurrency Control in Long-Duration
Transaction Systems Using the {NT\slash PV} model",
journal = j-TODS,
volume = "19",
number = "3",
pages = "492--535",
month = sep,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1994-19-3/p492-korth/p492-korth.pdf;
http://www.acm.org/pubs/citations/journals/tods/1994-19-3/p492-korth/;
http://www.acm.org/pubs/toc/Abstracts/tods/185854.html",
abstract = "In the typical database system, an execution is
correct if it is equivalent to some serial execution.
This criterion, called serializability, is unacceptable
for new database applications which require
long-duration transactions. We present a new
transaction model which allows correctness criteria
more suitable for these applications. This model
combines three enhancements to the standard model:
nested transactions, explicit predicates, and multiple
versions. These features yield the name of the new
model, nested transactions with predicates and
versions, or NT/PV.\par
The modular nature of the NT/PV model allows a
straightforward representation of simple systems. It
also provides a formal framework for describing complex
interactions. The most complex interactions the model
allows can be captured by a protocol which exploits all
of the semantics available to the NT/PV model. An
example of these interactions is shown in a CASE
application. The example shows how a system based on
the NT/PV model is superior to both standard database
techniques and unrestricted systems in both correctness
and performance.",
acknowledgement = ack-nhfb,
affiliation = "Matsushita Inf. Technol. Lab., Panasonic Technol.
Inc., Princeton, NJ, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Theory",
keywords = "concurrency control protocol; semantic information;
theory; transaction processing",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Concurrency. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems, Transaction processing.",
}
@Article{Goldman:1994:QCN,
author = "Kenneth J. Goldman and Nancy Lynch",
title = "Quorum Consensus in Nested-Transaction Systems",
journal = j-TODS,
volume = "19",
number = "4",
pages = "537--585",
month = dec,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1994-19-4/p537-goldman/p537-goldman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1994-19-4/p537-goldman/;
http://www.acm.org/pubs/toc/Abstracts/tods/195666.html",
abstract = "Gifford's Quorum Consensus algorithm for data
replication is studied in the context of nested
transactions and transaction failures (aborts), and a
fully developed reconfiguration strategy is presented.
A formal description of the algorithm is presented
using the Input/Output automaton model for
nested-transaction systems due to Lynch and Merritt. In
this description, the algorithm itself is described in
terms of nested transactions. The formal description is
used to construct a complete proof of correctness that
uses standard assertional techniques, is based on a
natural correctness condition, and takes advantage of
modularity that arises from describing the algorithm as
nested transactions. The proof is accomplished
hierarchically, showing that a fully replicated
reconfigurable system ``simulates'' an intermediate
replicated system, and that the intermediate system
simulates an unreplicated system. The presentation and
proof treat issues of data replication entirely
separately from issues of concurrency control and
recovery.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Washington Univ., St. Louis,
MO, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Theory; Verification",
keywords = "algorithms; concurrency control; data replication;
hierarchical proofs; I/O automata; nested transactions;
quorum consensus; theory; verification",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Concurrency. {\bf H.2.4}: Information Systems,
DATABASE MANAGEMENT, Systems, Distributed systems.",
}
@Article{Krishnakumar:1994:BIT,
author = "Narayanan Krishnakumar and Arthur J. Bernstein",
title = "Bounded Ignorance: {A} Technique for Increasing
Concurrency in a Replicated System",
journal = j-TODS,
volume = "19",
number = "4",
pages = "586--625",
month = dec,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1994-19-4/p586-krishnakumar/p586-krishnakumar.pdf;
http://www.acm.org/pubs/citations/journals/tods/1994-19-4/p586-krishnakumar/;
http://www.acm.org/pubs/toc/Abstracts/tods/195670.html",
abstract = "Databases are replicated to improve performance and
availability. The notion of correctness that has
commonly been adopted for concurrent access by
transactions to shared, possibly replicated, data is
serializability. However, serializability may be
impractical in high-performance applications since it
imposes too stringent a restriction on concurrency.
When serializability is relaxed, the integrity
constraints describing the data may be violated. By
allowing bounded violations of the integrity
constraints, however, we are able to increase the
concurrency of transactions that execute in a
replicated environment. In this article, we introduce
the notion of an {\em N-ignorant\/} transaction, which
is a transaction that may be ignorant of the results of
at most $N$ prior transactions, which is a transaction
that may be ignorant of the results of at most $N$
prior transactions. A system in which all transactions
are {\em N-ignorant\/} can have an $N$ + 1-fold
increase in concurrency over serializable systems, at
the expense of bounded violations of its integrity
constraints. We present algorithms for implementing
replicated databases in {\em N-ignorant\/} systems. We
then provide constructive methods for calculating the
reachable states in such systems, given the value of
$N$, so that one may assess the maximum liability that
is incurred in allowing constraint violation. Finally,
we generalize the notion of {\em N-ignorance\/} to a
matrix of ignorance for the purpose of higher
concurrency.",
acknowledgement = ack-nhfb,
affiliation = "State Univ. of New York, Stony Brook, NY, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance; Theory",
keywords = "algorithms; concurrency control; integrity
constraints; performance; reachability analysis;
replication; serializability; theory",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf C.2.4}: Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems, Distributed applications. {\bf
C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Concurrency.
{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Distributed systems.",
}
@Article{Winslett:1994:FQL,
author = "Marianne Winslett and Kenneth Smith and Xiaolei Qian",
title = "Formal Query Languages for Secure Relational
Databases",
journal = j-TODS,
volume = "19",
number = "4",
pages = "626--662",
month = dec,
year = "1994",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1994-19-4/p626-winslett/p626-winslett.pdf;
http://www.acm.org/pubs/citations/journals/tods/1994-19-4/p626-winslett/;
http://www.acm.org/pubs/toc/Abstracts/tods/195675.html",
abstract = "The addition of stringent security specifications to
the list of requirements for an application poses many
new problems in DBMS design and implementation, as well
as database design, use, and maintenance. Tight
security requirements, such as those that result in
silent masking of withholding of true information from
a user or the introduction of false information into
query answers, also raise fundamental questions about
the meaning of the database and the semantics of
accompanying query languages. In this paper, we propose
a belief-based semantics for secure databases, which
provides a semantics for databases that can ``lie''
about the state of the world, or about their knowledge
about the state of the world, in order to preserve
security. This kind of semantics can be used as a
helpful retrofit for the proposals for a ``multilevel
secure'' database model (a particularly stringent form
of security), and may be useful for less restrictive
security policies as well. We also propose a family of
query languages for multilevel secure relational
database applications, and base the semantics of those
languages on our semantics for secure databases. Our
query languages are free of the semantic problems
associated with use of ordinary SQL in a multilevel
secure context, and should be easy for users to
understand and employ.",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL,
USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Security",
keywords = "formal security models; information security;
multilevel secure databases; security",
subject = "{\bf H.2.0}: Information Systems, DATABASE MANAGEMENT,
General, Security, integrity, and protection. {\bf
K.6.5}: Computing Milieux, MANAGEMENT OF COMPUTING AND
INFORMATION SYSTEMS, Security and Protection. {\bf
H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Query languages.",
}
@Article{Kim:1995:CS,
author = "Won Kim",
title = "Charter and scope",
journal = j-TODS,
volume = "20",
number = "1",
pages = "1--2",
month = mar,
year = "1995",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Dec 10 13:00:12 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Aiken:1995:SAT,
author = "Alexander Aiken and Joseph M. Hellerstein and Jennifer
Widom",
title = "Static Analysis Techniques for Predicting the Behavior
of Active Database Rules",
journal = j-TODS,
volume = "20",
number = "1",
pages = "3--41",
month = mar,
year = "1995",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1995-20-1/p3-aiken/p3-aiken.pdf;
http://www.acm.org/pubs/citations/journals/tods/1995-20-1/p3-aiken/;
http://www.acm.org/pubs/toc/Abstracts/tods/202107.html",
abstract = "This article gives methods for statically analyzing
sets of active database rules to determine if the rules
are (1) guaranteed to terminate, (2) guaranteed to
produce a unique final database state, and (3)
guaranteed to produce a unique stream of observable
actions. If 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
{\em Starburst Rule System}.",
acknowledgement = ack-nhfb,
affiliation = "California Univ., Berkeley, CA, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Management; Verification",
keywords = "active database systems; algorithms; confluence;
database rule processing; design; management; static
analysis; termination; verification",
subject = "{\bf H.2.m}: Information Systems, DATABASE MANAGEMENT,
Miscellaneous. {\bf D.2.4}: Software, SOFTWARE
ENGINEERING, Program Verification, Validation. {\bf
I.2.5}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Programming Languages and Software.",
}
@Article{Chen:1995:DUR,
author = "Weidong Chen",
title = "Declarative Updates of Relational Databases",
journal = j-TODS,
volume = "20",
number = "1",
pages = "42--70",
month = mar,
year = "1995",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1995-20-1/p42-chen/p42-chen.pdf;
http://www.acm.org/pubs/citations/journals/tods/1995-20-1/p42-chen/;
http://www.acm.org/pubs/toc/Abstracts/tods/202110.html",
abstract = "This article presents a declarative language, called
{\em update calculus}, of relational database updates.
A formula in update calculus involves conditions for
the current database, as well as assertions about a new
database. Logical connectives and quantifiers become
constructors of complex updates, offering flexible
specifications of database transformations. Update
calculus can express all nondeterministic database
transformations that are polynomial time.\par
For set-at-a-time evaluation of updates, we present a
corresponding {\em update algebra}. Existing techniques
of query processing can be incorporated into update
evaluation. We show that updates in update calculus can
be translated into expressions in update algebra and
vice versa.",
acknowledgement = ack-nhfb,
affiliation = "Southern Methodist Univ., Dallas, TX, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages; Theory",
keywords = "database languages; database updates; expressive
power; languages; theory; update algebra; update
calculus",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Data manipulation languages (DML).",
}
@Article{Jagadish:1995:IDM,
author = "H. V. Jagadish",
title = "The {INCINERATE} data model",
journal = j-TODS,
volume = "20",
number = "1",
pages = "71--110",
month = mar,
year = "1995",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1995-20-1/p71-jagadish/p71-jagadish.pdf;
http://www.acm.org/pubs/citations/journals/tods/1995-20-1/p71-jagadish/;
http://www.acm.org/pubs/toc/Abstracts/tods/202113.html",
abstract = "In this article, we present an extended relational
algebra with universally or existentially quantified
classes as attribute values. The proposed extension can
greatly enhance the expressive power of relational
systems, and significantly reduce the size of a
database, at small additional computational cost. We
also show how the proposed extensions can be built on
top of a standard relational database system.",
acknowledgement = ack-nhfb,
affiliation = "AT\&T Bell Labs., Murray Hill, NJ, USA",
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Theory",
keywords = "algorithms; design; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models.",
}
@Article{Baekgaard:1995:ICN,
author = "Lars Baekgaard and Leo Mark",
title = "Incremental Computation of Nested Relational Query
Expressions",
journal = j-TODS,
volume = "20",
number = "2",
pages = "111--148",
month = jun,
year = "1995",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1995-20-2/p111-baekgaard/p111-baekgaard.pdf;
http://www.acm.org/pubs/citations/journals/tods/1995-20-2/p111-baekgaard/;
http://www.acm.org/pubs/toc/Abstracts/tods/210198.html",
abstract = "Efficient algorithms for incrementally computing
nested query expressions do not exist. Nested query
expressions are query expressions in which
selection/join predicates contain subqueries. In order
to respond to this problem, we propose a two-step
strategy for incrementally computing nested query
expressions. In step (1), the query expression is
transformed into an equivalent unnested flat query
expression. In step (2), the flat query expression is
incrementally computed. To support step (1), we have
developed a very concise algebra-to-algebra
transformation algorithm, and we have formally proved
its correctness. The flat query expressions resulting
from the transformation make intensive use of the
relational set-difference operator. To support step
(2), we present and analyze an efficient algorithm for
incrementally computing set differences based on view
pointer caches. When combined with existing incremental
algorithms for SPJ queries, our incremental
set-difference algorithm can be used to compute the
unnested flat query expressions efficiently. It is
important to notice that without our incremental
set-difference algorithm the existing incremental
algorithms for SPJ queries are useless for any query
involving the set-difference operator, including
queries that are not the result of unnesting nested
queries.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "algorithms; incremental computation; nested query
expressions; performance; set differences; unnesting;
view pointer caches",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.2.2}: Information
Systems, DATABASE MANAGEMENT, Physical Design, Access
methods. {\bf H.2.3}: Information Systems, DATABASE
MANAGEMENT, Languages, Query languages. {\bf H.3.3}:
Information Systems, INFORMATION STORAGE AND RETRIEVAL,
Information Search and Retrieval, Search process. {\bf
H.3.3}: Information Systems, INFORMATION STORAGE AND
RETRIEVAL, Information Search and Retrieval, Query
formulation. {\bf E.5}: Data, FILES,
Sorting/searching.",
}
@Article{Chomicki:1995:ECT,
author = "Jan Chomicki",
title = "Efficient Checking of Temporal Integrity Constraints
Using Bounded History Encoding",
journal = j-TODS,
volume = "20",
number = "2",
pages = "149--186",
month = jun,
year = "1995",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1995-20-2/p149-chomicki/p149-chomicki.pdf;
http://www.acm.org/pubs/citations/journals/tods/1995-20-2/p149-chomicki/;
http://www.acm.org/pubs/toc/Abstracts/tods/210200.html",
abstract = "We present an efficient implementation method for
temporal integrity constraints formulated in Past
Temporal Logic. Although the constraints can refer to
past states of the database, their checking does not
require that the entire database history be stored.
Instead, every database state is extended with
auxiliary relations that contain the historical
information necessary for checking constraints.
Auxiliary relations can be implemented as materialized
relational views.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Theory",
keywords = "active databases; algorithms; database integrity;
integrity constraints; real-time databases; temporal
databases; temporal logic; theory; triggers",
subject = "{\bf H.2.0}: Information Systems, DATABASE MANAGEMENT,
General, Security, integrity, and protection. {\bf
F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND
FORMAL LANGUAGES, Mathematical Logic. {\bf H.2.3}:
Information Systems, DATABASE MANAGEMENT, Languages,
Data description languages (DDL).",
}
@Article{Graefe:1995:FAU,
author = "Goetz Graefe and Richard L. Cole",
title = "Fast Algorithms for Universal Quantification in large
Databases",
journal = j-TODS,
volume = "20",
number = "2",
pages = "187--236",
month = jun,
year = "1995",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1995-20-2/p187-graefe/p187-graefe.pdf;
http://www.acm.org/pubs/citations/journals/tods/1995-20-2/p187-graefe/;
http://www.acm.org/pubs/toc/Abstracts/tods/210202.html",
abstract = "Universal quantification is not supported directly in
most database systems despite the fact that it adds
significant power to a system's query processing and
inference capabilities, in particular for the analysis
of many-to-many relationships and of set-valued
attributes. One of the main reasons for this omission
has been that universal quantification algorithms and
their performance have not been explored for large
databases. In this article, we describe and compare
three known algorithms and one recently proposed
algorithm for relational division, the algebra operator
that embodies universal quantification. For each
algorithm, we investigate the performance effects of
explicit duplicate removal and referential integrity
enforcement, variants for inputs larger than memory,
and parallel execution strategies. Analytical and
experimental performance comparisons illustrate the
substantial differences among the algorithms. Moreover,
comparisons demonstrate that the recently proposed
division algorithm evaluates a universal quantification
predicate over two relations as fast as hash (semi-)
join evaluates an existential quantification predicate
over the same relations. Thus, existential and
universal quantification can be supported with equal
efficiency by adding the recently proposed algorithm to
a query evaluation system. A second result of our study
is that universal quantification should be expressed
directly in a database query language, because most
query optimizers do not recognize the rather indirect
formulations available in SQL as relational division
and therefore produce very poor evaluation plans for
many universal quantification queries.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Experimentation",
keywords = "algorithms; experimentation",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf E.5}: Data, FILES.
{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Data
manipulation languages (DML).",
}
@Article{Chen:1995:QED,
author = "Weidong Chen",
title = "Query Evaluation in Deductive Databases with
Alternating Fixpoint Semantics",
journal = j-TODS,
volume = "20",
number = "3",
pages = "239--287",
month = sep,
year = "1995",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
MRclass = "68P15 (68P20)",
MRnumber = "96g:68024",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1995-20-3/p239-chen/p239-chen.pdf;
http://www.acm.org/pubs/citations/journals/tods/1995-20-3/p239-chen/;
http://www.acm.org/pubs/toc/Abstracts/tods/211416.html",
abstract = "First-order formulas allow natural descriptions of
queries and rules. Van Gelder's alternating fixpoint
semantics extends the well-founded semantics of normal
logic programs to general logic programs with arbitrary
first-order formulas in rule bodies. However, an
implementation of general logic programs through the
standard translation into normal logic programs does
not preserve the alternating fixpoint semantics. This
paper presents a direct method for goal-oriented query
evaluation of general logic programs. Every general
logic program is first transformed into a normal form
where the body of each rule is either an existential
conjunction of literals or a universal disjunction of
literals. Techniques of memoing and loop checking are
incorporated so that termination and polynomial-time
data complexity are guaranteed for deductive databases
(or function-free programs). Results of the soundness
and search space completeness are established.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Theory; Verification",
keywords = "alternating fixpoint; deductive databases; negation;
predicate logic; query evaluations; SLG resolution;
theory; verification",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Query
processing. {\bf I.2.3}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving,
Logic programming.",
}
@Article{Ioannidis:1995:CCQ,
author = "Yannis E. Ioannidis and Raghu Ramakrishnan",
title = "Containment of Conjunctive Queries: Beyond Relations
as Sets",
journal = j-TODS,
volume = "20",
number = "3",
pages = "288--324",
month = sep,
year = "1995",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1995-20-3/p288-ioannidis/p288-ioannidis.pdf;
http://www.acm.org/pubs/citations/journals/tods/1995-20-3/p288-ioannidis/;
http://www.acm.org/pubs/toc/Abstracts/tods/211419.html",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Theory",
keywords = "algorithms; conjunctive queries; equivalence;
languages; multisets; query containment; query
optimization; theory",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf F.0}: Theory of
Computation, GENERAL. {\bf H.2.3}: Information Systems,
DATABASE MANAGEMENT, Languages, Query languages. {\bf
H.1.1}: Information Systems, MODELS AND PRINCIPLES,
Systems and Information Theory.",
}
@Article{Shasha:1995:TCA,
author = "Dennis Shasha and Fran{\c{c}}ois Llirbat and Eric
Simon and Patrick Valduriez",
title = "Transaction Chopping: Algorithms and Performance
Studies",
journal = j-TODS,
volume = "20",
number = "3",
pages = "325--363",
month = sep,
year = "1995",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1995-20-3/p325-shasha/p325-shasha.pdf;
http://www.acm.org/pubs/citations/journals/tods/1995-20-3/p325-shasha/;
http://www.acm.org/pubs/toc/Abstracts/tods/211427.html",
abstract = "Chopping transactions into pieces is good for
performance but may lead to nonserializable executions.
Many researchers have reacted to this fact by either
inventing new concurrency-control mechanisms, weakening
serializability, or both. We adopt a different
approach. We assume a user who\par
---has access only to user-level tools such as (1)
choosing isolation degrees 1ndash;4, (2) the ability to
execute a portion of a transaction using multiversion
read consistency, and (3) the ability to reorder the
instructions in transaction programs; and\par
---knows the set of transactions that may run during a
certain interval (users are likely to have such
knowledge for on-line or real-time transactional
applications).\par
Given this information, our algorithm finds the finest
chopping of a set of transactions TranSet with the
following property: {\em If the pieces of the chopping
execute serializably, then TranSet executes
serializably}. This permits users to obtain more
concurrency while preserving correctness. Besides
obtaining more intertransaction concurrency, chopping
transactions in this way can enhance intratransaction
parallelism.\par
The algorithm is inexpensive, running in $O(nx(e+m))$
time, once conflicts are identified, using a naive
implementation, where $n$ is the number of concurrent
transactions in the interval $e$ is the number of edges
in the conflict graph among the transactions, and $m$
is the maximum number of accesses of any transaction.
This makes it feasible to add as a tuning knob to real
systems.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "algorithms; locking; multidatabase; performance;
serializability; tuning",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf D.4.8}: Software,
OPERATING SYSTEMS, Performance, Simulation. {\bf
H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Concurrency. {\bf I.6.8}: Computing
Methodologies, SIMULATION AND MODELING, Types of
Simulation, Discrete event.",
}
@Article{Chen:1995:EML,
author = "I.-Min A. Chen and Richard Hull and Dennis McLeod",
title = "An Execution Model for Limited Ambiguity Rules and its
Application to Derived Data Update",
journal = j-TODS,
volume = "20",
number = "4",
pages = "365--413",
month = dec,
year = "1995",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1995-20-4/p365-chen/p365-chen.pdf;
http://www.acm.org/pubs/citations/journals/tods/1995-20-4/p365-chen/;
http://www.acm.org/pubs/toc/Abstracts/tods/219039.html",
abstract = "A novel execution model for rule application in active
databases is developed and applied to the problem of
updating derived data in a database represented using a
semantic, object-based database model. The execution
model is based on the use of ``limited ambiguity
rules'' (LARs), which permit disjunction in rule
actions. The execution model essentially performs a
breadth-first exploration of alternative extensions of
a user-requested update. Given an object-based database
schema, both integrity constraints and specifications
of derived classes and attributes are compiled into a
family of limited ambiguity rules. A theoretical
analysis shows that the approach is sound: the
execution model returns all valid ``completions'' of a
user-requested update, or terminates with an
appropriate error notification. The complexity of the
approach in connection with derived data update is
considered.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Languages; Performance; Theory",
keywords = "active database systems; algorithms; deltas on
database states; derived data; design; languages;
limited ambiguity rules; management; semantic data
models; theory; update propagation",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.m}: Information
Systems, DATABASE MANAGEMENT, Miscellaneous.",
}
@Article{Fraternali:1995:SAD,
author = "Piero Fraternali and Letizia Tanca",
title = "A Structured Approach for the Definition of the
Semantics of Active Databases",
journal = j-TODS,
volume = "20",
number = "4",
pages = "414--471",
month = dec,
year = "1995",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1995-20-4/p414-fraternali/p414-fraternali.pdf;
http://www.acm.org/pubs/citations/journals/tods/1995-20-4/p414-fraternali/;
http://www.acm.org/pubs/toc/Abstracts/tods/219042.html",
abstract = "Active DBMSs couple database technology with
rule-based programming to achieve the capability of
reaction to database (and possibly external) stimuli,
called {\em events}. The reactive capabilities of
active databases are useful for a wide spectrum of
applications, including security, view materialization,
integrity checking and enforcement, or heterogeneous
database integration, which makes this technology very
promising for the near future. An active database
system consists of a (passive) database and a set of
{\em active rules\/}; the most popular form of active
rule is the so-called {\em event-condition-action\/}
(ECA) rule, which specifies an action to be executed
upon the occurrence of one or more events, provided
that a condition holds. Several active database systems
and prototypes have been designed and partially or
completely implemented. Unfortunately, they have been
designed in a totally independent way, without the
support of a common theory dictating the semantics of
ECA rules, and thus often show different behaviors for
rules with a similar form. In this article we consider
a number of different possible options in the behavior
of an active DBMS, based on a broad analysis of some of
the best known implemented systems and prototypes. We
encode these options in a user-readable form, called
{\em Extended ECA}. A rule from any existing system can
be rewritten in this formalism making all the semantic
choices apparent. Then an EECA rule can be
automatically translated into an internal (less
readable) format, based on a logical style, which is
called {\em core\/} format: the execution semantics of
core rules is specified as the fixpoint of a simple
transformation involving core rules. As an important
premise to this research, a semantics for database
updates and transactions has also been established,
with respect to a notion of state that comprises both
data and events. The article also presents an extensive
bibliography on the subject of active databases.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages; Theory",
keywords = "active database systems; database rule processing;
events; fixpoint semantics; languages; rules;
semantics; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design. {\bf F.3.2}: Theory of Computation,
LOGICS AND MEANINGS OF PROGRAMS, Semantics of
Programming Languages, Operational semantics. {\bf
H.2.m}: Information Systems, DATABASE MANAGEMENT,
Miscellaneous. {\bf I.2.5}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Programming Languages and
Software.",
}
@Article{Srivastava:1995:SOD,
author = "Divesh Srivastava and S. Sudarshan and Raghu
Ramakrishnan and Jeffrey F. Naughton",
title = "Space Optimization in Deductive Databases",
journal = j-TODS,
volume = "20",
number = "4",
pages = "472--516",
month = dec,
year = "1995",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1995-20-4/p472-srivastava/p472-srivastava.pdf;
http://www.acm.org/pubs/citations/journals/tods/1995-20-4/p472-srivastava/;
http://www.acm.org/pubs/toc/Abstracts/tods/219056.html",
abstract = "In the bottom-up evaluation of logic programs and
recursively defined views on databases, all generated
facts are usually assumed to be stored until the end of
the evaluation. Discarding facts during the evaluation,
however, can considerably improve the efficiency of the
evaluation: the space needed to evaluate the program,
the I/O costs, the costs of maintaining and accessing
indices, and the cost of eliminating duplicates may all
be reduced. Given an evaluation method that is sound,
complete, and does not repeat derivation steps, we
consider how facts can be discarded during the
evaluation without compromising these properties. We
show that every such space optimization method has
certain components, the first to ensure soundness and
completeness, the second to avoid redundancy (i.e.,
repetition of derivations), and the third to reduce
``fact lifetimes'' (i.e., the time period for which
each fact must be retained during evaluation). We
present new techniques based on providing bounds on the
number of derivations and uses of facts, and using
monotonicity constraints for each of the first two
components, and provide novel synchronization
techniques for the third component of a space
optimization method. We describe how techniques for
each of the three components can be combined in
practice to obtain a space optimization method for a
program. Our results are also of importance in
applications such as sequence querying, and in active
databases where triggers are defined over multiple
``events.''",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Theory",
keywords = "algorithms; bottom-up query evaluation deductive
database systems; discarding facts; languages; logic
programming; theory",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages.",
}
@Article{Baralis:1996:MTA,
author = "Elena Baralis and Stefano Ceri and Stefano
Paraboschi",
title = "Modularization Techniques for Active Rules Design",
journal = j-TODS,
volume = "21",
number = "1",
pages = "1--29",
month = mar,
year = "1996",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1996-21-1/p1-baralis/p1-baralis.pdf;
http://www.acm.org/pubs/citations/journals/tods/1996-21-1/p1-baralis/;
http://www.acm.org/pubs/toc/Abstracts/tods/227605.html",
abstract = "Active database systems can be used to establish and
enforce data management policies. A large amount of the
semantics that normally needs to be coded in
application programs can be abstracted and assigned to
active rules. This trend is sometimes called
``knowledge independence'' a nice consequence of
achieving full knowledge independence is that data
management policies can then effectively evolve just by
modifying rules instead of application programs. Active
rules, however, may be quite complex to understand and
manage: rules react to arbitrary event sequences, they
trigger each other, and sometimes the outcome of rule
processing may depend on the order in which events
occur or rules are scheduled. Although reasoning on a
large collection of rules is very difficult, the task
becomes more manageable when the rules are few.
Therefore, we are convinced that modularization,
similar to what happens in any software development
process, is the key principle for designing active
rules; however, this important notion has not been
addressed so far. This article introduces a
modularization technique for active rules called
stratification; it presents a theory of stratification
and indicates how stratification can be practically
applied. The emphasis of this article is on providing a
solution to a very concrete and practical problem;
therefore, our approach is illustrated by several
examples.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design",
keywords = "active database systems; database rule processing;
design; modularization; static analysis; termination",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Schema and subschema. {\bf D.2.1}:
Software, SOFTWARE ENGINEERING,
Requirements/Specifications, Methodologies. {\bf
D.2.2}: Software, SOFTWARE ENGINEERING, Tools and
Techniques, Modules and interfaces. {\bf H.2.8}:
Information Systems, DATABASE MANAGEMENT, Database
applications.",
}
@Article{Buneman:1996:PTI,
author = "Peter Buneman and Atsushi Ohori",
title = "Polymorphism and Type Inference in Database
Programming",
journal = j-TODS,
volume = "21",
number = "1",
pages = "30--76",
month = mar,
year = "1996",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1996-21-1/p30-buneman/p30-buneman.pdf;
http://www.acm.org/pubs/citations/journals/tods/1996-21-1/p30-buneman/;
http://www.acm.org/pubs/toc/Abstracts/tods/227609.html",
abstract = "In order to find a static type system that adequately
supports database languages, we need to express the
most general type of a program that involves database
operations. This can be achieved through an extension
to the type system of ML that captures the polymorphic
nation of field selection, together with a techniques
that generalizes relational operators to arbitrary data
structures. The combination provides a statically typed
language in which generalized relational databases may
be cleanly represented as typed structures. As in ML
types are inferred, which relieves the programmer of
making the type assertions that may be required in a
complex database environment.\par
These extensions may also be used to provide static
polymorphic typechecking in object-oriented languages
and databases. A problem that arises with
object-oriented databases is the apparent need for
dynamic typechecking when dealing queries on
heterogeneous collections of objects. An extension of
the type system needed for generalized relational
operations can also be used for manipulating
collections of dynamically typed values in a statically
typed language. A prototype language based on these
ideas has been implemented. While it lacks a proper
treatment of persistent data, it demonstrates that a
wide variety of database structures can be cleanly
represented in a polymorphic programming language.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages; Theory",
keywords = "generalized relational algebra; inheritance;
object-oriented databases; polymorphism; record
calculus; theory; type inference",
subject = "{\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language
Constructs and Features, Data types and structures.
{\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal
Definitions and Theory. {\bf D.3.2}: Software,
PROGRAMMING LANGUAGES, Language Classifications,
Applicative languages. {\bf D.3.3}: Software,
PROGRAMMING LANGUAGES, Language Constructs and
Features, Abstract data types. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Data
models. {\bf H.2.1}: Information Systems, DATABASE
MANAGEMENT, Logical Design, Schema and subschema. {\bf
H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Database (persistent) programming languages.
{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Query languages.",
}
@Article{Mok:1996:NFP,
author = "Wai Yin Mok and Yiu-Kai Ng and David W. Embley",
title = "A Normal Form for Precisely Characterizing Redundancy
in Nested Relations",
journal = j-TODS,
volume = "21",
number = "1",
pages = "77--106",
month = mar,
year = "1996",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1996-21-1/p77-mok/p77-mok.pdf;
http://www.acm.org/pubs/citations/journals/tods/1996-21-1/p77-mok/;
http://www.acm.org/pubs/toc/Abstracts/tods/227612.html",
abstract = "We give a straightforward definition for redundancy in
individual nested relations and define a new normal
form that precisely characterizes redundancy for nested
relations. We base our definition of redundancy on an
arbitrary set of functional and multivalued
dependencies, and show that our definition of nested
normal form generalizes standard relational
normalization theory. In addition, we give a condition
that can prevent an unwanted structural anomaly in
nested relations, namely, embedded nested relations
with at most one tuple. Like other normal forms, our
nested normal form can serve as a guide for database
design.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Theory",
keywords = "data redundancy; database design; design; functional
and multivalued dependencies; nested normal form;
nested relations; normalization theory; scheme trees;
theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Normal forms. {\bf H.2.1}: Information
Systems, DATABASE MANAGEMENT, Logical Design, Data
models.",
}
@Article{Mumick:1996:MC,
author = "Inderpal Singh Mumick and Sheldon J. Finkelstein and
Hamid Pirahesh and Raghu Ramakrishnan",
title = "Magic conditions",
journal = j-TODS,
volume = "21",
number = "1",
pages = "107--155",
month = mar,
year = "1996",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1996-21-1/p107-mumick/p107-mumick.pdf;
http://www.acm.org/pubs/citations/journals/tods/1996-21-1/p107-mumick/;
http://www.acm.org/pubs/toc/Abstracts/tods/227624.html",
abstract = "Much recent work has focused on the bottom-up
evaluation of Datalog programs [Bancilhon and
Ramakrishnan 1988]. One approach, called magic-sets, is
based on rewriting a logic program so that bottom-up
fixpoint evaluation of the program avoids generation of
irrelevant facts [Bancilhon et al. 1986; Beeri and
Ramakrishnan 1987; Ramakrishnan 1991]. It was widely
believed for some time that the principal application
of the magic-sets technique is to restrict computation
in recursive queries using equijoin predicates. We
extend the magic-sets transformation to use predicates
other than equality ($X>10$, for example) in
restricting computation. The resulting {\em ground
magic-sets transformation\/} is an important step in
developing an extended magic-sets transformation that
has practical utility in ``real'' relational databases,
not only for recursive queries, but for nonrecursive
queries as well [Mumick et al. 1990b; Mumick 1991].",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Measurement; Theory; Verification",
keywords = "algorithms; bottom-up evaluation; constraint logic
programming; constraints; deductive databases; magic
sets; measurement; query optimization; relational
databases; Starburst; theory; verification",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing.",
}
@Article{Liu:1996:BBS,
author = "Ling Liu and Robert Meersman",
title = "The Building Blocks for Specifying Communication
Behavior of Complex Objects: An Activity-Driven
Approach",
journal = j-TODS,
volume = "21",
number = "2",
pages = "157--207",
month = jun,
year = "1996",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1996-21-2/p157-liu/p157-liu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1996-21-2/p157-liu/;
http://www.acm.org/pubs/toc/Abstracts/tods/232622.html",
abstract = "Communication behavior represents dynamic evolution
and cooperation of a group of objects in accomplishing
a task. It is an important feature in object-oriented
systems. We propose the concept of activity as a basic
building block for declarative specification of
communication behavior in object-oriented database
systems, including the temporal ordering of message
exchanges within object communication and the
behavioral relationships between activity executions.
We formally introduce two kinds of activity composition
mechanisms: {\em activity specialization\/} and
activity {\em aggregation\/} for abstract
implementation of communication behavior. The former is
suited for behavioral refinement of existing activities
into specialized activities. The latter is used for
behavioral composition of simpler activities into
complex activities, and ultimately, into the envisaged
database system. We use first-order temporal logic as
an underlying formalism for specification of
communication constraints. The well known
Air-traffic-control case is used as a running example
to highlight the underlying concepts, to illustrate the
usefulness, and to assess the effectiveness of the
activity model for declarative specification of
communication behavior in the relevant universe of
discourse. We also propose a methodological framework
for integrating activity schema with entity schema in
an object-oriented design environment.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Theory",
keywords = "activity aggregation; activity patterns; activity
specialization; communication behavior; design;
first-order temporal logic; languages; object-oriented
databases; synchronization schemes; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design. {\bf D.3.1}: Software, PROGRAMMING
LANGUAGES, Formal Definitions and Theory, Semantics.
{\bf F.3.1}: Theory of Computation, LOGICS AND MEANINGS
OF PROGRAMS, Specifying and Verifying and Reasoning
about Programs, Specification techniques. {\bf H.2.3}:
Information Systems, DATABASE MANAGEMENT, Languages.
{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems. {\bf C.2.4}: Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases.",
}
@Article{Ross:1996:TRE,
author = "Kenneth A. Ross",
title = "Tail Recursion Elimination in Deductive Databases",
journal = j-TODS,
volume = "21",
number = "2",
pages = "208--237",
month = jun,
year = "1996",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1996-21-2/p208-ross/p208-ross.pdf;
http://www.acm.org/pubs/citations/journals/tods/1996-21-2/p208-ross/;
http://www.acm.org/pubs/toc/Abstracts/tods/232628.html",
abstract = "We consider an optimization technique for deductive
and relational databases. The optimization technique is
an extension of the magic templates rewriting, and it
can improve the performance of query evaluation by not
materializing the extension of intermediate views.
Standard relational techniques, such as unfolding
embedded view definitions, do not apply to recursively
defined views, and so alternative techniques are
necessary. We demonstrate the correctness of our
rewriting. We define a class of ``nonrepeating'' view
definitions, and show that for certain queries our
rewriting performs at least as well as magic templates
on nonrepeating views, and often much better. A
syntactically recognizable property, called ``weak
right-linearity'', is proposed. Weak right-linearity is
a sufficient condition for nonrepetition and is more
general than right-linearity. Our technique gives the
same benefits as right-linear evaluation of
right-linear views, while applying to a significantly
more general class of views.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms",
keywords = "algorithms; deductive databases; magic sets; query
optimization; tail recursion",
subject = "{\bf H.2.4}: Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages. {\bf I.2.3}: Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving,
Logic programming.",
}
@Article{Bell:1996:IDD,
author = "Colin Bell and Anil Nerode and Raymond T. Ng and V. S.
Subrahmanian",
title = "Implementing Deductive Databases by Mixed Integer
Programming",
journal = j-TODS,
volume = "21",
number = "2",
pages = "238--269",
month = jun,
year = "1996",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1996-21-2/p238-bell/p238-bell.pdf;
http://www.acm.org/pubs/citations/journals/tods/1996-21-2/p238-bell/;
http://www.acm.org/pubs/toc/Abstracts/tods/232691.html",
abstract = "Existing and past generations of Prolog compilers have
left deduction to run-time and this may account for the
poor run-time performance of existing Prolog systems.
Our work tries to minimize run-time deduction by
shifting the deductive process to compile-time. In
addition, we offer an alternative inferencing procedure
based on translating logic to mixed integer
programming. This makes available for research and
implementation in deductive databases, all the
theorems, algorithms, and software packages developed
by the operations research community over the past 50
years. The method keeps the same query language as for
disjunctive deductive databases, only the inferencing
procedure changes. The language is purely declarative,
independent of the order of rules in the program, and
independent of the order in which literals occur in
clause bodies. The technique avoids Prolog's problem of
infinite looping. It saves run-time by doing primary
inferencing at compile-time. Furthermore, it is
incremental in nature. The first half of this article
translates disjunctive clauses, integrity constraints,
and database facts into Boolean equations, and develops
procedures to use mixed integer programming methods to
compute equations, and develops procedures to use mixed
integer programming methods to compute equations, and
develops procedures to use mixed integer programming
methods to compute equations, and develops procedures
to use mixed integer programming methods to
compute\par
---least models of definite deductive databases,
and\par
---minimal models and the Generalized Closed World
Assumption of disjunctive databases.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Theory",
keywords = "design; minimal models; negation and disjunction in
deductive databases; theory",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages. {\bf F.4.1}: Theory of Computation,
MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
Logic. {\bf I.2.4}: Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Knowledge Representation Formalisms and
Methods.",
}
@Article{Guo:1996:SSI,
author = "Sha Guo and Wei Sun and Mark A. Weiss",
title = "Solving Satisfiability and Implication Problems in
Database Systems",
journal = j-TODS,
volume = "21",
number = "2",
pages = "270--293",
month = jun,
year = "1996",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1996-21-2/p270-guo/p270-guo.pdf;
http://www.acm.org/pubs/citations/journals/tods/1996-21-2/p270-guo/;
http://www.acm.org/pubs/toc/Abstracts/tods/232692.html",
abstract = "Satisfiability, implication, and equivalence problems
involving conjunctive inequalities are important and
widely encountered database problems that need to be
efficiently and effectively processed. In this article
we consider two popular types of arithmetic
inequalities, ({\em X{\bf op\/}Y}) and ({\em X {\bf
op\/} C}), where $X$ and $Y$ are attributes, $C$ is a
constant of the domain or $X$, and {\bf op}[epsilon]
$<$, $<=$, $=$, ***, $>$, $>=$. These inequalities are
most frequently used in a database system, inasmuch as
the former type of inequality represents a 0-join, and
the latter is a selection. We study the satisfiability
and implication problems under the integer domain and
the real domain, as well as under two different
operator sets ({$<$, $<=$, =, $>=$, $>$} and {$<$,
$<=$, =, ***, $>=$, $>$}). Our results show that
solutions under different domains and/or different
operator sets are quite different. Out of these eight
cases, excluding two cases that had been shown to be
NP-hard, we either report the first necessary and
sufficient conditions for these problems as well as
their efficient algorithms with complexity analysis
(for four cases), or provide an improved algorithm (for
two cases). These iff conditions and algorithms are
essential to database designers, practitioners, and
researchers. These algorithms have been implemented and
an experimental study comparing the proposed algorithms
and those previously known is conducted. Our
experiments show that the proposed algorithms are more
efficient than previously known algorithms even for
small input. The C++ code can be obtained by an
anonymous ftp from \path=archive.fiu.edu=.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Theory",
keywords = "algorithms; deduction; equivalence; implication;
languages; reasoning; satisfiabilty; theory",
subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems, Complexity of proof
procedures. {\bf H.2.4}: Information Systems, DATABASE
MANAGEMENT, Systems, Query processing. {\bf I.2.3}:
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Deduction and Theorem Proving, Deduction. {\bf I.1.2}:
Computing Methodologies, ALGEBRAIC MANIPULATION,
Algorithms, Analysis of algorithms.",
}
@Article{Ciaccia:1996:DKB,
author = "Paolo Ciaccia and Paolo Tiberio and Pavel Zezula",
title = "Declustering of Key-Based Partitioned Signature
Files",
journal = j-TODS,
volume = "21",
number = "3",
pages = "295--338",
month = sep,
year = "1996",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1996-21-3/p295-ciaccia/p295-ciaccia.pdf;
http://www.acm.org/pubs/citations/journals/tods/1996-21-3/p295-ciaccia/;
http://www.acm.org/pubs/toc/Abstracts/tods/232755.html",
abstract = "Access methods based on signature files can largely
benefit from possibilities offered by parallel
environments. To this end, an effective {\em
declustering\/} strategy that would distribute
signatures over a set of parallel independent disks has
to be combined with a synergic {\em clustering\/} which
is employed to avoid searching the whole signature file
while executing a query. This article proposes two
parallel signature file organizations, Hamming Filter
({\em HF\/}) and Hamming$^+$ Filter ($H^+F$), whose
common declustering strategy is based on {\em error
correcting codes}, and where clustering is achieved by
organizing signatures into fixed-size buckets, each
containing signatures sharing the same {\em key\/}
value. {\em HF\/} allocates signatures on disks in a
static way and works well if a correct relationship
holds between the parameters of the code and the size
of the file. $H^+F$ is a generalization of $HF$
suitable to manage highly dynamic files. It uses a
dynamic declustering, obtained through a {\em
sequence\/} of codes, and organizes a smooth migration
of signatures between disks so that high performance
levels are retained regardless of current file size.
Theoretical analysis characterizes the best-case,
expected, and worst-case behaviors of these
organizations. Analytical results are verified by
experiments on prototype systems.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Performance",
keywords = "design; error correcting codes; information retrieval;
parallel independent disks; partial match queries;
performance; performance evaluation; superimposed
coding",
subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY. {\bf
E.5}: Data, FILES, Organization/structure. {\bf H.2.2}:
Information Systems, DATABASE MANAGEMENT, Physical
Design, Access methods. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Query
processing. {\bf H.3.2}: Information Systems,
INFORMATION STORAGE AND RETRIEVAL, Information Storage,
File organization.",
}
@Article{Dey:1996:PRM,
author = "Debabrata Dey and Sumit Sarkar",
title = "A Probabilistic Relational Model and Algebra",
journal = j-TODS,
volume = "21",
number = "3",
pages = "339--369",
month = sep,
year = "1996",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1996-21-3/p339-dey/p339-dey.pdf;
http://www.acm.org/pubs/citations/journals/tods/1996-21-3/p339-dey/;
http://www.acm.org/pubs/toc/Abstracts/tods/232796.html",
abstract = "Although the relational model for databases provides a
great range of advantages over other data models, it
lacks a comprehensive way to handle incomplete and
uncertain data. Uncertainty in data values, however, is
pervasive in all real-world environments and has
received much attention in the literature. Several
methods have been proposed for incorporating uncertain
data into relational databases. However, the current
approaches have many shortcomings and have not
established an acceptable extension of the relational
model. In this paper, we propose a consistent extension
of the relational model. We present a revised
relational structure and extend the relational algebra.
The extended algebra is shown to be closed, a
consistent extension of the conventional relational
algebra, and reducible to the latter.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages; Theory",
keywords = "data incompleteness; data uncertainty; languages;
probabilistic relation; probability calculus;
relational algebra; relational model; theory",
subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf F.4.3}: Theory of
Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
Formal Languages, Algebraic language theory. {\bf G.3}:
Mathematics of Computing, PROBABILITY AND STATISTICS,
Statistical computing. {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Data
manipulation languages (DML). {\bf H.2.3}: Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages. {\bf H.2.8}: Information Systems, DATABASE
MANAGEMENT, Database applications. {\bf I.2.3}:
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Deduction and Theorem Proving, Uncertainty, ``fuzzy,''
and probabilistic reasoning.",
}
@Article{Ghandeharizadeh:1996:HED,
author = "Shahram Ghandeharizadeh and Richard Hull and Dean
Jacobs",
title = "{Heraclitus}: Elevating Deltas to be First-Class
Citizens in a Database Programming Language",
journal = j-TODS,
volume = "21",
number = "3",
pages = "370--426",
month = sep,
year = "1996",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1996-21-3/p370-ghandeharizadeh/p370-ghandeharizadeh.pdf;
http://www.acm.org/pubs/citations/journals/tods/1996-21-3/p370-ghandeharizadeh/;
http://www.acm.org/pubs/toc/Abstracts/tods/232801.html",
abstract = "Traditional database systems provide a user with the
ability to query and manipulate one database state,
namely the current database state. However, in several
emerging applications, the ability to analyze
``what-if'' scenarios in order to reason about the
impact of an update (before committing that update) is
of paramount importance. Example applications include
hypothetical database access, active database
management systems, and version management, to name a
few. The central thesis of the Heraclitus paradigm is
to provide flexible support for applications such as
these by elevating {\em deltas}, which represent
updates proposed against the current database state, to
be first-class citizens. Heraclitus[Alg,C] is a
database programming language that extends C to
incorporate the relational algebra and deltas.
Operators are provided that enable the programmer to
explicitly construct, combine, and access deltas. Most
interesting is the when operator, that supports
hypothetical access to a delta: the expression {\bf E}
when [sigma] yields the value that side effect free
expression E would have if the value of delta
expression [sigma] were applied to the current database
state. This article presents a broad overview of the
philosophy underlying the Heraclitus paradigm, and
describes the design and prototype implementation of
Heraclitus[Alg, C]. A model-independent formalism for
the Heraclitus paradigm is also presented. To
illustrate the utility of Heraclitus, the article
presents an in-depth discussion of how Heraclitus[Alg,
C] can be used to specify, and thereby implement, a
wide range of execution models for rule application in
active databases; this includes both prominent
execution models presented in the literature, and more
recent ``customized'' execution models with novel
features.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages",
keywords = "active databases; deltas; design; execution model for
rule application; hypothetical access; hypothetical
database state; languages",
subject = "{\bf H.2.3}: Information Systems, DATABASE MANAGEMENT,
Languages, Database (persistent) programming languages.
{\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language
Constructs and Features. {\bf H.2.4}: Information
Systems, DATABASE MANAGEMENT, Systems, Query
processing. {\bf H.2.m}: Information Systems, DATABASE
MANAGEMENT, Miscellaneous.",
}
@Article{Kuo:1996:MVD,
author = "Dean Kuo",
title = "Model and verification of a data manager based on
{ARIES}",
journal = j-TODS,
volume = "21",
number = "4",
pages = "427--479",
month = dec,
year = "1996",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1996-21-4/p427-kuo/p427-kuo.pdf;
http://www.acm.org/pubs/citations/journals/tods/1996-21-4/p427-kuo/",
abstract = "In this article, we model and verify a data manager
whose algorithm is based on ARIES. The work uses the
I/O automata method as the formal model and the
definition of correctness is defined on the interface
between the scheduler and the data manager.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Reliability; Theory; Verification",
keywords = "ARIES; I/O automata; reliability; system failures;
theory; verification",
subject = "{\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS
OF PROGRAMS, Specifying and Verifying and Reasoning
about Programs, Assertions. {\bf H.2.2} Information
Systems, DATABASE MANAGEMENT, Physical Design, Recovery
and restart. {\bf H.2.4} Information Systems, DATABASE
MANAGEMENT, Systems, Transaction processing.",
}
@Article{Litwin:1996:LSD,
author = "Witold Litwin and Marie-Anna Neimat and Donovan A.
Schneider",
title = "{LH*} --- a scalable, distributed data structure",
journal = j-TODS,
volume = "21",
number = "4",
pages = "480--525",
month = dec,
year = "1996",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1996-21-4/p480-litwin/p480-litwin.pdf;
http://www.acm.org/pubs/citations/journals/tods/1996-21-4/p480-litwin/",
abstract = "We present a scalable distributed data structure
called LH*. LH* generalizes Linear Hashing (LH) to
distributed RAM and disk files. An LH* file can be
created from records with primary keys, or objects with
OIDs, provided by any number of distributed and
autonomous clients. It does not require a central
directory, and grows gracefully, through splits of one
bucket at a time, to virtually any number of servers.
The number of messages per random insertion is one in
general, and three in the worst case, regardless of the
file size. The number of messages per key search is two
in general, and four in the worst case. The file
supports parallel operations, e.g., hash joins and
scans. Performing a parallel operation on a file of $M$
buckets costs at most 2 $M$ + 1 messages, and between 1
and $O$ (log 2 $M$) rounds of messages.\par
We first describe the basic LH* scheme where a
coordinator site manages abucket splits, and splits a
bucket every time a collision occurs. We show that the
average load factor of an LH* file is 65%-70%
regardless of file size, and bucket capacity. We then
enhance the scheme with load control, performed at no
additional message cost. The average load factor then
increases to 80-95%. These values are about that of LH,
but the load factor for LH* varies more.\par
We nest define LH* schemes without a coordinator. We
show that insert and search costs are the same as for
the basic scheme. The splitting cost decreases on the
average, but becomes more variable, as cascading splits
are needed to prevent file overload. Next, we briefly
describe two variants of splitting policy, using
parallel splits and presplitting that should enhance
performance for high-performance applications.\par
All together, we show that LH* files can efficiently
scale to files that are orders of magnitude larger in
size than single-site files. LH* files that reside in
main memory may also be much faster than single-site
disk files. Finally, LH* files can be more efficient
than any distributed file with a centralized directory,
or a static parallel or distributed hash file.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Performance; Theory",
keywords = "algorithms; data structures; design; distributed
access methods; extensible hashing; linear hashing;
performance",
subject = "{\bf E.2} Data, DATA STORAGE REPRESENTATIONS,
Hash-table representations. {\bf E.1} Data, DATA
STRUCTURES. {\bf H.2.1} Information Systems, DATABASE
MANAGEMENT, Logical Design",
}
@Article{Raschid:1996:SUR,
author = "Louiqa Raschid and Jorge Lobo",
title = "Semantics for update rule programs and implementation
in a relational database management system",
journal = j-TODS,
volume = "21",
number = "4",
pages = "526--572",
month = dec,
year = "1996",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1996-21-4/p526-raschid/p526-raschid.pdf;
http://www.acm.org/pubs/citations/journals/tods/1996-21-4/p526-raschid/",
abstract = "In this paper, we present our research on defining a
correct semantics for a class of update rule (UR)
programs, and discuss implementing these programs in a
DBMS environment. Update rules execute by updating
relations in a database which may cause the further
execution of rules. A correct semantics must guarantee
that the execution of the rules will terminate and that
it will produce a minimal updated database. The class
of UR programs is syntactically identified, based upon
a concept that is similar to stratification. We extend
that strict definition of stratification and allow a
relaxed criterion for partitioning of the rules in the
UR program. This relaxation allows a limited degree of
nondeterminism in rule execution. We define an
execution semantics based upon a monotonic fixpoint
operator TUR, resulting in a set of fixpoints for UR.
The monotonicity of the operator is maintained by
explicitly representing the effect of asserting and
retracting tuples in the database. A declarative
semantics for the update rule program is obtained by
associating a normal logic program UR to represent the
UR program. We use the stable model semantics which
characterize a normal logic program by a set of minimal
models which are called stable models. We show the
equivalence between the set of fixpoints for UR and the
set of stable models for UR. We briefly discuss
implementing the fixpoint semantics of the UR program
in a DBMS environment. Relations that can be updated by
the rules are {\em updatable\/} relations and they are
extended with two flags. An update rule is represented
by a database query, which queries the updatable
relations as well as database relations, i.e., those
relations which are not update by rules. We describe an
algorithm to process the queries and compute a fixpoint
in the DBMS environment and obtain a final database.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Experimentation; Theory; Verification",
keywords = "constant maintenance; deductive database; fixpoint
semantics; rule-based systems; stable model semantics;
update rules",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems. {\bf F.4.1} Theory of Computation,
MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
Logic, Model theory. {\bf H.2.3} Information Systems,
DATABASE MANAGEMENT, Languages, Data description
languages (DDL). {\bf I.2.4} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Knowledge Representation
Formalisms and Methods, Predicate logic. {\bf I.2.4}
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Knowledge Representation Formalisms and Methods,
Representations (procedural and rule-based). {\bf
H.2.7} Information Systems, DATABASE MANAGEMENT,
Database Administration",
}
@Article{Keen:1997:EEL,
author = "John S. Keen and William J. Dally",
title = "Extended ephemeral logging: log storage management for
applications with long lived transactions",
journal = j-TODS,
volume = "22",
number = "1",
pages = "1--42",
month = mar,
year = "1997",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1997-22-1/p1-keen/p1-keen.pdf;
http://www.acm.org/pubs/citations/journals/tods/1997-22-1/p1-keen/",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance; Reliability",
keywords = "algorithms; design; disk management; logging; long
transactions; OLTP; performance; reliability",
subject = "{\bf H.2.7} Information Systems, DATABASE MANAGEMENT,
Database Administration, Logging and recovery. {\bf
H.2.2} Information Systems, DATABASE MANAGEMENT,
Physical Design, Recovery and restart. {\bf H.2.4}
Information Systems, DATABASE MANAGEMENT, Systems,
Transaction processing",
}
@Article{Galindo-Legaria:1997:OSR,
author = "C{\'e}sar Galindo-Legaria and Arnon Rosenthal",
title = "Outerjoin simplification and reordering for query
optimization",
journal = j-TODS,
volume = "22",
number = "1",
pages = "43--74",
month = mar,
year = "1997",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1997-22-1/p43-galindo-legaria/p43-galindo-legaria.pdf;
http://www.acm.org/pubs/citations/journals/tods/1997-22-1/p43-galindo-legaria/",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Theory; Verification",
keywords = "algorithms; outerjoins; query optimization; query
reordering; theory; verification",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Query processing. {\bf G.2.2} Mathematics of
Computing, DISCRETE MATHEMATICS, Graph Theory, Graph
algorithms",
}
@Article{Peters:1997:AMD,
author = "Randel J. Peters and M. Tamer {\"O}zsu",
title = "An axiomatic model of dynamic schema evolution in
objectbase systems",
journal = j-TODS,
volume = "22",
number = "1",
pages = "75--114",
month = mar,
year = "1997",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1997-22-1/p75-peters/p75-peters.pdf;
http://www.acm.org/pubs/citations/journals/tods/1997-22-1/p75-peters/",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Management; Theory",
keywords = "algorithms; design; dynamic schema evolution;
management; object database management systems;
theory",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design. {\bf H.2.1} Information Systems,
DATABASE MANAGEMENT, Logical Design, Schema and
subschema",
}
@Article{Wang:1997:LDT,
author = "X. Sean Wang and Claudio Bettini and Alexander Brodsky
and Sushil Jajodia",
title = "Logical design for temporal databases with multiple
granularities",
journal = j-TODS,
volume = "22",
number = "2",
pages = "115--170",
month = jun,
year = "1997",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1997-22-2/p115-wang/p115-wang.pdf;
http://www.acm.org/pubs/citations/journals/tods/1997-22-2/p115-wang/",
abstract = "The purpose of good database logical design is to
eliminate data redundancy and insertion and deletion
anomalies. In order to achieve this objective for
temporal databases, the notions of {\em temporal
types}, which formalize time granularities, and {\em
temporal functional dependencies\/} (TFDs) are
introduced. A temporal type is a monotonic mapping from
ticks of time (represented by positive integers) to
time sets (represented by subsets of reals) and is used
to capture various standard and user-defined calendars.
A TFD is a proper extension of the traditional
functional dependency and takes the form $X**Y$ meaning
that there is a unique value for $Y$ during one tick of
the temporal type [mu] for one particular $X$ value. An
axiomatization for TFDs is given. Because a finite set
TFDs usually implies an infinite number of TFDs, we
introduce the notion of and give an axiomatization for
a {\em finite closure\/} to effectively capture a
finite set of implied TFDs that are essential of the
logical design. Temporal normalization procedures with
respect to TFDs are given. Specifically, temporal
Boyce-Codd normal form (TBCNF) that avoids all data
redundancies due to TFDs, and temporal third normal
form (T3NF) that allows dependency preservation, are
defined. Both normal forms are proper extensions of
their traditional counterparts, BCNF and 3NF.
Decomposition algorithms are presented that give
lossless TBCNF decompositions and lossless,
dependency-preserving, T3NF decompositions.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Theory",
keywords = "algorithms; Boyce-Codd normal form; design;
granularity; normalization; temporal databases;
temporal modules; temporal relations; theory; third
normal form",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Normal forms. {\bf H.2.4} Information
Systems, DATABASE MANAGEMENT, Systems",
}
@Article{Clifford:1997:SND,
author = "James Clifford and Curtis Dyreson and Tom{\'a}s
Isakowitz and Christian S. Jensen and Richard T.
Snodgrass",
title = "On the semantics of ``now'' in databases",
journal = j-TODS,
volume = "22",
number = "2",
pages = "171--214",
month = jun,
year = "1997",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1997-22-2/p171-clifford/p171-clifford.pdf;
http://www.acm.org/pubs/citations/journals/tods/1997-22-2/p171-clifford/",
abstract = "Although ``{\em now\/}'' is expressed in SQL and
CURRENT_TIMESTAMP within queries, this value cannot be
stored in the database. How ever, this notion of an
ever-increasing current-time value has been reflected
in some temporal data models by inclusion of
database-resident variables, such as ``{\em now\/}''
``{\em until-changed},'' ``**,'' ``@,'' and ``-''. Time
variables are very desirable, but their used also leads
to a new type of database, consisting of tuples with
variables, termed a {\em variable database.\/}",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages; Performance",
keywords = "indeterminacy; languages; Now; now-relative value;
performance; SQL; temporal query language; TSQL2",
subject = "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
Languages, SQL. {\bf H.2.3} Information Systems,
DATABASE MANAGEMENT, Languages, Data description
languages (DDL). {\bf H.2.4} Information Systems,
DATABASE MANAGEMENT, Systems, Query processing",
}
@Article{Ammann:1997:AFM,
author = "Paul Ammann and Sushil Jajodia and Indrakshi Ray",
title = "Applying formal methods to semantic-based
decomposition of transactions",
journal = j-TODS,
volume = "22",
number = "2",
pages = "215--254",
month = jun,
year = "1997",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1997-22-2/p215-ammann/p215-ammann.pdf;
http://www.acm.org/pubs/citations/journals/tods/1997-22-2/p215-ammann/",
abstract = "In some database applications the traditional approach
of serializability, in which transactions appear to
execute atomically and in isolation on a consistent
database state, fails to satisfy performance
requirements. Although many researchers have
investigated the process of decomposing transactions
into steps to increase concurrency, such research
typically focuses on providing algorithms necessary to
implement a decomposition supplied by the database
application developer and pays relatively little
attention to what constitutes a desirable decomposition
or how the developer should obtain one. We focus on the
decomposition itself. A decomposition generates proof
obligations whose discharge ensures desirable
properties with respect to the original collection of
transactions. We introduce the notion of semantic
histories to formulate and prove the necessary
properties, and the notion of successor sets to
describe efficiently the correct interleavings of
steps. The successor set constraints use information
about conflicts between steps so as to take full
advantage of conflict serializability at the level of
steps. We propose a mechanism based on two-phase
locking to generate correct stepwise serializable
histories.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Theory; Verification",
keywords = "concurrency control; database management systems;
theory; transaction processing; verification",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf D.2.1} Software,
SOFTWARE ENGINEERING, Requirements/Specifications,
Methodologies. {\bf F.3.1} Theory of Computation,
LOGICS AND MEANINGS OF PROGRAMS, Specifying and
Verifying and Reasoning about Programs, Invariants.
{\bf F.3.1} Theory of Computation, LOGICS AND MEANINGS
OF PROGRAMS, Specifying and Verifying and Reasoning
about Programs, Pre- and post-conditions. {\bf F.3.1}
Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS,
Specifying and Verifying and Reasoning about Programs,
Specification techniques",
}
@Article{Wolfson:1997:ADR,
author = "Ouri Wolfson and Sushil Jajodia and Yixiu Huang",
title = "An adaptive data replication algorithm",
journal = j-TODS,
volume = "22",
number = "2",
pages = "255--314",
month = jun,
year = "1997",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1997-22-2/p255-wolfson/p255-wolfson.pdf;
http://www.acm.org/pubs/citations/journals/tods/1997-22-2/p255-wolfson/",
abstract = "This article addresses the performance of distributed
database systems. Specifically, we present an algorithm
for dynamic replication of an object in distributed
systems. The algorithm is adaptive in the sense that it
changes the replication scheme of the object (i.e., the
set of processors at which the object is replicated) as
changes occur in the read-write pattern of the object
(i.e., the number of reads and writes issued by each
processor). The algorithm continuously moves the
replication scheme towards an optimal one. We show that
the algorithm can be combined with the concurrency
control and recovery mechanisms of ta distributed
database management system. The performance of the
algorithm is analyzed theoretically and experimentally.
On the way we provide a lower bound on the performance
of any dynamic replication algorithm.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "algorithms; computer networks; dynamic data
allocation; file allocation; performance; replicated
data",
subject = "{\bf C.2.4} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases. {\bf H.2.4} Information Systems,
DATABASE MANAGEMENT, Systems, Distributed systems. {\bf
H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing. {\bf C.2.4} Computer
Systems Organization, COMPUTER-COMMUNICATION NETWORKS,
Distributed Systems, Distributed applications. {\bf
C.4} Computer Systems Organization, PERFORMANCE OF
SYSTEMS, Design studies. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS, Measurement
techniques. {\bf C.4} Computer Systems Organization,
PERFORMANCE OF SYSTEMS, Modeling techniques. {\bf C.4}
Computer Systems Organization, PERFORMANCE OF SYSTEMS,
Reliability, availability, and serviceability",
}
@Article{Franklin:1997:TCS,
author = "Michael J. Franklin and Michael J. Carey and Miron
Livny",
title = "Transactional client-server cache consistency:
alternatives and performance",
journal = j-TODS,
volume = "22",
number = "3",
pages = "315--363",
month = sep,
year = "1997",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1997-22-3/p315-franklin/p315-franklin.pdf;
http://www.acm.org/pubs/citations/journals/tods/1997-22-3/p315-franklin/;
http://www.acm.org:80/pubs/citations/journals/tods/1997-22-3/p315-franklin/",
abstract = "Client-server database systems based on a data
shipping model can exploit client memory resources by
caching copies of data items across transaction
boundaries. Caching reduces the need to obtain data
from servers or other sites on the network. In order to
ensure that such caching does not result in the
violation of transaction semantics, a transactional
cache consistency maintenance algorithm is required.
Many such algorithms have been proposed in the
literature and, as all provide the same functionality,
performance is a primary concern in choosing among
them. In this article we present a taxonomy that
describes the design space for transactional cache
consistency maintenance algorithms and show how
proposed algorithms relate to one another. We then
investigate the performance of six of these algorithms,
and use these results to examine the tradeoffs inherent
in the design choices identified in the taxonomy. The
results show that the interactions among dimensions of
the design space impact performance in many ways, and
that classifications of algorithms as simply
``pessimistic'' or ``optimistic'' do not accurately
characterize the similarities and differences among the
many possible cache consistency algorithms.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Performance",
keywords = "algorithms; design; performance",
subject = "{\bf C.2.4} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases. {\bf C.4} Computer Systems
Organization, PERFORMANCE OF SYSTEMS. {\bf D.4.8}
Software, OPERATING SYSTEMS, Performance. {\bf H.2.4}
Information Systems, DATABASE MANAGEMENT, Systems,
Concurrency.",
}
@Article{Eiter:1997:DD,
author = "Thomas Eiter and Georg Gottlob and Heikki Mannila",
title = "Disjunctive {Datalog}",
journal = j-TODS,
volume = "22",
number = "3",
pages = "364--418",
month = sep,
year = "1997",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1997-22-3/p364-eiter/p364-eiter.pdf;
http://www.acm.org/pubs/citations/journals/tods/1997-22-3/p364-eiter/;
http://www.acm.org:80/pubs/citations/journals/tods/1997-22-3/p364-eiter/",
abstract = "We consider disjunctive Datalog, a powerful database
query language based on disjunctive logic programming.
Briefly, disjunctive Datalog is a variant of Datalog
where disjunctions may appear in the rule heads;
advanced versions also allow for negation in the bodies
which can be handled according to a semantics for
negation in disjunctive logic programming. In
particular, we investigate three different semantics
for disjunctive Datalog: the minimal model semantics
the perfect model semantics, and the stable model
semantics. For each of these semantics, the expressive
power and complexity are studied. We show that the
possibility variants of these semantics express the
same set of queries. In fact, they precisely capture
the complexity class {\em P2}. Thus, unless the
Polynomial Hierarchy collapses, disjunctive Datalog is
more expressive that normal logic programming with
negation. These results are not only of theoretical
interest; we demonstrate that problems relevant in
practice such as computing the optimal tour value in
the Traveling Salesman Problem and eigenvector
computations can be handled in disjunctive Datalog, but
not Datalog with negation (unless the Polynomial
Hierarchy collapses). In addition, we study modularity
properties of disjunctive Datalog and investigate
syntactic restrictions of the formalisms.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages; Theory",
keywords = "languages; theory",
subject = "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
Languages, Datalog. {\bf H.2.3} Information Systems,
DATABASE MANAGEMENT, Languages, Query languages. {\bf
D.1.6} Software, PROGRAMMING TECHNIQUES, Logic
Programming. {\bf I.2.3} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving.
{\bf I.2.4} Computing Methodologies, ARTIFICIAL
INTELLIGENCE, Knowledge Representation Formalisms and
Methods. {\bf F.2.2} Theory of Computation, ANALYSIS OF
ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical
Algorithms and Problems. {\bf F.4.1} Theory of
Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES,
Mathematical Logic, Logic and constraint programming.",
}
@Article{Lakshmanan:1997:PFP,
author = "Laks V. S. Lakshmanan and Nicola Leone and Robert Ross
and V. S. Subrahmanian",
title = "{ProbView}: a flexible probabilistic database system",
journal = j-TODS,
volume = "22",
number = "3",
pages = "419--469",
month = sep,
year = "1997",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1997-22-3/p419-lakshmanan/p419-lakshmanan.pdf;
http://www.acm.org/pubs/citations/journals/tods/1997-22-3/p419-lakshmanan/;
http://www.acm.org:80/pubs/citations/journals/tods/1997-22-3/p419-lakshmanan/",
abstract = "Probability theory is mathematically the best
understood paradigm for modeling and manipulating
uncertain information. Probabilities of complex events
can be computed from those of basic events on which
they depend, using any of a number of strategies. Which
strategy is appropriate depends very much on the known
interdependencies among the events involved. Previous
work on probabilistic databases has assumed a {\em
fixed\/} and {\em restrictive\/} combination strategy
(e.g., assuming all events are pairwise independent).
In this article, we characterize, using postulates,
whole classes of strategies for conjunction,
disjunction, and negation, meaningful from the
viewpoint of probability theory. (1) We propose a
probabilistic relational data model and a {\em
generic\/}probabilistic relational algebra that neatly
captures {\em various strategies\/} satisfying the
postulates, within a {\em single unified framework.}
(2) We show that as long as the chosen strategies can
be computed in polynomial time, queries in the positive
fragment of the probabilistic relational algebra have
essentially the same data complexity as classical
relational algebra. (3) We establish various
containments and equivalences between algebraic
expressions, similar in spirit to those in classical
algebra. (4) We develop algorithms for maintaining
materialized probabilistic views. (5) Based on these
ideas, we have developed a prototype probabilistic
database system called ProbView on top of Dbase V.0. We
validate our complexity results with experiments and
show that rewriting certain types of queries to other
equivalent forms often yields substantial savings.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Performance; Theory",
keywords = "algorithms; languages; performance; probabilistic
databases; theory; view maintenance",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems. {\bf H.2.3} Information Systems, DATABASE
MANAGEMENT, Languages. {\bf I.2.3} Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and
Theorem Proving.",
}
@Article{Storey:1997:DDC,
author = "Veda C. Storey and Roger H. L. Chiang and Debabrata
Dey and Robert C. Goldstein and Shankar Sundaresan",
title = "Database design with common sense business reasoning
and learning",
journal = j-TODS,
volume = "22",
number = "4",
pages = "471--512",
month = dec,
year = "1997",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1997-22-4/p471-storey/p471-storey.pdf;
http://www.acm.org/pubs/citations/journals/tods/1997-22-4/p471-storey/;
http://www.acm.org:80/pubs/citations/journals/tods/1997-22-4/p471-storey/",
abstract = "Automated database design systems embody knowledge
about the database design process. However, their lack
of knowledge about the domains for which databases are
being developed significantly limits their usefulness.
A methodology for acquiring and using general world
knowledge about business for database design has been
developed and implemented in a system called the Common
Sense Business Reasoner, which acquires facts about
application domains and organizes them into a
hierarchical, context-dependent knowledge base. This
knowledge is used to make intelligent suggestions to a
user about the entities, attributes, and relationships
to include in a database design. A distance function
approach is employed for integrating specific facts,
obtained from individual design sessions, into the
knowledge base (learning) and for applying the
knowledge to subsequent design problems (reasoning).",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Theory",
keywords = "common sense business reasoner; common sense learning;
common sense reasoning; database design; design;
entity-relationship model; theory",
subject = "{\bf D.2.1} Software, SOFTWARE ENGINEERING,
Requirements/Specifications. {\bf H.2.1} Information
Systems, DATABASE MANAGEMENT, Logical Design. {\bf
H.2.8} Information Systems, DATABASE MANAGEMENT,
Database Applications. {\bf I.2.4} Computing
Methodologies, ARTIFICIAL INTELLIGENCE, Knowledge
Representation Formalisms and Methods. {\bf I.2.6}
Computing Methodologies, ARTIFICIAL INTELLIGENCE,
Learning. {\bf I.2.1} Computing Methodologies,
ARTIFICIAL INTELLIGENCE, Applications and Expert
Systems.",
}
@Article{Tari:1997:ONF,
author = "Zahir Tari and John Stokes and Stefano Spaccapietra",
title = "Object normal forms and dependency constraints for
object-oriented schemata",
journal = j-TODS,
volume = "22",
number = "4",
pages = "513--569",
month = dec,
year = "1997",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1997-22-4/p513-tari/p513-tari.pdf;
http://www.acm.org/pubs/citations/journals/tods/1997-22-4/p513-tari/",
abstract = "We address the development of a normalization theory
for object-oriented data models that have common
features to support objects. We first provide an
extension of functional dependencies to cope with the
richer semantics of relationships between objects,
called {\em path dependency}, {\em local dependency},
and {\em global dependency\/} constraints. Using these
dependency constraints, we provide normal forms for
object-oriented data models based on the notions of
{\em user interpretation\/} (user-specified dependency
constraints) and {\em object model}. In contrast to
conventional data models in which a normalized object
has a unique interpretation, in object-oriented data
models, an object may have many multiple
interpretations that form the model for that object. An
object will then be in a normal form if and only if the
user's interpretation is derivable from the model of
the object. Our normalization process is by nature
iterative, in which objects are restructured until
their models reflect the user's interpretation.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Theory",
keywords = "data model; functional and multivalued dependencies;
normal forms; object-oriented paradigm",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Normal forms}; Information
Systems --- Database Management --- Systems (H.2.4)",
}
@Article{Zaharioudakis:1997:AFG,
author = "Markos Zaharioudakis and Michael J. Carey and Michael
J. Franklin",
title = "Adaptive, fine-grained sharing in a client-server
{OODBMS}: a callback-based approach",
journal = j-TODS,
volume = "22",
number = "4",
pages = "570--627",
month = dec,
year = "1997",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1997-22-4/p570-zaharioudakis/p570-zaharioudakis.pdf;
http://www.acm.org/pubs/citations/journals/tods/1997-22-4/p570-zaharioudakis/",
abstract = "For reasons of simplicity and communication
efficiency, a number of existing object-oriented
database management systems are based on page server
architectures; data pages are their minimum unit of
transfer and client caching. Despite their efficiency,
page servers are often criticized as being too
restrictive when it comes to concurrency, as existing
systems use pages as the minimum locking unit as well.
In this paper we show how to support object-level
locking in a page-server context. Several approaches
are described, including an adaptive granularity
approach that uses page-level locking for most pages
but switches to object-level locking when finer-grained
sharing is demanded. Each of the approaches is based on
extending the idea of callback locking. We study the
performance of these approaches, comparing them to both
a pure page server and a pure object server. For the
range of workload that we have examined, our results
indicate that the adaptive page server provides very
good performance, usually outperforming the pure page
server and the other page-server variants as well. In
addition, the adaptive page server is often preferable
to the pure object server; our results provides insight
into when each approach is likely to perform better.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Performance",
keywords = "cache coherency; cache consistency; client-server
database; design; fine-grained sharing; object-oriented
databases; performance; performance analysis",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Concurrency; {\bf H.3.4} Information Systems,
INFORMATION STORAGE AND RETRIEVAL, Systems and
Software, Distributed systems; {\bf H.2.4} Information
Systems, DATABASE MANAGEMENT, Systems, Transaction
processing",
}
@Article{Anonymous:1997:AI,
author = "Anonymous",
title = "1997 Author Index",
journal = j-TODS,
volume = "22",
number = "4",
pages = "628--??",
month = "????",
year = "1997",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Nov 7 10:36:24 MST 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Dyreson:1998:SVT,
author = "Curtis E. Dyreson and Richard T. Snodgrass",
title = "Supporting valid-time indeterminacy",
journal = j-TODS,
volume = "23",
number = "1",
pages = "1--57",
month = mar,
year = "1998",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1998-23-1/p1-dyreson/p1-dyreson.pdf;
http://www.acm.org/pubs/citations/journals/tods/1998-23-1/p1-dyreson/;
http://www.acm.org:80/pubs/citations/journals/tods/1998-23-1/p1-dyreson/",
abstract = "In {\em valid-time indeterminacy\/} it is known that
an event stored in a database did in fact occur, but it
is not known exactly {\em when}. In this paper we
extend the SQL data model and query language to support
valid-time indeterminacy. We represent the occurrence
time of an event with a set of possible instants,
delimiting when the event might have occurred, and a
probability distribution over that set. We also
describe query language constructs to retrieve
information in the presence of indeterminacy. These
constructs enable users to specify their {\em
credibility\/} in the underlying data and their {\em
plausibility\/} in the relationships among that data. A
denotational semantics for SQL's select statement with
optional credibility and plausibility constructs is
given. We show that this semantics is {\em reliable},
in that it never produces incorrect information, is
{\em maximal}, in that if it were extended to be more
informative, the results may not be reliable, and {\em
reduces\/} to the previous semantics when there is no
indeterminacy. Although the extended data model and
query language provide needed modeling capabilities,
these extensions appear initially to carry a
significant execution cost. A contribution of this
paper is to demonstrate that our approach is useful and
practical. An efficient representation of valid-time
indeterminacy and efficient query processing algorithms
are provided. The cost of support for indeterminacy is
empirically measured, and is shown to be modest.
Finally, we show that the approach is general, by
applying it to the temporal query language constructs
being proposed for SQL3.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages",
keywords = "algorithms; incomplete information; indeterminacy;
languages; probabilistic information; SQL; temporal
database; TSQL2; valid-time database",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design, Data models. {\bf H.2.3} Information
Systems, DATABASE MANAGEMENT, Languages, Query
languages. {\bf H.2.4} Information Systems, DATABASE
MANAGEMENT, Systems, Query processing.",
}
@Article{Revesz:1998:SQL,
author = "Peter Z. Revesz",
title = "Safe query languages for constraint databases",
journal = j-TODS,
volume = "23",
number = "1",
pages = "58--99",
month = mar,
year = "1998",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1998-23-1/p58-revesz/p58-revesz.pdf;
http://www.acm.org/pubs/citations/journals/tods/1998-23-1/p58-revesz/;
http://www.acm.org:80/pubs/citations/journals/tods/1998-23-1/p58-revesz/",
abstract = "In the database framework of Kanellakis et al. [1990]
it was argued that constraint query languages should
take constraint databases as input and give other
constraint databases that use the same type of atomic
constraints as output. This closed-form requirement has
been difficult to realize in constraint query languages
that contain the negation symbol. This paper describes
a general approach to restricting constraint query
languages with negation to safe subsets that contain
only programs that are evaluable in closed-form on any
valid constraint database input.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages; Theory; Verification",
keywords = "algorithms; languages; theory; verification",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design. {\bf H.2.3} Information Systems,
DATABASE MANAGEMENT, Languages, Datalog.",
}
@Article{Stolboushkin:1998:SSD,
author = "Alexei P. Stolboushkin and Michael A. Taitslin",
title = "Safe stratified datalog with integer order does not
have syntax",
journal = j-TODS,
volume = "23",
number = "1",
pages = "100--109",
month = mar,
year = "1998",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1998-23-1/p100-stolboushkin/p100-stolboushkin.pdf;
http://www.acm.org/pubs/citations/journals/tods/1998-23-1/p100-stolboushkin/",
abstract = "Stratified Datalog with integer (gap)-order (or {\em
Datalog***\/}) is considered. A {\em
Datalog***\/}-program is said to be safe if its
bottom-up processing terminates on all valid inputs. We
prove that safe {\em Datalog***\/}-programs do not have
effective syntax in the sense that there is no
recursively enumerable set $S$ of safe {\em
Datalog***\/}-programs such that every safe {\em
Datalog***\/}-program is equivalent to a program in
$S$.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages; Theory; Verification",
keywords = "languages; theory; verification",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design; {\bf H.2.3} Information Systems,
DATABASE MANAGEMENT, Languages.",
}
@Article{Anonymous:1998:TR,
author = "Anonymous",
title = "{TODS} Referees",
journal = j-TODS,
volume = "23",
number = "1",
pages = "110--111",
month = mar,
year = "1998",
bibdate = "Mon Jan 18 18:22:17 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Anonymous:1998:C,
author = "Anonymous",
title = "Corrigenda",
journal = j-TODS,
volume = "23",
number = "1",
pages = "112--112",
month = mar,
year = "1998",
bibdate = "Mon Jan 18 18:22:17 1999",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Hellerstein:1998:OTQ,
author = "Joseph M. Hellerstein",
title = "Optimization techniques for queries with expensive
methods",
journal = j-TODS,
volume = "23",
number = "2",
pages = "113--157",
month = jun,
year = "1998",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1998-23-2/p113-hellerstein/p113-hellerstein.pdf;
http://www.acm.org/pubs/citations/journals/tods/1998-23-2/p113-hellerstein/;
http://www.acm.org:80/pubs/citations/journals/tods/1998-23-2/p113-hellerstein/",
abstract = "Object-relational database management systems allow
knowledgeable users to define new data types as well as
new methods (operators) for the types. This flexibility
produces an attendant complexity, which must be handled
in new ways for an object-relational database
management system to be efficient. In this article we
study techniques for optimizing queries that contain
time-consuming methods. The focus of traditional query
optimizers has been on the choice of join methods and
orders; selections have been handled by ``pushdown''
rules. These rules apply selections in an arbitrary
order before as many joins as possible, using th e
assumption that selection takes no time. However, users
of object-relational systems can embed complex methods
in selections. Thus selections may take significant
amounts of time, and the query optimization model must
be enhanced. In this article we carefully define a
query cost framework that incorporates both selectivity
and cost estimates for selections. We develop an
algorithm called Predicate Migration, and prove that it
produces optimal plans for queries with expensive
methods. We then describe our implementation of
Predicate Migration in the commercial object-relational
database management system Illustra, and discuss
practical issues that affect our earlier assumptions.
We compare Predicate Migration to a variety of simpler
optimization techniques, and demonstrate that Predicate
Migration is the best general solution to date. The
alternative techniques we present may be useful for
constrained workloads.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance; Theory",
keywords = "algorithms; expensive methods; extensibility;
object-relational databases; performance; predicate
migration; predicate placement; query optimization;
theory",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Query processing.",
}
@Article{Liu:1998:MAP,
author = "Xiangning Liu and Abdelsalam Helal and Weimin Du",
title = "Multiview access protocols for large-scale
replication",
journal = j-TODS,
volume = "23",
number = "2",
pages = "158--198",
month = jun,
year = "1998",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1998-23-2/p158-liu/p158-liu.pdf;
http://www.acm.org/pubs/citations/journals/tods/1998-23-2/p158-liu/;
http://www.acm.org:80/pubs/citations/journals/tods/1998-23-2/p158-liu/",
abstract = "The article proposes a scalable protocol for
replication management in large-scale replicated
systems. The protocol organizes sites and data replicas
into a tree-structured, hierarchical cluster
architecture. The basic idea of the protocol is to
accomplish the complex task of updating replicated data
with a very large number of replicas by a set of
related but independently committed transactions. Each
transaction is responsible for updating replicas in
exactly one cluster and invoking additional
transactions for member clusters. Primary copies (one
from each cluster) are updated by a cross-cluster
transaction. Then each cluster is independently updated
by a separate transaction. This decoupled update
propagation process results in possible multiple views
of replicated data in a cluster. Compared to other
replicated data management protocols, the proposed
protocol has several unique advantages. First, thanks
to a smaller number of replicas each transaction needs
to atomically update in a cluster, the protocol
significantly reduces the transaction abort rate, which
tends to soar in large transactional systems. Second,
the protocol improves user-level transaction response
time as top-level update transactions are allowed to
commit before all replicas have been updated. Third,
read-only queries have the flexibility to see database
views of different degrees of consistency and data
currency. This ranges from global, most up to date, and
consistent views, to local, consistent, but potentially
old views, to local, nearest to users but potentially
inconsistent views. Fourth, the protocol maintains its
scalability by allowing dynamic system reconfiguration
as it grows by splitting a cluster into two or more
smaller ones. Fifth, autonomy of the clusters is
preserved as no specific protocol is required to update
replicas within the same cluster. Clusters are,
therefore, free to use any valid replication or
concurrency control protocols.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Experimentation; Management;
Measurement; Performance",
keywords = "algorithms; data replication; design; experimentation;
large-scale systems; management; measurement; multiview
access; performance",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Distributed databases. {\bf H.2.4} Information
Systems, DATABASE MANAGEMENT, Systems, Transaction
processing. {\bf C.2.4} Computer Systems Organization,
COMPUTER-COMMUNICATION NETWORKS, Distributed Systems,
Distributed databases.",
}
@Article{Mehrotra:1998:ECM,
author = "Sharad Mehrotra and Rajeev Rastogi and Henry F. Korth
and Abraham Silberschatz",
title = "Ensuring consistency in multidatabases by preserving
two-level serializability",
journal = j-TODS,
volume = "23",
number = "2",
pages = "199--230",
month = jun,
year = "1998",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1998-23-2/p199-mehrotra/p199-mehrotra.pdf;
http://www.acm.org/pubs/citations/journals/tods/1998-23-2/p199-mehrotra/;
http://www.acm.org:80/pubs/citations/journals/tods/1998-23-2/p199-mehrotra/",
abstract = "The concept of serializability has been the
traditionally accepted correctness criterion in
database systems. However in multidatabase systems
(MDBSs), ensuring global serializability is a difficult
task. The difficulty arises due to the {\em
heterogeneity\/} of the concurrency control protocols
used by the participating local database management
systems (DBMSs), and the desire to preserve the {\em
autonomy\/} of the local DBMSs. In general, solutions
to the global serializability problem result in
executions with a low degree of concurrency. The
alternative, relaxed serializability, may result in
data inconsistency.\par
In this article, we introduce a systematic approach to
relaxing the serializability requirement in MDBS
environments. Our approach exploits the structure of
the integrity constraints and the nature of transaction
programs to ensure consistency without requiring
executions to be serializable. We develop a simple yet
powerful classification of MDBSs based on the nature of
integrity constraints and transaction programs. For
each of the identified models we show how consistency
can be preserved by ensuring that executions are {\em
two-level serializable\/} (2LSR). 2LSR is a correctness
criterion for MDBS environments weaker than
serializability. What makes our approach interesting is
that unlike global serializability, ensuring 2LSR in
MDBS environments is relatively simple and protocols to
ensure 2LSR permit a high degree of concurrency.
Furthermore, we believe the range of models we consider
cover many practical MDBS environments to which the
results of this article can be applied to preserve
database consistency.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Management; Theory",
keywords = "beyond serializability; concurrency control; database
consistency; management; multidatabases; theory",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Concurrency. {\bf H.2.4} Information Systems,
DATABASE MANAGEMENT, Systems, Distributed databases.
{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Transaction processing.",
}
@Article{Bertino:1998:ACM,
author = "Elisa Bertino and Claudio Bettini and Elena Ferrari
and Pierangela Samarati",
title = "An access control model supporting periodicity
constraints and temporal reasoning",
journal = j-TODS,
volume = "23",
number = "3",
pages = "231--285",
month = sep,
year = "1998",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1998-23-3/p231-bertino/;
http://www.acm.org:80/pubs/citations/journals/tods/1998-23-3/p231-bertino/",
abstract = "Access control models, such as the ones supported by
commercial DBMSs, are not yet able to fully meet many
application needs. An important requirement derives
from the temporal dimension that permissions have in
many real-world situations. Permissions are often
limited in time or may hold only for specific periods
of time. In this article, we present an access control
model in which periodic temporal intervals are
associated with authorizations. An authorization is
automatically granted in the specified intervals and
revoked when such intervals expire. Deductive temporal
rules with periodicity and order constraints are
provided to derive new authorizations based on the
presence or absence of other authorizations in specific
periods of time. We provide a solution to the problem
of ensuring the uniqueness of the global set of valid
authorizations derivable at each instant, and we
propose an algorithm to compute this set. Moreover, we
address issues related to the efficiency of access
control by adopting a materialization approach. The
resulting model provides a high degree of flexibility
and supports the specification of several protection
requirements that cannot be expressed in traditional
access control models.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Security",
keywords = "access control; periodic authorization; security;
temporal constraints; time management",
subject = "{\bf H.2.7} Information Systems, DATABASE MANAGEMENT,
Database Administration, Security, integrity, and
protection.",
}
@Article{Castano:1998:CSA,
author = "S. Castano and V. {De Antonellis} and M. G. Fugini and
B. Pernici",
title = "Conceptual schema analysis: techniques and
applications",
journal = j-TODS,
volume = "23",
number = "3",
pages = "286--333",
month = sep,
year = "1998",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1998-23-3/p286-castano/p286-castano.pdf;
http://www.acm.org/pubs/citations/journals/tods/1998-23-3/p286-castano/;
http://www.acm.org:80/pubs/citations/journals/tods/1998-23-3/p286-castano/",
abstract = "The problem of analyzing and classifying conceptual
schemas is becoming increasingly important due to the
availability of a large number of schemas related to
existing applications. The purposes of schema analysis
and classification activities can be different: to
extract information on intensional properties of legacy
systems in order to restructure or migrate to new
architectures; to build libraries of reference
conceptual components to be used in building new
applications in a given domain; and to identify
information flows and possible replication of data in
an organization. This article proposes a set of
techniques for schema analysis and classification to be
used separately or in combination. The techniques allow
the analyst to derive significant properties from
schemas, with human intervention limited as far as
possible. In particular, techniques for associating
descriptors with schemas, for abstracting reference
conceptual schemas based on schema clustering, and for
determining schema similarity are presented. A
methodology for systematic schema analysis is
illustrated, with the purpose of identifying and
abstracting into reference components the similar and
potentially reusable parts of a set of schemas.
Experiences deriving from the application of the
proposed techniques and methodology on a large set of
Entity-Relationship conceptual schemas of information
systems in the Italian Public Administration domain are
described",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Documentation; Management",
keywords = "conceptual modeling; design; documentation;
management; reference components; schema
classification; schema similarity",
subject = "{\bf H.2.1} Information Systems, DATABASE MANAGEMENT,
Logical Design. {\bf H.3.1} Information Systems,
INFORMATION STORAGE AND RETRIEVAL, Content Analysis and
Indexing.",
}
@Article{Formica:1998:EMC,
author = "A. Formica and H. D. Groger and M. Missikoff",
title = "An efficient method for checking object-oriented
database schema correctness",
journal = j-TODS,
volume = "23",
number = "3",
pages = "334--369",
month = sep,
year = "1998",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1998-23-3/p334-formica/p334-formica.pdf;
http://www.acm.org/pubs/citations/journals/tods/1998-23-3/p334-formica/;
http://www.acm.org:80/pubs/citations/journals/tods/1998-23-3/p334-formica/",
abstract = "Inheritance is introduced in object-oriented systems
to enhance code reuse and create more compact and
readable software. Powerful object models adopt
multiple inheritance, allowing a type (or class)
definition to inherit from more than one supertype.
Unfortunately, in applying this powerful modeling
mechanism, inheritance conflicts may be generated,
which arise when the same property or operation is
defined in more than one supertype. Inheritance
conflicts identification and resolution is the key
issue of this article. In strongly typed
object-oriented systems the resolution of inheritance
conflicts depends on the compatibility of the types of
the conflicting definitions. In case of incompatible
types, a contradiction arises. This article focuses on
object-oriented databases (ODBs), providing a method
aimed at supporting the designer in the construction of
correct ODB schemas. The first necessary condition for
schema correctness is the absence of contradictions. A
second cause of schema incorrectness is due to the
presence of structurally recursive types that, when
defined within certain hierarchical patterns, cause the
nontermination of the inheritance process. In the
article, after the formal definition of a correct
schema, two graph-theoretic methods aimed at verifying
ODB schema correctness are analyzed. Although the first
method is intuitive but inefficient, the second allows
schema correctness to be checked in polynomial time, in
the size of the schema. The results of this study are
included in the implementation of Mosaico, an
environment for ODB application design.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Theory; Verification",
keywords = "databases; design; graph theory; inheritance
conflicts; inheritance process; languages;
object-oriented database schemas; recursive types;
theory; verification",
subject = "{\bf H.2.4} Information Systems, DATABASE MANAGEMENT,
Systems, Object-oriented databases. {\bf D.3.3}
Software, PROGRAMMING LANGUAGES, Language Constructs
and Features, Data types and structures. {\bf F.3.1}
Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS,
Specifying and Verifying and Reasoning about Programs,
Mechanical verification. {\bf H.2.3} Information
Systems, DATABASE MANAGEMENT, Languages, Data
description languages (DDL). {\bf H.2.1} Information
Systems, DATABASE MANAGEMENT, Logical Design, Data
models. {\bf H.2.1} Information Systems, DATABASE
MANAGEMENT, Logical Design, Schema and subschema.",
}
@Article{Konopnicki:1998:IGW,
author = "David Konopnicki and Oded Shmueli",
title = "Information gathering in the {World-Wide Web}: the
{W3QL} query language and the {W3QS} system",
journal = j-TODS,
volume = "23",
number = "4",
pages = "369--410",
month = dec,
year = "1998",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1998-23-4/p369-konopnicki/p369-konopnicki.pdf;
http://www.acm.org/pubs/citations/journals/tods/1998-23-4/p369-konopnicki/;
http://www.acm.org:80/pubs/citations/journals/tods/1998-23-4/p369-konopnicki/",
abstract = "The World Wide Web (WWW) is a fast growing global
information resource. It contains an enormous amount of
information and provides access to a variety of
services. Since there is no central control and very
few standards of information organization or service
offering, searching for information and services is a
widely recognized problem. To some degree this problem
is solved by ``search services,'' also known as
``indexers,'' such as Lycos, AltaVista, Yahoo, and
others. These sites employ search engines known as
``robots'' or ``knowbots'' that scan the network
periodically and form text-based indices. These
services are limited in certain important aspects.
First, the structural information, namely, the
organization of the document into parts pointing to
each other, is usually lost. Second, one is limited by
the kind of textual analysis provided by the ``search
service.'' Third, search services are incapable of
navigating ``through'' forms. Finally, one cannot
prescribe a complex database-like search. We view the
WWW as a huge database. We have designed a high-level
SQL-like language called W3QL to support effective and
flexible query processing, which addresses the
structure and content of WWW nodes and their varied
sorts of data. We have implemented a system called W3QS
to execute W3QL queries. In W3QS, query results are
declaratively specified and continuously maintained as
views when desired. The current architecture of W3QS
provides a server that enables users to pose queries as
well as integrate their own data analysis tools. The
system and its query language set a framework for the
development of database-like tools over the WWW. A
significant contribution of this article is in
formalizing the WWW and query processing over it.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages",
keywords = "CGI; design; FORMS; HTML; HTTP; languages; PERL; query
language; query system; World-Wide Web",
subject = "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT,
Languages, Query languages. {\bf H.1.0} Information
Systems, MODELS AND PRINCIPLES, General. {\bf H.3.3}
Information Systems, INFORMATION STORAGE AND RETRIEVAL,
Information Search and Retrieval.",
}
@Article{Sistla:1998:TTC,
author = "A. Prasad Sistla and Ouri Wolfson and Yelena Yesha and
Robert Sloan",
title = "Towards a theory of cost management for digital
libraries and electronic commerce",
journal = j-TODS,
volume = "23",
number = "4",
pages = "411--452",
month = dec,
year = "1998",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1998-23-4/p411-sistla/p411-sistla.pdf;
http://www.acm.org/pubs/citations/journals/tods/1998-23-4/p411-sistla/;
http://www.acm.org:80/pubs/citations/journals/tods/1998-23-4/p411-sistla/",
abstract = "One of the features that distinguishes digital
libraries from traditional databases is new cost models
for client access to intellectual property. Clients
will pay for accessing data items in digital libraries,
and we believe that optimizing these costs will be as
important as optimizing performance in traditional
databases. In this article we discuss cost models and
protocols for accessing digital libraries, with the
objective of determining the minimum cost protocol for
each model. We expect that in the future information
appliances will come equipped with a cost optimizer, in
the same way that computers today come with a built-in
operating system. This article makes the initial steps
towards a theory and practice of intellectual property
cost management.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Economics; Performance; Theory",
keywords = "algorithms; average case analysis; caching; cost
models; demand; economics; on-line services;
performance; protocols; subscription; theory; worst
case analysis",
subject = "{\bf H.2.m} Information Systems, DATABASE MANAGEMENT,
Miscellaneous. {\bf H.3.5} Information Systems,
INFORMATION STORAGE AND RETRIEVAL, Online Information
Services, Commercial services. {\bf H.3.5} Information
Systems, INFORMATION STORAGE AND RETRIEVAL, Online
Information Services, Web-based services. {\bf H.3.7}
Information Systems, INFORMATION STORAGE AND RETRIEVAL,
Digital Libraries, Dissemination.",
}
@Article{Zobel:1998:IFV,
author = "Justin Zobel and Alistair Moffat and Kotagiri
Ramamohanarao",
title = "Inverted files versus signature files for text
indexing",
journal = j-TODS,
volume = "23",
number = "4",
pages = "453--490",
month = dec,
year = "1998",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/;
http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1998-23-4/p453-zobel/p453-zobel.pdf;
http://www.acm.org/pubs/citations/journals/tods/1998-23-4/p453-zobel/;
http://www.acm.org:80/pubs/citations/journals/tods/1998-23-4/p453-zobel/",
abstract = "Two well-known indexing methods are inverted files and
signature files. We have undertaken a detailed
comparison of these two approaches in the context of
text indexing, paying particular attention to query
evaluation speed and space requirements. We have
examined their relative performance using both
experimentation and a refined approach to modeling of
signature files, and demonstrate that inverted files
are distinctly superior to signature files. Not only
can inverted files be used to evaluate typical queries
in less time than can signature files, but inverted
files require less space and provide greater
functionality. Our results also show that a synthetic
text database can provide a realistic indication of the
behavior of an actual text database. The tools used to
generate the synthetic database have been made publicly
available",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "algorithms; indexing; inverted files; performance;
signature files; text databases; text indexing",
subject = "{\bf E.5} Data, FILES. {\bf H.2.2} Information
Systems, DATABASE MANAGEMENT, Physical Design. {\bf
H.3.3} Information Systems, INFORMATION STORAGE AND
RETRIEVAL, Information Search and Retrieval. {\bf
I.7.3} Computing Methodologies, DOCUMENT AND TEXT
PROCESSING, Index Generation**.",
}
@Article{Datta:1999:BPS,
author = "Anindya Datta and Debra E. Vandermeer and Aslihan
Celik and Vijay Kumar",
title = "Broadcast protocols to support efficient retrieval
from databases by mobile users",
journal = j-TODS,
volume = "24",
number = "1",
pages = "1--79",
month = mar,
year = "1999",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Sep 26 08:44:02 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1999-24-1/p1-datta/",
abstract = "Mobile computing has the potential for managing
information globally. Data management issues in mobile
computing have received some attention in recent times,
and the design of {\em adaptive broadcast protocols\/}
has been posed as an important problem. Such protocols
are employed by database servers to decide on the
content of broadcasts dynamically, in response to
client mobility and demand patterns. In this paper we
design such protocols and also propose efficient
retrieval strategies that may be employed by clients to
download information from broadcasts. The goal is to
design {\em cooperative\/} strategies between server
and client to provide access to information in such a
way as to minimize energy expenditure by clients. We
evaluate the performance of our protocols both
analytically and through simulation.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "adaptive broadcast protocols; client-server computing;
energy conservation; mobile databases",
subject = "Computer Systems Organization ---
Computer-Communication Networks --- Network
Architecture and Design (C.2.1); Information Systems
--- Database Management (H.2); Computer Systems
Organization --- Computer-Communication Networks ---
Network Protocols (C.2.2); Information Systems ---
Database Management --- Systems (H.2.4); Computer
Systems Organization --- Computer-Communication
Networks --- Network Architecture and Design (C.2.1):
{\bf Wireless communication}; Information Systems ---
Information Systems Applications --- Communications
Applications (H.4.3); Information Systems ---
Information Systems Applications --- Communications
Applications (H.4.3): {\bf Internet}",
}
@Article{Levene:1999:DDI,
author = "Mark Levene and George Loizou",
title = "Database design for incomplete relations",
journal = j-TODS,
volume = "24",
number = "1",
pages = "80--126",
month = mar,
year = "1999",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Sep 26 08:44:02 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1999-24-1/p80-levene/",
abstract = "Although there has been a vast amount of research in
the area of relational database design, to our
knowledge, there has been very little work that
considers whether this theory is still valid when
relations in the database may be incomplete. When
relations are incomplete and thus contain null values
the problem of whether satisfaction is additive arises.
Additivity is the property of the equivalence of the
satisfaction of a set of functional dependencies (FDs)
F with the individual satisfaction of each member of F
in an incomplete relation. It is well known that in
general, satisfaction of FDs is not additive.
Previously we have shown that satisfaction is additive
if and only if the set of FDs is monodependent. We
conclude that monodependence is a fundamental desirable
property of a set of FDs when considering incomplete
information in relational database design. We show
that, when the set of FDs F either satisfies the
intersection property or the split-freeness property,
then the problem of finding an optimum cover of F can
be solved in polynomial time in the size of F; in
general, this problem is known to be NP-complete. We
also show that when F satisfies the split-freeness
property then deciding whether there is a superkey of
cardinality k or less can be solved in polynomial time
in the size of F, since all the keys have the same
cardinality. If F only satisfies the intersection
property then this problem is NP-complete, as in the
general case. Moreover, we show that when F either
satisfies the intersection property or the
split-freeness property then deciding whether an
attribute is prime can be solved in polynomial time in
the size of F; in general, this problem is known to be
NP-complete. Assume that a relation schema R is an
appropriate normal form with respect to a set of FDs F.
We show that when F satisfies the intersection property
then the notions of second normal form and third normal
form are equivalent. We also show that when R is in
Boyce-Codd Normal Form (BCNF), then F is monodependent
if and only if either there is a unique key for R, or
for all keys X for R, the cardinality of X is one less
than the number of attributes associated with R.
Finally, we tackle a long-standing problem in
relational database theory by showing that when a set
of FDs F over R satisfies the intersection property, it
also satisfies the split-freeness property (i.e., is
monodependent), if and only if every lossless join
decomposition of R with respect to F is also dependency
preserving. As a corollary of this result we are able
to show that when F satisfies the intersection
property, it also satisfies the intersection property,
it also satisfies the split-freeness property(i.e., is
monodependent), if and only if every lossless join
decomposition of R, which is in BCNF, is also
dependency preserving. Our final result is that when F
is monodependent, then there exists a unique optimum
lossless join decomposition of R, which is in BCNF, and
is also dependency preserving. Furthermore, this
ultimate decomposition can be attained in polynomial
time in the size of F.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Theory",
keywords = "additivity problem; complexity; dependency preserving
decomposition; incomplete information; intersection
property; lossless join decomposition; monodependence;
normal forms; null functional dependencies; optimum
cover; prime attribute problem; split-freeness
property; superkey of cardinality k problem",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Information
Systems --- Database Management --- Logical Design
(H.2.1): {\bf Normal forms}",
}
@Article{Wijsen:1999:TFC,
author = "Jef Wijsen",
title = "Temporal {FDs} on complex objects",
journal = j-TODS,
volume = "24",
number = "1",
pages = "127--176",
month = mar,
year = "1999",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Sep 26 08:44:02 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1999-24-1/p127-wijsen/",
abstract = "{\em Temporal functional dependencies\/} (TFD) are
defined for temporal databases that include object
identity. It is argued that object identity can
overcome certain semantic difficulties with existing
temporal relational data models. Practical applications
of TFDs in object bases are discussed. Reasoning about
TFDs is at the center of this paper. It turns out that
the distinction between acyclic and cyclic schemas is
significant. For acyclic schemas, a complete
axiomatization for finite implication is given and an
algorithm for deciding finite implication provided. The
same axiomatization is proven complete for unrestricted
implication in unrestricted schemas, which can be
cyclic. An interesting result is that there are cyclic
schemas for which unrestricted and finite implication
do not coincide. TFDs relate and extend some earlier
work on dependency theory in temporal databases.
Throughout this paper, the construct of TFD is compared
with the notion of temporal FD introduced by Wang et
al. (1997). A comparison with other related work is
provided at the end of the article.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Theory",
keywords = "database constraints; functional dependency;
object-identity; temporal databases; time granularity",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1)",
}
@Article{Chaudhuri:1999:OQU,
author = "Surajit Chaudhuri and Kyuseok Shim",
title = "Optimization of queries with user-defined predicates",
journal = j-TODS,
volume = "24",
number = "2",
pages = "177--228",
month = jun,
year = "1999",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Sep 26 08:44:02 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1999-24-2/p177-chaudhuri/",
abstract = "Relational databases provide the ability to store
user-defined functions and predicates which can be
invoked in SQL queries. When evaluation of a
user-defined predicate is relatively expensive, the
traditional method of evaluating predicates as early as
possible is no longer a sound heuristic. There are two
previous approaches for optimizing such queries.
However, neither is able to guarantee the optimal plan
over the desired execution space. We present efficient
techniques that are able to guarantee the choice of an
optimal plan over the desired execution space. The {\em
optimization algorithm with complete rank-ordering\/}
improves upon the naive optimization algorithm by
exploiting the nature of the cost formulas for join
methods and is polynomial in the number of user-defined
predicates (for a given number of relations.) We also
propose {\em pruning rules\/} that significantly reduce
the cost of searching the execution space for both the
naive algorithm as well as for the optimization
algorithm with complete rank-ordering, without
compromising optimality. We also propose a {\em
conservative local heuristic\/} that is simpler and has
low optimization overhead. Although it is not always
guaranteed to find the optimal plans, it produces close
to optimal plans in most cases. We discuss how,
depending on application requirements, to determine the
algorithm of choice. It should be emphasized that our
optimization algorithms handle user-defined selections
as well as user-defined join predicates uniformly. We
present complexity analysis and experimental comparison
of the algorithms.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Management; Performance",
keywords = "dynamic programming; query optimization; user-defined
predicates",
subject = "Information Systems --- Database Management (H.2);
Information Systems --- Database Management --- General
(H.2.0); Information Systems --- Database Management
--- Systems (H.2.4): {\bf Relational databases}",
}
@Article{Gravano:1999:GTS,
author = "Luis Gravano and H{\'e}ctor Garc{\'\i}a-Molina and
Anthony Tomasic",
title = "{GlOSS}: text-source discovery over the {Internet}",
journal = j-TODS,
volume = "24",
number = "2",
pages = "229--264",
month = jun,
year = "1999",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Sep 26 08:44:02 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1999-24-2/p229-gravano/",
abstract = "The dramatic growth of the Internet has created a new
problem for users: location of the relevant sources of
documents. This article presents a framework for (and
experimentally analyzes a solution to) this problem,
which we call the {\em text-source discovery problem}.
Our approach consists of two phases. First, each text
source exports its contents to a centralized service.
Second, users present queries to the service, which
returns an ordered list of promising text sources. This
article describes {\em GlOSS}, Glossary of Servers
Server, with two versions: {\em bGlOSS}, which provides
a Boolean query retrieval model, and {\em vGlOSS},
which provides a vector-space retrieval model. We also
present {\em hGlOSS}, which provides a decentralized
version of the system. We extensively describe the
methodology for measuring the retrieval effectiveness
of these systems and provide experimental evidence,
based on actual data, that all three systems are highly
effective in determining promising text sources for a
given query.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Measurement; Performance",
keywords = "digital libraries; distributed information retrieval;
Internet search and retrieval; text databases",
subject = "Information Systems --- Information Storage and
Retrieval --- General (H.3.0); Information Systems ---
Information Storage and Retrieval --- Information
Search and Retrieval (H.3.3); Information Systems ---
Information Storage and Retrieval --- Digital Libraries
(H.3.7); Information Systems --- Database Management
--- Systems (H.2.4): {\bf Textual databases};
Information Systems --- Information Storage and
Retrieval (H.3)",
}
@Article{Hjaltason:1999:DBS,
author = "G{\'\i}sli R. Hjaltason and Hanan Samet",
title = "Distance browsing in spatial databases",
journal = j-TODS,
volume = "24",
number = "2",
pages = "265--318",
month = jun,
year = "1999",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Oct 21 16:01:19 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1999-24-2/p265-hjaltason/",
abstract = "We compare two different techniques for browsing
through a collection of spatial objects stored in an
R-tree spatial data structure on the basis of their
distances from an arbitrary spatial query object. The
conventional approach is one that makes use of a
$k$-nearest neighbor algorithm where $k$ is known prior
to the invocation of the algorithm. Thus if $mk$
neighbors are needed, the $k$-nearest neighbor
algorithm has to be reinvoked for $m$ neighbors,
thereby possibly performing some redundant
computations. The second approach is incremental in the
sense that having obtained the $k$ nearest neighbors,
the $k + 1{\em st\/}$ neighbor can be obtained without
having to calculate the $k + 1$ nearest neighbors from
scratch. The incremental approach is useful when
processing complex queries where one of the conditions
involves spatial proximity (e.g., the nearest city to
Chicago with population greater than a million), in
which case a query engine can make use of a pipelined
strategy. We present a general incremental nearest
neighbor algorithm that is applicable to a large class
of hierarchical spatial data structures. This algorithm
is adapted to the R-tree and its performance is
compared to an existing $k$-nearest neighbor algorithm
for R-trees [Rousseopoulos et al. 1995]. Experiments
show that the incremental nearest neighbor algorithm
significantly outperforms the $k$-nearest neighbor
algorithm for distance browsing queries in a spatial
database that uses the R-tree as a spatial index.
Moreover, the incremental nearest neighbor algorithm
usually outperforms the $k$-nearest neighbor algorithm
when applied to the $k$-nearest neighbor problem for
the R-tree, although the improvement is not nearly as
large as for distance browsing queries. In fact, we
prove informally that at any step in its execution the
incremental nearest neighbor algorithm is optimal with
respect to the spatial data structure that is employed.
Furthermore, based on some simplifying assumptions, we
prove that in two dimensions the number of distance
computations and leaf nodes accesses made by the
algorithm for finding $k$ neighbors is $O(k + k)$.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "distance browsing; hierarchical spatial data
structures; nearest neighbors; R-trees; ranking",
subject = "Information Systems --- Database Management ---
Database Applications (H.2.8): {\bf Spatial databases
and GIS}; Data --- Data Structures (E.1): {\bf Trees}",
}
@Article{Alagic:1999:TCO,
author = "Suad Alag{\'\i}c",
title = "Type-checking {OQL} queries in the {ODMG} type
systems",
journal = j-TODS,
volume = "24",
number = "3",
pages = "319--360",
month = sep,
year = "1999",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Sep 26 08:44:02 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1999-24-3/p319-alagic/",
abstract = "Several negative results are proved about the ability
to type-check queries in the only existing proposed
standard for object-oriented databases. The first of
these negative results is that it is not possible to
type-check OQL queries in the type system underlying
the ODMG object model and its definition language ODL.
The second negative result is that OQL queries cannot
be type-checked in the type system of the Java binding
of the ODMG standard either. A solution proposed in
this paper is to extend the ODMG object model with
explicit support for parametric polymorphism (universal
type quantification). These results show that Java
cannot be a viable database programming language unless
extended with parametric polymorphism. This is why
type-checking OQL queries presents no problem for the
type system of the C++ binding of the ODMG standard.
However, a type system that is strictly more powerful
than any of the type systems of the ODMG standard is
required in order to properly type ordered collections
and indices. The required form of polymorphism is
bounded type quantification (constrained genericity)
and even F-bounded polymorphism. A further result is
that neither static nor the standard dynamic
object-oriented type-checking is possible for Java OQL,
in spite of the fact that Java OQL combines features of
two strongly and mostly statically-typed languages.
Contrary to one of the promises of object-oriented
database technology, this result shows that the
impedance mismatch does not disappear in the ODMG
standard. A type-safe reflective technique is proposed
for overcoming this mismatch.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages; Standardization; Theory",
keywords = "C++; Java; ODMG standard; OQL; parametric
polymorphism; type systems",
subject = "Information Systems --- Database Management ---
Languages (H.2.3): {\bf Query languages}; Information
Systems --- Database Management --- Languages (H.2.3):
{\bf Data description languages (DDL)}; Information
Systems --- Database Management --- Languages (H.2.3):
{\bf Database (persistent) programming languages};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Object-oriented databases}; Software ---
Programming Languages --- Language Classifications
(D.3.2): {\bf Object-oriented languages}; Software ---
Programming Languages --- Language Constructs and
Features (D.3.3): {\bf Classes and objects}; Software
--- Programming Languages --- Language Constructs and
Features (D.3.3): {\bf Inheritance}; Software ---
Programming Languages --- Language Constructs and
Features (D.3.3): {\bf Polymorphism}",
}
@Article{Bozkaya:1999:ILM,
author = "Tolga Bozkaya and Meral Ozsoyoglu",
title = "Indexing large metric spaces for similarity search
queries",
journal = j-TODS,
volume = "24",
number = "3",
pages = "361--404",
month = sep,
year = "1999",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Sep 26 08:44:02 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1999-24-3/p361-bozkaya/",
abstract = "One of the common queries in many database
applications is finding approximate matches to a given
query item from a collection of data items. For
example, given an image database, one may want to
retrieve all images that are similar to a given query
image. Distance-based index structures are proposed for
applications where the distance computations between
objects of the data domain are expensive (such as
high-dimensional data) and the distance function is
metric. In this paper we consider using distance-based
index structures for similarity queries on large metric
spaces. We elaborate on the approach that uses
reference points (vantage points) to partition the data
space into spherical shell-like regions in a
hierarchical manner. We introduce the multivantage
point tree structure (mvp-tree) that uses more than one
vantage point to partition the space into spherical
cuts at each level. In answering similarity-based
queries, the mvp-tree also utilizes the precomputed (at
construction time) distances between the data points
and the vantage points.\par We summarize the
experiments comparing mvp-trees to vp-trees that have a
similar partitioning strategy, but use only one vantage
point at each level and do not make use of the
precomputed distances. Empirical studies show that the
mvp-tree outperforms the vp-tree by 20\% to 80\% for
varying query ranges and different distance
distributions. Next, we generalize the idea of using
multiple vantage points and discuss the results of
experiments we have made to see how varying the number
of vantage points in a node affects performance and how
much is gained in performance by making use of
precomputed distances. The results show that, after
all, it may be best to use a large number of vantage
points in an internal node in order to end up with a
single directory node and keep as many of the
precomputed distances as possible to provide more
efficient filtering during search operations. Finally,
we provide some experimental results that compare
mvp-trees with M-trees, which is a dynamic
distance-based index structure for metric domains.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Experimentation; Measurement; Performance;
Verification",
subject = "Data --- Data Structures (E.1): {\bf Trees};
Information Systems --- Information Storage and
Retrieval --- Content Analysis and Indexing (H.3.1):
{\bf Indexing methods}; Information Systems ---
Information Storage and Retrieval --- Information
Search and Retrieval (H.3.3): {\bf Search process}",
}
@Article{Casati:1999:SIE,
author = "Fabio Casati and Stefano Ceri and Stefano Paraboschi
and Guiseppe Pozzi",
title = "Specification and implementation of exceptions in
workflow management systems",
journal = j-TODS,
volume = "24",
number = "3",
pages = "405--451",
month = sep,
year = "1999",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Sep 26 08:44:02 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1999-24-3/p405-casati/",
abstract = "Although workflow management systems are most
applicable when an organization follows standard
business processes and routines, any of these processes
faces the need for handling exceptions, i.e.,
asynchronous and anomalous situations that fall outside
the normal control flow.\par
In this paper we concentrate upon anomalous situations
that, although unusual, are part of the semantics of
workflow applications, and should be specified and
monitored coherently; in most real-life applications,
such exceptions affect a significant fraction of
workflow cases. However, very few workflow management
systems are integrated with a highly expressive
language for specifying this kind of exception and with
a system component capable of handling it.\par
We present Chimera-Exc, a language for the
specification of exceptions for workflows based on
detached active rules, and then describe the
architecture of a system, called FAR, that implements
Chimera-Exc and integrates it with a commercial
workflow management system and database server. We
discuss the main issues that were solved by our
implementation, and report on the performance of FAR.
We also discuss design criteria for exceptions in light
of the formal properties of their execution. Finally,
we focus on the portability of FAR on its unbundling to
a generic architecture with detached active rules.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Languages; Management; Performance",
keywords = "active rules; asynchronous events; exceptions;
workflow management systems",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Rule-based databases};
Information Systems --- Information Systems
Applications --- General (H.4.0)",
}
@Article{Dey:1999:IDD,
author = "Debabrata Dey and Veda C. Storey and Terence M.
Barron",
title = "Improving database design through the analysis of
relationships",
journal = j-TODS,
volume = "24",
number = "4",
pages = "453--486",
month = dec,
year = "1999",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Sep 26 08:44:02 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/1999-24-4/p453-dey/p453-dey.pdf;
http://www.acm.org/pubs/citations/journals/tods/1999-24-4/p453-dey/",
abstract = "Much of the work on conceptual modeling involves the
use of an entity-relationship model in which binary
relationships appear as associations between two
entities. Relationships involving more than two
entities are considered rare and, therefore, have not
received adequate attention. This research provides a
general framework for the analysis of relationships in
which binary relationships simply become a special
case. The framework helps a designer to identify
ternary and other higher-degree relationships that are
commonly represented, often inappropriately, as either
entities or binary relationships. Generalized rules are
also provided for representing higher-degree
relationships in the relational model. This uniform
treatment of relationships should significantly ease
the burden on a designer by enabling him or her to
extract more information from a real-world situation
and represent it properly in a conceptual design.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design",
keywords = "conceptual model; ER model; integrity constraint;
min-max cardinality; relationship degree; weak
relationship",
subject = "Information Systems --- Models and Principles ---
General (H.1.0); Information Systems --- Database
Management --- Logical Design (H.2.1): {\bf Data
models}; Information Systems --- Database Management
--- Database Administration (H.2.7): {\bf Security,
integrity, and protection}",
}
@Article{Muralidhar:1999:SRD,
author = "Krishnamurty Muralidhar and Rathindra Sarathy",
title = "Security of random data perturbation methods",
journal = j-TODS,
volume = "24",
number = "4",
pages = "487--493",
month = dec,
year = "1999",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Sep 26 08:44:02 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1999-24-4/p487-muralidhar/",
abstract = "Statistical databases often use random data
perturbation (RDP) methods to protect against
disclosure of confidential numerical attributes. One of
the key requirements of RDP methods is that they
provide the appropriate level of security against
snoopers who attempt to obtain information on
confidential attributes through statistical inference.
In this study, we evaluate the security provided by
three methods of perturbation. The results of this
study allow the database administrator to select the
most effective RDP method that assures adequate
protection against disclosure of confidential
information.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Measurement; Security",
keywords = "bias; covariance; noise addition; random data
perturbation",
subject = "Information Systems --- Database Management ---
Database Administration (H.2.7): {\bf Security,
integrity, and protection}; Information Systems ---
Database Management --- Database Applications (H.2.8):
{\bf Statistical databases}",
}
@Article{Wand:1999:OAR,
author = "Yair Wand and Veda C. Storey and Ron Weber",
title = "An ontological analysis of the relationship construct
in conceptual modeling",
journal = j-TODS,
volume = "24",
number = "4",
pages = "494--528",
month = dec,
year = "1999",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Sep 26 08:44:02 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1999-24-4/p494-wand/",
abstract = "Conceptual models or semantic data models were
developed to capture the meaning of an application
domain as perceived by someone. Moreover, concepts
employed in semantic data models have recently been
adopted in object-oriented approaches to systems
analysis and design. To employ conceptual modeling
constructs effectively, their meanings have to be
defined rigorously. Often, however, rigorous
definitions of these constructs are missing. This
situation occurs especially in the case of the
relationship construct. Empirical evidence shows that
use of relationships is often problematical as a way of
communicating the meaning of an application domain. For
example, users of conceptual modeling methodologies are
frequently confused about whether to show an
association between things via a relationship, an
entity, or an attribute. Because conceptual models are
intended to capture knowledge about a real-world
domain, we take the view that the meaning of modeling
constructs should be sought in models of reality.
Accordingly, we use ontology, which is the branch of
philosophy dealing with models of reality, to analyze
the meaning of common conceptual modeling constructs.
Our analysis provides a precise definition of several
conceptual modeling constructs. Based on our analysis,
we derive rules for the use of relationships in
entity-relationship conceptual modeling. Moreover, we
show how the rules resolve ambiguities that exist in
current practice and how they can enrich the capacity
of an entity-relationship conceptual model to capture
knowledge about an application domain.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "conceptual modeling; database design;
entity-relationship model; object-oriented modeling;
ontology; semantic data modeling",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Computing
Milieux --- Management of Computing and Information
Systems --- Project and People Management (K.6.1): {\bf
Systems analysis and design}",
}
@Article{Yan:1999:SID,
author = "Tak W. Yan and Hector Garcia-Molina",
title = "The {SIFT} information dissemination system",
journal = j-TODS,
volume = "24",
number = "4",
pages = "529--565",
month = dec,
year = "1999",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Sep 26 08:44:02 MDT 2000",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/1999-24-4/p529-yan/",
abstract = "Information dissemination is a powerful mechanism for
finding information in wide-area environments. An
information dissemination server accepts long-term user
queries, collects new documents from information
sources, matches the documents against the queries, and
continuously updates the users with relevant
information. This paper is a retrospective of the
Stanford Information Filtering Service (SIFT), a system
that as of April 1996 was processing over 40,000
worldwide subscriptions and over 80,000 daily
documents. The paper describes some of the indexing
mechanisms that were developed for SIFT, as well as the
evaluations that were conducted to select a scheme to
implement. It also describes the implementation of
SIFT, and experimental results for the actual system.
Finally, it also discusses and experimentally evaluates
techniques for distributing a service such as SIFT for
added performance and availability.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "Boolean queries; dissemination; filtering; indexing;
vector space queries",
subject = "Information Systems --- Database Management ---
Systems (H.2.4); Information Systems --- Information
Storage and Retrieval --- Information Storage (H.3.2);
Information Systems --- Information Storage and
Retrieval --- Information Search and Retrieval (H.3.3);
Information Systems --- Information Storage and
Retrieval --- Systems and Software (H.3.4)",
}
@Article{Morris:19xx:DON,
author = "K. Morris and J. D. Ullman and A. VanGelder",
title = "Design Overview of the {NAIL!} System",
journal = j-TODS,
volume = "??",
number = "??",
pages = "??--??",
month = "????",
year = "19xx",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibsource = "Database/Wiederhold.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Also published in/as: Proc. of International
Conference on Logic Programming, BCS 3, 1986. Also
published in/as: Stanford Un., CSD, TR-CS-86-1108.",
annote = "The {NAIL!} System seems to be a much more powerful
query language than the ones commercially available
today. It adds the power and dexterity of Prolog-like
logic to standard query techniques. The {NAIL!} System
exhibits a tendency to swing the database community
from object-oriented query languages back to
value-oriented query languages. There seemed to be
ambiguity as to how to handle recursive rules. The
paper gave some techniques but didn't prefer one over
the other. Overall, the {NAIL!} System appears to be a
superior attempt at strengthening conventional database
query operations.",
fjournal = "ACM Transactions on Database Systems",
}
@Article{Spiegler:19xx:DRA,
author = "I. Spiegler and Y. Noff",
title = "Dynamic Recovery as an Alternative to Data Base
Restoration",
journal = j-TODS,
volume = "??",
number = "??",
pages = "??--??",
month = "????",
year = "19xx",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibsource = "Database/Wiederhold.bib",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "Submitted, March 1987.",
fjournal = "ACM Transactions on Database Systems",
}
@Article{Guting:2000:FRQ,
author = "Ralf Hartmut G{\"u}ting and Michael H. B{\"o}hlen and
Martin Erwig and Christian S. Jensen and Nikos A.
Lorentzos and Markus Schneider and Michalis
Vazirgiannis",
title = "A foundation for representing and querying moving
objects",
journal = j-TODS,
volume = "25",
number = "1",
pages = "1--42",
month = mar,
year = "2000",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/2000-25-1/p1-guting/p1-guting.pdf;
http://www.acm.org/pubs/citations/journals/tods/2000-25-1/p1-guting/",
abstract = "Spatio-temporal databases deal with geometries
changing over time. The goal of our work is to provide
a DBMS data model and query language capable of
handling such time-dependent geometries, including
those changing continuously that describe {\em moving
objects}. Two fundamental abstractions are {\em moving
point\/} and {\em moving region}, describing objects
for which only the time-dependent position, or position
and extent, respectively, are of interest. We propose
to present such time-dependent geometries as attribute
data types with suitable operations, that is, to
provide an abstract data type extension to a DBMS data
model and query language. This paper presents a design
of such a system of abstract data types. It turns out
that besides the main types of interest, moving point
and moving region, a relatively large number of
auxiliary data types are needed. For example, one needs
a line type to represent the projection of a moving
point into the plane, or a ``moving real'' to represent
the time-dependent distance of two points. It then
becomes crucial to achieve (i) orthogonality in the
design of the system, i.e., type constructors can be
applied uniformly; (ii) genericity and consistency of
operations, i.e., operations range over as many types
as possible and behave consistently; and (iii) closure
and consistency between structure and operations of
nontemporal and related temporal types. Satisfying
these goal leads to a simple and expressive system of
abstract data types that may be integrated into a query
language to yield a powerful language for querying
spatio-temporal data, including moving objects. The
paper formally defines the types and operations, offers
detailed insight into the considerations that went into
the design, and exemplifies the use of the abstract
data types using SQL. The paper offers a precise and
conceptually clean foundation for implementing a
spatio-temporal DBMS extension.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages; Theory",
keywords = "abstract data types; algebra; moving objects; moving
point; moving region; spatio-temporal data types;
spatio-temporal databases",
subject = "Information Systems --- Database Management ---
Languages (H.2.3): {\bf Query languages}; Information
Systems --- Database Management --- Database
Applications (H.2.8): {\bf Spatial databases and GIS}",
}
@Article{Kossmann:2000:IDP,
author = "Donald Kossmann and Konrad Stocker",
title = "Iterative dynamic programming: a new class of query
optimization algorithms",
journal = j-TODS,
volume = "25",
number = "1",
pages = "43--82",
month = mar,
year = "2000",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/2000-25-1/p43-kossmann/p43-kossmann.pdf;
http://www.acm.org/pubs/citations/journals/tods/2000-25-1/p43-kossmann/",
abstract = "The query optimizer is one of the most important
components of a database system. Most commercial query
optimizers today are based on a dynamic-programming
algorithm, as proposed in Selinger et al. [1979]. While
this algorithm produces good optimization results (i.e,
good plans), its high complexity can be prohibitive if
complex queries need to be processed, new query
execution techniques need to be integrated, or in
certain programming environments (e.g., distributed
database systems). In this paper, we present and
thoroughly evaluate a new class of query optimization
algorithms that are based on a principle that we call
{\em iterative dynamic programming}, or IDP for short.
IDP has several important advantages: First,
IDP-algorithms produce the best plans of all known
algorithms in situations in which dynamic programming
is not viable because of its high complexity. Second,
some IDP variants are adaptive and produce as good
plans as dynamic programming if dynamic programming is
viable and as good-as possible plans if dynamic
programming turns out to be not viable. Three, all
IDP-algorithms can very easily be integrated into an
existing optimizer which is based on dynamic
programming.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design; Experimentation; Performance",
keywords = "dynamic programming; greedy algorithm; iterative
dynamic programming; plan evaluation function; query
optimization; query optimiztion; randomized
optimization",
subject = "Theory of Computation --- Analysis of Algorithms and
Problem Complexity --- Nonnumerical Algorithms and
Problems (F.2.2); Information Systems --- Database
Management --- Systems (H.2.4): {\bf Distributed
databases}; Information Systems --- Database Management
--- Systems (H.2.4): {\bf Relational databases}",
}
@Article{Lerner:2000:MCT,
author = "Barbara Staudt Lerner",
title = "A model for compound type changes encountered in
schema evolution",
journal = j-TODS,
volume = "25",
number = "1",
pages = "83--127",
month = mar,
year = "2000",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/2000-25-1/p83-lerner/p83-lerner.pdf;
http://www.acm.org/pubs/citations/journals/tods/2000-25-1/p83-lerner/",
abstract = "Schema evolution is a problem that is faced by
long-lived data. When a schema changes, existing
persistent data can become inaccessible unless the
database system provides mechanisms to access data
created with previous versions of the schema. Most
existing systems that support schema evolution focus on
changes local to individual types within the schema,
thereby limiting the changes that the database
maintainer can perform. We have developed a model of
type changes involving multiple types. The model
describes both type changes and their impact on data by
defining derivation rules to initialize new data based
on the existing data. The derivation rules can describe
local and nonlocal changes to types to capture the
intent of a large class of type change operations. We
have built a system called Tess (Type Evolution
Software System) that uses this model to recognize type
changes by comparing schemas and then produces a
transformer that can update data in a database to
correspond to a newer version of the schema.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Languages",
keywords = "persistent programming languages; schema evolution",
subject = "Information Systems --- Database Management ---
Miscellaneous (H.2.m); Information Systems --- Database
Management --- Languages (H.2.3): {\bf Database
(persistent) programming languages}; Software ---
Software Engineering --- Distribution, Maintenance, and
Enhancement (D.2.7): {\bf Restructuring, reverse
engineering, and reengineering}",
}
@Article{Bohm:2000:CMQ,
author = "Christian B{\"o}hm",
title = "A cost model for query processing in high dimensional
data spaces",
journal = j-TODS,
volume = "25",
number = "2",
pages = "129--178",
month = jun,
year = "2000",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/2000-25-2/p129-bohm/p129-bohm.pdf;
http://www.acm.org/pubs/citations/journals/tods/2000-25-2/p129-bohm/",
abstract = "During the last decade, multimedia databases have
become increasingly important in many application areas
such as medicine, CAD, geography, and molecular
biology. An important research topic in multimedia
databases is similarity search in large data sets. Most
current approaches that address similarity search use
the feature approach, which transforms important
properties of the stored objects into points of a
high-dimensional space (feature vectors). Thus,
similarity search is transformed into a neighborhood
search in feature space. Multidimensional index
structures are usually applied when managing feature
vectors. Query processing can be improved substantially
with optimization techniques such as blocksize
optimization, data space quantization, and dimension
reduction. To determine optimal parameters, an accurate
estimate of index-based query processing performance is
crucial. In this paper we develop a cost model for
index structures for point databases such as the
R*-tree and the X-tree. It provides accurate estimates
of the number of data page accesses for range queries
and nearest-neighbor queries under a Euclidean metric
and a maximum metric and a maximum metric. The problems
specific to high-dimensional data spaces, called
boundary effects, are considered. The concept of the
fractal dimension is used to take the effects of
correlated data into account.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Performance; Theory",
keywords = "cost model; multidimensional index",
subject = "Information Systems --- Database Management ---
Database Applications (H.2.8); Information Systems ---
Information Storage and Retrieval --- Content Analysis
and Indexing (H.3.1)",
}
@Article{Cui:2000:TLV,
author = "Yingwei Cui and Jennifer Widom and Janet L. Wiener",
title = "Tracing the lineage of view data in a warehousing
environment",
journal = j-TODS,
volume = "25",
number = "2",
pages = "179--227",
month = jun,
year = "2000",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/2000-25-2/p179-cui/p179-cui.pdf;
http://www.acm.org/pubs/citations/journals/tods/2000-25-2/p179-cui/",
abstract = "We consider the {\em view data lineage\/} problem in a
warehousing environment: For a given data item in a
materialized warehouse view, we want to identify the
set of source data items that produced the view item.
We formally define the lineage problem, develop lineage
tracing algorithms for relational views with
aggregation, and propose mechanisms for performing
consistent lineage tracing in a multisource data
warehousing environment. Our result can form the basis
of a tool that allows analysts to browse warehouse
data, select view tuples of interest, and then
``drill-through'' to examine the exact source tuples
that produced the view tuples of interest.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Design",
keywords = "data warehouse; derivation; lineage; materialized
views",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Database Manager}",
}
@Article{Parsons:2000:EIT,
author = "Jeffrey Parsons and Yair Wand",
title = "Emancipating instances from the tyranny of classes in
information modeling",
journal = j-TODS,
volume = "25",
number = "2",
pages = "228--268",
month = jun,
year = "2000",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/2000-25-2/p228-parsons/p228-parsons.pdf;
http://www.acm.org/pubs/citations/journals/tods/2000-25-2/p228-parsons/",
abstract = "Database design commonly assumes, explicitly or
implicitly, that instances must belong to classes. This
can be termed the {\em assumption of inherent
classification}. We argue that the extent and
complexity of problems in schema integration, schema
evolution, and interoperability are, to a large degree,
consequences of inherent classification. Furthermore,
we make the case that the assumption of inherent
classification violates philosophical and cognitive
guidelines on classification and is, therefore,
inappropriate in view of the role of data modeling in
representing knowledge about application domains.
\par
As an alternative, we propose a layered approach to
modeling in which information about instances is
separated from any particular classification. Two data
modeling layers are proposed: (1) an {\em instance
model\/} consisting of an instance base (i.e.,
information about instances and properties) and
operations to populate, use, and maintain it; and (2) a
{\em class model\/} consisting of a class base (i.e.,
information about classes defined in terms of
properties) and operations to populate, use, and
maintain it. The two-layered model provides {\em class
independence}. This is analogous to the arguments of
data independence offered by the relational model in
comparison to hierarchical and network models. We show
that a two-layered approach yields several advantages.
In particular, schema integration is shown to be
partially an artifact of inherent classification that
can be greatly simplified in designing a database based
on a layered model; schema evolution is supported
without the complexity of operations currently required
by class-based models; and the difficulties associated
with interoperability among heterogeneous databases are
reduced because there is no need to agree on the
semantics of classes among independent databases. We
conclude by considering the adequacy of a two-layered
approach, outlining possible implementation strategies,
and drawing attention to some practical
considerations.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Management; Theory",
keywords = "classification; conceptual modeling; database design;
interoperability; ontology; schema evolution; schema
integration",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1): {\bf Data models}; Information
Systems --- Database Management --- Logical Design
(H.2.1): {\bf Schema and subschema}; Information
Systems --- Database Management --- Heterogeneous
Databases (H.2.5): {\bf Data translation**};
Information Systems --- Database Management ---
Heterogeneous Databases (H.2.5)",
}
@Article{Baralis:2000:AAS,
author = "Elena Baralis and Jennifer Widom",
title = "An algebraic approach to static analysis of active
database rules",
journal = j-TODS,
volume = "25",
number = "3",
pages = "269--332",
month = sep,
year = "2000",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/2000-25-3/p269-baralis/",
abstract = "Rules in active database systems can be very difficult
to program due to the unstructured and unpredictable
nature of rule processing. We provide static analysis
techniques for predicting whether a given rule set is
guaranteed to terminate and whether rule execution is
confluent (guaranteed to have a unique final state).
Our methods are based on previous techniques for
analyzing rules in active database systems. We improve
considerably on the previous techniques by providing
analysis criteria that are much less conservative: our
methods often determine that a rule set will terminate
or is confluent when previous methods could not make
this determination. Our improved analysis is based on a
``propagation'' algorithm, which uses an extended
relational algebra to accurately determine when the
action of one rule can affect the condition of another,
and determine when rule actions commute. We consider
both condition-action rules and
event-condition-action-rules, making our approach
widely applicable to relational active database rule
languages and to the trigger language in the SQL:1999
standard.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Verification",
keywords = "active database systems; confluence; database rule
processing; database trigger processing; termination",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Rule-based databases};
Information Systems --- Database Management ---
Languages (H.2.3): {\bf SQL}",
}
@Article{Kemme:2000:NAD,
author = "Bettina Kemme and Gustavo Alonso",
title = "A new approach to developing and implementing eager
database replication protocols",
journal = j-TODS,
volume = "25",
number = "3",
pages = "333--379",
month = sep,
year = "2000",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/2000-25-3/p333-kemme/",
abstract = "Database replication is traditionally seen as a way to
increase the availability and performance of
distributed databases. Although a large number of
protocols providing data consistency and
fault-tolerance have been proposed, few of these ideas
have ever been used in commercial products due to their
complexity and performance implications. Instead,
current products allow inconsistencies and often resort
to centralized approaches which eliminates some of the
advantages of replication. As an alternative, we
propose a suite of replication protocols that addresses
the main problems related to database replication. On
the one hand, our protocols maintain data consistency
and the same transactional semantics found in
centralized systems. On the other hand, they provide
flexibility and reasonable performance. To do so, our
protocols take advantage of the rich semantics of group
communication primitives and the relaxed isolation
guarantees provided by most databases. This allows us
to eliminate the possibility of deadlocks, reduce the
message overhead and increase performance. A detailed
simulation study shows the feasibility of the approach
and the flexibility with which different types of
bottlenecks can be circumvented.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Management; Performance; Reliability",
keywords = "database replication; fault-tolerance; group
communication; isolation levels;
one-copy-serializability; replica control; total error
multicast",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Concurrency}; Information Systems
--- Database Management --- Systems (H.2.4): {\bf
Distributed databases}; Information Systems ---
Database Management --- Systems (H.2.4): {\bf
Transaction processing}; Computer Systems Organization
--- Computer-Communication Networks --- Distributed
Systems (C.2.4); Computer Systems Organization ---
Performance of Systems (C.4)",
}
@Article{Meo:2000:TDV,
author = "Rosa Meo",
title = "Theory of dependence values",
journal = j-TODS,
volume = "25",
number = "3",
pages = "380--406",
month = sep,
year = "2000",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Apr 14 10:34:48 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/citations/journals/tods/2000-25-3/p380-meo/",
abstract = "A new model to evaluate dependencies in data mining
problems is presented and discussed. The well-known
concept of the association rule is replaced by the new
definition of dependence value, which is a single real
number uniquely associated with a given itemset.
Knowledge of dependence values is sufficient to
describe all the dependencies characterizing a given
data mining problem. The dependence value of an itemset
is the difference between the occurrence probability of
the itemset and a corresponding ``maximum independence
estimate.'' This can be determined as a function of
joint probabilities of the subsets of the itemset being
considered by maximizing a suitable entropy function.
So it is possible to separate in an itemset of
cardinality $k$ the dependence inherited from its
subsets of cardinality ($k 1$) and the specific
inherent dependence of that itemset. The absolute value
of the difference between the probability p($i$) of the
event $i$ that indicates the presence of the itemset
$\{a,b,\ldots{} \}$ and its maximum independence
estimate is constant for any combination of values of
$Q a,b,\ldots{} Q$. In addition, the Boolean function
specifying the combination of values for which the
dependence is positive is a parity function. So the
determination of such combinations is immediate. The
model appears to be simple and powerful.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Experimentation; Theory",
keywords = "association rules; dependence rules; entropy;
variables independence",
subject = "Information Systems --- Database Management ---
Database Applications (H.2.8): {\bf Data mining};
Information Systems --- Database Management ---
Database Applications (H.2.8): {\bf Statistical
databases}; Information Systems --- Models and
Principles --- Systems and Information Theory (H.1.1):
{\bf Information theory}; Computing Methodologies ---
Artificial Intelligence --- Knowledge Representation
Formalisms and Methods (I.2.4)",
}
@Article{Bohlen:2000:TSM,
author = "Michael H. B{\"o}hlen and Christian S. Jensen and
Richard T. Snodgrass",
title = "Temporal statement modifiers",
journal = j-TODS,
volume = "25",
number = "4",
pages = "407--456",
year = "2000",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jul 26 08:20:52 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/2000-25-4/p407-bohlen/p407-bohlen.pdf;
http://www.acm.org/pubs/citations/journals/tods/2000-25-4/p407-bohlen/",
abstract = "A wide range of database applications manage
time-varying data. Many temporal query languages have
been proposed, each one the result of many carefully
made yet subtly interacting design decisions. In this
article we advocate a different approach to
articulating a set of requirements, or desiderata, that
directly imply the syntactic structure and core
semantics of a temporal extension of an (arbitrary)
nontemporal query language. These desiderata facilitate
transitioning applications from a nontemporal query
language and data model, which has received only scant
attention thus far. \par
The paper then introduces the notion of {\em statement
modifiers\/} that provide a means of systematically
adding temporal support to an existing query language.
Statement modifiers apply to all query language
statements, for example, queries, cursor definitions,
integrity constraints, assertions, views, and data
manipulation statements. We also provide a way to
systematically add temporal support to an existing
implementation. The result is a temporal query language
syntax, semantics, and implementation that derives from
first principles. \par
We exemplify this approach by extending SQL-92 with
statement modifiers. This extended language, termed
ATSQL, is formally defined via a
denotational-semantics-style mapping of temporal
statements to expressions using a combination of
temporal and conventional relational algebraic
operators.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Languages; Theory",
keywords = "ATSQL; statement modifiers; temporal databases",
subject = "Information Systems --- Database Management ---
Languages (H.2.3): {\bf Data manipulation languages
(DML)}; Information Systems --- Database Management ---
Systems (H.2.4): {\bf Query processing}; Information
Systems --- Database Management --- Systems (H.2.4):
{\bf Relational databases}; Information Systems ---
Database Management --- Languages (H.2.3): {\bf Data
description languages (DDL)}",
}
@Article{Fegaras:2000:OOQ,
author = "Leonidas Fegaras and David Maier",
title = "Optimizing object queries using an effective
calculus",
journal = j-TODS,
volume = "25",
number = "4",
pages = "457--516",
year = "2000",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jul 26 08:20:52 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/2000-25-4/p457-fegaras/p457-fegaras.pdf;
http://www.acm.org/pubs/citations/journals/tods/2000-25-4/p457-fegaras/",
abstract = "Object-oriented databases (OODBs) provide powerful
data abstractions and modeling facilities, but they
generally lack a suitable framework for query
processing and optimization. The development of an
effective query optimizer is one of the key factors for
OODB systems to successfully compete with relational
systems, as well as to meet the performance
requirements of many nontraditional applications. We
propose an effective framework with a solid theoretical
basis for optimizing OODB query languages. Our
calculus, called the monoid comprehension calculus,
captures most features of ODMG OQL, and is a good basis
for expressing various optimization algorithms
concisely. This article concentrates on query unnesting
(also known as query decorrelation), an optimization
that, even though it improves performance considerably,
is not treated properly (if at all) by most OODB
systems. Our framework generalizes many unnesting
techniques proposed recently in the literature, and is
capable of removing any form of query nesting using a
very simple and efficient algorithm. The simplicity of
our method is due to the use of the monoid
comprehension calculus as an intermediate form for OODB
queries. The monoid comprehension calculus treats
operations over multiple collection types, aggregates,
and quantifiers in a similar way, resulting in a
uniform method of unnesting queries, regardless of
their type of nesting.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Design; Experimentation; Performance",
keywords = "nested relations; object-oriented databases; query
decorrelation; query optimization",
subject = "Information Systems --- Database Management ---
Logical Design (H.2.1); Information Systems ---
Database Management --- Systems (H.2.4): {\bf
Object-oriented databases}",
}
@Article{Kossmann:2000:CII,
author = "Donald Kossmann and Michael J. Franklin and Gerhard
Drasch and Wig Ag",
title = "Cache investment: integrating query optimization and
distributed data placement",
journal = j-TODS,
volume = "25",
number = "4",
pages = "517--558",
year = "2000",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jul 26 08:20:52 MDT 2001",
bibsource = "http://www.acm.org/pubs/toc/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
URL = "http://www.acm.org/pubs/articles/journals/tods/2000-25-4/p517-kossmann/p517-kossmann.pdf;
http://www.acm.org/pubs/citations/journals/tods/2000-25-4/p517-kossmann/",
abstract = "Emerging distributed query-processing systems support
flexible execution strategies in which each query can
be run using a combination of data shipping and query
shipping. As in any distributed environment, these
systems can obtain tremendous performance and
availability benefits by employing dynamic data
caching. When flexible execution and dynamic caching
are combined, however, a circular dependency arises:
Caching occurs as a by-product of query operator
placement, but query operator placement decisions are
based on (cached) data location. The practical impact
of this dependency is that query optimization decisions
that appear valid on a per-query basis can actually
cause suboptimal performance for all queries in the
long run. \par
To address this problem, we developed {\em Cache
Investment\/} - a novel approach for integrating query
optimization and data placement that looks beyond the
performance of a single query. Cache Investment
sometimes intentionally generates a ``suboptimal'' plan
for a particular query in the interest of effecting a
better data placement for subsequent queries. Cache
Investment can be integrated into a distributed
database system without changing the internals of the
query optimizer. In this paper, we propose Cache
Investment mechanisms and policies and analyze their
performance. The analysis uses results from both an
implementation on the SHORE storage manager and a
detailed simulation model. Our results show that Cache
Investment can significantly improve the overall
performance of a system and demonstrate the trade-offs
among various alternative policies.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
generalterms = "Algorithms; Performance",
keywords = "cache investment; caching; client-server database
systems; data shipping; dynamic data placement; query
optimization; query shipping",
subject = "Information Systems --- Database Management ---
Systems (H.2.4): {\bf Distributed databases};
Information Systems --- Database Management --- Systems
(H.2.4): {\bf Relational databases}",
}
@Article{Andries:2001:AUM,
author = "Marc Andries and Luca Cabibbo and Jan Paredaens and
Jan van den Bussche",
title = "Applying an update method to a set of receivers",
journal = j-TODS,
volume = "26",
number = "1",
pages = "1--40",
month = mar,
year = "2001",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Feb 19 16:14:50 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Dekhtyar:2001:PTD,
author = "Alex Dekhtyar and Robert Ross and V. S. Subrahmanian",
title = "Probabilistic temporal databases, {I}: algebra",
journal = j-TODS,
volume = "26",
number = "1",
pages = "41--95",
month = mar,
year = "2001",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Feb 19 16:14:50 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Hsu:2001:RBP,
author = "Windsor W. Hsu and Alan Jay Smith and Honesty C.
Young",
title = "{I/O} reference behavior of production database
workloads and the {TPC} benchmarks --- an analysis at
the logical level",
journal = j-TODS,
volume = "26",
number = "1",
pages = "96--143",
month = mar,
year = "2001",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Feb 19 16:14:50 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Chomicki:2001:QAD,
author = "Jan Chomicki and David Toman and Michael H.
B{\"o}hlen",
title = "Querying {ATSQL} databases with temporal logic",
journal = j-TODS,
volume = "26",
number = "2",
pages = "145--178",
month = jun,
year = "2001",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Feb 19 16:12:15 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Fukuda:2001:DMO,
author = "Takeshi Fukuda and Yasuhiko Morimoto and Shimichi
Morishita and Takeshi Tokuyama",
title = "Data mining with optimized two-dimensional association
rules",
journal = j-TODS,
volume = "26",
number = "2",
pages = "179--213",
month = jun,
year = "2001",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Feb 19 16:12:15 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Jajodia:2001:FSM,
author = "Sushil Jajodia and Pierangela Samarati and Maria Luisa
Sapino and V. S. Subrahmanian",
title = "Flexible support for multiple access control
policies",
journal = j-TODS,
volume = "26",
number = "2",
pages = "214--260",
month = jun,
year = "2001",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Feb 19 16:12:15 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Eiter:2001:POB,
author = "Thomas Eiter and James J. Lu and Thomas Lukasiewicz
and V. S. Subrahmanian",
title = "Probabilistic object bases",
journal = j-TODS,
volume = "26",
number = "3",
pages = "264--312",
month = sep,
year = "2001",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Feb 19 16:12:15 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Li:2001:AQU,
author = "Chen Li and Edward Chang",
title = "Answering queries with useful bindings",
journal = j-TODS,
volume = "26",
number = "3",
pages = "313--343",
month = sep,
year = "2001",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Feb 19 16:12:15 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Ng:2001:ERD,
author = "Wilfred Ng",
title = "An extension of the relational data model to
incorporate ordered domains",
journal = j-TODS,
volume = "26",
number = "3",
pages = "344--383",
month = sep,
year = "2001",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Feb 19 16:12:15 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Kotidis:2001:CDV,
author = "Yannis Kotidis and Nick Roussopoulos",
title = "A case for dynamic view management",
journal = j-TODS,
volume = "26",
number = "4",
pages = "388--423",
month = dec,
year = "2001",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Feb 19 16:12:16 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Mamoulis:2001:MSJ,
author = "Nikos Mamoulis and Dimitris Papadias",
title = "Multiway spatial joins",
journal = j-TODS,
volume = "26",
number = "4",
pages = "424--475",
month = dec,
year = "2001",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Feb 19 16:12:16 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Lakshmanan:2001:SES,
author = "Laks V. S. Lakshmanan and Fereidoon Sadri and Subbu N.
Subramanian",
title = "{SchemaSQL}: {An} extension to {SQL} for multidatabase
interoperability",
journal = j-TODS,
volume = "26",
number = "4",
pages = "476--519",
month = dec,
year = "2001",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Feb 19 16:12:16 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Suciu:2002:DQE,
author = "Dan Suciu",
title = "Distributed query evaluation on semistructured data",
journal = j-TODS,
volume = "27",
number = "1",
pages = "1--62",
month = mar,
year = "2002",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Nov 5 11:23:13 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Schuldt:2002:AIT,
author = "Heiko Schuldt and Gustavo Alonso and Catriel Beeri and
Hans-J{\"o}rg Schek",
title = "Atomicity and isolation for transactional processes",
journal = j-TODS,
volume = "27",
number = "1",
pages = "63--116",
month = mar,
year = "2002",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Nov 5 11:23:13 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Liu:2002:LFD,
author = "Mengchi Liu and Gillian Dobbie and Tok Wang Ling",
title = "A logical foundation for deductive object-oriented
databases",
journal = j-TODS,
volume = "27",
number = "1",
pages = "117--151",
month = mar,
year = "2002",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Nov 5 11:23:13 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Bruno:2002:TSQ,
author = "Nicolas Bruno and Surajit Chaudhuri and Luis Gravano",
title = "Top-$k$ selection queries over relational databases:
{Mapping} strategies and performance evaluation",
journal = j-TODS,
volume = "27",
number = "2",
pages = "153--187",
month = jun,
year = "2002",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Nov 5 11:23:13 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Chakrabarti:2002:LAD,
author = "Kaushik Chakrabarti and Eamonn Keogh and Sharad
Mehrotra and Michael Pazzani",
title = "Locally adaptive dimensionality reduction for indexing
large time series databases",
journal = j-TODS,
volume = "27",
number = "2",
pages = "188--228",
month = jun,
year = "2002",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Nov 5 11:23:13 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Calders:2002:SDM,
author = "Toon Calders and Raymond T. Ng and Jef Wijsen",
title = "Searching for dependencies at multiple abstraction
levels",
journal = j-TODS,
volume = "27",
number = "3",
pages = "229--260",
month = sep,
year = "2002",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Nov 5 11:23:13 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Gibbons:2002:FIM,
author = "Phillip B. Gibbons and Yossi Matias and Viswanath
Poosala",
title = "Fast incremental maintenance of approximate
histograms",
journal = j-TODS,
volume = "27",
number = "3",
pages = "261--298",
month = sep,
year = "2002",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Nov 5 11:23:13 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Tao:2002:CMO,
author = "Yufei Tao and Dimitris Papadias and Jun Zhang",
title = "Cost models for overlapping and multiversion
structures",
journal = j-TODS,
volume = "27",
number = "3",
pages = "299--342",
month = sep,
year = "2002",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Nov 5 11:23:13 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{May:2002:UGS,
author = "Wolfgang May and Bertram Lud{\"a}scher",
title = "Understanding the global semantics of referential
actions using logic rules",
journal = j-TODS,
volume = "27",
number = "4",
pages = "343--397",
month = dec,
year = "2002",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Nov 5 11:23:14 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Ciaccia:2002:SMS,
author = "Paolo Ciaccia and Marco Patella",
title = "Searching in metric spaces with user-defined and
approximate distances",
journal = j-TODS,
volume = "27",
number = "4",
pages = "398--437",
month = dec,
year = "2002",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Nov 5 11:23:14 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Fernandez:2002:SFP,
author = "Mary Fern{\'a}ndez and Yana Kadiyska and Dan Suciu and
Atsuyuki Morishima and Wang-Chiew Tan",
title = "{SilkRoute}: {A} framework for publishing relational
data in {XML}",
journal = j-TODS,
volume = "27",
number = "4",
pages = "438--493",
month = dec,
year = "2002",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Nov 5 11:23:14 MST 2002",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Beneventano:2003:DLS,
author = "Domenico Beneventano and Sonia Bergamaschi and Claudio
Sartori",
title = "Description logics for semantic query optimization in
object-oriented database systems",
journal = j-TODS,
volume = "28",
number = "1",
pages = "1--50",
month = mar,
year = "2003",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Aug 7 13:51:37 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Karp:2003:SAF,
author = "Richard M. Karp and Scott Shenker and Christos H.
Papadimitriou",
title = "A simple algorithm for finding frequent elements in
streams and bags",
journal = j-TODS,
volume = "28",
number = "1",
pages = "51--55",
month = mar,
year = "2003",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Aug 7 13:51:37 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Melnik:2003:AAS,
author = "Sergey Melnik and Hector Garcia-Molina",
title = "Adaptive algorithms for set containment joins",
journal = j-TODS,
volume = "28",
number = "1",
pages = "56--99",
month = mar,
year = "2003",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Aug 7 13:51:37 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Tao:2003:SQD,
author = "Yufei Tao and Dimitris Papadias",
title = "Spatial queries in dynamic environments",
journal = j-TODS,
volume = "28",
number = "2",
pages = "101--139",
month = jun,
year = "2003",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Aug 7 13:51:37 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Gunopulos:2003:DAM,
author = "Dimitrios Gunopulos and Roni Khardon and Heikki
Mannila and Sanjeev Saluja and Hannu Toivonen and Ram
Sewak Sharma",
title = "Discovering all most specific sentences",
journal = j-TODS,
volume = "28",
number = "2",
pages = "140--174",
month = jun,
year = "2003",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Aug 7 13:51:37 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Lechtenborger:2003:CRV,
author = "Jens Lechtenb{\"o}rger and Gottfried Vossen",
title = "On the computation of relational view complements",
journal = j-TODS,
volume = "28",
number = "2",
pages = "175--208",
month = jun,
year = "2003",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Aug 7 13:51:37 MDT 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Wijesekera:2003:RPF,
author = "Duminda Wijesekera and Sushil Jajodia and Francesco
Parisi-Presicce and {\AA}sa Hagstr{\"o}m",
title = "Removing permissions in the flexible authorization
framework",
journal = j-TODS,
volume = "28",
number = "3",
pages = "209--229",
month = sep,
year = "2003",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri Oct 31 05:55:40 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Jacox:2003:ISJ,
author = "Edwin H. Jacox and Hanan Samet",
title = "Iterative spatial join",
journal = j-TODS,
volume = "28",
number = "3",
pages = "230--256",
month = sep,
year = "2003",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri Oct 31 05:55:40 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Jimenez-Peris:2003:QAD,
author = "Ricardo Jim{\'e}nez-Peris and M.
Pati{\~n}o-Mart{\'\i}nez and Gustavo Alonso and Bettina
Kemme",
title = "Are quorums an alternative for data replication?",
journal = j-TODS,
volume = "28",
number = "3",
pages = "257--294",
month = sep,
year = "2003",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri Oct 31 05:55:40 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Tao:2003:APS,
author = "Yufei Tao and Jimeng Sun and Dimitris Papadias",
title = "Analysis of predictive spatio-temporal queries",
journal = j-TODS,
volume = "28",
number = "4",
pages = "295--336",
month = dec,
year = "2003",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Dec 13 18:01:35 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Lakshmanan:2003:EDM,
author = "Laks V. S. Lakshmanan and Carson Kai-Sang Leung and
Raymond T. Ng",
title = "Efficient dynamic mining of constrained frequent
sets",
journal = j-TODS,
volume = "28",
number = "4",
pages = "337--389",
month = dec,
year = "2003",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Dec 13 18:01:35 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Cho:2003:EPR,
author = "Junghoo Cho and Hector Garcia-Molina",
title = "Effective page refresh policies for {Web} crawlers",
journal = j-TODS,
volume = "28",
number = "4",
pages = "390--426",
month = dec,
year = "2003",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Dec 13 18:01:35 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Chomicki:2003:PFR,
author = "Jan Chomicki",
title = "Preference formulas in relational queries",
journal = j-TODS,
volume = "28",
number = "4",
pages = "427--466",
month = dec,
year = "2003",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Dec 13 18:01:35 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Diao:2003:PSP,
author = "Yanlei Diao and Mehmet Altinel and Michael J. Franklin
and Hao Zhang and Peter Fischer",
title = "Path sharing and predicate evaluation for
high-performance {XML} filtering",
journal = j-TODS,
volume = "28",
number = "4",
pages = "467--516",
month = dec,
year = "2003",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Dec 13 18:01:35 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Hjaltason:2003:IDS,
author = "Gisli R. Hjaltason and Hanan Samet",
title = "Index-driven similarity search in metric spaces",
journal = j-TODS,
volume = "28",
number = "4",
pages = "517--580",
month = dec,
year = "2003",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Dec 13 18:01:35 MST 2003",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Kolaitis:2004:F,
author = "Phokion Kolaitis and Michael J. Franklin",
title = "Foreword",
journal = j-TODS,
volume = "29",
number = "1",
pages = "1--1",
month = mar,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Jul 10 10:03:25 MDT 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Buneman:2004:ASD,
author = "Peter Buneman and Sanjeev Khanna and Keishi Tajima and
Wang-Chiew Tan",
title = "Archiving scientific data",
journal = j-TODS,
volume = "29",
number = "1",
pages = "2--42",
month = mar,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Jul 10 10:03:25 MDT 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Garofalakis:2004:PWS,
author = "Minos Garofalakis and Phillip B. Gibbons",
title = "Probabilistic wavelet synopses",
journal = j-TODS,
volume = "29",
number = "1",
pages = "43--90",
month = mar,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Jul 10 10:03:25 MDT 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Grust:2004:AXE,
author = "Torsten Grust and Maurice {Van Keulen} and Jens
Teubner",
title = "Accelerating {XPath} evaluation in any {RDBMS}",
journal = j-TODS,
volume = "29",
number = "1",
pages = "91--131",
month = mar,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Jul 10 10:03:25 MDT 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Ross:2004:SCM,
author = "Kenneth A. Ross",
title = "Selection conditions in main memory",
journal = j-TODS,
volume = "29",
number = "1",
pages = "132--161",
month = mar,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Jul 10 10:03:25 MDT 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Arasu:2004:CMR,
author = "Arvind Arasu and Brian Babcock and Shivnath Babu and
Jon McAlister and Jennifer Widom",
title = "Characterizing memory requirements for queries over
continuous data streams",
journal = j-TODS,
volume = "29",
number = "1",
pages = "162--194",
month = mar,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Jul 10 10:03:25 MDT 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Arenas:2004:NFX,
author = "Marcelo Arenas and Leonid Libkin",
title = "A normal form for {XML} documents",
journal = j-TODS,
volume = "29",
number = "1",
pages = "195--232",
month = mar,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Jul 10 10:03:25 MDT 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Amer-Yahia:2004:DAO,
author = "Sihem Amer-Yahia and Sophie Cluet",
title = "A declarative approach to optimize bulk loading into
databases",
journal = j-TODS,
volume = "29",
number = "2",
pages = "233--281",
month = jun,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Jul 10 10:03:25 MDT 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Sadri:2004:EOS,
author = "Reza Sadri and Carlo Zaniolo and Amir Zarkesh and
Jafar Adibi",
title = "Expressing and optimizing sequence queries in database
systems",
journal = j-TODS,
volume = "29",
number = "2",
pages = "282--318",
month = jun,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Jul 10 10:03:25 MDT 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Marian:2004:ETQ,
author = "Am{\'e}lie Marian and Nicolas Bruno and Luis Gravano",
title = "Evaluating top-$k$ queries over {Web}-accessible
databases",
journal = j-TODS,
volume = "29",
number = "2",
pages = "319--362",
month = jun,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Jul 10 10:03:25 MDT 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Yu:2004:CAM,
author = "Ting Yu and Divesh Srivastava and Laks V. S.
Lakshmanan and H. V. Jagadish",
title = "A compressed accessibility map for {XML}",
journal = j-TODS,
volume = "29",
number = "2",
pages = "363--402",
month = jun,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Jul 10 10:03:25 MDT 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Datta:2004:PBA,
author = "Anindya Datta and Kaushik Dutta and Helen Thomas and
Debra Vandermeer and Krithi Ramamritham",
title = "Proxy-based acceleration of dynamically generated
content on the {World Wide Web}: {An} approach and
implementation",
journal = j-TODS,
volume = "29",
number = "2",
pages = "403--443",
month = jun,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat Jul 10 10:03:25 MDT 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Vincent:2004:SFD,
author = "Millist W. Vincent and Jixue Liu and Chengfei Liu",
title = "Strong functional dependencies and their application
to normal forms in {XML}",
journal = j-TODS,
volume = "29",
number = "3",
pages = "445--462",
month = sep,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Nov 4 08:30:22 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Trajcevski:2004:MUM,
author = "Goce Trajcevski and Ouri Wolfson and Klaus Hinrichs
and Sam Chamberlain",
title = "Managing uncertainty in moving objects databases",
journal = j-TODS,
volume = "29",
number = "3",
pages = "463--507",
month = sep,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Nov 4 08:30:22 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Chaudhuri:2004:EPM,
author = "Surajit Chaudhuri and Vivek Narasayya and Sunita
Sarawagi",
title = "Extracting predicates from mining models for efficient
query evaluation",
journal = j-TODS,
volume = "29",
number = "3",
pages = "508--544",
month = sep,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Nov 4 08:30:22 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Babu:2004:ECR,
author = "Shivnath Babu and Utkarsh Srivastava and Jennifer
Widom",
title = "Exploiting $k$-constraints to reduce memory overhead
in continuous queries over data streams",
journal = j-TODS,
volume = "29",
number = "3",
pages = "545--580",
month = sep,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Nov 4 08:30:22 MST 2004",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Ozsoyoglu:2004:QWM,
author = "G{\"u}ltekin {\"O}zsoyo{\u{g}}lu and Ismail Seng{\"o}r
Alting{\"o}vde and Abdullah Al-Hamdani and Selma
Ay{\c{s}}e {\"O}zel and {\"O}zg{\"u}r Ulusoy and Zehra
Meral {\"o}zsoyo{\u{g}}lu",
title = "Querying {Web} metadata: {Native} score management and
text support in databases",
journal = j-TODS,
volume = "29",
number = "4",
pages = "581--634",
month = dec,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Apr 14 10:39:39 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Baralis:2004:ECR,
author = "Elena Baralis and Silvia Chiusano",
title = "Essential classification rule sets",
journal = j-TODS,
volume = "29",
number = "4",
pages = "635--674",
month = dec,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Apr 14 10:39:39 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Chen:2004:MBV,
author = "Songting Chen and Bin Liu and Elke A. Rundensteiner",
title = "Multiversion-based view maintenance over distributed
data sources",
journal = j-TODS,
volume = "29",
number = "4",
pages = "675--709",
month = dec,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Apr 14 10:39:39 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Balmin:2004:IVX,
author = "Andrey Balmin and Yannis Papakonstantinou and Victor
Vianu",
title = "Incremental validation of {XML} documents",
journal = j-TODS,
volume = "29",
number = "4",
pages = "710--751",
month = dec,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Apr 14 10:39:39 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Green:2004:PXS,
author = "Todd J. Green and Ashish Gupta and Gerome Miklau and
Makoto Onizuka and Dan Suciu",
title = "Processing {XML} streams with deterministic automata
and stream indexes",
journal = j-TODS,
volume = "29",
number = "4",
pages = "752--788",
month = dec,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Apr 14 10:39:39 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Samet:2004:DPG,
author = "Hanan Samet",
title = "Decoupling partitioning and grouping: {Overcoming}
shortcomings of spatial indexing with bucketing",
journal = j-TODS,
volume = "29",
number = "4",
pages = "789--830",
month = dec,
year = "2004",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Apr 14 10:39:39 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Milo:2005:EIX,
author = "Tova Milo and Serge Abiteboul and Bernd Amann and Omar
Benjelloun and Fred Dang Ngoc",
title = "Exchanging intensional {XML} data",
journal = j-TODS,
volume = "30",
number = "1",
pages = "1--40",
month = mar,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat May 7 08:01:30 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Papadias:2005:PSC,
author = "Dimitris Papadias and Yufei Tao and Greg Fu and
Bernhard Seeger",
title = "Progressive skyline computation in database systems",
journal = j-TODS,
volume = "30",
number = "1",
pages = "41--82",
month = mar,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat May 7 08:01:30 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Witkowski:2005:ASM,
author = "Andrew Witkowski and Srikanth Bellamkonda and Tolga
Bozkaya and Nathan Folkert and Abhinav Gupta and John
Haydu and Lei Sheng and Sankar Subramanian",
title = "Advanced {SQL} modeling in {RDBMS}",
journal = j-TODS,
volume = "30",
number = "1",
pages = "83--121",
month = mar,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat May 7 08:01:30 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Madden:2005:TAQ,
author = "Samuel R. Madden and Michael J. Franklin and Joseph M.
Hellerstein and Wei Hong",
title = "{TinyDB}: an acquisitional query processing system for
sensor networks",
journal = j-TODS,
volume = "30",
number = "1",
pages = "122--173",
month = mar,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat May 7 08:01:30 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Fagin:2005:DEG,
author = "Ronald Fagin and Phokion G. Kolaitis and Lucian Popa",
title = "Data exchange: getting to the core",
journal = j-TODS,
volume = "30",
number = "1",
pages = "174--210",
month = mar,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat May 7 08:01:30 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Pu:2005:CDS,
author = "Ken Q. Pu and Alberto O. Mendelzon",
title = "Concise descriptions of subsets of structured sets",
journal = j-TODS,
volume = "30",
number = "1",
pages = "211--248",
month = mar,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat May 7 08:01:30 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Cormode:2005:WHW,
author = "Graham Cormode and S. Muthukrishnan",
title = "What's hot and what's not: tracking most frequent
items dynamically",
journal = j-TODS,
volume = "30",
number = "1",
pages = "249--278",
month = mar,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat May 7 08:01:30 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Garofalakis:2005:XSP,
author = "Minos Garofalakis and Amit Kumar",
title = "{XML} stream processing using tree-edit distance
embeddings",
journal = j-TODS,
volume = "30",
number = "1",
pages = "279--332",
month = mar,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Sat May 7 08:01:30 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Geerts:2005:TUB,
author = "Floris Geerts and Bart Goethals and Jan {Van Den
Bussche}",
title = "Tight upper bounds on the number of candidate
patterns",
journal = j-TODS,
volume = "30",
number = "2",
pages = "333--363",
month = jun,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jul 7 14:14:12 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Jagadish:2005:IAB,
author = "H. V. Jagadish and Beng Chin Ooi and Kian-Lee Tan and
Cui Yu and Rui Zhang",
title = "{iDistance}: {An} adaptive {B$^+$}-tree based indexing
method for nearest neighbor search",
journal = j-TODS,
volume = "30",
number = "2",
pages = "364--397",
month = jun,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jul 7 14:14:12 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Braga:2005:XXU,
author = "Daniele Braga and Alessandro Campi and Stefano Ceri",
title = "{{\em XQBE} ({\em XQ\/}uery {\em B\/}y {\em
E\/}xample)}: {A} visual interface to the standard
{XML} query language",
journal = j-TODS,
volume = "30",
number = "2",
pages = "398--443",
month = jun,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jul 7 14:14:12 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Gottlob:2005:EAP,
author = "Georg Gottlob and Christoph Koch and Reinhard
Pichler",
title = "Efficient algorithms for processing {XPath} queries",
journal = j-TODS,
volume = "30",
number = "2",
pages = "444--491",
month = jun,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jul 7 14:14:12 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Fekete:2005:MSI,
author = "Alan Fekete and Dimitrios Liarokapis and Elizabeth
O'Neil and Patrick O'Neil and Dennis Shasha",
title = "Making snapshot isolation serializable",
journal = j-TODS,
volume = "30",
number = "2",
pages = "492--528",
month = jun,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jul 7 14:14:12 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Papadias:2005:ANN,
author = "Dimitris Papadias and Yufei Tao and Kyriakos
Mouratidis and Chun Kit Hui",
title = "Aggregate nearest neighbor queries in spatial
databases",
journal = j-TODS,
volume = "30",
number = "2",
pages = "529--576",
month = jun,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jul 7 14:14:12 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Peng:2005:XSX,
author = "Feng Peng and Sudarshan S. Chawathe",
title = "{XSQ}: {A} streaming {XPath} engine",
journal = j-TODS,
volume = "30",
number = "2",
pages = "577--623",
month = jun,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jul 7 14:14:12 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Wyss:2005:RLM,
author = "Catharine M. Wyss and Edward L. Robertson",
title = "Relational languages for metadata integration",
journal = j-TODS,
volume = "30",
number = "2",
pages = "624--660",
month = jun,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jul 7 14:14:12 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Zhang:2005:GMD,
author = "Rui Zhang and Panos Kalnis and Beng Chin Ooi and
Kian-Lee Tan",
title = "Generalized multidimensional data mapping and query
processing",
journal = j-TODS,
volume = "30",
number = "3",
pages = "661--697",
month = sep,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Oct 12 07:55:28 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Pang:2005:IMS,
author = "Chaoyi Pang and Guozhu Dong and Kotagiri
Ramamohanarao",
title = "Incremental maintenance of shortest distance and
transitive closure in first-order logic and {SQL}",
journal = j-TODS,
volume = "30",
number = "3",
pages = "698--721",
month = sep,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Oct 12 07:55:28 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Wijsen:2005:DRU,
author = "Jef Wijsen",
title = "Database repairing using updates",
journal = j-TODS,
volume = "30",
number = "3",
pages = "722--768",
month = sep,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Oct 12 07:55:28 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Litwin:2005:LHA,
author = "Witold Litwin and Rim Moussa and Thomas Schwarz",
title = "{LH*RS}---a highly-available scalable distributed data
structure",
journal = j-TODS,
volume = "30",
number = "3",
pages = "769--811",
month = sep,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Oct 12 07:55:28 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{He:2005:STC,
author = "Zhen He and Byung Suk Lee and Robert Snapp",
title = "Self-tuning cost modeling of user-defined functions in
an object-relational {DBMS}",
journal = j-TODS,
volume = "30",
number = "3",
pages = "812--853",
month = sep,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Oct 12 07:55:28 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Hurtado:2005:CSI,
author = "Carlos A. Hurtado and Claudio Gutierrez and Alberto O.
Mendelzon",
title = "Capturing summarizability with integrity constraints
in {OLAP}",
journal = j-TODS,
volume = "30",
number = "3",
pages = "854--886",
month = sep,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Oct 12 07:55:28 MDT 2005",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Suciu:2005:F,
author = "Dan Suciu and Gerhard Weikum",
title = "Foreword",
journal = j-TODS,
volume = "30",
number = "4",
pages = "887--887",
month = dec,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Feb 16 11:31:47 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Garofalakis:2005:WSG,
author = "Minos Garofalakis and Amit Kumar",
title = "Wavelet synopses for general error metrics",
journal = j-TODS,
volume = "30",
number = "4",
pages = "888--928",
month = dec,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Feb 16 11:31:47 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Marx:2005:CX,
author = "Maarten Marx",
title = "Conditional {XPath}",
journal = j-TODS,
volume = "30",
number = "4",
pages = "929--959",
month = dec,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Feb 16 11:31:47 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Yan:2005:GIB,
author = "Xifeng Yan and Philip S. Yu and Jiawei Han",
title = "Graph indexing based on discriminative frequent
structure analysis",
journal = j-TODS,
volume = "30",
number = "4",
pages = "960--993",
month = dec,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Feb 16 11:31:47 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Fagin:2005:CSM,
author = "Ronald Fagin and Phokion G. Kolaitis and Lucian Popa
and Wang-Chiew Tan",
title = "Composing schema mappings: {Second-order} dependencies
to the rescue",
journal = j-TODS,
volume = "30",
number = "4",
pages = "994--1055",
month = dec,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Feb 16 11:31:47 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Bowman:2005:OQS,
author = "Ivan T. Bowman and Kenneth Salem",
title = "Optimization of query streams using semantic
prefetching",
journal = j-TODS,
volume = "30",
number = "4",
pages = "1056--1101",
month = dec,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Feb 16 11:31:47 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Kaushik:2005:SQO,
author = "Raghav Kaushik and Jeffrey F. Naughton and Raghu
Ramakrishnan and Venkatesan T. Chakravarthy",
title = "Synopses for query optimization: {A} space-complexity
perspective",
journal = j-TODS,
volume = "30",
number = "4",
pages = "1102--1127",
month = dec,
year = "2005",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Feb 16 11:31:47 MST 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Wu:2006:OBI,
author = "Kesheng Wu and Ekow J. Otoo and Arie Shoshani",
title = "Optimizing bitmap indices with efficient compression",
journal = j-TODS,
volume = "31",
number = "1",
pages = "1--38",
month = mar,
year = "2006",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri May 26 08:20:49 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Schneider:2006:TRB,
author = "Markus Schneider and Thomas Behr",
title = "Topological relationships between complex spatial
objects",
journal = j-TODS,
volume = "31",
number = "1",
pages = "39--81",
month = mar,
year = "2006",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri May 26 08:20:49 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Jaluta:2006:BTC,
author = "Ibrahim Jaluta and Seppo Sippu and Eljas
Soisalon-Soininen",
title = "{B}-tree concurrency control and recovery in
page-server database systems",
journal = j-TODS,
volume = "31",
number = "1",
pages = "82--132",
month = mar,
year = "2006",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri May 26 08:20:49 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Gray:2006:CTC,
author = "Jim Gray and Leslie Lamport",
title = "Consensus on transaction commit",
journal = j-TODS,
volume = "31",
number = "1",
pages = "133--160",
month = mar,
year = "2006",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri May 26 08:20:49 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Guha:2006:IXD,
author = "Sudipto Guha and H. V. Jagadish and Nick Koudas and
Divesh Srivastava and Ting Yu",
title = "Integrating {XML} data sources using approximate
joins",
journal = j-TODS,
volume = "31",
number = "1",
pages = "161--207",
month = mar,
year = "2006",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri May 26 08:20:49 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Abiteboul:2006:RQX,
author = "Serge Abiteboul and Luc Segoufin and Victor Vianu",
title = "Representing and querying {XML} with incomplete
information",
journal = j-TODS,
volume = "31",
number = "1",
pages = "208--254",
month = mar,
year = "2006",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri May 26 08:20:49 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Pelanis:2006:IPP,
author = "Mindaugas Pelanis and Simonas {\v{S}}altenis and
Christian S. Jensen",
title = "Indexing the past, present, and anticipated future
positions of moving objects",
journal = j-TODS,
volume = "31",
number = "1",
pages = "255--298",
month = mar,
year = "2006",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri May 26 08:20:49 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Rao:2006:SXD,
author = "Praveen Rao and Bongki Moon",
title = "Sequencing {XML} data and query twigs for fast pattern
matching",
journal = j-TODS,
volume = "31",
number = "1",
pages = "299--345",
month = mar,
year = "2006",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri May 26 08:20:49 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{He:2006:ACS,
author = "Bin He and Kevin Chen-Chuan Chang",
title = "Automatic complex schema matching across {Web} query
interfaces: {A} correlation mining approach",
journal = j-TODS,
volume = "31",
number = "1",
pages = "346--395",
month = mar,
year = "2006",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri May 26 08:20:49 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Guha:2006:ASA,
author = "Sudipto Guha and Nick Koudas and Kyuseok Shim",
title = "Approximation and streaming algorithms for histogram
construction problems",
journal = j-TODS,
volume = "31",
number = "1",
pages = "396--438",
month = mar,
year = "2006",
CODEN = "ATDSD3",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Fri May 26 08:20:49 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Qian:2006:DIM,
author = "Gang Qian and Qiang Zhu and Qiang Xue and Sakti
Pramanik",
title = "Dynamic indexing for multidimensional non-ordered
discrete data spaces using a data-partitioning
approach",
journal = j-TODS,
volume = "31",
number = "2",
pages = "439--484",
month = jun,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1138394.1138395",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Jun 14 10:11:33 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Iwerks:2006:MNS,
author = "Glenn S. Iwerks and Hanan Samet and Kenneth P. Smith",
title = "Maintenance of {$K$}-nn and spatial join queries on
continuously moving points",
journal = j-TODS,
volume = "31",
number = "2",
pages = "485--536",
month = jun,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1138394.1138396",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Jun 14 10:11:33 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Pentaris:2006:QOD,
author = "Fragkiskos Pentaris and Yannis Ioannidis",
title = "Query optimization in distributed networks of
autonomous database systems",
journal = j-TODS,
volume = "31",
number = "2",
pages = "537--583",
month = jun,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1138394.1138397",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Jun 14 10:11:33 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Lin:2006:SLT,
author = "Xuemin Lin and Qing Liu and Yidong Yuan and Xiaofang
Zhou and Hongjun Lu",
title = "Summarizing level-two topological relations in large
spatial datasets",
journal = j-TODS,
volume = "31",
number = "2",
pages = "584--630",
month = jun,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1138394.1138398",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Jun 14 10:11:33 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Bright:2006:APB,
author = "Laura Bright and Avigdor Gal and Louiqa Raschid",
title = "Adaptive pull-based policies for wide area data
delivery",
journal = j-TODS,
volume = "31",
number = "2",
pages = "631--671",
month = jun,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1138394.1138399",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Jun 14 10:11:33 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Cohen:2006:RQA,
author = "Sara Cohen and Werner Nutt and Yehoshua Sagiv",
title = "Rewriting queries with arbitrary aggregation functions
using views",
journal = j-TODS,
volume = "31",
number = "2",
pages = "672--715",
month = jun,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1138394.1138400",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Jun 14 10:11:33 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Kalashnikov:2006:DID,
author = "Dmitri V. Kalashnikov and Sharad Mehrotra",
title = "Domain-independent data cleaning via analysis of
entity-relationship graph",
journal = j-TODS,
volume = "31",
number = "2",
pages = "716--767",
month = jun,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1138394.1138401",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Wed Jun 14 10:11:33 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Eiter:2006:ISI,
author = "Thomas Eiter and Leonid Libkin",
title = "Introduction to special {ICDT} section",
journal = j-TODS,
volume = "31",
number = "3",
pages = "769--769",
month = sep,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1166074.1166075",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Oct 17 05:41:01 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Martens:2006:ECX,
author = "Wim Martens and Frank Neven and Thomas Schwentick and
Geert Jan Bex",
title = "Expressiveness and complexity of {XML Schema}",
journal = j-TODS,
volume = "31",
number = "3",
pages = "770--813",
month = sep,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1166074.1166076",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Oct 17 05:41:01 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Shaft:2006:TNN,
author = "Uri Shaft and Raghu Ramakrishnan",
title = "Theory of nearest neighbors indexability",
journal = j-TODS,
volume = "31",
number = "3",
pages = "814--838",
month = sep,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1166074.1166077",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Oct 17 05:41:01 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Braganholo:2006:PFA,
author = "Vanessa P. Braganholo and Susan B. Davidson and Carlos
A. Heuser",
title = "{PATAX{\'O}}: {A} framework to allow updates through
{XML} views",
journal = j-TODS,
volume = "31",
number = "3",
pages = "839--886",
month = sep,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1166074.1166078",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Oct 17 05:41:01 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Harizopoulos:2006:IIC,
author = "Stavros Harizopoulos and Anastassia Ailamaki",
title = "Improving instruction cache performance in {OLTP}",
journal = j-TODS,
volume = "31",
number = "3",
pages = "887--920",
month = sep,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1166074.1166079",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Oct 17 05:41:01 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Shao:2006:TNV,
author = "Feng Shao and Antal Novak and Jayavel
Shanmugasundaram",
title = "Triggers over nested views of relational data",
journal = j-TODS,
volume = "31",
number = "3",
pages = "921--967",
month = sep,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1166074.1166080",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Oct 17 05:41:01 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{May:2006:SQU,
author = "Norman May and Sven Helmer and Guido Moerkotte",
title = "Strategies for query unnesting in {XML} databases",
journal = j-TODS,
volume = "31",
number = "3",
pages = "968--1013",
month = sep,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1166074.1166081",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Oct 17 05:41:01 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Polyzotis:2006:XSX,
author = "Neoklis Polyzotis and Minos Garofalakis",
title = "{XSKETCH} synopses for {XML} data graphs",
journal = j-TODS,
volume = "31",
number = "3",
pages = "1014--1063",
month = sep,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1166074.1166082",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Oct 17 05:41:01 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Sugumaran:2006:RDO,
author = "Vijayan Sugumaran and Veda C. Storey",
title = "The role of domain ontologies in database design: {An}
ontology management and conceptual modeling
environment",
journal = j-TODS,
volume = "31",
number = "3",
pages = "1064--1094",
month = sep,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1166074.1166083",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Oct 17 05:41:01 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Metwally:2006:IES,
author = "Ahmed Metwally and Divyakant Agrawal and Amr {El
Abbadi}",
title = "An integrated efficient solution for computing
frequent and top-$k$ elements in data streams",
journal = j-TODS,
volume = "31",
number = "3",
pages = "1095--1133",
month = sep,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1166074.1166084",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Oct 17 05:41:01 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
note = "See comments in \cite{Liu:2010:CIE}.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Chaudhuri:2006:PIR,
author = "Surajit Chaudhuri and Gautam Das and Vagelis Hristidis
and Gerhard Weikum",
title = "Probabilistic information retrieval approach for
ranking of database query results",
journal = j-TODS,
volume = "31",
number = "3",
pages = "1134--1168",
month = sep,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1166074.1166085",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Tue Oct 17 05:41:01 MDT 2006",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Calders:2006:EPA,
author = "Toon Calders and Laks V. S. Lakshmanan and Raymond T.
Ng and Jan Paredaens",
title = "Expressive power of an algebra for data mining",
journal = j-TODS,
volume = "31",
number = "4",
pages = "1169--1214",
month = dec,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1189769.1189770",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:31 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "The relational data model has simple and clear
foundations on which significant theoretical and
systems research has flourished. By contrast, most
research on data mining has focused on algorithmic
issues. A major open question is: what's an appropriate
foundation for data mining, which can accommodate
disparate mining tasks? We address this problem by
presenting a database model and an algebra for data
mining. The database model is based on the 3W-model
introduced by Johnson et al. [2000]. This model relied
on black box mining operators. A main contribution of
this article is to open up these black boxes, by using
generic operators in a data mining algebra. Two key
operators in this algebra are regionize, which creates
regions (or models) from data tuples, and a restricted
form of looping called mining loop. Then the resulting
data mining algebra MA is studied and properties
concerning expressive power and complexity are
established. We present results in three directions:
(1) expressiveness of the mining algebra; (2) relations
with alternative frameworks, and (3) interactions
between regionize and mining loop.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "Algebra; data mining; expressive power",
}
@Article{Koch:2006:CNX,
author = "Christoph Koch",
title = "On the complexity of nonrecursive {XQuery} and
functional query languages on complex values",
journal = j-TODS,
volume = "31",
number = "4",
pages = "1215--1256",
month = dec,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1189769.1189771",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:31 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "This article studies the complexity of evaluating
functional query languages for complex values such as
monad algebra and the recursion-free fragment of
XQuery. We show that monad algebra, with equality
restricted to atomic values, is complete for the class
TA[2 O ( n ), O ( n )] of problems solvable in linear
exponential time with a linear number of alternations
if the query is assumed to be part of the input. The
monotone fragment of monad algebra with atomic value
equality but without negation is NEXPTIME-complete. For
monad algebra with deep value equality, that is,
equality of complex values, we establish TA[2 O ( n ),
O ( n )] lower and exponential-space upper bounds. We
also study a fragment of XQuery, Core XQuery, that
seems to incorporate all the features of a query
language on complex values that are traditionally
deemed essential. A close connection between monad
algebra on lists and Core XQuery (with ``child'' as the
only axis) is exhibited. The two languages are shown
expressively equivalent up to representation issues. We
show that Core XQuery is just as hard as monad algebra
with respect to query and combined complexity. As Core
XQuery is NEXPTIME-hard, the best-known techniques for
processing such problems require exponential amounts of
working memory and doubly exponential time in the worst
case. We present a property of queries---the lack of a
certain form of composition---that virtually all
real-world XQueries have and that allows for query
evaluation in PSPACE and thus singly exponential time.
Still, we are able to show for an important special
case---Core XQuery with equality testing restricted to
atomic values---that the composition-free language is
just as expressive as the language with composition.
Thus, under widely-held complexity-theoretic
assumptions, the language with composition is an
exponentially more succinct version of the
composition-free language.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "Complex values; complexity; conservativity;
expressiveness; monad algebra; nested-relational
algebra; XML; XQuery",
}
@Article{Ilyas:2006:ARA,
author = "Ihab F. Ilyas and Walid G. Aref and Ahmed K.
Elmagarmid and Hicham G. Elmongui and Rahul Shah and
Jeffrey Scott Vitter",
title = "Adaptive rank-aware query optimization in relational
databases",
journal = j-TODS,
volume = "31",
number = "4",
pages = "1257--1304",
month = dec,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1189769.1189772",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:31 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "Rank-aware query processing has emerged as a key
requirement in modern applications. In these
applications, efficient and adaptive evaluation of top-
k queries is an integral part of the application
semantics. In this article, we introduce a rank-aware
query optimization framework that fully integrates
rank-join operators into relational query engines. The
framework is based on extending the System R dynamic
programming algorithm in both enumeration and pruning.
We define ranking as an interesting physical property
that triggers the generation of rank-aware query plans.
Unlike traditional join operators, optimizing for
rank-join operators depends on estimating the input
cardinality of these operators. We introduce a
probabilistic model for estimating the input
cardinality, and hence the cost of a rank-join
operator. To our knowledge, this is the first effort in
estimating the needed input size for optimal rank
aggregation algorithms. Costing ranking plans is key to
the full integration of rank-join operators in
real-world query processing engines. Since optimal
execution strategies picked by static query optimizers
lose their optimality due to estimation errors and
unexpected changes in the computing environment, we
introduce several adaptive execution strategies for
top- k queries that respond to these unexpected changes
and costing errors. Our reactive reoptimization
techniques change the execution plan at runtime to
significantly enhance the performance of running
queries. Since top- k query plans are usually pipelined
and maintain a complex ranking state, altering the
execution strategy of a running ranking query is an
important and challenging task. We conduct an extensive
experimental study to evaluate the performance of the
proposed framework. The experimental results are
twofold: (1) we show the effectiveness of our
cost-based approach of integrating ranking plans in
dynamic programming cost-based optimizers; and (2) we
show a significant speedup (up to 300\%) when using our
adaptive execution of ranking plans over the
state-of-the-art mid-query reoptimization strategies.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "adaptive processing; Advanced query processing;
rank-aware optimization; ranking; top-k",
}
@Article{Jiao:2006:MSS,
author = "Yishan Jiao",
title = "Maintaining stream statistics over multiscale sliding
windows",
journal = j-TODS,
volume = "31",
number = "4",
pages = "1305--1334",
month = dec,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1189769.1189773",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:31 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "In this article, we propose a new multiscale sliding
window model which differentiates data items in
different time periods of the data stream, based on a
reasonable monotonicity of resolution assumption. Our
model, as a well-motivated extension of the sliding
window model, stands halfway between the traditional
all-history and time-decaying models. We also present
algorithms for estimating two significant data stream
statistics--- $F_0$ and Jacard's similarity
coefficient---with reasonable accuracies under the new
model. Our algorithms use space logarithmic in the data
stream size and linear in the number of windows; they
support update time logarithmic in the number of
windows and independent of the accuracy required. Our
algorithms are easy to implement. Experimental results
demonstrate the efficiencies of our algorithms. Our
techniques apply to scenarios in which universe
sampling is used.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "Data stream; F 0; Jacard's similarity coefficient;
multiscale sliding window model",
}
@Article{Pei:2006:TMS,
author = "Jian Pei and Yidong Yuan and Xuemin Lin and Wen Jin
and Martin Ester and Qing Liu and Wei Wang and Yufei
Tao and Jeffrey Xu Yu and Qing Zhang",
title = "Towards multidimensional subspace skyline analysis",
journal = j-TODS,
volume = "31",
number = "4",
pages = "1335--1381",
month = dec,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1189769.1189774",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:31 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "The skyline operator is important for multicriteria
decision-making applications. Although many recent
studies developed efficient methods to compute skyline
objects in a given space, none of them considers
skylines in multiple subspaces simultaneously. More
importantly, the fundamental problem on the semantics
of skylines remains open: Why and in which subspaces is
(or is not) an object in the skyline? Practically,
users may also be interested in the skylines in any
subspaces. Then, what is the relationship between the
skylines in the subspaces and those in the
super-spaces? How can we effectively analyze the
subspace skylines? Can we efficiently compute skylines
in various subspaces and answer various analytical
queries?In this article, we tackle the problem of
multidimensional subspace skyline computation and
analysis. We explore skylines in subspaces. First, we
propose the concept of Skycube, which consists of
skylines of all possible nonempty subspaces of a given
full space. Once a Skycube is materialized, any
subspace skyline queries can be answered online.
However, Skycube cannot fully address the semantic
concerns and may contain redundant information. To
tackle the problem, we introduce a novel notion of
skyline group which essentially is a group of objects
that coincide in the skylines of some subspaces. We
identify the decisive subspaces that qualify skyline
groups in the subspace skylines. The new notions
concisely capture the semantics and the structures of
skylines in various subspaces. Multidimensional roll-up
and drill-down analysis is introduced. We also develop
efficient algorithms to compute Skycube, skyline groups
and their decisive subspaces. A systematic performance
study using both real data sets and synthetic data sets
is reported to evaluate our approach.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "data cubing; multidimensional data analysis; Skyline
query",
}
@Article{Jermaine:2006:SMS,
author = "Christopher Jermaine and Alin Dobra and Subramanian
Arumugam and Shantanu Joshi and Abhijit Pol",
title = "The {Sort-Merge-Shrink} join",
journal = j-TODS,
volume = "31",
number = "4",
pages = "1382--1416",
month = dec,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1189769.1189775",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:31 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "One of the most common operations in analytic query
processing is the application of an aggregate function
to the result of a relational join. We describe an
algorithm called the Sort-Merge-Shrink (SMS) Join for
computing the answer to such a query over large,
disk-based input tables. The key innovation of the SMS
join is that if the input data are clustered in a
statistically random fashion on disk, then at all
times, the join provides an online, statistical
estimator for the eventual answer to the query as well
as probabilistic confidence bounds. Thus, a user can
monitor the progress of the join throughout its
execution and stop the join when satisfied with the
estimate's accuracy or run the algorithm to completion
with a total time requirement that is not much longer
than that of other common join algorithms. This
contrasts with other online join algorithms, which
either do not offer such statistical guarantees or can
only offer guarantees so long as the input data can fit
into main memory.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "nonparametric statistics; OLAP; Online algorithms",
}
@Article{Afrati:2006:FSS,
author = "Foto Afrati and Jennifer Widom",
title = "Foreword to special section on {SIGMOD\slash PODS}
2005",
journal = j-TODS,
volume = "31",
number = "4",
pages = "1417--1417",
month = dec,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1189769.1189776",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:31 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
}
@Article{Yan:2006:FBS,
author = "Xifeng Yan and Feida Zhu and Philip S. Yu and Jiawei
Han",
title = "Feature-based similarity search in graph structures",
journal = j-TODS,
volume = "31",
number = "4",
pages = "1418--1453",
month = dec,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1189769.1189777",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:31 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "Similarity search of complex structures is an
important operation in graph-related applications since
exact matching is often too restrictive. In this
article, we investigate the issues of substructure
similarity search using indexed features in graph
databases. By transforming the edge relaxation ratio of
a query graph into the maximum allowed feature misses,
our structural filtering algorithm can filter graphs
without performing pairwise similarity computation. It
is further shown that using either too few or too many
features can result in poor filtering performance. Thus
the challenge is to design an effective feature set
selection strategy that could maximize the filtering
capability. We prove that the complexity of optimal
feature set selection is $\Omega(2^m)$ in the worst
case, where $m$ is the number of features for
selection. In practice, we identify several criteria to
build effective feature sets for filtering, and
demonstrate that combining features with similar size
and selectivity can improve the filtering and search
performance significantly within a multifilter
composition framework. The proposed feature-based
filtering concept can be generalized and applied to
searching approximate nonconsecutive sequences, trees,
and other structured data as well.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "complexity; Graph database; index; similarity search",
}
@Article{Fuxman:2006:PDE,
author = "Ariel Fuxman and Phokion G. Kolaitis and Ren{\'e}e J.
Miller and Wang-Chiew Tan",
title = "Peer data exchange",
journal = j-TODS,
volume = "31",
number = "4",
pages = "1454--1498",
month = dec,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1189769.1189778",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:31 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "In this article, we introduce and study a framework,
called peer data exchange, for sharing and exchanging
data between peers. This framework is a special case of
a full-fledged peer data management system and a
generalization of data exchange between a source schema
and a target schema. The motivation behind peer data
exchange is to model authority relationships between
peers, where a source peer may contribute data to a
target peer, specified using source-to-target
constraints, and a target peer may use target-to-source
constraints to restrict the data it is willing to
receive, but cannot modify the data of the source
peer.A fundamental algorithmic problem in this
framework is that of deciding the existence of a
solution: given a source instance and a target instance
for a fixed peer data exchange setting, can the target
instance be augmented in such a way that the source
instance and the augmented target instance satisfy all
constraints of the setting? We investigate the
computational complexity of the problem for peer data
exchange settings in which the constraints are given by
tuple generating dependencies. We show that this
problem is always in NP, and that it can be NP-complete
even for ``acyclic'' peer data exchange settings. We
also show that the data complexity of the certain
answers of target conjunctive queries is in coNP, and
that it can be coNP-complete even for ``acyclic'' peer
data exchange settings. After this, we explore the
boundary between tractability and intractability for
deciding the existence of a solution and for computing
the certain answers of target conjunctive queries. To
this effect, we identify broad syntactic conditions on
the constraints between the peers under which the
existence-of-solutions problem is solvable in
polynomial time. We also identify syntactic conditions
between peer data exchange settings and target
conjunctive queries that yield polynomial-time
algorithms for computing the certain answers. For both
problems, these syntactic conditions turn out to be
tight, in the sense that minimal relaxations of them
lead to intractability. Finally, we introduce the
concept of a universal basis of solutions in peer data
exchange and explore its properties.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "certain answers; conjunctive queries; Data exchange;
data integration; metadata model management; schema
mapping",
}
@Article{Cheng:2006:DMM,
author = "David Cheng and Ravi Kannan and Santosh Vempala and
Grant Wang",
title = "A divide-and-merge methodology for clustering",
journal = j-TODS,
volume = "31",
number = "4",
pages = "1499--1525",
month = dec,
year = "2006",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1189769.1189779",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:31 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "We present a divide-and-merge methodology for
clustering a set of objects that combines a top-down
``divide'' phase with a bottom-up ``merge'' phase. In
contrast, previous algorithms use either top-down or
bottom-up methods to construct a hierarchical
clustering or produce a flat clustering using local
search (e.g., k -means). For the divide phase, which
produces a tree whose leaves are the elements of the
set, we suggest an efficient spectral algorithm. When
the data is in the form of a sparse document-term
matrix, we show how to modify the algorithm so that it
maintains sparsity and runs in linear space. The merge
phase quickly finds the optimal partition that respects
the tree for many natural objective functions, for
example, k -means, min-diameter, min-sum, correlation
clustering, etc. We present a thorough experimental
evaluation of the methodology. We describe the
implementation of a meta-search engine that uses this
methodology to cluster results from web searches. We
also give comparative empirical results on several real
datasets.",
acknowledgement = ack-nhfb,
fjournal = "ACM Transactions on Database Systems",
keywords = "Clustering; data mining; information retrieval",
}
@Article{Snodgrass:2007:ESV,
author = "Richard T. Snodgrass",
title = "Editorial: {Single}- versus double-blind reviewing",
journal = j-TODS,
volume = "32",
number = "1",
pages = "1:1--1:??",
month = mar,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1206049.1206050",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:55 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "This editorial analyzes from a variety of perspectives
the controversial issue of single-blind versus
double-blind reviewing. In single-blind reviewing, the
reviewer is unknown to the author, but the identity of
the author is known to the reviewer. Double-blind
reviewing is more symmetric: The identity of the author
and the reviewer are not revealed to each other. We
first examine the significant scholarly literature
regarding blind reviewing. We then list six benefits
claimed for double-blind reviewing and 21 possible
costs. To compare these benefits and costs, we propose
a double-blind policy for TODS that attempts to
minimize the costs while retaining the core benefit of
fairness that double-blind reviewing provides, and
evaluate that policy against each of the listed
benefits and costs. Following that is a general
discussion considering several questions: What does
this have to do with TODS, does bias exist in computer
science, and what is the appropriate decision
procedure? We explore the ``knobs'' a policy design can
manipulate to fine-tune a double-blind review policy.
This editorial ends with a specific decision.",
acknowledgement = ack-nhfb,
articleno = "1",
fjournal = "ACM Transactions on Database Systems",
keywords = "Anonymous citation; blinding efficacy; double-blind
review; gender bias; single-blind review; status bias",
}
@Article{Pourabbas:2007:EEJ,
author = "Elaheh Pourabbas and Arie Shoshani",
title = "Efficient estimation of joint queries from multiple
{OLAP} databases",
journal = j-TODS,
volume = "32",
number = "1",
pages = "2:1--2:??",
month = mar,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1206049.1206051",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:55 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "Given an OLAP query expressed over multiple source
OLAP databases, we study the problem of estimating the
resulting OLAP target database. The problem arises when
it is not possible to derive the result from a single
database. The method we use is linear indirect
estimation, commonly used for statistical estimation.
We examine two obvious computational methods for
computing such a target database, called the full
cross-product (F) and preaggregation (P) methods. We
study the accuracy and computational cost of these
methods. While the F method provides a more accurate
estimate, it is more expensive computationally than P.
Our contribution is in proposing a third, new method,
called the partial preaggregation method (PP), which is
significantly less expensive than F, but just as
accurate. We prove formally that the PP method yields
the same results as the F method, and provide
analytical and experimental results on the accuracy and
computational benefits of the PP method.",
acknowledgement = ack-nhfb,
articleno = "2",
fjournal = "ACM Transactions on Database Systems",
keywords = "multiple summary databases; OLAP; query estimation",
}
@Article{Olteanu:2007:FNS,
author = "Dan Olteanu",
title = "Forward node-selecting queries over trees",
journal = j-TODS,
volume = "32",
number = "1",
pages = "3:1--3:??",
month = mar,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1206049.1206052",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:55 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "Node-selecting queries over trees lie at the core of
several important XML languages for the web, such as
the node-selection language XPath, the query language
XQuery, and the transformation language XSLT. The main
syntactic constructs of such queries are the backward
predicates, for example, ancestor and preceding, and
the forward predicates, for example, descendant and
following. Forward predicates are included in the
depth-first, left-to-right preorder relation associated
with the input tree, whereas backward predicates are
included in the inverse of this preorder
relation.\par
This work is devoted to an expressiveness study of
node-selecting queries with proven theoretical and
practical applicability, especially in the field of
query evaluation against XML streams. The main question
it answers positively is whether, for each input query
with forward and backward predicates, there exists an
equivalent forward-only output query. This question is
then positively answered for input and output queries
of varying structural complexity, using LOGLIN and
PSPACE reductions.\par
Various existing applications based on the results of
this work are reported, including query optimization
and streamed evaluation.",
acknowledgement = ack-nhfb,
articleno = "3",
fjournal = "ACM Transactions on Database Systems",
keywords = "Expressiveness; rewriting; streams; XML; XPath",
}
@Article{Nash:2007:CMG,
author = "Alan Nash and Philip A. Bernstein and Sergey Melnik",
title = "Composition of mappings given by embedded
dependencies",
journal = j-TODS,
volume = "32",
number = "1",
pages = "4:1--4:??",
month = mar,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1206049.1206053",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:55 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "Composition of mappings between schemas is essential
to support schema evolution, data exchange, data
integration, and other data management tasks. In many
applications, mappings are given by embedded
dependencies. In this article, we study the issues
involved in composing such mappings.\par
Our algorithms and results extend those of Fagin et al.
[2004], who studied the composition of mappings given
by several kinds of constraints. In particular, they
proved that full source-to-target tuple-generating
dependencies (tgds) are closed under composition, but
embedded source-to-target tgds are not. They introduced
a class of second-order constraints, SO tgds, that is
closed under composition and has desirable properties
for data exchange.\par
We study constraints that need not be source-to-target
and we concentrate on obtaining (first-order) embedded
dependencies. As part of this study, we also consider
full dependencies and second-order constraints that
arise from Skolemizing embedded dependencies. For each
of the three classes of mappings that we study, we
provide: (a) an algorithm that attempts to compute the
composition; and (b) sufficient conditions on the input
mappings which guarantee that the algorithm will
succeed.\par
In addition, we give several negative results. In
particular, we show that full and second-order
dependencies that are not limited to be
source-to-target are not closed under composition (for
the latter, under the additional restriction that no
new function symbols are introduced). Furthermore, we
show that determining whether the composition can be
given by these kinds of dependencies is undecidable.",
acknowledgement = ack-nhfb,
articleno = "4",
fjournal = "ACM Transactions on Database Systems",
keywords = "database theory; Metadata management",
}
@Article{Hwang:2007:OTK,
author = "Seung-won Hwang and Kevin Chen-chuan Chang",
title = "Optimizing top-k queries for middleware access: {A}
unified cost-based approach",
journal = j-TODS,
volume = "32",
number = "1",
pages = "5:1--5:??",
month = mar,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1206049.1206054",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:55 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "This article studies optimizing top- k queries in
middlewares. While many assorted algorithms have been
proposed, none is generally applicable to a wide range
of possible scenarios. Existing algorithms lack both
the ``generality'' to support a wide range of access
scenarios and the systematic ``adaptivity'' to account
for runtime specifics. To fulfill this critical
lacking, we aim at taking a cost-based optimization
approach: By runtime search over a space of algorithms,
cost-based optimization is general across a wide range
of access scenarios, yet adaptive to the specific
access costs at runtime. While such optimization has
been taken for granted for relational queries from
early on, it has been clearly lacking for ranked
queries. In this article, we thus identify and address
the barriers of realizing such a unified framework. As
the first barrier, we need to define a
``comprehensive'' space encompassing all possibly
optimal algorithms to search over. As the second
barrier and a conflicting goal, such a space should
also be ``focused'' enough to enable efficient search.
For SQL queries that are explicitly composed of
relational operators, such a space, by definition,
consists of schedules of relational operators (or
``query plans''). In contrast, top- k queries do not
have logical tasks, such as relational operators. We
thus define the logical tasks of top- k queries as
building blocks to identify a comprehensive and focused
space for top- k queries. We then develop efficient
search schemes over such space for identifying the
optimal algorithm. Our study indicates that our
framework not only unifies, but also outperforms
existing algorithms specifically designed for their
scenarios.",
acknowledgement = ack-nhfb,
articleno = "5",
fjournal = "ACM Transactions on Database Systems",
keywords = "middlewares; Top-k query processing",
}
@Article{Ceri:2007:MCV,
author = "Stefano Ceri and Francesco {Di Giunta} and Pier Luca
Lanzi",
title = "Mining constraint violations",
journal = j-TODS,
volume = "32",
number = "1",
pages = "6:1--6:??",
month = mar,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1206049.1206055",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:55 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "In this article, we introduce pesudoconstraints, a
novel data mining pattern aimed at identifying rare
events in databases. At first, we formally define
pesudoconstraints using a probabilistic model and
provide a statistical test to identify
pesudoconstraints in a database. Then, we focus on a
specific class of pesudoconstraints, named cycle
pesudoconstraints, which often occur in databases. We
define cycle pesudoconstraints in the context of the ER
model and present an automatic method for detecting
cycle pesudoconstraints from a relational database.
Finally, we present an experiment to show cycle
pesudoconstraints ``at work'' on real data.",
acknowledgement = ack-nhfb,
articleno = "6",
fjournal = "ACM Transactions on Database Systems",
keywords = "Deviation detection; probabilistic models; relational
data mining",
}
@Article{Jacox:2007:SJT,
author = "Edwin H. Jacox and Hanan Samet",
title = "Spatial join techniques",
journal = j-TODS,
volume = "32",
number = "1",
pages = "7:1--7:??",
month = mar,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1206049.1206056",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:36:55 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "A variety of techniques for performing a spatial join
are reviewed. Instead of just summarizing the
literature and presenting each technique in its
entirety, distinct components of the different
techniques are described and each is decomposed into an
overall framework for performing a spatial join. A
typical spatial join technique consists of the
following components: partitioning the data, performing
internal-memory spatial joins on subsets of the data,
and checking if the full polygons intersect. Each
technique is decomposed into these components and each
component addressed in a separate section so as to
compare and contrast similar aspects of each technique.
The goal of this survey is to describe the algorithms
within each component in detail, comparing and
contrasting competing methods, thereby enabling further
analysis and experimentation with each component and
allowing the best algorithms for a particular situation
to be built piecemeal, or, even better, enabling an
optimizer to choose which algorithms to use.",
acknowledgement = ack-nhfb,
articleno = "7",
fjournal = "ACM Transactions on Database Systems",
keywords = "External memory algorithms; plane-sweep; spatial
join",
}
@Article{Athitsos:2007:QSE,
author = "Vassilis Athitsos and Marios Hadjieleftheriou and
George Kollios and Stan Sclaroff",
title = "Query-sensitive embeddings",
journal = j-TODS,
volume = "32",
number = "2",
pages = "8:1--8:??",
month = jun,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1242524.1242525",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:09 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "A common problem in many types of databases is
retrieving the most similar matches to a query object.
Finding these matches in a large database can be too
slow to be practical, especially in domains where
objects are compared using computationally expensive
similarity (or distance) measures. Embedding methods
can significantly speed-up retrieval by mapping objects
into a vector space, where distances can be measured
rapidly using a Minkowski metric. In this article we
present a novel way to improve embedding quality. In
particular, we propose to construct embeddings that use
a query-sensitive distance measure for the target space
of the embedding. This distance measure is used to
compare those vectors that the query and database
objects are mapped to. The term ``query-sensitive''
means that the distance measure changes, depending on
the current query object. We demonstrate theoretically
that using a query-sensitive distance measure increases
the modeling power of embeddings and allows them to
capture more of the structure of the original space. We
also demonstrate experimentally that query-sensitive
embeddings can significantly improve retrieval
performance. In experiments with an image database of
handwritten digits and a time-series database, the
proposed method outperforms existing state-of-the-art
non-Euclidean indexing methods, meaning that it
provides significantly better tradeoffs between
efficiency and retrieval accuracy.",
acknowledgement = ack-nhfb,
articleno = "8",
fjournal = "ACM Transactions on Database Systems",
keywords = "Embedding methods; nearest-neighbor retrieval;
non-Euclidean spaces; nonmetric spaces; similarity
matching",
}
@Article{Chaudhuri:2007:OSS,
author = "Surajit Chaudhuri and Gautam Das and Vivek Narasayya",
title = "Optimized stratified sampling for approximate query
processing",
journal = j-TODS,
volume = "32",
number = "2",
pages = "9:1--9:??",
month = jun,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1242524.1242526",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:09 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "The ability to approximately answer aggregation
queries accurately and efficiently is of great benefit
for decision support and data mining tools. In contrast
to previous sampling-based studies, we treat the
problem as an optimization problem where, given a
workload of queries, we select a stratified random
sample of the original data such that the error in
answering the workload queries using the sample is
minimized. A key novelty of our approach is that we can
tailor the choice of samples to be robust, even for
workloads that are ``similar'' but not necessarily
identical to the given workload. Finally, our
techniques recognize the importance of taking into
account the variance in the data distribution in a
principled manner. We show how our solution can be
implemented on a database system, and present results
of extensive experiments on Microsoft SQL Server that
demonstrate the superior quality of our method compared
to previous work.",
acknowledgement = ack-nhfb,
articleno = "9",
fjournal = "ACM Transactions on Database Systems",
keywords = "approximation; query processing; Random sampling",
}
@Article{Deligiannakis:2007:EWM,
author = "Antonios Deligiannakis and Minos Garofalakis and Nick
Roussopoulos",
title = "Extended wavelets for multiple measures",
journal = j-TODS,
volume = "32",
number = "2",
pages = "10:1--10:??",
month = jun,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1242524.1242527",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:09 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "Several studies have demonstrated the effectiveness of
the Haar wavelet decomposition as a tool for reducing
large amounts of data down to compact wavelet synopses
that can be used to obtain fast, accurate approximate
answers to user queries. Although originally designed
for minimizing the overall mean-squared (i.e., L 2
-norm) error in the data approximation, recently
proposed methods also enable the use of Haar wavelets
in minimizing other error metrics, such as the relative
error in data value reconstruction, which is arguably
the most important for approximate query answers.
Relatively little attention, however, has been paid to
the problem of using wavelet synopses as an approximate
query answering tool over complex tabular datasets
containing multiple measures, such as those typically
found in real-life OLAP applications. Existing
decomposition approaches will either operate on each
measure individually, or treat all measures as a vector
of values and process them simultaneously. As we
demonstrate in this article, these existing individual
or combined storage approaches for the wavelet
coefficients of different measures can easily lead to
suboptimal storage utilization, resulting in
drastically reduced accuracy for approximate query
answers. To address this problem, in this work, we
introduce the notion of an extended wavelet coefficient
as a flexible, efficient storage method for wavelet
coefficients over multimeasure data. We also propose
novel algorithms for constructing effective (optimal or
near-optimal) extended wavelet-coefficient synopses
under a given storage constraint, for both sum-squared
error and relative-error norms. Experimental results
with both real-life and synthetic datasets validate our
approach, demonstrating that our techniques
consistently obtain significant gains in approximation
accuracy compared to existing solutions.",
acknowledgement = ack-nhfb,
articleno = "10",
fjournal = "ACM Transactions on Database Systems",
keywords = "approximate query processing; data synopses;
Wavelets",
}
@Article{Rusu:2007:PRN,
author = "Florin Rusu and Alin Dobra",
title = "Pseudo-random number generation for sketch-based
estimations",
journal = j-TODS,
volume = "32",
number = "2",
pages = "11:1--11:??",
month = jun,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1242524.1242528",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:09 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "The exact computation of aggregate queries, like the
size of join of two relations, usually requires large
amounts of memory (constrained in data-streaming) or
communication (constrained in distributed computation)
and large processing times. In this situation,
approximation techniques with provable guarantees, like
sketches, are one possible solution. The performance of
sketches depends crucially on the ability to generate
particular pseudo-random numbers. In this article we
investigate both theoretically and empirically the
problem of generating k -wise independent pseudo-random
numbers and, in particular, that of generating 3- and
4-wise independent pseudo-random numbers that are fast
range-summable (i.e., they can be summed in sublinear
time). Our specific contributions are: (a) we provide a
thorough comparison of the various pseudo-random number
generating schemes; (b) we study both theoretically and
empirically the fast range-summation property of 3- and
4-wise independent generating schemes; (c) we provide
algorithms for the fast range-summation of two 3-wise
independent schemes, BCH and extended Hamming; and (d)
we show convincing theoretical and empirical evidence
that the extended Hamming scheme performs as well as
any 4-wise independent scheme for estimating the size
of join of two relations using AMS sketches, even
though it is only 3-wise independent. We use this
scheme to generate estimators that significantly
outperform state-of-the-art solutions for two problems,
namely, size of spatial joins and selectivity
estimation.",
acknowledgement = ack-nhfb,
articleno = "11",
fjournal = "ACM Transactions on Database Systems",
keywords = "approximate query processing; data synopses; fast
range-summation; Sketches",
}
@Article{Mazeika:2007:ESA,
author = "Arturas Mazeika and Michael H. B{\"o}hlen and Nick
Koudas and Divesh Srivastava",
title = "Estimating the selectivity of approximate string
queries",
journal = j-TODS,
volume = "32",
number = "2",
pages = "12:1--12:??",
month = jun,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1242524.1242529",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:09 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "Approximate queries on string data are important due
to the prevalence of such data in databases and various
conventions and errors in string data. We present the
VSol estimator, a novel technique for estimating the
selectivity of approximate string queries. The VSol
estimator is based on inverse strings and makes the
performance of the selectivity estimator independent of
the number of strings. To get inverse strings we
decompose all database strings into overlapping
substrings of length q (q-grams) and then associate
each q-gram with its inverse string: the IDs of all
strings that contain the q-gram. We use signatures to
compress inverse strings, and clustering to group
similar signatures.\par
We study our technique analytically and experimentally.
The space complexity of our estimator only depends on
the number of neighborhoods in the database and the
desired estimation error. The time to estimate the
selectivity is independent of the number of database
strings and linear with respect to the length of query
string. We give a detailed empirical performance
evaluation of our solution for synthetic and real-world
datasets. We show that VSol is effective for large
skewed databases of short strings.",
acknowledgement = ack-nhfb,
articleno = "12",
fjournal = "ACM Transactions on Database Systems",
keywords = "Inverse strings; min-wise hash signatures; q-grams",
}
@Article{Zeng:2007:CCC,
author = "Zhiping Zeng and Jianyong Wang and Lizhu Zhou and
George Karypis",
title = "Out-of-core coherent closed quasi-clique mining from
large dense graph databases",
journal = j-TODS,
volume = "32",
number = "2",
pages = "13:1--13:??",
month = jun,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1242524.1242530",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:09 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "Due to the ability of graphs to represent more generic
and more complicated relationships among different
objects, graph mining has played a significant role in
data mining, attracting increasing attention in the
data mining community. In addition, frequent coherent
subgraphs can provide valuable knowledge about the
underlying internal structure of a graph database, and
mining frequently occurring coherent subgraphs from
large dense graph databases has witnessed several
applications and received considerable attention in the
graph mining community recently. In this article, we
study how to efficiently mine the complete set of
coherent closed quasi-cliques from large dense graph
databases, which is an especially challenging task due
to the fact that the downward-closure property no
longer holds. By fully exploring some properties of
quasi-cliques, we propose several novel optimization
techniques which can prune the unpromising and
redundant subsearch spaces effectively. Meanwhile, we
devise an efficient closure checking scheme to
facilitate the discovery of closed quasi-cliques only.
Since large databases cannot be held in main memory, we
also design an out-of-core solution with efficient
index structures for mining coherent closed
quasi-cliques from large dense graph databases. We call
this Cocain*. Thorough performance study shows that
Cocain* is very efficient and scalable for large dense
graph databases.",
acknowledgement = ack-nhfb,
articleno = "13",
fjournal = "ACM Transactions on Database Systems",
keywords = "coherent subgraph; frequent closed subgraph; Graph
mining; out-of-core algorithm; quasi-clique",
}
@Article{Ipeirotis:2007:MMC,
author = "Panagiotis G. Ipeirotis and Alexandros Ntoulas and
Junghoo Cho and Luis Gravano",
title = "Modeling and managing changes in text databases",
journal = j-TODS,
volume = "32",
number = "3",
pages = "14:1--14:??",
month = aug,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1272743.1272744",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:57 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "Large amounts of (often valuable) information are
stored in web-accessible text databases.
``Metasearchers'' provide unified interfaces to query
multiple such databases at once. For efficiency,
metasearchers rely on succinct statistical summaries of
the database contents to select the best databases for
each query. So far, database selection research has
largely assumed that databases are static, so the
associated statistical summaries do not evolve over
time. However, databases are rarely static and the
statistical summaries that describe their contents need
to be updated periodically to reflect content changes.
In this article, we first report the results of a study
showing how the content summaries of 152 real web
databases evolved over a period of 52 weeks. Then, we
show how to use ``survival analysis'' techniques in
general, and Cox's proportional hazards regression in
particular, to model database changes over time and
predict when we should update each content summary.
Finally, we exploit our change model to devise update
schedules that keep the summaries up to date by
contacting databases only when needed, and then we
evaluate the quality of our schedules experimentally
over real web databases.",
acknowledgement = ack-nhfb,
articleno = "14",
fjournal = "ACM Transactions on Database Systems",
keywords = "distributed information retrieval; Metasearching; text
database selection",
}
@Article{Tao:2007:RSM,
author = "Yufei Tao and Xiaokui Xiao and Reynold Cheng",
title = "Range search on multidimensional uncertain data",
journal = j-TODS,
volume = "32",
number = "3",
pages = "15:1--15:??",
month = aug,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1272743.1272745",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:22 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "In an uncertain database, every object o is associated
with a probability density function, which describes
the likelihood that o appears at each position in a
multidimensional workspace. This article studies two
types of range retrieval fundamental to many analytical
tasks. Specifically, a nonfuzzy query returns all the
objects that appear in a search region $r_q$ with at
least a certain probability $t_q$. On the other hand,
given an uncertain object $q$, fuzzy search retrieves
the set of objects that are within distance
$\varepsilon_q$ from $q$ with no less than probability
$t_q$. The core of our methodology is a novel concept
of ``probabilistically constrained rectangle'', which
permits effective pruning\slash validation of
nonqualifying\slash qualifying data. We develop a new
index structure called the U-tree for minimizing the
query overhead. Our algorithmic findings are
accompanied with a thorough theoretical analysis, which
reveals valuable insight into the problem
characteristics, and mathematically confirms the
efficiency of our solutions. We verify the
effectiveness of the proposed techniques with extensive
experiments.",
acknowledgement = ack-nhfb,
articleno = "15",
fjournal = "ACM Transactions on Database Systems",
keywords = "range search; Uncertain databases",
}
@Article{Sinha:2007:MRB,
author = "Rishi Rakesh Sinha and Marianne Winslett",
title = "Multi-resolution bitmap indexes for scientific data",
journal = j-TODS,
volume = "32",
number = "3",
pages = "16:1--16:??",
month = aug,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1272743.1272746",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:57 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "The unique characteristics of scientific data and
queries cause traditional indexing techniques to
perform poorly on scientific workloads, occupy
excessive space, or both. Refinements of bitmap indexes
have been proposed previously as a solution to this
problem. In this article, we describe the difficulties
we encountered in deploying bitmap indexes with
scientific data and queries from two real-world
domains. In particular, previously proposed methods of
binning, encoding, and compressing bitmap vectors
either were quite slow for processing the large-range
query conditions our scientists used, or required
excessive storage space. Nor could the indexes easily
be built or used on parallel platforms. In this
article, we show how to solve these problems through
the use of multi-resolution, parallelizable bitmap
indexes, which support a fine-grained trade-off between
storage requirements and query performance. Our
experiments with large data sets from two scientific
domains show that multi-resolution, parallelizable
bitmap indexes occupy an acceptable amount of storage
while improving range query performance by roughly a
factor of 10, compared to a single-resolution bitmap
index of reasonable size.",
acknowledgement = ack-nhfb,
articleno = "16",
fjournal = "ACM Transactions on Database Systems",
keywords = "bitmap index; parallel index; Query processing;
scientific data management",
}
@Article{Chen:2007:IHJ,
author = "Shimin Chen and Anastassia Ailamaki and Phillip B.
Gibbons and Todd C. Mowry",
title = "Improving hash join performance through prefetching",
journal = j-TODS,
volume = "32",
number = "3",
pages = "17:1--17:??",
month = aug,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1272743.1272747",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:57 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "Hash join algorithms suffer from extensive CPU cache
stalls. This article shows that the standard hash join
algorithm for disk-oriented databases (i.e. GRACE)
spends over 80\% of its user time stalled on CPU cache
misses, and explores the use of CPU cache prefetching
to improve its cache performance. Applying prefetching
to hash joins is complicated by the data dependencies,
multiple code paths, and inherent randomness of
hashing. We present two techniques, group prefetching
and software-pipelined prefetching, that overcome these
complications. These schemes achieve 1.29--4.04X
speedups for the join phase and 1.37--3.49X speedups
for the partition phase over GRACE and simple
prefetching approaches. Moreover, compared with
previous cache-aware approaches (i.e. cache
partitioning), the schemes are at least 36\% faster on
large relations and do not require exclusive use of the
CPU cache to be effective. Finally, comparing the
elapsed real times when disk I/Os are in the picture,
our cache prefetching schemes achieve 1.12--1.84X
speedups for the join phase and 1.06--1.60X speedups
for the partition phase over the GRACE hash join
algorithm.",
acknowledgement = ack-nhfb,
articleno = "17",
fjournal = "ACM Transactions on Database Systems",
keywords = "CPU cache performance; CPU cache prefetching; group
prefetching; Hash join; software-pipelined
prefetching",
}
@Article{Cao:2007:SQO,
author = "Bin Cao and Antonio Badia",
title = "{SQL} query optimization through nested relational
algebra",
journal = j-TODS,
volume = "32",
number = "3",
pages = "18:1--18:??",
month = aug,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1272743.1272748",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:57 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "Most research work on optimization of nested queries
focuses on aggregate subqueries. In this article, we
show that existing approaches are not adequate for
nonaggregate subqueries, especially for those having
multiple subqueries and certain comparison operators.
We then propose a new efficient approach, the nested
relational approach, based on the nested relational
algebra. The nested relational approach treats all
subqueries in a uniform manner, being able to deal with
nested queries of any type and any level. We report on
experimental work that confirms that existing
approaches have difficulties dealing with nonaggregate
subqueries, and that the nested relational approach
offers better performance. We also discuss algebraic
optimization rules for further optimizing the nested
relational approach and the issue of integrating it
into relational database systems.",
acknowledgement = ack-nhfb,
articleno = "18",
fjournal = "ACM Transactions on Database Systems",
keywords = "Nested queries; nested relational algebra;
nonrelational query processing",
}
@Article{Mamoulis:2007:ETA,
author = "Nikos Mamoulis and Man Lung Yiu and Kit Hung Cheng and
David W. Cheung",
title = "Efficient top-$k$ aggregation of ranked inputs",
journal = j-TODS,
volume = "32",
number = "3",
pages = "19:1--19:??",
month = aug,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1272743.1272749",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:22 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "A top- k query combines different rankings of the same
set of objects and returns the k objects with the
highest combined score according to an aggregate
function. We bring to light some key observations,
which impose two phases that any top- k algorithm,
based on sorted accesses, should go through. Based on
them, we propose a new algorithm, which is designed to
minimize the number of object accesses, the
computational cost, and the memory requirements of top-
k search with monotone aggregate functions. We provide
an analysis for its cost and show that it is always no
worse than the baseline ``no random accesses''
algorithm in terms of computations, accesses, and
memory required. As a side contribution, we perform a
space analysis, which indicates the memory requirements
of top- k algorithms that only perform sorted accesses.
For the case, where the required space exceeds the
available memory, we propose disk-based variants of our
algorithm. We propose and optimize a multiway top- k
join operator, with certain advantages over evaluation
trees of binary top- k join operators. Finally, we
define and study the computation of top- k cubes and
the implementation of roll-up and drill-down operations
in such cubes. Extensive experiments with synthetic and
real data show that, compared to previous techniques,
our method accesses fewer objects, while being orders
of magnitude faster.",
acknowledgement = ack-nhfb,
articleno = "19",
fjournal = "ACM Transactions on Database Systems",
keywords = "rank aggregation; Top- k queries",
}
@Article{Chaudhuri:2007:IAS,
author = "Surajit Chaudhuri",
title = "Introduction to {ACM SIGMOD} 2006 conference papers",
journal = j-TODS,
volume = "32",
number = "4",
pages = "20:1--20:??",
month = nov,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1292609.1292610",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:32 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
articleno = "20",
fjournal = "ACM Transactions on Database Systems",
}
@Article{Ipeirotis:2007:TQO,
author = "Panagiotis G. Ipeirotis and Eugene Agichtein and
Pranay Jain and Luis Gravano",
title = "Towards a query optimizer for text-centric tasks",
journal = j-TODS,
volume = "32",
number = "4",
pages = "21:1--21:??",
month = nov,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1292609.1292611",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:32 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "Text is ubiquitous and, not surprisingly, many
important applications rely on textual data for a
variety of tasks. As a notable example, information
extraction applications derive structured relations
from unstructured text; as another example, focused
crawlers explore the Web to locate pages about specific
topics. Execution plans for text-centric tasks follow
two general paradigms for processing a text database:
either we can scan, or ``crawl,'' the text database or,
alternatively, we can exploit search engine indexes and
retrieve the documents of interest via carefully
crafted queries constructed in task-specific ways. The
choice between crawl- and query-based execution plans
can have a substantial impact on both execution time
and output ``completeness'' (e.g., in terms of recall).
Nevertheless, this choice is typically ad hoc and based
on heuristics or plain intuition. In this article, we
present fundamental building blocks to make the choice
of execution plans for text-centric tasks in an
informed, cost-based way. Towards this goal, we show
how to analyze query- and crawl-based plans in terms of
both execution time and output completeness. We adapt
results from random-graph theory and statistics to
develop a rigorous cost model for the execution plans.
Our cost model reflects the fact that the performance
of the plans depends on fundamental task-specific
properties of the underlying text databases. We
identify these properties and present efficient
techniques for estimating the associated parameters of
the cost model. We also present two optimization
approaches for text-centric tasks that rely on the
cost-model parameters and select efficient execution
plans. Overall, our optimization approaches help build
efficient execution plans for a task, resulting in
significant efficiency and output completeness
benefits. We complement our results with a large-scale
experimental evaluation for three important
text-centric tasks and over multiple real-life data
sets.",
acknowledgement = ack-nhfb,
articleno = "21",
fjournal = "ACM Transactions on Database Systems",
keywords = "distributed information retrieval; focused crawling;
information extraction; Metasearching; text database
selection",
}
@Article{Petropoulos:2007:EIQ,
author = "Michalis Petropoulos and Alin Deutsch and Yannis
Papakonstantinou and Yannis Katsis",
title = "Exporting and interactively querying {Web}
service-accessed sources: {The CLIDE System}",
journal = j-TODS,
volume = "32",
number = "4",
pages = "22:1--22:??",
month = nov,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1292609.1292612",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:32 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "The CLIDE System assists the owners of sources that
participate in Web service-based data publishing
systems to publish a restricted set of parameterized
queries over the schema of their sources and package
them as WSDL services. The sources may be relational
databases, which naturally have a schema, or ad hoc
information/application systems whereas the owner
publishes a virtual schema. CLIDE allows information
clients to pose queries over the published schema and
utilizes prior work on answering queries using views to
answer queries that can be processed by combining and
processing the results of one or more Web service
calls. These queries are called feasible. Contrary to
prior work, where infeasible queries are rejected
without an explanatory feedback, leading the user into
a frustrating trial-and-error cycle, CLIDE features a
query formulation interface, which extends the QBE-like
query builder of Microsoft's SQL Server with a color
scheme that guides the user toward formulating feasible
queries. CLIDE guarantees that the suggested query edit
actions are complete (i.e., each feasible query can be
built by following only suggestions), rapidly
convergent (the suggestions are tuned to lead to the
closest feasible completions of the query), and
suitably summarized (at each interaction step, only a
minimal number of actions needed to preserve
completeness are suggested). We present the algorithms,
implementation, and performance evaluation showing that
CLIDE is a viable on-line tool.",
acknowledgement = ack-nhfb,
articleno = "22",
fjournal = "ACM Transactions on Database Systems",
keywords = "limited access patterns; Middleware; query rewriting;
Web services",
}
@Article{Sharfman:2007:GAM,
author = "Izchak Sharfman and Assaf Schuster and Daniel Keren",
title = "A geometric approach to monitoring threshold functions
over distributed data streams",
journal = j-TODS,
volume = "32",
number = "4",
pages = "23:1--23:??",
month = nov,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1292609.1292613",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:32 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "Monitoring data streams in a distributed system is the
focus of much research in recent years. Most of the
proposed schemes, however, deal with monitoring simple
aggregated values, such as the frequency of appearance
of items in the streams. More involved challenges, such
as the important task of feature selection (e.g., by
monitoring the information gain of various features),
still require very high communication overhead using
naive, centralized algorithms.\par
We present a novel geometric approach which reduces
monitoring the value of a function (vis-{\`a}-vis a
threshold) to a set of constraints applied locally on
each of the streams. The constraints are used to
locally filter out data increments that do not affect
the monitoring outcome, thus avoiding unnecessary
communication. As a result, our approach enables
monitoring of arbitrary threshold functions over
distributed data streams in an efficient manner.\par
We present experimental results on real-world data
which demonstrate that our algorithms are highly
scalable, and considerably reduce communication load in
comparison to centralized algorithms.",
acknowledgement = ack-nhfb,
articleno = "23",
fjournal = "ACM Transactions on Database Systems",
keywords = "Distributed monitoring",
}
@Article{VandenBussche:2007:IPS,
author = "Jan {Van den Bussche}",
title = "Introduction to the {PODS} 2006 special section",
journal = j-TODS,
volume = "32",
number = "4",
pages = "24:1--24:??",
month = nov,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1292609.1292614",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:32 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
acknowledgement = ack-nhfb,
articleno = "24",
fjournal = "ACM Transactions on Database Systems",
}
@Article{Fagin:2007:ISM,
author = "Ronald Fagin",
title = "Inverting schema mappings",
journal = j-TODS,
volume = "32",
number = "4",
pages = "25:1--25:??",
month = nov,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1292609.1292615",
ISSN = "0362-5915 (print), 1557-4644 (electronic)",
ISSN-L = "0362-5915",
bibdate = "Thu Jun 12 16:37:32 MDT 2008",
bibsource = "http://www.acm.org/pubs/contents/journals/tods/",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tods.bib",
abstract = "A schema mapping is a specification that describes how
data structured under one schema (the source schema) is
to be transformed into data structured under a
different schema (the target schema). Although the
notion of an inverse of a schema mapping is important,
the exact definition of an inverse mapping is somewhat
elusive. This is because a schema mapping may associate
many target instances with each source instance, and
many source instances with each target instance. Based
on the notion that the composition of a mapping and its
inverse is the identity, we give a formal definition
for what it means for a schema mapping $M\prime$ to be
an inverse of a schema mapping $M$ for a class $S$ of
source instances. We call such an inverse an
$S$-inverse. A particular case of interest arises when
$S$ is the class of all source instances, in which case
an $S$-inverse is a global inverse. We focus on the
important and practical case of schema mappings
specified by source-to-target tuple-generating
dependencies, and uncover a rich theory. When $S$ is
specified by a set of dependencies with a finite chase,
we show how to construct an $S$-inverse when one
exists. In particular, we show how to construct a
global inverse when one exists. Given $M$ and
$M\prime$, we show how to define the largest class $S$
such that $M\prime$ is an $S$-inverse of $M$.",
acknowledgement = ack-nhfb,
articleno = "25",
fjournal = "ACM Transactions on Database Systems",
keywords = "chase; computational complexity; Data exchange; data
integration; dependencies; inverse; metadata model
management; schema mapping; second-order logic",
}
@Article{Bender:2007:APM,
author = "Michael A. Bender and Haodong Hu",
title = "An adaptive packed-memory array",
journal = j-TODS,
volume = "32",
number = "4",
pages = "26:1--26:??",
month = nov,
year = "2007",
CODEN = "ATDSD3",
DOI = "http://doi.acm.org/10.1145/1292609.1292616",
ISSN =