%%% -*-BibTeX-*-
%%% ====================================================================
%%% BibTeX-file{
%%% author = "Nelson H. F. Beebe",
%%% version = "1.20",
%%% date = "30 June 2009",
%%% time = "15:26:49 MDT",
%%% filename = "sigmod.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 = "50453 54303 230730 2116095",
%%% email = "beebe at math.utah.edu, beebe at acm.org,
%%% beebe at computer.org (Internet)",
%%% codetable = "ISO/ASCII",
%%% keywords = "BibTeX; bibliography; data base; database;
%%% SIGMOD Record",
%%% license = "public domain",
%%% supported = "yes",
%%% docstring = "This is a BibTeX bibliography for ACM SIGMOD
%%% Record, the newsletter of the ACM Special
%%% Interest Group on Management of Data.
%%%
%%% The journal has a World Wide Web site at
%%%
%%% http://www.acm.org/sigmod/
%%%
%%% with issue tables of contents at
%%%
%%% http://www.acm.org/sigmod/record/index.html
%%% http://portal.acm.org/browse_dl.cfm?idx=J689
%%%
%%% At version 1.20, the year coverage looked
%%% like this:
%%%
%%% 1969 ( 10) 1983 ( 29) 1997 ( 112)
%%% 1970 ( 0) 1984 ( 34) 1998 ( 133)
%%% 1971 ( 0) 1985 ( 40) 1999 ( 97)
%%% 1972 ( 1) 1986 ( 45) 2000 ( 88)
%%% 1973 ( 6) 1987 ( 48) 2001 ( 127)
%%% 1974 ( 13) 1988 ( 81) 2002 ( 74)
%%% 1975 ( 6) 1989 ( 66) 2003 ( 67)
%%% 1976 ( 29) 1990 ( 77) 2004 ( 77)
%%% 1977 ( 23) 1991 ( 97) 2005 ( 68)
%%% 1978 ( 17) 1992 ( 102) 2006 ( 50)
%%% 1979 ( 0) 1993 ( 135) 2007 ( 35)
%%% 1980 ( 0) 1994 ( 125) 2008 ( 62)
%%% 1981 ( 78) 1995 ( 137) 2009 ( 6)
%%% 1982 ( 8) 1996 ( 128)
%%%
%%% Article: 2318
%%% Proceedings: 13
%%%
%%% Total entries: 2331
%%%
%%% 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.
%%%
%%% 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-SIGMOD = "SIGMOD Record (ACM Special Interest
Group on Management of Data)"}
%%% ====================================================================
%%% Publishers and their addresses:
@String{pub-ACM = "ACM Press"}
@String{pub-ACM:adr = "New York, NY 10036, USA"}
%%% ====================================================================
%%% Bibliography entries:
@Article{Olle:1969:TDD,
author = "T. William Olle",
title = "A taxonomy of data definition languages",
journal = j-SIGMOD,
volume = "1",
number = "1",
pages = "24--28",
month = aug,
year = "1969",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984409.984410",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:04:49 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Mooers:1969:DDL,
author = "Calvin N. Mooers",
title = "Data descriptive languages",
journal = j-SIGMOD,
volume = "1",
number = "1",
pages = "31--36",
month = aug,
year = "1969",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984409.984411",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:04:49 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "'Data' is defined as being digital matter having
utility. A 'data descriptive language' is a manner of
description of how such digital matter can be
transformed into a more useful form. Data descriptive
languages are characterized as being iconographic,
algorithmic, or a mixture of both. File structures are
held to be merely a special case of data. An
algorithmic data description is always possible, by
definition, since otherwise the digital matter under
consideration is not 'data'. In a trivial sense, such
languages as COBOL or FORTRAN are found to be
completely general data descriptive languages, although
they are otherwise quite unsuitable because they are so
poorly fitted to the descriptive task. A good data
descriptive language should be congenial to use,
general, transformable, and independent of supporting
hardware or software. The value of small one-man
projects for the creation of data languages is
suggested.",
acknowledgement = ack-nhfb,
}
@Article{Mooers:1969:UXA,
author = "Calvin N. Mooers",
title = "For {USASI X3} ad hoc committee on data descriptive
language: `external versus internal formats'",
journal = j-SIGMOD,
volume = "1",
number = "1",
pages = "37--37",
month = aug,
year = "1969",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984409.984412",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:04:49 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bobrow:1969:MFC,
author = "Daniel Bobrow and William R. Sutherland",
title = "Message forms in computer networks",
journal = j-SIGMOD,
volume = "1",
number = "1",
pages = "38--42",
month = aug,
year = "1969",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984409.984413",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:04:49 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hatfield:1969:FSR,
author = "Don Hatfield",
title = "Finite state representation of interactive languages",
journal = j-SIGMOD,
volume = "1",
number = "1",
pages = "43--43",
month = aug,
year = "1969",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984409.984414",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:04:49 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{See:1969:FSR,
author = "Richard See",
title = "Finite state representation of interactive languages",
journal = j-SIGMOD,
volume = "1",
number = "1",
pages = "44--45",
month = aug,
year = "1969",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984409.984415",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:04:49 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{McGee:1969:DDD,
author = "W. C. McGee",
title = "Data description for data independence",
journal = j-SIGMOD,
volume = "1",
number = "2",
pages = "3--10",
month = dec,
year = "1969",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983038.983039",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:04:58 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rodriguez:1969:PPD,
author = "J. E. Rodriguez",
title = "Program portability, data manipulation languages, and
data description languages",
journal = j-SIGMOD,
volume = "1",
number = "2",
pages = "11--13",
month = dec,
year = "1969",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983038.983040",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:04:58 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gosden:1969:RXD,
author = "J. A. Gosden",
title = "Report to {X3} on data definition languages",
journal = j-SIGMOD,
volume = "1",
number = "2",
pages = "14--25",
month = dec,
year = "1969",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983038.983041",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:04:58 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{DImperio:1969:IST,
author = "M. E. D'Imperio",
title = "Information structures: tools in problem solving",
journal = j-SIGMOD,
volume = "1",
number = "2",
pages = "25--51",
month = dec,
year = "1969",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983038.983042",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:04:58 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
%% ACM Portal lacks data for v2 n1-3 (1970)
%% ACM Portal lacks data for v3 n1 (April 1971)
%% ACM Portal lacks data for v3 n2 (October 1971)
@Article{Sieglaff:1972:SAT,
author = "Harold P. Sieglaff",
title = "Stable or archival table",
journal = j-SIGMOD,
volume = "4",
number = "1",
pages = "11--12",
month = apr,
year = "1972",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983048.983049",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:06 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
%% ACM Portal lacks data for v4 n2 (July 1972)
%% ACM Portal lacks data for v4 n3 (November 1972)
@Article{Buschman:1973:UIF,
author = "A. Camille Buschman",
title = "Use of an inverted file structure for interactive
retrieval of computer program abstracts",
journal = j-SIGMOD,
volume = "5",
number = "1",
pages = "3--12",
month = jun,
year = "1973",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983055.983056",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:14 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "Standard Oil Company of California's Program Abstracts
System will interactively search for, and list by title
and mnemonic, all Company computer programs belonging
to a particular category or technical application area
in the filed of petroleum exploration and production.
If one or more titles are of interest, the user can
request a display of those abstracts. Retrieval is by
search of an inverted index made up of a fixed set of
terms covering application areas, programming
languages, processing mode, and machine designations.",
acknowledgement = ack-nhfb,
}
@Article{Tellier:1973:TWD,
author = "Harrison Tellier",
title = "Tutorial: what is a data base? (abstracts taken from
an original paper presented during the {SIGBDP,
SIGFIDET tutorial sessions, ACM 72})",
journal = j-SIGMOD,
volume = "5",
number = "1",
pages = "13--43",
month = jun,
year = "1973",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983055.983057",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:14 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lyon:1973:WD,
author = "John K. Lyon",
title = "What is a database",
journal = j-SIGMOD,
volume = "5",
number = "1",
pages = "44--62",
month = jun,
year = "1973",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983055.983058",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:14 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Codd:1973:UR,
author = "E. F. Codd",
title = "Understanding relations",
journal = j-SIGMOD,
volume = "5",
number = "1",
pages = "63--64",
month = jun,
year = "1973",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983055.983059",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:14 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sieglaff:1973:SF,
author = "Harold P. Sieglaff",
title = "The {STREETWALKER FILE}",
journal = j-SIGMOD,
volume = "5",
number = "2",
pages = "8--13",
month = nov,
year = "1973",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983061.983062",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:20 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Little:1973:AES,
author = "John L. Little",
title = "{ASCII} and {EBCDIC} sequencing",
journal = j-SIGMOD,
volume = "5",
number = "2",
pages = "14--16",
month = nov,
year = "1973",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983061.983063",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:20 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Folinus:1974:VID,
author = "Jeffery J. Folinus and Stuart E. Madnick and Howard B.
Schutzman",
title = "Virtual information in data-base systems",
journal = j-SIGMOD,
volume = "6",
number = "2",
pages = "1--15",
month = mar,
year = "1974",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983070.983071",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:23 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "This paper examines the concept and implications of
virtual information in data base systems. Virtual
information is any fact which does not physically exist
in the data base, but is nonetheless accessible through
combinations of algorithms and other data. Physically
recorded information is only one of a number of ways to
obtain information from a data-base system. Viewing an
information system as a collection of functions shows
that pure data and pure algorithm from the endpoints of
a spectrum of ways function values can be realized,
with the middle range being various types of virtual
information. Several classes of virtual information are
identified, and their usefulness is examined to show
the appropriateness of the concept in a data-base
system. Finally, the model is evaluated in light of the
implications of virtual information for inference and
automatic restructuring within a data base.",
acknowledgement = ack-nhfb,
}
@Article{Sibley:1974:SRC,
author = "E. H. Sibley",
title = "Some reviews of current literature",
journal = j-SIGMOD,
volume = "6",
number = "2",
pages = "6--7",
year = "1974",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983065.983066",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:09 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rabin:1974:CIB,
author = "Jonas Rabin and Cheng W. Cheng",
title = "Common interface between programming languages and
data base management systems",
journal = j-SIGMOD,
volume = "6",
number = "2",
pages = "8--8",
year = "1974",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983065.983067",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:09 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rabin:1974:SPI,
author = "Jonas Rabin and Cheng W. Cheng",
title = "Structured programming and integrated data-base
systems design",
journal = j-SIGMOD,
volume = "6",
number = "2",
pages = "8--9",
year = "1974",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983065.983068",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:09 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Roach:1974:ATD,
author = "Vincent Roach",
title = "An automated technique for designing optimal
performance {IMS} data bases",
journal = j-SIGMOD,
volume = "6",
number = "2",
pages = "16--23",
month = mar,
year = "1974",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983070.983072",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:23 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "There exists great potential for IMS performance
improvement through selection among design
alternatives. One such area is data base design, which
covers a number of sensitive variables. The only
feasible way to evaluate the effects of varying
combinations of values for these variables, is via
simulation. Many of the drawbacks of simulation have
been alleviated by the creation of a comprehensive,
validated model of IMS, which feeds mostly on
pre-existing data. This model allows the evaluation of
many alternatives, including data base design. A case
study has shown the great potential which may be
realized through use of this tool.",
acknowledgement = ack-nhfb,
}
@Article{Swenson:1974:SRC,
author = "J. R. Swenson",
title = "Some reviews of current literature",
journal = j-SIGMOD,
volume = "6",
number = "2",
pages = "26--28",
month = mar,
year = "1974",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983070.983073",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:23 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Dummer:1974:DSA,
author = "D. C. Dummer and M. W. O'Reilly",
title = "Data and systems administration",
journal = j-SIGMOD,
volume = "6",
number = "2",
pages = "29--30",
month = mar,
year = "1974",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983070.983074",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:23 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Honig:1974:BDB,
author = "William L. Honig",
title = "Bringing data base technology to the programmer",
journal = j-SIGMOD,
volume = "6",
number = "3",
pages = "2--15",
month = jul,
year = "1974",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983076.983077",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:29 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "This paper reports work toward melding some ideas from
data base management with currently popular views of
structured programming. The basic idea is to allow all
data structures used inside programs (instead of just
those in an external data base) to be described at
multiple conceptual levels by a separate definition.
This approach brings to programmers the benefits of
data independence and also allows structured
programming to have its hitherto unrealized full effect
on data.",
acknowledgement = ack-nhfb,
keywords = "data independence; data structures; program design;
structured programming",
}
@Article{Bachman:1974:SCW,
author = "Charles W. Bachman",
title = "Summary of current work {ANSI\slash X3\slash
SPARC\slash study} group: database systems",
journal = j-SIGMOD,
volume = "6",
number = "3",
pages = "16--39",
month = jul,
year = "1974",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983076.983078",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:29 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Codd:1974:UR,
author = "E. F. Codd",
title = "Understanding relations",
journal = j-SIGMOD,
volume = "6",
number = "3",
pages = "40--42",
month = jul,
year = "1974",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983076.983079",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:29 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rothnie:1974:RPF,
author = "James B. Rothnie",
title = "Review: {Proceedings of the Fourth Annual Computer
Related Information System Symposium}",
journal = j-SIGMOD,
volume = "6",
number = "3",
pages = "43--44",
month = jul,
year = "1974",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983076.983080",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:29 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Shneiderman:1974:ODB,
author = "Ben Shneiderman",
title = "Opportunities for data base reorganization",
journal = j-SIGMOD,
volume = "6",
number = "4",
pages = "1--8",
month = dec,
year = "1974",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983082.983083",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:35 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Minsky:1974:ALD,
author = "Naftaly Minsky",
title = "Another look at data-bases",
journal = j-SIGMOD,
volume = "6",
number = "4",
pages = "9--17",
month = dec,
year = "1974",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983082.983084",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:35 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Taylor:1975:RIT,
author = "Robert W. Taylor",
title = "Report on {IFIP TC-2} conference: {'A technical
in-depth evaluation of the DDL'}",
journal = j-SIGMOD,
volume = "7",
number = "1",
pages = "5--9",
month = jan,
year = "1975",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984328.984329",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:39 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Purdy:1975:GCD,
author = "J. Gerry Purdy",
title = "A graduate course in database management",
journal = j-SIGMOD,
volume = "7",
number = "1",
pages = "10--15",
month = jan,
year = "1975",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984328.984330",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:39 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "Database management is a new and fast growing
discipline within computer science. Curriculum 68 did
not include database management in its recommended
courses. With the advent of large direct access
secondary storage devices to hold large volumes of
information referred to as a database and with the need
to manage that storage efficiently and conveniently,
there has developed the computer science discipline of
database management. This paper describes a course in
database management, including a course catalog
overview, course outline, and bibliography. This paper
could serve as a guideline for future ACM Curriculum
Committee on Computer Science recommendation in
database management.",
acknowledgement = ack-nhfb,
}
%% ACM Portal lacks data for v7 n2 (April 1975)
@Article{Olle:1975:PVR,
author = "T. William Olle",
title = "A practitioner's view of relational data base theory",
journal = j-SIGMOD,
volume = "7",
number = "3--4",
pages = "29--43",
month = sep,
year = "1975",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984403.984404",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:44 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hardgrave:1975:DRS,
author = "W. T. Hardgrave and E. H. Sibley",
title = "Database research: some comments on future
directions",
journal = j-SIGMOD,
volume = "7",
number = "3--4",
pages = "44--48",
month = sep,
year = "1975",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984403.984405",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:44 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Clymer:1975:CDD,
author = "John Clymer",
title = "Comments on the debate: data-structure-set versus
relational",
journal = j-SIGMOD,
volume = "7",
number = "3--4",
pages = "49--52",
month = sep,
year = "1975",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984403.984406",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:44 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Weldon:1975:RID,
author = "Jay-Louise Weldon",
title = "Review of {'An introduction to database systems' by C.
J. Date. Addison-Wesley Publishing Co. 1975}",
journal = j-SIGMOD,
volume = "7",
number = "3--4",
pages = "53--54",
month = sep,
year = "1975",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984403.984407",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:44 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lefkovits:1976:PRA,
author = "Henry C. Lefkovits",
title = "A progress report on the activities of the {CODASYL
End User Facility Task Group}",
journal = j-SIGMOD,
volume = "8",
number = "1",
pages = "1--35",
month = jan,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984341.984342",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:54 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "This technical report is authored and presented by the
End User Facility Task Group of the CODASYL Systems
Committee to interested members of the computing
community for discussion and comment. Stated in the
report are the collective opinions of the committee
members. The report does not necessarily represent the
technical opinion of any one member, nor does it imply
an unanimous opinion. This report neither states the
opinion of, nor implies the support of, the sponsoring
organizations. It is the intent of CODASYL that its
work be available and in the public domain. Anyone
reproducing all or part of this report is requested to
include this notice where meaningful.",
acknowledgement = ack-nhfb,
}
@Article{Nordstrom:1976:OMM,
author = "Bengt Nordstr{\"o}m",
title = "An outline of a mathematical model for the definition
and manipulation of data",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "1--11",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/800237.807112",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "This paper presents a constructive model for data
which suggests some precise definitions of notions like
type, name, constants, declarations etc. The model is
based on an old idea of looking at data as a mapping
from a set of names to a set of values. We will study
two different kinds of assignments and also show how
the model can be used to give some hints for new data
structuring methods. In particular we have given a
definition of a sequence and we have shown how this
data structure can be used to give constructive
definitions of structures like stacks, files and
queues. We have also studied tree traversals i.e. the
correspondence between various trees and sequences.",
acknowledgement = ack-nhfb,
keywords = "Data structure description; Data type; High level
languages; Sequence; Set theoretic languages; Tree
traversal",
}
@Article{Linden:1976:UAD,
author = "Theodore A. Linden",
title = "The use of abstract data types to simplify program
modifications",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "12--23",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984344.807113",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "If a program is structured using abstract data types
as the basic unit of modularity, then that program is
much easier to extend or modify. This thesis is
illustrated by the staged development of a program to
compute prime numbers based on the sieve of
Eratosthenes. This paper includes an extensive
introduction to the concept of abstract data types and
can be used as a tutorial survey. It includes
discussions on the use of abstract data types in
connection with recent approaches to data abstractions,
hierarchical structure, and program design. Abstract
data types are an extension and modification of the
traditional concept of data type. An abstract data type
defines not only a data representation for objects of
the type but also the set of operations that can be
performed on objects of the type. Furthermore, the
abstract data type can protect the data representation
from direct access by other parts of the program.",
acknowledgement = ack-nhfb,
keywords = "Abstract data types; Class; Cluster; Data abstraction;
Data type; Module; Programming methods; Program
modifications; Type",
}
@Article{Zloof:1976:SBA,
author = "Moshe M. Zloof and S. Peter de Jong",
title = "The {System for Business Automation (SBA)}:
Programming language",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "24--24",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984344.807114",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "The System for Business Automation (SBA) is a system
within which application experts --- non-programmers
--- can describe and execute their applications on a
computer. This paper describes the programming language
part of the system. This language is a superset of
Zloof's Query-by-Example. In Query-by-Example the user
retains the perception of manual table manipulation by
programming within two-dimensional skeleton tables
displayed on the screen. In SBA the user programs
within skeletons of more general business entities such
as tables, forms, charts, etc. Within these displays
the user programs his application as a series of
Query-by-Example operations. This system can also run
in a part manual, part automated manner, thus
permitting fast initial use of the computer together
with gradual automation of the business.",
acknowledgement = ack-nhfb,
}
@Article{Allman:1976:ERD,
author = "Eric Allman and Michael Stonebraker and Gerald Held",
title = "Embedding a relational data sublanguage in a general
purpose programming language",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "25--35",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984344.807115",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "This paper describes EQUEL, a programming language
which embeds the relational data sublanguage QUEL into
the general purpose programming language ``C''. Both
QUEL and EQUEL are operational parts of the INGRES
relational data base management system at Berkeley.
Also briefly described are two operational subsystems
written in this combined language. Lastly some of the
language oriented shortcomings that have been observed
in QUEL and EQUEL are discussed.",
acknowledgement = ack-nhfb,
}
@Article{Johnson:1976:ADT,
author = "Robert T. Johnson and James B. Morris",
title = "Abstract data types in the {Model} programming
language",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "36--46",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/800237.807116",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "The concept of an abstract data type is available in
the Model programming language as a proposed
improvement to current ideas of programming
methodology. In structured programming the principal
technique is refinement of procedures. In Model, the
analogue is refinement of data types. An abstract data
type consists of a data structure and an associated set
of operations. The characteristics and suggested uses
for this mechanism are discussed. Also presented are
several examples culminating in a parallel version of
the Fast Fourier Transform.",
acknowledgement = ack-nhfb,
keywords = "Abstract data types; Data types; Level of abstraction;
Parameterized types; Programming abstraction; Reliable
programming; Structured programming",
}
@Article{McLeod:1976:HLD,
author = "Dennis J. McLeod",
title = "High level domain definition in a relational date base
system",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "47--57",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984344.807117",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "A relational data base is herein defined as a
collection of normalized relations (relations in first
normal form) and a collection of domains. A normalized
relation may be viewed as a table, wherein each row of
the table corresponds to a tuple of the relation, and
the entries in a given column belong to the set of
values constituting the domain underlying that column.
The domains of a data base have an abstract existence
apart from the data base relations. The data base also
includes various types of semantic integrity rules,
which specify additional properties of the data in the
data base. One such type of semantic integrity rule is
the domain definition. A domain definition includes the
precise description of the set of values (objects)
constituting the domain. In a normalized data base, all
domains are sets of atomic data values. A domain
definition also includes a specification of the
ordering on the values in a domain, for comparability
purposes. In addition, a domain definition contains a
specification of the action that is to occur if an
attempt is made to violate the restriction that every
entry in each column of a relation must be from the
underlying domain of that column. A nonprocedural
language permitting the high level expression of domain
definitions is defined. Language details and examples
are presented, and the syntax and informal semantics of
the domain definition language are given. This approach
to domain definition is analyzed in terms of its impact
on other aspects of data base semantic integrity. The
relationship with the data base system in general is
outlined. An analysis of intradomain and interdomain
comparability is included. An introduction to relevant
implementation issues is also presented. Emphasis is
placed on a general approach to implementation and
implementation techniques, rather than on a specific
system.",
acknowledgement = ack-nhfb,
}
@Article{Hammer:1976:DAD,
author = "Michael Hammer",
title = "Data abstractions for data bases",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "58--59",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984344.807118",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "The concept of abstract data types has emerged from
programming language research as a device to encourage
and facilitate structured and modular programming [1].
It separates the abstraction of a data object from its
implementation. The user of an abstract data type only
concerns himself with the behavioral semantics of the
type: what meaningful operations can be applied to
objects of the type; the internal representation and
structure of the type is unknown to him. In this way,
irrelevant detail is suppressed and meaningfulness of
programs enhanced. What application does this concept
have to the area of data bases? There are some obvious
similarities between the principle of abstraction and
the concept of data independence of data bases [2].
Data independence means that application programs that
utilize a data base do not need to know either the
physical or the structural organization of the data
base, but can relate to it purely on a logical plane.
As with data abstractions, the goal is clarity and
modifiability of programs, resulting from concentration
on semantics rather than representation.",
acknowledgement = ack-nhfb,
}
@Article{Horning:1976:SDP,
author = "J. J. Horning",
title = "Some desirable properties of data abstraction
facilities",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "60--62",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/942574.807119",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "It is currently popular to say that programming
languages need ``data abstraction facilities,'' and to
assert that the provision of such facilities would
provide conceptual and practical advantages in the
domain of data structures akin to the advantages
provided by procedures in the domain of computational
structures. This note explores some of the implications
of this metaphor, without attempting to make it
precise. I shall use the term capsule to refer to the
data analog of procedure. [Those who are familiar with
the SIMULA class, the CLU cluster, or the ALPHARD form,
may use any of these as an approximation to capsule; I
use a neutral term to avoid implying the details of any
particular language.] First, what are the advantages
provided by procedures (subroutines, functions,
macros)? I can think of at least eight (highly
interrelated) categories: 1) avoidance of repetition,
2) modular program structure, 3) a basis for structured
programming, 4) conceptual units for understanding and
reasoning about programs, 5) clearly defined interfaces
that may be precisely specified, 6) units of
maintenance and improvement, 7) a language extension
mechanism, and 8) units for separate compilation. Let
us consider each of these in turn.",
acknowledgement = ack-nhfb,
}
@Article{Ross:1976:TFU,
author = "Douglas T. Ross",
title = "Toward foundations for the understanding of type",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "63--65",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/800237.807120",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "I have now written, have available from SofTech, and
have submitted for publication elsewhere, the first two
of a series of deep philosophical papers [1, 2] about
Plex [3]. Among other things, I believe these papers
begin to provide a proper foundation for our endeavors
in computer science and software engineering. The trend
of these developments is indicated in the following,
which I call The Proem of Plex1 and Plex2 [``Proem: 1.)
A preliminary discourse to a longer piece of writing.
2.) An introductory comment before a speech. 3.)
Something that opens or begins.'' --- Webster's].",
acknowledgement = ack-nhfb,
}
@Article{Shaw:1976:RDA,
author = "Mary Shaw",
title = "Research directions in abstract data structures",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "66--68",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984344.807121",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "A number of interesting research problems arise from
current attempts to incorporate abstraction mechanisms
in programming languages. Some of them are central
issues in current research projects and others are
direct extensions of current work. Several problems in
each of these areas are outlined below. A third section
presents a series of speculations about how this work
might evolve in the future. Since this is supposed to
be a session to spark research ideas, I have written
brief descriptions of a number of topics and not delved
very deeply into any one. Most of these problems can
probably be solved in more than one way. Hence the fact
that a problem is being worked on should not deter
anyone from looking at it from another viewpoint.",
acknowledgement = ack-nhfb,
}
@Article{Mitchell:1976:NSD,
author = "Jim Mitchell and Ben Wegbreit",
title = "A next step in data structuring for programming
languages",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "69--70",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/942574.807122",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "An abstraction provides a statement of the properties
of a data type without any commitment to a specific
implementation. Programs which use abstractions can be
developed and verified without regard to how the
abstraction will be realized. Any type which fulfills
the requirements of the abstraction can be bound in its
place without affecting the program's correctness or
its proof. In [4], the notion of a scheme as a model
for a set of types is developed. A scheme is written as
a module which takes normal values plus types as formal
parameters. Instantiating a scheme with actual
parameters yields a scheme instance which is a data
type. For example, one can write a scheme for AVL trees
[5] which takes the type of the keys in the tree as a
parameter. An instance of this scheme, for example, AVL
trees of strings, is a normal data type.",
acknowledgement = ack-nhfb,
}
@Article{Smith:1976:DBA,
author = "John M. Smith and Diane C. P. Smith",
title = "Data base abstraction",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "71--71",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/942574.807123",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "Real-world systems modelled by data bases are often
quite complex. It is essential that the data base be
structured in a way which supports a users abstractions
about the real-world system. The ``relation'' data type
is introduced as a structuring primitive for relational
data bases The relation data type has similar
abstraction properties to the ``record'' data type of
PASCAL. A data base defined via relation data types is
structured as a hierarchy of n-ary relations. It is
shown that the consistency of this hierarchic structure
can be preserved during update operations by two simple
rules. A top-down methodology for data base design with
relation data types is developed. This methodology
minimizes the number of details with which a designer
must contend at one time. In particular, the
methodology allows the separation of decisions
concerning abstract structure from decisions concerning
key identification. The separation simplifies both
types of decision making for the data base designer.",
acknowledgement = ack-nhfb,
keywords = "Data abstractions; Data base design; Data model;
Programming methodology; Relational model",
}
@Article{Guttag:1976:ADT,
author = "John Guttag",
title = "Abstract data types and the development of data
structures",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "72--72",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/942574.807124",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "Abstract data types can play a significant role in the
development of software that is reliable, efficient,
and flexible. This paper presents and discusses the
application of an algebraic technique for the
specification of abstract data types. Among the
examples presented is a top-down development of a
symbol table for a block structured language, including
a discussion of the proof of its correctness. The paper
also contains a brief discussion of the problems
involved in constructing algebraic specifications that
are both consistent and sufficiently-complete.",
acknowledgement = ack-nhfb,
}
@Article{Bubenko:1976:IRD,
author = "J. A. {Bubenko, Jr.} and S. Berild and E.
Lindencrona-Ohlin and S. Nachmens",
title = "From information requirements to {DBTG}-data
structures",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "73--85",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/942574.807125",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "The problem of determining, analysis and description
of a particular application's information structure
(and relations) and the process of mapping the
information structure to a ``good'' data structure (in
this case a DBTG-type structure) is considered. The
applicability of a top-down oriented design procedure
to a relatively large practical data base design case
is demonstrated. A conceptual framework and a notation
to be used for determining and definition of
information requirements, information structure and
information relations is suggested. A systematic and
partly formalized approach to map an information
structure to a DBTG-type data structure is discussed.
The problem of analysis and evaluation of alternative
DBTG-type structures is also considered.",
acknowledgement = ack-nhfb,
}
@Article{Hardgrave:1976:TIS,
author = "W. T. Hardgrave",
title = "A technique for implementing a set processor",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "86--94",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/942574.807126",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "Extended set theory is an effective method for
describing the complex data structures needed to
support large-scale data base applications. This paper
describes the incorporation of the salient concepts of
extended set theory into a general tool for the design
and implementation of large-scale database systems.
This tool is called a set processor. This
implementation is based on the representation of sets
of positive integers as bit strings and the application
of the Cauchy/Cantor Diagonal Method.",
acknowledgement = ack-nhfb,
}
@Article{Kieburtz:1976:PPV,
author = "Richard B. Kieburtz",
title = "Programming without pointer variables",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "95--107",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/800237.807127",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "The presence of pointer variables in high level
programming languages constitutes an artifact
originally introduced to support the representation of
recursive data structures. Programming practice has
come to rely on pointer variables for their originally
intended use, and for several others as well. Their use
adds to the complexity of stating algorithms by forcing
one to conceptualize data representations in which
storage addressing is made manifest. In addition, the
use of pointer variables allows one to refer to a
common data object by a multiplicity of names, a
phenomenon we call the alias variable problem, Alias
variables make the verification of program behavior
substantially more difficult, and frustrate the goals
of modular decomposition. In this paper, we consider
alternatives to the use of pointer variables in
programming. One of these alternatives is the inclusion
of a class of data abstractions based on recursively
defined data types. The representational power of the
proposed data types is characterized formally, and some
issues of implementation and efficiency of programs are
discussed.",
acknowledgement = ack-nhfb,
}
@Article{Vallarino:1976:UBM,
author = "Oscar Vallarino",
title = "On the use of bit maps for multiple key retrieval",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "108--114",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984344.807128",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "The traditional file structures used to support fast
response to complex user queries have been based on the
inverted list organization, using either the pointer or
bit string representation. In this paper, the use of
bit maps for executing multiple key searches is
studied. Bit maps turn out to be less precise inverted
lists Where the inversion is kept for a quantization of
attribute domains and the objects referenced are blocks
of data records. The goal is to reduce the total number
of I/O accesses required to execute a retrieval based
on a Boolean qualification. An evaluation of the method
is given for both storage space and expected retrieval
time under simplified assumptions. Key Words and
Phrases: Multiple key retrieval, inverted lists, bit
strings, bit maps, Boolean queries, data base
management. CR Categories: 3.70, 3.71, 3.73, 3.74,
4.33, 4.34",
acknowledgement = ack-nhfb,
keywords = "Bit maps; Bit strings; Boolean queries; Data base
management; Inverted lists; Multiple key retrieval",
}
@Article{Berry:1976:CDR,
author = "D. M. Berry and Z. Erlich and C. J. Lucena",
title = "Correctness of data representations (Extended
{Abstract)}: {Pointers} in high level languages",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "115--119",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984344.807129",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "At present, there is considerable debate whether, in
light of what is being learned about construction of
reliable software, pointers are desirable in high level
programming languages. One side [Hoa73, Hoa75]
maintains that 1) Pointers are like the goto in that
they are an invitation to create spaghetti in one's
program [Hoa75]. 2) In some languages, e.g., PL/1
[Wlk71], the use of pointers can lead to serious type
violations, for example, the compiler believes that a
given pointer will be pointing to an integer when in
fact, it will be pointing to a real. 3) The
indiscriminate use of pointers may confound the
attempts of hardware pipelining and use of cache memory
to speed up computations [Hoa73, Hoa75]. 4) A pointer
may be left dangling, that is, a pointer may point to a
variable or other datum which has been deallocated
[Bry71, CDMPS73, Bry74].",
acknowledgement = ack-nhfb,
}
@Article{Gries:1976:SID,
author = "David Gries and Narain Gehani",
title = "Some ideas on data types in high level languages",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "120--120",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/800237.807130",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "We explore some new and old ideas concerning data
types; what a data type is, overloading operators, when
and how implicit conversions between programmer data
types should be allowed and so forth. The current
notion that a data type is a set of values together
with basic operations on that set leads us to conclude
that formal parameter types need not be so explicitly
stated. Given a formal parameter X with operations
{\SGMLsgr}1,...,{\SGMLsgr}n being performed on X within
a procedure, one should be able to supply, as actual
parameters in a call, a variable of any type which has
operations {\SGMLsgr}1,...,{\SGMLsgr}n defined on it.
We introduce a notation for this, using PASCAL as a
base language, illustrate the added flexibility it
gives us, and show briefly how to implement the idea
efficiently.",
acknowledgement = ack-nhfb,
}
@Article{Senko:1976:DIB,
author = "Michael E. Senko",
title = "{DIAM II}: {The} binary infological level and its
database language --- {FORAL}",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "121--140",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/942574.807131",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "The notion of dividing complex problems into
hierarchic levels of abstraction has a long history.
Recently this approach under the name, structured
programming, has been used in a pragmatic way to
simplify the structure of procedural programs. The
notion has also been used in the data base area -
notable early papers include those of Madnick (1) and
Meltzer \1. In these early papers, level structures
(for example, involving logical and physical levels)
were also relatively pragmatic creations. One new
aspect of the DIAM I architecture (3) was that it
defined a detailed, relatively formal basis for four
levels of abstraction and the mappings between these
levels. Each level had a small set of primitive
generalized building blocks, each with its own small
permanent set of parameters. By specifying values for
these parameters, the user could define essentially any
reasonable data structure and file organization he
wished for his stored information.",
acknowledgement = ack-nhfb,
}
@Article{Flon:1976:TCV,
author = "L. Flon and A. N. Habermann",
title = "Towards the construction of verifiable software
systems",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "141--148",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984344.807132",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "Data types are an important design tool because they
allow freedom of abstraction. Thus, they are useful for
constructing large software systems, including
operating systems. It is shown that when dealing with
problems of concurrency, the use of path expressions,
which are associated with data, makes the task of
verification simpler than when the synchronization
conditions are associated with programs.",
acknowledgement = ack-nhfb,
keywords = "Data types; Path expressions; Verification",
}
@Article{Parnas:1976:ATD,
author = "D. L. Parnas and John E. Shore and David Weiss",
title = "Abstract types defined as classes of variables",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "149--154",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984344.807133",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "The concept of ``type'' has been used without a
precise definition in discussions about programming
languages for 20 years. Before the concept of user
defined data types was introduced, a definition was not
necessary for discussions of specific programming
languages. The meaning of the term was implicit in the
small list of possible types supported by the language.
There was even enough similarity between different
languages so that this form of definition allowed
discussions of languages in general. The need for a
widely accepted definition of type became clear in
discussions of languages that allow users to add to the
set of possible types without altering the compiler. In
such languages, the concept of type is no longer
implicitly defined by the set of built-in types. A
consistent language must be based on a clearer
definition of the notion of type than we now have.",
acknowledgement = ack-nhfb,
}
@Article{Housel:1976:HLD,
author = "Barron C. Housel and Nan C. Shu",
title = "A high-level data manipulation language for
hierarchical data structures",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "155--169",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984344.807134",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "In this paper we assert that the hierarchical view of
data will continue to be popular for a broad class of
applications and users. In particular, some of these
applications require complex data manipulation which,
heretofore, has been dealt with procedurally. In this
light, a nonprocedural language, CONVERT, is proposed
as a high-level DBMS interface. CONVERT is meant to
provide users with a tool for performing complex data
manipulation and query of hierarchical data
abstractions, called ``Forms''. Included in the paper
are a description of the Form data abstraction and the
CONVERT language, as well as a complete illustrative
sample application.",
acknowledgement = ack-nhfb,
}
@Article{Wells:1976:DTE,
author = "Mark B. Wells and Fred L. Cornwell",
title = "A data type encapsulation scheme utilizing base
language operators",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "170--178",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/942574.807135",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "A data type encapsulation scheme in which the
``space'' operations are expressed naturally in terms
of the base language operators is described. The scheme
results from a conceptual separation of operators and
procedure calls in the base language and produces a
language of considerable expressive power. The scheme
has been implemented and several examples are given.",
acknowledgement = ack-nhfb,
}
@Article{Koster:1976:VT,
author = "Cornelis H. A. Koster",
title = "Visibility and types",
journal = j-SIGMOD,
volume = "8",
number = "2",
pages = "179--190",
month = mar,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/942574.807136",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:05:56 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "In this paper it is argued that there is a strong
connection between the issue of abstract types and the
more general issue of information hiding in large
program systems, since abstraction has to be enforced
by the careful and controlled hiding of details. In the
first part of the paper, the notions of visibility and
interface are discussed. In the second part, it is
shown how, by careful control of visibility through
interfaces, data abstraction can be achieved. Finally a
comparison is made between this approach and the class
approach.",
acknowledgement = ack-nhfb,
keywords = "Abstract data types; Data abstraction; Information
hiding; Interfaces; Modularity; Visibility",
}
@Article{Lacroix:1976:GJ,
author = "M. Lacroix and A. Pirotte",
title = "Generalized joins",
journal = j-SIGMOD,
volume = "8",
number = "3",
pages = "14--15",
month = sep,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984378.984379",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:06:56 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hardgrave:1976:PBA,
author = "W. T. Hardgrave and E. H. Sibley",
title = "Problems of basic and applied research in database
systems",
journal = j-SIGMOD,
volume = "8",
number = "3",
pages = "16--22",
month = sep,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984378.984380",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:06:56 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Berg:1976:DBD,
author = "John L. Berg",
title = "Data base directions: the next steps",
journal = j-SIGMOD,
volume = "8",
number = "4",
pages = ".3-.4",
month = nov,
year = "1976",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/1041677.1041678",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:00 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "What information about data base technology does a
manager need to make prudent decisions about using this
new technology? To provide this information the
National Bureau of Standards and the Association for
Computing Machinery established a workshop of
approximately 80 experts in five major subject areas.
The five subject areas were auditing, evolving
technology, government regulations, standards, and user
experience. Each area prepared a report contained in
these proceedings. The proceedings provide guidance of
steps managers should follow to prepare themselves and
their organization for the installation of data base
management concepts. The auditing working panel noted
the increased vulnerability of organizations who
integrate their formerly dispersed and redundant files
into a data base and suggest actions to address this
risk. The technology report noted several promising
parallel developments but concluded that the future
would see evolving, rather than revolutionary data base
progress. Government regulations, particularly the
drive for individual privacy rights, were seen to play
an important role in determining data base directions
and the panel's guidance on cost impact suggest that
organizations would experience reduced costs with data
base technology. Standards pervaded all issues and were
found necessary in several sub-areas of data base
technology but the panel saw no immediate likelihood of
national data base standards. The user experience
working panel noted that data base systems had impacted
their organizations to the extent of reconsidering
existing data flows, areas of responsibilities, and
procedures.",
acknowledgement = ack-nhfb,
keywords = "auditing; cost/benefit analysis; data base; data base
management; DBMS; government regulation; management
objectives; privacy; security; standards; technology
assessment; user experience",
}
@Article{Joyce:1977:STR,
author = "John J. Joyce",
title = "{Secretary Treasurer}'s reports",
journal = j-SIGMOD,
volume = "9",
number = "1",
pages = "3--14",
month = jun,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984382.984384",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:02 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bontempo:1977:RBP,
author = "Charles J. Bontempo",
title = "Reviews of books and papers",
journal = j-SIGMOD,
volume = "9",
number = "1",
pages = "29--30",
month = jun,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984382.984386",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:02 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Minker:1977:RED,
author = "Jack Minker",
title = "Review of {'Evaluation of data-base management
systems' by J. P. Fry and E. H. Sibley}",
journal = j-SIGMOD,
volume = "9",
number = "1",
pages = "30--34",
month = jun,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984382.984387",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:02 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Manola:1977:RRD,
author = "Frank Manola",
title = "Review of {'Relational data-base management systems'
by Donald D. Chamberlain}",
journal = j-SIGMOD,
volume = "9",
number = "1",
pages = "34--37",
month = jun,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984382.984388",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:02 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kent:1977:RHD,
author = "W. Kent",
title = "Review of {'Hierarchical data-base management: a
survey' by D. C. Tsichritzis and F. H. Lochovsky}",
journal = j-SIGMOD,
volume = "9",
number = "1",
pages = "38--40",
month = jun,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984382.984389",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:02 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Altshuler:1977:RCR,
author = "Gene Altshuler",
title = "Review of {'A comparison of relational and CODASYL
approaches to data-base management' by A. S. Michaels,
B. Mittman, and C. R. Carlson}",
journal = j-SIGMOD,
volume = "9",
number = "1",
pages = "40--42",
month = jun,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984382.984390",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:02 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gudes:1977:TDB,
author = "Ehud Gudes",
title = "Teaching data base systems using date and computing
surveys",
journal = j-SIGMOD,
volume = "9",
number = "1",
pages = "47--49",
month = jun,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984382.984392",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:02 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gerritsen:1977:SMD,
author = "Rob Gerritsen and Howard Morgan and Michael Zisman",
title = "On some metrics for databases or what is a very large
database?",
journal = j-SIGMOD,
volume = "9",
number = "1",
pages = "50--74",
month = jun,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984382.984393",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:02 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Vineberg:1977:ICS,
author = "Maniel Vineberg",
title = "Implementation of character string pattern matching on
a multiprocessor",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "1--7",
month = may,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/965645.810246",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:14 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "An algorithm to do pattern matching, a basic character
string operation, is presented. The Programmable
Algorithm Machine (PAM), a proposed special-purpose
computer which will feature multiple processing
elements and operate efficiently over a wide class of
applications, is described. It is shown that the
multiple processing elements of the PAM allow
concurrent execution of independent operations both in
a special case of the pattern matching algorithm, where
the string sizes (lengths) are known at compile time,
and in the general case, where the sizes are not
known.",
acknowledgement = ack-nhfb,
}
@Article{Bird:1977:APP,
author = "R. M. Bird and J. C. Tu and R. M. Worthy",
title = "Associative\slash parallel processors for searching
very large textual data bases",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "8--9",
month = may,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/965645.810247",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:14 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "This paper describes an approach to solving a major
problem in the information processing sciences --- that
of searching very large (5-50 billion characters) data
bases of unstructured free-text for random queries
within a reasonable time and at an affordable price.
The need by information specialists and knowledge
workers for large, fast low-cost text and document
retrieval systems is growing rapidly. Conventional
approaches to the problem have usually depended upon
expensive, general purpose computers, upon special
pre-preprocessing of the textual data (e.g. file
inverting, indexing, abstracting, etc.), and upon
elaborate, costly software. The resulting retrieval
systems often cost hundreds of dollars per query and
the full scanning of an uninverted, unstructured
billion byte textual data base could take hours of
computer services. However, in spite of these
restrictions, such full text search systems have proved
useful and even indispensible for many applications.
Computer technology of the late 1960's and the 1970's,
in both hardware and software (e.g., minicomputers,
low-cost, high density disk storage, ``chip''
electronics, natural language query systems, etc.),
have made i t practical to build special purpose,
low-cost text retrieval systems. Such a system has been
built, tested, and is now in a production stage. The
system called the Associative File Processor (AFP),
utilizes a conventional minicomputer (DEC's PDP-11/45)
for control, off-the-shelf high density disks for
storage, a special purpose parallel search module as a
text term detector, and query and retrieval software.
The AFP is currently being field tested at two sites.
Full text, parallel searches on un-preprocessed textual
data bases are being performed at the effective
matching rates of 4 billion bytes per second (8K byte
key memory times 500 Kbyte/second data stream).
Estimated costs are 10 to 25 cents per query for a one
billion byte data base. The costs per query and the
time for searching increase in a linear fashion as data
base increases. A basic architecture for the AFP is
described and an implemented version is discussed. A
more powerful term detector module is also under
development. This system is designed around a finite
state automaton algorithm.",
acknowledgement = ack-nhfb,
}
@Article{Lipovski:1977:IFT,
author = "G. J. Lipovski",
title = "On imaginary fields, token transfers and floating
codes in intelligent secondary memories",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "17--22",
month = may,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/965641.810248",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:14 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "In analyzing two implemented intelligent secondary
memories, CASSM and RAP, we recognize a common
mechanism which is here called an imaginary field. The
mechanism can be generalized to suggest further design
possibilities. It further explains the complex and
controversial CASSM mechanism, ``pointer transfer'' in
terms of separate but related principles --- imaginary
fields, token transfers, and floating codes --- such
that further designs can utilize some or all of the
techniques.",
acknowledgement = ack-nhfb,
}
@Article{Zaky:1977:MNN,
author = "S. G. Zaky",
title = "Microprocessors for non-numeric processing",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "23--30",
month = may,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/965641.810249",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:14 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "The problem of processing of non-numeric data has
received considerable attention in the last few years.
This is primarily motivate by the pressing needs in the
are a of data base management. It has long been
recognized that the parallel processing capabilities of
an associative processor are fundamentally well suited
to this environment. However, the complexity and cost
of truly associative memories make this approach
impractical. In this paper, the demands that
non-numeric processing place on memory and processor
hardware are discussed. Some emerging trends are
presented, and a suggestion is given regarding the
development of a ``general purpose'' microprocessor
that is suited to this environment. Basically, the
microprocessor discussed here is capable of performing
simple search and update functions on a high speed,
serial data stream. Therefore, it is suited to any
application where such a situation is encountered, such
as in digital communications.",
acknowledgement = ack-nhfb,
}
@Article{Hsiao:1977:ADC,
author = "David K. Hsiao and Krishnamurthi Kannan",
title = "The architecture of a database computer --- a
summary",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "31--33",
month = may,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/965641.810250",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:14 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "The motivation for seeking hardware solutions to
database management functions traditionally carried out
by software has been apparent to data-base designers
for sometime now. Firstly, database management software
has grown in complexity and size over the years. This
growth is prompted by the increase in user
requirements, by the formulation of sophisticated
models and by the change in data processing mode from
an off-line, batched, single user environment to an
on-line, concurrent and multi-user environment. Large
and complex software systems tend to be failure-prone.
Further-more, practical verification methods for
software systems are still not in sight. On the other
hand, methods for verifying hardware functionality,
design and production have long been available.
Advanced technology has also overcome some of the
problems of the logic complexity and capacity
requirements, making the construction of relatively
large and complex computers viable. By incorporating
basic database management functions into hardware, not
only can we provide more reliable basic functions, but
we can also improve the software reliability since the
software requirements will be less complex and the
system software will be smaller in size.",
acknowledgement = ack-nhfb,
}
@Article{Rosenthal:1977:DMM,
author = "Robert S. Rosenthal",
title = "The data management machine, a classification",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "35--39",
month = may,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/965641.810251",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:14 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "There has been much interest in the use of special
purpose processors as the data base management
component of data processing systems. The generic terms
``backend'' and ``data management machine'' have been
applied to such devices. Examination of the literature
reveals a broad cross section of host to backend
functional distribution and interconnection
methodology. This discussion represents an attempt to
examine and classify several of these backend data base
management machine configurations in terms of their
operational parameters and application constraints. A
formal taxonomy of such systems remains yet to be
performed. At least three distinct classes of data
management machine (DMM) are evidenced in the
literature; they are the large host backend,
distributed network data node and smart peripheral. The
intended classes of problem that the various authors
envision amenable to solution by the DMM approach
exhibit overlap while the performance envelope in which
each DMM architecture would provide a technically
acceptable, economically sound solution to a given user
requirement set varies. Some of the papers used as
source for this work contained no explicit mention of
either the problem classes or performance constraints
that the described configuration was to address; thus
liberty has been taken in interpreting the implicit
application goals of these authors.",
acknowledgement = ack-nhfb,
}
@Article{McDonell:1977:TNS,
author = "Ken J. McDonell",
title = "Trends in non-software support for input-output
functions",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "40--47",
month = may,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/965641.810252",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:14 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "Input-output subsystem architectures have evolved over
the past 20-odd years to the point where two divergent
approaches have found acceptance in current computer
systems; the 'IBM channel' is the archetype of the
lower level alternative, while the functionally more
complex techniques involve a wide spectrum of
distributed processor architectures supporting database
and/or storage management functions independently with
respect to the central processor. The paper traces the
historical development of support (outside central
processor based software) for input-output functions
and concludes with a preliminary comparison of the
relative merits of the software interfaces provided by
the alternative input-output subsystem architectures.",
acknowledgement = ack-nhfb,
}
@Article{Cerretti:1977:UIP,
author = "R. Cerretti and D. Jasilli and D. R. Matteucci",
title = "{Ulisse}: {An Italian} project for a multifunctional
terminal system",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "48--50",
month = may,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/965641.810253",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:14 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "The paper describes a project conducted in
collaboration between CNUCE, an Institute of the
Italian National Research Council, and a private
research center, concerning a multifunctional system
(Ulisse) capable of operating both as a stand alone
unit for office administration and automation (word
processing, file management and retrieval) and as an
intelligent terminal with local facilities for text
editing, text formatting and storage. The first results
of the application of Ulisse in the environment of the
scientific users of CNUCE are illustrated.",
acknowledgement = ack-nhfb,
}
@Article{Bray:1977:DMR,
author = "Olin H. Bray",
title = "Data management requirements: {The} similarity of
memory management, database systems, and message
processing",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "68--76",
month = may,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/800180.810254",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:14 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "Memory management, database management, and message
processing have in the past been defined in a
relatively narrow way. With memory management the
problem was to obtain cost effective use of real
memory. Given a multiprogrammed environment, virtual
memory systems allowed more effective use of expensive
real memory. Memory management has become even more
important with the development of very large and
complex memory hierarchies. Database management systems
were developed to allow the more effective use,
sharing, and control of data resources - objectives
which operating systems had previously provided for
hardware resources. The driving force behind message
processing has been the increased use of data
communications and computer networks. This paper will
consider the basis of the overlap in these areas, their
common data management functions. Data management, as
defined in this paper, includes the locating, routing,
moving, and translating of data resources and the
locating, reserving, and releasing of physical
resources, i.e., primary and secondary storage. The
analysis performed in this paper is essential because
of trends in computer architecture discussed below.
Early hardware was designed for general purpose
environments with software used to tailor it to
specific applications. However, according to Gagliardi9
future systems will consist of a set of subsystems,
including a storage subsystem at the core surrounded by
computational, spooling, and communications subsystems.
The computational subsystem is the traditional ``number
cruncher'' part of the system. The spooling subsystem
provides the I/O interface between the system and the
outside world. The communications subsystem links the
various subsystems together and provides an interface
to the rest of the network if the system is part of a
larger distributed system. The storage subsystem
consists of all the system's storage resources and
their control processes. It controls all levels of the
system memory and storage hierarchy. The storage
subsystem controls the allocation of the physical
storage resources and the movement of the data
resources through the system. Depending on how these
resources are used, they may be non-conserved or
conserved, and if conserved, either serially reusable
or sharable. Physical and data resources may be
located, and if necessary reserved, independently or
jointly.",
acknowledgement = ack-nhfb,
}
@Article{Landson:1977:CSA,
author = "Barry M. Landson and Robert G. Sargent",
title = "A comparison of sequential and associate computing of
priority queues",
journal = j-SIGMOD,
volume = "9",
number = "2",
pages = "77--78",
month = may,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/965641.810255",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:14 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "A comparison of priority queues on four different
types of computer memories are made by ring a model to
determine the total time to do comparable tasks. The
four types of memories compared are random access
(RAM), associate (AM), hybrid consisting of an
associate memory and a random access memory (AM/RAM),
and the hybrid memory with an auxiliary memory having
the capability to perform Lewin's Associate algorithm],
(AM/RAM/AML). The model used for the comparisons is an
extension of the MIX model developed by Knuth [1]. The
MIX model was extended to include the four types of
memories and the instruction set expanded to include
instructions for the memories added. This model allows
direct comparisons to be made of the different
architectures and different software algorithms in
performing the same tasks.",
acknowledgement = ack-nhfb,
keywords = "MIX (virtual machine)",
}
@Article{Joyce:1977:PST,
author = "John D. Joyce",
title = "From the past {Secretary Treasurer}",
journal = j-SIGMOD,
volume = "9",
number = "3",
pages = "5--10",
month = dec,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984395.984397",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:36 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Tsichritzis:1977:RDD,
author = "D. Tsichritzis",
title = "Research directions in data base management systems",
journal = j-SIGMOD,
volume = "9",
number = "3",
pages = "26--41",
month = dec,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984395.984399",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:36 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sinutko:1977:DMS,
author = "M. Sinutko",
title = "Database management systems on a multi-computer
computer",
journal = j-SIGMOD,
volume = "9",
number = "3",
pages = "42--62",
month = dec,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984395.984400",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:36 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "This paper discusses fitting a database and database
management system onto a particular research status
computer constructed of a large array or network of
closely-connected component computers. The findings may
have application to other distributed computer
architectures.",
acknowledgement = ack-nhfb,
}
@Article{Odell:1977:CSS,
author = "James J. Odell",
title = "Customized segment synthesis",
journal = j-SIGMOD,
volume = "9",
number = "3",
pages = "63--68",
month = dec,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984395.984401",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:36 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "Segment design is a process which must be exercised by
every data-base designer. This paper presents an easily
automated method of designing segments taking into
account system-usage factors. The segments resulting
from this algorithm are a subset of all possible
synthesis solutions; but they are those results which
may be of more importance to the D.B. designer.",
acknowledgement = ack-nhfb,
}
@Article{Party:1977:BCS,
author = "The Data Dictionary Systems Working Party",
title = "The {British Computer Society Data Dictionary Systems
Working Party} report",
journal = j-SIGMOD,
volume = "9",
number = "4",
pages = "2--24",
month = dec,
year = "1977",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/1017814.1017610",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:42 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Korfhage:1978:DPU,
author = "R. R. Korfhage and W. H. E. Day and L. L. Beck and W.
F. Appelbe",
title = "Data physics: an unorthodox view of data and its
implications in data processors",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "1--7",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982998.983000",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Copeland:1978:SSS,
author = "George P. Copeland",
title = "String storage and searching for data base
applications: implementation on the {INDY} backend
kernel",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "8--17",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983026.983002",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "User and hardware cost trends dictate that data base
systems should provide more complete functionality,
simplicity of use, and reliability by increasing the
amount of hardware present in the system. These goals
are accomplished with a simple hardware arrangement
within a one-dimensional cellular storage system called
INDY. The INDY backend kernel is intended as a powerful
tool for implementing all data models. The INDY
cellular storage array is intended to provide
functionality that is difficult to implement
efficiently using a conventional hardware arrangement.
It allows a simple implementation of improved data
independence at high speeds. INDY simultaneously
satisfies the time windows of future hardware
technologies and user requirements. The importance of
strings as a mechanism for defining abstract data types
for data base languages is discussed in more detail in
another paper. In that paper, a language called STRING
is introduced which allows names of data objects to be
semantically defined as variable-length strings and
compared based on string pattern membership. This paper
is concerned with the implementation of string storage
and searching required by the STRING language.
Implementation of higher level structures and searching
requirements (such as sets, rows, tables and
hierarchies) on the INDY kernel is treated elsewhere.",
acknowledgement = ack-nhfb,
}
@Article{Otis:1978:ERD,
author = "Allen J. Otis and George P. Copeland",
title = "Editing requirements for data base applications and
their implementation on the {INDY} backend kernel",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "18--29",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983026.983003",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "An extrapolation of user and hardware cost trends
indicate that future systems should provide more
complete functionality, simplicity of use, and
reliability by increasing the amount of hardware
present in the system. For data base systems, this can
be done by providing very high level data languages and
by implementing them directly in hardware. These goals
are realized with a simple hardware arrangement called
INDY, which uses inexpensive memory technologies (such
as charge coupled devices, magnetic bubbles, or discs).
This paper first discusses the data definition and
editing requirements of data languages. Then the
implementation of these requirements on the INDY
backend kernel is described. Finally, a comparison is
made of the various memory technologies for suitability
to INDY.",
acknowledgement = ack-nhfb,
}
@Article{Lipovski:1978:SPI,
author = "G. Jack Lipovski",
title = "Semantic paging on intelligent discs",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "30--34",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982994.983005",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "In order to apply Artificial Intelligence techniques
like inferencing to large (10$^9$ -10$^{12}$ bit) data
bases, an intelligent secondary memory is proposed that
is capable of extracting a subgraph from a graph stored
in it for further processing in a conventional or
special purpose computer. The 'pointer transfer'
technique developed for CASSM is used to efficiently
mark and output a subgraph stored in one file, and a
simple technique is proposed to link parts of the
subgraph stored on different files. Besides proposing a
useful secondary memory system for applying Artificial
Intelligence techniques to large data bases, this paper
attacks one of the most difficult problems in
distributed data base systems, which is the generation
of 'homomorphic query fragments' that automatically
carry the query from one file to other files needed to
resolve the query.",
acknowledgement = ack-nhfb,
}
@Article{Williams:1978:MSD,
author = "Rhon Williams",
title = "A multiprocessing system for the direct execution of
{LISP}",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "35--41",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982998.983006",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "Current implementations were found to be impractical
for airborne use due to LISP's incompatibility with
conventional computer architectures. Direct execution
of LISP with tasks distributed between three
processors, seemed to be a workable solution. The
language was analyzed, and a special token was devised,
using a descriptor with a single pointer. Through
careful distribution of responsibilities, control and
data flow between the processors was minimized.
Significant memory savings resulted from ASCII storage
and real time garbage collection. A simulation was used
to help estimate execution times and showed a factor of
50 to 100 increase in speed. Thus, through the direct
execution of LISP by a multiprocessing system,
Computer-Aided Decision-Making could be implemented to
enhance the safety of flight operations.",
acknowledgement = ack-nhfb,
}
@Article{Bird:1978:TFI,
author = "R. M. Bird and J. B. Newsbaum and J. L. Trefftzs",
title = "Text file inversion: an evaluation",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "42--50",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982994.983008",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "This paper compares inversion of text files with
inversion of more structured records. The unique
characteristics of textual data which restrict the
utility of inversion are identified and discussed.
Inversion is shown to be useful only for small, static
data bases, and when full text search is not
required.",
acknowledgement = ack-nhfb,
}
@Article{Roberts:1978:SCA,
author = "David C. Roberts",
title = "A specialized computer architecture for text
retrieval",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "51--59",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983026.983009",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "This paper describes a specialized computer
architecture for text retrieval that provides a wide
range of query capabilities, without the use of indexes
of the material retrieved. A distributed approach is
employed, with direct search processors. Each search
processor is closely associated with one or more disk
drives that store the data to be searched and each
consists of a comparator for matching query terms,
logic elements to combine query terms, a disk
controller and a control minicomputer. The key element
of the architecture is the comparator, which can store
over 64,000 characters of query terms and compare all
of these terms simultaneously with data arriving from a
disk continuously at more than one million bytes per
second. Exact match, partial match, numeric comparison
and context limitation are among the capabilities
provided. The comparator is implemented as three
similar universal finite-state automata, with special
features to facilitate text retrieval and reduce
hardware costs. A breadboard version of the system with
one searcher is operational and has undergone detailed
evaluation. A prototype system with two searchers is
being implemented and will be placed into regularly
scheduled use.",
acknowledgement = ack-nhfb,
}
@Article{Stucki:1978:CCA,
author = "M. J. Stucki and J. R. Cox and G. C. Roman and P. N.
Turcu",
title = "Coordinating concurrent access in a distributed
database architecture",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "60--64",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982994.983011",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "A distributed architecture for an interactive
information system is described, and a scheme for
coordinating concurrent access to its data is
presented. The scheme is deadlock free and is carried
out without the need for centralized control. Conflicts
are detected as they occur, and competing processes are
given exclusive access to the data they need.",
acknowledgement = ack-nhfb,
}
@Article{Gouda:1978:HCC,
author = "Mohamed G. Gouda",
title = "A hierarchical controller for concurrent accessing of
distributed databases",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "65--70",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982994.983012",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "An access controller for a distributed database is a
(central or distributed) structure which routes access
requests to the different components of the database.
Such a controller is also supposed to resolve the
conflicts between concurrent requests, if any, such
that deadlock situations never arise. In this paper,
some architectures for distributed access controllers
of distributed databases are investigated. In
particular, three controllers with hierarchical
architectures are considered. The controllers are
evaluated based on three criteria: (i) freedom of
deadlocks, (ii) robustness, and (iii) parallelism. The
third criterion implies that the added redundancy to
increase the controller robustness against failure
conditions should also contribute to the amount of
achieved parallelism during the no-failure periods. We
then define a controller architecture which satisfies
all the three criteria.",
acknowledgement = ack-nhfb,
}
@Article{Gavish:1978:EAD,
author = "Bezalel Gavish and Harvey Koch",
title = "An extensible architecture for data flow processing",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "71--76",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982998.983014",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "In this research, we propose a general model for
computer architectures. This model allows us to
integrate some of the existing system architecture
approaches for increasing computer capacity and
indicates new possibilities for improving the
cost/performance ratio of future computer systems. The
model leads to the development of general purpose data
flow machines and to different degrees of
sophistication within these machines. Our fundamental
approach is to separate the CPU into elementary
components. This allows us to make a distinction
between components for control and components for
performing various processing functions, thus yielding
a high degree of resource sharing.",
acknowledgement = ack-nhfb,
}
@Article{Harvill:1978:FPO,
author = "J. B. Harvill",
title = "Functional parallelism in an operand state saving
computer",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "77--84",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982998.983015",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "Multiple, high-level operators are assigned to a
general operand. The operators are implemented with
individual micro-processors and are 'attached'
dynamically to the memory location representing the
'current' value of the operand. The operators then
asynchronously use each new operand value as it is
stored and perform their operations in parallel. The
proposed architecture represents a true M I S D
(Multiple Instruction Stream - Single Data Stream)
computer. Its architecture can provide effective
parallelism and reduced programming complexity for a
large class of both numeric and non-numeric computer
problems.",
acknowledgement = ack-nhfb,
}
@Article{Hutchison:1978:MM,
author = "J. S. Hutchison and W. G. Roman",
title = "Madman machine",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "85--90",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982994.983017",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "A back-end data base machine is discussed in which the
back-end is closely coupled to the host system as an
intelligent I/O device. The design of the hardware and
software is such that the data base disks can be on
either the host or back-end computers. The design is
motivated by memory size considerations on
mini-computer systems and also by cost considerations
of large disks. The implementations of such a system on
PDP-11s is discussed.",
acknowledgement = ack-nhfb,
}
@Article{Banerjee:1978:UDM,
author = "Jayanta Banerjee and David K. Hsiao",
title = "The use of a database machine for supporting
relational databases",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "91--98",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982994.983018",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "One of the goals in the design of database machines of
the future is their generality. In addition to being
capable of carrying out the common database management
functions with high reliability and performance, some
of these machines are intended to support more than one
data model. A specific database machine, known as the
DBC, is intended to support several existing data
models. Although the DBC supports many data models, we
single out the relational data model for this
discussion. In particular, we have tried to concentrate
mainly on the subject of database representation and
query translation of System R-like database management
systems. Some estimates of the storage requirements and
performance gains are given in this paper. However, due
to limited space, the detailed analysis is shown
elsewhere in [22].",
acknowledgement = ack-nhfb,
}
@Article{Sadowski:1978:EPR,
author = "Paul J. Sadowski and S. A. Schuster",
title = "Exploiting parallelism in a {Relational Associative
Processor}",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "99--109",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982998.983019",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "The Relational Associative Processor (RAP) is a
special purpose non-numeric back-end processor used in
supporting general Data Base Management Systems. In
particular, it is ideally suited for supporting a
relational data base. The architecture and instruction
set of RAP are discussed in this context. It is the
purpose of this paper to show that RAP performance can
be enhanced considerably by more fully exploiting its
parallel nature. It is shown that a greater degree of
concurrent activity will result in better overall
performance. An operating system executive to support
this high level of concurrency is proposed and modelled
using simulation techniques. Both the analytic and
simulation results support the value of the
proposals.",
acknowledgement = ack-nhfb,
}
@Article{Chang:1978:BRD,
author = "Hsu Chang",
title = "Bubbles for relational database",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "110--116",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982998.983021",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "The mechanical disk storage is limited by long initial
delay, few inputs/outputs, and serial access, thus
necessitating large complex programs in existing
database systems in order to map the user's view into
the physical storage and to provide different access
paths in response to different queries. Bubble devices
are capable of set-oriented processing and associative
addressing architecture. This paper presents concepts
on data structure, storage structure, and access
methods for bubble implementation of relational
database.",
acknowledgement = ack-nhfb,
}
@Article{Masri:1978:MIR,
author = "A. El Masri and J. Rohmer and D. Tusera",
title = "A machine for information retrieval",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "117--120",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982994.983023",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Matteucci:1978:DSA,
author = "Dante R. Matteucci",
title = "A distributed structure for the automization of the
catalog of the national cultural heritage: experiences
and proposals",
journal = j-SIGMOD,
volume = "10",
number = "1",
pages = "121--133",
month = aug,
year = "1978",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982994.983024",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:07:44 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "Efforts to automate the handling of information
concerning the Catalog of the Italian cultural and
artistic heritage have been made in the past by the
Institute for the Catalog and Documentation (ICCD) of
the Ministry of Cultural and Environmental Heritage. A
feasibility study for the realization of a data base of
the national cultural heritage has been conducted by
CNUCE, the scientific computing center of the Italian
National Research Council and ICCD. This study led to
the determination of the characteristics of data
contained on the record cards, to the location of some
samples areas, sufficiently representative of the
Italian situation, for the setting up of a model of
information system and to the implementation of a data
bank on CNUCE computers using the IBM STAIRS
information retrieval system. Following this study, a
project is presently conducted by the two institutions,
with the aim of setting up a distributed structure for
the preparation, acquisition, access to and
dissemination of the information concerning the Italian
cultural and artistic heritage. This paper describes
the functions of this proposed structure, with
reference to the results of the first experiences and
implementations.",
acknowledgement = ack-nhfb,
}
%% ACM Portal lacks data for v10 n2-3 (August 1979)
%% ACM Portal lacks data for v10 n4 (March 1980)
@Article{Bernstein:1981:EPS,
author = "Philip A. Bernstein and Marco A. Casanova and Nathan
Goodman",
title = "Errors in {'Process Synchronization in Database
Systems'}",
journal = j-SIGMOD,
volume = "11",
number = "1",
pages = "9--29",
month = jan,
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984471.984472",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:10 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "This paper disproves several results pertaining to
database concurrency control that are claimed in [8].
The results we disprove are{\bullet}theorems 3.1, 3.2,
3.6 -- which claim a polynomial time algorithm for
testing whether transaction schedules are serializable,
and{\bullet}theorems 4.2 and 4.7 -- which claim a
necessary and sufficient mechanism for preserving the
'weak consistency' of databases. In addition, we
demonstrate that the notion of 'weak consistency'
introduced in [8] admits database states that are
strictly inconsistent.",
acknowledgement = ack-nhfb,
}
@Article{Rowe:1981:AFD,
author = "Lawrence A. Rowe and Michael Stonebraker",
title = "Architecture of future data base systems",
journal = j-SIGMOD,
volume = "11",
number = "1",
pages = "30--44",
month = jan,
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984471.984473",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:10 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Mylopoulos:1981:OKR,
author = "John Mylopoulos",
title = "An overview of {Knowledge Representation}",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "5--12",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:TAI,
author = "Anonymous",
title = "Tutorial on artificial intelligence research",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "13--18",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{McLeod:1981:AD,
author = "Dennis McLeod and John Miles Smith",
title = "Abstraction in databases",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "19--25",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:TDR,
author = "Anonymous",
title = "Tutorial on database research",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "26--28",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rowe:1981:DAP,
author = "Lawrence A. Rowe",
title = "Data abstraction from a programming language
viewpoint",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "29--35",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:TPL,
author = "Anonymous",
title = "Tutorial on programming language research",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "36--39",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:WSM,
author = "Anonymous",
title = "What should be modelled?",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "40--42",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:T,
author = "Anonymous",
title = "Types",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "43--52",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:B,
author = "Anonymous",
title = "Behaviour",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "53--61",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:P,
author = "Anonymous",
title = "Presentation",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "62--71",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:CM,
author = "Anonymous",
title = "Consistency of models",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "72--76",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:RBA,
author = "Anonymous",
title = "Relationships between and among models",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "77--82",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:AMT,
author = "Anonymous",
title = "Application of modelling techniques",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "83--87",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1981:WS,
author = "Anonymous",
title = "Workshop Summary",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "88--90",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Albano:1981:IIS,
author = "Antonio Albano and Renzo Orsini",
title = "An interactive integrated system to design and use
data bases",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "91--93",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Amble:1981:IDB,
author = "Tore Amble",
title = "Integration of data base design in programming
languages",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "94--94",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Balzer:1981:DSS,
author = "Robert M. Balzer",
title = "Dynamic system specification",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "95--97",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Borgida:1981:DAE,
author = "Alexander T. Borgida and Sol Greenspan",
title = "Data and activities: Exploiting hierarchies of
classes",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "98--100",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Brodie:1981:DAD,
author = "Michael L. Brodie",
title = "Data abstraction for designing database-intensive
applications",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "101--103",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Buneman:1981:UDT,
author = "Peter Buneman and Ira Winston",
title = "The use of data type information in an interactive
database environment",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "104--106",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Carbonell:1981:DRI,
author = "Jaime G. Carbonell",
title = "Default reasoning and inheritance mechanisms on type
hierarchies",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "107--109",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Cattell:1981:IDS,
author = "R. G. G. Cattell",
title = "Integrating a database system and programming \slash
information environment",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "110--111",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Codd:1981:DMD,
author = "E. F. Codd",
title = "Data models in database management",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "112--114",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Cristian:1981:SBC,
author = "Flaviu Cristian",
title = "On the specification of behavioural constraints",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "115--117",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Deutsch:1981:CUM,
author = "L. Peter Deutsch",
title = "Constraints: {A} uniform model for data and control",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "118--120",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Feather:1981:SCC,
author = "Martin S. Feather",
title = "Some contrasts and considerations of an approach to
modelling",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "121--123",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Goldstein:1981:INS,
author = "Ira Goldstein",
title = "Integrating a network-structured database into an
object-oriented programming language",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "124--125",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hardgrave:1981:PDM,
author = "W. Terry Hardgrave and Donald R. Deutsch",
title = "Processing data model abstractions",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "126--127",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hayes:1981:LVT,
author = "Patrick J. Hayes and Gary G. Hendrix",
title = "A logical view of types",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "128--130",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hendrix:1981:MVD,
author = "Gary G. Hendrix",
title = "Mediating the views of databases and database users",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "131--132",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hitchcock:1981:DDO,
author = "Peter Hitchcock",
title = "Data dictionaries in open system communication",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "133--134",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Katz:1981:HDH,
author = "Randy H. Katz",
title = "Heterogeneous databases and high level abstraction",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "135--137",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{King:1981:MCR,
author = "Jonathan J. King",
title = "Modelling concepts for reasoning about access to
knowledge",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "138--140",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kreps:1981:RVC,
author = "Peter Kreps",
title = "Relativism and views in a conceptual data base model",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "141--143",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lacroix:1981:ATD,
author = "Michel Lacroix and Alain Pirotte",
title = "Associating types with domains of relational data
bases",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "144--146",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Leavenworth:1981:DAA,
author = "B. Leavenworth",
title = "A data abstraction approach to database modelling",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "147--149",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Levesque:1981:IKB,
author = "Hector J. Levesque",
title = "Incompleteness in knowledge bases",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "150--152",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lundberg:1981:AIM,
author = "Bengt Lundberg and Janis A. {Bubenko, Jr.}",
title = "Axiomatic information modeling",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "153--154",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Mark:1981:UDO,
author = "William Mark",
title = "Use of database organization in the {Consul} system",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "155--157",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Mayr:1981:MMD,
author = "Heinrich C. Mayr",
title = "Make more of data types",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "158--160",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{McLeod:1981:CDM,
author = "Dennis McLeod",
title = "On conceptual database modelling",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "161--163",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Meyer:1981:TLA,
author = "Bertrand Meyer",
title = "A three-level approach to the description of data
structures, and notational framework",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "164--166",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Mylopoulos:1981:PRC,
author = "John Mylopoulos",
title = "A perspective for research on conceptual modelling",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "167--170",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Paolini:1981:ADT,
author = "Paolo Paolini",
title = "Abstract data types and Data Bases",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "171--173",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Reiter:1981:DBL,
author = "Raymond Reiter",
title = "Data bases: {A} logical perspective",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "174--176",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rich:1981:MPV,
author = "Charles Rich",
title = "Multiple points of view in modelling programs",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "177--179",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rowe:1981:IDD,
author = "Lawrence A. Rowe",
title = "Issues in the design of database programming
languages",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "180--182",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{dosSantos:1981:TCA,
author = "C. S. dos Santos and A. L. Furtado and J. M. V. de
Castilho and S. E. R. de Carvalho",
title = "Towards constructive axiomatic specifications",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "183--185",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Schmidt:1981:DAT,
author = "Joachim W. Schmidt",
title = "Data abstraction tools: Design, specification and
application",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "186--188",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Shaw:1981:ADT,
author = "Mary Shaw",
title = "Abstraction, data types, and models for software",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "189--191",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sibley:1981:DMS,
author = "E. H. Sibley",
title = "Database management systems past and present",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "192--192",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sowa:1981:CSK,
author = "John F. Sowa",
title = "A conceptual schema for Knowledge-based systems",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "193--195",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Thatcher:1981:DAD,
author = "J. W. Thatcher",
title = "Data abstraction, data bases and conceptual modelling
(Position Paper)",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "196--197",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wasserman:1981:EDA,
author = "Anthony I. Wasserman",
title = "The extension of data abstraction to database
management",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "198--200",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Weber:1981:DTU,
author = "Herbert Weber",
title = "Are data types universal modelling concepts for data
base systems?",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "201--202",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wedekind:1981:CAD,
author = "Hartmut H. Wedekind",
title = "{Constructive Abstract Data} types ({CAD})",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "203--206",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Zilles:1981:TAM,
author = "Stephen N. Zilles",
title = "Types, algebras and modeling",
journal = j-SIGMOD,
volume = "11",
number = "2",
pages = "207--209",
month = feb,
year = "1981",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:23 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Knowles:1981:DAA,
author = "Stephen Knowles",
title = "Database activity at {Aberdeen University Computing
Centre}",
journal = j-SIGMOD,
volume = "11",
number = "3",
pages = "6--6",
month = apr,
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984480.984481",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:15 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Schlageter:1981:REP,
author = "G. Schlageter",
title = "Reply to {'Errors in 'Process synchronization in
database systems''}",
journal = j-SIGMOD,
volume = "11",
number = "3",
pages = "7--9",
month = apr,
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984480.984482",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:15 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wiederhold:1981:RKB,
author = "Gio Wiederhold and S. Jerrold Kaplan and Daniel
Sagalowicz",
title = "Research in knowledge base management systems",
journal = j-SIGMOD,
volume = "11",
number = "3",
pages = "26--54",
month = apr,
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984480.984483",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:15 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Berg:1981:TR,
author = "John Berg",
title = "{Treasurer}'s report",
journal = j-SIGMOD,
volume = "11",
number = "4",
pages = "7--7",
month = jul,
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984488.984489",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:20 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Katz:1981:CSS,
author = "Randy H. Katz",
title = "On the criteria for selecting the site of the annual
{SIGMOD} conference",
journal = j-SIGMOD,
volume = "11",
number = "4",
pages = "8--11",
month = jul,
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984488.984490",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:20 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rosenthal:1981:NES,
author = "Arnon S. Rosenthal",
title = "Note on the expected size of a join",
journal = j-SIGMOD,
volume = "11",
number = "4",
pages = "19--25",
month = jul,
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984488.984491",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:20 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Trueblood:1981:MDS,
author = "Robert P. Trueblood and H. Rex Hartson",
title = "{MULTISAFE}: a data security architecture",
journal = j-SIGMOD,
volume = "11",
number = "4",
pages = "26--31",
month = jul,
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984488.984492",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:20 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Elmasri:1981:NDA,
author = "Ramez Elmasri and Cory Devor and Said Rahimi",
title = "Notes on {DDTS}: an apparatus for experimental
research in distributed database management systems",
journal = j-SIGMOD,
volume = "11",
number = "4",
pages = "32--49",
month = jul,
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984488.984493",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:20 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lochovsky:1981:RDM,
author = "Fred H. Lochovsky",
title = "Review of {'Data models: a semantic approach for
database systems' by Sheldon A. Borkin. The MIT Press
1980}",
journal = j-SIGMOD,
volume = "12",
number = "1",
pages = "16--17",
month = oct,
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984497.984498",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:30 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kilov:1981:MDA,
author = "Kn. I. Kilov and I. A. Popova",
title = "Meta-database architecture for relational {DBMS}",
journal = j-SIGMOD,
volume = "12",
number = "1",
pages = "18--25",
month = oct,
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984497.984499",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:30 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "The architecture of an implementable relational DBMS
is discussed, the meta-database for which is organized
in the form of a set of text tables. Methodology for
working with text is shown (including automatic
coding), as well as semantic text control. A schematic
example of a meta-database is shown.",
acknowledgement = ack-nhfb,
}
@Article{Furtado:1981:HDI,
author = "A. L. Furtado",
title = "Horizontal decomposition to improve a non-{BCNF}
scheme",
journal = j-SIGMOD,
volume = "12",
number = "1",
pages = "26--32",
month = oct,
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984497.984500",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:30 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Beeri:1981:NDR,
author = "C. Beeri and M. Y. Vardi",
title = "A note on decompositions of relational databases",
journal = j-SIGMOD,
volume = "12",
number = "1",
pages = "33--37",
month = oct,
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984497.984501",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:30 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Miller:1981:BEU,
author = "Peter B. Miller and Sergey Tetelbaum and Kincade N.
Webb",
title = "{BUSINESS}: an end-user oriented application
development language",
journal = j-SIGMOD,
volume = "12",
number = "1",
pages = "38--69",
month = oct,
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984497.984502",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:30 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "BUSINESS is a new application development language
intended to answer the needs of a rapidly growing user
community - the end-user. The underlying computational
model is the paper office. BUSINESS instructions
manipulate objects within this model in ways analogous
to human office workers. The syntax of BUSINESS closely
approximates a subset of English. Standard programming
functions are embodied in the language in ways that
seem natural to first time computer users. For example,
to open a file for exclusive read/write access one
'Pulls' a 'Folder' (containing 'Forms' and 'Documents')
from a 'Drawer' in a 'File Cabinet'. In the
computational model, the Folder is seen to actually
move from the Drawer to a 'Desk' belonging to an
'Aide'(the 'worker' inside the computer).To support the
construction of reliable software within this model,
BUSINESS contains a rich repertoire of structured
control constructs: execute (procedures), do
(routines), go through (a set of objects), test and
select one (from a set of 'if - then' instructions).
Base data types include: whole numbers, decimal
numbers, money, dates, times and characters. The set of
operators and tests within BUSINESS support a complete
range of data manipulations and logical decisions. Data
structures include Fillins (collections of Fields) and
Tables (having Entries at Row/Column intersections).
Permanent data is organized by Form (collections of
Fillins and Tables).",
acknowledgement = ack-nhfb,
}
@Article{Roark:1981:ECS,
author = "Mayford L. Roark",
title = "Evolution in computer systems",
journal = j-SIGMOD,
volume = "12",
number = "2",
pages = "4--8",
month = "Summer--Fall",
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983028.983030",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:38 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Nolan:1981:EMO,
author = "Richard L. Nolan",
title = "Establishing management objectives",
journal = j-SIGMOD,
volume = "12",
number = "2",
pages = "9--19",
month = "Summer--Fall",
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983028.983031",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:38 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Burrows:1981:ACE,
author = "James H. Burrows",
title = "Actual conversion experiences",
journal = j-SIGMOD,
volume = "12",
number = "2",
pages = "20--33",
month = "Summer--Fall",
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/983028.983032",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:38 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bryce:1981:S,
author = "Milt Bryce",
title = "Standards",
journal = j-SIGMOD,
volume = "12",
number = "2",
pages = "34--38",
month = "Summer--Fall",
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982996.983033",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:38 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Fry:1981:CTA,
author = "James P. Fry",
title = "Conversion technology, an assessment",
journal = j-SIGMOD,
volume = "12",
number = "2",
pages = "39--61",
month = "Summer--Fall",
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982996.983034",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:38 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ives:1981:R,
author = "Blake Ives",
title = "Reviews",
journal = j-SIGMOD,
volume = "12",
number = "2",
pages = "62--64",
month = "Summer--Fall",
year = "1981",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/982996.983036",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:38 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hsiao:1982:WRV,
author = "David K. Hsiao",
title = "Will the real {VLDB} conference please stand up?",
journal = j-SIGMOD,
volume = "12",
number = "3",
pages = "8--14",
month = apr,
year = "1982",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984505.984506",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:47 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Boral:1982:DRA,
author = "Haran Boral and David J. DeWitt and Randy H. Katz and
Anthony Klug",
title = "Database research activities at the {University of
Wisconsin}",
journal = j-SIGMOD,
volume = "12",
number = "3",
pages = "19--26",
month = apr,
year = "1982",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984505.984507",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:47 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bolour:1982:RTI,
author = "A. Bolour and T. L. Anderson and L. J. Dekeyser and H.
K. T. Wong",
title = "The role of time in information processing: a survey",
journal = j-SIGMOD,
volume = "12",
number = "3",
pages = "27--50",
month = apr,
year = "1982",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984505.984508",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:47 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Overmyer:1982:ITE,
author = "Ricky Overmyer and Michael Stonebraker",
title = "Implementation of a time expert in a data base
system",
journal = j-SIGMOD,
volume = "12",
number = "3",
pages = "51--60",
month = apr,
year = "1982",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984505.984509",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:47 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "This paper reports on the design and implementation of
a time expert for a relational data base system. It
demonstrates that a sophisticated expert can be written
easily and cause minimal performance degradation. As a
result, extending a data base system to support user
defined data types is an easy operation.",
acknowledgement = ack-nhfb,
}
@Article{Schlageter:1982:POC,
author = "G. Schlageter",
title = "Problems of optimistic concurrency control in
distributed database systems",
journal = j-SIGMOD,
volume = "12",
number = "3",
pages = "62--66",
month = apr,
year = "1982",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984505.984510",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:47 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "In [SCH81] some aspects of optimistic concurrency
control (CC) in distributed database systems have been
discussed, some important problems have, however, not
been dealt with in sufficient detail in the paper but
only in the oral presentation. Thus, the reader of the
conference proceedings might get the impression that
optimistic CC, as introduced in [KUR79], is very easily
adapted to distributed systems. Unfortunately, when
looking into the problem more thoroughly, the contrary
turns out to be true. This note is meant to highlight
the main problems of optimistic CC in distributed
database systems. We cannot discuss possible solutions
in detail - this will be done elsewhere.",
acknowledgement = ack-nhfb,
}
@Article{Rolland:1982:DPD,
author = "Colette Rolland and Christian Richard",
title = "Distributed processing of data dynamics",
journal = j-SIGMOD,
volume = "12",
number = "3",
pages = "67--85",
month = apr,
year = "1982",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984505.984511",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:47 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "We are concerned by distributed data base (DDB)
consistency. We claim that a better DDB consistency
requires to integrate in Distributed Base Management
Systems a system of automata to manage its dynamics
processing according to the description of data
dynamics. We present a specification language in order
to allow the dynamics DDB description according to the
data dynamics modeling presented at the 4th VLDB
Conference. We develop the system of automata able to
perform in a distributed way the DDB dynamics
processing and discuss the solution from concurrency
and consistency points of view.",
acknowledgement = ack-nhfb,
}
@Article{Walker:1982:ADD,
author = "Henry M. Walker",
title = "Administering a distributed {Data Base Management
System}",
journal = j-SIGMOD,
volume = "12",
number = "3",
pages = "86--99",
month = apr,
year = "1982",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984505.984512",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:47 MDT 2008",
bibsource = "http://portal.acm.org/",
abstract = "The early design of a Data Base Management System
(DBMS) must include a specification of the functions
associated with administering the system, so that
subsequent activities, such as documentation, training,
and staffing, can occur. Therefore, this paper
undertakes a careful definition of administrative tasks
for a Data Base Management System (DBMS) in a
distributed computer environment. The paper first
discusses a general framework for administering a
distributed DBMS, and then the paper presents a
specific listing of administrative functions. While the
above work is based on a specific system under
development at Bell Laboratories, the paper concludes
with several comments extending this work to other
types of distributed systems.",
acknowledgement = ack-nhfb,
}
@Article{Brodie:1982:FRA,
author = "Michael L. Brodie and Joachim W. Schmidt",
title = "Final report of the {ANSI\slash X3\slash SPARC DBS-SG}
relational database task group",
journal = j-SIGMOD,
volume = "12",
number = "4",
pages = "1--62",
month = jul,
year = "1982",
CODEN = "SRECD8",
DOI = "http://doi.acm.org/10.1145/984555.1108830",
ISSN = "0163-5808",
bibdate = "Tue Jun 17 17:08:58 MDT 2008",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Date:1983:DU,
author = "C. J. Date",
title = "Database usability",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "1--1",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bernstein:1983:DTW,
author = "Philip A. Bernstein",
title = "Database theory: where has it been? where is it
going?",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "2--2",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gray:1983:PPD,
author = "Jim Gray",
title = "Practical problems in data management: a position
paper",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "3--3",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Neuhold:1983:VDM,
author = "Erich J. Neuhold",
title = "Views on data management",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "4--5",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wright:1983:MPD,
author = "David D. Wright",
title = "On merging partitioned databases",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "6--14",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Maier:1983:FR,
author = "David Maier and Jeffrey D. Ullman",
title = "Fragments of relations",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "15--22",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wong:1983:DDP,
author = "E. Wong and R. H. Katz",
title = "Distributing a database for parallelism",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "23--29",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Yu:1983:DQP,
author = "C. T. Yu and C. C. Chang",
title = "On the design of a query processing strategy in a
distributed database environment",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "30--39",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Christodoulakis:1983:EBT,
author = "Stavros Christodoulakis",
title = "Estimating block transfers and join sizes",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "40--54",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kambayashi:1983:QPU,
author = "Yahiko Kambayashi and Masatoshi Yoshikawa",
title = "Query processing utilizing dependencies and horizontal
decomposition",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "55--67",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Maier:1983:WW,
author = "David Maier and David Rozenshtein and David S.
Warren",
title = "Windows on the world",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "68--78",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Laver:1983:FDC,
author = "Kent Laver and Alberto O. Mendelzon and Marc H.
Graham",
title = "Functional dependencies on cyclic database schemes",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "79--91",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Honeyman:1983:NCI,
author = "Peter Honeyman and Edward Sciore",
title = "A new characterization of independence",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "92--96",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Carey:1983:AMD,
author = "Michael J. Carey",
title = "An abstract model of database concurrency control
algorithms",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "97--107",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kohler:1983:ECL,
author = "Walter H. Kohler and Kenneth C. Wilner and John A.
Stankovic",
title = "An experimental comparison of locking policies in a
testbed database system",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "108--119",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lomet:1983:HPU,
author = "David B. Lomet",
title = "A high performance, universal, key associative access
method",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "120--133",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Stonebraker:1983:DAT,
author = "Michael Stonebraker and Daniel Sagalowicz and Robert
Wilensky",
title = "{DBMS} and {AI}: is there any common point of view?",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "134--134",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rowe:1983:TSE,
author = "Neil C. Rowe",
title = "Top-down statistical estimation on a database",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "135--145",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lohman:1983:RSG,
author = "Guy M. Lohman and Joseph C. Stoltzfus and Anita N.
Benson and Michael D. Martin and Alfonso F. Cardenas",
title = "Remotely-sensed geophysical databases: experience and
implications for generalized {DBMS}",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "146--160",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Shu:1983:FAR,
author = "Nan C. Shu and Harry K. T. Wong and Vincent Y. Lum",
title = "Forms approach to requirements specification for
database design",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "161--172",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{DAtri:1983:AQR,
author = "Alessandro D'Atri and Marina Moscarini and Nicolas
Spyratos",
title = "Answering queries in relational databases",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "173--177",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Imielinski:1983:IID,
author = "Tomasz Imielinski and Witold {Lipski, Jr.}",
title = "Incomplete information and dependencies in relational
databases",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "178--184",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kuck:1983:DGC,
author = "Sharon M. Kuck and Yehoshua Sagiv",
title = "Designing globally consistent network schemas",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "185--195",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Jarke:1983:RNF,
author = "Matthias Jarke and J{\"u}rgen Koch",
title = "Range nesting: a fast method to evaluate quantified
queries",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "196--206",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Zaniolo:1983:DLG,
author = "Carlo Zaniolo",
title = "The database language {GEM}",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "207--218",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Missikoff:1983:RQD,
author = "M. Missikoff and M. Scholl",
title = "Relational queries in a domain based {DBMS}",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "219--227",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Chan:1983:OAC,
author = "Arvola Chan and Umeshwar Dayal and Stephen Fox and
Nathan Goodman and Daniel R. Ries and Dale Skeen",
title = "Overview of an {Ada} compatible distributed database
manager",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "228--237",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wilms:1983:WWT,
author = "Paul F. Wilms and Bruce G. Lindsay and Patricia G.
Selinger",
title = "``{I} wish {I} were over there'': distributed
execution protocols for data definition in {R}",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "238--242",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ariav:1983:PTD,
author = "Gad Ariav and Jim Clifford and Matthias Jarke",
title = "Panel on time and databases",
journal = j-SIGMOD,
volume = "13",
number = "4",
pages = "243--245",
month = may,
year = "1983",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:53 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{DeWitt:1984:ITM,
author = "David J. DeWitt and Randy H. Katz and Frank Olken and
Leonard D. Shapiro and Michael R. Stonebraker and David
Wood",
title = "Implementation techniques for main memory database
systems",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "1--8",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "With the availability of very large, relatively
inexpensive main memories, it is becoming possible to
keep large databases resident in main memory. This
paper considers the changes necessary to permit a
relational database system to take advantage of large
amounts of main memory. Authors evaluate AVL vs. B plus
-tree access methods for main memory databases,
hash-based query processing strategies vs. sort-merge,
and study recovery issues when most or all of the
database fits in main memory. As expected, B plus
-trees are the preferred storage mechanism unless more
than 80-90\% of the database fits in main memory. A
somewhat surprising result is that hash based query
processing strategies are advantageous for large memory
situations.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Wisconsin, Computer Sciences Dep, WI, USA",
affiliationaddress = "Univ of Wisconsin, Computer Sciences Dep, WI,
USA",
classification = "722; 723",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "ACCESS METHODS; DATABASE SYSTEMS; JOINT ALGORITHMS;
MAIN MEMORY DATABASES; Management; RECOVERY
MECHANISMS",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Simon:1984:DIE,
author = "Eric Simon and Patrick Valduriez",
title = "Design and implementation of an extendible integrity
subsystem",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "9--17",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "This paper presents a powerful integrity subsystem,
which is implemented in the SABRE database system. The
specification language is simple. The enforcement
algorithm is general; in particular, it handles
referential dependency and temporal assertions.
Specialized strategies efficiently treat each class of
assertions. The system automatically manages integrity
checkpoints. Also, an efficient method is described for
processing assertions involving aggregates. An analysis
exhibits the value of the algorithms. It is shown that,
in general, this method is better than the query
modification method for domain assertions. Measures
have also been done for giving the cost added for
controlling integrity in comparison with the cost of
the request itself.",
acknowledgement = ack-nhfb,
affiliation = "Inst Natl de Recherche en Informatique et en
Automatique, SABRE Project, Le Chesnay, Fr",
affiliationaddress = "Inst Natl de Recherche en Informatique et en
Automatique, SABRE Project, Le Chesnay, Fr",
classification = "723",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPUTER PROGRAMMING LANGUAGES; DATABASE SYSTEMS;
Design; ENFORCEMENT ALGORITHM; QUALITATIVE ANALYSIS;
SABRE DATABASE SYSTEM; SYSTEM ARCHITECTURE",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Boral:1984:TSC,
author = "Haran Boral and Israel Gold",
title = "Towards a self-adapting centralized concurrency
control algorithm",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "18--32",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "The notion is introduced of self-adapting concurrency
control algorithms --- concurrency control algorithms
that consist of several rw and several ww
synchronization techniques, and combinations of the
techniques are applied in a manner that attains a
performance objective. Synchronization techniques are
considered that use locking and certification. A
general proof method for such algorithms is outlined
and applied.",
acknowledgement = ack-nhfb,
affiliation = "Microelectronics \& Computer Technology Corp, Austin,
TX, USA",
affiliationaddress = "Microelectronics \& Computer Technology Corp,
Austin, TX, USA",
classification = "723; 731",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "Computer Applications; COMPUTER PROGRAMMING ---
Algorithms; CONTROL SYSTEMS; DATABASE SYSTEMS ---
Management; INTEGRATED CONCURRENCY CONTROL ALGORITHM;
SYNCHRONIZATION TECHNIQUES; TRANSACTION MANAGER MODEL",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Arnow:1984:ECB,
author = "David M. Arnow and Aaron M. Tenenbaum",
title = "Empirical comparison of {B-trees}, compact {B-trees}
and multiway trees",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "33--46",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "This paper examines general B-trees empirically and
compares them with a less restrictive structure, the
general multiway tree, and a more restrictive
structure, the compact B-tree. The authors compare
search cost, insertion costs, and space costs of these
three structures for both small and large orders and
indicate their relative utility for large and small
data sets. Although there are cases when general
multiway trees are more effective than B-trees, this is
not the case for most practical situations. Compact
B-trees are also shown to degrade rapidly in the
presence of insertions and are therefore only useful
for static data sets. 10 refs.",
acknowledgement = ack-nhfb,
affiliation = "Brooklyn Coll, Dep of Computer \& Information Science,
Brooklyn, NY, USA",
affiliationaddress = "Brooklyn Coll, Dep of Computer \& Information
Science, Brooklyn, NY, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "B-TREES; COMPACT B-TREES; DATA STRUCTURES; DATABASE
SYSTEMS; INFORMATION RETRIEVAL SYSTEMS; MULTIWAY
TREES",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Guttman:1984:TDI,
author = "Antonin Guttman",
title = "{$R$}-trees: a dynamic index structure for spatial
searching",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "47--57",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "In order to handle spatial data efficiently, as
required in computer aided design and geo-data
applications, a database system needs an index
mechanism that will help it retrieve data items quickly
according to their spatial locations. However,
traditional indexing methods are not well suited to
data objects of non-zero size located in
multi-dimensional spaces. This paper describes a
dynamic index structure called an R-tree which meets
this need, and gives algorithms for searching and
updating it. The author presents the results of a
series of tests which indicate that the structure
performs well, and concludes that it is useful for
current database systems in spatial applications.",
acknowledgement = ack-nhfb,
affiliation = "Univ of California, Berkeley, Berkeley, CA, USA",
affiliationaddress = "Univ of California, Berkeley, Berkeley, CA,
USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COST ALGORITHMS; DATABASE SYSTEMS; DYNAMIC INDEX
STRUCTURE; INFORMATION RETRIEVAL SYSTEMS; Management;
NODE SPLITTING; R-TREES; SPATIAL SEARCHING",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Diel:1984:DMF,
author = "Hans Diel and Gerald Kreissig and Norbert Lenz and
Michael Scheible and Bernd Schoener",
title = "Data management facilities of an operating system
kernel",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "58--69",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "The paper describes the part of a general operating
system Kernel supporting data management functions. The
operating system Kernel can be imbedded into microcode
and viewed as an extended hardware interface. Four
Kernel instructions are defined to support data
management. They provide a powerful basis for the
implementation of different kinds of access methods and
file systems, including data base systems. Advanced
transaction processing concepts such as concurrency
control, support of back-out, commit and a variety of
share options are included.",
acknowledgement = ack-nhfb,
affiliation = "IBM, EF Lab, Boeblingen, West Ger",
affiliationaddress = "IBM, EF Lab, Boeblingen, West Ger",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "ACCESS ADMISSION CONTROL PROTOCOL; ACCESS PERSISTENT
OBJECT; CONCURRENCY CONTROL; DATABASE SYSTEMS;
Management; OPERATING SYSTEM KERNELS; TRANSACTION
PROCESSING PRINCIPLES",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Fedorowicz:1984:DEU,
author = "Jane Fedorowicz",
title = "Database evaluation using multiple regression
techniques",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "70--76",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "A model of the inverted file of an automated
bibliographic system is constructed using the Zipf
distribution of word frequency. By ascertaining the
parameters of the Zipfian model of the inverted file
system, one can estimate the minimum data storage
requirements of the database. In addition, given a few
additional system parameters, access time for a
specified query can be estimated. The estimation
procedures are accomplished using logarithmic
transformations and multiple regression techniques.
This paper introduces the Zipfian models, their
regression formulation, and their results and
interpretation for application to database
evaluation.",
acknowledgement = ack-nhfb,
affiliation = "Northwestern Univ, Kellogg Graduate Sch of Management,
Evanston, IL, USA",
affiliationaddress = "Northwestern Univ, Kellogg Graduate Sch of
Management, Evanston, IL, USA",
classification = "723; 901; 922",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "ACCESS TIME MODEL; BIBLIOGRAPHIC TECHNIQUES; DATABASE
SYSTEMS; Evaluation; INFORMATION STORAGE SYSTEMS;
MATHEMATICAL MODELS; MULTIPLE REGRESSION TECHNIQUES;
ZIPFIAN MODEL",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Baru:1984:PES,
author = "C. K. Baru and S. Y. W. Su",
title = "Performance evaluation of the statistical aggregation
by categorization in the {SM3} system",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "77--89",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "To perform a statistical aggregation operation over a
large file often requires that the records of the file
be divided into categories based on the values of the
attribute(s) over which some statistical computation is
to be performed. It is rather inefficient to perform
the necessary data transfer, categorization and
statistical computation using a single processor.
Parallel algorithms designed for multiprocessor systems
have been proposed and their performance improvement
over the conventional systems has been demonstrated. It
is shown in this paper that three to four times
performance improvement can be further gained by using
a dynamically partitionable multicomputer system with
switchable main memory modules (SM3).",
acknowledgement = ack-nhfb,
affiliation = "Univ of Florida, Database Systems Research \&
Development Cent, Gainesville, FL, USA",
affiliationaddress = "Univ of Florida, Database Systems Research \&
Development Cent, Gainesville, FL, USA",
classification = "723; 901; 922",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "Computer Applications; DATA TRANSFER; DATABASE
SYSTEMS; MATHEMATICAL STATISTICS; PARALLEL ALGORITHMS;
PERFORMANCE EVALUATION; SWITCHABLE MAIN MEMORY
MODULES",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Spooner:1984:DSI,
author = "David L. Spooner",
title = "Database support for interactive computer graphics",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "90--99",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "This paper explores these ideas by discussing the
implementation of a prototype interface between a
relational DBMS and an interactive computer graphics
system. It presents both the database structures used
to manage the data and the techniques used to design
the interface. It concludes by discussing an approach
for making the interface portable.",
acknowledgement = ack-nhfb,
affiliation = "Rensselaer Polytechnic Inst, Mathematical Sciences
Dep, Troy, NY, USA",
affiliationaddress = "Rensselaer Polytechnic Inst, Mathematical
Sciences Dep, Troy, NY, USA",
classification = "722; 723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "Computer Applications; COMPUTER GRAPHICS; COMPUTER
INTERFACES; DATABASE SYSTEMS; HIERARCHICAL
ORGANIZATION; MAPPING FUNCTIONS; RELATIONAL DATABASES;
SEMANTIC ATTRIBUTES",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Fogg:1984:LLD,
author = "Dennis Fogg",
title = "Lessons from a `living in a database' graphical query
interface",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "100--106",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "The Living In a Database system (LID) is a
user-friendly interface to an entity-relationship
database. Its underlying ideas are similar to R. G. G.
Cattell's PDB, but its presentation is significantly
different. LID uses a bit-mapped graphics terminal with
mouse pointer to create an attractive interaction
environment. Experience from the implementation
suggests that dynamic graphic displays --- those which
have graphic symbols that change as the data they
present change --- are an important feature in user
interfaces but are difficult to implement with current
technology. The implementation also uncovers an
important inadequacy in the PDB\slash LID idea: the
inability to operate on sets of data instances in the
same way as individual data instances. An extension to
LID is suggested to alleviate the problem.",
acknowledgement = ack-nhfb,
affiliation = "MIT, Artificial Intelligence Lab, Cambridge, MA, USA",
affiliationaddress = "MIT, Artificial Intelligence Lab, Cambridge, MA,
USA",
classification = "722; 723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPUTER GRAPHICS; Computer Interfaces; DATABASE
SYSTEMS; GRAPHIC DISPLAYS; GRAPHICAL QUERY INTERFACES;
LIVING IN A DATABASE SYSTEM; USER-FRIENDLY SYSTEMS",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Valduriez:1984:MHS,
author = "Patrick Valduriez and Yann Viemont",
title = "Multikey hashing scheme using predicate trees",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "107--114",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "A new method for multikey access suitable for dynamic
files is proposed that transforms multiple key values
into a logical address. This method is based on a new
structure, called predicate tree, that represents the
function applied to several keys. A predicate tree
permits to specify in a unified way various hashing
schemes by allowing for different definitions of
predicates. A logical address qualifies a space
partition of a file according to its predicate tree.
This address is seen as a single key by a digital
hashing method which transforms it into a physical
address. This method is used to address records in a
file and to transform a retrieval qualification on a
file into a set of partitions to access. Finally, a
qualitative analysis of the behavior of the method is
given which exhibits its value.",
acknowledgement = ack-nhfb,
affiliation = "Inst Natl de Recherche en Informatique et en
Automatique, SABRE Project, Le Chesnay, Fr",
affiliationaddress = "Inst Natl de Recherche en Informatique et en
Automatique, SABRE Project, Le Chesnay, Fr",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "Computer Applications; DATABASE SYSTEMS; DYNAMIC
FILES; MULTIKEY HASHING SCHEME; PREDICATE TREES;
SIGNATURE PROFILES",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Lum:1984:DDS,
author = "V. Lum and P. Dadam and R. Erbe and J. Guenauer and P.
Pistor and G. Walch and H. Werner and J. Woodfill",
title = "Designing {DBMS} support for the temporal dimension",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "115--130",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "The information in the data base represents a snapshot
of it at an unspecified instant of time and the
information is deemed to be the `current' data. While
such an approach is satisfactory in many applications,
recent studies in new data base applications have
revealed that it is not satisfactory in many cases. New
functions for new requirements are needed. Among these
new requirements is the need to have temporal, or time
domain, support. This paper deals specifically with
this particular subject. The authors, without
distinction, refer to the support of the time domain as
temporal support, history data support, or simply time
support. They refer to queries with reference to the
time domain as time, temporal or history queries. 23
refs.",
acknowledgement = ack-nhfb,
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "DATABASE SYSTEMS; INDEXING SUPPORT STRUCTURES; LOGICAL
TIME; Management; PHYSICAL TIME; RELATIONAL MODEL;
TEMPORAL DIMENSIONS",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Chen:1984:CRN,
author = "Huei-huang Chen and Sharon McCure Kuck",
title = "Combining relational and network retrieval methods",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "131--142",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "New methods for retrieving records from a database
with links are given so that records are retrieved only
once and not multiple times as happens when using the
traditional method of retrieval. Improvements as great
as 50 percent are expected for queries over databases
containing only many-to-one relationships and much
greater improvements are expected when many-to-many
relationships are embedded in the database.
Furthermore, it is shown how to combine relational and
network retrieval methods. Relations, containing many
tuples, are created during the evaluation of a network
query. Each relation is either joined with other
relations or is used to continue the evaluation of the
network query. The methods given show how to optimize
data retrieval from a relational database that is
implemented using links, where each link represents a
many-to-one relationship.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Illinois at Urbana-Champaign, Urbana, IL,
USA",
affiliationaddress = "Univ of Illinois at Urbana-Champaign, Urbana,
IL, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "Computer Applications; DATABASE SYSTEMS; INFORMATION
RETRIEVAL SYSTEMS; LOST ACCOUNTING; NETWORK MODELS;
RELATIONAL DATABASES; SORT-OWNER METHOD; TREE QUERIES",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Keller:1984:CIM,
author = "Arthur M. Keller and Jeffrey D. Ullman",
title = "On complementary and independent mappings on
databases",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "143--148",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "The authors define the notion of independent views to
indicate whether the range values of the two views may
be achieved independently. The concept of complementary
views indicates when the domain element can be uniquely
determined by the range values of the two complementary
views. They consider the relationship between
independent and complementary views. In unrestricted
domains, a view (but not the identity or empty view)
can have more than one complementary, independent view.
Databases, however, are more restricted domains: They
are finite power sets. A view is monotonic if it
preserves inclusion. However, in finite power sets when
all views are monotonic, if a given view has another
view which is independent and complementary, then this
view is unique.",
acknowledgement = ack-nhfb,
affiliation = "Stanford Univ, Computer Science Dep, Stanford, CA,
USA",
affiliationaddress = "Stanford Univ, Computer Science Dep, Stanford,
CA, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPLEMENTARY MAPPINGS; DATABASE SYSTEMS; INDEPENDENT
MAPPINGS; MONOTONIC FUNCTIONS; RELATIONAL DATABASES;
Theory",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Chan:1984:OCT,
author = "Edward P. F. Chan",
title = "Optimal computation of total projections with unions
of simple chase join expressions",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "149--163",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "The representative instance has been proposed as a
query answering device in systems using the Universal
Relation Interface. One approach is to use the total
projections of the representative instance to generate
the answer for a query. Associated with this approach
is the problem of how to generate the total projections
of the representative instance efficiently. A
generalization is proposed of extension joins, called
chase join expressions, as a means to compute the total
projections when functional dependencies are given as
constraints. In particular, an important subclass of
chase join expressions called simple chase join
expressions is identified and it is shown that the
total projections with respect to a set of functional
dependencies can be computed by unions of simple chase
join expressions when an independent scheme is assumed.
Also a simple and efficient algorithm is found that
minimizes the number of join operations in a union of
simple chase join expressions.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Toronto, Computer Systems Research Group,
Toronto, Ont, Can",
affiliationaddress = "Univ of Toronto, Computer Systems Research
Group, Toronto, Ont, Can",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "CHASE JOIN EXPRESSIONS; CONTAINMENT MAPPINGS; DATABASE
SYSTEMS; QUERY ANSWERING DEVICES; Theory; UNIVERSAL
RELATION INTERFACE",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Willard:1984:EPR,
author = "Dan E. Willard",
title = "Efficient processing of relational calculus
expressions using range query theory",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "164--175",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "In this paper the author defines a language based on a
broad subset of the relational calculus and shows all
expressions in this language can be evaluated in space
O(N) and time O(N log**dN), where d is a small constant
whose value depends on the particular predicate and
where N is the number of records stored in the data
base. Currently there are no hard statistics, but a
reasonable guess seems to be that a standard sequential
random access machine can handle 95\% or more of
commercial requests in time O(N log N) and memory O(N)
using this technique.",
acknowledgement = ack-nhfb,
affiliation = "State Univ of New York at Albany, Albany, NY, USA",
affiliationaddress = "State Univ of New York at Albany, Albany, NY,
USA",
classification = "723; 901; 921",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "AUTOMATA THEORY --- Sequential Machines; DATABASE
SYSTEMS; DECOMPOSABILITY ANALYSIS; RANGE QUERY THEORY;
RELATIONAL CALCULUS; Theory",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Boral:1984:MDS,
author = "Haran Boral and David J. DeWitt",
title = "Methodology for database system performance
evaluation",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "176--185",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "This paper presents a methodology for evaluating the
performance of database management systems and database
machines in a multiuser environment. Three main factors
that affect transaction throughput in a multiuser
environment are identified: multiprogramming level,
degree of data sharing among simultaneously executing
transactions, and transaction mix. It is demonstrated
that only four basic query types are needed to
construct a benchmark that will evaluate the
performance of a system under a wide variety of
workloads. Finally, the results are presented of
applying current techniques to the Britton-Lee IDM 500
database machine.",
acknowledgement = ack-nhfb,
affiliation = "Microelectronics \& Computer Technology Corp, Austin,
TX, USA",
affiliationaddress = "Microelectronics \& Computer Technology Corp,
Austin, TX, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPUTER SYSTEMS PROGRAMMING --- Multiprogramming;
DATABASE SYSTEMS; DEGREE OF DATA SHARING; HARDWARE
CONFIGURATION; Performance; PORTABILITY ISSUES; QUERY
MIX SELECTION",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Kriegel:1984:PCI,
author = "Hans-Peter Kriegel",
title = "Performance comparison of index structures for
multi-key retrieval",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "186--196",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "This paper reports on a performance comparison of four
software implemented index structures for multi-key
retrieval: the inverted file, the grid file and two
variants of multidimensional B-trees. It turns out that
the recently suggested structures multidimensional
B-tree and grid file outperform the traditional
inverted file.",
acknowledgement = ack-nhfb,
affiliation = "Univ Wuerzburg, Wuerzburg, West Ger",
affiliationaddress = "Univ Wuerzburg, Wuerzburg, West Ger",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPUTER SOFTWARE; GRID FILE; INDEX STRUCTURES;
INFORMATION RETRIEVAL SYSTEMS; INFORMATION SCIENCE ---
Indexing; INVERTED FILE; MULTIDIMENSIONAL B-TREES;
Performance",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Motro:1984:BLS,
author = "Amihai Motro",
title = "Browsing in a loosely structured database",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "197--207",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "This paper describes an architecture which promotes
databases that are only loosely structured: heaps of
facts instead of highly structured data. This
architecture avoids the traditional dichotomy between
`schema' and `data', and it incorporates a single
mechanism for defining both inference rules and
integrity constraints. As lack of organization will
usually have adverse effect on retrieval, the principal
retrieval method for loosely structured databases is
browsing: exploratory searching which does not assume
any knowledge of the organization (or even the very
existence of organization). Two styles of browsing,
called navigation and probing, are defined. Both are
derived from a standard query language based on
predicate logic.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Southern California, Dep of Computer Science,
Los Angeles, CA, USA",
affiliationaddress = "Univ of Southern California, Dep of Computer
Science, Los Angeles, CA, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "BROWSING; DATABASE SYSTEMS; INFERENCE RULES;
INFORMATION RETRIEVAL SYSTEMS; LOOSELY STRUCTURED
DATABASES; Management; PREDICATE KNOWLEDGE",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Stonebraker:1984:QDT,
author = "Michael Stonebraker and Erika Anderson and Eric Hanson
and Brad Rubinstein",
title = "{QUEL} as a data type",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "208--214",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "This paper explores the use of commands in a query
language as an abstract data type (ADT) in data base
management systems. Basically, an ADT facility allows
new data types, such as polygons, lines, money, time,
arrays of floating point numbers, bit vectors, etc., to
supplement the built-in data types in a data base
system. This paper demonstrates the power of adding a
data type corresponding to commands in a query
language. Also proposed are three extensions to the
query language QUEL to enhance its power in this
augmented environment.",
acknowledgement = ack-nhfb,
affiliation = "Univ of California, Berkeley, Dep of Electrical
Engineering \& Computer Science, Berkeley, CA, USA",
affiliationaddress = "Univ of California, Berkeley, Dep of Electrical
Engineering \& Computer Science, Berkeley, CA, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "ABSTRACT DATA TYPE; DATABASE SYSTEMS; DISTRIBUTED
DATABASES; FLOATING POINT NUMBERS; Management; QUERY
LANGUAGE QUEL",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Hogg:1984:AMS,
author = "John Hogg and Stelios Gamvroulas",
title = "Active mail system",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "215--222",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "Conventional electronic mail is passive text that is
created, sent and read. Any further actions must be
initiated by the recipient. By contrast, an
`intelligent message'' (imessage) is an active program
that carries on a dialogue with the recipient. The
imessage may subsequently route itself to other users
as a result of the responses it receives, and it
eventually returns these responses to the original
sender. This paper describes a prototype intelligent
mail system and discusses some of the problems involved
in implementing such a system in a distributed
environment.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Toronto, Computer Systems Research Group,
Toronto, Ont, Can",
affiliationaddress = "Univ of Toronto, Computer Systems Research
Group, Toronto, Ont, Can",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "ACTIVE MAIL SYSTEMS; DATABASE SYSTEMS --- Distributed;
ELECTRONIC MAIL; IMESSAGE LANGUAGE; INTELLIGENT
MESSAGE; SELF-REPAIRING",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Chang:1984:SDD,
author = "Jo-Mei Chang",
title = "Simplifying distributed database systems design by
using a broadcast network",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "223--233",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "Atomic broadcast and failure detection are powerful
primitives for distributed database systems. In the
distributed database system, LAMBDA, they are provided
as network primitives. This paper shows how atomic
broadcast and failure detection simplify transaction
commitment, concurrency control, and crash recovery.
Specifically, a simple two-phase non-blocking commit
protocol is given; whereas three phases are required in
a point-to-point network. A simplified read-one\slash
write-all update algorithm is also given for replicated
data and an easily implemented log-based recovery
algorithm providing uninterrupted transaction
processing. The benefits of performing the atomic
broadcast and failure detection at the network level
are also discussed. Performing these functions at the
network level not only simplifies database protocols
but also better utilizes the broadcast network: fewer
messages are transmitted. Comparisons between LAMBDA
and existing distributed database systems are also
made.",
acknowledgement = ack-nhfb,
affiliation = "AT\&T Bell Lab, Murray Hill, NJ, USA",
affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "ATOMIC BROADCAST; BROADCAST NETWORKS; CONCURRENCY
CONTROL; DATABASE SYSTEM LAMBDA; DATABASE SYSTEMS;
Distributed; FAILURE DETECTION",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Fishman:1984:OJD,
author = "Daniel H. Fishman and Ming-Yee Lai and W. Kevin
Wilkinson",
title = "Overview of the {Jasmin} database machine",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "234--239",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "The Jasmin database machine is being implemented as
part of a research project in distributed processing
and database management. A primary goal of the work is
to demonstrate the feasibility of a practical
multiprocessor database machine suitable for large
database, high transaction-rate applications. Key
features of Jasmin are its configurable performance,
its use of off-the-shelf parts, and its ability to
handle distributed databases. A uniprocessor prototype
of Jasmin has already been completed and the
multiprocessor version is planned for later this year.
This paper describes Jasmin's architecture and
discusses the performance observed in the uniprocessor
prototype.",
acknowledgement = ack-nhfb,
affiliation = "Bell Communications Research",
affiliationaddress = "Bell Communications Research",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPUTER SOFTWARE; COMPUTER SYSTEMS, DIGITAL ---
Multiprocessing; CONFIGURABLE PERFORMANCE; DATABASE
SYSTEMS; Distributed; JASMIN ARCHITECTURE; JASMIN
DATABASE MACHINE; UNIPROCESSOR PROTOTYPE",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Shmueli:1984:MV,
author = "Oded Shmueli and Alon Itai",
title = "Maintenance of views",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "240--255",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "In relational databases a view definition is a query
against the database, and a view materialization is the
result of applying the view definition to the current
database. A view materialization over a database may
change as relations in the database undergo
modifications. In this paper a mechanism is proposed in
which the view is materialized at all times. The
problem which this mechanism addresses is how to
quickly update the view in response to database
changes. A structure is maintained which provides
information useful in minimizing the amount of work
caused by updates.",
acknowledgement = ack-nhfb,
affiliation = "Technion-Israel Inst of Technology, Computer Science
Dep, Haifa, Isr",
affiliationaddress = "Technion-Israel Inst of Technology, Computer
Science Dep, Haifa, Isr",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "DATABASE SYSTEMS; Management; RELATIONAL DATABASES;
TREE SCHEMAS; VIEW DEFINITION; VIEW MATERIALIZATION",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Piatetsky-Shapiro:1984:AEN,
author = "Gregory Piatetsky-Shapiro and Charles Connell",
title = "Accurate estimation of the number of tuples satisfying
a condition",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "256--276",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "A new method is presented for estimating the number of
tuples satisfying a condition of the type attribute rel
constant, where rel is one of ` equals ', ` greater
than ', ` less than ', ` greater than equivalent to ',
` less than equivalent to '. The method gives highly
accurate, yet easy to compute, estimates. Information
about attribute values is stored as a list of
distribution steps (histograms where buckets, instead
of having equal width, have equal height). These
distribution steps provide an upper bound on the error
when estimating the number of tuples satisfying a
condition. The estimation error can be arbitrarily
reduced by increasing the number of steps. Desirable
conditions that such estimates should satisfy are
analyzed. The major applications of the present method
are in query optimization and in answering statistical
queries.",
acknowledgement = ack-nhfb,
affiliation = "New York Univ, Dep of Computer Science, New York, NY,
USA",
affiliationaddress = "New York Univ, Dep of Computer Science, New
York, NY, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "ATTRIBUTE REL CONSTANT; DATABASE SYSTEMS; INFORMATION
RETRIEVAL SYSTEMS; Management; REAL WORLD EXAMPLES;
SELECTIVITY ESTIMATES; STATISTICAL QUERIES; TUPLES
NUMBER ESTIMATION",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Salton:1984:UEB,
author = "Gerard Salton",
title = "Use of extended {Boolean} logic in information
retrieval",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "277--285",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "An extended Boolean retrieval strategy has previously
been introduced in which the individual Boolean
operators can be treated more or less strictly,
depending on the perceived strength of association of
the query terms. The extended Boolean system is
illustrated by examples and evaluation output is used
to demonstrate the effectiveness of the operations.",
acknowledgement = ack-nhfb,
affiliation = "Cornell Univ, Dep of Computer Science, Ithaca, NY,
USA",
affiliationaddress = "Cornell Univ, Dep of Computer Science, Ithaca,
NY, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPUTER PROGRAMMING LANGUAGES; EXTENDED BOOLEAN
LOGIC; INFORMATION RETRIEVAL SYSTEMS; QUERY TERMS;
Theory; VECTOR PROCESSING",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Tsur:1984:IGS,
author = "Shalom Tsur and Carlo Zaniolo",
title = "Implementation of {GEM} --- supporting a semantic data
model on a relational back-end",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "286--295",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "This paper presents a simple approach for extending
the relational system INGRES into one supporting a
semantic data model. It describe a DBMS consisting of
(i) a user-friendly front-end, supporting the GEM
semantic data model and query language under the UNIX
time-sharing system and (ii) a dedicated back-end
processor providing efficient support for database
transactions, concurrency control and recovery. GEM
extends the relational model to support the notions of
entities with surrogates, the relationships of
aggregation and generalization, null values and
set-valued attributes, and provides simple extensions
of QUEL to handle these new constructs. In this
proposed implementation of GEM, the relational database
processor IDM 500 by Britton-Lee is used as the
back-end machine.",
acknowledgement = ack-nhfb,
affiliation = "AT\&T Bell Lab, Murray Hill, NJ, USA",
affiliationaddress = "AT\&T Bell Lab, Murray Hill, NJ, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPUTER SOFTWARE; CONCURRENCY CONTROL; DATA
MANIPULATION LANGUAGES; DATABASE SYSTEMS; Management;
QUERY LANGUAGES; SEMANTIC DATA MODEL GEM",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Jarke:1984:OPF,
author = "Matthias Jarke and Jim Clifford and Yannis Vassiliou",
title = "Optimizing {Prolog} front-end to a relational query
system",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "296--306",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "An optimizing translation mechanism for the dynamic
interaction between a logic-based expert system written
in PROLOG and a relational database accessible through
SQL is presented. The mechanism makes use of an
intermediate language that decomposes the optimization
problem and makes the proposed approach target-language
independent. It can either facilitate expert system ---
database interaction, e.g., when integrating expert
systems into business systems, or augment existing
database with (external) deductive capabilities.",
acknowledgement = ack-nhfb,
affiliation = "New York Univ, Graduate Sch of Business
Administration, New York, NY, USA",
affiliationaddress = "New York Univ, Graduate Sch of Business
Administration, New York, NY, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "Computer Applications; COMPUTER PROGRAMMING LANGUAGES;
DATABASE SYSTEMS; EXPERT SYSTEMS; OPTIMIZING
TRANSLATION MECHANISMS; RELATIONAL QUERY SYSTEMS;
SEMANTIC QUERY SIMPLIFICATION",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Shepherd:1984:PKB,
author = "Allan Shepherd and Larry Kerschberg",
title = "{Prism}: a knowledge based system for semantic
integrity specification and enforcement in database
systems",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "307--315",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "This paper presents a knowledge-based approach to the
specification, design, implementation, and evolution of
database applications. The knowledge base consists of
(1) facts regarding database objects that are organized
into a hierarchy of models, and (2) rules that specify
the behavior of objects within a model and among
models. The model hierarchy consists of database
application data, database schemas, data model
definitions, and system-related objects that control
the user's interaction with the system. The rules
governing the behavior of objects are specified as
explicit constraints on those objects. User goals are
transformed into conjectures that the inference engine
must prove are satisfiable by interpreting all
applicable constraints. The semantic architecture of
the PRISM system is described, together with the syntax
and semantics of the constraint language. PRISM is
implemented in the C programming language and runs
under the UNIX operating system.",
acknowledgement = ack-nhfb,
affiliation = "Univ of South Carolina, Dep of Computer Science,
Columbia, SC, USA",
affiliationaddress = "Univ of South Carolina, Dep of Computer Science,
Columbia, SC, USA",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPUTER CODE PRISM; COMPUTER SOFTWARE; DATABASE
SYSTEMS; KNOWLEDGE BASED SYSTEMS; Management; SEMANTIC
ARCHITECTURE; USER INTERACTIONS",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Copeland:1984:MSD,
author = "George Copeland and David Maier",
title = "Making {Smalltalk} a database system",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "316--325",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "To overcome limitations in the modeling power of
existing database systems and provide a better tool for
database application programming, Servio Logic
Corporation is developing a computer system to support
a set-theoretic data model in an object-oriented
programming environment. The authors recount the
problems with existing models and database systems.
They then show how features of Smalltalk, such as
operational semantics, its type hierarchy, entity
identity and the merging of programming and data
language, solve many of those problems. Next they
consider what Smalltalk lacks as a database system:
secondary storage management, a declarative semantics,
concurrency, past states. To address these shortcomings
they needed a formal data model. They introduce the
GemStone data model, and show how it helps to define
path expressions, a declarative semantics and object
history in the OPAL language. They summarize similar
approaches, and give a brief overview of the GemStone
system implementation.",
acknowledgement = ack-nhfb,
affiliation = "Servio Logic Corp",
affiliationaddress = "Servio Logic Corp",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPUTER SOFTWARE; DATABASE SYSTEMS; GEMSTONE DATA
MODEL; Management; OPAL LANGUAGE; OPERATIONAL
SEMANTICS; SMALLTALK SYSTEM",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Hall:1984:RAL,
author = "Patrick A. V. Hall",
title = "Relational algebras, logic, and functional
programming",
journal = j-SIGMOD,
volume = "14",
number = "2",
pages = "326--333",
year = "1984",
CODEN = "SRECD8",
ISBN = "0-89791-128-8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 07:58:51 MST 1996",
bibsource = "Compendex database",
abstract = "Relational algebras as developed by Codd and his
followers are extended by noting an equivalence with
functional languages. This leads to higher order
relations, recursive definitions of relations, and the
use of higher order relations as recursive data
structures. This equivalence on the one hand enables
the technology of databases to be used within the
context of applicative languages, and on the other hand
removes the ad hoc mechanisms used for higher order
operations in relational databases. This leads from 4th
to 5th generation data management, exploiting the
mathematical foundations of functional languages and
logic programming, and the technology of relational
database.",
acknowledgement = ack-nhfb,
affiliation = "Cirrus Computers Ltd, Fareham, Engl",
affiliationaddress = "Cirrus Computers Ltd, Fareham, Engl",
classification = "723; 901",
conference = "SIGMOD '84, Proceedings of Annual Meeting (ACM Special
Interest Group on Management of Data).",
keywords = "COMPUTER SOFTWARE; DATABASE SYSTEMS; FUNCTIONAL
LANGUAGES; LOGIC PROGRAMMING; Management; RECURSIVE
DEFINITIONS; RELATIONAL ALGEBRAS",
meetingaddress = "Boston, MA, USA",
sponsor = "ACM, Special Interest Group on Management of Data, New
York, NY, USA",
}
@Article{Ozsoyoglu:1985:LPO,
author = "Gultekin Ozsoyoglu and Z. Meral Ozsoyoglu and
Francisco Mata",
title = "A language and a physical organization technique for
summary tables",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "3--16",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Roussopoulos:1985:DSS,
author = "Nick Roussopoulos and Daniel Leifker",
title = "Direct spatial search on pictorial databases using
packed {R}-trees",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "17--31",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Christodoulakis:1985:IAD,
author = "S. Christodoulakis",
title = "Issues in the architecture of a document archiver
using optical disk technology",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "34--50",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Barbic:1985:TMO,
author = "F. Barbic and B. Pernici",
title = "Time modeling in office information systems",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "51--62",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Faloutsos:1985:SFD,
author = "Chris Faloutsos",
title = "Signature files: design and performance comparison of
some signature extraction methods",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "63--82",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Eick:1985:ATK,
author = "Christoph F. Eick and Peter C. Lockemann",
title = "Acquisition of terminological knowledge using database
design techniques",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "84--94",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Shin:1985:PRD,
author = "D. G. Shin and K. B. Irani",
title = "Partitioning a relational database horizontally using
a knowledge-based approach",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "95--105",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Agrawal:1985:MSC,
author = "Rakesh Agrawal and Michael J. Carey and Miron Livny",
title = "Models for studying concurrency control performance:
alternatives and implications",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "108--121",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Robinson:1985:FGP,
author = "John T. Robinson",
title = "A fast general-purpose hardware synchronization
mechanism",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "122--130",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Agrawal:1985:RAM,
author = "Rakesh Agrawal and David J. DeWitt",
title = "Recovery architectures for multiprocessor database
machines",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "131--145",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Batini:1985:DDM,
author = "Carlo Batini and Stefano Ceri and Al Hershey and
George Gardarin and David Reiner",
title = "Database design: methodologies, tools, and
environments (panel session)",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "148--150",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hsu:1985:ICM,
author = "Arding Hsu and Tomasz Imielinski",
title = "Integrity checking for multiple updates",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "152--168",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kung:1985:VDT,
author = "C. H. Kung",
title = "On verification of database temporal constraints",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "169--179",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kuper:1985:EPL,
author = "Gabriel M. Kuper and Moshe Y. Vardi",
title = "On the expressive power of the logical data model:
preliminary report",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "180--187",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Larson:1985:EPH,
author = "Per-Ake Larson and M. V. Ramakrishna",
title = "External perfect hashing",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "190--200",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kawagoe:1985:MDH,
author = "Kyoji Kawagoe",
title = "Modified dynamic hashing",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "201--213",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Otoo:1985:MDH,
author = "Ekow J. Otoo",
title = "A multidimensional digital hashing scheme for files
with composite keys",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "214--229",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sibley:1985:PDM,
author = "Edgar H. Sibley and Matthias Jarke and Cecil S. McMinn
and John Murray and Randall Rustin and Ken Sloan",
title = "Pragmatics of database management (panel session)",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "232--234",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Snodgrass:1985:TTD,
author = "Richard Snodgrass and Ilsoo Ahn",
title = "A taxonomy of time databases",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "236--246",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Clifford:1985:AHR,
author = "James Clifford and Abdullah Uz Tansel",
title = "On an algebra for historical relational databases: two
views",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "247--265",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Copeland:1985:DSM,
author = "George P. Copeland and Setrag N. Khoshafian",
title = "A decomposition storage model",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "268--279",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Yu:1985:AIS,
author = "C. T. Yu and C. H. Chen",
title = "Adaptive information system design: one query at a
time",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "280--290",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Beckley:1985:MRK,
author = "D. A. Beckley and M. W. Evens and V. K. Raman",
title = "Multikey retrieval from {K-d} trees and {QUAD}-trees",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "291--301",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Christodoulakis:1985:MDM,
author = "Starvos Christodoulakis and D. Badal and A. Cardenas
and P. Mantey and F. Tompa and D. Tsichritzis",
title = "Multimedia database management (panel session)",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "304--305",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Fushimi:1985:APE,
author = "Shinya Fushimi and Masaru Kitsuregawa and Masaya
Nakayama and Hidehiko Tanaka and Tohru Moto-oka",
title = "Algorithm and performance evaluation of adaptive
multidimensional clustering technique",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "308--318",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kamel:1985:MDD,
author = "Nabil Kamel and Roger King",
title = "A model of data distribution based on texture
analysis",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "319--325",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Goldman:1985:IIS,
author = "Kenneth J. Goldman and Sally A. Goldman and Paris C.
Kanellakis and Stanley B. Zdonik",
title = "{ISIS}: interface for a semantic information system",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "328--342",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Vossen:1985:HLU,
author = "Gottfried Vossen and Volkert Brosda",
title = "A high-level user interface for update and retrieval
in relational databases---language aspects",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "343--353",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Demo:1985:ACD,
author = "G. Barbara Demo and Sukhamay Kundu",
title = "Analysis of the context dependency of {CODASYL}
find-statements with application to a database program
conversion",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "354--361",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Acharya:1985:TRP,
author = "Shridhar Acharya and Gael Buckley",
title = "Transaction restarts in {Prolog} database systems",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "364--373",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Page:1985:GDD,
author = "Thomas W. {Page, Jr.} and Matthew J. Weinstein and
Gerald J. Popek",
title = "{Genesis}: a distributed database operating system",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "374--387",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Klahold:1985:TMS,
author = "P. Klahold and G. Schlageter and R. Unland and W.
Wilkes",
title = "A transaction model supporting complex applications in
integrated information systems",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "388--401",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sinha:1985:TBC,
author = "Mukul K. Sinha and P. D. Nandikar and S. L.
Mehndiratta",
title = "Timestamp based certification schemes for transactions
in distributed database systems",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "402--411",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kerschberg:1985:EDS,
author = "Larry Kerschberg and Michael Brodie and Charles
Kellogg and D. Stott Parker and Gio Wiederhold and
Carlo Zaniolo",
title = "Expert database systems (workshop review)",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "414--417",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bhargava:1985:RDD,
author = "Bharat Bhargava",
title = "Reliability in distributed database systems (panel
discussion)",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "420--422",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sellis:1985:OED,
author = "Timos K. Sellis and Leonard Shapiro",
title = "Optimization of extended database query languages",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "424--436",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gray:1985:EPA,
author = "P. M. D. Gray",
title = "Efficient {Prolog} access to {CODAYSL} and {FDM}
databases",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "437--443",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ullman:1985:ILQ,
author = "Jeffrey D. Ullman",
title = "Implementation of logical query languages for
databases (abstract only)",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "444--444",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Batory:1985:MCV,
author = "D. S. Batory and W. Kim",
title = "Modeling concepts for {VLSI CAD} objects (abstract
only)",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "446--446",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Blain:1985:MPC,
author = "Tomas Blain and Michael Dohler and Ralph Michaelis and
Emran Qureshi",
title = "Managing the printed circuit board design process",
journal = j-SIGMOD,
volume = "14",
number = "4",
pages = "447--456",
month = may,
year = "1985",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Sat Mar 6 07:33:54 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anonymous:1986:RMD,
author = "Anonymous",
title = "Reference model for {DBMS} standardization",
journal = j-SIGMOD,
volume = "15",
number = "1",
pages = "19--58",
month = mar,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:24 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Roussopoulos:1986:EIS,
author = "Nick Roussopoulos",
title = "Engineering information systems (Panel session):
builders and designers perspective",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "1--3",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Buneman:1986:IPD,
author = "Peter Buneman and Malcolm Atkinson",
title = "Inheritance and persistence in database programming
languages",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "4--15",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bancilhon:1986:AIR,
author = "Francois Bancilhon and Raghu Ramakrishnan",
title = "An amateur's introduction to recursive query
processing strategies",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "16--52",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lindsay:1986:SDR,
author = "Bruce Lindsay and Laura Haas and C. Mohan and Hamid
Pirahesh and Paul Wilms",
title = "A snapshot differential refresh algorithm",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "53--60",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Blakeley:1986:EUM,
author = "Jose A. Blakeley and Per-Ake Larson and Frank Wm
Tompa",
title = "Efficiently updating materialized views",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "61--71",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Moss:1986:ARM,
author = "J. Eliot B. Moss and Nancy D. Griffeth and Marc H.
Graham",
title = "Abstraction in recovery management",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "72--83",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Mackert:1986:ROV,
author = "Lothar F. Mackert and Guy M. Lohman",
title = "{R}* optimizer validation and performance evaluation
for local queries",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "84--95",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ahn:1986:PET,
author = "Ilsoo Ahn and Richard Snodgrass",
title = "Performance evaluation of a temporal database
management system",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "96--107",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Carey:1986:LBL,
author = "Michael J. Carey and Hongjun Lu",
title = "Load balancing in a locally distributed {DB} system",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "108--119",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Motro:1986:CQT,
author = "Amihai Motro",
title = "Constructing queries from tokens",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "120--131",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Delisle:1986:NHS,
author = "Norman Delisle and Mayer Schwartz",
title = "{Neptune}: a hypertext system for {CAD} applications",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "132--143",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Frasson:1986:PIB,
author = "C. Frasson and M. Er-radi",
title = "Principles of an icons-based language",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "144--152",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Boral:1986:PDS,
author = "Hanan Boral",
title = "Panel: Database system performance management",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "153--154",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gelder:1986:MPF,
author = "Allen Van Gelder",
title = "A message passing framework for logical query
evaluation",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "155--165",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rosenthal:1986:TRP,
author = "Arnon Rosenthal and Sandra Heiler and Umeshwar Dayal
and Frank Manola",
title = "Traversal recursion: a practical approach to
supporting recursive applications",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "166--176",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gardarin:1986:EDR,
author = "Georges Gardarin and Christophe de Maindreville",
title = "Evaluation of database recursive logic programs as
recurrent function series",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "177--186",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Batory:1986:PED,
author = "D. S. Batory and M. Mannino",
title = "Panel: Extensible database systems",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "187--190",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sellis:1986:GQO,
author = "Timos K. Sellis",
title = "Global query optimization",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "191--205",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Freytag:1986:RBT,
author = "Johann Christoph Freytag and Nathan Goodman",
title = "Rule-based transformation of relational queries into
iterative programs",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "206--214",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Wedekind:1986:PRD,
author = "H. Wedekind and George Zoerntlein",
title = "Prefetching in realtime database applications",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "215--226",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Faloutsos:1986:MHU,
author = "Christos Faloutsos",
title = "Multiattribute hashing using {Gray} codes",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "227--238",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lehman:1986:QPM,
author = "Tobin J. Lehman and Michael J. Carey",
title = "Query processing in main memory database management
systems",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "239--250",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Willard:1986:GWC,
author = "Dan E. Willard",
title = "Good worst-case algorithms for inserting and deleting
records in dense sequential files",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "251--260",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Harandi:1986:RBM,
author = "Mehdi T. Harandi and Thierry Schang and Seth Cohen",
title = "Rule base management using meta knowledge",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "261--267",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Imielinski:1986:QPD,
author = "Tomasz Imieli{\'n}ski",
title = "Query processing in deductive databases with
incomplete information",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "268--280",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Chen:1986:RBO,
author = "Qiming Chen",
title = "A rule-based object\slash task modelling approach",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "281--292",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anderson:1986:PUI,
author = "T. Lougenia Anderson and Gad Ariav",
title = "Panel: user interfaces and database management
systems",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "293--294",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Christodoulakis:1986:MOP,
author = "S. Christodoulakis and F. Ho and M. Theodoridou",
title = "The multimedia object presentation manager of {MINOS}:
a symmetric approach",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "295--310",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Woelk:1986:OOA,
author = "Darrell Woelk and Won Kim and Willis Luther",
title = "An object-oriented approach to multimedia databases",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "311--325",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Orenstein:1986:SQP,
author = "Jack A. Orenstein",
title = "Spatial query processing in an object-oriented
database system",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "326--336",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bitton:1986:PEL,
author = "Dina Bitton",
title = "Panel: The effect of large main memory on database
systems",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "337--339",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Stonebraker:1986:DP,
author = "Michael Stonebraker and Lawrence A. Rowe",
title = "The design of {POSTGRES}",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "340--355",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Dadam:1986:DPS,
author = "P. Dadam and K. Kuespert and F. Andersen and H.
Blanken and R. Erbe",
title = "A {DBMS} prototype to support extended {NF2}
relations: an integrated view on flat tables and
hierarchies",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "356--367",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bocca:1986:ESE,
author = "Jorge Bocca",
title = "On the evaluation strategy of {EDUCE}",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "368--378",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Katz:1986:VMC,
author = "Randy H. Katz and Ellis Chang and Rajiv Bhateja",
title = "Version modeling concepts for computer-aided design
databases",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "379--386",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lipeck:1986:SSD,
author = "Udo W. Lipeck",
title = "Stepwise specification of dynamic database behaviour",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "387--397",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Biskup:1986:FVI,
author = "Joachim Biskup and Bernhard Convent",
title = "A formal view integration method",
journal = j-SIGMOD,
volume = "15",
number = "2",
pages = "398--407",
month = jun,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:25 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Fong:1986:DBD,
author = "Elizabeth N. Fong and Alan H. Goldfine",
title = "Data base directions information resource
management-making it work, executive summary",
journal = j-SIGMOD,
volume = "15",
number = "3",
pages = "3--10",
month = sep,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:26 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Bancilhon:1986:LPO,
author = "Francois Bancilhon",
title = "A logic-programming\slash object-oriented cocktail",
journal = j-SIGMOD,
volume = "15",
number = "3",
pages = "11--21",
month = sep,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:26 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Dittrich:1986:ETM,
author = "Klaus R. Dittrich and Angelika M. Kotz and Jutta A.
M{\"u}lle",
title = "An event\slash trigger mechanism to enforce complex
consistency constraints in design databases",
journal = j-SIGMOD,
volume = "15",
number = "3",
pages = "22--36",
month = sep,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:26 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Elmagarmid:1986:SDD,
author = "Ahmed K. Elmagarmid",
title = "A survey of distributed deadlock detection
algorithms",
journal = j-SIGMOD,
volume = "15",
number = "3",
pages = "37--45",
month = sep,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:26 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Anderson:1986:PBR,
author = "T. Lougenia Anderson and Earl F. Ecklund and David
Maier",
title = "The proteus bibliography: Representation and
interactive display in databases",
journal = j-SIGMOD,
volume = "15",
number = "3",
pages = "46--55",
month = sep,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:26 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Salzberg:1986:TNF,
author = "Betty Salzberg",
title = "Third normal form made easy",
journal = j-SIGMOD,
volume = "15",
number = "4",
pages = "2--18",
month = dec,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:27 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Codd:1986:MIA,
author = "E. F. Codd",
title = "Missing information (applicable and inapplicable) in
relational databases",
journal = j-SIGMOD,
volume = "15",
number = "4",
pages = "53--53",
month = dec,
year = "1986",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:27 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Minker:1987:HRS,
author = "Jack Minker",
title = "Human rights: some perspectives",
journal = j-SIGMOD,
volume = "16",
number = "1",
pages = "18--27",
month = mar,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:27 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kumar:1987:EJS,
author = "Akhil Kumar and Michael Stonebraker",
title = "The effect of join selectives on optimal nesting
order",
journal = j-SIGMOD,
volume = "16",
number = "1",
pages = "28--41",
month = mar,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:27 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Codd:1987:MCM,
author = "E. F. Codd",
title = "More commentary on missing information in relational
databases (applicable and inapplicable information)",
journal = j-SIGMOD,
volume = "16",
number = "1",
pages = "42--50",
month = mar,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:27 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Neff:1987:DBC,
author = "R. K. Neff",
title = "Data bases, compound objects, and networked
workstations: Beyond distributed computing (Abstract)",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "1--1",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ingenthron:1987:TDR,
author = "Kurt Ingenthron",
title = "Thoughts on database research: {A} user perspective",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "2--2",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ioannidis:1987:QOS,
author = "Yannis E. Ioannidis and Eugene Wong",
title = "Query optimization by simulated annealing",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "9--22",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ganski:1987:ONS,
author = "Richard A. Ganski and Harry K. T. Wong",
title = "Optimization of nested {SQL} queries revisited",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "23--33",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Abiteboul:1987:RQS,
author = "Serge Abiteboul and Paris Kanellakis and Gosta
Grahne",
title = "On the representation and querying of sets of possible
worlds",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "34--48",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sacca:1987:MCM,
author = "Domenico Sacca and Carlo Zaniolo",
title = "Magic counting methods",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "49--59",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Aly:1987:NDM,
author = "Hussien Aly and Z. Meral Ozsoyoglu",
title = "Non-deterministic modelling of logical queries in
deductive databases",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "60--72",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Han:1987:HRP,
author = "Jiawei Han and Lawrence J. Henschen",
title = "Handling redundancy in the processing of recursive
database queries",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "73--81",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Daniels:1987:DLT,
author = "Dean S. Daniels and Alfred Z. Spector and Dean S.
Thompson",
title = "Distributed logging for transaction processing",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "82--96",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Herman:1987:DAV,
author = "Gary Herman and K. C. Lee and Abel Weinrib",
title = "The datacycle architecture for very high throughput
database systems",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "97--103",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lehman:1987:RAH,
author = "Tobin J. Lehman and Michael J. Carey",
title = "A recovery algorithm for a high-performance
memory-resident database system",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "104--117",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Nixon:1987:ICS,
author = "Brian Nixon and Lawrence Chung and John Mylopoulos and
David Lauzon and Alex Borgida and M. Stanley",
title = "Implementation of a compiler for a semantic data
model: Experiences with taxis",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "118--131",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lyngbaek:1987:MSD,
author = "Peter Lyngbaek and Victor Vianu",
title = "Mapping a semantic database model to the relational
model",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "132--142",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Roth:1987:DSR,
author = "Mark A. Roth and Henry F. Korth",
title = "The design of {$\neg1$NF} relational databases into
nested normal form",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "143--159",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Graefe:1987:EOG,
author = "Goetz Graefe and David J. DeWitt",
title = "The {EXODUS} optimizer generator",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "160--172",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Freytag:1987:RBV,
author = "Johann Christoph Freytag",
title = "A rule-based view of query optimization",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "173--180",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Shenoy:1987:SSQ,
author = "Sreekumar T. Shenoy and Z. Meral Ozsoyoglu",
title = "A system for semantic query optimization",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "181--195",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Paul:1987:AID,
author = "H. B. Paul and H. J. Schek and M. H. Scholl",
title = "Architecture and implementation of the {Darmstadt}
database kernel system",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "196--207",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Richardson:1987:PCD,
author = "Joel E. Richardson and Michael J. Carey",
title = "Programming constructs for database system
implementation in {EXODUS}",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "208--219",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lindsay:1987:DME,
author = "Bruce Lindsay and John McPherson and Hamid Pirahesh",
title = "A data management extension architecture",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "220--226",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Jajodia:1987:DV,
author = "Sushil Jajodia and David Mutchler",
title = "Dynamic voting",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "227--238",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Haerder:1987:CTR,
author = "Theo Haerder and Kurt Rothermel",
title = "Concepts for transaction recovery in nested
transactions",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "239--248",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Garcia-Molina:1987:S,
author = "Hector Garcia-Molina and Kenneth Salem",
title = "Sagas",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "249--259",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Freeston:1987:BFN,
author = "Michael Freeston",
title = "The {BANG} file: {A} new kind of grid file",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "260--269",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Nelson:1987:PAH,
author = "Randal C. Nelson and Hanan Samet",
title = "A population analysis for hierarchical data
structures",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "270--277",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sellis:1987:ESP,
author = "Timos K. Sellis",
title = "Efficiently supporting procedures in relational
database systems",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "278--291",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hardwick:1987:WRF,
author = "Martin Hardwick",
title = "Why {ROSE} is fast: Five optimizations in the design
of an experimental database system for {CAD\slash CAM}
applications",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "292--298",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Kemper:1987:OOS,
author = "Alfons Kemper and Peter C. Lockemann and Mechtild
Wallrath",
title = "An object-oriented system for engineering
applications",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "299--310",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Banerjee:1987:SIS,
author = "Jay Banerjee and Won Kim and Hyoung-Joo Kim and Henry
F. Korth",
title = "Semantics and implementation of schema evolution in
object-oriented databases",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "311--322",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Cruz:1987:GQL,
author = "Isabel F. Cruz and Alberto O. Mendelzon and Peter T.
Wood",
title = "A graphical query language supporting recursion",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "323--330",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Jagadish:1987:STC,
author = "H. V. Jagadish and Rakesh Agrawal and Linda Ness",
title = "A study of transitive closure as a recursion
mechanism",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "331--344",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Zhang:1987:NCD,
author = "Weining Zhang and C. T. Yu",
title = "A necessary condition for a doubly recursive rule to
be equivalent to a linear recursive rule",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "345--356",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Morgenstern:1987:SIM,
author = "Matthew Morgenstern",
title = "Security and inference in multilevel database and
knowledge-base systems",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "357--373",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Stemple:1987:MMF,
author = "David Stemple and Subhasish Mazumdar and Tim Sheard",
title = "On the modes and meaning of feedback to transaction
designers",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "374--386",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rubenstein:1987:BSD,
author = "W. B. Rubenstein and M. S. Kubicar and R. G. G.
Cattell",
title = "Benchmarking simple database operations",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "387--394",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gray:1987:MRT,
author = "Jim Gray and Franco Putzolu",
title = "The 5 minute rule for trading memory for disc accesses
and the 10 byte rule for trading memory for {CPU}
time",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "395--398",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Richardson:1987:DEP,
author = "James P. Richardson and Hongjun Lu and Krishna
Mikkilineni",
title = "Design and evaluation of parallel pipelined join
algorithms",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "399--409",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Butler:1987:SRO,
author = "Margaret H. Butler",
title = "Storage reclamation in object oriented database
systems",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "410--425",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Faloutsos:1987:AOO,
author = "Christos Faloutsos and Timos Sellis and Nick
Roussopoulos",
title = "Analysis of object oriented spatial access methods",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "426--439",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hanson:1987:PAV,
author = "Eric N. Hanson",
title = "A performance analysis of view materialization
strategies",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "440--453",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Segev:1987:LMT,
author = "Arie Segev and Arie Shoshani",
title = "Logical modeling of temporal data",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "454--466",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{McKenzie:1987:ERA,
author = "Edwin McKenzie and Richard Snodgrass",
title = "Extending the relational algebra to support
transaction time",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "467--478",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Rubenstein:1987:DDM,
author = "W. Bradley Rubenstein",
title = "A database design for musical information",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "479--490",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Hudson:1987:OOD,
author = "Scott E. Hudson and Roger King",
title = "Object-oriented database support for software
environments",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "491--503",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Croft:1987:SOD,
author = "W. B. Croft and D. W. Stemple",
title = "Supporting office document architectures with
constrained types",
journal = j-SIGMOD,
volume = "16",
number = "3",
pages = "504--509",
month = dec,
year = "1987",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:28 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Stankovic:1988:RTT,
author = "John A. Stankovic and Wei Zhao",
title = "On real-time transactions",
journal = j-SIGMOD,
volume = "17",
number = "1",
pages = "4--18",
month = mar,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:29 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Singhal:1988:IAD,
author = "Mukesh Singhal",
title = "Issues and approaches to design of real-time database
systems",
journal = j-SIGMOD,
volume = "17",
number = "1",
pages = "19--33",
month = mar,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:29 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Lin:1988:EAD,
author = "Kwei-Jay Lin and Ming-Ju Lin",
title = "Enhancing availability in distributed real-time
databases",
journal = j-SIGMOD,
volume = "17",
number = "1",
pages = "34--43",
month = mar,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:29 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{vonBultzingsloewen:1988:KDD,
author = "Gunter von Bultzingsloewen and Klaus R. Dittrich",
title = "Kardamom --- a dataflow database machine for real-time
applications",
journal = j-SIGMOD,
volume = "17",
number = "1",
pages = "44--50",
month = mar,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:29 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Carey:1988:HPC,
author = "M. J. Carey and M. Livny and R. Jauhari",
title = "The Hi{PAC} project: combining active databases and
timing constraints",
journal = j-SIGMOD,
volume = "17",
number = "1",
pages = "51--70",
month = mar,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:29 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Abbott:1988:SRT,
author = "Robert Abbott and Hector Garcia-Molina",
title = "Scheduling real-time transactions",
journal = j-SIGMOD,
volume = "17",
number = "1",
pages = "71--81",
month = mar,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:29 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Sha:1988:CCD,
author = "Lui Sha and Ragunathan Rajkumar and John P.
Lehooczky",
title = "Concurrency control for distributed real-time
databases",
journal = j-SIGMOD,
volume = "17",
number = "1",
pages = "82--98",
month = mar,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:29 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Jiang:1988:DDR,
author = "Bin Jiang",
title = "Deadlock detection is really cheap",
journal = j-SIGMOD,
volume = "17",
number = "2",
pages = "2--13",
month = jun,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:29 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Shaw:1988:ADD,
author = "Christopher J. Shaw",
title = "Application and database design --- putting it off",
journal = j-SIGMOD,
volume = "17",
number = "2",
pages = "14--22",
month = jun,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:29 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Gersting:1988:RMD,
author = "John Gersting and Kate Kinsley and Nancy McDonald and
John North and Mark Sastry and Edward Stull",
title = "Reference model for {DBMS} user facility",
journal = j-SIGMOD,
volume = "17",
number = "2",
pages = "23--52",
month = jun,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:29 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Date:1988:DDT,
author = "C. J. Date",
title = "Defining data types in a database language",
journal = j-SIGMOD,
volume = "17",
number = "2",
pages = "53--76",
month = jun,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:29 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Ghosh:1988:IPI,
author = "S. Ghosh and C. C. Lin and T. Sellis",
title = "Implementation of a {Prolog-INGRES} interface",
journal = j-SIGMOD,
volume = "17",
number = "2",
pages = "77--88",
month = jun,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:29 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Keller:1988:CUB,
author = "Arthur M. Keller and Gio Wiederhold",
title = "Concurrent use of {B}-trees with variable-length
entries",
journal = j-SIGMOD,
volume = "17",
number = "2",
pages = "89--90",
month = jun,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:29 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Thatte:1988:OOD,
author = "Satish M. Thatte",
title = "Object-oriented database workshop: implementation
aspects",
journal = j-SIGMOD,
volume = "17",
number = "2",
pages = "95--107",
month = jun,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:29 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Murtagh:1988:ALD,
author = "F. Murtagh",
title = "Astronomy from large databases: scientific objectives
and methodological approaches",
journal = j-SIGMOD,
volume = "17",
number = "2",
pages = "108--111",
month = jun,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:29 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
}
@Article{Swami:1988:OLJ,
author = "A. Swami and A. Gupta",
title = "Optimization of large join queries",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "8--17",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Stanford Univ., CA, USA",
classification = "C1140Z (Other and miscellaneous); C1160
(Combinatorial mathematics); C1180 (Optimisation
techniques); C4250 (Database theory)",
keywords = "Analysis of variance; ANOVA; Combinatorial
optimization; Database theory; Factorial experiments;
Iterative improvement; Join query optimization; Optimal
join order; Select-project-join queries; Simulated
annealing",
thesaurus = "Combinatorial mathematics; Database theory;
Optimisation; Statistical analysis",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Lohman:1988:GFR,
author = "G. M. Lohman",
title = "Grammar-like functional rules for representing query
optimization alternatives",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "18--27",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "IBM Almaden Res. Center, San Jose, CA, USA",
classification = "C4210 (Formal logic); C4250 (Database theory); C6160
(Database management systems (DBMS))",
keywords = "Base-level database operations; Directed graphs;
Expert systems; Functional rules; Grammar; Production
rules; Query optimization",
thesaurus = "Database management systems; Database theory; Directed
graphs; Grammars; Optimisation",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Muralikrishna:1988:EHE,
author = "M. Muralikrishna and D. J. DeWitt",
title = "Equi-depth histograms for estimating selectivity
factors for multi-dimensional queries",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "28--36",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Digital Equipment Corp., Colorado Springs, CO, USA",
classification = "C4250 (Database theory); C6120 (File organisation);
C6160 (Database management systems (DBMS))",
keywords = "D-dimensional histogram; Data structure; Equi depth
histograms; Multi-dimensional histograms;
Multi-dimensional queries; Query optimisation; Sampling
technique; Selectivity factors; Sorting",
thesaurus = "Data structures; Database management systems; Database
theory; Optimisation; Sorting",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Garza:1988:TMO,
author = "J. F. Garza and Won Kim",
title = "Transaction management in an object-oriented database
system",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "37--45",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Microelectron. and Comput. Technol. Corp., Austin, TX,
USA",
classification = "C6120 (File organisation); C6150J (Operating
systems); C6160Z (Other DBMS)",
keywords = "Concurrency control; Hypothetical transactions;
Locking; Locking requirements; Logging; Object-oriented
data model; Object-oriented database; ORION; Storage
allocation; Storage management; Transaction management;
Transaction recovery",
thesaurus = "Database management systems; Operating systems
[computers]; Storage allocation; Storage management;
System recovery",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Jagannathan:1988:SDS,
author = "D. Jagannathan and R. L. Guck and B. L. Fritchman and
J. P. Thompson and D. M. Tolbert",
title = "{SIM}: a database system based on the semantic data
model",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "46--55",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Unisys Corp., Irvine, CA, USA",
classification = "C6120 (File organisation); C6160Z (Other DBMS)",
keywords = "Data integrity; Data structures; Database management
system; Database system; Directed acyclic graphs; DML;
Integrity constraints; Interobject relationships;
Modeling goals; Object oriented database; Query
languages; Schema definition; Semantic data model;
SIM",
thesaurus = "Data structures; Database management systems; Directed
graphs; Query languages",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Caruso:1988:MCO,
author = "M. Caruso and E. Sciore",
title = "Meta-functions and contexts in an object-oriented
database language",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "56--65",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Innovative Syst. Techniques, Newton, MA, USA",
classification = "C6120 (File organisation); C6140D (High level
languages); C6160Z (Other DBMS)",
keywords = "Concurrency control; Contexts; Data structures;
Database language; Investment analysis; Meta functions;
Object-oriented database; Query language; Statistical
applications; Version control; VISION",
thesaurus = "Data structures; Database management systems;
Investment; Query languages; Statistics",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Laurent:1988:PSI,
author = "D. Laurent and N. Spyratos",
title = "Partition semantics for incomplete information in
relational databases",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "66--73",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "LIFO, Orleans Univ., France",
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4250 (Database theory); C6160D (Relational
DBMS)",
keywords = "Formal logic; Functional dependencies; Incomplete
information; Partition semantics; Query processing;
Relational databases; Set theory",
thesaurus = "Database theory; Formal logic; Relational databases;
Set theory",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Yuan:1988:SCQ,
author = "Li Yan Yuan and Ding-An Chiang",
title = "A sound and complete query evaluation algorithm for
relational databases with null values",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "74--81",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Center for Adv. Comput. Studies, Southwestern
Louisiana Univ., Lafayette, LA, USA",
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4250 (Database theory); C6160D (Relational
DBMS)",
keywords = "Extended relational theory; Formal logic; Indefinite
information; Null values; Query evaluation; Relational
databases; Set theory",
thesaurus = "Database theory; Formal logic; Relational databases;
Set theory",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Malvestuto:1988:DPS,
author = "F. M. Malvestuto",
title = "The derivation problem for summary data",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "82--89",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "ENEA, Roma, Italy",
classification = "C4250 (Database theory)",
keywords = "Classification criterion; Data refinement; Graph
representation; Statistical database; Summary data;
Summary tables",
thesaurus = "Classification; Database theory; Statistics",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Alexander:1988:PDC,
author = "W. Alexander and G. Copeland",
title = "Process and dataflow control in distributed
data-intensive systems",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "90--98",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "MCC, Austin, TX, USA",
classification = "C5440 (Multiprocessor systems and techniques);
C6150J (Operating systems); C6160B (Distributed DBMS)",
keywords = "Data transfer; Data-dependent; Dataflow architectures;
Dataflow control; Dataflow-operation activation;
Distributed data-intensive systems; Distributed
databases; Load balancing; Parallel machines; Program
loading",
thesaurus = "Distributed databases; Operating systems [computers];
Parallel machines; System recovery",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Copeland:1988:DPB,
author = "G. Copeland and W. Alexander and E. Boughter and T.
Keller",
title = "Data placement in Bubba",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "99--108",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "MCC, Austin, TX, USA",
classification = "C5440 (Multiprocessor systems and techniques); C6120
(File organisation); C6150J (Operating systems)",
keywords = "Bubba; Data placement; Declustering; File
organisation; Load balancing; Parallel machines;
Storage allocation",
thesaurus = "File organisation; Parallel machines; Storage
allocation",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Patterson:1988:CRA,
author = "D. A. Patterson and G. Gibson and R. H. Katz",
title = "A case for redundant arrays of inexpensive disks
({RAID})",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "109--116",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Electr. Eng. and Comput. Sci., California
Univ., Berkeley, CA, USA",
classification = "C5320C (Storage on moving magnetic media); C5470
(Performance evaluation and testing)",
keywords = "Fujitsu Super Eagle; I/O; IBM 3380; Inexpensive disks;
Magnetic disk technology; Performance evaluation; RAID;
Redundant arrays",
thesaurus = "Magnetic disc storage; Performance evaluation;
Redundancy; Storage allocation",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Kumar:1988:SBT,
author = "A. Kumar and M. Stonebraker",
title = "Semantics based transaction management techniques for
replicated data",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "117--125",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "California Univ., Berkeley, CA, USA",
classification = "C4240 (Programming and algorithm theory); C4250
(Database theory); C6130 (Data handling techniques);
C6160B (Distributed DBMS)",
keywords = "Application semantics; Distributed database;
Multi-copy algorithm; Performance comparison;
Replicated data; Transaction management",
thesaurus = "Data handling; Database theory; Distributed databases;
File organisation; Program verification",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{ElAbbadi:1988:GPC,
author = "A. El Abbadi and S. Toueg",
title = "The group paradigm for concurrency control protocols",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "126--134",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., California Univ., Santa
Barbara, CA, USA",
classification = "C4240 (Programming and algorithm theory); C4250
(Database theory); C6160B (Distributed DBMS)",
keywords = "Communication restrictions; Concurrency control
protocols; Correctness; Distributed databases; Group
paradigm; One-copy serializability; Replicated
databases",
thesaurus = "Database theory; Distributed databases; Program
verification; Programming theory; Protocols",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Breitbart:1988:MUI,
author = "Y. Breitbart and A. Silberschatz",
title = "Multidatabase update issues",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "135--142",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Kentucky Univ., Lexington, KY,
USA",
classification = "C4240 (Programming and algorithm theory); C4250
(Database theory); C6160 (Database management systems
(DBMS))",
keywords = "Complexity; Concurrency control; Concurrent execution;
Correctness; Data updates; Deadlock freedom; Global
transactions; Multidatabase environment; Protocol",
thesaurus = "Computational complexity; Database management systems;
Database theory; Program verification; Programming
theory; Protocols; System recovery",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Abiteboul:1988:DFD,
author = "S. Abiteboul and R. Hull",
title = "Data functions, datalog and negation",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "143--153",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Inst. Nat. de Recherche en Inf. et en Autom.,
Rocquencourt, France",
classification = "C4210 (Formal logic); C4250 (Database theory)",
keywords = "COL; Complex Object Language; Data functions; Database
objects; Datalog; Decidable; Deductive databases;
Function symbol; Negation; Pairwise consistency; Query
languages; Relational databases; Semantic models;
Set-valued data functions; Syntactic restriction;
Undecidable",
thesaurus = "Database theory; Decidability; Formal logic;
Functions; Query languages; Relational databases",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Krishnamurthy:1988:FTS,
author = "R. Krishnamurthy and R. Ramakrishnan and O. Shmueli",
title = "A framework for testing safety and effective
computability of extended datalog",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "154--163",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "MCC, Austin, TX, USA",
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
keywords = "Bottom-up fixpoint computation; Correctness; Extended
datalog; Finiteness constraints; Formal proof; Function
symbols; Infinite base relations; LDL language; Logic
program testing; Monotonicity constraints; Recursive
algorithm",
thesaurus = "Logic programming; Program testing; Program
verification; Programming theory; Recursive functions",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Chen:1988:IMR,
author = "Qiming Chen and G. Gardarin",
title = "An implementation model for reasoning with complex
objects",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "164--172",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "SM Res. Inst., Beijing, China",
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory); C4250 (Database theory)",
keywords = "Complex objects; Logical databases; Mapping; Natural
syntactical extension; Nested predicates;
NESTEDDATALOG; Reasoning; Referential information
sharing; Relational DBMS; Relational model; Rule
language; Token object model",
thesaurus = "Database theory; Formal languages; Formal logic; Logic
programming; Relational databases",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Kim:1988:OFD,
author = "M. H. Kim and S. Pramanik",
title = "Optimal file distribution for partial match
retrieval",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "173--182",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Michigan State Univ., East
Lansing, MI, USA",
classification = "C1140Z (Other and miscellaneous); C1180
(Optimisation techniques); C4250 (Database theory);
C6120 (File organisation)",
keywords = "Data access concurrency; Data distribution;
Exclusive-or operation; Field transformation; Fieldwise
exclusive; File distribution; File organisation; FX
distribution; Optimal distribution; Parallel processing
environment; Partial match retrieval; Partial match
retrieval type queries; Probability; Query response
time",
thesaurus = "Database theory; File organisation; Optimisation;
Parallel programming; Probability",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Hutflesz:1988:TGF,
author = "A. Hutflesz and H.-W. Six and P. Widmayer",
title = "Twin grid files: space optimizing access schemes",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "183--190",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Karlsruhe Univ., West Germany",
classification = "C4240 (Programming and algorithm theory); C4250
(Database theory); C6120 (File organisation)",
keywords = "Complexity; Dynamic twin grid file; Optimal static
twin grid file; Performances; Range queries; Spatial
searching; Standard grid file; Storage space
utilization; Two grid files",
thesaurus = "Computational complexity; Database theory; File
organisation; Optimisation; Storage management",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Ramakrishna:1988:HPA,
author = "M. V. Ramakrishna",
title = "Hashing in practice, analysis of hashing and universal
hashing",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "191--199",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Michigan State Univ., East
Lansing, MI, USA",
classification = "C6120 (File organisation)",
keywords = "Analytical results; Collision resolution; Division
method; Expected worst case performance; Hashing;
Longest probe sequence; Overflow handling; Successful
search lengths; Universal hashing; Unsuccessful search
lengths",
thesaurus = "File organisation",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Ioannidis:1988:DMD,
author = "E. Y. Ioannidis and M. Livny",
title = "Data modeling in {DELAB}",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "200",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
USA",
classification = "C6160D (Relational DBMS); C7000 (Computer
applications)",
keywords = "Data management problem; Data model; DELAB simulation
laboratory; DENET; MOOSE data model; Object oriented;
Simulation studies; Special purpose relational DBMS",
thesaurus = "Data structures; Digital simulation; Relational
databases; Simulation languages",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Ono:1988:DMT,
author = "K. Ono and M. Aoyama and H. Fujimoto",
title = "Data management of telecommunication networks",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "201",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Div. of Telecommun. Software, Fujitsu Ltd., Kawasaki,
Japan",
classification = "B6210 (Telecommunication applications); C6160B
(Distributed DBMS)",
keywords = "Data management; Database; SYDGN; Telecommunication
networks; Telecommunication service",
thesaurus = "Distributed databases; Telecommunication networks",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Alho:1988:DDM,
author = "K. Alho and H. Peltonen and M. Mantyla and R.
Sulonen",
title = "A design data manager",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "202",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Helsinki Univ. of Technol.,
Espoo, Finland",
classification = "C6160D (Relational DBMS); C6180 (User interfaces);
C7400 (Engineering)",
keywords = "Attributes; Data objects; Design data; Design data
manager; Entity relationship model; Hierarchical tree;
HutBase; Object management system; Procedural
application interface; Prototype data model; User
interface; Visual design data manager",
thesaurus = "CAD; Relational databases; User interfaces",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{NaeymiRad:1988:RDD,
author = "F. Naeymi-Rad and L. Carmony and D. Trace and C.
Georgakis and M. H. Weil and M. Evens",
title = "A relational database design in support of standard
medical terminology in multi-domain knowledge bases",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "203",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Univ. of Health Sci., North Chicago, IL, USA",
classification = "C6160D (Relational DBMS); C6170 (Expert systems);
C7330 (Biology and medicine)",
keywords = "Disorder patterns; Domain experts; Feature dictionary;
Grammar; Knowledge engineering tools; MEDAS; Medical
diagnostic consultant system; Multi-domain knowledge
bases; Relational database design; Standard medical
terminology; TOOL BOX",
thesaurus = "Expert systems; Knowledge engineering; Medical
diagnostic computing; Relational databases",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Drew:1988:VOD,
author = "P. A. Drew and M. S. Ganti and D. J. Moore and R. J.
Nassif and S. Podar and D. H. Taenzer",
title = "Vishnu: an object-oriented database management system
supporting rapid prototyping",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "204",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
classification = "B6210 (Telecommunication applications); C6115
(Programming support); C6160B (Distributed DBMS);
C7410F (Communications)",
keywords = "Application prototypes; Data model; Database
functionality; Object-oriented database management
system; Rapid object-oriented prototyping environment;
Rapid prototyping; Software engineering environment;
Telecommunications networks; Vishnu",
thesaurus = "Distributed databases; Programming environments;
Telecommunication networks; Telecommunications
computing",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Fromm:1988:DSG,
author = "H. Fromm",
title = "Database services in the {German Bildschirmtext}
system ({Btx})",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "205",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "IBM Germany, Boeblingen, West Germany",
classification = "B6210K (Viewdata and teletext); C7210 (Information
services and centres)",
keywords = "Btx; Data model; Database management; Database
services; Electronic mail; External computers;
Information page retrieval; Information providers;
Interactive videotex system; Page editing facilities",
thesaurus = "Information services; Viewdata",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Vines:1988:GOF,
author = "D. Vines and T. King",
title = "{Gaia}: an object-oriented framework for an {Ada}
environment",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "206",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Honeywell Syst. and Res. Center, Minneapolis, MN,
USA",
classification = "C6115 (Programming support)",
keywords = "Ada environment; Development environment;
Extensibility; Gaia; Object oriented view;
Object-oriented framework; Off-the-shelf tools;
Portability; Self descriptive model",
thesaurus = "Ada; Programming environments; Software portability",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Kachhwaha:1988:LOD,
author = "P. Kachhwaha and R. Hogan",
title = "{LCE}: an object-oriented database application
development tool",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "207",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Sci. Software Products, Inc, Indianapolis, IN, USA",
classification = "C6160D (Relational DBMS); C7330 (Biology and
medicine)",
keywords = "Aggregation inheritance; Back-end relational database
management system; Enzyme induction assays; Instance
classification; Laboratory Computing Environment;
Laboratory database applications; LCE; Object storage;
Object-oriented database application development tool;
Rapid prototyping; Toxicology",
thesaurus = "Biology computing; Laboratory apparatus and
techniques; Relational databases",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Krieger:1988:ISM,
author = "H. Krieger and D. Schoenbauer and B. Strodthoff",
title = "Integrated storage and manipulation of data and text
based on a relational database",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "208",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
classification = "C6160D (Relational DBMS); C7106 (Word processing);
C7400 (Engineering)",
keywords = "CSP; Data manipulation; DB2; DisplayWrite/370;
Document information; Program function key; Relational
database; Text handling; Text manipulation; Word
processing",
thesaurus = "Engineering computing; Relational databases; System
documentation; Word processing",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Hernandez:1988:CCB,
author = "H. J. Hernandez and E. P. F. Chan",
title = "A characterization of constant-time-maintainability
for {BCNF} database schemes",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "209--217",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Texas A and M Univ., College
Station, TX, USA",
classification = "C4250 (Database theory)",
keywords = "BCNF database schemes; Boyce Codd normal form;
Constant-time-maintainability; Database scheme;
Decision problem; Embedding; Functional dependencies;
Key dependencies; Maintenance problem",
thesaurus = "Database theory; Decidability",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Leuchner:1988:PTA,
author = "J. Leuchner and L. Miller and G. Slutzki",
title = "A polynomial time algorithm for testing implications
of a join dependency and embodied functional
dependencies",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "218--224",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Iowa State Univ., Ames, IA, USA",
classification = "C4250 (Database theory)",
keywords = "Complete intersection graphs; Database theory;
Decidability; Embodied functional dependencies;
Implications; Join dependency; NP-complete; Polynomial
time; Polynomial time algorithm",
thesaurus = "Database theory; Decidability",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Gyssens:1988:PAR,
author = "M. Gyssens and D. Van Gucht",
title = "The powerset algebra as a result of adding programming
constructs to the nested relational algebra",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "225--232",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Antwerp Univ., Belgium",
classification = "C4250 (Database theory); C6160D (Relational DBMS)",
keywords = "For-loops; Nested relational algebra; Powerset
algebra; Programming constructs; While-loops",
thesaurus = "Database theory; Relational databases",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Mazumdar:1988:RTB,
author = "S. Mazumdar and D. Stemple and T. Sheard",
title = "Resolving the tension between integrity and security
using a theorem prover",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "233--242",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Massachusetts Univ., Amherst, MA, USA",
classification = "C4250 (Database theory); C6160 (Database management
systems (DBMS))",
keywords = "Databases; Disclosure; Integrity; Knowledge bases;
Secrets; Security; Security lapses; Semantics; Theorem
prover; Transaction compilation time",
thesaurus = "Database management systems; Database theory; Security
of data; Theorem proving",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Qian:1988:TLD,
author = "Xiaolei Qian and R. Waldinger",
title = "A transaction logic for database specification",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "243--250",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Stanford Univ., CA, USA",
classification = "C4210 (Formal logic); C4250 (Database theory)",
keywords = "Database specification; Dynamic behavior; Dynamic
integrity constraints; First-order situational logic;
Logical formalism; State transitions; Synthesis;
Transaction logic; Verification",
thesaurus = "Database theory; Formal logic",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Gadia:1988:GMR,
author = "S. K. Gadia and Chuen-Sing Yeung",
title = "A generalized model for a relational temporal
database",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "251--259",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Iowa State Univ., Ames, IA,
USA",
classification = "C4250 (Database theory); C6160D (Relational DBMS)",
keywords = "Boolean algebra; Generalized model; Multidimensional
time stamps; Past states; Relational temporal database;
Time stamping",
thesaurus = "Database theory; Relational databases",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Peinl:1988:HCS,
author = "P. Peinl and A. Reuter and H. Sammer",
title = "High contention in a stock trading database: a case
study",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "260--268",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Stuttgart Univ., West Germany",
classification = "C6160D (Relational DBMS); C7120 (Finance)",
keywords = "Application development; Contention; Data elements;
Data model; Extended data types; Implementation
techniques; Online transaction processing; Parallelism;
Stock trading database; Transaction oriented
programming",
thesaurus = "Commodity trading; Financial data processing;
Relational databases",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Haynie:1988:DLD,
author = "M. N. Haynie",
title = "A {DMBS} for large design automation databases",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "269--276",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Amdahl Corp, Sunnyvale, CA, USA",
classification = "C6160D (Relational DBMS); C7410D (Electronic
engineering); C7430 (Computer engineering)",
keywords = "Amdahl Corporation; CAD/CAM; Database management
systems; Design automation databases; LSI; Mainframe
computer designs; Object-oriented databases features;
Relational model; Tacoma; VLSI",
thesaurus = "CAD/CAM; Circuit CAD; Relational databases",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Bell:1988:SDM,
author = "J. L. Bell",
title = "A specialized data management system for parallel
execution of particle physics codes",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "277--285",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Math. and Comput. Sci., Colorado Sch. of
Mines, Golden, CO, USA",
classification = "C7320 (Physics and Chemistry)",
keywords = "Asynchronous I/O; Data management system; Horizontal
clustering; Parallel execution; Particle physics codes;
Shared memory multiprocessor environments",
thesaurus = "Digital simulation; Parallel programming; Physics
computing",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Christodoulakis:1988:PAF,
author = "S. Christodoulakis and D. A. Ford",
title = "Performance analysis and fundamental performance trade
offs for {CLV} optical disks",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "286--294",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada",
classification = "C5320K (Optical storage); C6160Z (Other DBMS)",
keywords = "Block boundaries; CD-ROM disks; CLV optical disks;
Optical disk technology; Physical database design; Read
mechanism; Retrieval performance",
thesaurus = "Database management systems; Optical disc storage;
Performance evaluation",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Hanson:1988:PQA,
author = "E. N. Hanson",
title = "Processing queries against database procedures: a
performance analysis",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "295--302",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Air Force Wright Aeronaut. Labs., Wright-Patterson
AFB, OH, USA",
classification = "C6160D (Relational DBMS)",
keywords = "Cached value; Database procedures; Differential view
maintenance algorithm; Performance analysis; Query
processing; Relational databases",
thesaurus = "Relational databases",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Jarke:1988:MKA,
author = "M. Jarke and T. Rose",
title = "Managing knowledge about information system
evolution",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "303--311",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Passau Univ., West Germany",
classification = "C6160 (Database management systems (DBMS)); C6170
(Expert systems)",
keywords = "Conceptual modelling language CML; Database software
development; Decision-centered documentation
methodology; Information system evolution; KBMS;
Knowledge base management system; Maintenance;
Tool-aided development process",
thesaurus = "Database management systems; Expert systems",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Naughton:1988:CSR,
author = "J. F. Naughton",
title = "Compiling separable recursions",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "312--319",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Princeton Univ., NJ, USA",
classification = "C4210 (Formal logic); C4250 (Database theory)",
keywords = "Database; Generalized counting algorithms; Generalized
magic sets; Queries evaluations; Recursive rules;
Selection constants; Separable recursions",
thesaurus = "Database theory; Recursive functions",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Youn:1988:CRF,
author = "Cheong Youn and J. L. Henschen",
title = "Classification of recursive formulas in deductive
databases",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "320--328",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of EE/CS, Northwestern Univ., Evaston, IL, USA",
classification = "C4210 (Formal logic); C4250 (Database theory)",
keywords = "Classification; Compilation; Deductive databases;
Linear recursive formulas; Optimization; Query
evaluation plans; Recursive formulas; Representative
query",
thesaurus = "Database theory; Recursive functions",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Wolfson:1988:DPL,
author = "O. Wolfson and A. Silberschatz",
title = "Distributed processing of logic programs",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "329--336",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Technion-Israel Inst. of
Technol., Haifa, Israel",
classification = "C4240 (Programming and algorithm theory); C6110
(Systems analysis and programming)",
keywords = "Distributed processing; Logic programs; Nonrecursive
programs; Parallel evaluation; Predicate
decomposability; Single rule programs; Sirups",
thesaurus = "Distributed processing; Logic programming; Programming
theory",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Anonymous:1988:BNS,
author = "Anonymous",
title = "A benchmark of {NonStop SQL} on the Debit Credit
transaction",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "337--341",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
classification = "C7120 (Finance)",
keywords = "ANSI SQL; Debit Credit transaction; NonStop SQL;
Record-at-a-time file system interface; Tandem Computer
Systems",
thesaurus = "Bank data processing; Query languages",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Borr:1988:HPS,
author = "A. J. Borr and F. Putzolu",
title = "High performance {SQL} through low-level system
integration",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "342--349",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Tandem Comput. Inc., Cupertino, CA, USA",
classification = "C6160D (Relational DBMS); C7120 (Finance)",
keywords = "Availability; Client; DBMS; I/O; Low-level system
integration; Message traffic savings; NonStop SQL;
Record access; Server level; Transaction management
subsystems; Transaction-based data integrity",
thesaurus = "Bank data processing; Query languages; Relational
databases",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{DeWitt:1988:PAG,
author = "D. J. DeWitt and S. Ghandeharizadeh and D. Schneider",
title = "A performance analysis of the Gamma database machine",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "350--360",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
USA",
classification = "C4250 (Database theory); C5470 (Performance
evaluation and testing); C6160 (Database management
systems (DBMS))",
keywords = "Execution time; Gamma database machine; Indices; Join
queries; Performance analysis; Relation size; Response
time; Selection queries; Teradata DBC/1012 database
machine",
thesaurus = "Database theory; Performance evaluation; Relational
databases; Special purpose computers",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Roesler:1988:DRS,
author = "M. Roesler and W. A. Burkhard",
title = "Deadlock resolution and semantic lock models in
object-oriented distributed systems",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "361--370",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci. and Eng., California Univ., San
Diego, La Jolla, CA, USA",
classification = "C6160B (Distributed DBMS)",
keywords = "Deadlock resolution; Object-oriented distributed
systems; Resource deadlocks; Semantic lock models",
thesaurus = "Distributed databases; Distributed processing",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Ramarao:1988:CPD,
author = "K. V. S. Ramarao",
title = "Commitment in a partitioned distributed database",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "371--378",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA",
classification = "C6160B (Distributed DBMS)",
keywords = "Failure types; Network partition; Partitioned
distributed database; Protocols; Transaction commitment
problem",
thesaurus = "Distributed databases",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Korth:1988:FMC,
author = "H. F. Korth and G. D. Speegle",
title = "Formal model of correctness without serializability",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "379--386",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Texas Univ., Austin, TX, USA",
classification = "C4250 (Database theory)",
keywords = "Computer-aided design; Correctness; Data-processing;
Database concepts; Office information systems;
Protocols; Serializability; Transaction processing",
thesaurus = "Database theory",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Ramnarayan:1988:DBM,
author = "R. Ramnarayan and Hongjun Lu",
title = "A data\slash knowledge base management testbed and
experimental results on data\slash knowledge base query
and update processing",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "387--395",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Div. of Honeywell Corp. Syst. Dev., Golden Valley, MN,
USA",
classification = "C6160D (Relational DBMS); C6170 (Expert systems)",
keywords = "Commercial relational database system; Data
structures; Data/knowledge base management testbed;
Data/knowledge base query; Database management system;
Embedded-SQL programs; Horn clauses; Knowledge manager;
Logic programming; Queries; Update processing",
thesaurus = "Expert systems; Logic programming; Relational
databases",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Delcambre:1988:SIR,
author = "L. M. L. Delcambre and J. N. Etheredge",
title = "A self-controlling interpreter for the relation
production language",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "396--403",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Center for Adv. Comput. Studies, Southwestern
Louisiana Univ., Lafayette, LA, USA",
classification = "C6160D (Relational DBMS); C6170 (Expert systems)",
keywords = "Conflict resolution; Database systems; Database
updates; Error handling; Expert systems;
Formally-defined production system language;
Interpreter data structures; Paradigm mismatch;
Parallelism; Relation production language; Relational
data model; Relational query; RPL 1.0; Self-controlling
interpreter; Software metrics",
thesaurus = "Expert systems; Relational databases",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Sellis:1988:ILP,
author = "T. Sellis and Chih-Chen Lin and L. Raschid",
title = "Implementation large production systems in a {DBMS}
environment: concepts and algorithms",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "404--412",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci. and Syst. Res. Center, Maryland
Univ., College Park, MD, USA",
classification = "C6160D (Relational DBMS)",
keywords = "Communications; Concurrent execution strategies; DBMS
environment; Engineering processes; Large production
systems; Manufacturing; Matching algorithm; Parallel
computing environments; Relational database management
systems; Rule based reasoning",
thesaurus = "Relational databases",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Carey:1988:DMQ,
author = "M. J. Carey and D. J. DeWitt and S. L. Vandenberg",
title = "A data model and query language for {EXODUS}",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "413--423",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
USA",
classification = "C4250 (Database theory); C6160 (Database management
systems (DBMS))",
keywords = "Abstract date types; ADT functions; Complex objects;
Data; Data model; EXCESS query language; EXODUS;
Extensible database system; EXTRA data model; Generic
set functions; Persistent objects; Query language;
Semantics; Shared subobjects",
thesaurus = "Database management systems; Database theory",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Lecluse:1988:OOD,
author = "C. Lecluse and P. Richard and F. Velez",
title = "{O}\slash sub 2/, an object-oriented data model",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "424--433",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "GIP Altair, Le Chesnay, France",
classification = "C4250 (Database theory); C6160 (Database management
systems (DBMS))",
keywords = "Altair group; Data base system; Inheritance mechanism;
O/sub 2/; Object-oriented data model; Set-and-tuple
data model; Strong typing; Type system",
thesaurus = "Data structures; Database management systems; Database
theory",
}
@Article{Borgida:1988:MCH,
author = "A. Borgida",
title = "Modeling class hierarchies with contradictions",
journal = j-SIGMOD,
volume = "17",
number = "3",
pages = "434--443",
month = sep,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comp. Sci., Rutgers Univ., New Brunswick, NJ,
USA",
classification = "C4250 (Database theory); C6120 (File organisation)",
keywords = "Class hierarchies; Contradictions; Natural subclass;
Object-based language; Query compilers; Run-time
checks; Superclass definitions",
thesaurus = "Data structures; Database theory; Query languages",
xxcrossref = "Anonymous:1988:SIC",
}
@Article{Atkins:1988:NMC,
author = "John Atkins",
title = "A note on minimal covers",
journal = j-SIGMOD,
volume = "17",
number = "4",
pages = "16--21",
month = dec,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:30 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Stat. and Comput. Sci., West Virginia Univ.,
Morgantown, WV, USA",
classification = "C1160 (Combinatorial mathematics); C4250 (Database
theory)",
keywords = "Functional dependencies; Lossless decomposition;
Minimal covers; Relational database; Set theory; Third
normal form",
thesaurus = "Database theory; Relational databases; Set theory",
}
@Article{Guyot:1988:PMD,
author = "Jacques Guyot",
title = "A process model for data bases",
journal = j-SIGMOD,
volume = "17",
number = "4",
pages = "22--30",
month = dec,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:30 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
affiliation = "Centre Univ. d'Inf., Geneve Univ., Switzerland",
classification = "C1160 (Combinatorial mathematics); C4250 (Database
theory); C6160 (Database management systems (DBMS))",
keywords = "Database design; Integrity constraint; Petri nets;
Process model; Refining primitives; Specification
validation; Specification verification;
Synchronization",
thesaurus = "Data integrity; Database management systems; Database
theory; Formal specification; Petri nets; Program
verification",
}
@Article{Schiel:1988:PID,
author = "Ulrich Schiel",
title = "The problem of identification (databases)",
journal = j-SIGMOD,
volume = "17",
number = "4",
pages = "31--36",
month = dec,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:30 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
affiliation = "Dept. de Sistemas e Comput., Univ. Federal da Paraiba,
Campina Grande, Brazil",
classification = "C4250 (Database theory); C6160 (Database management
systems (DBMS))",
keywords = "Abstractions generalization; Aggregation; Description;
Entity relationship; Entity-identification forms;
Events; Grouping; Identification; Keys; Proper names;
Self-identifying entities; Surrogates; Type",
thesaurus = "Database management systems; Database theory;
Identification",
}
@Article{McLaughlin:1988:IMT,
author = "M. E. McLaughlin and K. Bates Hill and D. D. Brown and
M. A. Rogers and A. M. Howell and P. P. Hatch",
title = "An integrated methodology and toolset for database
design",
journal = j-SIGMOD,
volume = "17",
number = "4",
pages = "37--55",
month = dec,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Boeing Co., Seattle, WA, USA",
classification = "C6115 (Programming support); C6160 (Database
management systems (DBMS))",
keywords = "Automated tools; Boyce-Codd Normal Form; Data
modeling; Data structures; Data transaction; Database
design; Logical model information; Relational
databases; Relational DBMS; Software tools; Toolset;
Transaction information",
thesaurus = "Data structures; Database management systems;
Relational databases; Software tools",
}
@Article{Merrett:1988:DME,
author = "T. H. Merrett and Louis Hamel",
title = "Dynamic multipaging in even less space",
journal = j-SIGMOD,
volume = "17",
number = "4",
pages = "56--61",
month = dec,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:30 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
affiliation = "Sch. of Comput. Sci., McGill Univ., Montreal, Que.,
Canada",
classification = "C6120 (File organisation); C6160 (Database
management systems (DBMS))",
keywords = "Addressing algorithm; Database file; Directory
structure; Dynamic multipaging; Even less space;
Multi-attribute access; Storage requirement",
thesaurus = "Database management systems; File organisation;
Virtual storage",
}
@Article{Son:1988:RDM,
author = "Sang Hyuk Son",
title = "Replicated data management in distributed database
systems",
journal = j-SIGMOD,
volume = "17",
number = "4",
pages = "62--69",
month = dec,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:30 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Virginia Univ.,
Charlottesville, VA, USA",
classification = "C6120 (File organisation); C6150J (Operating
systems); C6160B (Distributed DBMS)",
keywords = "Concurrency; Distributed database; Internal
consistency; Multiple sites; Mutual consistency;
Replication management; Synchronization; Transaction
rollback",
thesaurus = "Concurrency control; Distributed databases; File
organisation; Synchronisation; Transaction processing",
}
@Article{Vossen:1988:EDL,
author = "Gottfried Vossen and Jim Yacabucci",
title = "An extension of the database language {SQL} to capture
more relational concepts",
journal = j-SIGMOD,
volume = "17",
number = "4",
pages = "70--78",
month = dec,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:30 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci. and Eng., California Univ., San
Diego, La Jolla, CA, USA",
classification = "C6140D (High level languages); C6160D (Relational
DBMS)",
keywords = "Data definition; Database language; DB2; Relational
concepts; Relational model; Semantics; SQL; SQL/DS;
Syntax",
thesaurus = "Query languages; Relational databases",
}
@Article{Buff:1988:WCR,
author = "H. W. Buff",
title = "Why {Codd}'s rule no. $6$ must be reformulated",
journal = j-SIGMOD,
volume = "17",
number = "4",
pages = "79--80",
month = dec,
year = "1988",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Swiss Reinsurance Co., Zurich, Switzerland",
classification = "C4250 (Database theory); C6160D (Relational DBMS)",
keywords = "Relational database management systems; View update
rule",
thesaurus = "Database theory; Relational databases",
}
@Article{Bernstein:1989:FDD,
author = "P. A. Bernstein and U. Dayal and D. J. DeWitt and D.
Gawlick and J. Gray and M. Jarke and B. G. Lindsay and
P. C. Lockemann and D. Maier and E. J. Neuhold and A.
Reuter and L. A. Rowe and H. J. Schek and J. W. Schmidt
and M. Schrefl and M. Stonebraker",
title = "Future directions in {DBMS} research",
journal = j-SIGMOD,
volume = "18",
number = "1",
pages = "17--26",
month = mar,
year = "1989",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
classification = "C6160 (Database management systems (DBMS))",
keywords = "Application development tools; Database machines; DBMS
extensions; DBMS research; Distributed database
management systems; End user interfaces; Hardware
environment; Language processors; Object-oriented
databases; Operating system; Rule systems",
thesaurus = "Database management systems; Operating systems
[computers]; Program processors; Special purpose
computers; Technological forecasting; User interfaces",
xxcrossref = "Anonymous:1989:WFD",
}
@Article{OHare:1989:ICR,
author = "Anthony B. O'Hare and Amit P. Sheth",
title = "The interpreted-compiled range of {AI}\slash {DB}
systems",
journal = j-SIGMOD,
volume = "18",
number = "1",
pages = "32--42",
month = mar,
year = "1989",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:31 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
classification = "C6150C (Compilers, interpreters and other
processors); C6160 (Database management systems
(DBMS)); C6170 (Expert systems)",
keywords = "Compilation; Database management systems;
Interpreted-compiled range; Rule-based artificial
intelligence",
thesaurus = "Artificial intelligence; Database management systems;
Program compilers; Program interpreters",
}
@Article{AbdelWahab:1989:RLP,
author = "H. Abdel-Wahab and B. Jamison",
title = "The role of linkage-graphs in {Prolog} relational
databases",
journal = j-SIGMOD,
volume = "18",
number = "1",
pages = "43--53",
month = mar,
year = "1989",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Dec 9 16:00:40 MST 1996",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., Old Dominion Univ., Norfolk,
VA, USA",
classification = "C6120 (File organisation); C6160D (Relational DBMS);
C6170 (Expert systems)",
keywords = "Database schema; English-like query; Intelligent
database management systems; Knowledge representation;
Linkage-graphs; Operational data; Prolog query; Prolog
relational databases; Translation algorithm",
thesaurus = "Data structures; Knowledge representation; PROLOG;
Query languages; Relational databases",
}
@Article{Heytens:1989:GED,
author = "Michael L. Heytens and Rishiyur S. Nikhil",
title = "{GESTALT}: an expressive database programming system",
journal = j-SIGMOD,
volume = "18",
number = "1",
pages = "54--67",
month = mar,
year = "1989",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:31 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
affiliation = "MIT, Cambridge, MA, USA",
classification = "C6115 (Programming support); C6120 (File
organisation); C6160 (Database management systems
(DBMS))",
keywords = "CAF; Control abstractions; Expressive database
programming system; GESTALT; MIT; Programming
language",
thesaurus = "Data structures; Database management systems;
Programming environments",
}
@Article{Kocharekar:1989:NRD,
author = "Raju Kocharekar",
title = "Nulls in relational databases: revisited",
journal = j-SIGMOD,
volume = "18",
number = "1",
pages = "68--73",
month = mar,
year = "1989",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:31 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
affiliation = "Int. Bank for Reconstruction and Dev., Washington, DC,
USA",
classification = "C4210 (Formal logic); C6160D (Relational DBMS)",
keywords = "Maybe operations; Null values; Relational databases;
Semantic issues; Three valued logic",
thesaurus = "Many-valued logics; Relational databases",
xxtitle = "Nulls in relational databases: revised",
}
@Article{Pletch:1989:CMC,
author = "Andrew Pletch",
title = "Conceptual modeling in the classroom",
journal = j-SIGMOD,
volume = "18",
number = "1",
pages = "74--80",
month = mar,
year = "1989",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:31 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
affiliation = "Dept. of Comput. Sci., State Univ. of New York, New
Paltz, NY, USA",
classification = "C0220 (Education and training); C6160 (Database
management systems (DBMS))",
keywords = "Complexity; Computer science education; Conceptual
model; Database design",
thesaurus = "Computer science education; Database management
systems",
}
@Article{Salza:1989:ESQ,
author = "Silvio Salza and Mario Terranova",
title = "Evaluating the size of queries on relational databases
with non-uniform distribution and stochastic
dependence",
journal = j-SIGMOD,
volume = "18",
number = "2",
pages = "8--14",
month = jun,
year = "1989",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:31 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
affiliation = "Istituto di Analisi dei Sistemi ed Informatica, CNR,
Roma, Italy",
classification = "C1140Z (Other and miscellaneous); C4250 (Database
theory); C6160D (Relational DBMS)",
keywords = "Analytical results; Attributes; Cardinality;
Independence assumptions; Non-uniform distributions;
Originality; Probabilistic model; Query size
evaluation; Relational databases; Relational
operations; Stochastic dependence",
thesaurus = "Database theory; Query languages; Relational
databases; Statistics; Stochastic processes",
xxcrossref = "Anonymous:1989:ASI",
}
@Article{Kolodner:1989:AGC,
author = "Elliot Kolodner and Barbara Liskov and William Weihl",
title = "Atomic garbage collection: managing a stable heap",
journal = j-SIGMOD,
volume = "18",
number = "2",
pages = "15--25",
month = jun,
year = "1989",
CODEN = "SRECD8",
ISSN = "0163-5808",
bibdate = "Mon Jan 12 08:45:31 MST 2004",
bibsource = "http://portal.acm.org/",
acknowledgement = ack-nhfb,
affiliation = "Lab. for Comput. Sci., MIT, Cambridge, MA, USA",
classification = "C5470 (Performance evaluation and testing); C6130
(Data handling techniques); C6150J (Operating systems);
C6160 (Database management systems (DBMS))",
keywords = "Atomic garbage collection; Collection algorithm;
Database systems; Fault-tolerance; Garbage collected
heap storage; Integrated garbage collection; Media
failures; Recovery algorithms; Stable heap; System
crashes; Transactions",
thesaurus = "Database management systems; Fault tolerant computing;
Software reliability; Storage allocation; System
recovery; Transaction processing",
xxcrossref = "Anonymous:1989:ASI",
}
@Article{Dong:1989:DPD,
author = "Guozhu Dong",
title